dfdZddlZddlZddlmZddlmZddlmZm Z ddl m Z m Z m Z mZmZmZmZmZmZmZmZmZddlmZmZmZgdZeZ ed eed Zn #e $reZYnwxYwe!ed d Z"d Z#dBdZ$dZ%dCdZ&dCdZ'dZ(e)fdZ*dZ+e+Z,dZ-dZ.dZ/dCdZ0dZ1 ddl m2Z3dZ2e1je2_n #e4$re1Z2YnwxYwGdde5Z6dZ7dZ8dDd!Z9d"Z:d#Z;d$ZdCd'Z?dEd(Z@d)d*d+ZAdCd,ZBd-ZCd.ZDd/ZEd0ZFd1ZGd2ZHd3ZId4ZJd5ZKd6ZLdBd7ZMd8ZNd9ZO dd:l mPZQd;ZPeOjeP_n #e4$reOZPYnwxYwd<ZRd=ZSd>ZTd?ZUd@ZVdAZWdS)FaImported from the recipes section of the itertools documentation. All functions taken from the recipes section of the itertools library docs [1]_. Some backward-compatible usability improvements have been made. .. [1] http://docs.python.org/library/itertools.html#recipes N)deque)Sized)partialreduce) chain combinationscompresscountcyclegroupbyisliceproductrepeatstarmaptee zip_longest) randrangesamplechoice)+ all_equalbatchedbefore_and_afterconsumeconvolve dotproduct first_truefactorflattengrouper iter_except iter_indexmatmulncyclesnthnth_combinationpadnonepad_nonepairwise partitionpolynomial_evalpolynomial_from_rootspolynomial_derivativepowersetprependquantify#random_combination_with_replacementrandom_combinationrandom_permutationrandom_product repeatfunc roundrobinsievesliding_window subslicessum_of_squarestabulatetailtake transpose triplewiseunique_everseenunique_justseenT)strictsumprodc"t||SN)r)xys Z/home/feoh/.local/pipx/venvs/poetry/lib/python3.11/site-packages/more_itertools/recipes.pyrHZsAq1A1Ac<tt||S)zReturn first *n* items of the iterable as a list. >>> take(3, range(10)) [0, 1, 2] If there are fewer than *n* items in the iterable, all of them are returned. >>> take(10, range(3)) [0, 1, 2] )listr niterables rGr<r<]s x## $ $$rIc<t|t|S)aReturn an iterator over the results of ``func(start)``, ``func(start + 1)``, ``func(start + 2)``... *func* should be a function that accepts one integer argument. If *start* is not specified it defaults to 0. It will be incremented each time the iterator is advanced. >>> square = lambda x: x ** 2 >>> iterator = tabulate(square, -3) >>> take(4, iterator) [9, 4, 1, 0] )mapr )functionstarts rGr:r:ms xu & &&rIc #Kt|tr7t|tdt ||z dEd{VdSt t ||Ed{VdS)zReturn an iterator over the last *n* items of *iterable*. >>> t = tail(3, 'ABCDEFG') >>> list(t) ['E', 'F', 'G'] rNmaxlen) isinstancerr maxleniterrrLs rGr;r;s(E""3(C3x==1+<$=$=tDDDDDDDDDDDhq11122222222222rIcn|t|ddStt|||ddS)aXAdvance *iterable* by *n* steps. If *n* is ``None``, consume it entirely. Efficiently exhausts an iterator without returning values. Defaults to consuming the whole iterator, but an optional second argument may be provided to limit consumption. >>> i = (x for x in range(10)) >>> next(i) 0 >>> consume(i, 3) >>> next(i) 4 >>> consume(i) >>> next(i) Traceback (most recent call last): File "", line 1, in StopIteration If the iterator has fewer items remaining than the provided limit, the whole iterator will be consumed. >>> i = (x for x in range(3)) >>> consume(i, 5) >>> next(i) Traceback (most recent call last): File "", line 1, in StopIteration NrrT)rnextr )iteratorrMs rGrrsG@ y hq!!!!!! VHa # #T*****rIc@tt||d|S)zReturns the nth item or a default value. >>> l = range(10) >>> nth(l, 3) 3 >>> nth(l, 20, "zebra") 'zebra' N)r[r )rNrMdefaults rGr$r$s  xD))7 3 33rIcbt|}t|dot|d S)z Returns ``True`` if all the elements are equal to each other. >>> all_equal('aaaa') True >>> all_equal('aaab') False TF)r r[)rNgs rGrrs/ A 4== /a//rIc<tt||S)zcReturn the how many times the predicate is true. >>> quantify([True, False, True]) 2 )sumrP)rNpreds rGr/r/s s4"" # ##rIc<t|tdS)aReturns the sequence of elements and then returns ``None`` indefinitely. >>> take(5, pad_none(range(3))) [0, 1, 2, None, None] Useful for emulating the behavior of the built-in :func:`map` function. See also :func:`padded`. N)rrrNs rGr'r's 6$<< ( ((rIc`tjtt||S)zvReturns the sequence elements *n* times >>> list(ncycles(["a", "b"], 3)) ['a', 'b', 'a', 'b', 'a', 'b'] )r from_iterablertuplerNrMs rGr#r#s%  veHooq99 : ::rIcRtttj||S)zcReturns the dot product of the two iterables. >>> dotproduct([10, 10], [20, 20]) 400 )rbrPoperatormul)vec1vec2s rGrrs  s8<t,, - --rIc*tj|S)zReturn an iterator flattening one level of nesting in a list of lists. >>> list(flatten([[0, 1], [2, 3]])) [0, 1, 2, 3] See also :func:`collapse`, which can flatten multiple levels of nesting. )rrg) listOfListss rGrrs  { + ++rIc||t|t|St|t||S)aGCall *func* with *args* repeatedly, returning an iterable over the results. If *times* is specified, the iterable will terminate after that many repetitions: >>> from operator import add >>> times = 4 >>> args = 3, 5 >>> list(repeatfunc(add, times, *args)) [8, 8, 8, 8] If *times* is ``None`` the iterable will not terminate: >>> from random import randrange >>> times = None >>> args = 1, 11 >>> take(6, repeatfunc(randrange, times, *args)) # doctest:+SKIP [2, 4, 8, 1, 8, 4] )rr)functimesargss rGr4r4s9, }tVD\\*** 4e,, - --rIcft|\}}t|dt||S)zReturns an iterator of paired items, overlapping, from the original >>> take(4, pairwise(count())) [(0, 1), (1, 2), (2, 3), (3, 4)] On Python 3.10 and above, this is an alias for :func:`itertools.pairwise`. N)rr[zip)rNabs rG _pairwisery*s. x==DAqDMMM q!99rIr(c t|SrD)itertools_pairwiseres rGr(r(>s!(+++rIc eZdZdfd ZxZS)UnequalIterablesErrorNcld}| |dj|z }t|dS)Nz Iterables have different lengthsz/: index 0 has length {}; index {} has length {})formatsuper__init__)selfdetailsmsg __class__s rGrzUnequalIterablesError.__init__EsI0   MEM C rIrD)__name__ __module__ __qualname__r __classcell__)rs@rGr~r~Ds=rIr~c#rKt|dtiD]"}|D]}|turt|V#dS)N fillvalue)r_markerr~) iterablescombovals rG_zip_equal_generatorrOs`i;7;; . .Cg~~+--- rIc  t|d}t|dddD]-\}}t|}||krt|||f.t|S#t$rt |cYSwxYw)Nr)r)rX enumerater~rv TypeErrorr)r first_sizeiitsizes rG _zip_equalrWs /1&& y}a00 K KEArr77Dz!!+ZD4IJJJJ"I ///#I...../sA#A&&BBfillct|g|z}|dkr t|d|iS|dkr t|S|dkr t|St d)aGroup elements from *iterable* into fixed-length groups of length *n*. >>> list(grouper('ABCDEF', 3)) [('A', 'B', 'C'), ('D', 'E', 'F')] The keyword arguments *incomplete* and *fillvalue* control what happens for iterables whose length is not a multiple of *n*. When *incomplete* is `'fill'`, the last group will contain instances of *fillvalue*. >>> list(grouper('ABCDEFG', 3, incomplete='fill', fillvalue='x')) [('A', 'B', 'C'), ('D', 'E', 'F'), ('G', 'x', 'x')] When *incomplete* is `'ignore'`, the last group will not be emitted. >>> list(grouper('ABCDEFG', 3, incomplete='ignore', fillvalue='x')) [('A', 'B', 'C'), ('D', 'E', 'F')] When *incomplete* is `'strict'`, a subclass of `ValueError` will be raised. >>> it = grouper('ABCDEFG', 3, incomplete='strict') >>> list(it) # doctest: +IGNORE_EXCEPTION_DETAIL Traceback (most recent call last): ... UnequalIterablesError rrrAignorez Expected fill, strict, or ignore)rYrrrv ValueError)rNrM incompleterrts rGrrgso: NN a DVD6I666X4  XDz;<<>> list(roundrobin('ABC', 'D', 'EF')) ['A', 'D', 'E', 'B', 'F', 'C'] This function produces the same output as :func:`interleave_longest`, but may perform better for some inputs (in particular when the number of iterables is small). c3>K|]}t|jVdSrD)rY__next__).0rs rG zroundrobin..s+88$r((#888888rIrN)rXr StopIterationr )rpendingnextsr[s rGr5r5s)nnG 88i888 8 8E 2 2  dff   2 2 2 qLG&0011EEE 2 22222sA,A/.A/c|t}t|d\}}}tt||\}}t|ttj|t||fS)a Returns a 2-tuple of iterables derived from the input iterable. The first yields the items that have ``pred(item) == False``. The second yields the items that have ``pred(item) == True``. >>> is_odd = lambda x: x % 2 != 0 >>> iterable = range(10) >>> even_items, odd_items = partition(is_odd, iterable) >>> list(even_items), list(odd_items) ([0, 2, 4, 6, 8], [1, 3, 5, 7, 9]) If *pred* is None, :func:`bool` is used. >>> iterable = [0, 1, False, True, '', ' '] >>> false_items, true_items = partition(None, iterable) >>> list(false_items), list(true_items) ([0, False, ''], [1, True, ' ']) N)boolrrPr rknot_)rcrNt1t2pp1p2s rGr)r)sg( |Ha  IBA T1  FB RX]B// 0 0(2r2B2B CCrIct|tjfdtt dzDS)aYields all possible subsets of the iterable. >>> list(powerset([1, 2, 3])) [(), (1,), (2,), (3,), (1, 2), (1, 3), (2, 3), (1, 2, 3)] :func:`powerset` will operate on iterables that aren't :class:`set` instances, so repeated elements in the input will produce repeated elements in the output. Use :func:`unique_everseen` on the input to avoid generating duplicates: >>> seq = [1, 1, 0] >>> list(powerset(seq)) [(), (1,), (1,), (0,), (1, 1), (1, 0), (1, 0), (1, 1, 0)] >>> from more_itertools import unique_everseen >>> list(powerset(unique_everseen(seq))) [(), (1,), (0,), (1, 0)] c38K|]}t|VdSrD)r)rrss rGrzpowerset..s-MMa|Aq11MMMMMMrIr)rKrrgrangerX)rNrs @rGr-r-sH& XA  MMMM5Q!;L;LMMM M MMrIc#Kt}|j}g}|j}|du}|D]H}|r ||n|} ||vr|||V&#t$r||vr|||VYEwxYwdS)a Yield unique elements, preserving order. >>> list(unique_everseen('AAAABBBCCDAABBB')) ['A', 'B', 'C', 'D'] >>> list(unique_everseen('ABBCcAD', str.lower)) ['A', 'B', 'C', 'D'] Sequences with a mix of hashable and unhashable items can be used. The function will be slower (i.e., `O(n^2)`) for unhashable items. Remember that ``list`` objects are unhashable - you can use the *key* parameter to transform the list to a tuple (which is hashable) to avoid a slowdown. >>> iterable = ([1, 2], [2, 3], [1, 2]) >>> list(unique_everseen(iterable)) # Slow [[1, 2], [2, 3]] >>> list(unique_everseen(iterable, key=tuple)) # Faster [[1, 2], [2, 3]] Similary, you may want to convert unhashable ``set`` objects with ``key=frozenset``. For ``dict`` objects, ``key=lambda x: frozenset(x.items())`` can be used. N)setaddappendr) rNkeyseenset seenset_addseenlist seenlist_adduse_keyelementks rGr?r?s6eeG+KH?LoG  # 0CCLLL  A       Q    sA  A-,A-c ttttjdt ||S)zYields elements in order, ignoring serial duplicates >>> list(unique_justseen('AAAABBBCCDAABBB')) ['A', 'B', 'C', 'D', 'A', 'B'] >>> list(unique_justseen('ABBCcAD', str.lower)) ['A', 'B', 'C', 'A', 'D'] r)rPr[rk itemgetterr )rNrs rGr@r@s3 tS,Q//31G1GHH I IIrIc#XK | |V |V #|$rYdSwxYw)aYields results from a function repeatedly until an exception is raised. Converts a call-until-exception interface to an iterator interface. Like ``iter(func, sentinel)``, but uses an exception instead of a sentinel to end the loop. >>> l = [0, 1, 2] >>> list(iter_except(l.pop, IndexError)) [2, 1, 0] Multiple exceptions can be specified as a stopping condition: >>> l = [1, 2, 3, '...', 4, 5, 6] >>> list(iter_except(lambda: 1 + l.pop(), (IndexError, TypeError))) [7, 6, 5] >>> list(iter_except(lambda: 1 + l.pop(), (IndexError, TypeError))) [4, 3, 2] >>> list(iter_except(lambda: 1 + l.pop(), (IndexError, TypeError))) [] N)rr exceptionfirsts rGr r s[,  %''MMM $&&LLL       s  ))c>tt|||S)a Returns the first true value in the iterable. If no true value is found, returns *default* If *pred* is not None, returns the first item for which ``pred(item) == True`` . >>> first_true(range(10)) 1 >>> first_true(range(10), pred=lambda x: x > 5) 6 >>> first_true(range(10), default='missing', pred=lambda x: x > 9) 'missing' )r[filter)rNr^rcs rGrr1s" tX&& 0 00rIr)rcRd|D|z}td|DS)aDraw an item at random from each of the input iterables. >>> random_product('abc', range(4), 'XYZ') # doctest:+SKIP ('c', 3, 'Z') If *repeat* is provided as a keyword argument, that many items will be drawn from each iterable. >>> random_product('abcd', range(4), repeat=2) # doctest:+SKIP ('a', 2, 'd', 3) This equivalent to taking a random selection from ``itertools.product(*args, **kwarg)``. c,g|]}t|Srrhrpools rG z"random_product..Us * * *TU4[[ * * *rIc34K|]}t|VdSrD)rrs rGrz!random_product..Vs(00$000000rIr)rrtpoolss rGr3r3Es9 + *T * * *V 3E 00%000 0 00rIct|}|t|n|}tt||S)abReturn a random *r* length permutation of the elements in *iterable*. If *r* is not specified or is ``None``, then *r* defaults to the length of *iterable*. >>> random_permutation(range(5)) # doctest:+SKIP (3, 4, 0, 1, 2) This equivalent to taking a random selection from ``itertools.permutations(iterable, r)``. )rhrXr)rNrrs rGr2r2Ys8 ??DYD AA a ! !!rIct|t}ttt ||}tfd|DS)zReturn a random *r* length subsequence of the elements in *iterable*. >>> random_combination(range(5), 3) # doctest:+SKIP (2, 3, 4) This equivalent to taking a random selection from ``itertools.combinations(iterable, r)``. c3(K|] }|V dSrDrrrrs rGrz%random_combination..x'**Qa******rI)rhrXsortedrr)rNrrMindicesrs @rGr1r1ks[ ??D D AVE!HHa(())G ****'*** * **rIct|ttfdt|D}tfd|DS)aSReturn a random *r* length subsequence of elements in *iterable*, allowing individual elements to be repeated. >>> random_combination_with_replacement(range(3), 5) # doctest:+SKIP (0, 0, 1, 2, 2) This equivalent to taking a random selection from ``itertools.combinations_with_replacement(iterable, r)``. c36K|]}tVdSrD)r)rrrMs rGrz6random_combination_with_replacement..s)44aYq\\444444rIc3(K|] }|V dSrDrrs rGrz6random_combination_with_replacement..rrI)rhrXrr)rNrrrMrs @@rGr0r0{sg ??D D A444458844444G ****'*** * **rIct|}t|}|dks||krtd}t|||z }t d|dzD]}|||z |zz|z}|dkr||z }|dks||krt g}|rS||z|z|dz |dz }}}||kr||z}|||z z|z|dz }}||k||d|z |St|S)aEquivalent to ``list(combinations(iterable, r))[index]``. The subsequences of *iterable* that are of length *r* can be ordered lexicographically. :func:`nth_combination` computes the subsequence at sort position *index* directly, without computing the previous subsequences. >>> nth_combination(range(5), 3, 5) (0, 3, 4) ``ValueError`` will be raised If *r* is negative or greater than the length of *iterable*. ``IndexError`` will be raised if the given *index* is invalid. rr)rhrXrminr IndexErrorr) rNrindexrrMcrrresults rGr%r%s8 ??D D A A1q55 A Aq1u A 1a!e__!! QOq  qyy    uzz F $a%1*a!eQUa1qjj QJEA;!#QUqAqjj  d26l### $ ==rIc$t|g|S)aYield *value*, followed by the elements in *iterator*. >>> value = '0' >>> iterator = ['1', '2', '3'] >>> list(prepend(value, iterator)) ['0', '1', '2', '3'] To prepend multiple values, see :func:`itertools.chain` or :func:`value_chain`. )r)valuer\s rGr.r.s %( # ##rIc#Kt|ddd}t|}tdg||z}t|t d|dz D])}||t ||V*dS)aBConvolve the iterable *signal* with the iterable *kernel*. >>> signal = (1, 2, 3, 4, 5) >>> kernel = [3, 2, 1] >>> list(convolve(signal, kernel)) [3, 8, 14, 20, 26, 14, 5] Note: the input arguments are not interchangeable, as the *kernel* is immediately consumed and stored. NrrrTr)rhrXrrrr_sumprod)signalkernelrMwindowrEs rGrrs6]]44R4 F F A A3q ! ! !A %F 66!QU++ , ,'' avv&&&&&&''rIcptgfd}t}||fS)aA variant of :func:`takewhile` that allows complete access to the remainder of the iterator. >>> it = iter('ABCdEfGhI') >>> all_upper, remainder = before_and_after(str.isupper, it) >>> ''.join(all_upper) 'ABC' >>> ''.join(remainder) # takewhile() would lose the 'd' 'dEfGhI' Note that the first iterator must be fully consumed before the second iterator can generate valid results. c3dKD])}|r|V|dSdSrD)r)elemr predicate transitions rG true_iteratorz'before_and_after..true_iteratorsV  Dy  !!$'''   rI)rYr)rrrremainder_iteratorrs`` @rGrrs^ bBJz2.. =??. ..rIc#hKtt|D]\\}}\}}|||fVdS)zReturn overlapping triplets from *iterable*. >>> list(triplewise('ABCDE')) [('A', 'B', 'C'), ('B', 'C', 'D'), ('C', 'D', 'E')] Nrz)rNrw_rxrs rGr>r>sN#8H#5#566AAAg rIc#Kt|}tt||dz |}|D](}||t |V)dS)aYReturn a sliding window of width *n* over *iterable*. >>> list(sliding_window(range(6), 4)) [(0, 1, 2, 3), (1, 2, 3, 4), (2, 3, 4, 5)] If *iterable* has fewer than *n* items, then nothing is yielded: >>> list(sliding_window(range(3), 4)) [] For a variant with more features, see :func:`windowed`. rrTN)rYrr rrh)rNrMrrrEs rGr7r7ss hB 6"a!e$$Q / / /F  aFmmrIc t|}tttt t |dzd}t tjt||S)zReturn all contiguous non-empty subslices of *iterable*. >>> list(subslices('ABC')) [['A'], ['A', 'B'], ['A', 'B', 'C'], ['B'], ['B', 'C'], ['C']] This is similar to :func:`substrings`, but emits items in a different order. r) rKrslicerrrXrPrkgetitemr)rNseqslicess rGr8r8sU x..C ULs3xx!|)<)>> roots = [5, -4, 3] # (x - 5) * (x + 4) * (x - 3) >>> polynomial_from_roots(roots) # x^3 - 4 * x^2 - 17 * x + 60 [1, -4, -17, 60] r)rvrrPrknegrKrr)rootsfactorss rGr+r+)sA&))Su5566G x1#.. / //rIc#K |j}|dz } |||dz}|V#t$rYdSwxYw#t$rKt||d}|dz } |t j||zdz}|V #t$rYYdSwxYwwxYw)aYield the index of each place in *iterable* that *value* occurs, beginning with index *start*. See :func:`locate` for a more general means of finding the indexes associated with particular values. >>> list(iter_index('AABCADEAF', 'A')) [0, 1, 4, 7] rTN)rrAttributeErrorr rkindexOf)rNrrR seq_indexrrs rGr!r!4sN  AI  IeQU++     DD #     HeT * * AI  (U333a7     DDD  s37& 44 B !A99 BB BB c vtd|dzz}d|dd<tj|dz}tt ||D]?}t t t ||z|||z|||z|||z<@d|d<|dkrt|dntgS)zdYield the primes less than n. >>> list(sieve(30)) [2, 3, 5, 7, 11, 13, 17, 19, 23, 29] )rrr)rrrNrr) bytearraymathisqrtr rbytesrXr!rY)rMdatalimitrs rGr6r6Us V  Q 'DD!H JqMMA E eEllD ) )EE"'E!a%AE,B,B(C(C"D"DQUQQ DG"#a%%:dA   T"XX5rIc#K|dkrtdt|} tt||}|sdS|V&)zBatch data into lists of length *n*. The last batch may be shorter. >>> list(batched('ABCDEFG', 3)) [('A', 'B', 'C'), ('D', 'E', 'F'), ('G',)] On Python 3.12 and above, this is an alias for :func:`itertools.batched`. rzn must be at least oneTN)rrYrhr )rNrMrbatchs rG_batchedr ds` 1uu1222 hBfRmm$$  E rI)rc"t||SrD)itertools_batchedris rGrr|s 1---rIct|S)aSwap the rows and columns of the input. >>> list(transpose([(1, 2, 3), (11, 22, 33)])) [(1, 11), (2, 22), (3, 33)] The caller should ensure that the dimensions of the input are compatible. If the input is empty, no output will be produced. ) _zip_strictrs rGr=r=s  rIc t|d}tttt |t ||S)zMultiply two matrices. >>> list(matmul([(7, 5), (3, 5)], [(2, 5), (7, 9)])) [(49, 80), (41, 60)] The caller should ensure that the dimensions of the input matrices are compatible with each other. r)rXrrrrr=)m1m2rMs rGr"r"s= BqE A 78WR2%?%?@@! D DDrIc#Kttj|dzD]} ||zrn|V||z}|dkrdS|dkr|VdSdS)zSYield the prime factors of n. >>> list(factor(360)) [2, 2, 2, 3, 3, 5] rTN)r6rr)rMprimes rGrrs tz!}}q()) 5y KKK %KAAvv    1uu urIc t|}|dkr|dzSttt|t t |}t ||S)zEvaluate a polynomial at a specific value. Example: evaluating x^3 - 4 * x^2 - 17 * x + 60 at x = 2.5: >>> coefficients = [1, -4, -17, 60] >>> x = 2.5 >>> polynomial_eval(coefficients, x) 8.125 r)rXrPpowrreversedrr) coefficientsrErMpowerss rGr*r*sX LAAvv1u fQii%((!3!3 4 4F L& ) ))rIc.tt|S)zfReturn the sum of the squares of the input values. >>> sum_of_squares([10, 20, 30]) 1400 )rrrs rGr9r9s SWW rIct|}ttd|}tt t j||S)aCompute the first derivative of a polynomial. Example: evaluating the derivative of x^3 - 4 * x^2 - 17 * x + 60 >>> coefficients = [1, -4, -17, 60] >>> derivative_coefficients = polynomial_derivative(coefficients) >>> derivative_coefficients [3, -8, -17] r)rXrrrKrPrkrl)rrMrs rGr,r,sB LA eAqkk " "F HL,77 8 88rI)rrD)rN)NN)X__doc__rrk collectionsrcollections.abcr functoolsrr itertoolsrrr r r r r rrrrrrandomrrr__all__objectrrvrrgetattrrr<r:r;rr$rrr/r'r&r#rrr4ryr(r| ImportErrorrr~rrrr5r)r-r?r@r rr3r2r1r0r%r.rrr>r7r8r+r!r6r rr r=r"rr*r9r,rrIrGr's !!!!!!%%%%%%%%                            -,,,,,,,,,, , , \ &((,Ct'#d+++KKKKK 74$A$A B B % % % ''''$333$%+%+%+%+P 4 4 4 4 0 0 0!$$$$ ) ) ) ;;;... , , ,....6    )888888 ,,,!(HHHHJ / / / %=%=%=%=P222.DDD8NNN.****Z J J J J    >1111("#11111(""""$ + + + +++"'''T $ $ $''',///B( 6 6 6000B 6 6 6$ '666666 ...&GOOGGG    E E E"***" 9 9 9 9 9s6 A..A87A89CCCEE E