ÿØÿà JFIF    ÿÛ „  ( %!1!%)+//.383,7(-.+  -%%-////---/-.+/--+------/------/--0+--/-/-----.-----ÿÀ  ¥2" ÿÄ     ÿÄ J    ! 1AQ"aq2‘#BR‚¡ÁÑ3br’¢±Âð$CSƒ²á4c“%DsÓñÿÄ   ÿÄ *  !1AQa‘"2q3±ð#b¡ÿÚ   ? ¼QxJQaÍuò¸Zö Úü8,ÐÚú "SSn<rçù–´âE—^ªBÖ9À\†¸ÔÁT­ÃÛ5 ëd´³Í#Ý;Þ38œî ¶H£M:wÎ3…³…âpÔF&‚FK¸9„â4àGEõªfÿ ‘ñ(ßw­pŽF|È¥ù®häðÍѶ¹‘[ÒinÙW¶ùñY˜Q{›K"išÒ[Ú8žë\F¹@-?v"ÔU”,ìöžkÿ {I‡£šÍ?e ríV .............................................................................................................................................................................. ............................................................................. ÿØÿà JFIF    ÿÛ „  ( %!1!%)+//.383,7(-.+  -%%-////---/-.+/--+------/------/--0+--/-/-----.-----ÿÀ  ¥2" ÿÄ     ÿÄ J    ! 1AQ"aq2‘#BR‚¡ÁÑ3br’¢±Âð$CSƒ²á4c“%DsÓñÿÄ   ÿÄ *  !1AQa‘"2q3±ð#b¡ÿÚ   ? ¼QxJQaÍuò¸Zö Úü8,ÐÚú "SSn<rçù–´âE—^ªBÖ9À\†¸ÔÁT­ÃÛ5 ëd´³Í#Ý;Þ38œî ¶H£M:wÎ3…³…âpÔF&‚FK¸9„â4àGEõªfÿ ‘ñ(ßw­pŽF|È¥ù®häðÍѶ¹‘[ÒinÙW¶ùñY˜Q{›K"išÒ[Ú8žë\F¹@-?v"ÔU”,ìöžkÿ {I‡£šÍ?e ríV .............................................................................................................................................................................. ............................................................................. ELF> @X@8@@@ KK K  LL L $$PtdL=L=L=QtdRtdKK K 00GNUD<Ű>qD'lV!@ A !#BE|qX< noz{&I Z, F"J90R R _ `4 R __gmon_start___ITM_deregisterTMCloneTable_ITM_registerTMCloneTable__cxa_finalizelibpthread.so.0libc.so.6_Py_DeallocPyModule_GetStatePyUnicode_InternFromString_Py_NoneStructPySequence_SizePy_EnterRecursiveCall_Py_TrueStructPyObject_CallOneArg_Py_FalseStructPy_LeaveRecursiveCallPyLong_FromSsize_t_PyNumber_IndexPyLong_AsSsize_t_Py_convert_optional_to_ssize_tPyExc_ValueErrorPyErr_SetStringPyErr_OccurredPyObject_RichCompareBool_PyArg_UnpackKeywordsPyExc_TypeErrorPyErr_Format_Py_NotImplementedStructPyObject_IsTrue__stack_chk_failPyList_TypePyList_Insert_PyObject_CallMethodPyInit__bisectPyModuleDef_Init_edata__bss_start_endGLIBC_2.2.5GLIBC_2.4eui ii K 3K 3K K L 5L 5L  5L  5 L 5@L 5HL 5PL  5XL  5`L 5L 5L 5L  5L  5L 5L 5L 5L  5L  5L 5P 04@P 4HP XP @:`P 4hP "xP 8P 4P P 6P 4P *P `5Q 5Q @< Q @P (Q P 8Q 3@Q  4pQ L xQ 4Q L Q 40R @L 8R 4R L R 4O O O  O  O O O O O O O  N O O O O  O (O  0O  8O  @O HO PO XO `O hO pO xO O O O O O HH1? HtH52> %4> @%2> h%*> h%"> h%> h%> h% > h%> h%= hp%= h`%= h P%= h @%= h 0%= h %= h %= h%= h%= h%= h%= h%= h%= h%= hHH!!IM)6 L) LPH5" L׉D$(D$(LHD$(oH|$(LD$(YD$(HI)t&IHIHVLIHH7tI?xHII?]IIHH/tI H5!; IM!t$II܅n Ld< LT$ LzL7 D$(gD$( H LHD$(CHL$(U IMpL$cLD$(D$( L L; LD$A ILILqHdL|$HIDH|$5MH׉D$8D$8#IL HjHH(HPLCWHωD$(2D$(LL$IM9:gIL0HH: @LD$(D$(HsLD$HIaL1H5HH0^HQLD$8~D$8%H5ILtCI/AHI/4IL t'IDHI7HH H׉D$ D$ HH0HHL$HL$HHD$LD$FM>E+HD$IL8H1HLwLD$ sD$ HH(t]MEH5iIL(SH/H9 Ht$HHH }HHH(HHL$HL$HyIILtXM'EH5IL pHHL$HL$YHLT$jLT$DHXHILAf.fAWAVAUATIUSHHxdH%(HD$h1HqHD$8HjHHHI$IL$HT$HL$H;L7 Ld$8LT$IuH|$IHL\$M{MohM_IEHD$ HMH=<mH\$LsMI9kff.J\%L|$ H|$HHAIHHt$H;56 uhM#L9pH|$1HAH=6 IH9H7ME-IMH9IfH|$HyHHFME2ML;w1HH|$(H|$AH=%6 L|$(IH9i@L; 5 OI)Ix{HIthHkI9)@LH9Aff.@{HHL$hdH3 %(Hx[]A\A]A^A_LHkL9YII|$H^IH HI6HŅHHt&I|$H Ht$8tHHL4 LD$Ld$8HQL 4 H5I9rH1LHH|$(H|$1+L|$(wIyztI HkHD$8LiIImPHLAL5 1LHD$HPjjvH IHm1|IMHIyMgpMqI|$H5!HHEH 3 IW1H9IVML; t3 t5LLL$(uLT$(MEIMM)EH|$1LE1HI6HqHCHL>I|$ H|$ H1ff.AWAVIAUATIUSHxdH%(HD$h1HHD$8LzH)H:H1HHVHD$HT$MI|$HIHHI}HŅGHcII|$HHt$8ILd$8HpL 1 LL$I-HL$HYLshMAM~M4H=9I9:LL$MQLT$ MJ\%H|$HHAIHL\$L;O1 umM HD$ I9FL1Ht$AH=)1 IH9L; 0 M!EuIH9IfH|$HHHJIM}Ht$ H;qnH1Ht$HL$(AH=0 Lt$(IH9efH/InHkI9(HHL$hdH3 %(Hx[]A\A]A^A_HD$8HiHL}PLA1LF2 Ht$HVLjj4H IHHHXIHL$H\$MXH5/ Ld$81Ht$ILl$L=IH*I]LshMLcpMI|$H5H=HEL4/ HS1I8FLHt$1HHL$(Lt$(MEu>IL9HIuL HkHIIuLHkHI1I|$HtYHt$8atDIuEH. HD$Ld$8HHN. H5/H:H1M\$ L\$IM(5ML; - tzLLL$(H|$(LEILHI}HtIMwHeIM4HMEHt$1LE1`PLh HRfDAWAVAUATUSHHHH|$ dH%(HD$x1HnHD$HHjHH>H5L{L3L|$HLIHMVIBhHHHHL$HH=cIWHT$LMJ\%LHD$HHIHh1HH|$M]L\$L;XNAH;3, u1L EMENIMH9~EIfH;+ hLEI?HI?HkI9BL-+ M9nuzHT$HLZH+ HL$xdH3 %(3HĈ[]A\A]A^A_ff.LxGLHkdL9tH|$ LD$HLH0H 10HL0E H* ^zMEuHkLH9HD$HLaIIl$PALz, 1H|$XWHjjH HH8HpL0Ht$Hu|Ld$HIuLIHMVIBhHjLhLl$MXH=L|$IH|$LI9q*IH{I1HH{HLK L; ) Ld$HLL$0Ht$H|$0HD$HTHIuLIHQMVMZhMI[H\$(HH=@H|$wHwHt$LL9hf.J\%LHD$(HHIHH|$0HHD$8LL$8HIME1LH|$ML\$M;_|AH;( L E#MEJIIMI9M(Ll$I]AH1Ht$HtIULd$HHL ' H5 I9K1cHkLIHt[HSMEHEy0HtAMI}LD$M8EIMEu]I+H4HMrpM I~H5 H HEH !' IR1H93HT$HmL\$IXIM&&L 1RH & H5 H9Ht$HH;& u;H(_Ix HItHk%LLHH;4& t>HHD$85HT$8H:x HH:xAMEy+tIH0H|$1LE1IMuMLL$H|$ Lt$IIjpH.H}H5 L%R IEH% IR1H;1HH;K% t4HHD$(LHL$(H1rHH1e,uLEH|$1LE18IMKBdAWAVAUATIHUSHH|$dH%(HD$x1HHD$HHjHHMID$M,$IH$H$L IHIMHqhHLFLD$MrH=; EL9H<$LwLt$MJ\%L|$LHHAIHd1H4$HM1LT$L;P"AH;# It>H;# LEM'E2H9~TI|ff.H(;MEHkI9L7Hy1:ff.H=\# I9}u@H$HLxH# HL$xdH3 %(rHĈ[]A\A]A^A_H|$TL$HLH0H1HnL(EH" FI7uH9%IMuLHkLIM'uLI|$1HI|$HI|$ H;=2" Ld$HH|$0H4$H|$0,HD$HHIMEMHhMMQLT$(MH=Lt$&IVHHT$ LL9'J\%LL|$(HHAHH*H|$0HHD$HL$HIH9y1Ht$LM2LL$ M;H#LD$AH;"! HL$H; qL ELE(I>HD$HLqIInPLALe# HT$XR1jjH IHBHHL(H $H,Ld$HI GHL$HH13LIHHLt$M>EH(HL Ey=HkLLD$LT$AEI:EIL uHILHHI7?Ht$HT*H Id ]wHtHxHH7DQJH8HtHH1Zff.ff.S H=CHHH[ff.H=y dHHinsert%.200s is not a sequencelo must be non-negative in _bisect.bisect_right in _bisect.bisect_leftnOinsort_rightinsort_leftaxlohikey_bisect'%.200s' object does not support indexinginsort_left($module, /, a, x, lo=0, hi=None, *, key=None) -- Insert item x in list a, and keep it sorted assuming a is sorted. If x is already in a, insert it to the left of the leftmost x. Optional args lo (default 0) and hi (default len(a)) bound the slice of a to be searched. A custom key function can be supplied to customize the sort order.bisect_left($module, /, a, x, lo=0, hi=None, *, key=None) -- Return the index where to insert item x in list a, assuming a is sorted. The return value i is such that all e in a[:i] have e < x, and all e in a[i:] have e >= x. So if x already appears in the list, a.insert(i, x) will insert just before the leftmost x already there. Optional args lo (default 0) and hi (default len(a)) bound the slice of a to be searched. A custom key function can be supplied to customize the sort order.insort_right($module, /, a, x, lo=0, hi=None, *, key=None) -- Insert item x in list a, and keep it sorted assuming a is sorted. If x is already in a, insert it to the right of the rightmost x. Optional args lo (default 0) and hi (default len(a)) bound the slice of a to be searched. A custom key function can be supplied to customize the sort order.bisect_right($module, /, a, x, lo=0, hi=None, *, key=None) -- Return the index where to insert item x in list a, assuming a is sorted. The return value i is such that all e in a[:i] have e <= x, and all e in a[i:] have e > x. So if x already appears in the list, a.insert(i, x) will insert just after the rightmost x already there. Optional args lo (default 0) and hi (default len(a)) bound the slice of a to be searched. A custom key function can be supplied to customize the sort order.Bisection algorithms. This module provides support for maintaining a list in sorted order without having to sort the list after each insertion. For long lists of items with expensive comparison operations, this can be an improvement over the more common approach. ;d$l h4 8LzRx $pFJ w?;*3$"DXl$AbzRx %A[`$BBB B(D0A8Gq 8A0A(B BBBA #^BBI$zRx ,`zBBE B(D0A8D 8A0A(B BBBA UXEBIe`_BBB B(A0A8M 8A0A(B BBBL UEBI$zRx ,`l$BBB B(G0A8G 8A0A(B BBBA )VDBIt 33K 55 5 5555 5 5555 5 5555 5 55Ue  l4K K o(  N  ooooNo2L &6FVfv044@:4"8464*`55@<@P P 3 4L 4L 4@L 4L 4GA$3a1y4_bisect.cpython-312-x86_64-linux-gnu.so-3.12.13-2.el8_10.x86_64.debug`7zXZִF!t/]?Eh=ڊ2N.Ɠ5[XPX>{A*!aR1MűS=>Y L9X3`Qnzջ)0+2ݛcODH4q,{ `C.҇&*_T1ޟ@oE-ֆޚ|UB$'^Sd$q_]ɓ/T|M]]JO}TCh@s)nП]*;XR@9;7n SM/'z-.yX^ˑnMZsS \QG)}m\.+HJe.LN^uh(Oa5p/\YwNnaybXߤ^vt}_cÚxpֺy|k$B*C噩p=7^ڧe♗zd4+x8j3v[w33rS%j[JH@(yMK|qVG,<T _P(\,3s•VFTp'%ZrˀP ltӫKAqfBj7UPB] is_V`jk@QG-₠wkR/t"@kS>)s[ip}k(s#1Ire˺ny4p0nDA/t@4~6(_h R&e.?2Oli;zhL CRq:tCƋ Xץ戟n 9zA8g8Oy,mItm7ٸa9wk ޑ>TXOXj6B;`7%(Sy7RTL٠*ŋs sEgYZ.shstrtab.note.gnu.build-id.gnu.hash.dynsym.dynstr.gnu.version.gnu.version_r.rela.dyn.rela.plt.init.text.fini.rodata.eh_frame_hdr.eh_frame.init_array.fini_array.data.rel.ro.dynamic.got.data.bss.gnu.build.attributes.gnu_debuglink.gnu_debugdata $o4( ((x08oNNJEo0T^Bhcpn  L"tl4l4 z44 L=L===$K KK KK K L LN N P P R RR`R$RL8SV