ELF>@ @8@oo {{'{'X[@t ||'|'$$Ptd...ddQtdRtd{{'{'GNUt'Pa%,.a MA@04"@AVD( 6!Q@!PQ "T@ ((#Da@ @0D 1"lP Xk/}+*P{`ns`cD\~\ ?{KF'3}0SS( }dFܽڃ1<\=tk s(y= aqғmRg# t#CESND`GCYdh.G/6 $a 讋Rm(MFZH)0w}vؔqX|i9jQfc; e䞓e$#AtmdA 9pPe75/ q3`%gl HkΑ3"9{Oj~3^ULJݼWaڟXJ= , v l  /  ; v s n O  Nx; 1 } P=v1 [ :& o )N x     a> -~(  /s[ p a c J #     Mb8  ? 2g 6 gR"L ])jM   y 04 @p( l"   7 `Z8 o  0B h(0  y  z%& pp  y 0/  @ ( PsS  ` l'   *  z  zI1 p  ~  0j   Pq&} `  PtY G   p}9 KS `' Їu@) ^7 Na >  nWl U   s}~ q   `W  ~q m&q m> p   @: O j/d Pm?  y~   |@)() q/ 09H `)h   PNF  {9 @z9 0 p Ќ? k s Ц`g  0|2  y /  P,   }Q7  `^  b  0z _ < 0/u   pW p&J @9 m 3 ЋS   G g  @o__gmon_start___init_fini_ITM_deregisterTMCloneTable_ITM_registerTMCloneTable__cxa_finalize_Py_NoneStructPyBaseObject_TypePyThreadState_Get_Py_CheckRecursionLimitPyObject_Call_Py_CheckRecursiveCallPyErr_OccurredPyExc_SystemErrorPyErr_SetStringPyObject_GetAttr_PyThreadState_UncheckedGetPyFrame_NewPyEval_EvalFrameExPyExc_DeprecationWarningPyErr_WarnFormatPyExc_TypeErrorPyErr_FormatPyExc_OverflowErrorPyLong_AsLongPyLong_Type_PyType_LookupPyExc_AttributeErrorPyErr_SetObjectPyErr_NormalizeExceptionPyException_SetTracebackPyObject_GC_UnTrackPyObject_CallFinalizerFromDeallocrandom_intervalmemcpyPyObject_GetAttrStringPyExc_ValueErrorPyOS_snprintfPyErr_WarnExPyDict_SetItemStringPyErr_ExceptionMatchesPyErr_ClearPyDict_GetItemStringPyModule_GetNamePyExc_ImportErrorPyCapsule_IsValidPyCapsule_GetNamePyCapsule_GetPointerPyModule_GetDictPyDict_NewPyImport_ImportModuleLevelObjectPyList_NewPyInterpreterState_GetIDPyModule_NewObject_Py_TrueStruct_Py_FalseStructPyFloat_TypePyObject_RichComparePyUnicode_TypememcmpPyObject_IsTrue_PyUnicode_ReadyPyExc_KeyErrorPyTuple_PackPyList_TypePyTuple_TypePyLong_FromSsize_tPyObject_GetItemPyDict_NextPyUnicode_ComparePyTuple_NewPySlice_NewPyEval_EvalCodeExPyExc_NameErrorPyExc_StopIterationPyErr_GivenExceptionMatchesPyFunction_TypePyCFunction_TypePyTraceBack_Here_PyObject_GetDictPtrPyObject_NotPyObject_SetAttrPyUnicode_FromStringPyCode_NewPyUnicode_FromFormatPyMem_Realloc_PyDict_GetItem_KnownHashPyMem_Malloclegacy_waldPyDict_Sizerandom_rayleighlegacy_lognormalrandom_logisticrandom_gumbelrandom_laplacelegacy_powerlegacy_weibulllegacy_paretorandom_vonmiseslegacy_standard_tlegacy_standard_cauchylegacy_noncentral_chisquarelegacy_chisquarelegacy_noncentral_flegacy_flegacy_gammalegacy_standard_gammalegacy_normallegacy_gausslegacy_standard_exponentiallegacy_exponentiallegacy_betaPyDict_SetItemrandom_standard_uniform_fillPyDict_TypePyDict_GetItemWithErrorPyNumber_AddPyNumber_InPlaceAddPyNumber_IndexPyLong_AsSsize_tPyExc_IndexErrorPyMethod_TypePyLong_FromLongPyObject_SetItemPyFloat_FromDoublePyExc_RuntimeErrorPy_GetVersionPyFrame_TypePyBytes_FromStringAndSizePyUnicode_FromStringAndSizePyImport_AddModulePyObject_SetAttrStringPyUnicode_InternFromStringPyUnicode_DecodePyObject_HashPyLong_FromString__pyx_module_is_main_numpy__random__mtrandPyImport_GetModuleDict_Py_EllipsisObjectPyType_ReadyPyCapsule_NewPyImport_ImportModulePyType_ModifiedPyCapsule_TypePyExc_ExceptionPyCFunction_NewEx_PyDict_NewPresizedPyDict_Copyrandom_uniformPyFloat_AsDoublePyObject_IsInstancePyEval_SaveThreadrandom_positive_intPyEval_RestoreThreadPyObject_SizePySequence_ListPyNumber_MultiplyPyList_AsTuplePyList_AppendPyObject_GetIterPyNumber_Longrandom_triangularPySequence_Containslegacy_random_multinomialPySequence_TuplePyBool_TypePyUnicode_FormatPyNumber_Remainderlegacy_random_binomiallegacy_random_logserieslegacy_random_hypergeometriclegacy_random_geometriclegacy_random_zipflegacy_random_poissonlegacy_negative_binomialPyNumber_InPlaceTrueDividePyNumber_SubtractPyInit_mtrandPyModuleDef_Initlogsqrtpowexp__isnanrandom_binomial_inversionrandom_binomial_btpefloorrandom_loggamrandom_standard_uniform_frandom_standard_uniformrandom_standard_uniform_fill_frandom_standard_exponentialrandom_standard_exponential_fillrandom_standard_exponential_fexpflogfrandom_standard_exponential_fill_frandom_standard_exponential_inv_fillrandom_standard_exponential_inv_fill_frandom_standard_normalrandom_standard_normal_fillrandom_standard_normal_frandom_standard_normal_fill_frandom_standard_gammarandom_standard_gamma_fpowfsqrtfrandom_positive_int64random_positive_int32random_uintrandom_normalrandom_exponentialrandom_gammarandom_gamma_frandom_betarandom_chisquarerandom_frandom_standard_cauchyrandom_paretorandom_weibullrandom_powerrandom_lognormalrandom_standard_trandom_negative_binomialrandom_noncentral_chisquarerandom_noncentral_frandom_waldacosfmodrandom_geometric_searchrandom_geometric_inversionceilrandom_bounded_uint64random_buffered_bounded_uint32random_buffered_bounded_uint16random_buffered_bounded_uint8random_buffered_bounded_boolrandom_bounded_uint64_fillrandom_bounded_uint32_fillrandom_bounded_uint16_fillrandom_bounded_uint8_fillmemsetrandom_bounded_bool_filllibm.so.6libpthread.so.0libc.so.6_edata__bss_start_endGLIBC_2.2.5Q ui kui {'@{'{'{'`)@)p)x))))))))))))X)ȇ))))))))))))))@))H))P))X)H))))))))))))))))X))X))))))) ))()X)0))@))H))P))`))h))p))x))))))))ȉ))Љ)))))))) ))())0))@))H))`))h)))))))X))X))))X)Ȋ)X)Њ)))X))X))))))))) )X)())@))H)X)P))`))h))p))x)))P))H))))P)ȋ)H)Ћ)))))))))) )H)())@))H)8)P))X))p)H)x)))))))))h))))P))))))8))) )@)@))H)@h))p))))))))))p)))0))8)X))`) )x)) )p))Ў)h)؎))`)) )X)()H)P)P)p)H)x) )@)) )8)ȏ)`i)0))`)()) i8) )@)`))h)@)))h)))ؐ)))h)))@())0)P))X)`hx))) h)))`ȑ))Б)g))) )) )@))H)h))p)))))))`))) ))) 0))8)X))`)`)x)))p)) Г)h)ؓ))`)) )X)()`H)P)P)p)H)x))@))`)8)Ȕ)g)0)) )())8) )@)`))h)))))))`ؕ))))))())0)P))X)x))))))Ȗ))Ж)@))) )) )@))H)`gh))p)`)))x)))))))))0))8)X))`))x)) g)p))И)h)ؘ))`))f )X)()tH)P)P)pp)H)x)X)@)))8)ș)N)0)))())l8) )@)s`))h).)))H)))ؚ)))l)))())0))P))X)x))))))$ț))Л)$))))) )@))H)Xh))p)))))))B)))B)))U0))8)X))`))x)))p))Н)h)؝))`)) )X)()H)P)P)p)H)x)`L)@))e)8)Ȟ)e)0)) @)())88) )@)`))h)^))))))؟)))h)))@())0)P))X)Wx))))))Ƞ))Р),))),)) )&@))H)&h))p))))))) )))d)))P0))8) X))`))x))P)p))Т)h)آ)`)`))  )X)()H)P)P)pp)H)x)p)@)))8)ȣ))0)) 2)())8) )@)`))h))))I)))ؤ))))))@&())0)P))X)x))))))ȥ))Х)\))))) )@))H)h))p)x)))B)))B))) )))0))8)X))`))x)))p))Ч)h)ا))`)); )X)()0H)P)P)p)H)x))@)))8)Ȩ))0)))())p8) )@)`))h)))))))ة))))))@())0)P))X)x))))))Ȫ))Ъ)X)))%)) )@))H)Th))p)T)))h)))h)))`)))0))8)X))`)0)x)))p))Ь)h)ج))`))  )X)()PH)P)P)Pp)H)x))@)))8)ȭ))0)))())`8) )@)`))h)))))))خ))))))())0)P))X)Lx))))))ȯ))Я)))))) )@@))H)h))p)))))))X))))))0))8)X))`)`)x))`)p))б)h)ر)@)`))@ )X)() H)P)P)p)H)x))@)))8)Ȳ))0)))())8) )@)`))h)))))))@س))))))())0)`P))X)x))))))ȴ))д)))))) )0@))H)0h))p)))))))))) ~)))}0))8)PX))`)P)x)))p))}ж)h)ض))`)) )X)() H)P)P)xp)H)x))@)))8)ȷ))0)))())8) )@)n`))h)P)))P)))ظ))))))H())0)HP))X)x)))p)))Hȹ))й)))))) )@`@))H)h))p)@)))p)))))))))0))8)X))`))x)))p))л)h)ػ))`))` )X)()@H)P)P)@p)H)x)T)@)))8)ȼ))0)))())8) )@)`))h)`)))`)))Iؽ))))))())0)@P))X)x))))))Ⱦ))о)))))) )h@))H)hh))p)?))))))8)))0))) 0))8)XX))`))x)))p)))h)))`)) )X)()H)P)P)p)H)x))@)))8)))0))@=)())8) )@)`))h)=)))))))))()))(())0)P))X)x)))))))))))))) )~@))H)Ph))p)P))))))))))))0))8)X))`))x))|)p))@)h))@)`))t )X)()H)P)P)p)H)x) /)@)))8)))0))P)()).8) )@)@`))h) )))H))) )))7)))y())0)pP))X)x)))3)))))))))))) ) @))H)yh))p)))))))))))))0))8)X))`))x)))p)))h))8)`))8 )X)()H)P)P)jp)H)x)j)@))i)8))e)0))e)())(8) )@)`))h))))@))))))z)))`())0)`P))X))) )) )()8)px)))0))) ) H)`)X)))0)p)N))!`)]h))j))w)0))PY))){))`))))@y) )W()8)r)@)PH) X)q)`)Kh)x)k))?)) c))6)) _))b))Y)))0')`N))))K) )G()8)?)@)QH)X)`2)`)h)x)-)))0)`%)))`)@))&)0})`))/)y))))v)( ) ()s8)(@)H) pX)(`) h)0lx)())Pi)())e)())c)())`)())P])( )()pZ8)(@)H)WX)@y(`)h)Tx)k())0Q)]())M)J())0J)>())F),())D)"( )()@8)(@)H)wX)@ (`)*h)Ox)`')!))'))Ц)@'))У)') )Р)@')))' )()~8) '@)kH)PX)'`)h)Px)`'))P) ')))')))')1))' )J()8)'}'}'}'}'~' ~' ~'~' ~' (~'0~'8~'@~'H~'P~'X~'$`~'*h~'+p~',x~'-~'~'~'~'~'~'~'I~'K~'L~'M~'Q~'~'V~'~'_~'''f'h' '('0'j8'k@'lH'P'nX'o`'ph'p'qx''w''z''''|'''''''''' '('0'8'@'H'P'X' `'h'p'x''''''''''Ȁ'Ѐ'؀''''''''' ' ('0'!8'"@'H'#P'X'%`'&h'p''x'(')'''.'/'0'1'2'3ȁ'4Ё'؁'5''6'7'8'9':';'< '=('>0'?8'@@'AH'BP'CX'D`'Eh'Fp'Gx'H'J'N'O'P'R'S''T'UȂ'Ђ'W؂'X'Y'Z''['\']'^' '`('a0'b8'c@'H'P'dX'e`'h'gp'x''i'm'''''r's'tȃ'uЃ'v؃''x'y'{'}'~''' '('0'8'@'H'P'X'`'h'p'x''''''''''Ȅ'Є'HggH5&%&@%&h%&h%&h%&h%&h%&h%&h%&hp%&h`%&h P%&h @%&h 0%&h %&h %&h%z&h%r&h%j&h%b&h%Z&h%R&h%J&h%B&h%:&hp%2&h`%*&hP%"&h@%&h0%&h % &h%&h%&h%&h %&h!%&h"%&h#%&h$%&h%%&h&%&h'p%&h(`%&h)P%&h*@%&h+0%&h, %&h-%&h.%z&h/%r&h0%j&h1%b&h2%Z&h3%R&h4%J&h5%B&h6%:&h7p%2&h8`%*&h9P%"&h:@%&h;0%&h< % &h=%&h>%&h?%&h@%&hA%&hB%&hC%&hD%&hE%&hF%&hGp%&hH`%&hIP%&hJ@%&hK0%&hL %&hM%&hN%z&hO%r&hP%j&hQ%b&hR%Z&hS%R&hT%J&hU%B&hV%:&hWp%2&hX`%*&hYP%"&hZ@%&h[0%&h\ % &h]%&h^%&h_%&h`%&ha%&hb%&hc%&hd%&he%&hf%&hgp%&hh`%&hiP%&hj@%&hk0%&hl %&hm%&hn%z&ho%r&hp%j&hq%b&hr%Z&hs%R&ht%J&hu%B&hv%:&hwp%2&hx`%*&hyP%"&hz@%&h{0%&h| % &h}%&h~%&h%&h%&h%&h%&h%&h%&h%&h%&hp%&h`%&hP%&h@%&h0%&h %&h%&h%z&h%r&h%j&h%b&h%Z&h%R&h%J&h%B&h%:&hpAVEAUIHATIUHSHHHH@u H&HLH5H816mLK M9s#H\&MHLH5|H81 AAuMM9vHIPLIAQHML1i1L1MZYyH u HCHP01HH[]A\A]A^AVEAUIATIHUSHt5H;>&Hu1AtHLLH u)HCHP0H&H8~t1[]A\A]A^AWIAVIAUIH5"ATIUSAP$HLHHHHu(LMLH5#HH&H81xLHru9HLH IMLHH&H5 H81w0LHzIHtH1HPHHuHCHP0H u HCHP0Z[]A\A]A^A_AWIAVIAUIH5!ATIUSAP!HLHHHHu(LJLH5HH&H81xLHou9HLHIMLHH&H5H81t0LHwIHtH1HPHHuHCHP0H u HCHP0Z[]A\A]A^A_AUIATUSQHxH&HuH&Ht"H9tH3&H5<H8t1H4)HtHH5F LIHtHJI $Hu ID$LP0HtHIHAH HLHxkAH LLHxHAH LLHex%E1H LLHExHHMHEHP0ZH[]A\A]AVAUATUSHHH3)Ht)1H9XH&H5 H8!XLd$0A1H LLl$8H LH1D$88D$0u D$:8D$2t?Hl$@1MH HL"L1He_SH&1H@ HHu2)H2)HCS1H=H[2)H6S1H=H0SHHHV2)HB2)HSHH=H2)HSHH=kH1)HSHH1)H5A ZH=1)AH(KL3MtvC C!H{t7{"t $I7HCHSHpHt 1IIHCHpIHH8HVH|VH(WmH#)H^V$PH")HAV$3H")H$V1LH")H V2H{")HU11H=ZHS")HUHH2")HUH&8HHQH5Z H)HH=,)oH%/)HAZAH=(0)tHH=0)tH DDH=KzH=/)Ht9HH/)u)HGP0 1HuH5&H5H8v1H=/)THk')H5&)H=/)AZAGHp/)H5ZHAZAH=()nH .)HH=+)xnH-)HH=+)\nH-)HH=#)@nHH=p-)+nH-)HH= -)nHh-)HkH=#)mHVH= -)mH/-)H:H=,)mH -)HH5&)1H)HuAZAH5,)1_H)HtH5t))1@Hi)HtH,)H5~')1H;)HtH5 )1H)HhH5 )1H)HEH5y!)1H)H"H)H5'')1H)HH)H5&)1aHR)HHڻ&1HHH5H)HH+)H5+)1 H)HxHL)H5U)1H)HNH5()1H)H+H5()1Hd)HH5()1xH9)HH5y()1UH)HH5")12H)HH5;()1H)H|H5H!)1H)HYH5-!)1Hb)H6H5 )1H7)HH5))1H )HH5|))1`H)HH5))1=H)HH5*)1H)HH5')1H`)HdH5#)1H5)HAH5")1H )HH5")1H)HH5!)1kH)HH5!)1HH)HH5$)1%H^)HH5n!)1H3)HoHHHH)HQH5$)1H)H.H*()H53$)1H)HH5$)1tH)HH5e)Hڿ1NH_)HH5)1+H4)HH5$)1H )HuHq&H5R)1H)HKH5o)1H)H(H5)1H)HH5)1uHH )H5$)1RHH')L ')VA111AQh5))5S)RRPRR HPH|H` )H5#)1HYHm')L ^')QA111AQh54)5)RRPRRHPHHk)H tMH')HVH=o)HL$~D$HD$D$)3)>xiH=&)11Hl)H-5)HHt?H5A)HH^HxHHu/HCHP0#HHu HCHP0A$ZAXH5$)H=z&)H)xH)H=H=%)HH:KA`HHH5H H u HCHP0H=zHHJA HH|H5MZH H u HCHP0H=)6HHJA HH3H5 HS H u HCHP0H=HHGJA`HHH5H$)HAH HHH5HA0HHH5]Hn$)HAPHH}H5W,H5$)HoAHHTH5&HEH u HCHP0H=/HH9IA`HH$H5HA@HHH5HHH5Q)HH1HIHu HuH&H5H8VHMu HEHP0M`AHHH5DH6H u HCHP0H=fHH;HH cHn")HH5`H >HA")HH54H 7H")HH5/H u HCHP0H=2HHGH H ")HH5tH H!)HH5OwH H!)HH5*RH H!)HH5-H cHl!)HH5H >H?!)HH5pH H!)HH5WH H )HH5>qH H )HH5%LtH u HCHP0H=\HHBFH HL )HH5(H H )HH5H H)HH5H H)HH5H 7H)HH5lH :Hk)HH5GoH 5H>)HH5{"JH (H)HH5[%H H)HH5GH u HCHP0H=)11PHH@H5)H=)H4zHMu HEHP0H=)11OHH@H5q)H=R)HAHMu HEHP0H=)11rOHHb@H5)H=)HHMu HEHP0HH/@H;)HHH.)HEHH=@)NHHHMu HEHP0HCL%)HHLHtHHHHέ&H89H&LH5 A`ZAH817>A6ZAABZAANZAE1A]ZA}H|$HHD$H|$ HHD$ H|$(HH)HH>H\)H55)HH8H u HCHP0H=()cHt&H=)HH)eHH>H5[)H=)HU8H u HCHP0H)H )H9H/H )H HH )H2>H5c)HSFHH8H u HCHP0H59)H=j)HAZAHMu HEHP0M IIFLP0H AHCHA%ZAP0H @HCHA&ZAP0H @HCHA'ZAP0H5")H=)H;6HMu HEHP0H u HCHP0HD$HD$ HD$(HD$0HD$8HD$@HL$(HT$ HHt$ICH= HH{H5 H8HMHu HEHP0HuHY&H5v H89H&H9Ct.H&H5H8bH  HCHP01HH H)u HCHP0Hs)HuH&H5 H8= HE)t& H5}Hd&H812 H )w' H5H(&H81HAŅuH&H5H81!H&H5H81Hէ&I\$XH(H9HuRrKHEHLu1I9~H;\HE1M9~JtH9kHC@HFHsd@t[HXHtHJ1H9~HH0H u HCHP0H5)H=)H,HMu HEHP0H)H )H9Hu)H)Ht HH-).H= )THH= )Hk)H5l)HHN6H5)H<>HH<,HMu HEHP0H5)H=R)H/H u HCHP0H,)H )H9Hu)H)Ht HH).H=X )[SHH=G )H)H5)HH5H5)H=HHs/H u HCHP0H5)H=)H0h+HMu HEHP0Hq)H )H9Hu)H)Ht HH-).H=)RHH=)H)H5)aHH4H5 )H<HH*HMu HEHP0H5 )H=)Ht.H u HCHP0H)H O)H9Hu)H:)Ht HH+).H=)QHH=)H )H5 )HHP4H5 )H <HH.H u HCHP0H5i )H=")H*HMu HEHP0H)H )H9Hu)Ho)Ht HH-`).H=')*QHH=)H?)H5@)HH3H5 )HP;HH)HMu HEHP0H5 )H=f)HG-H u HCHP0H@)H )H9Hu)H)Ht HH).H=l)oPHH=[)Ht)H5u)0HH2H5 )H:HH,H u HCHP0H5 )H=)HD(HMu HEHP0H)H (H9Hu)H(Ht HH-(.H=)OHH=)H(H5(uHHR2H5 )H9HHI(HMu HEHP0H5 )H=)H+H u HCHP0H)H #(H9Hu)H(Ht HH(.H=)NHH=)H(H5(HH1H5? )H9HHw+H u HCHP0H5 )H=6)Hu'HMu HEHP0H)H X(H9Hu)HC(Ht HH-4(.H=;)>NHH=*)H(H5(HH0H5D)Hd8HH&HMu HEHP0H5)H=z)H*H u HCHP0HT)H (H9Hu)Hx(Ht HHi(.H=)MHH=o)HH(H5I(DHHT0H5a)H7HH#*H u HCHP0H57)H= )HX$&HMu HEHP0H )H (H9Hu)H(Ht HH-(.H=)LHH=)H}(H5~(HH/H5)H6HH%HMu HEHP0H5)H= )HK)H u HCHP0H )H (H9Hu)H(Ht HH(.H= ) LHH=)H(H5(HH/H5)H36HH(H u HCHP0H5y)H=J )H$HMu HEHP0H# )H ,(H9Hu)H(Ht HH-(.H=O)RKHH=>)H(H5(HHV.H5)Hx5HHV$HMu HEHP0H5)H= )H&'H u HCHP0Hh )H a(H9Hu)HL(Ht HH=(.H=)JHH=)H(H5(XHH-H5)H4HH{'H u HCHP0H5)H= )Hl#HMu HEHP0H )H (H9Hu)H(Ht HH-r(.H=(IHH=(HQ(H5R(HH-H5)H4HH#HMu HEHP0H5)H= )H&H u HCHP0H )H (H9Hu)H(Ht HH(.H=(!IHH= (H(H5(HHX,H5)HG3HH'&H u HCHP0H5)H=^ )H1"HMu HEHP0H7 )H (H9Hu)H(Ht HH-(.H=c(fHHH=R(H(H5('HH+H5(H2HH!HMu HEHP0H5(H=)H:O%H u HCHP0H|)H 5(H9Hu)H (Ht HH(.H=(GHH=(H(H5(lHH+H5(H1HH$H u HCHP0H5(H=)H HMu HEHP0H)H j(H9Hu)HU(Ht HH-F(.H=(FHH=(H%(H5&(HHZ*H5(H1HHc HMu HEHP0H5(H=,)H#H u HCHP0H)H (H9Hu)H(Ht HH{(.H=2(5FHH=!(HZ(H5[(HH)H5;(H[0HH#H u HCHP0H5(H=r)H HMu HEHP0HK)H (H9Hu)H(Ht HH-(.H=w(zEHH=f(H(H5(;HH)H5(H/HHHMu HEHP0H5(H=)HN"H u HCHP0H)H (H9Hu)H(Ht HH(.H=(DHH=(H(H5(HH\(H55(H.HH+"H u HCHP0H5 (H=)H>HMu HEHP0H)H >(H9Hu)H)(Ht HH-(.H=(DHH=(H(H5(HH'H5Z(H*.HHHMu HEHP0H5/(H=@)HS!H u HCHP0H)H s(H9Hu)H^(Ht HHO(.H=F(ICHH=5(H.(H5/( HH'H5w(Ho-HH H u HCHP0H5M(H=)HHMu HEHP0H_)H (H9Hu)H(Ht HH-(.H=(BHH=z(Hc(H5d(OHH^&H5d(H,HHpHMu HEHP0H59(H=)HbH u HCHP0H)H (H9Hu)H(Ht HH(.H=(AHH=(H(H5(HH%H5(H+HHH u HCHP0H5_(H=)HHMu HEHP0H)H (H9Hu)H(Ht HH-(.H=(AHH=(H(H5(HH %H5(H>+HHHMu HEHP0H5(H=T)HH u HCHP0H.)H G(H9Hu)H2(Ht HH#(.H=Z(]@HH=I(H(H5(HH`$H5(H*HH/H u HCHP0H5(H=)H2KHMu HEHP0Hs)H |(H9Hu)Hg(Ht HH-X(.H=(?HH=(H7(H58(cHH#H5(H)HHHMu HEHP0H5(H=(HvWH u HCHP0H(H (H9Hu)H(Ht HH(.H=(>HH=(Hl(H5m(HH #H5E(H )HHH u HCHP0H5(H=$(HHMu HEHP0H(H (H9Hu)H(Ht HH-(.H=)(,>HH=(H(H5(HHb"H5J(HR(HH}HMu HEHP0H5(H=h(HH u HCHP0HB(H (H9Hu)H(Ht HH(.H=n(q=HH=](H(H5(2HH!H5(H'HHH u HCHP0H5(H=(HFHMu HEHP0H(H P(H9Hu)H;(Ht HH-,(.H=(<HH=(H (H5 (wHH!H5<(H&HH,HMu HEHP0H5(H=(HH u HCHP0H(H (H9Hu)Hp(Ht HHa(.H=(;HH=(H@(H5A(HHd H5Y(H!&HH3H u HCHP0H5/(H=8(HXHMu HEHP0H(H (H9Hu)H(Ht HH-(.H==(@;HH=,(Hu(H5v(HHH5V(Hf%HHHMu HEHP0H5+(H=|(H[H u HCHP0HV(H (H9Hu)H(Ht HH(.H=(:HH=q(H(H5(FHHH5(H$HHH u HCHP0H5Y(H=(HZHMu HEHP0H(H $(H9Hu)H(Ht HH-(.H=(9HH=(H(H5(苿HHfH5(H#HHHMu HEHP0H5(H=(H螿H u HCHP0H(H Y(H9Hu)HD(Ht HH5(.H= (9HH=(H(H5(оHHH5(H5#HHH u HCHP0H5(H=L(HHMu HEHP0H%(H (H9Hu)Hy(Ht HH-j(.H=Q(T8HH=@(HI(H5J(HHH5 (Hz"HH9HMu HEHP0H5(H=(H(H u HCHP0Hj(H (H9Hu)H(Ht HH(.H=(7HH=(H~(H5(ZHHhH5(H!HH7H u HCHP0H5(H=(HneHMu HEHP0H(H (H9Hu)H(Ht HH-(.H=(6HH=(H(H5(蟼HHH5(H!HHHMu HEHP0H5(H=(H貼_H u HCHP0H(H -(H9Hu)H(Ht HH (.H= (#6HH=(H(H5(HHH5(HI HHH u HCHP0H5(H=`(HHMu HEHP0H9(H b(H9Hu)HM(Ht HH->(.H=e(h5HH=T(H(H5()HHjH5(HHHHMu HEHP0H5(H=(H< H u HCHP0H~(H (H9Hu)H(Ht HHs(.H=(4HH=(HR(H5S(nHHH5+(HHHH u HCHP0H5(H=(H肺HMu HEHP0H(H (H9Hu)H(Ht HH-(.H=(3HH=(H(H5(賹HHH5H(HIHFHMu HEHP0H5(H=.(LƹIu IFLP0HP(1H=(ڲHHH5?(H=(Hx}H u HCHP0H(1H=(茲HHqH5i(H=(H*@H u HCHP03虱HH?H(HHCH(HH(HHCH(HPH(HHCH(HPHL(HHCH>(HPH(HHCH (HP Hr(HHCHd(HP(H(HHCH(HP0H(HHCH(HP8H(HHCHq(HP@HF(HHCH8(HPHH (HHCH(HPPH(HHCH(HPXH(HHCH(HP`H(HHCH(HPhH(HHCH (HPpH(HH(HCHPxH(HHCH(HH(HHCH(HH(HHCH(HH{(HHCHm(HH(HHCH (HH(HHCH(HH(HHCH(HH(HHCH (HH(HHCH(HH(HHCH(HHg(HHCHY(HH(HHCH(HH(HHCH(HH(HHCHu(HHO(HHCHA(HH#(HH(HCHH(HHCH(HH(HHCH(HHw(HHCHi(HH(HHCH(HH(HHCH(H H(HHCH}(H(HG(HHCH9(H0H(HHCH(H8H(HHCH(H@H{(HHCHm(HHHG(HHCH9(HPH(HHCH(HXHo(HHCHa(H`H(HHCH(HhH(HHCH(HpH(HH(HCHxHO(H=@(HHCH:(HH(HHCH(HHH(HH>(HCH5+(HH脳 H u HCHP0,蓴HHH(H5(HAy Hr(H5(H#f H(H5(HS H(H5_(H@ Hp(H5(Hɲ- H(H5C(H諲 H(H5(H荲 HN(H5(Ho H(H51(HQ H(H5(H3 H|(H5(H H(H5(H H(H5(Hٱ H(H5K(H軱 H(H5 (H蝱o H(H5(H\ Hp(H5q(HaI H(H5(HC6 HL(H5=(H%# H(H5(H H(H5i(H H(H5+(H˰ H,(H5(H議 H(H5(H菰 H(H5Y(Hq HJ(H5(HS H,(H5(H5 H(H5_(Hx Hh(H59(He H(H5(HۯO H\(H5(H软9 H(H5(H蟯# H(H5!(H聯 H(H5(Hc H(H55(HE Hn(H5o(H' H@(H5q(H  H(H5C(H H$(H5(Hͮ Hf(H5(H诮s H`(H5(H葮] Hr(H5(HsG H(H5(HU1 H(H5/(H7 H5h(H=(H H HCHP0飸E1AZAAZAE1AZAAZAE1AZAAZAE1A[AA[AwE1A#[AcA5[ARE1AA[A>AS[A-E1A_[AAq[AE1A}[AA[AE1A[AA[AE1A[AA[AE1A[AA[AtE1A[A`A\AOE1A\A;A%\A*E1A1\AAC\AE1AO\AAa\AE1Am\AA\AE1A\AA\AE1A\AA\AqE1A\A]A\ALE1A\A8A\A'E1A]AA]AE1A!]AA3]AE1A?]AAQ]AA]]AIAbZAAmZAgH H=/鑴A`ZABAxZA1AZA AZAAZAAZAAZAAZAAZAAZAA[AA[AA&[AvA2[AeAD[ATAP[ACAb[A2An[A!A[AA[AA[AA[AA[AA[AA[AA[AA[AA\AwA\AfA"\AUA4\ADA@\A3AR\A"A^\AAp\AA|\AA\AA\AA\AA\AA\AA\AA\AxA\AgA]AVA]AEA$]A4A0]A#AB]AAN]ALA`]AAl]AAx]AA^AA'^A(^A)^A*^A+^A,^xA-^mA.^bA/^WA0^LA1^AA2^6A3^+A4^ A5^A6^ A7^A8^A9^A:^A;^A<^A=^A>^A?^A@^AA^AB^AC^~AD^vAE^nAF^fAG^^AH^VAI^NAJ^FAK^>AL^6AM^.AN^&AO^AP^AQ^AR^AS^I)AYA%AYAAYAAYAAZAAZAЮA ZA鿮AZA鮮A4ZA靮A@ZA錮ALZA{AXZAjAvZAYAZAHAZA7AZA&AZAAZAAZAAZAAZAѭA[AA[A鯭A![A鞭A0[A鍭A?[A|AN[AkA][AZAl[AIA{[A8A[A'A[AA[AA[AA[AA[AҬA[AA[A鰬A\A韬A\A鎬A \A}A/\AlA>\A[AM\AJA\\A9Ak\A(Az\AA\AA\AA\AA\AӫA\A«A\A鱫A\A頫A\A鏫A]A~A]AmA]A\A.]AKA=]A:AL]A)A[]AAj]AAv]AA]AA%^ڪA%ZAɪA&ZA鸪A'ZA駪A ZA閪H[]A\A]A^H=7(RfHHMi&HtHfH=(H(H9tH^h&Ht H=y(H5r(H)HHH?HHtHi&HtfD=9(u/UH=i&Ht H=e&h(]{f.Hh&GPHGXHDHu310Ht!HW(HPHTh&HHPHHHh&1H58(8ATIUHSHHHt HՅu!H1Ht[LH]A\[]A\Ðf.UHSHHg&HHH]HHHt H/tCHHHHHHtH/tH1[]HGP0H1[]HGP0HGHHGHGE1LH@ uLGuLA1LAUSHHGXHo`H$H_hHt$~D$HOh$GXHtH(tPHtHmt4HtH+tH[]f.HCHH@0H[]DHEHP0@HPHR0ff.HL bf&HLM9tMu HxHuLHxH:H@HHHtHHHtHHHtHÐAVAUATUSHGLM|HIHL-e&p NH A;MhLHHAHH QP AEH=~9|HtTH[]A\A]A^ @9}豙@$[]A\A]A^{H=Lt1@ÙHHuH,d&H5}H8HGHHtfDÜAVIAUATIUHSHH裔1LLHIHtzIH(H~%1I fDHHHHHH9u1L͖AE I,$tAm H[]A\A]A^IT$HD$LR0HD$1f.SHGHL@t+Hc&LHH81Ku%H[fHc&HHH5H81"H+t 1H[DHCH1P0fSHHGHGHHHaHcH1H[WGHH HcʉH9tH2c&H5H8#@GH[WGHH HHcʉH9uH[GH[D苗HcH9aHuTHrCH@`HtiHHt]HHtSHc&H9Cu-@HH+HSD$ HR0D$ HH5dHHuɖHuHa&H5H8 ZDATIUSHHHoHfHt9HPHHtHHHH[]A\fDHH[]A\Hab&LHD$H:豒HD$f.AUfIATIUHSHH(HGXHT$Ht$HD$HG`GXHD$HGhHGhH|$HD$[H{XHt$Ht H|$̐HD$HtHHD$HtHHD$Ht HHD$HT$IUI$HD$HEHH8HhHHT$HXHPHT$HPHtH/tMHtHmt1HtH+tH(1[]A\A]fHCHP0@HEHP0@HGP0H|$IEI$HEHt H/uHGP0H|$Ht H/uHGP0H|$Ht H/uHGP0H([]A\A]SHGHuoHWH{HtHCH/t@HHtHǃH/tHCH[H@fHGP0HGP0HtGuKt[ÐAWAVLvAUATUSHM~uLHG LD$MHH$IHLfH<$L$HL$HLIL<L詒HHL蛒HHL荒L)IuH^&HH[]A\A]A^A_f.AVAUAATIUSHt}H=(HIH]HHLEHHL譓IH+t[L]A\A]A^HCHP0[L]A\A]A^f.1IHHtrH=(eIHtMؓHHt@LEHHL,HmItHEHP0H+fuDHmu HEHP0E1[]LA\A]A^UHSHHHt7HH}H/tH]H1[]@HGP0H]H1[]@H!]&Df.USHHHoH$H_Ht$~D$HO$HtH(tJHtHmt.HtH+t H[]@HCHH@0H[]DHEHP0@HPHR0@H9t7HGH;\&u>HGHuHtHq\&H@HuuH \&HH;Q[&t}DfH*f.Gzt@ATUSHH9H\&H9GHH9F ~ HSH9VHCHNH9@H@t H{ DF D8@ "H{HA |HN0HHA@HEȃpwDA9uEHH菎1u)1 L%Z&L9ut1H[]A\L9uuH߉HHH;Z&H;XZ&uL9u<H+uHSD$HR0D$1H[]A\H舏fDHK0HH@HHDfHt$fHt$>'HHt$;Ht$@HvHD@Dff.SHHt 1[fDHCHuH)Y&H8Y1[D1贑HHtHHX&H8*H+uHCHP0USHHHGH;Z&tjH;#X&t1HhhHHEHt{Hy HH[]fHt HyHGtH;CsEHDHH[]DHt HyHGtH9CvHSHHH[]fH蘋HHt`HHEHmuHUHD$HR0HD$HUHFHt$Ht$HxHHE)fD1HW&Ht$H8XHt$tHt$腋HEHt$AWIAVIAUATUHSHHHHD$(LD$Ll$0HD$HD$8HD$(HD$0HD$8HD$@HT$Ht$LLSHHt$(H{H8HH9uf.H;2HHHuHFLIHFH9GII$Ht-H8H9uLHL$0H)I I<$KHt$(fDH9u&fDHFH9GHH9HEH8H9uHT$HH5RHU&H81聍HH[]A\A]A^A_DHT$0H)I軋xDHt$(%kHt菋xnHt$(oHH9VHHT$H5]HFHU&HT$H5ÕH81HH[]A\A]A^A_HHt$(DHHH@@AT1USH1IHti1HH I,$Hu ID$LP0HtBHM@teHHʅf.HmuHE[H]A\H@0[]A\铅HT&H5ZH8Zf.HS&HH5H81蕋AVAUATUHSH HH_pHHCHHtH1H H[]A\A]A^f.EL-S&E1HH2HS&L2IMtI.u IFLP0MtQLHSImIu IELP0H L[]A\A]A^HS&HWH5H81褊H E1[L]A\A]A^ÐEuKHDS&Hb@1DL$HT$Ht$bHt$HT$HIIDL$fH8IHt;HR&LH>IMtI.t=I,$ ID$LP0MHI.>IFLP0IFLP0AWAVIAUATIUSHHLLoHo 舆p VP HR&;AGu A CHK0HS(1HtHEHHE1ELQLLR1PUjH0Hx WP HQ&=!@9|HH[]A\A]A^A_D29}ԅ@$fDH=|D1Ht+HEHMu IcWH9t7HK0HS(BIcWL9uLLLL6H?LHL H)LVMH9~1DH9|HI9uE1fJTHBt>@t5H9tbHXHt4LIM~H;QtG1H;Tt;HI9uIM9u1@HDHH9tHuH;P&uθHHH?H9t}HXHtOHJH~H;rtb1 @H;ttSHH9uHyO&HNH5HWH811+@HDHH9tHuH;5P&uH@HN&H5ĬH8j1fDUHSHHH=(HGHHtHHt#HH[]fHfDHP&HH5eH81UUSHHHGHt)HkHUHH HcHHHH+tHH[]DHCHP0HH[]@kH+HcukCHH H+uH+kuDkCHH HH+uHȂH+HlvfDH@`HtOHHtCHHt9H@H;NN&HH5ݭHHu3HD3HuH/M&H5PH8xH@f.USHHHGHt)HkHUHH 8HcHHHH+tHH[]DHCHP0HH[]@kH+HcukCHH H+uH+kuDkCHH HH+uH8H+HlvfDH@`HtOHHtCHHt9H@H;L&HH5MHHu3HD裀HuHK&H5H8}H@f.AUATIUHSHHHEHHhID$HHL-`K&p VP A;U1HLHH QP AEH=~D9|JHH+tHH[]A\A]HCHP0HH[]A\A] @9}A@$H1[H]A\A]1HLHfDH=~7@1bf+HHuHI&H5H8m|1HGtkHGHHHwUH5jHcHDGHËGWHH fG@GWHH H~SHH@`HtrHHtfHHt\HEJ&H9Cu/HHH+uHSHD$HR0HD$H[HH5YHHuH~HuHH&H5 H8H{fDAUATUSHH}yHXXHHu1H[]A\A]HI&H0H9fLm`LehHEhEXH+tgMtImtkMtI,$uID$LP0fH/uHGHt$P0Ht$H*H&HH5H81Z@HCHP0@IELP0HCte@t\HFHt\@tSHXHtXHJH~"H;r1 H;tHH9uHytHHHH9Hu1H;5H&fAUATUSHawHXXHu1H[]A\A]HH>H&H0H9ubfLm`LehHEhEXH+t(MtImt,MtI,$uID$LP0HCHP0@IELP0HCte@t\HFHt\@tSHXHtXHJH~"H;rN1 H;t?HH9u HZxtHqHHH9Hu1H;5F&fHGH;eF&AUATUSHHH;G&HOQE1 La}0zH-E&p VP ;U1LAHzp VP EH=~!9|'HHH[]A\A]fD @9}y@$LozLL-r(MyH-E&p VP ;U1LHAT11yHHt&1X@H=1x 19HC&H5/H8vfHLH1[]A\A]{fH=ـxY1DAWAVAUATIUSH8H|$1tIŅ&A1H5B(HAD*(DƒnHcHD9tT1 }6H9}%)ωHcH|>D9~؉9|1A9A9HHHD9pL I$Hݴ(1LLsHHtHhlH}vI,$u ID$LP0H+u0HCHH@0H8[]A\A]A^A_f.I,$UH8[]A\A]A^A_fDH=I(HH@XM}hIEhfHD$IE`AEXHD$dyIH8H8Hn(H9GHU(Ht0HB&H9tH;B&t7Hut+1'nvfDHqB&H5ʮ(1H=(v~D$I}XIU`MuhM}hD$AEXHtH/uHOHT$Q0HT$HtH*u HJHQ0MtI.u IVLR0AALxxIHH|$ZxHHH߲(HE11L Dz(111AQUSAWPPPPP!sHPIIHIHu IGLP0H+u HCHP0M#HY(Hh5B(HcHD9t1fK9~s)ʉHcHTD9~ԉID$LH@0H8[]A\A]A^A_@Ht$H11H=>oH@P1A99~{LcIIE9p;5k(tkHcуHoL 9|EpM 58(I$fDI/IGLH@0fD95(ZD~@HIcHwrH:LcË5հ(Hְ(ID=ǰ(I9Sk~1fDH=ɰ(H5(HGHHAHHHHL$ rHL$ HHHHw?&H(?&HqHT$(HHD$ V0HD$ HT$(dDH5Y(HVsIH(HRH()fD&wH)H@Hį(H5(DpL I$@HcHLHHHHl>&H&H9>&1vHAWfAVAUATIUHSH8L51>&H^)D$Lt$ H:H(HHV(ID$ ML$HHHuHAH==&HHAVj5(5(j5(Pj5(ޭ(HPHH+HSHD$HR0HD$H8[]A\A]A^A_I\$HHH ֚HMHSHњL@H<&H5~L ÛH81]tXd3ZH  H=~n1H8[]A\A]A^A_DLIHS~qHtHYHF(HD$ ID$ LHD$ID$HD$lIHtlHHt8MLL$HD$HT$ oHHkIH5%(LIHVqHD$HH5(LHVpHD$HIM~H5֠(LHVpHt~HD$ ISH+t2I H T3HD$H=u}HD$fDHSHD$HR0HD$fHFHHD$jI@HT$HLLH5G(R3!HH:&H H5|jL AHH81>rY^H3fAVAUATUHSHL (L%:&H^L $Ld$H=H+HHHHIH H&HIHH9&I?SIH5{H8L A1qX2ZH ڗ H=(|1HH[]A\A]A^ÐLHH(HHu AH=R9&HH (ATjQPjQHPj5:((HHHPHHPHHuHCHP0HH[]A\A]A^HV LNnLIHHtmHHhIHL $HT$%fHHt'H Ɩ 2H={DHCHP0@oFH)$ohH~HLHLH5E(v2q@HFHH$(hIMLH5u(LHVYmHtHD$IFfH5ѝ(LHV-mHtH$I@f.AVAUATIUSH0H(H (H-8&H^HD$~D$HL$Hl$ D$)D$HpHV~$HHHV(HN LNfIHHHI$It$HAH=8&HUj5>(Pj5e(QHj5I((HHHPHHPHHtH0H[]A\A]A^@HCHP0H0H[]A\A]A^fDHDHHIH |HHIHHn6&I?SIH5_xH8L iA1nXM2ZH JC H=x1H0H[]A\A]A^ÐHIHcHtHMHF(HD$ HF LHD$HFHD$eIHHM~.H5(LHVjH HD$ IMLL$HL$HT$ Hʘ($DHH?eIM~H5(LHVtjHtHD$IM~H5z(LHVNjHWHD$IDHHt'H  v2H=_wDHCHP0@HVfHFHHD$dIaHT$HLLH5@()92 AVAUATIUSH0H(H (H-4&H^HD$~D$HL$Hl$ D$)D$HpHV~$HHHV(HN LNfIHHHI$It$ AH=3&HUj5(Pj5](QHj5Q((HHHPHHPHHtH0H[]A\A]A^@HCHP0H0H[]A\A]A^fDHDHHIH H)HIHH2&I?SIH5tH8L A1jX1ZH ʐ H=xu1H0H[]A\A]A^ÐHIHcHtHMHF(HD$ HF LHD$HFHD$:bIHHM~.H5w(LHV[gH HD$ IMLL$HL$HT$ HJ($DHHaIM~H5(LHVfHtHD$IM~H5r(LHVfHWHD$IDHHt'H f> 1H=t*DHCHP0@HVfHFHHD$`IaHT$HLLH5N=(1 AVAUATIUSH0H(H (H-1&H^HD$~D$HL$Hl$ D$)D$HpHV~$HHHV(HN LNfIHHHI$It$ AH=;1&HUj5>(Pj5ݕ(QHj5љ((HHHPHHPHHtH0H[]A\A]A^@HCHP0H0H[]A\A]A^fDHDHHIH |HHIHHn/&I?SIH5_qH8L iA1gX#1ZH Js H=(r1H0H[]A\A]A^ÐHIHcHtHMHF(HD$ HF LHD$HFHD$^IHHM~.H5(LHVcH HD$ IMLL$HL$HT$ Hʑ($DHH?^IM~H5(LHVtcHtHD$IM~H5(LHVNcHWHD$IDHHt'H  L1H=pDHCHP0@HVfHFHHD$]IaHT$HLLH59()1 AVAUATIUSH0H(H (H--&H^HD$~D$HL$Hl$ D$)D$HpHV~$HHHV(HN LNfIHHHI$It$ AH=,&HUj5(Pj5](QHj5Q((HHHPHHPHHtH0H[]A\A]A^@HCHP0H0H[]A\A]A^fDHDHHIH H9HIHH+&I?SIH5mH8L A1cX0ZH ʉ H=n1H0H[]A\A]A^ÐHIHcHtHMHF(HD$ HF LHD$HFHD$:[IHHM~.H5w(LHV[`H HD$ IMLL$HL$HT$ HJ($DHHZIM~H5(LHV_HtHD$IM~H5r(LHV_HWHD$IDHHt'H fn 0H=gm*DHCHP0@HVfHFHHD$YIaHT$HLL)H56(z0 AWAVAUATIUHSH(L5%*&H^HD$Lt$HJH0HHV ML$HHHuHHnj(H=)&AHH w(AVjQPjQHPj5B(ԙ(H;HWHPHH=HHSHD$HR0HD$H([]A\A]A^A_I\$@HH׆H džHOHՇL LOL@HH(&SHH5jH81C`X/ZH  H=kT1H([]A\A]A^A_LIHHHHHXH51(LIHVIN]HD$HMLL$HT$kHt3 H Յ"0HD$H=jHD$=HSHD$HR0HD$foFH)D$nWH~HT$HLLH5\3(X/DHFHHD$WI'H5i(LHVM\HtHD$IG|f.AWAVAUATIUHSH(L5E'&H^HD$Lt$HJH0HHV ML$HHHuHH(H=&&AHH (AVjQPjQHPj5b((H;HWHPHH=HHSHD$HR0HD$H([]A\A]A^A_I\$@HHH HOHL ΃LOL@HH%&SHH5gH81c]Xu/ZH C H=it1H([]A\A]A^A_LIHHHHH8UH5Q(LIHVInZHD$HMLL$HT$kHt3 H /HD$H=FhHD$=HSHD$HR0HD$foFH)D$TH~HT$HLLłH5\0(7Xe/DHFHHD$?TI'H5(LHVmYHtHD$IG|f.AWAVAUATIUHSH(L5e$&H^HD$Lt$HJH0HHV ML$HHHuHH(H=0#&AHH (AVjQPjQHPj5((H;HWHPHH=HHSHD$HR0HD$H([]A\A]A^A_I\$@HHH HOHL LOL@HH"&SH.H5dH81ZX.ZH ˀH=If1H([]A\A]A^A_LIHHHHHXRH5q(LIHVIWHD$HMLL$HT$kHt3> H /HD$H=eHD$=HSHD$HR0HD$foFH)D$QH~HT$HLLH5\-(WX.DHFHHD$_QI'H5(LHVVHtHD$IG|f.AWfAVAUATIUHSH8L5!&H^)D$Lt$ H:H(HHV(ID$ ML$HHHu AH=HHD$IML $HD$HT$@HH8IH55n(LIHV=H$HM~H5Tn(LHV=HbHD$IOfHHt'H Ff}*H=7M DHCHP0@H'VfHFHH$7I`HL~fHLH5q(茰*vI\$AWAVAUATIUHSH(L5&H^HD$Lt$HJH0HHV ML$HHHuHHj(H=&AHH Wu(AVjQPjQHPj5l(w(H;HWHPHH=HHSHD$HR0HD$H([]A\A]A^A_I\$@HHdH dHOHeL dLOL@HH&SHeH5uHH81#>X*ZH kdH=K41H([]A\A]A^A_LIHHHHH5H5k(LIHVI.;HD$HMLL$HT$kHt3)H c;*HD$H=JyHD$=HSHD$HR0HD$foFH)D$N5H~HT$HLLcH5(X*DHFHHD$4I'H5Ij(LHV-:HtHD$IG|f.AVAUATIUSH0Hh(H h(H-&H^HD$~D$HL$Hl$ D$)D$HpHV~$HHHV(HN LNfIHHHI$It$HAHH=Gr(UjWPj5i(QHjWH=&t(HHHPHHPHHtH0H[]A\A]A^HCHP0H0H[]A\A]A^fDHDHHaIH |aH4bHIHHn&I?SIH5_EH8L ibA1;X)ZH JatH=H1H0H[]A\A]A^ÐHIHcHtHMHF(HD$ HF LHD$HFHD$2IHHM~.H5g(LHV7H HD$ IMLL$HL$HT$ He($DHH?2IM~H5l(LHVt7HtHD$IM~H5g(LHVN7HWHD$IDHHt'H _)H=/G誽DHCHP0@HVfHFHHD$1IaHT$HLL$`H5 ()z) AUATUHSH(L &H^LL$HH Hu{HVHHHuHE1H=&HHAQjAQAQjAQAQjAQq(HPH H+HSHD$HR0HD$H([]A\A]fHH^H ^HIHHp^H?L _HLIL@HHX&SH^H5IBH817X(ZH ?^3H=E1H([]A\A]LIHHZHFHHD$/L R&HHT$H+t2nH ]")HD$H=-E耻HD$pfDHSHD$HR0HD$f.HX/L %HI~H5d(LHV4L %HtHD$IEJHT$HLL]H5S (ΧxHT$L n%(Df.AUATUHSH(L <%H^LL$HH Hu{HVHHHuHE1H=%HHAQjAQAQjAQAQjAQo(HPH H+HSHD$HR0HD$H([]A\A]fHH\H \HIHH\H?L ]HLIL@HH%SH\H5?H815XZH [ H=uC蘹1H([]A\A]LIHHZHFHHD$i-L %HHT$H+t2DH L[HD$H=BHD$pfDHSHD$HR0HD$f.H,L a%HI~H52b(LHV2L ?%HtHD$IEJHT$HLL`[H5(^xHT$L %|Df.AVAUATUHSHL _(L%%H^L $Ld$H=H+HHHHZIH YHZHIHH%I?SIH5=H8L ZA13XZH YH=A1葷HH[]A\A]A^ÐLHH^(HHuHAH=%HH i(ATjQPjQHPj5*a(k(HHHPHHPHHuHCHP0HH[]A\A]A^HV LNnLIHHtmHH*IHL $HT$%fHHt'H X8H=@zDHCHP0@oFH)$_*H~HLYHLH5(vq@HFHH$*IMLH5e_(LHVI/HtHD$IFfH5_(LHV/HtH$I@f.AWfAVAUATIUHSH8L5%H^)D$Lt$ H:H(HHV(ID$ ML$HHHuHAH=4%HHAVj5cg(5\(j5f(Pj5,g(i(HPHH+HSHD$HR0HD$H8[]A\A]A^A_I\$HHVH VHMHSH{WL@H%H5:L WH81=0XZH VH=>N1H8[]A\A]A^A_DLIHS~qHtHYHF(HD$ ID$ LHD$ID$HD$'IHtlHHt8MLL$HD$HT$ oHH'IH5e(LIHV,HD$HH5d(LHV,HD$HIM~H5\(LHV,Ht~HD$ ISH+t2H 4UHD$H===HD$fDHSHD$HR0HD$fHFHHD$&I@HT$HLLUH5'yu!HH%H TH58jL UAHCUH81.Y^kfAVAUATIUHSHH%H^HT$MMHH LfHEH5\(HHHPHHR],HHQH5*[(LH,HCL54g(LMlG*L-%H QP A;U}HLHAI*H QP AEH=9M]H+HmHEHP0HL[]A\A]A^fDHHSH RHIHHRH?L SHLIL@HH%SHSH56H81o,XZH RH=:E1}HL[]A\A]A^DIbHCHP0Hmu2f. @9(@$@AH+u HCHP0Hmu HEHP0D溰E1H RH=H:ۯHL[]A\A]A^HHHFLHD$#HNLd$D+HA|DH+AgHCHP0XHT$HLL/RH5h'yDHLH*IHfDADH=/d'of.'HuHG%H5/H8 %fDL"IHH5W(LHV'H'HD$IEf.AVAUATUHSH L-%H^Ll$HHHuaHVHHu MH=P%HHb(H H+HSHD$HR0HD$H []A\A]A^HHOH OHIHHOH?L PHLIL@HH%SHwPH53H81?)XZH OtH=7P1H []A\A]A^ÐLIHHRHFHHD$!HbHT$f.H+t2H OHD$H=]7ȬHD$pfDHSHD$HR0HD$HT$HLLOH5'dxy fHx IHXH5U(LHV%HtHD$IF-fDAVAUATUSHHGH5[(HHHH&HHHC%H5Y(H$'HCL5Ya(LMl$L%%H QP A;$HLHAI>$H QP A$H=9MH+HmuHHHU(HHHU(HCHH=V(HHHsHHu HCHP0HEHUU(HHHH/IM1I<$u ID$LP0Hmu HEHP0H-[(HX%LHI9E@'HHH"HH]HX"HHLd$~D$Hl$I$D$@IELh(ImI,$u ID$LP0HH[]A\A]A^HEHP0|fHCHP0Hm^f @9'DHAAHu HCHP0DDIH oKH=4=Imu IELP0M-:fH+u HCHP0H K1H=3ߨHH[]A\A]A^!@$_f.AH+u HCHP0HmuCE11AHEHP0H JDDH=*3eH5I@DH lJ1H=23HH[]A\A]A^fD[$HHLH#IHfDA+DH=(D *f. HuH'%H5x(H8fD#IH%H8yqHmuLAAfD1AADHHH 6IH=1Imf.H+HALA7H谑HH HH=P1苦ImIELP0HmuQHALAfH oHH=03Im2fDH 7HH=0fH %HH5HH81!oAVH5/U(AUATUSHGHH}HHg* HHnH%H5S(H HCL5Z(LMUL-%H QP A;UfHLHAIH QP AEH=~c9|iMNH+t8Hmt[L]A\A]A^DHEHP0[L]A\A]A^f.HCHP0HmuD @9}Y@$AH+u HCHP0Hmu HEHP0DE1H }FH=@/K[L]A\A]A^A{ H{H+AuHCHP0HLHIHfDAKDH=$Df.HuH'%H5x$H8@f.AUATUHSHHGH50T(HH HH"HCH5P(HHH<IHHHM4H;H}H5S(HGHHHH>HEH5O(HHHHHEHHRHEHH=T(HnHHHWHHH5T(HCHHEHCHHEHLHHHHHu HCHP0I,$u ID$LP0HEIHPHUHEHu HEHP0HL[]A\A]fDHCHP0HEHP0HCHP0/HEHP0LHHHvAHCHP0H CDH=x,SM_HL[]A\A]@HH GCE1H=-,HL[]A\A]f.;IAHWH BH=+诠f.H BLH=+{I$E1HtHtHEHuHEHP0fDHpHf.HH $BH=+I$LE1HHWHBpHtH@Ht ATUHSHHHBhH HHHHy%H9FHFHpHMHluHH;%*H;%t9HjhHHMHHHH[]A\fHSHHH9HDHH[]A\ËuEHH fDHHHSH;H%H;c%dHSHyH2HH%HRH5)H81<1H@H(HHHHHmRHUHD$HR0HD$9DHSHH9vHSHHHSHyH2fH HCH;_%MH;z%PHhhH?HMHH3HEHpHt$HHt$H'HHMLfHIHlHtI,$HqHD$ID$LP0Ht$W@H3HuEHH fH;%1H;%HSH1H/%HH2t%HEH5(HPHe%H81[1HHHSHuHSHHW116H%Ht$H8CHt$tHt$pHMHt$fAUIATIUSHH(HGH;%H;e%HHI$L`IELh HCHLMZL-%p VP A;Ux1HHAI-H QP AEH=9MaHmH+tpH(L[]A\A]fHWBፁ)Ht$~D$1Ll$D$)D$LB uH{Ht$AIfDHCHP0H(L[]A\A]HEHP0H+\f. @9(-@$@Ht$~D$Ht$HT$D$)D$GIE11HHIH=|t@E1IHuHT%H5H8-w1ɺAIvfDHGtkHGHHHwUH5BAHcHDGHËGWHH fG@GWHH H[USHH@`H"HHHHH@H;%fDHCHHHH5@HcHHH5>=xHHHfH+uHSHD$HR0HD$H[]CHCSHH HfDCCSHH HH5<jxHHt-H@)fH(cHHcH@`HHHHHHH%H9EHEtHEHPHwkH d?HcHHwHmHUHD$HR0HD$EHӋEUHH HE뼋EUHH H<HfH %H5.8H8V KH%H58H8; fDHGtkHGHHHwUH5>HcHDGHËGWHH fG@GWHH H{USHH@`H"HHHHH@H;%fDHCHHHH5=HcHHH5^:vHHHfH+uHSHD$HR0HD$H[]CHCSHH HfDCCSHH HH59uHHt-H@)fHHcHHcH@`HHHHHHH%H9EHEtHEHPHwkH <HcHHHmHUHD$HR0HD$EHӋEUHH HE뼋EUHH H\ 5 HfH-%H5N5H8v KH%H535H8[ fDAVAUIATUSHHGH5=(HHHHHCH;=%LcMHkI$HEH+t~LLHXI,$It~HEHMWHEHt4ImtH%HH[]A\A]A^DIELP0@HEHP0ImuDHCHP0sfID$LP0rH;y%Ll$FH;7%!HSBJLbE1 t_R H-%H QP ;UeLLAI, H QP E=)@9|&MHfDLsf29} @$fDH= tHHHHEBHu HEHP0H 3H=iđH1[]A\A]A^D H4fLH%I7DHt$HvIfDtLB1 uH{Ht$u>AID3 HH%H5H8t1ɺAIf.AUATUSHHGH;{%Ht$H;9%HWBHHjE1 tfQ L%%H QP A;$HLH' p VP A$H=~09|6HHH[]A\A]DLof. @9}@$Ht$薈HHH[]A\A]DHt$H@H=<=@1ffHHuH%H5eH85LJE1 uLGHt$uLAH1ɺLAHAWAVAUIATUSH(HGH57(HHdHHNHCH;%L{MHkIHEH+L|$H e%HEHL$H9SH;%HUBWHZE1 3L5%p VP A;LLI H QP A=@9MI/IGLP0MHH+u HCHP0A%HCHP0H y%HL$H9KH;4%NHKQ>E1 HiIL5%H QP A;xL1I!H QP AH=9M^HHmu HEHP0H=>(H5<(HGHHHHbH={A(Ll$HGH;D$H;P%HWBHZE1 uLgL5%p VP A;^LLI>p VP A=29M[HEH;%L}MLuIIHmu HEHP0LLLI/Hu IGLP0Imu IELP0H]I.u IFLP0HLHI$HRHPI$Hu ID$LP0H+u HCHP0H(H[]A\A]A^A_Ll$H;D$H;%CHUBHZE1 L5y%p VP A;'LLHH QP AH=9H I@@9f}@$X@Lc @9SM@$E@Le29@ @$2L} @9M@$?@xL谂IMI$A*HI$uID$LP0HtHmu HEHP0H +D1H=貉#DAHI$A(HI$tf.HhLH->(ML5%p VP A;1HHAIp VP AH=69>MHH`%H5 H89@Ht$zIfLH5II/qI$LA9HI$uHI$A<H+sHCHP0dH=LH襀H!DHHk%H5H8D @Ds@$f.LJE1 uLGHt$ LAId11HHqyIQfHt$HNyIfDLJ1 uH}Ht$AIkDH=ltHHK%H5A%H8]fHt$HxHfDH=9@I/_E1DfD[HuH%H5H8fDLB1 uH}Ht$AHDH=d@1HHuHD%H5H8H1HH8IH=IQ{1ɺLAIU1ɺAI1ɺAHbID$LA<P0H+T@f.AUIHATIUHSHHWH=:(JHH:(H@IEI$HtHHH[]A\A]DHuH=O:(HHGHHt'HHuH%HH5O&H81?HAWAVAUIATUSH8H%H^HD$(H HHHnHEI}H5,(HGHH3 HH5 L=65(H%HLH9CG IHV HL%7(M9jH%I9FI9D$A~ Y A|$  IVI;T$IFI|$H9AHAt HiEF EL$ DD@@8BA 7 I~0MVHA@IDA  MD$0It$HA@IEDA- AH DDE9HjE1HIAHIu IFLP0EfDIc}PwIH+ H51(HHI HIAEXIH H51(HHI HIH;-%H;-?%4H;-]%'H L%2(H%HLH9C IH HL%M*(HN%HLH9C IHE HL-/(H%LLI9G VIHZ HI/u IGLP0L=)(H%HLH9C IHO HHD,(H%HI9E LHT$HT$HI\ HIm3H/(H]%HH9C HHT$HT$HIb HH/(H %HH9C HHT$VHT$HHK HHL$HL$H Lt$~D$HLd$HH8D$L|$@~D$Ll$D$@(H HHQHHuHGP0HmHEHP0HH!H !HIHHp!H?L "HLIL@HHX%SHS"H5IH81XZH ?!H= 1H8H[]A\A]A^A_@L=y%M9uuM9WOI.eL=%H;-_%L9u H;-3%"H;4(H (H9HH(HHL5(MIFH5#&(LHHIIHPMIHID$H53%(LMHt$Ht$H QP H,%;1LAIH H H%p=9 MI,$I.tzIHmtWLHAIFLP0IFLP0IFLP0IFLP01HEHLP0fDIFLP0IHmxDID$LP0I.Qɐ4@9&0H2K@$fLL`IHH;%L;%%M9LI,$AIHPED$+E1E1D$I1Hu7E1IFHL$LP0MHL$tImuIEHL$LP0HL$MtI,$uID$HL$LP0HL$MtI/uIGHL$LP0HL$HtH)u HAHP0T$t$H H=WR{HH1HPI.IFLP0HHHHFHHD$( HHl$(fDHHHBHfDHH H=zH;DIM)L`eIIELP0fI,$DID$LP0LID$+E1E1D$HPfDH=Ht$WHt$f.MD$ 1E1D$KE1HuH%H5hH8fDL`SHT$(HHLlH5Z'%fM$jsHPD$lE1E1D$$HIHH5&(HHV9HmHD$(IFf >H=q (H(H5(I/fD%vfH=1 (tmI@IE1D$@D$ -HPD$xE1E1D$%1LIHg5D&3It$HfDI~HKIM3'DDIM6IE1D$D$'HP]LXbIIM)ID$MHI1E1D$'H7LbIp{IM IE1D$D$'HPLaIhL8IMID$H[LaIDDHIM ID$D$(HP;H6aIHHH ID$D$(HIHDH`IID$D$'HH`HIE1D$+D$HPIfDAVAUATUHSHHHH+(HEH (H9HhH(HHL%(MlID$H5(LHH]II$HI$M+HIELML5"%H QP A;HLHAIlx WP AH=~~9MImtNHmt'HtH+teHL[]A\A]A^DHEHP0@ID$LP0>IELP0HmuD @9|(HCHP0HL[]A\A]A^fD@$DfA PHuID$LP0f.H DE1H=TsHm2fH$ILd$HD$1LLHt'(HEH "(H9HhH (HHL%(MlID$H5(LHH]II$HI$M+HIELML5B%H QP A;HLHAIx WP AH=~~9MImtNHmt'HtH+teHL[]A\A]A^DHEHP0@ID$LP0>IELP0HmuD @9|(HCHP0HL[]A\A]A^fD@$DfAOHuID$LP0f.H DE1H=oHm2fH$ILd$HD$1LLHtIm3IELP0$DH@HP0H@HP0E;CLzf.D$L^f.\D$H#(H (D$ H9H,H(H HL=(M IGH5(LHH HIHH IHuIGHT$(LP0HT$(D$ HT$(HT$(HI8 Ha%H9B' HLHT$(HT$(III.u IFLP0M I/u IGLP0L;%%L;%ª%u L;%%nDI,$u ID$LP0EO HD$D$LIL\$(L\$(HI D$ L\$L\$HI Ht$HLMH(5Q%AH H=%jP5' (jPATjPHT$XL\$`O(HPL\$HIIY HIZI/@I,$E1E1 f.HD$fDHH?IH ,H HIHH%I?SIH5H8L A1Xy$ZH H=1dHXH[]A\A]A^A_IGLL$LP0LL$lIA@=Lt$~D$Ht0HHl$LH\$@D$LL$)D$0ALL$HID$%fDM IME1E1D$ZE1H2D$JE1E11D$$E1E1E1MtI/uIGLD$LP0LD$MtI.uIFLD$LP0LD$MtI(u I@LP0T$t$H H=QcHtH+RE1HCHLP0H@HD$fDHHHtHHF(HD$@HF HHD$8HFHD$0IHHM~.H5 (HHVH HD$@IM HD$@Ll$0Ld$8HD$5H'H_IM~H5(HHVHtHD$0IM~H5B(HHVnHWHD$8ID1fE1E1E1E1D$KD$$L\$ LL$iL\$ LL$@$fDLt$~D$Ht0HHl$LH\$@D$LL$)D$0lSLL$HI MRI.HIFLL$LP0LL$/LLD$LD$A0MD$_E1D$%LAŅI$ME1E1D$%E1E1D$QHfDIHE1ICLD$LP0MLD$IHIHYIFLD$LE1P0LD$DID$LE1E1P0f.IGLP0ICLP0dHVE1E1E1E1D$ND$$ BD$ D$ H(E1E1E1E1D$OD$$H=9LL$L\$ IME1E1D$%E1HD$Zf.H=Y (H'H5'IfDE1AH=) (H'H5'IsfDE1E1E1D$ZD$j%f.HVfH= (SI!@D$ZD$l%ME1E1E1E1@IMqMMaII$I)u IALP0ID$MA1ҿA fDE1E1D$^D$%#DH= (HZ'H5['IBfDD$%E1D$_D$%I3D$_D$%H= (lRI@1LLL\$ LL$LL$L\$ HIIE1ME1D$%HD$Z[IMD$%E1D$_H6fDH=(H:'H5;'IfDL\$LL$LL$L\$HIcH%H5UL\$LL$H8L\$LL$E1D$%IMD$ZHE1E1E1D$QD$$PfHFHHD$0IID$%MMD$_E1HIE1HM+@LD$IfDH=(PI@H=(PI3@HND$QD$$IMD$%E1D$_HfDMNMoMFIII.uIFLD$ LLL$P0LL$LD$ LLLLL$ LD$軾LL$ LD$HI)!IALD$ LHL$P0LD$ HL$E1E1ID$QD$$fE1D$%D$_MwMM_III/uIGL\$ LHL$P0HL$L\$ HLLHL$ L\$I.L\$IHL$ IFLD$(LL\$ HL$P0LD$(L\$ HL$sE1E1D$QD$ %DLjMLzIEIH*u HBHP0LLLHImIIELP0H5'H= (17IHHOHI/IIGLE1E1P0D$`D$%H5I'H=B (1K7IHNHGI/u IGLP0E1E1E1E1D$RD$ %fDD$aD$&IE1E1E1D$=%HD$UIE1E1D$G%D$VH~LHE1E1ID$Q%D$T)HT$0HHLH5'DSe$D$~%D$`E1E1D$%AE1E1D$`D$%E1E1E1D$RD$%E1E1E1MD$Zf.AWAVAUATUHSHL%%H^Ld$HH=HugH^L9H5(HFHCHHH;H H(HHHHHH HIHHH?L HLIL@HHh%SHAH5YH81X ZH OH=VH[]A\A]A^A_fH (H 'H9H(Hi'HHL%U'M,ID$H;X%BH;[%H;%IL$QE1 HYuMt$1L-%H QP A;U1LHH QP AEH= @9HI,$u ID$LP0HHHH}H/uHGP0H]HCHH5(HHIMH5dL>H5MLwIHAoEHE AoMM0IE HE@HE HEHHEHH(u HPHR0HCH5"(HHHIMHH/uHGP0LH1HHuHCHP0MI,$ID$LP0fLHPHR0HHHH4 (H 'H9HSH'HkHL5'MH%I9F^LMsQIMI,$u ID$LP0IEH5(LHHIMH%I9FM~MMfII$I. HLL薶I/H HI,$u ID$LP0H+u HCHP0IEL]fIHTHHFHHD$IHH\$3fD@$fHLM"Haf.;Iz H H=PQH+E1@IFLP0fIGLP0HL5 (H$L-%H QP A;U1LLHT$HLL"H5'= H59'H=(1s/HH H@HmtHEHP0 H H=:PHHHH fD @I1 @HQ%H5H8 H ?H=PHIHH5'LHV9HHD$IFfH=(H:'H5;'IfD iffDMl$MMt$IEII,$u ID$LP0LLWImHu IELP0MHI,$ E1ID$LP0H H=cNMOH=(CI@11LM@HnHrH%H5TH8W H= '! H=A(H'H5'IfDH=(BI@M~MMfII$I.u IFLP0LL˼I/InIGLP0_I,$H / H=[MCfDH o H=3MafDL뺷< @fD[II,$u^J / L1LM\HH=m(VH J H= ~LIm[IELP0LDf.AWAVAUATUSHHHH(H 'H<$H9HH'H3 HL=p'MIGH5'LHH IIHM IHHCI.HHI(H@H9'h H'H HL='M IGH5'LHHv IIHMq IHH%HD$I9F?HLM!IMImH<$H5'HGHHHHHD$H9EH]H LmHIEHmLHLkH+Iu HCHP0MImu IELP0I,$u ID$LP0IHPIIHu IGLP0HHL[]A\A]A^A_fDIGLP0HC>LH1`@I.xHy'H@(H9'h H'H HL='M IGH5)'LHH IIHM IH H%HD$I9D$ HLKMIIHM IHIGH5'LHH HH H56'1H輾IHEM HHEL;5O%AL;5%DL;5%L[LcE I.u IFLP0EF IGH5'LHH HHr H5'H9bHEH;% H}u}@HI%E1H?%HH|%H9-%AHmu>HMHT$HD$Q0HT$D$uHHT$oHT$A_H*u HJHQ0H'HRE[H9'` H'H HH-k'H+ HEH5'HHH IHEHM HEHIFH;D$ E1H;q%H;4% L\$TL\$HI MtLXIHc1LO|HI\L$HHGI,$uHD$ID$LP0HT$I.uIFHT$LP0HT$H;NJ%H;u% H;% HHT$пHT$ H*u HBHP0 Hr'H 'H9H2H'HbHH-'H H56'H$IHEMCHHEu HEHP0HD$I9D$}LLM\IMI.u IFLP0I/u IGLP0H5'H<$p$HH HD$H9ER H]HE LuHIHmu HEHP0LHL蝨H+Iu HCHP0M I.u IFLP0I,$u ID$LP0IEMHPIU)IFLP0yfIGLP0IGLP0ICLP0IELP0HEHP0CHEHP0XEhf.EfDHY%AHHLHI課IfH='H'H5'VIVfD$oM1f.4$H \H=(CMtI/u51IGLIP0HHmHEHP0E1H= '7I@I$qMME1IH E11ICLP0H HEE1HHEHu HEHP0My I1HIHu IFLP0MtI,$u ID$LP0MImIELP0fDH9'8H'HJHH-'HHEH5'HHHCIHEHMHEH^IGH53'LHHDHH111H,IHEMHHEu HEHP0ֹHHbLp衻IHwH'H 'H9HH'H HL'MH5'LL\$% L\$HIIHIu ICLP0H5'LL̻Imu IELP0LHLHHI,$u ID$LP0H+u HCHP0I.u IFLP0H5'H<$wHH HD$H9CLsMLkIIEH+u HCHP0HLL褣I.Iu IFLP0MG Imu IELP0I,$u ID$LP0HL蚟HH I/9IG@HEHP0PfHEHP0$NHE1E1L\$~D$Ht HL|$LL\$H\$0D$)D$ 0L\$HHMxI+nICHT$LP0HT$UHE1$ND1$M%D1$M DH=q'H'H5'IfDH=I'Hj'H5k'IfDH=!'2IO@+IjIME1$Mf$M1һM1IE10fH='2I@E1$M@Ml$M M\$IEII,$uID$L\$LP0L\$LHLL\$ImL\$IIEL\$LP0L\$fInHMnHEIEI.u IFLP0HHL臠HmIHEHP0|f.$M1IEME1E1H@_苸Hm$McH%$MHE1E1仵$M^D1$M[DIM$ME1Hf.IF@=L\$~D$Ht HL|$LL\$H\$0D$)D$ L\$HHu$FNMIHoDH5'H=j'1{HHH'*HmHEHﻶ1P0$N$NgH`LHI襩IDH;)~%HNIHEMsHI뻹$NfDMHHI:Iq1$N$*NH='H'H5'ĴH$N{H='H'H5'葴HH='.HE1E1$N蹵IH='e.HI뻻$,N脵I%wHM^MMnIIEI.IEM1ҿAE1$N$\NILM$NH$LN_HHE1$NHHH$NHH=~'HO'H5P'+IaHHE1$NHILM$WNHeM﻽$NHH$NIE-H=',I$NMME11Wf$gN?H='H'H5'UHHHE1$NHH=h'C,HLHIﻼ$iN~IFLL\$MP0IE1ҿAL\$$NI\$HuMt$HII,$u ID$LP0LHL肚H+ILHCHP0=M$xN$N$N$N$>NGILE1MHcE1E1E1~1L;5|z%HxL;5&z%H}@D L;5Az%‰ LHfAWAVAUATUHSHXL%z%H^Ld$HH~ HMHLnHD$0HD$8HD$@M9H'H m'H9H HT'H HH@'H\$@Hr HCH5'HHH ILt$8M H|$@H/uHGP0HD$@DHHD$@H IELhIHD$0H H 'H 'H9H H}'HL HL=i'M IGH5'LHH2 IM4 I/H5'H|$0L.FI.H\$8Ll$0Lt$@HCLM dH yH w%x ;9\ H $LLHAH4H $p VP H= @9H< H|$8H/uHGP0HD$8H|$@H/uHGP0HD$@H|$0H/uHGP0H\$0H;uHCHP0H\$0HCsHD$0H{ HD$H'HD$HHD$HE1HD$ LL-'IVLHH$pIHH@H$HH|LLIH LL-J'IVLHH$HHHH$LM6LHAHHHHD$@H; u%HPHT$@HLpHIH(u HPHR0Ht$@HHt$HIFH;>v% H;w%IVB, HJE1HL$ uMnH4$H u%p V;H4$P  H $LHD$IݩH $p VP H= @9.M H|$@Ll$0HtH/uHGP0Ll$0HD$@MI.u IFLP0H|$0H/uHGP0HD$0誫H} I讧HL$LJݤIGL5R'LM H QH t%P ;- H $1LLAIިH QH $P H= @9OM. I/uIGLP0M I.u IFLP0IL9d$HIHPH@HHH HIHHH?L HLIL@HHxs%SHZH5iH81XZH _JH=E1%/HXL[]A\A]A^A_MIGLP0IFLP0IHIL,IDLL='IVLHH$wHHH@H$HHHLHH LL5Q'IWLHH$HHHH$LMLHAHD$8H HHHD$@H; q%|HPHT$@HjH@HHH|$8HD$8H/Ht$@H|$8H<貜H|$@HD$0HtH/HD$0HD$@HHH|$8H/HD$8H|$0H/[HD$0}IHHL8M9t MHPHuHHLPH $MtIH$HtHMtIH} LT$LL$HͤLL$LT$HIHD$0IL|$HD$0~D$H8L`$HhLPHt H/uHGP0MtI,$u ID$LP0HtHmu HEHP0H5'1H H+Iu HCHP0M I/IGLP0@IHH2HFHHD$HџHPLl$H_fDc@$f.A{E11H|$0Ht H/uHGP0H|$8Ht H/uHGP0H|$@Ht H/uHGP0MtI/u IGLP0MtI.u IFLP0H 0DE1H=*HHHHHHCHP0胣@$f.k@$UfHo%LE1AH8E1E1A{fH='H'H5'6HFfDHao%LE1!H8讟I/tAE1f.IGLAE1P0hHGP0@HGP0q@HGP0 @HGP0+@HLL2HHBfDA{E11E1HT$HHLLXH5v'*H|$01E1A{HDSI4H=!'H@Lx!I/fDE1E1A{*f.1E1A{"H='H'H5'^I5fDE11۽A{HHLPH $EH8IHdH5'LHViHHD$HIF1fH='I@#I1۽A{6fDHt$ LIfDH81LLI/IyH|$8%HHD$8PfXLR1 uI~Ht$ AI DH=H $xH $@I/cAE1E1H˟HuH7j%H5H8fDH=QHL$(H4$H4$HL$(?fE1{kIHuHi%H5%H8譜KH=H $蠞H $HHwHxi%H5ɦE1E1A{H8@KIGLcE1AE1P0(Hj%LE1E1@AxH8 Hj%LBH8HD$8H+uHCHAxE1E11P0AxE1E11PH|$8Ht!H/uHGLT$LL$P0LT$LL$HD$8H|$@Ht!H/uHGLT$LL$P0LT$LL$yH fLT$H=LL$HD$@$LL$HL$@HT$8Ht$0LXLL$LT$HL$@HT$81Ht$0;LL$LT$H1HHLT$LL$HD$H+HL$HLL$LT$u2HD$HCHLT$ HL$LL$P0LT$ HT$HL$LL$H)u(HALT$HHT$LL$P0LT$HT$LL$H#H;,h%H;g%tL9kHLT$LL$HT$/HT$LL$LT$H*uHBLT$HLL$P0LT$LL$)Ld$0#Mt&I,$uID$LT$LLL$P0LT$LL$HD$0H|$8Ht!H/uHGLT$LL$P0LT$LL$HD$8H|$@Ht!H/uHGLT$LL$P0LT$LL$IH$LLHD$@ #E11۽AxzIH$L1LE1Ax E1cA{H*Hl$@H\$8LT$LL$艚HHLHǽ3LL$LT$HD$0HD$8HD$@U1ɺHt$ AI~4*E1E1@AxE1!E1AB@f.AWfAVAUATUHSHHe%H^H|$ H$H')D$pHD$0H$H0'HD$HH$HBHt$~2HtHHF8HD$HHE0HD$0Lm(f.L-d%HoLe LuII$$HHPH'HHH'HCHH='1HH2H+HEH'HHHH HD$H|$ HD$H8HmHS'H='H9x H'HBHH'H> HCH5'HHH` IM H+u HCHP0Hb%I9GILL6MHD$H|$I)u IALP0I.u IFLP0H'H $'H9H*H 'HZHL 'MIAH5K'LLL$HH LL$IM(I)Ha%I9GLLLgHD$H|$>H+|I,$aL;-b%dH'H5F'H9pH-'H|HH-'HHEH5'HHHbIMdHmIEI/$WIHIEH@L(MH|$H5'HGHHHH^H֖IH)H+u HCHP0IgH|$H5'HGHHHHHyHD$PHH+u HCHP0H|$PN H5'H=('1 IHH I/u IGLP0D$0Ld$AAE11E1E1HD$ HD$@HD$8HD$(HD$DHCHP0 HEHP0GHH@P0Hm1fIALP0[ID$LP0HCHP0I,$zfHEHP0IELL1I/u IGLP0IEH=i'DH@L0IH5'LIHVfHD$pHLH]@HHH HMHSHLD@H^%H5͠L ڽH81tX@ZH hH=ʮ1HĨH[]A\A]A^A_fDHnIHHcHHF8H$HE0H$HE(H$HE LHD$xHEHD$pIH'HJHcHDHD$ E11E1HD$@E1E1HD$8HD$(HD$HD$D$0Lt$A@Mt$I+uICLT$PLHL$HP0LT$PHL$HHtH)uHALT$HHP0LT$HMtI*u IBLP0T$0H ND1H=\H|$t Ht$HHD$HHu HFHP0MtImu IELP0MtI/u IGLP0HT$HtHHD$HHu HBHP0HL$(HtHHD$HHu HAHP0Ht$8HtHHD$HHu HFHP0HT$@HtHHD$HHu HBHP0HL$ HtHHD$HHu HAHP0HT$HHD$HHu HBHP0I,$]ID$LP0MHD$ E11E1HD$@E1E1E1HD$8HD$(HD$HD$D$0Lt$A@Ht8H+u2HCLT$`HL\$XHL$PLL$HP0LT$`L\$XHL$PLL$HHt9Hmu2HELT$`HL\$XHL$PLL$HP0LT$`L\$XHL$PLL$HMbI)XIALT$XLL\$PHL$HP0LT$XL\$PHL$H+H[%H8蹍Lt$E11E1E1E1E1A@HD$ HD$@HD$8HD$(HD$D$0蓒HD$ifLt$E11E1HD$ E1E1A@HD$@HD$8HD$(HD$D$0MDH='H"'H5#'讐H?fD1艉IHALd$E11E1HD$ E1A#AHD$@HD$8HD$(HD$D$0DLt$E11E1E11E1A@HD$ HD$@HD$8HD$(HD$D$0};IHY%HH5ԷH81蕐HFLHD$p迈IH5E'LHVHD$xHIM2H$Lt$pLd$xL$HD$0H$HD$HH5'LHV蝍HtH$IM~H5('LHVtHtH$IMxH5s'LHVGHtH$IMKHT$pHLLƹH5e'%{@Ld$E11E1HD$ AAHD$@HD$8HD$(HD$D$0H5'H|$HHG111HHHH+u HCHP0H5'H|$hHH11ҾH[IHH+uHD$(HCHP0LL$(LκHLL$(萈LL$(HHHmuHEHP0LL$(I)u IALP0H; W%@H;V%@ H;V%HŅH+u HCHP0vH|$H5'HGHHHHN111HXIHH+uHD$(HCHP0LL$(H|$H5V'LL$(HGHH7LL$(HH111HLL$(LL$(HH*H+uHCHP0LL$(LϺHLL$(LL$(HHqI)u IALP0Hmu HEHP0H;U%H;IU% H;gU% H詊D$XBH+u HCHP0L$X>IUHBpH`H@HSH5'LHHHIHH+u HCHP0H5'H|$HH3111HHHfHmu HEHP0IW IGHHH91H9(HIWHHIGH+u HCHP0H5ĸ'H|$ HHD$(HH2S%H9F H^H LNHIHHD$ HHuHFLL$ HP0LL$ LLHLL$ 'sH+LL$ HuHCLL$ HP0LL$ HI)u IALP0H5-'H]IHcHmuHD$ HEHP0LL$ H5o'H|$LL$ LL$ HHo111HLL$ HIHmuHD$(HEHP0L\$(LL$ IAH;Q%IiHIYHEHI)O D$ HC1ҿAH;R%H;~S% L\$(螆L\$(HHHtHhH'IcHHHHL$(HHTHcD$ 1L\!HL$(HHD$ H)u HAHP0H+u HCHP0H5'H|$IHAH'H s'H9HwHZ'HoHH F'HH5>'HLL$@HL$8lHL$8LL$@HHD$(HH)uHALL$8HP0LL$8HcP%I9A IiH IYHEHI)u IALP0HT$(HHopHmIu HEHP0HL$(HHD$(HHu HAHP0M9H+u HCHP0HL$HHD$HHu HAHP0HD$H O%HH9H@LHH {IHHI)u IALP0HCH;O%HSHHCHD$(HC HD$8HC(HD$@HD$(HHD$8HHD$@HH+u HCHP0H5_'H|$0qA H'H 'H9HMH'HHH'HH51'HaIHH+uHD$HCHP0LL$Ht'H 'H9HH'HHH p'HH5'HLL$0HL$HL$LL$0HIH)uHD$0HAHLL$P0L\$0LL$HM%I9CHt$8LLL$0L\$4yL\$LL$0HLHHmuHELL$HP0LL$H5'HLL$iLL$HHH+uHCHP0LL$Ht$@HLL$dLL$HHHmuHEHP0LL$IA1H;L%H;M%H;N%H|$PLL$t$0ӁLL$HHc!Ht$0tHhHT$ HcD$XLHL$0LL$HHTHc1HH\SLL$HL$0HH H)uHAHP0LL$I)u IALP0HL$ HHD$HHu HAHP0Ht$H+}HD$Ha H+u HCHP0L|IH H|$H5ݱ'LLT$ HGHHLT$ I*u IBLP0HD$Lt$ HH@I_HMOHII/uIGLL$LP0LL$LLHLL$kH+LL$HD$pHCLL$HP0LL$WDLt$E11E1HD$ E1E1A@HD$@HD$8HD$(HD$D$0DD$X?@E11E1E1HD$ E1A@HD$@HD$8HD$(HD$D$0f.H=ɲ'Hڧ'H5ۧ'vIfDÂLL$IfDH='dI@E11E1E1HD$ A@HD$@HD$8HD$(HD$D$0DE11E1E11E1E1A AHD$ HD$@HD$8HD$(D$08fDIoHFI_HEHI/u IGLP0LHH`iHmHD$HEHP0H=y'Hz'H5{'&HMfDLd$E11E1HD$ E1E1A9AHD$@HD$8HD$(HD$D$0EDLd$E11E1HD$ E1AzAHD$@HD$8HD$(HD$D$0ˀH<H='tH{@裀ILd$E11E1E1E1HD$ A;AHD$@HD$8HD$(HD$D$0DD$0Ld$A|AE11E1E1HD$ 1E1HD$@HD$8HD$(HD$%H5٩'H="'1IHHI/!IGLAAP0Ld$D$0@ Ld$E11E1HD$ E1AAHD$@HD$8HD$(HD$D$0P+HLd$AAD$0HLHqIHLd$E11E1HD$ E1AAHD$@HD$8HD$(HD$D$0~HDHAF%HRH5ƇABH81}Ld$D$0@Ld$E11E11E1HD$ AAHD$@HD$8HD$(HD$D$00Ld$E11E1HD$ E1AAHD$@HD$8HD$(HD$D$0[}LL$(HLd$AAD$0Ld$E11E1HD$ E1AAHD$@HD$8HD$(HD$D$0fIAL\$(LAP0HC1ҿD$ L\$(Ld$E11E1HD$ E1AAHD$@HD$8HD$(HD$D$0!HC@=MH'HtpHHL$L\$(Hl$pHD$xgL\$(HHD$ ~HtHmuHEL\$(HP0L\$(I+\ICLP0MLd$E11E1HD$ E1ATAHD$@HD$8HD$(HD$D$0Ld$AAD$0H5'H='1IHHzI/IGLAAP0Ld$D$0Ht$(LLL$8nLL$8ILLd$E11E1HD$ E1AAHD$@HD$8HD$(HD$D$0 Ld$E11E1E11HD$ ABHD$@HD$8HD$(HD$D$0Ld$E11E1E1E1HD$ AAHD$@HD$8HD$(HD$D$0Ld$E11E1HD$ ABHD$@HD$8HD$(HD$D$0Ld$E11E1E1ABHD$ HD$@HD$8HD$(HD$D$0!Ld$E11E1E1E1HD$ AAHD$@HD$8HD$(HD$D$0Ld$E11E1HD$ E1AAHD$@HD$8HD$(HD$D$0AHLuLd$ABE11D$0E1E11HD$ HD$@HD$8HD$(HD$H'HtpHHL$L\$(Hl$pHD$x3L\$(HHD$  Ld$E11IHD$@ALBHD$8HD$(HD$D$0Ld$E11E1HD$ A$BHD$@HD$8HD$D$0Ld$E11E1HD$ E1AAHD$@HD$8HD$(HD$D$0Ld$AAcLd$E11E1HD$ A2BHD$@HD$8HD$(HD$D$0HH>%H5L jAH ÜHH81rv^e@_Ld$AAD$0,Ld$E11E1HD$ A5BHD$@HD$8HD$(HD$D$0H\$0H5'Hat"H5''HWkH'H 'H9HH'HHHњ'HH5'HHHKH+uHD$HCHP0HL$H$'H5}'H9pHd'HHLP'MH5p'LHL$`L\$L\$HL$`HI0I+uHD$ICLP0HL$`LL$H5b'H|$@HL$`LL$FLL$HL$`HIHt$8HHL$hLL$`HD$tnL\$LL$`HHHL$hI+uICHL$`LLL$P0HL$`LL$1E1H;%I9AIASH;<%Hc2H;=% HL\$hHL$`LL$pLL$HL$`HIL\$hMtLXHcHL$hHL$@1HLLLT$`IlCHHILLL$5LL$LT$`HHHL$hI*uIBHL$`LP0HL$`LL$I)uIAHL$LP0HL$HL$pHL$HI/HXI$L` HL$`HD$qLL$HL$`HHLt$HH5'HLHrLL$HL$`nH5o'LHHL$HrLL$HL$HjLHHLL$HHL$%HL$LL$HHIH)uHALL$HP0LL$I)u IALP0H+u HCHP0L;5:%L;5:%L;5:%Lp}H5ݝ'H|$0-H'H 'H9HdHɖ'H@HL'MH5'LLT$LT$HHI*u IBLP0H5'1HHH_H+u HCHP0Hm HEHP0Ld$E11E1HD$ A8BHD$@HD$8HD$(HD$D$0Ld$E11A:BHD$ HD$@HD$8HD$(HD$D$0`Ld$E11E1HD$ AAHD$@HD$8HD$(HD$D$0E1L˺D$ 1E1L˺D$ HD$ Ld$E11E1AvBHD$@HD$8HD$(HD$HD$ D$02H='Hܔ'LL$(H5ؔ'nLL$(HxHD$ Ld$E1E1HD$@AxBHD$8HD$(HD$HD$ D$0OLd$E1IHD$ HD$@A\BHD$8HD$(HD$D$0Ld$E1E1IHD$@AgBHD$8HD$(HD$D$0H='LL$(LL$(H~HD$ Ld$E1E1HD$@AzBHD$8HD$HD$ D$0^Ld$E11E1HD$ E1ABHD$@HD$8HD$(HD$D$0yHD$ Ld$E11E1IHD$@ABHD$8HD$(HD$HD$ D$0HhHHLLHHEIHHD$HHuHALL$HP0LL$LLHLL$SUHmLL$HlHELL$HP0LL$SHD$ E11E1HD$@ABHD$8HD$(HD$HD$ D$0H;6%rHkHH H+u HCHP0HEHHIH HD$HLL$HI HD$(HLL$L\$(HHD$@ HӾHLL$L\$(\ Hm HEHP0L\$(LL$L\$8LL$(HQHx.HH$H HEH3%H5H81kHD$ ABE11D$0E1E11HD$HD$ HD$@HD$8HD$(IA@=HEHP0/@H s'H9Hw Hxs'HOHL=ds'M; IGH5`{'LHH HIHH IHu IGLP0H='H5'HGHH IM MIH H5'LHKNsIGH5'LM LD$ Ht$KHt$LD$ H L%QA;P  LT$ LLAHD$NKLT$ LD$H QP A=29M I/uIGLD$LP0LD$I.uIFLD$LP0LD$HCH;%T A1E1H;% H;k%eLD$ t$JHct$LD$ HI. MtLxH)'HMc1MDHLHKDLT$ LT$HII HIH+I.I$ImHx'HI,$_LI@HF(HD$Il$ DLl$HEH5Tx'I@HH3HtHHF(HD$@ID$ HHD$8ID$HD$0DIHHM~.H5y'HHVIH HD$@IM HD$@Ld$0Hl$8HD$DHH7DIH5}'HIHVmIHD$0H M~H5'HHVGIHZHD$8IG@DID$D(A-E1HIHuIGLD$LP0LD$Ht#HHHHuHCLD$HP0LD$MtI.uIFLD$LP0LD$MtI(u I@LP0t$DE1H =qH=c fDIG@=LD$~D$Ht0HLt$HD'LLD$ HD$@D$)D$0LD$ HI MtI(u I@LP0I.IFLP0IA-D$E(E1HLD$GLD$@$g@vDA+D$3(DH=u'Hm'H5m'HHfD@kDID$LLIP0Mf.IELP0\IFLP0HvMGMbI_IHI/HCI߾1ҿAH=ILT$ gALD$LT$ IA-D$F(E1HLD$ALD$H H %H5jILD$A-H8>ILD$D$F(HfDDI$HE1A%D$'H L|$~D$Ht0HLD$H|'HLD$ HD$@D$)D$0LD$ HIHA$D$'HfHrHPHC`LHImID$(xDIE1A%D$'HD$(ifDIA+D$q(H~fD1HLBIHaIE1E1A+D$|(H8LLeBIH`IA%D$'HH=QGLT$?LT$IA+E1E1D$|(Hf.[?IHGH %H5GA+H8Ht$LD$ LT$(:IA%D$'E1H#L{MLsIIH+uIFL1ALD$~>LD$HH%H52FLD$A%H8;ILD$D$'HA0D$(IGLILD$AP0HC1ҿLD$dE1E1A0D$(DHT$0HHLjH5'腱Gz'HA$D$'HZHE1MA$D$(AAGHH HoAGAWHH H)SHCHLD$LP0IF1ALD$I\$$mAXG;HE1BI1A+D$j(HA1HA$D$'HNf.AWfAVAUATUSHHXH%HnH|$)D$0HD$@HD$HH H H# HF0HD$Ls(Hk H[Hx' L(hE111AHHAIH H8u H@LP0Hdx' L(hE111AHHAIH H8u H@LP0Hx' L(hLE11A1HAHH$H H8uH@P0AEA;D$Hw'H5'b'H9pHb'HHHa'HQHCH5s'HHHIMH+CHHCH5n'HHH5IM4H+u HCHP0Hr'H\'H9PzH\'HHH \'HxHAH5l'HHL$HHHL$HHkH)u HAHP0HCH;%o1H;%IH;%HL$ t$4Hct$HL$ HH3HtHHH$I$1HNdHHDH`IHCHmu HEHP0H+u HCHP0HL$I9GWLL*MHI.uIFLD$LP0LD$H I(u I@LP0H;-$H;-$ H;-$ H 5Å}Hmu HEHP0HD$HMH=7$HHp HEL (m'HjAQt$jAQAUjHT$Pro'HH@HHmuHD$HEHP0HL$I,$DID$HL$LP0HL$IMtImu IELP0H<$H$HH$HHHBHP0L(.IH5>h'LIHV^3HD$0HHk@HH[H [HMHUH_L@H$H5?L \H81m5X3ZH [N H=SNE1{HXL[]A\A]A^A_fHD$TfDHCHP0HCHP0HEH;$H$;BH2f.KbD$L2f./bD$  H2f.bf( d$f/Y f/L$  f.d$  HD$D$L$(HHEO0HHD$ L$(f(20L\$HIY D$ L\$0L\$HH Ht$HMHHRj'5$AH H=3$jPSjPAWjPHT$`L\$Xl'HPL\$HH HmI+I/sH+ HCHL$HP0HL$EH~IH_HcHHF0HD$HHC(HD$@HC LHD$8HCHD$04+IH~7HHu0MHD$HH\$0Hl$8Lt$@HD$HM~HT$0HLL\H5'蒣y3@HE@=L\$~D$Ht0HLd$HL\$ Ll$@D$)D$0觓L\$ HHPMI+ICLP0@H$E11A D$54DHtH)u HAHP0t$H XDH=JѵM`I,$u1:f.E1@H$1A D$D4fD1A D$S4kImIDIGHL$LP0HL$vIGHL$LP0HL$tICHL$LP0HL$JHD$HEHL\$P0HL$L\$DIGLP0fHAHP0HA@=Hl$H$Ht0H~D$Ll$HHD$@D$HL$)D$0裑HL$HI H0Hm%HEHL$HP0HL$ DIFLP0AICHL$LP0HL$H5I]'LHV--HHD$HIfDE&L]Ms H]IHHmHCHA1ҿlfDHFLHD$0W'IH5`'LHV,HD$8Hx IH58]'LHVl,HD$@H\ IDD$}5A 1HHmHEHL$HP0HL$L\$~D$Ht0HLd$HL\$ Ll$@D$)D$0茤L\$ HH%D$O5M I11A HIHEHHEHuHEHL$HP0HL$MtI/uIGHL$LP0HL$HH+HCHL$HP0HL$DD$=5I11A IHu1fICHL$LP0HHL$FffD1A D$65cH=]'HzQ'H5{Q'6,HlfDH=a]'D1H=y1tHtHmu HEHP0MtImu IELP0HH[]A\A]A^A_fDD$/D$HI,$ D$ApE1@ID$LP0;HEL I$u@$bf.HELpILeI$0f.;@$"fHELpI1!IHuyfH _=f1H=&0!@Lu I<D$E1E11AifHCHP0M-3HHUI,$HID$LP0E1DH+u HCHP0IEgPHH5VC'HGHHBЅPH$HDcAfAu5AHtD$*AqCSHH HHcAH9tHN$H5H8?DDcfCSHH HcAH9tfHCHP0eImD1IELP0fLH HCHP0aDH N;gH=.Dr5H ;H=-1u@Lu(I|HEH;]$H;x$ H@hH'H@HHIMuH5G'LH@ )Imu IELP0HEH;$H;$H@hH1H@H$HIMH5G'LH 3Imu IELP0HIHpfH1iIHt4HHImIIELP0fE11D$AiHhHcAH9H:*H,@1HIHD$Ap`,afD$AjH+AE11D$Aj$H=)Ht$Ht$[DSApD$HH$H5H8 q%KI#1LHHf.I,$3AqD$'E1n IHoHH ImIIELP0f.D$AjDH=Ht$ Ht$UDfDH2H$H5H8\ D$AjDHLg9D$AiE1f.F IHHH ImIIELP0fH{HIuHD$Aj[DHE1k`3yDl@HELhIE'fH=5'HD$(H*D$=' HD$L%8'LLIWHHT$ lIHH H@HT$ HHLLIH- HD$L%G8'LLIWHHT$ H# HHHT$ LMLHAHD$HHyHHHD$@H; o$HPHT$@HH@HHH|$HHD$HH/Ht$@H|$HHIH|$@Ht H/xHD$@M H|$HH/uHGP0HD$HI,$u ID$LP0DHD$ HD$(HH<$HHHD$H4$E1Ll$Ld$0Hl$(HH`HH Lt$0LH\$8ILIIIDL$HL$HMHt$LHLI9uLl$Hl$(Lt$0H\$8H|$ H5c-'1LdI.Iu IFLP0M] I,$bHEIH+HEHHHEfDHGP0@DwGII Lt$8DwAIcHD$@GHD$ $ EE1E1E1D$tH|$@E11fDHtH/uHGLT$P0LT$H|$HHtH/uHGLT$P0LT$H|$PHtH/uHGLT$P0LT$MtI.uIFLT$LP0LT$MtI,$uID$LT$LP0LT$MtI*u IBLP0T$4$H &H=ÄHtH+E1HCHLP0HtGHmu HEHP0MtImu IELP0HmHEHP0fDMImIELP0D1@H<$/IHD$HHnIHD$@H{HD$@HD$HHD$HIE+HhH@HD$ UfDHD$fIH3~aHtHHF(HD$`ID$ LHD$XID$HD$PlIHt\Ht{Ht,MnH|$PDHcH/IH50'LIHVeHD$PH H5(.'LHVDHD$XH IM~H56,'LHVHHD$`I[@CDH|$@E1E1E1$DE111D$p$DE1D$q1E1E1E1fD$EH|$@D$E1E11E1@@$fHGP0]@HGP0|@ID$LP0H5''H=Z6'1;`IHD$HHJHpH|$HH/uHGP0HD$HE1$"ED$vH|$@1E1E1E1HI$ED$@H=Q-'H"'H5"'HfDHHD$HfH|$H&IbfD#IH=,'uH?@E1E11$ED$@H=y,'H!'H5!'fHTfDH|$PAkEHt H/uHGP0HD$PH|$@Ht H/uHGP0HD$@H|$HHt H/uHGP0H *"|DHD$HH=H|$(HL$@HT$PHt$HbNH$I9FUIH<$IHjBIHkL`HLHD$0RLT$0HIZI.uIFLP0LT$0I*u IBLP0H|$HHt H/uHGP0HD$HH|$PHt H/uHGP0HD$PH|$@Ht H/uHGP0HD$(HL$ L|$(HD$@~D$(HHl$(H8LpD$(L`HHHt H/uHGP0MtI.u IFLP0MI,$ID$LP0f$ED$@AmEDs/fDH=*'sH@$ED$w@A|EDHGHD$HHHWHHH|$PHT$PH/uHGP0Ht$HH|$PHLxAE*DH|$PAEHFHHD$P_IPHLLHHH|$@E1E1$ED$wH|$@E1E1E1$(FD$NfDH=L>H|$@$EIHH|$@E1E1E1$ED$D$EE1E1E1D$}HD$(HL$ HLLT$E11HcH|$@LT$HQ$LH8H|$@E1E1$;FD$gH$LH8n$=FHD$HI.u IFLP0H|$@E1E1E1D$$?ED$y@$KF$AED$y@LIHE1E1$ED$~E1$ED$~$ED$~E1$ED$~H|$@E1E1$FD$AHT$PHLL H58&glD/H@`HHHHHHPL5b$L9HCHHHD$HH5"HcHDsAIcHD$H+AHSHR02DsCII ILt$ϋCHD$H+*DsCII Lt$H+ HR0HD$DH50HYHHHPHHD$MD$ED$vHHY$H JH5KjL VAH\H81Y^DI\$9H~$H5H8WH H$H5H8.HB`H HHHIHL9pID$t(ID$HD$HHH !HcHLmHD$I,$ID$LP0Et$AIcHD$Et$AD$II ILt$AD$HD$Et$AD$II Lt$H5bHXIH6H+HCHP0LHD$NHuH$H5H8$=F@f.AWAVAUATUSHH(HF6 LfIT$H H HcHHCH5!'HHH IM_HHcHHHwH5 'HHHmu HEHP0H-,'H 'H9HtH}'HHH-i'HxHEH5'HHHIM|Hmu HEHP0H5,&'LHIImu IELP0IFL-'HHuL= $H QP A;HLLITH QP AH= @9pMI.u IFLP0H+u HCHP0IEH5&'LHHAIMCImu IELP0IFH;$)M~MI^IHI.u IFLP0H!'LHI/Hu IGLP0H5H+u HCHP0HEH5'HHH$IHEHHEM2Hu HEHP0H$I9FMnMI^IEHI.u IFLP0Ll$HCH;$JH;s$HSB~HjE1 uLsL=$H QP A;LLHaH QP A=29HNImH+u HCHP0HELhpMI}LHHH=$HHH+Iu HCHP0MLHAUI,$uIT$HD$LR0HD$HUHJHSHMHuHUHD$HR0HD$H([]A\A]A^A_DfFII LIl$HHIHHeDDfFII IIuTIH/H NH=wr1eDfAMc@DfmH=\#@Imu1IELP0HEAH+A"uDE11HPH$H5&H81DHUHBHEHtSA"ADDH pH=>qH(1[]A\A]A^A_DHt3A"AtDHEHA"AP0HEHA"AtP0H-!'H;r$Hl$H;0$jIVBHZE1 uMnGL=д$H QP A;HLHH QP A='29HLLL]nH_DH8I@$fA!A/#IE1A!A=I.u IFLP0H+u HCHP0HtHmu HEHP0M#ImIELP0 I.u IFLP0A9A!E1A!A;k@@DA!1ALDDH=!'H 'H5 'HfDE1A"AG@H='cHS@A"AIIV@D#@$f.LHLIHfD1A!AVdDH=]E1A!1AV5fD3IA"AbMHHuH4$H5A!AVH8@H=A@LAqf@$fIHLeHDLHeHImOTf.Ht$L^HfDtLB1 uI~Ht$AAH~Ht$H^H|fDHH$H5TH80LB1 uH{Ht$AHD3HJH$H5H8t/H@`H3HH#HIHHPH;$fMeIL$HH5}HcHEeAMcImIULR0 @EeAEII I@EeImtEeAEII ImLE1R0xf.H5H1KIHHP@LIBHaH$H5 H8FHB`HHHLHHHR$H9EHEt#LeID$HH1HcHH_IHmHEHP0DeAMcDeEII IDeDeEII HH5SJHH[ImWIELP0HHIk1ɺAH;yHuHu$H5 H81ɺAH f.AWAVAUATUHSHHHcHCHHHUH5'HHHHIM\WHHH5$'HHIEL5.'LMAL=ʬ$H QP A;HLLAIH QP AH=j9pMIm.HmH+u HCHP0HL[]A\A]A^A_fDH_HHyHEH;f$LuMLmIIEHmLt$IEH;;$]H;$IUBHjE1 uMeL=$H QP A;LLIH QP A=E29zMI.IFLP0MLAA'H;y$H;<$HMQE1 LauLmQL=ڪ$H QP A;1LAI(H QP AH= @9IM0ImIELP0fDHEHP0nfHEHP0IELP0Hmf @9}@$@HIHH$ILl$HD$1LLL:H$H@uHh$H H5 E1H810AA&DDE1H :H=eA!'ImAu IELP0HmuHEHP0@D{@$nf11HIVIfK@$xfHAA';AA&#I^ImnIELAA'P0f.LL-'ML=-$H QP A;1LHAKLLM\II.HLL*IHUfDA"'sDH=!f[HuHǦ$H5H8fDHt$L&UIdfDHH{$H5H8TLB1 uI}Ht$AIDH=YH=90@I.zE1_fD[HuHǥ$H5H8H $HH2$H^H5E1H81L1HIIH=V1ɺAI AA'fDAWAVAUATUHSHHHcHCHHHUH5 'HHHHIM\HHH5 'HHiIEL5'LML=:$H QP A;HLLAIH QP AH=j9pMIm.HmH+u HCHP0HL[]A\A]A^A_fDH_HHyHEH;֣$LuMLmIIEHmLt$IEH;$]H;n$IUBHjE1 uMeL=$H QP A;LLI\H QP A=E29zMI.IFLP0MLAA&H;$H;$HMQE1 LauLmL=J$H QP A;1LAIH QP AH= @9IM0ImIELP0fDHEHP0nfHEHP0IELP0Hmf @9@$@HI%HH$ILl$HD$1LLL:H$H@uHء$HqH5zE1H81u0AAe&DDE1H H=-x]A&ImAu IELP0HmuHEHP0@D@$nf11HI!OIf@$xf;HAA&;AAq&#I^ImnIELAA&P0f.LL-'ML=$H QP A;1LHAKLLTII.HLLIHUfDA&sDH=LfHuH7$H5H8fDHt$LMIdfDHH$H5<H8LB1 uI}Ht$AIDH=H=d0@I.zE1_fDHuH7$H5H8H $HH$H;H5lE1H81?L1HIIH= 1ɺAI AA&fDAWAVAUATIUSHH$H^H|$HDŽ$H$H H H Hn I\$HD$xHHDŽ$HDŽ$9H$H H4' L(hE1ɹAHHAIHD$xHH$HH|$xH/uHGP0H'L$HD$xHDŽ$H5&H9pH&HRHH&H\$xHaHCH5v 'HHH3IL$H|$xMH/uHGP0H'H%&HD$xH9PH&HJHL=&MnIGH5#'LHHIMI/ IFH;$E1E1H;{$ H;>$ L$_L$HHMtLxH&LcIIENlHJDIFLML%$p VP A;$1HLAIP P A$= 29T M#L|$xH+u HCHP0I.u IFLP0H$HGH;k$ULt$xH;i$L$H;$$6HWBoHZE1 uL;L%Ě$P P A;$LLHp VP A$H= @9 HH$H|$xH/uHGP0H$HD$xH_H$H/uHGP0H$H;=s$HDŽ$AH;=$Dh H;=1$[ vH$D$H/uHGP0HDŽ$L$eIEH;-$HD$0 HD$(H@HL0Mt L;5$HPHuHPH@HT$HD$ MHD$HtHHD$ HtHH 'Hz&H9PHa&HHH=M&H$HD HGH5y'HHHD$xH$HH/uHGP0H|$xH$HDŽ$H9GHJH$H$HtH/ H$HDŽ$H|$xHH/uHGP0H<$HHD$xH$HD$xH UHH$H1~$HDŽ$HDŽ$D$xHD$x@Mt I. HL$HtHHD$HH Ht$ HtHHD$HH H'H&H9P(H&HhHL=u&L|$xM'IGH5d&LHHqIL$H|$xM.H/uHGP0H2'H &HD$xH9HH&HHL=&L|$xM7IGH5'LHHIH|$xMH/uHGP0H$HD$xHAH;v$H;y$#H;<$^ aIHHD$xHt IGHD$xHcD$H1LI\MdH$/IH$HI/ H$H/9 H$HDŽ$HL$HD$IFAvHDŽ$I~ HD$HH'L%'HD$8HD$LHHUHHT$IHaH@HT$HHLHIHFHD$L%'HLHUHHT$NH4HHHT$LMHHAH$H?HHH; $ HhH H@HEHH$H$H/= H$HH$HmZ H$HAH$H/H$HDŽ$H/HDŽ$H|$8HD$P,H $HD$0Lt$`1Ld$HLl$hHL|$HHD$ HHH\$XHHHD$(HHHD$@@HHD$M4L|$0fMHHHD$AH|$II $ $AEXL9|$ u^f(Hf(1ff.fAfYAHH9D$(uHD$@H9tHIYHH9l$87H\$XL|$HLt$`Ll$hH|$PH5 &1L,I/HSHHmu HEHP0Hl$HEImIIHI(I\$HHH HOHL LOL@HH$SHH5}H81+X GZH sH=E19MHĸL[]A\A]A^A_@HaIGLP0 IF@=3L|$~D$HHLl$H1&LH$D$)$)HHD$xH#H$E1L$GD$ f@QDHPH@HT$HD$ IQDAĉD$HH H H`HH5&HIHVINH$H!M H$H$ s@$f.$EGH|$x11E1E1E1E1D$HD$Ht H/uHGP0H$Ht H/uHGP0H$Ht H/uHGP0MtI/u IGLP0HtHmu HEHP0MtI,$u ID$LP0T$4$H H=JMtImur1IELIP0MtI.u IFLP0HtH+u HCHP0HL$HBHH$HH.HAHP0E1@$f.H<$7IH$H HH$H H$HDŽ$HDŽ$HC@L|$~D$HHLl$H&LH$D$)$;HHD$xHH MI/wIGLP0hfDH|$xHHt H/uHGP0H$HD$xHt H/uHGP0H$HDŽ$Ht H/uHGP0H  HDŽ$H=HH|$(H$HT$xH$+ HW$H9EHEH<$IH IH L`HH.HH Hmu HEHP0I/u IGLP0H$Ht H/uHGP0H|$xHDŽ$Ht H/uHGP0H$HD$xHt H/uHGP0HD$(HL$ LHDŽ$HT$H/f$OGE11E1D$H$1HD$E1fDH$E11E1$^GD$H=Y&H&H5&HGfD1HGP0@HGP0@HGP0[@HGP0-@IGLP0fIGLP0HGP0@HFHP0qHAHP0AIFLP0HEHP0H= ľIH$L1HD$xE1$GD$HdIH $PHE11D$ HD$(HL$ L1HT$E1HA-H|$xHD$>fDE111E1HD$$`GD$H=&:H@IHA@=HD$xHHHH$H$L$c"H|$xIH$H Ht H/uHGP0HD$xI,$ID$LP0y@H|$xE111HD$E1$cGD$$@H=&H:&H5;&fI7fDL=H5HBH$I H|$xE111HD$$eGD$H=!&8I@M~MSI^IHI.u IFLP0HCI޹1ҿAf1E11E1$GD$fH_HHGHHH$H$H/uHGP0HT$xH$HH$H+HCHP0@H$4HfD$GH|$xD$E11E11HD$E1ALE1E1H|$xHD$$GD$DIofH)$kH~H$HHLH5֔&/UFHFHH$I@H5&H=&1c IH$HfH1H$H/uHGP0H|$x$GHDŽ$D$D1HLIHD$xHlf.ILH$1$GD$@HH$ LJE1 uLGH$LAHfDHHD$xd@H=y4K@1~HD$xHHHH$H$L$2H|$xIH$H]1E1HD$$HD$ D;HHwH$H5H8y@H5i&HHVMHH$IFxH=&HZ&H5[&覺IfDH$E11$HD$ H=&4I@E11E1$HHD$D$ 苻IH=&H&H5&HifDH$E11$HD$ xH= &HZ&H5[&趹IqfDH=&3H@HjfDۺfD˺IWH=&t3I@1E1E1$HHD$D$ HGH$HHWHHH|$xHT$xH/uHGP0H$H|$xHHʡDHfDHqHt$xHHAHHH$H$H/uHGP0H$1ҿHAD$H|$xH Hz$LH8ϲH|$xE11$HD$HJ$LH8蟲$HHDŽ$I/u IGLP0H|$xE11E1D$bH|$x1E1$HHD$D$ ;H|$xE11HD$$HD$ $DHE11E1D$ $H`H|$xE111HD$E1$GD$H$E1L$wGD$H|$xE11E1HD$E1$GD$qH|$xE1E1$ID$RE1$RHD$ $THD$ E1$YHD$ E1H|$xE111HD$E1$GD$H~$H5H8藱P1E1HD$$HD$ 1ɺLAHH[$HAWAVIAUIHATUSHhHD$0HD$8HD$@HD$HHD$PHD$X.HD INH&HH9MHXHH~H~(H;VJ1fDH9T5HH9uIH5&yIHE"IH5&ZHD$@HS"HD$8Hl}$H9XHPHT$8HH@HHH|$@HD$@H/PHt$8HD$@HH蕨H|$8HD$0HtH/uHGP0HD$0HD$8H("H|$@H/uHGP0HD$@H|$0H/uHGP0HD$0HI OHL$XHT$PHt$HHHHHL葳11LHI?$HD$0H11HL"$HD$@HdH %~$IFHT$0HL$H9H@hH!H@(HHLЅ<H|$0H/uHGP0HD$0HT$@IFH;D$H@hHHH@(H;LLЅH|$@H/dHGP0HD$@HH|$HHt H/uHGP0HD$HH|$PHt H/uHGP0HD$PH|$XHt H/uHGP0H5\&1LHD$XHD$XI/u IGLP0L|$XMx#I/u IGLP0L%{$I$DHH5&LHHHH5A&H9tTHCH;{$H{u {t6fDL%{$H R{$I$LH $*f.CzuH){$L%z$HH$HD$0H+u HCHP0H|$0H;<$L9H;=z$H|$0Å"H/uHGP0HD$0INHQ&yH9HH5&LHHH|$8HHdz$L%z$H9H$L9u H;=*z$H/uHGP0HD$8WH5&LHHD$8HH;$L9H;=y$ H|$8ÅH/uHGP0HD$8H&H&H9XH&HgHH=&H|$0HNHGH5&HHcIL|$@H|$0M3H/uHGP0IVHs&HD$0HBpHH@HHLHD$0HH|$@Hw$H9_HJH1AX0JvfD@JAYx軠InIFHHPHX$YH|$01AtLHX$Ht$H8裊Ht$+Ht$̋HKHt$.HX$L%W$H$HHH&IN>AWAVAUIATUSHXHW$L5Y&H|$LfHD$0H\$8H\$@Lt$HHw I ~+ItI Lv0IE(HD$Im H\$HIV MmIEHEH9gH=&Lt$0HGH; W$ H;W$ HWB LbE1 H V$p VP ;HL$LLAI̊H QHL$P =@9MID$H5v&LHH IMM L;NV$L;U$aI9XLLT$[LT$AI*u IRLR0H&HRE7H9P&H;&HHL'&MIBH5&LLT$HHLT$IIHMIHIGH5&LMLL$ Ht$cH T$LL$ p V;Ht$P !1HL$ LAHD$*HL$ HT$x wp =@9$ HI/uIGHT$LP0HT$H*u HBHP0ID$H5&LHHBHH HuS$H9B+ HJH LZHIH*uHBL\$ HHL$P0HL$L\$ HLHL$ L\$~HL$ L\$IH)uHAL\$HP0L\$IHMIHu ICLP0I,$u ID$LP0H&MHPH9 &H&HHL&MIBH5&LLT$HHLT$IIHMIHLLvIIMHIL; S$L;R$u I9yDI*EHD$HE1LHLLH IARHT$LT$ &_AXLT$HII3HIu IBLP0H9\$ILI,$uID$LP0MtI/u IGLP0Imu IELP0Hmu HEHP0HXH[]A\A]A^A_L29b@$TDIEH+L%r&I$ImLMhIBLP0CfIGLT$LP0LT$MIRLR0EkHF&H5&H9pHf&HHLR&MICH5.&LL\$HHL\$IIHMIHu ICLP0LLIIMHIuIGL\$LP0L\$L;wP$L;%P$u I9DI+7 E HG&H p&H9HHW&H=HLC&MIBH5?&LLT$HHLT$IIHMIHu IBLP0LLIIMHIuIGLT$LP0LT$L;xO$L;&O$ I9 LLT$腄LT$AII*u IRLR0E, HD$HE1HLLLH IARHT$LT$ T&IXZLT$MIKH1ɻD$fDHCHP0IELLMP0dIBLP0 fLLT$裃LT$AnI1E1D$H12DID$1E1OHIHu0E1IBHL$LL\$P0L\$HL$Mt I+HtHHHHu HAHP0T$H *H=-I,$<,LL\$賂L\$AD$I+1E1ICHL$LP0HL$XH|IH5&HIHV辁HD$0HlMe@MHWH GHOHUL .LOLD@HH#L$ATH]H5H81XZH H=1VH\$fD@LHIMH A1H=}IHHxJcHHF0HD$HIE(HD$@IE HHD$8IEHD$04{II3~aIQIu*M~.H5!&HHVMH+ HD$HIM HD$@Ll$0Hl$8Lt$HHD$Mu5f.HHT$HT$II1Ht$0IfMH uH=xCI,$E1tsIeHT$~HT$@$IH5J$L{HH H;}J$H; +J$@H;L$5HHL$HL$ H)uHAT$HP0T$H5jJ$LU{HH4H;I$H;I$ H9 HHL$HL$H)uHAT$HP0T$hH&H Z&H9HHA&H>HH -&HH5m&HHL$HL$HHH)uHD$HAHP0HT$H5&HHT$HT$HIH*uHD$HBHP0L\$L޺LL\$zL\$HHI+uHD$ICLP0HL$H; H$H; MH$ H9 HHL$}HL$H)uHAT$HP0T$I.uIFT$LP0T$H'&H=Р&H9xfH&HHH &HjHAH5&HHL$HHwHL$HHHHuHHuHAHT$HP0HT$HF$H9BZHLHT$qHT$IIIHMIHuICLT$LP0LT$IBH56&LLT$HHLT$HIHHIHuIBHL$LP0HL$H5ɷ&HϺHL$xHL$HIHHHuHALT$HP0LT$L;F$L;=F$I9LLT${LT$FI*u IBLP0IH*E$I9F LLpMHIHH` IHu ICLP0I,$DH=HL$yHL$yDzHfHD$H5ԁH8\wKHD$HE1HLLLH IASHT$L\$ ȵ&Y^L\$HII HIICLP0fDISLR0H=HL$(xHt$LL$ HL$(ID$MhE1HfDIH1]DHFHHD$0sIM H5&HHV(yHtHD$8IMH5&HHVxHHD$@ILJE1 uLGHt$0? LAIH=I&H &H5 &yIfDH=!&I@+{LT$IfD1ɻD$M@MHE1D$@I.[H=1&Hj&H5k&FyI/fDzLT$IMfD1ɻ]D$@H=٥&I@Db1LyHHDH tH=kfDyHvHZH A$H5\~H8s?D$FfDH&H5&H9pH&HHL&MH5ݫ&LL\$pL\$HIIHIu ICLP0LLrIIMHIuIGL\$LP0L\$L;>A$L;@$I9LL\$KvL\$AI+u ISLR0EHD$HE1HLLLH IASHT$L\$ &AZA[L\$HII`HD$?@H=&H&H5&vILfDH1ɻD$1+`H=&tI@D$6fDwL\$IfDMH1E1D$f.H=)&HJ&H5K&uHfDtD$fDH=&Ha@vHL$HfDvD$[HJHLZHIH*uHBHL$HL\$P0L\$HL$HLLHL$L\$^HL$L\$IH)UHAL\$HLT$P0LT$L\$2D$(vLT$HgD$RHT$0LHLH5@G&{D%HI˻D$WID$1HIMID$HkHѮ&H=ږ&H9xH&HHL&MH5%&LLT$HLT$HII5HIu IBLP0LLnIIM~HIuIGLT$LP0LT$L;=$L;<$+I9"LLT$#rLT$AI*u IRLR0E%HD$HE1HLLLH IARHT$LT$ *&AXAYLT$HIIH1ɻjD$KfII˻JHI1MD$HO'HD$ZH=&H4&H55&@rIH=b&=IpsLT$I1ɻD$D$INH`M^HII.uIFHL$LL\$P0L\$HL$HLLHL$L\$ZHL$L\$HH)HAL\$HP0L\$MHE1D$HL5+&MIFH5ߘ&LHHHHl$@HI.u IFLP0HL$@H5,$HAHt$ H9A1E1H;,$IH;-$ t$`HHD$HHMt$tLpH-$LcIE1IHNlHJDH|$@eIHH|$HH/uHGP0HD$HH|$@H/uHGP0Ll$@I}uIELP0Ll$@HD$@E1H>&AuI} LHLL &HD$1AHHaH;+$HD$HMtI.u IFLP0HEH5&HHD$HHHHD$HHHL&H|$HHD$@HH/uHGP0HD$HH|$@H/uHGP0HD$L5&HD$@LLIWHHT$(\`HD$HH@HT$(HHLH|$HD$H HD$L51&LLIWHHT$(_H]HHHT$(LMLHAHD$HH HHHD$PH;L$ EHPHT$PH3H@HHH|$HHD$HH/ Ht$PH|$HHTH|$PHD$@HtH/ HD$@HD$PHKH|$HH/uHGP0HD$HH|$@H/uHGP0HD$@E1`HD$ HD$HH`H H|$Ll$Lt$Ld$(MIH\$HfH0HLL0H@H0H8H0H6Z1IEMHE $oH(H0H0H@(;}}MHcHLH0H@H0Pt8H(HR8HcR H0;}|IM94Ll$H\$Ld$(H|$ KXL|$H5&1LEHD$hIHD$HIu H|$HGP0H|$hHH/{ HD$hI}MHEHHEH+MgIHVH FHMHATHL@H,'$H5%iL 2H81^X6ZH  H=:yE1HĘL[]A\A]A^A_DI~Lx\f.D$HEHEHPHD$HL H HcH@DuAIcHD$H|$u!L[HJHD$f.H=&D$&ofH=׎&H*D$ʖ&L;-b&$ Hu&H &H9HlH&HHH-с&Hl$HHkHEH5&HHHILt$@H|$HMH/k HL$@H5$$HD$HHAHt$ H9rH;%$H;&$k YIH2HD$HHt IFHD$HH%$IEHcLOlHIDH|$@1'HHD$PHI. H|$@H/HD$PHD$@HH|$PH/Lt$@H&HD$PHD$@AvI~ L-%&HD$(IFLHD$8HD$LIWHHT$0YHHH@HT$0HHB HLHHFHD$L=ʏ&LLIUHHT$0YHHpHT$0LMLHAHD$PHHpH;t$  LhM H@IEHH|$PHD$PH/uHGP0H|$PL9NHD$@Imu IELP0HD$@HH|$PH/uHGP0HD$PH|$@H/uHGP0HD$@YH|$(HD$ ~nL|$8Ht$(Ld$0HD$H\$(M,MHl$HH`MH Ll$HHfD$HLHITID$M9uHl$H\$(Ld$0H|$ RH5&1H褼HD$hHmu HEHP0Hl$hHHmu HEHP0HD$hI>zM1IFLMP0HtHmu HEHP0HtH+u HCHP0MI,$ID$LP0@u;HP0H;0HHP0H0H0H0HcL MA(M9(iIA(H0H(H)0+IA(H0H(H)0pH0HcL MA(M;(}ILD(H0H(H01H@0H0H@(H0H(H+0H0II ~qItIHF(H$IG LHD$xIGHD$pPIItkIMt7M Hl$pLt$xL$MwHOIH5&LIHVTHD$pH D$9H5&Hx Hl$HfDMMfDMA/ D$T8|fHD$HHtpHHLl$xHD$pH$H$IHD$PH1AF D$9<@1E1A? D$9 MA/ D$V8&f.A' D$7DH$LA0 MH8ED$c81E1A' D$7HA@=oLt$~D$HtpHLl$H$HH$D$)D$p2HD$@H` MtI.u IFLP0ImIELP0tDH$LH8ED$e8HD$HHL$HHD$HHugHAHMA0 P0H=q{&Hro&H5so&JHfDE1AF D$9df.MA0 bfD$s8fH= {&H3@1AF D$9?JI;HqHt$HH|HAHHH|$@HD$@H/uHGP0HL$@1ҿAHA9Hw$LAJ H8CD$#:HT$pLLLtH5P&!6H"$LH8wCD$%:HD$PHmuBHEHAJ 1P0(1AF D$9MA0 D$81AJ D$9MAF I.E1fIELP0D$3:nH|Lt$~D$HtpHLl$H$HH$D$)D$pHD$@HD$8ImA* /rA* D$7/H=x&Hl&H5l&GI1H5&HxHl$@H=x&IMD$7A* HAJ D$t:HHA$H5:RL GojAH nHrH81G^6_E1A* D$7I$HILqM4HAIHH|$HHD$HH/uHGP0HL$HA1ҿHAD$81AB D$,9H|$HA* D$*8D$.9I.uIFL1E1AB P01E1AB zA1D$<91E1A= D$9AH|$HHt H/uHGP0HD$HH|$PHt H/uHGP0H lC Z9HD$PH=`tH|$ HL$PHT$HHt$@KiHL$PHT$H1Ht$@8GHL1HLHD$(蝨I.HL$(HuHD$0IFLP0HT$0HL$(H)uHAHT$(HP0HT$(H H;t$H;"$H;@$HHT$(}CHT$(AH*u HBHP0EHt$@EHtH.u HFHP0HD$@H|$HHt H/uHGP0HD$HH|$PHt H/uHGP0HD$ HL$XHD$PHT$`Ht$hHpH@`H'HHHHHHHH; $ft'HEHD$HHH5qHcHHA`HHHHIHH3 $I9FL9I.HD$uIFLP0@HmHMHQ0DuAIcHD$DuEII ILt$뽋EHD$HmDuEII Lt$H53lHHHGHHH@HD$]LA. MD$I81A' D$71AB D$9H*D1AF D$9r1E1A) D$7ZD$p9HD$ HL$XE1AB HT$`Ht$hH9$?HeH $H5gH8=JA1D$8Lt$PLl$HHt$?Ht$LLHD$9HD$@HD$HHD$P6LH5jYIHHmHEHP0D$t9D$}9D$y9D$e82>HuH $H5fH8;D$%:AJ D$#:MA0 D$c8AVAUIATUSHHz&H f&H9H1He&HYHHe&HHCH5s&HHHIHHHMH^ID$H;Z$ H;] $Ll$RH; $mIT$BUHZ1 '2=L5$H QP A;yLHH =H QP A=@9HcLHEHHyHEHu HEHP0H;$H;C$H;a$H=ŅaH+u HCHP0IE-hI]HSHH lHcHfDHCHP0fIl$fD29;@$A]AEHH HHuH$HHD$ HHu HBHP0HD$HH=#LHp ILL B[&j5Z&Sj5i[&ATjLD$XHT$P-c&IH@HI.u IFLP0LM H$Hl$IHaE11D$D$x?L0"IH5Z&LIHVf'HD$0HH]@HHOH OHMHSHmTL@H#H53L PH81u)XW=ZH OH=kD1脭HXH[]A\A]A^A_fHD$TfDHCHP0HCHP0H$;BLIH LnIH HYHH K.H9/ HD$LLI$$IH LHD$$LT$HI H$LT$HH Ht$HE1LjAH=#5X&H Pj5"Y&AVj5X&ARHT$`LT$X`&HPLT$HI I,$I*I.H+LIH HmI/L@H$HH$HHu HBHP0MImIELP0H$E1E11D$E1E1D$=f.1E1E1Mt.I.u(IFHL$(LLD$ LT$P0HL$(LD$ LT$Ht.H+u(HCHL$(HLD$ LT$P0HL$(LD$ LT$Mt0I,$u)ID$HL$(LLD$ LT$P0HL$(LD$ LT$Mt$I*uIBHL$ LLD$P0HL$ LD$MtI(uI@HL$LP0HL$HtH)u HAHP0T$t$H gLH=A5HtHmE1HEHLP0MtI/u IGLP0H<$-FHIHpSHcHHF0HD$HHE(HD$@HE LHD$8HEHD$0IHc~7H|Hu0MHD$HLl$0Ld$8H\$@HD$XH8M~HT$0HLLOH5%yC=@1fI@@=LT$~D$Ht0HHl$LLT$ L|$@D$LD$)D$0LD$LT$ HIMI*IBLD$LP0LD$E1H$E11E1D$D$=ID$@=LD$H$Ht0H~D$Ll$LLD$ HD$@D$)D$0RLD$ HI MtI(uI@LT$LP0LT$ImIELT$LP0LT$fDE1E11E1D$D$=8ID$LP0HCHP0iIFLP0OIBLP05ID$LT$LP0LT$fDHD$HAHP0LT$L ÅE1D$1E1D$>HCHP0 IFHL$LP0HL$$H5 P&LHVH4HD$HI!fDH=R&HF&H5F&F!IVfDHFLHD$0GIH5S&LHVHD$8H IH50R&LHV\HD$@HK I`DLLLHD$|E1E1E1D$D$^>RfH=Q&HJF&H5KF&v HfDLT$~D$Ht0HHl$LLT$ L|$@D$LD$)D$0OLD$LT$ HI}I$D$1D$|>H1I$Hu=ID$HL$(LE1LD$ E1LT$P0LT$LD$ HL$(fE1E1mD IH=P&褙H@E1E1D$D$`>DE1E1D$D$c>DH=qP&HD&H5D&HfDLD$H$Ht0H~D$Ll$LLD$ HD$@D$)D$0LD$ HIIED$>HIE1D$HuIELD$LP0MLD$ I$1E1HxfDH=O&|H@I H IE11D$e>D$LLLT$ =LLT$ IjDI$1E1D$D$h>HfDH= O&I@I$1D$D$j>HfLT$IfDMPMIXIHI(HCI1һAKHE1D$E11D$=E1fHE1D$E11D$=E1fHE1D$E11D$=E1bfH5G&H=:V&1IH2HǐImu IELP0E1D$E11D$=E1fDMD$MI\$IHI,$GHCI1һsLL"LHI$1E1E1D$HD$>I$D$D$>HID$#>E11D$HIHMI^HINHHI.uIFHL$ LLT$P0LT$HL$ LHHLT$ HL$ H+HL$ILT$ AHCHL$ HLT$P0HL$ LT$E11ID$D$>sI$E1D$D$>HIE1D$->D$HIED$>HIE1D$7>D$HH5E&H=S&1}IH?H`Imu IELP0E1D$E11D$>E1I$E1D$D$>HE11D$D$H>eE1E11D$D$>HIYH=J&H?&H5?&aHsE1E1D$D$>I@LLT$AP0HCI1һLT$H=EJ& HSI1E1D$D$>ID$LLD$IP0HC1һLD$E1E11ID$D$?AH5R&HxёwLd$E11E1D$D$?E1Hl$E11D$D$?IZH=QI&H=&H5=&HtE1Hl$E1D$D$?1IsH=I&ݑH3Hl$1E1ID$D$ ?HH#H >H5"jL ?AHCH81:Y^9=E1Hl$1ID$D$0?H5Q&I|${Hl$E11E1D$D$3?ME1Hl$E11D$D$>?'IME1Hl$E1D$D$@?\H=G&H<&H5<&HHH#AH5!jL >H r=H8HA1!_3=AXIpH=`G&;H0MHl$E1D$D$B?ME1Hl$E1ID$D$R?H$M1MHl$E1D$ D$j?dH5O&H{MHl$IE1D$1E1D$U?$E1E11E1D$D$=1I$1D$D$>HIE1MD$>D$H]E11E1D$D$>|E11E1wE1E111E1D$e>D$Zf.AVAUIATIUHSH H#H^HD$HT$MHHHHT;H D;HOHR<L +;LOL@HH!#SH?H5H81X<ZH ;NH=/ј1H []A\A]A^fHV I|$HHHu E1H@&AHH J&jQPjQHPj5ZD&WH=#$M&HHPHHHHt@HHtCHmiHUHD$HR0HD$H []A\A]A^HCHP0@H :<HD$H=.ޗHD$HHHnL H5C&LIHVIHD$HMH|$HT$HHt'H ~9<H=W.B1lHCHP0@oFL)D$& H~HT$HLL=H5%Ӄq<HFLHD$ IDH5)@&LHV HtHD$IFI\$KAVAUIATIUHSH H#H^HD$HT$MHHHHT8H D8HOHR9L +8LOL@HH!#SH<H5H81X<ZH 8 H=-ѕ1H []A\A]A^fHV I|$HHHu E1H=&AHH G&jQPjQHPj5G&WH=#$J&HHPHHHHt@HHtCHmiHUHD$HR0HD$H []A\A]A^HCHP0@LH 7T<HD$H=#,ޔHD$HHHnLH5F&LIHVI HD$HMH|$HT$HHt'H ~6GF<H=+B1lHCHP0@oFL)D$&H~HT$HLL:H5%Ӏq <HFLHD$IDH5)=&LHV HtHD$IFI\$KAUATIUHSH(H:&H#H^HD$HT$MHHHHHM5IH :5H9HIHH,#I?SIH5H8L '6A1X;ZH 5 H=>*ђ1H([]A\A]@HHlHeLIHHD$HT$fDHHHu E1H 9&AHH=D&jWQjWH=#QHj 5@&PF&HHHPHHHtAHHtTHm*HUHD$HR0HD$H([]A\A]f.HCHP0@HV HF; H 3;HD$H=(莑HD$HHt'H 3 ;H=(Z1HCHP0@oFL)D$>HHT$HLL7H5%}wz; DHFLHD$IMKH5<:&LHV HtHD$IEH5?&LHV HtHD$If.AVfAUIATIUHSH0H#H^)D$HT$ MyHHtyHHG2H 72HMHSH6L@H#H5L $3H81 X:ZH 2Q H=d'Ϗ1H0[]A\A]A^HV(IL$ ID$HHHuHE1AH=#Hj5A&57&j5Y;&QHj5U<&PD&HHHPHHHt:HHt=HmeHUHD$HR0HD$H0[]A\A]A^ÐHCHP0@ H 1,;HD$H=s&ގHD$HF~tHtH{HF(HD$ ID$ LHD$ID$HD$IHtoHHt;MHD$HL$HT$ f.HLOIH5%;&LIHVHD$H%H59&LHVdHD$HIM{H5R7&LHV6HtjHD$ ILHHt'H / ;H=/%蚍1HCHP0@HFLHD$IPHT$HLL4H5%)z:PHHD#H 5/H56jL A0AH3H81Y^: I\$AWAVIAUATUSHHU#H^H|$H$HU#HDŽ$H$H"#H$HH ~%HH Hn0Mn(IF H L-#HI^H$HDŽ$HDŽ$HDŽ$HDŽ$HDŽ$HDŽ$HDŽ$HH$HHuA&HEH )+&H9HH+&HHL%*&L$MID$H5'=&LHH\IH$MVH/dHDŽ$IH$HHHXIH$HHR#H5;&H3H$H$LCiIH$H2I,$H$H/H$HDŽ$H/H$HDŽ$H+HD$hH|$hH5 7&HDŽ$HGHHM3IL$M2H5p1&L9tID$H;#3I|$H#HH$I,$u ID$LP0H$H;=Y#HDŽ$H;=# H;=# ^H$Å2H/uHGP0HDŽ$ H$H$HH$HCgH>&H5u(&H9p+7H\(&HC7HH=H(&H$HO4H57&ChH$H"7H$H/uHGP0H567&H|$hHDŽ$hIH 7H#HD$I9FM~MMfII$I.B%LL_H$I/&H$Hq7I,$H$HD$H9G^8H$ H$H$H/H$H$HDŽ$8H/$H$L$HDŽ$HDŽ$Ht H/(H$HDŽ$Ht H/'H$HDŽ$Ht H/'H5.&LHDŽ$IH$H,9H;#L;%D#'L;%b#|'LL$ÅII,$u ID$LP0HDŽ$1 H5<&H%&H9XDMH%&HBOHL%%&L$MLH51&LeH$IH$H|NH/uHGP0H$H$HDŽ$HD$H9GPHIH$L$HtH/uHGP0L$HDŽ$MGOH$H/uHGP0H5,&1H$HDŽ$tmIH$HQH$H/uHGP0H$H;=#HDŽ$H;=v#/H;=#~/H$Å^SH/uHGP0HDŽ$kH5+&H=P9&11cIH$HsHsH$H/uHGP0H$E11E1H\$hE1E1HDŽ$D$D$ HD$HD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0HD$8*f.HGP0@HkHCHP0`HGP00@HGP0@ID$LP0H$H/ѐffA.D$z xDH#HnD$JE11E1D$ ~E1E1H$HD$HD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0HD$8Ht!H/uHGHL$pLL$hP0HL$pLL$hMt&I,$uID$HL$pLLL$hP0HL$pLL$hH$Ht!H/uHGHL$pLL$hP0HL$pLL$hH$Ht!H/uHGHL$pLL$hP0HL$pLL$hHtH)uHALL$hHP0LL$hMtI)u IALP0T$ t$E1H #H=MtI/u IGLP0HT$8HtHHD$HHu HBHP0HL$0HtHHD$HHu HAHP0MtI.u IFLP0Ht$HtHHD$HHu HFHP0MtImu IELP0H$Ht H/uHGP0HT$PHtHHD$HHu HBHP0HL$`HtHHD$HHu HAHP0Ht$XHtHHD$HHu HFHP0HT$(HtHHD$HHu HBHP0HL$@HtHHD$HHu HAHP0Ht$HHtHHD$HHu HFHP0HT$HtHHD$HHu HBHP0H+u HCHP0H$Ht H/uHGP0HtHmu HEHP0HL[]A\A]A^A_HIH51&HIHVH$HD I^fHHo!H _!HOHm"L F!LOLD@HH;#SH&H5,H81XZH "!%H=E1~.lHL-n#hH5+&H|$h^IH$HK)H5%&H9&H@H;x#-I|$uA|$f&fDH#HH$I,$u ID$LP0H$H;=#HDŽ$H;=v#u H;=#"H/HDŽ$f-H5'&H|$h@]IH$H.111H.iIH$HG/H$H/PL$L;=$&HDŽ$HDŽ$KH;-#.HHH@H2&H5[&H9pPCHB&HDHL .&L$MBH5N&&LV\IH$HDH$H/uHGP0Hf2&H5&HDŽ$H9pFH&HGHL%&MgEH56,&L[HHGI,$uHD$ID$LP0HL$H1&H5@&H9p?IH'&HLHL%&MGIH5+&LHL$^[HL$HHD$8bKI,$uID$HL$LP0HL$HX#HD$H9A*NHt$8HHL$HL$H$IHL$8HHD$HHu HAHP0L$MOMI.u IFLP0H5G+&H$ZIHOH$H/uHGP0H$HD$HDŽ$H9GjRLH$H$Ht H/uHGP0HDŽ$I,$u ID$LP0H$QH$H/uHGP0H$H/&HDŽ$HDŽ$HD$8HEH9HXHyHqH~$H;Q1 fH;TuHH9uH/& L(hE111AHHAH$HRH$HH$H/uHGP0H$HDŽ$HmHD$ u HEHP0HD$ H;#HDŽ$sTH|$ H5&&HoXHD$0H$HASH5 &HǺ4aH$H VH$H/uHGP0H$H;=#HDŽ$H;=9#u<H;=W#h<H$AƅYH/uHGP0HDŽ$ET\H|$ H5!&WHH$H[LEH$HD$0H$H_H/uHGP0H$H;=ü#HDŽ$H;=e#AH;=#AH$AƅdH/uHGP0HDŽ$EcHH,&HP-&HY&D$H9XRlH:&H.lHH=&&H$HkH5&&VH$IHjH/uHGP0D$HDŽ$HH$H/jHD$I9D$.lHLLH$H$H/uHGP0H$HDŽ$HD$0HpH+u HCHP0H$H;=1#H;=ߺ#TNH;=#GNBÅlH$H/uHGP0HDŽ$kH+&H&H9X[xH&H7xHL%&M?zH5#&LTUH$HyI,$u ID$LP0H$H5&UH$IHxH/uHGP0H|$ 1H5&HDŽ$]HH$H4xHD$I9D$,TIl$HTI\$HEHI,$u ID$LP0H$HHH$Hmu HEHP0H$H/uHGP0H$HDŽ$HD$0HwH+u HCHP0H$H;=A#H;=#_SH;= #RSRÅIH$H/uHGP0HDŽ$ }D$\qfTHD$0H$Hr|Ht$8H|$0IH{H$H/uHGP0L;%z#HDŽ$L;%#\L;%:#\L|Å#I,$u ID$LP0Hl$ \H5&H='&1QHD$0HH\$0HbHHD$HH H$E11E1H\$hE1E1D$D$ HD$HD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0DH>HH<HcHHF0H$IF(H$IF HH$IFH$`IH~kH;Hu-M~1H5 &HHVyH#H$IMu#H$H$L$H$Hu7@H=&H"&H5#&IfDE11E1E1HD$E1HD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0HD$8D$>D$ ~H=I&$fIx@SIE11E1E1HD$E1HD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0HD$8D$@D$ ~E11E1E1HD$HD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0HD$8D$CD$ ~dfDH$E11E1HD$E1HD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0HD$8D$HD$ ~fDLMmH$3HGP0O@HGP0a@ID$LP0HD$8H$HH$H;#HD$01H$&H &H9XI;Hj &H<>HL%V &M:H5&LNIH$H=I,$u ID$LP0&IH?HD$0HID$IH$HAH#&H &H9XCH &HFHH &HCH5&HHL$cMHL$HIEH)uHD$HAHP0LL$H5&H$LLL$LL$BI)u IALP0H$H$LKIH"FH$H/uHGP0HDŽ$I,$u ID$LP0H$H/uHGP0H$HDŽ$L$H/uHGP0L;-#L;-I#nL;-g#aL<wH;-B#0H5-&H LIH$H(FH"#HD$I9F#0I^H0IFHHH$H$H/uHGP0H$HMH+Iu HCHP0H$MGH/uHGP01ɺHLHDŽ$ZWIHOHHLHD$ ~LL$ HHD$H$JI)u IALP0L$Imu IELP0H5&H|$HDŽ$JIHPHD$I9E5I]H5MMHIImuIELL$LP0LL$HT$0LHLL$LL$H$H+=H$HD$H|$OI)u IALP0H$H5&LHDŽ$HD$JIH$HKU#IHBZHD$LL$HIALL$HIYHP&H5&HLL$tLL$2FH$LLLL$HH$LL$HIH$PcH/uHGLL$P0LL$HDŽ$I)u IALP0I,$u ID$LP0HB&L$HDŽ$H&H9XPcH&H*cHH&HD$PH$H*aH5&HHIH`H$H/uHGP0HDŽ$HD$PH$HfIEH$LhZIHlfH#H5`&HHD$LL$ZH$LLLL$FLL$HHD$PH$AjI,$uID$LP0LL$H$H/uHGLL$P0LL$HDŽ$I)u IALP0H$H5&mGH$IH~H/uHD$HGP0LL$LL$HDŽ$gLL$HHHD$PH$3~H#HHCLL$HHD$PH$rHs&H|$PLL$H5b&LL$-hH$H$LLL$ELL$HHD$P3rI)u IALP0H$H/uHGP0H$HDŽ$H/uHGP0HDŽ$Imu IELP0HD$HLl$PHD$@HD$(HD$XHD$`HD$PHD$0H;#GH5!&H|$hEIH^H5 &H9>H@H; #bIy>Hp#HH$I)u IALP0H$H;=#H;=;#<>H;=Y#/>ÅZH$H/uHGP0HDŽ$MHHD$0H;#RH5:&LDHD$H$HqH5 &H9t$PH\$HCH;*#zH{gPHz#HIH\$HHD$HHWHDŽ$1L; #I)u IALP0KRHr&H&H9X-qH&H|HL &M|H5&LLL$CLL$HHD$H$2|I)u IALP0IH{H5^&H|$hHD$CLL$HI{H57&LHLL$OLL$<{I,$uID$LL$LP0LL$H5G &H$LLL$:BLL$HHD$ |H$H/uHGLL$P0LL$HDŽ$I)u IALP0H|$hLIH{H5&H|$H I,$u ID$LP0HD$H\$hHINIFLP0fHGP0>@H$ÅH$E11E1H\$hE1E1E1D$<D$ HD$HD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0HD$8|@HGP0@IGLP0fH&HB&H9XJ-H)&H/HL%&L$M@-H5 &L-AH$H/H$H/uHGP0H$H$HDŽ$H#H9G2HIH$L$HtH/uHGP0L$HDŽ$H$M1H/uHGP0H5l&1H$HDŽ$HH$H3H$H/uHGP0H$H;=\#HDŽ$H;=#3 H;=#& aH$ÅU5H/uHGP0HDŽ$H5&H=&1>H$HHH`OH$H/uHGP0H\$hE11E1HDŽ$E1D$D$ HD$HD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0HD$8HGP0K@HGP0@HGP0@HFHH$H$H/uHD$HGP0HL$H5C&HHL$HDŽ$r=HL$HIH$BH&H5%H9psHH%H"FHL%%L$MEH5V &LHL$=HL$HIFH$H/uHD$HGHL$ P0HL$ LL$HDŽ$HAH;D$uJE1H;ӡ#.;H;# 3HL$(t$ LL$LL$Hct$ HIHL$({NH$HtID$HDŽ$H$IcHHL$HIT1MLLHDŽ$ ;HL$HH$SI,$uID$LP0HL$H)u HAHP0H$H;=#H;=#*H;=#*H$AƅKLH/uHGP0HDŽ$EH&H %H9HaH%HaHH %H`H5&HHL$;HL$HIS`H)u HAHP0H&H 6%H9HaH%HlHL %M8aH5 &LLL$:LL$HHD$0H$lI)u IALP0H5 &HZ:HD$0HHnH$HD$HDŽ$H9GmHt$0HH$HtH/uHGHL$P0HL$Ht$0HDŽ$HHD$HHuHFHL$HP0HL$HlH$H/uHGHL$P0HL$H5+ &HHL$HDŽ$z9HL$HHD$0H$lH)u HAHP0HD$I9D$cH$LMH$H$H/uHGP0H$HDŽ$HD$0H:cI.u IFLP0HD$8HH$H?HHcH;#AH;#D~DH; #qDHHL$HL$AjmH)u HAHP0E~NH$HH$H$HL$8HHD$HHu HAHP0H$H/uHGP0H$H$HH$H/uHGP0HL$8L$HDŽ$HHD$HHu HAHP0HDŽ$Lt$8VfA.D$HY#HH$E11E1HD$E1HD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0HD$8D$KD$ ~fDH$E11E1HD$E1E1H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0HD$8D$ZD$ fD#IH$E11E1H\$hE1E1E1D$_D$ HD$HD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0HD$8{H;#LIH$HqH$E11E1HD$E1E1H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0HD$8D$\D$ H$E11E1HD$E1E1H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0HD$8D$7D$ fDH%HH$H$H/fDD$zH$Ht7H/;"E1HGP0HDŽ$MtI,$u ID$LP0H$Ht H/uHGP0H$HDŽ$Ht H/uHGP0L%&LkXHDŽ$M9lMID$HIUA@A$@IXHHJH~&L;b1@L;dHH9uD$ HE1E1E1H$H$E1H$:H\$hE11H$HD$HD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0HD$8MM9tMu1L;%v#/t$H H=)\RH$H$HH$,5H5%H=&10IH*HKAI,$ID$LP0D$D$ H=%H*%H5+%HfDH=%FH@D$|OD$D$ 7H$D$H;#8L9IH$HkH$E11E1HD$E1E1H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0HD$8D$9D$ H$HtH/]mHDŽ$D$%H5<%H=&1.IH$H*H?H$H/uHGP0H$E11E1H\$hE1E1E1HDŽ$D$KD$ HD$HD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0HD$8LwMHGIHH$H$H/uHGP0H$H$L>H$I.WIFLP0HD$HH$E11E1HD$E1E1H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0HD$8D$^D$ H$HHLXH5J%E;bPH$E11E1HD$E1E1H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0HD$8D$`D$  H$E11E1HD$E1H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0HD$8D$D$ H$LIH,H;‘#L; p#OL; #BLLL$LL$/I)u IALP06H5%%H$1IH$6H;C#L; #*L; #LLL$LLL$:I)u IALP0:H;-ΐ#2H&H%H9XGH%HGHL5m%L$MGGH5%LU+H$IH$HFH/uHGP0H5%HHDŽ$IH$HFH!#H$HD$H9GJL肺IH$H/uHGLL$P0LL$HDŽ$MGH$H/uHGLL$P0LL$H$1LLL$HDŽ$LL$HIH$FI)u IALP0H$H;=Y#H;=#K#H;=%#>#jÅnQH$H/uHGP0HDŽ$HH%HHH5%H$)IHbGHDŽ$HD$I9F=IFH$H=MNHII.uIFLL$LP0LL$H$Hj=LLL$ոLL$H$H$HtH/uHGLL$P0LL$L$HDŽ$M'VI)u IALP0H$Hmu HEHP0H%H %HDŽ$H9HUHk%HXHL5W%L$M?XH5%LO(IHWH$H/uHD$HGP0LL$LL$HDŽ$ILL$HIH$VHL$0LL$HH$HHLL$HIH$oUH9#H5b%HLL$GH$H$LLL$&LL$HHD$PUI)u IALP0H$H/uHGP0H$HDŽ$H/uHGP0H5%H|$PHDŽ$'IH$HUHDŽ$HD$I9FGIFH$HFIVHHH$H$H/uHGP0H$H$HF'HD$`H$Ht H/uHGP0H|$`H$HDŽ$rWH/uHGP0E1H$11HDŽ$HD$HHD$@HD$xH\$Lt$ L|$pIH$H$1PIHVH;#AH;#D)BL;%#BLAŅ_I,$u ID$LP0E_H5 %H|$Z%H$H3_H$H$IH$HZaH$HD$H9G[LgM[HGI$HH$H$H/uHGP0H$H$L:I,$HD$Xu ID$LP0H$H/uHGP0H|$XH$HDŽ$NbH/uHGP0HDŽ$HtHmu HEHP0H50%H$覺IHaH;K#@H;#@EL;%#ELWŅ^I,$u ID$LP0ZH%H%H9X<`H|%HdHL5h%L$MGdH5%Lp#H$HcH$H/uHGP0H$HD$HDŽ$H9G4cHt$ͲIH$Ht H/uHGP0HDŽ$MbH$H/uHGP0H\$ HDŽ$HtHHD$ HHu HCHP01ɺHL.IHaHL˺IH$HaI,$u ID$LP0H$I.HD$ u IFLP0H5%H|$ HDŽ$"H$H`@IHpHD$XHID$H$H/pHq%H5%H蚽oH$H$L IHJoH$H/uHGP0HDŽ$I,$u ID$LP0H$H/uHGP0HDŽ$MtI/u IGLP0H^%H%H9XnH%HnHH%HnH5%H H$HmH+u HCHP0HH6mIELh赻IHlH#H5;%HSXlH$LHhH$HkH$H/uHGP0HDŽ$H+u HCHP0I,$u ID$LP0H$HGH;A#ZhHWHgLgHo I$HEH$H/uHGP0HDŽ$H\$@HtHHD$(HHu HCHP0H\$HHtHHD$(HHu HCHP0H5Q%HQHHfHD$H9CfLsMfL{IIH+u HCHP0LL貮H$I.u IFLP0L$MeI/u IGLP0H$H/uHGP0H5%LHDŽ$HH.eHD$H9CeLsMdL{IIH+u HCHP0HLLǢH$I.u IFLP0L$MEdI/u IGLP0L$Imu IELP0H5%LHDŽ$H$HcH$H)HHcH$H/uHGP0HD$`HDŽ$H@LhpMBbI}7bH#H$HԹIHaLHH|$`AUI.Au IFLP0E(`H+u HCHP0H5%LHH_H$H2H$HP[H+u HCHP0H$H$H$H/uHGP0Hl$HHl$XHDŽ$Ld$@@LLMuH$E11E1H\$hE1E1D$D$ HD$HD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0HD$8鮹D$D$ DL:I&H$E11E1H\$hE1E1D$D$ HD$HD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0HD$8H5%H|$ IHU(7IH$H,H%HH$HBIH$Lx ׵IH$H+HT$0H5%Ho~H$H$LIH3I,$u ID$LP0H$H/uHGP0H$HDŽ$H/uHGP0HDŽ$E1HD$HHD$@HD$(HD$XHD$`HD$PHD$H$1E1E1HD$E1H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0HD$8D$D$ H=%H%H5%觴I驼E11E1E1HD$H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0HD$8D$D$ H=Y%Hj%H5k%I鵲H=7%.IMt$MIt$I9f1f.M;lMHI9uE1IEVA@VHFHMV@@VIXH VHJ1H9tHH9IM9KtI9rH$E11E1HD$E1H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0HD$8D$D$ E11E1E1HD$H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0HD$8D$D$ bH=K%&,I鵰H$E11E1HD$E1H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0HD$8D$D$ dzH=%H%H5%]ID釾E11E1E1HD$H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0HD$8D$D$ fHGH$HۯHWHHH$H$H/uHGP0H$H$H$HaI鏯Ht$0L|MHD$H$rE1E1E1H\$hH$HD$HD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0HD$8D$D$ H=%)I0H=%H%H5%脯IH$E11E1HD$E1H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0HD$8D$tD$ EH$E11E1HD$E1H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$D$D$ аH=%H%H5%fIH$E11E1HD$E1H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0HD$8D$D$ 'H=%H%HL$H5%踭HL$I鰶E1E1E1H\$hH$HD$HD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0HD$8D$D$ vHDŽ$H=N%)'I4E11E1E1HD$H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0HD$8D$vD$ #DH$E11E1H\$hE1E1D$ D$ HD$HD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0HD$8?H$E11E1HD$H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$D$D$ ͭH=%%IE1E1E1H\$hH$HD$HD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0D$D$ =H=&%HL$$HL$IԳH$E11E1H\$hE1E1D$ D$ HD$HD$HHD$@HD$(HD$XHD$`HD$PHD$駬E11E1E1HD$H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0HD$8D$D$ (HGH$HiHWHHH$H$H/uHGP0H$H$H$HtIH$E11E1HD$E1H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$D$D$ GLE1E1E1H$H\$hHD$HD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0HD$8D$D$ 鿪LaMɱLqI$IH)u HAHP0HT$8LL5H$I,$ID$LP0雱HCLL$HP0H$LL$HD$'E11E1E1HD$H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0HD$8D$D$ E11E1H\$hHD$HD$HHD$@HD$(HD$XHD$`HD$PHD$D$D$ yH$E11E1HD$E1H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0HD$8D$D$ ̨H$1E1E1H\$hD$D$ HD$HD$HHD$@HD$(HD$XHD$`HD$PHD$ZH\$hE11E1D$E1E1D$ HD$HD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0HD$8اH=%H%H5%nHfE1E1E1H\$hH$HD$HD$HHD$@HD$(HD$XHD$`HD$PHD$D$D$ CHA@=~$HHHL$$LL$ HL$)$HL$LL$ HH$DH$Ht!H/uHL$ LL$HGP0HL$ LL$H$HDŽ$H/uHL$ LL$HGP0HL$ LL$HDŽ$I)IAHL$LP0HL$E11E1E1HD$H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0HD$8D$D$ HGH$HHWHHH$H$H/uHGP0H$H$H?L:ȱH=A%HH$E1HD$E1HD$HH\$hHD$@HD$(HD$XHD$`HD$PHD$D$D$ ԤffA.Ae_Hl#HZD$D$  H$E11E1HD$H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$D$D$ E11E1E1HD$H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0D$D$ E11E1H\$hHD$HD$HHD$@HD$(HD$XHD$`HD$PHD$D$ D$ 鈣Hl$ E11E1H$E1HD$E1HD$HH\$hHD$@HD$(HD$XHD$`HD$PHD$D$D$ 麢H$E11E1HD$E1E1H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0HD$8D$GD$ 0H59%Hx0uHl$ H\$hE11H$E1E1E1D$D$ HD$HD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0钡E11E1E1HD$H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$D$. D$ %H$H\$h1E1D$n D$ HD$HD$HHD$@HD$(HD$XHD$`HD$P鿠MH$1E1HD$E1H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$D$; D$ JHl$ E11E1HD$E1H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0D$D$  H$E11E1HD$E1H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0D$ D$ QH=:%H%H5%I~$HHHL$$LL$ HL$)$HL$LL$ HH$HD$E1E1H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0D$'D$ 鶞齬HLL/H$M1E1HD$HD$HH\$hHD$@HD$(HD$XHD$`HD$PD$= D$ 2H=%I H$1E1E1HD$E1H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$D$ D$ XE1E1E1E1H$H\$hHD$HD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0D$D$ ٜH$E11E1H\$hE1D$ D$ HD$HD$HHD$@HD$(HD$XHD$`HD$PHD$dHl$ H\$hE11D$E1E1E1D$ HD$HD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0Ll$LH%H@H9tSHXHt-HqH~H;Qt81H;Tt-HH9uLl$HH9tHuH;-c#uH5%H|$IH$HLHa#I9AIYHIAHHH$H$H/uHGP0H0%H$H訁H+Iu HCHP0MEH$H/uHGP0H\$HDŽ$HHD$HHHCHP0H5%LcIIEMH\$hHD$bH$1E1E1H\$hE1D$ D$ HD$HD$HHD$@HD$(HD$XHD$`HD$PHD$Hl$ E11E1HD$E1H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0D$D$ ęH=%H5%1HH$Hp#E H$H/uHGP0Hl$ H\$hE11D$E1E1HDŽ$D$ HD$HD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0E1E1E1H\$hH$HD$HD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0D$D$ -1E1HD$H\$hHD$HHD$@HD$(HD$XHD$`HD$PD$X D$  H$E11E1HD$H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$D$J D$ ]H5%H|$|IH%H]#I9FI^HMNHII.uIFLL$LP0LL$LLHLL$}LL$H$H+uHCLL$HP0LL$L$M(/I)u IALP0H$E1E11H$1 HD$H|.H$H/uHGP0HT$0H;]#HDŽ$H|$H5%HGHH:Ѕd:HD$HE1HD$@HD$(HD$XHD$`HD$PHD$1Hl$ E11E1HD$E1E1H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$D$D$ [E1E1E1H\$hH$HD$HD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0D$D$ ߔH=%HL$ HL$I˹E11E1E1HD$H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0HD$8D$D$ 铔hE1E1E1H\$hH$HD$HD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0D$D$ 龓H$1E1E1HD$E1H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$D$!D$ IH5%H=%1tIH%H I.TH$E11E1H\$hE1E1D$ D$ HD$HD$HHD$@HD$(HD$XHD$`HD$PHD$鞒H=%H8%HL$H54%/HL$I|E11H\$hHD$HD$HHD$@HD$(HD$XHD$`HD$PD$e D$ eHD$ff.@H[Y#HI锯E飻H5G%H=(%1 HD$0H$H5H|$0H$H/uHGP0Hl$ H\$hE11H$E1E1HDŽ$D$E1D$ HD$HD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0Hl$ H\$hE11H$E1E1E1D$D$ HD$HD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0|H$E11E1HD$E1H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$D$ D$ HQH$HvLqHIH)IFL1ҿATH\$hLHrHD$IHH$E11HD$D$#D$ rH5%H=%1IH,HII.[H$E11E1H\$hE1E1D$!D$ HD$HD$HHD$@HD$(HD$XHD$`HD$PHD$ǎH$1E1E1H\$hE1D$!D$ HD$HD$HHD$@HD$(HD$XHD$`HD$PHD$RH$E11E1HD$E1H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0HD$8D$D$ ˍH$1HD$E1HD$HH\$hHD$@HD$(HD$XHD$`HD$PD$l D$ eH$1E1E1HD$H\$hHD$HHD$@HD$(HD$XHD$`HD$PD$g D$ H\$hE11E1D$IE1E1D$ HD$HD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0郌E11E1H\$hHD$HD$HHD$@HD$(HD$XHD$`HD$PHD$D$ D$ ?H$E11E1HD$H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$D$ D$ 駋H$E1HD$E1HD$HH\$hHD$@HD$(HD$XHD$`HD$PHD$HD$0D$9D$ .H$H\$h1D$ D$ HD$HD$HHD$@HD$(HD$XHD$`HD$PˊH$HH\$HD$HHuH|$LL$HGP0LL$L; Q#HDŽ$L; Q#!L; Q#!LLL$LL$%H$H\$h1E1D$#D$ HD$Hl$ E11E1HD$E1H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0D$"D$ MLLL$ LL$Hl$ E11E1HD$E1H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0D$D$ Hl$ E11E1HD$E1H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0D$D$ ܈H=t%OHɓH=`%H%H5% H駓LL*zMH$xH$E11E1H\$hD$#D$ HD$Il$HēI\$HEHI,$u ID$LP0H$HHvnH$HmHEHP0酓HD$8HH$鈱H5%H=ؾ%1HD$0H$H#H|$0YH$H/uHGP0Hl$ H\$hE11H$E1E1HDŽ$D$CE1D$ HD$HD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0鲆Hl$ H\$hE11H$E1E1E1D$4D$ HD$HD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0,E1E1E1H\$hHD$HD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0D$DD$ ޅH$E11HD$HD$HH\$hHD$@HD$(HD$XHD$`HD$PD$ D$ RH$E11E1HD$H\$hHD$HHD$@HD$(HD$XHD$`D$~ D$ H$1E1HD$H\$hD$#D$ „IFLE1E1E1P0H$E11H\$hD$ D$ HD$HD$HHD$@HD$(HD$XHD$`HD$PHD$@H$E11E1HD$H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$D$ D$ ΃1H\$hHD$HD$HHD$@HD$(HD$XHD$`HD$PD$o D$ sH=\%7HD$PМH=F%H%H5%HD$P鬜IHl$ E11HD$E1E1H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$D$1D$ E11E1H\$hHD$HD$HHD$@HD$(HD$XHD$`HD$PHD$D$2!D$ 髂1E1E1E1HD$H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$D$/!D$ E11E1H\$hHD$HD$HHD$@HD$(HD$XHD$`HD$PHD$D$-!D$ ԁH=l%GI*H=X%H%H5%IEH$1E1E1HD$H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$D$C!D$ Ҁ1E1E1H\$hHD$HD$HHD$@HD$(HD$XHD$`HD$PHD$D$@!D$ 鹀H;F#LϺLL$xLL$HHD$H$H$1E1H\$hD$#D$ H$E11E1HD$E1H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$D$p!D$ H$1H\$hHD$HD$HHD$@HD$(HD$XHD$`HD$PD$ D$ /H$E11HD$HD$HH\$hHD$@HD$(HD$XHD$`D$ D$ ~H5 %H=%1IH$HHH$H/uHGP0H$E11E1H\$hE1E1HDŽ$D$T!D$ HD$HD$HHD$@HD$(HD$XHD$`HD$PHD$~H_HQHGHHH$H$H/uHGP0H$H$HjdH+IHCLL$HP0LL$LHD$`@HH$1E1H\$hE1E1D$!D$ HD$HD$HHD$@HD$(HD$XHD$`HD$PHD$ }Ll$1E1H\$hHDD#H$HD$D$\#D$ HD$0|HAHLL$P0IFL1ҿALL$-HC#E11E1Ll$H$HD$H\$hD$j#D$ HD$0S|H$H\$h1E1D$ D$ HD$HD$HHD$@HD$(HD$XHD$`HD$P{@7IFLE1E1E1P0H$E11H\$hD$!D$ HD$HD$HHD$@HD$(HD$XHD$`HD$PHD$b{1H\$hHD$HD$HHD$@HD$(HD$XHD$`D$ D$ 6{H=%IH=%HV%H5W%xI鞇IHl$ E11HD$E1E1H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$D$kD$ zHl$ E11E1HD$E1H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0D$]D$ zHl$ E11E1HD$E1H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0D$ZD$ oyHl$ E11E1HD$E1H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0D$WD$ yHl$ E11E1H$E1HD$HD$HH\$hHD$@HD$(HD$XHD$`HD$PHD$HD$0D$UD$ qxE1E1E1H\$hH$HD$HD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0D$VD$ wE1E1E1E1H$H\$hHD$HD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0D$TD$ vwH=_%:HpH=K%H%H5%tHNH$1E1E1HD$H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0D$YD$ vH=%H?%H5@%[tI"Hl$0E1HD$HHD$@HD$HD$(HD$XHD$`HD$PHD$tH$E11E1H\$hE1E1D$E!D$ HD$HD$HHD$@HD$(HD$XHD$`HD$PHD$uHl$ E11E1HD$E1H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0D$D$ uHl$ E11E1H$E1HD$HD$HH\$hHD$@HD$(HD$XHD$`HD$PHD$HD$0D$D$ tHl$ E11E1H$E1HD$E1HD$HH\$hHD$@HD$(HD$XHD$`HD$PHD$D$D$ _tH5%H=%1HD$0H$HH|$0*H$H/uHGP0Hl$ H\$hE11H$E1E1HDŽ$D$}E1D$ HD$HD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0sME11E1HD$E1H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$D$D$ 9sIL$HMt$HII,$uID$HL$LP0HL$H$HLHL$tYHL$H$H)HAHP0骛E1Ld$8E1E1H$H\$hHD$HD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0D$D$ rH$1E1HD$HD$HH\$hHD$@HD$(HD$XHD$`D$ D$ qH$1E1HD$HD$HH\$hHD$@HD$(HD$XHD$`D$ D$ cqH$E11E1HD$E1H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$D$ #D$ pH$E11E1H\$hD$#D$ pH=%H%H5%ZnI̎H=%H%H5%8nIA1E1HD$H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$D$~!D$ jpH1E1H\$hHD$HD$HHD$@HD$(HD$XHD$`HD$PHD$D$!D$ pHE11E1HD$H\$hHD$HHD$@HD$(HD$XHD$`HD$D$!D$ oHH$1E1HD$E1E1H\$hHD$HHD$@HD$(HD$XHD$`HD$D$!D$ nHH$1E1HD$E1H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$D$!D$ gnHH$1E1HD$E1E1H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$D$!D$ mHH$E11E1E1HD$H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$D$!D$ wmH=`%;I$H$E11E1HD$E1H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$D$ D$ lH\$Lt$ E11L|$(E1L|$pHl$XHH$HD$H\$hHD$D$!D$ lHE11E1HD$E1E1H\$hHD$HHD$@HD$(HD$XHD$D$!D$ 5lH$1E1E1HD$H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$D$[D$ kH=%I.Hl$ H\$hE11H$E1E1D$D$ HD$HD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0,kE1E1E1H\$hH$HD$HD$HHD$@HD$(HD$XHD$`HD$PHD$D$pD$ jE1E1E1H\$hH$HD$HD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0D$mD$ =jHGH$H/HWHHH$H$H/uHGP0H$H$HHT$0PHH$E11E1HD$E1H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$D$^D$ _iHl$ H\$hE11H$E1E1E1D$nD$ HD$HD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0h鰆Ld$8H\$hE1E1H$E1D$D$ HD$HD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0PhH;.#/H|$`IH]H$1E1HD$H\$hD$#D$ gH$E11E1HD$HE1E1H\$hHD$@HD$(HD$XHD$`HD$PHD$D$#D$ gH$1E1E1HD$H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$D$#D$ gLXHD$X钤HT$xH|$`E11A1IHH%H|$HY]I,$#ID$LP01H\$hHD$HD$HHD$@HD$(HD$XHD$`D$ D$ f1E1HD$H\$hHD$HHD$@HD$(HD$XHD$`HD$PD$ D$ eH$H\$h1D$#D$ HD$eH$1HD$H\$hD$#D$ eH$1E1HD$H\$hD$#D$ leH$1E1H\$hD$#D$ EeH$1E1HD$H\$hD$#D$ eH=%I+H$E11H\$hD$#D$ dH$1E1H\$hD$#D$ dH$E11E1HD$E1H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$D$P!D$ >dH\$Lt$ E11L|$(E1L|$pHl$XH$HD$!H\$hD$ HD$HD$cH\$Lt$ E11L|$(E1L|$pHl$XHH\$hHD$HD$D$!D$ cH\$Ll$PL|$(Lt$ L|$pHl$XIEHHD$Hl$ E11E1H$E1HD$E1HD$HH\$hHD$@HD$(HD$XHD$`HD$PHD$D$?D$ bL$OgH\$Lt$ E11L|$(E1L|$pHH$H\$hD$!D$ HD$HD$bH$E11E1HD$E1H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$D$ !D$ bHD$E1E1H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0D$1D$ aL$ZH\$Lt$ E11L|$(E1E1L|$pHl$XHH$HD$H\$hHD$D$!D$ ?aH=(%H9%H5:%^I齟H\$Lt$ E11L|$(E1L|$pHH$H\$hD$!D$ HD$HD$`H\$Lt$ E11L|$(H$E1HL|$pHD$HD$H\$hD$!D$ w`D$鼎H$H\$hE1D$#D$ 1C`H\$Lt$ E11L|$(H$E1HL|$pHD$HD$H\$hD$!D$ _H\$Lt$ E11L|$(E1L|$pE1Hl$XHH\$hHD$HD$D$!D$ _LHH9ҏHu1H;5,'#tLթ飏LcXIH\$Lt$ 1L|$(H$E1Hl$HL|$pHLd$@H\$hE1HD$HD$D$"D$ ^H\$Lt$ E11L|$(E1L|$pE1HHD$H$HD$H\$hD$;"D$ ^H\$L|$(E11L|$pH$HD$HD$."H\$hHD$D$ X^H\$L|$(E11L|$pH$E1HD$HD$,"H\$hHD$D$  ^H\$L|$(E11Lt$L|$pE1Lt$ HHD$H\$hD$"D$ ^HGH$HHWHHH$H$H/uHGP0H$H$HuHT$DIpH\$Lt$ E11L|$(E1L|$pE1HHD$H$HD$H\$hD$"D$ ]H\$L|$(E11Lt$L|$pE1Lt$ HHD$H\$hD$"D$ ]H=%IMHl$ E11E1H$E1HD$E1HD$HH\$hHD$@HD$(HD$XHD$`HD$PHD$D$yD$ 0\Hl$ E11E1H$E1HD$E1HD$HH\$hHD$@HD$(HD$XHD$`HD$PHD$D$D$ [Ll$H\$hE11H$D$2#E1E1D$ HD$HD$HHD$@HD$(HD$XHD$`HD$PHD$9[HT$0H|$VH\$Lt$ I1L|$(E1L|$pHl$HHH$Ld$@H\$hE1HD$HD$D$"D$ ZIH\$Lt$ 1L|$(E1L|$pHl$HH$HLd$@H\$hE1D$"D$ HD$HD$eZH|$0E1E1E1HGP0H$E11H\$hD$D$ HD$HD$HHD$@HD$(HD$XHD$`HD$PHD$HD$0YH$E11E1HD$E1E1H\$hHD$HHD$@HD$(HD$XHD$`HD$PHD$D$D$ `YIH\$Lt$ 1L|$(H$E1Hl$HL|$pHLd$@H\$hE1HD$HD$D$"D$ YLHH\$xH\$HL|$(Lt$ H oHDHPL|$pE1H#H5nsH81DWHl$H1HLd$@H\$hE1H$LL$xD$"D$ HD$HD$iXH\$Lt$ I1L|$(E1L|$pHl$HHH$Ld$@H\$hE1HD$HD$D$"D$  XH\$Lt$ I1L|$(E1L|$pHl$HHH$Ld$@H\$hE1HD$HD$D$"D$ WH\$LLt$ILt$ Hl$H1Ld$@HL|$pE1Ll$(H$E1HD$H\$hD$"D$ JWHHIIH$0H\$Lt$ I1Hl$HL|$pLd$@HE1H$Ll$(H\$hE1HD$HD$D$"D$ VH\$LLt$1Lt$ Hl$HILd$@HL|$pE1Ll$(H$E1HD$H\$hD$"D$ pVHIeH$鞙H\$Lt$ I1Hl$HL|$pLd$@HE1H$Ll$(H\$hE1HD$HD$D$"D$ UH\$L|$pLt$ HIHHH{HH zH5lHEHw#E1H812TLl$(E11H$H\$hE1D$l"D$ HD$HD$aUH;#YSH$HH$H/uHGP0H$HDŽ$HGHIH/H$HHH$վHx)H$H/uHGP0HDŽ$H(IH\$Lt$ 1Ll$(L|$pE1HH$H\$hD$"D$ HD$HD$OTH\$L|$pLt$ H$H/uHGP0HDŽ$tZLl$(HE1H\$hH$D$"1E1D$ HD$HD$SH\$L|$p1Lt$ |HHyHHH nxH5pjHEHU#H81RLl$(E11H$H\$hE1D$"D$ HD$HD$BSH\$Lt$ E11Ll$(L|$pE1HHD$H\$hHD$D$"D$ LSHWHHGL Hh8Ll$(HE1H\$hH$1E1E1D$l"D$ HD$HD$RHW#HE1H5%[H81QLl$(E11H$H\$hE1D$l"D$ HD$HD$2RIH\$Lt$ 1Ll$(L|$pE1HHD$H$HD$H\$hD$a"D$ QIH\$Lt$ 1Ll$(L|$pE1HH$H\$hD$`"D$ HD$HD$QIH\$Lt$ 1Ll$(L|$pE1HH\$hH$HD$HD$D$^"D$ =QH\$Lt$ I1Ll$(L|$pE1E1HH\$hH$HD$HD$D$Y"D$ PIH\$Lt$ 1Ll$(L|$pE1HHD$H\$hHD$D$V"D$ PIH\$Lt$ 1Ll$(L|$pE1E1HH\$hH$HD$HD$D$T"D$ JPH=3%HtH=%H q%H5!q%MHRH\$Lt$ E11L|$(L|$pHH\$hH$HD$HD$D$E"D$ OH\$Lt$ E11L|$(E1L|$pHH$H\$hD$D"D$ HD$HD$qOH\$Lt$ E11L|$(E1L|$pHHD$H\$hHD$D$B"D$ POH\$Lt$ E11L|$(H$E1HL|$pHD$HD$H\$hD$="D$ NGSHH DHH8PHXH8f(\zT$PT$Xf(Yf(\ rzf(YXf/^zsff.ztf(L$T$\$5H\$fT$YUzL$^f.Qw6YCYSH f([GGHG\$L$T$L\$L$T$HHH8P y\f(~GfWzHÐf.hyZff.<SHH0=DyD$f/@HH8PHD$F yl$T$\f/r3 xD$f(^F\$f/rH0[fDD$xL$ \^D$Ft$L$ f(f(T$Y\f( wx^NFT$\$\f/$H0[fDf(\=|x|xY|$(ff.Q5x^t$fDHCff(D$YXwf/sf(HL$YH8YD$PL$w=wf(YYY\f/wZL$ |ED$D$kEL$ =wUw\T$YXYT$(YXf/L$-D$(YD$H0[fDmDL$JL$HL$GL$HYfHD$!D^D$6B\vHfff.zu fHD$C av^L$H2DfHD$CfWvA ,vf(^L$H\f(CHY\vFHXfDff.Sf(HH uf/wxf(H?L$Y vT$xBfT$HHH*XJAL$D$f(@T$tuH f([f\L$f(@HD$/AL$ff(f.Qw*XYXT$H [f(@D$f(\$G\$T$f.SHH $f(D$G$$Hf(Yf( $F@\$ $H[Y^f(ff(f(SHXf(H ^L$\$,$.@\$L$Y tf(YYYf(YXff.QwX\Y$H\$H8X$P\$$f(f(X^f/s Y^f(H f([\$T$d$F\$T$d$zf.HL$$L?L$YX$HH?H>@f.SHH D$>L$HY DsD$f(L$CL$ff(f.Qw"f.L$YQw5f(H ^[D$f(T$Ef\$T$f(T$L$ET$L$HrSH\^f(CH;[>f.SHH>HD$>L$H[^f(ÐSHH0qD$ f/L$(f/HH8PHD$H8P q^L$ D$D$i? q^L$(D$D$J?XD$=\qf/rf/~qv\\$H0[^f(D$ HAHD$D$(AL$H0[X^f(fDD$>f(D$^L$ L$>L$f(^T$(T$ f(_\\$f(L$#<\$T$ D$\f(<XD$i>L$H0[\f(;SHH $D$; $Hf(Yf($;\$$H[Y^f(f.HD$Q=YD$HfD pfH*f/r!Ypf/rBf;oSH\Yf(of/rMBH)H[D;H)H[AWAVIAUIATIUHSHhH 1HHhH[]A\A]A^A_II)IH9nffH*<$f/t$K<L$I@Hf/ $vJL$H}UfL$H*f(^X@L$H,fH*\I9uD$\H,M96I)L+H9fJ6LHNfIHMfI)=$nH*I9HD$HH*LOfH*I*L)f(^f(\YX6nD$ fH*HCYYfH*Yf<$^Xmf.Qdf(HrIGHYmfHT$8Xm\$PH*T$@d$XD$(fH*Ht$HD$0YfH*^t?H,fHKH*AVfɉ *@AY H9DI>IF@A\L$HcAD\$ \D$L$(W-1 (&6f\$ L$*YjYT$X/KH([]A\A]A^f6 *Y #\z7 H[]\A\A]A^(@f.H~3ATL$UHSHDHH6CI9u[]A\DH~KATL$UHSHDH}HU e\f(3fWPfCI9u[]A\ÐDf.H~kATL$UHSHDH}HUf ae *YZ\f(A3ZWCI9u[]A\Df.AWAVIAUL-ATL%UHSHH(I>IFL$Hc\$\$L$%D$Yf(Y 0$YT$\$L$Xf/wAI>AVfII HLH!H*AYLtfW dI94CH(f([]A\A]A^A_I>IF5c\f(1 ʬI>Y $AV=c\f(1 $fWHdf(XYf/vX AffW dY@H~3ATL$UHSHDHH4CI9u[]A\DAVIAUL-ATL%ُUH-чSHI>IFTHcDT$ \D$%ūfZL$Y f(Y5.fT$ *Y OYL$XZf/wCI>AVf H*AYDD$t WD$A98D$H[]A\A]A^DI>IFf5Ϫ *Y\(3I>YT$AVf *Y |\2T$(W (YX/oXWT$@WѫT$.fDH~3ATL$UHSHDHHL2CI9u[]A\Df.aRff.4SHH0=`D$f/@H;SHD$l- `l$T$\f/r. `D$f(^s.\$f/rH0[ÐD$r`L$ \^D$].t$L$ f(f(T$Y\f( /`^.T$\$\f/,H0[fDf(\=4`4`Y|$(ff.Q5_^t$fDHP1ff(D$YX_f/sf(L$H;YYD$SL$_=\_f(YYY\f/wZL$ 7-D$D$&-L$ =p__\T$YXYT$(YXf/L$0D$(YD$H0[fDfDU+L$1L$Df..Mf.fSHH 5&D$t$5/fH;SfH *YT$T$ . צl$T$ \/r. D$ (^D.\$ /rH [D$L$\^D$.t$L$((T$ Y\( F^-T$ \$\/ H [f.(\-fYl$.Q-=ޥ^|$=ȥ|$fH.f(D$YX/s(L$H;YYD$ SL$f =d(*YYD$YY\/wYL$-D$D$ -L$54\T$ YXYT$YX/L$%D$YD$ H [fDwu,L$+L$Df.HHH?PHHÐf.HHH?PHff.HHH?PHHÐf.HGH?f.X[E„f.ED„USH(51f/?f(1f([-D$Y L$^YXY\YXY\YXY\YXY\ݣYf(T$r(T$XģL$=ff/|$^f(\ZYXX\r@H~;\ ZT$Hf(L$'T$H9L$\~H(f([]f(\H,fH*Xfff(HL$$,+L$YX$HHD$&YD$HfDHHH?L$$PL$YX$H@HL$1%L$HYfHL$ 'L$ HYfSHH 5XD$f/L$rf/sBD$H$H$D$$ $H [X^f(ff/wnH;SH;$S$ XX^L$D$f(#&T$ 5X^L$$f(&X$=Xf/r@<$H [^f(DHYD$ \f( D$(H;Sf/D$ D$H;SYD$(~ =T$\f(Yf/r~f(T$\$ \$D$f( L$^=XH,HaT$ff.EфEH0[fDf/Ӹr@f.H$=HH?D$\$PL$$f/vf(fYHXf/wHfHHH?$P<\f( <\$D$f( L$^f(HH,f/<rA ;f.SHH \@<f(D$6 D$H;SH;$S%<\$$D$ <^L$f(  ;=e<f(f(fTf.v7H,f%;fUH*f(f(fT\f(fVf/܅^=v;f/Lf(L$$^X0 L$$f(\9;l$Y^Yf(\;^f/H H,[ff(f(H8H\\H?T$L$D$(f(\$^l$ 4$P4$\$L$T$f/r3l$ fd$(YYf.QwHXH8f(@f(\ X:\fYYf.Qw*\H8f(d$$A d$$f(T$ $ T$ $1HATIIUHI SHLHI LHL IIL III LH I ĸH9wfDH;SD!H9r[]A\DH;SL!H9sH;SL!H9rf.Df.AWAVAUATIUSHHttIIHHH?H9wqIFAEJL$ Dl$ AME9v$1AAA9sI>AVAME9wI IHL[]A\A]A^A_@IFHEuTLbIHHI9v+H1HIIH9sfDI>AVIHI9wHL$DI>IFL!H9rL$pfDI>IFD!D9wL$PfDЉI>@I0fDAWAVAUATUSHteIẢAH?IFEucJL$ Dd$ IA9v%1AA9sI>AVIA9wH DH[]A\A]A^A_fDI>IFD!9rA\ff.AWAVAUATUSHH\$PfLAIE f AAEDrE T$ H?AUT$ E3EAfA9vY™AAf9r$FD3Ex}3AfA9v$uI}AUE3AfA9wA H[]A\A]A^A_Ð+EDHDMD!fA9s"EuI}AUED!fA9rHD[]A\A]A^A_fEuCH?AUEH[]DA\A]A^A_fD+Ex}+mDf.AWAVAUATUSHH\$PLAIE AAEDzE"T$ H?AUT$ E DA8vVE™AA@8r? ExD} A8v#uI}AUDE A8wfA4H[]A\A]A^A_f.+EDHDMD!A8s!EuI}AUED!A8rHD[]A\A]A^A_@EuCH?AUEH[]DA\A]A^A_fD+Ex}+mDf.USHHl$ tAtmA)EH[]@HLH?PEfAWAVAUATUSHHu]H~DHHH4$~$LHHflLʐHH9uHHH9tI4H[]A\A]A^A_DLIHIH9EH~IDbH$MЉD$ I?AWID9s(D$ 1AA9sfDI?AWIA9wH HHHKH9$uP@HEH0ILbIH$DI?AWIIIL9s%L1III9sI?AWIII9wLHHHCH;$uDHM$I?HAWHHCL9uf.HM$I?HAWHHCL9u`@III LHI LHI LHI LHI LH I HM4I?AWL!I9rHHHCL9u@III LHI LHI LHI LHI HM4f.I?AWD!D9wHHHCI9ux1mDAWAVAUATUSHH~uHAHHʉ4$fn $LHHfpLfHH9uHHH9t(HxHA4H9~HAtH9~AtH[]A\A]A^A_ÐLAՉIEH~IADbH$MDl$ I?AWIA9v(D$ 1AA9sfDI?AWIA9wH HKH;$uH[]A\A]A^A_@HGM$I?HAWCL9uH[]A\A]A^A_@III LHI LHI LHI LHA HM4I?AWD!A9rHCL9uH[]A\A]A^A_1uf.AWAVAUATUSHfHHAHf4$HLHHfn$LfafpHH9uHHH9tcHxHfA4AH9}QHxfAtH9~BHxfAtH9~3HxfAtH9~$HxfAtH9~HfAt H9}fAt H[]A\A]A^A_fDALIfE H~DrIIE1H$A1D$ EI?AWAfA9vAD$ Af9s2EtE1fA9vI?AWȉfA9wAHDfKH;$'EE1fHI,IHDfCH9I?AWATfHSH9u@AHHH HHH HHH HH HM$I11t@1!fA9sI?AW!fA9rDHfSL9uH[]A\A]A^A_1DuH@HL@AWIAVAAUATUSLHE7HI, DjE1ɉD$ 1f.EI?AWAD@A8vk+D$ EݙAA8r3QI?AWD@A8vDA@A8v EtDA@A8wfHDKH9YH[]A\A]A^A_fH~I, 11HA KH9tuI?HAWASH9uAHHH HHH HH HlM, 11$I?AW!A8sH!A8st!A8r@DHSI9uH[]A\A]A^A_fDHSI9uf.AL@ADH~StWAT1I1UI, SL˅uI<$AT$#HH9t#HH9u[]A\D@HLAWIAVAUATM`UHSH(H|$LD$M~lIM1 )L$A\LHI9tBADH|$LLL$^I)HDMH([]A\A]A^A_H~HD$L|H([]A\A]A^A_HH while calling a Python objectNULL result without error in PyObject_Call__int__ returned non-int (type %.200s). The ability to return an instance of a strict subclass of int is deprecated, and may be removed in a future version of Python.__%.4s__ returned non-%.4s (type %.200s)value too large to convert to int%.200s.%.200s is not a type object%.200s.%.200s size changed, may indicate binary incompatibility. Expected %zd from C header, got %zd from PyObject%s.%s size changed, may indicate binary incompatibility. Expected %zd from C header, got %zd from PyObject%.200s does not export expected C variable %.200sC variable %.200s.%.200s has wrong signature (expected %.500s, got %.500s)%.200s does not export expected C function %.200sC function %.200s.%.200s has wrong signature (expected %.500s, got %.500s)Interpreter change detected - this module can only be loaded into one interpreter per process.%s() got multiple values for keyword argument '%U'%.200s() keywords must be strings%s() got an unexpected keyword argument '%U'calling %R should have returned an instance of BaseException, not %Rraise: exception class must be a subclass of BaseException'%.200s' object is unsliceableCannot convert %.200s to %.200stoo many values to unpack (expected %zd)%.200s() takes %.8s %zd positional argument%.1s (%zd given)numpy.random.mtrand.RandomState.waldnumpy.random.mtrand.RandomState.rayleighnumpy.random.mtrand.RandomState.lognormalnumpy.random.mtrand.RandomState.logisticnumpy.random.mtrand.RandomState.gumbelnumpy.random.mtrand.RandomState.laplacenumpy.random.mtrand.RandomState.powernumpy.random.mtrand.RandomState.weibullnumpy.random.mtrand.RandomState.paretonumpy.random.mtrand.RandomState.vonmisesnumpy.random.mtrand.RandomState.standard_tnumpy.random.mtrand.RandomState.standard_cauchynumpy.random.mtrand.RandomState.noncentral_chisquarenumpy.random.mtrand.RandomState.chisquarenumpy.random.mtrand.RandomState.noncentral_fnumpy.random.mtrand.RandomState.fnumpy.random.mtrand.RandomState.gammanumpy.random.mtrand.RandomState.standard_gammanumpy.random.mtrand.RandomState.normalnumpy.random.mtrand.RandomState.standard_normalnumpy.random.mtrand.RandomState.standard_exponentialnumpy.random.mtrand.RandomState.exponentialnumpy.random.mtrand.RandomState.betanumpy.random.mtrand.RandomState.randomnumpy.random.mtrand.RandomState.random_samplenumpy.random.mtrand.RandomState.__reduce__numpy.random.mtrand.RandomState.__getstate__numpy.random.mtrand.RandomState.__str__'%.200s' object is not subscriptablecannot fit '%.200s' into an index-sized integernumpy.random.mtrand.RandomState.__setstate__numpy.random.mtrand.RandomState.__repr__numpy.random.mtrand.RandomState.get_stateModule 'mtrand' has already been imported. Re-initialisation is not supported.compiletime version %s of module '%.100s' does not match runtime version %sinvalid vtable found for imported typenumpy.random._bounded_integersPyObject *(PyObject *, PyObject *, PyObject *, int, int, bitgen_t *, PyObject *)int (double, PyObject *, __pyx_t_5numpy_6random_7_common_constraint_type)int (PyArrayObject *, PyObject *, __pyx_t_5numpy_6random_7_common_constraint_type)PyObject *(void *, bitgen_t *, PyObject *, PyObject *, PyObject *)PyObject *(PyObject *, PyArrayObject *)PyObject *(void *, void *, PyObject *, PyObject *, int, PyObject *, PyObject *, __pyx_t_5numpy_6random_7_common_constraint_type, PyObject *, PyObject *, __pyx_t_5numpy_6random_7_common_constraint_type, PyObject *, PyObject *, __pyx_t_5numpy_6random_7_common_constraint_type, PyObject *)PyObject *(void *, void *, PyObject *, PyObject *, int, int, PyObject *, PyObject *, __pyx_t_5numpy_6random_7_common_constraint_type, PyObject *, PyObject *, __pyx_t_5numpy_6random_7_common_constraint_type, PyObject *, PyObject *, __pyx_t_5numpy_6random_7_common_constraint_type)PyObject *(void *, void *, PyObject *, PyObject *, PyArrayObject *, PyObject *, __pyx_t_5numpy_6random_7_common_constraint_type, PyArrayObject *, PyObject *, __pyx_t_5numpy_6random_7_common_constraint_type, PyArrayObject *, PyObject *, __pyx_t_5numpy_6random_7_common_constraint_type)_ARRAY_API is not PyCapsule objectmodule compiled against ABI version 0x%x but this version of numpy is 0x%xmodule compiled against API version 0x%x but this version of numpy is 0x%xFATAL: module compiled as unknown endianFATAL: module compiled as little endian, but detected different endianness at runtimenumpy.random.mtrand.RandomState.uniformhasattr(): attribute name must be stringnumpy.random.mtrand.RandomState.__init__numpy.random.mtrand.RandomState.permutationnumpy.random.mtrand.RandomState.tomaxintneed more than %zd value%.1s to unpacknumpy.random.mtrand.RandomState.multivariate_normalnumpy.random.mtrand.RandomState.seednumpy.random.mtrand.RandomState.random_integersnumpy.random.mtrand.RandomState.triangularnumpy.random.mtrand.RandomState.set_statenumpy.random.mtrand.RandomState.multinomialnumpy.random.mtrand.RandomState.bytesnumpy.random.mtrand.RandomState.randnnumpy.random.mtrand.RandomState.randnumpy.random.mtrand.RandomState.dirichletnumpy.random.mtrand.RandomState.shufflenumpy.random.mtrand.RandomState.randintnumpy.random.mtrand.RandomState.binomialnumpy.random.mtrand.int64_to_longnumpy.random.mtrand.RandomState.logseriesnumpy.random.mtrand.RandomState.hypergeometricnumpy.random.mtrand.RandomState.geometricnumpy.random.mtrand.RandomState.zipfnumpy.random.mtrand.RandomState.poissonnumpy.random.mtrand.RandomState.negative_binomialnumpy.random.mtrand.RandomState.choice'%.200s' object does not support slice %.10snumpy.random.mtrand.RandomState RandomState(seed=None) Container for the slow Mersenne Twister pseudo-random number generator. Consider using a different BitGenerator with the Generator container instead. `RandomState` and `Generator` expose a number of methods for generating random numbers drawn from a variety of probability distributions. In addition to the distribution-specific arguments, each method takes a keyword argument `size` that defaults to ``None``. If `size` is ``None``, then a single value is generated and returned. If `size` is an integer, then a 1-D array filled with generated values is returned. If `size` is a tuple, then an array with that shape is filled and returned. **Compatibility Guarantee** A fixed bit generator using a fixed seed and a fixed series of calls to 'RandomState' methods using the same parameters will always produce the same results up to roundoff error except when the values were incorrect. `RandomState` is effectively frozen and will only receive updates that are required by changes in the the internals of Numpy. More substantial changes, including algorithmic improvements, are reserved for `Generator`. Parameters ---------- seed : {None, int, array_like, BitGenerator}, optional Random seed used to initialize the pseudo-random number generator or an instantized BitGenerator. If an integer or array, used as a seed for the MT19937 BitGenerator. Values can be any integer between 0 and 2**32 - 1 inclusive, an array (or other sequence) of such integers, or ``None`` (the default). If `seed` is ``None``, then the `MT19937` BitGenerator is initialized by reading data from ``/dev/urandom`` (or the Windows analogue) if available or seed from the clock otherwise. Notes ----- The Python stdlib module "random" also contains a Mersenne Twister pseudo-random number generator with a number of methods that are similar to the ones available in `RandomState`. `RandomState`, besides being NumPy-aware, has the advantage that it provides a much larger number of probability distributions to choose from. See Also -------- Generator MT19937 numpy.random.BitGenerator an integer is required__pyx_capi__name__loader__loader__file__origin__package__parent__path__submodule_search_locationsMissing type objectname '%U' is not definednumpy/random/mtrand.c%s (%s:%d)at leastat mostwaldmtrand.pyxrayleighlognormallogisticgumbellaplacepowerweibullparetovonmisesstandard_tstandard_cauchynoncentral_chisquarenoncentral_fstandard_gammastandard_normalstandard_exponentialbetarandomrandom_samplecannot import name %Sget_state%d.%d%sbuiltinscython_runtime__builtins__4294967296complexnumpydtypeflatiterbroadcastndarrayufuncnumpy.random.bit_generatorBitGeneratorSeedSequenceSeedlessSequencenumpy.random._commondoubleLEGACY_POISSON_LAM_MAXuint64_tMAXSIZE_rand_uint64_rand_uint32_rand_uint16_rand_uint8_rand_bool_rand_int64_rand_int32_rand_int16_rand_int8check_constraintcheck_array_constraintdouble (double *, npy_intp)kahan_sumdouble_fillvalidate_output_shapecontdisccont_broadcast_3discrete_broadcast_iiinumpy.core._multiarray_umath_ARRAY_API_ARRAY_API not found_ARRAY_API is NULL pointer__init__.pxdnumpy.import_arrayinit numpy.random.mtrandnumpy.random.mtrand.ranfnumpy.random.mtrand.sampleuniform__init__tomaxintmultivariate_normalseedrandom_integerstriangularmultinomialrandndirichletrandintnumpy.PyArray_MultiIterNew2numpy.PyArray_MultiIterNew3logserieshypergeometriczipfpoissonnegative_binomialassignmentdeletionchoice_bit_generator__getstate____setstate____reduce__set_statebytesshufflepermutation:0:999NNgNNNPPPO@P(PRRRRR Ծܾ̾пxptd<~uQ<C===|=<C%CCCx@ZQHDĽw t|\D\p#>J( "dNVOOOxtt ׎Ǝ@06'[O4qxD$This function is deprecated. Please call randint({low}, {high} + 1) insteadx must be an integer or at least 1-dimensionalprobabilities are not non-negativenumpy.core.umath failed to importmean and cov must have same lengthget_state and legacy can only be used with the MT19937 BitGenerator. To silence this warning, set `legacy` to False.covariance is not positive-semidefinite.cov must be 2 dimensional and squarecheck_valid must equal 'warn', 'raise', or 'ignore'can only re-seed a MT19937 BitGeneratora must be 1-dimensional or an integerThis function is deprecated. Please call randint(1, {low} + 1) insteadRandomState.triangular (line 3150)RandomState.standard_t (line 2079)RandomState.standard_normal (line 1331)RandomState.standard_exponential (line 544)RandomState.standard_cauchy (line 2006)RandomState.random_sample (line 372)RandomState.random_integers (line 1235)RandomState.permutation (line 4482)RandomState.noncentral_f (line 1759)RandomState.noncentral_chisquare (line 1919)RandomState.negative_binomial (line 3409)RandomState.multinomial (line 4118)Providing a dtype with a non-native byteorder is not supported. If you require platform-independent byteorder, call byteswap when required. In future version, providing byteorder will raise a ValueErrorNegative dimensions are not allowedInvalid bit generator. The bit generator must be instantized.Fewer non-zero entries in p than sizeCannot take a larger sample than population when 'replace=False' zipf(a, size=None) Draw samples from a Zipf distribution. Samples are drawn from a Zipf distribution with specified parameter `a` > 1. The Zipf distribution (also known as the zeta distribution) is a continuous probability distribution that satisfies Zipf's law: the frequency of an item is inversely proportional to its rank in a frequency table. .. note:: New code should use the ``zipf`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- a : float or array_like of floats Distribution parameter. Must be greater than 1. size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. If size is ``None`` (default), a single value is returned if ``a`` is a scalar. Otherwise, ``np.array(a).size`` samples are drawn. Returns ------- out : ndarray or scalar Drawn samples from the parameterized Zipf distribution. See Also -------- scipy.stats.zipf : probability density function, distribution, or cumulative density function, etc. Generator.zipf: which should be used for new code. Notes ----- The probability density for the Zipf distribution is .. math:: p(x) = \frac{x^{-a}}{\zeta(a)}, where :math:`\zeta` is the Riemann Zeta function. It is named for the American linguist George Kingsley Zipf, who noted that the frequency of any word in a sample of a language is inversely proportional to its rank in the frequency table. References ---------- .. [1] Zipf, G. K., "Selected Studies of the Principle of Relative Frequency in Language," Cambridge, MA: Harvard Univ. Press, 1932. Examples -------- Draw samples from the distribution: >>> a = 2. # parameter >>> s = np.random.zipf(a, 1000) Display the histogram of the samples, along with the probability density function: >>> import matplotlib.pyplot as plt >>> from scipy import special # doctest: +SKIP Truncate s values at 50 so plot is interesting: >>> count, bins, ignored = plt.hist(s[s<50], 50, density=True) >>> x = np.arange(1., 50.) >>> y = x**(-a) / special.zetac(a) # doctest: +SKIP >>> plt.plot(x, y/max(y), linewidth=2, color='r') # doctest: +SKIP >>> plt.show() weibull(a, size=None) Draw samples from a Weibull distribution. Draw samples from a 1-parameter Weibull distribution with the given shape parameter `a`. .. math:: X = (-ln(U))^{1/a} Here, U is drawn from the uniform distribution over (0,1]. The more common 2-parameter Weibull, including a scale parameter :math:`\lambda` is just :math:`X = \lambda(-ln(U))^{1/a}`. .. note:: New code should use the ``weibull`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- a : float or array_like of floats Shape parameter of the distribution. Must be nonnegative. size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. If size is ``None`` (default), a single value is returned if ``a`` is a scalar. Otherwise, ``np.array(a).size`` samples are drawn. Returns ------- out : ndarray or scalar Drawn samples from the parameterized Weibull distribution. See Also -------- scipy.stats.weibull_max scipy.stats.weibull_min scipy.stats.genextreme gumbel Generator.weibull: which should be used for new code. Notes ----- The Weibull (or Type III asymptotic extreme value distribution for smallest values, SEV Type III, or Rosin-Rammler distribution) is one of a class of Generalized Extreme Value (GEV) distributions used in modeling extreme value problems. This class includes the Gumbel and Frechet distributions. The probability density for the Weibull distribution is .. math:: p(x) = \frac{a} {\lambda}(\frac{x}{\lambda})^{a-1}e^{-(x/\lambda)^a}, where :math:`a` is the shape and :math:`\lambda` the scale. The function has its peak (the mode) at :math:`\lambda(\frac{a-1}{a})^{1/a}`. When ``a = 1``, the Weibull distribution reduces to the exponential distribution. References ---------- .. [1] Waloddi Weibull, Royal Technical University, Stockholm, 1939 "A Statistical Theory Of The Strength Of Materials", Ingeniorsvetenskapsakademiens Handlingar Nr 151, 1939, Generalstabens Litografiska Anstalts Forlag, Stockholm. .. [2] Waloddi Weibull, "A Statistical Distribution Function of Wide Applicability", Journal Of Applied Mechanics ASME Paper 1951. .. [3] Wikipedia, "Weibull distribution", https://en.wikipedia.org/wiki/Weibull_distribution Examples -------- Draw samples from the distribution: >>> a = 5. # shape >>> s = np.random.weibull(a, 1000) Display the histogram of the samples, along with the probability density function: >>> import matplotlib.pyplot as plt >>> x = np.arange(1,100.)/50. >>> def weib(x,n,a): ... return (a / n) * (x / n)**(a - 1) * np.exp(-(x / n)**a) >>> count, bins, ignored = plt.hist(np.random.weibull(5.,1000)) >>> x = np.arange(1,100.)/50. >>> scale = count.max()/weib(x, 1., 5.).max() >>> plt.plot(x, weib(x, 1., 5.)*scale) >>> plt.show() vonmises(mu, kappa, size=None) Draw samples from a von Mises distribution. Samples are drawn from a von Mises distribution with specified mode (mu) and dispersion (kappa), on the interval [-pi, pi]. The von Mises distribution (also known as the circular normal distribution) is a continuous probability distribution on the unit circle. It may be thought of as the circular analogue of the normal distribution. .. note:: New code should use the ``vonmises`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- mu : float or array_like of floats Mode ("center") of the distribution. kappa : float or array_like of floats Dispersion of the distribution, has to be >=0. size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. If size is ``None`` (default), a single value is returned if ``mu`` and ``kappa`` are both scalars. Otherwise, ``np.broadcast(mu, kappa).size`` samples are drawn. Returns ------- out : ndarray or scalar Drawn samples from the parameterized von Mises distribution. See Also -------- scipy.stats.vonmises : probability density function, distribution, or cumulative density function, etc. Generator.vonmises: which should be used for new code. Notes ----- The probability density for the von Mises distribution is .. math:: p(x) = \frac{e^{\kappa cos(x-\mu)}}{2\pi I_0(\kappa)}, where :math:`\mu` is the mode and :math:`\kappa` the dispersion, and :math:`I_0(\kappa)` is the modified Bessel function of order 0. The von Mises is named for Richard Edler von Mises, who was born in Austria-Hungary, in what is now the Ukraine. He fled to the United States in 1939 and became a professor at Harvard. He worked in probability theory, aerodynamics, fluid mechanics, and philosophy of science. References ---------- .. [1] Abramowitz, M. and Stegun, I. A. (Eds.). "Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables, 9th printing," New York: Dover, 1972. .. [2] von Mises, R., "Mathematical Theory of Probability and Statistics", New York: Academic Press, 1964. Examples -------- Draw samples from the distribution: >>> mu, kappa = 0.0, 4.0 # mean and dispersion >>> s = np.random.vonmises(mu, kappa, 1000) Display the histogram of the samples, along with the probability density function: >>> import matplotlib.pyplot as plt >>> from scipy.special import i0 # doctest: +SKIP >>> plt.hist(s, 50, density=True) >>> x = np.linspace(-np.pi, np.pi, num=51) >>> y = np.exp(kappa*np.cos(x-mu))/(2*np.pi*i0(kappa)) # doctest: +SKIP >>> plt.plot(x, y, linewidth=2, color='r') # doctest: +SKIP >>> plt.show() uniform(low=0.0, high=1.0, size=None) Draw samples from a uniform distribution. Samples are uniformly distributed over the half-open interval ``[low, high)`` (includes low, but excludes high). In other words, any value within the given interval is equally likely to be drawn by `uniform`. .. note:: New code should use the ``uniform`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- low : float or array_like of floats, optional Lower boundary of the output interval. All values generated will be greater than or equal to low. The default value is 0. high : float or array_like of floats Upper boundary of the output interval. All values generated will be less than or equal to high. The default value is 1.0. size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. If size is ``None`` (default), a single value is returned if ``low`` and ``high`` are both scalars. Otherwise, ``np.broadcast(low, high).size`` samples are drawn. Returns ------- out : ndarray or scalar Drawn samples from the parameterized uniform distribution. See Also -------- randint : Discrete uniform distribution, yielding integers. random_integers : Discrete uniform distribution over the closed interval ``[low, high]``. random_sample : Floats uniformly distributed over ``[0, 1)``. random : Alias for `random_sample`. rand : Convenience function that accepts dimensions as input, e.g., ``rand(2,2)`` would generate a 2-by-2 array of floats, uniformly distributed over ``[0, 1)``. Generator.uniform: which should be used for new code. Notes ----- The probability density function of the uniform distribution is .. math:: p(x) = \frac{1}{b - a} anywhere within the interval ``[a, b)``, and zero elsewhere. When ``high`` == ``low``, values of ``low`` will be returned. If ``high`` < ``low``, the results are officially undefined and may eventually raise an error, i.e. do not rely on this function to behave when passed arguments satisfying that inequality condition. The ``high`` limit may be included in the returned array of floats due to floating-point rounding in the equation ``low + (high-low) * random_sample()``. For example: >>> x = np.float32(5*0.99999999) >>> x 5.0 Examples -------- Draw samples from the distribution: >>> s = np.random.uniform(-1,0,1000) All values are within the given interval: >>> np.all(s >= -1) True >>> np.all(s < 0) True Display the histogram of the samples, along with the probability density function: >>> import matplotlib.pyplot as plt >>> count, bins, ignored = plt.hist(s, 15, density=True) >>> plt.plot(bins, np.ones_like(bins), linewidth=2, color='r') >>> plt.show() triangular(left, mode, right, size=None) Draw samples from the triangular distribution over the interval ``[left, right]``. The triangular distribution is a continuous probability distribution with lower limit left, peak at mode, and upper limit right. Unlike the other distributions, these parameters directly define the shape of the pdf. .. note:: New code should use the ``triangular`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- left : float or array_like of floats Lower limit. mode : float or array_like of floats The value where the peak of the distribution occurs. The value must fulfill the condition ``left <= mode <= right``. right : float or array_like of floats Upper limit, must be larger than `left`. size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. If size is ``None`` (default), a single value is returned if ``left``, ``mode``, and ``right`` are all scalars. Otherwise, ``np.broadcast(left, mode, right).size`` samples are drawn. Returns ------- out : ndarray or scalar Drawn samples from the parameterized triangular distribution. See Also -------- Generator.triangular: which should be used for new code. Notes ----- The probability density function for the triangular distribution is .. math:: P(x;l, m, r) = \begin{cases} \frac{2(x-l)}{(r-l)(m-l)}& \text{for $l \leq x \leq m$},\\ \frac{2(r-x)}{(r-l)(r-m)}& \text{for $m \leq x \leq r$},\\ 0& \text{otherwise}. \end{cases} The triangular distribution is often used in ill-defined problems where the underlying distribution is not known, but some knowledge of the limits and mode exists. Often it is used in simulations. References ---------- .. [1] Wikipedia, "Triangular distribution" https://en.wikipedia.org/wiki/Triangular_distribution Examples -------- Draw values from the distribution and plot the histogram: >>> import matplotlib.pyplot as plt >>> h = plt.hist(np.random.triangular(-3, 0, 8, 100000), bins=200, ... density=True) >>> plt.show() tomaxint(size=None) Return a sample of uniformly distributed random integers in the interval [0, ``np.iinfo(np.int_).max``]. The `np.int_` type translates to the C long integer type and its precision is platform dependent. Parameters ---------- size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. Default is None, in which case a single value is returned. Returns ------- out : ndarray Drawn samples, with shape `size`. See Also -------- randint : Uniform sampling over a given half-open interval of integers. random_integers : Uniform sampling over a given closed interval of integers. Examples -------- >>> rs = np.random.RandomState() # need a RandomState object >>> rs.tomaxint((2,2,2)) array([[[1170048599, 1600360186], # random [ 739731006, 1947757578]], [[1871712945, 752307660], [1601631370, 1479324245]]]) >>> rs.tomaxint((2,2,2)) < np.iinfo(np.int_).max array([[[ True, True], [ True, True]], [[ True, True], [ True, True]]]) state must be a dict or a tuple. standard_t(df, size=None) Draw samples from a standard Student's t distribution with `df` degrees of freedom. A special case of the hyperbolic distribution. As `df` gets large, the result resembles that of the standard normal distribution (`standard_normal`). .. note:: New code should use the ``standard_t`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- df : float or array_like of floats Degrees of freedom, must be > 0. size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. If size is ``None`` (default), a single value is returned if ``df`` is a scalar. Otherwise, ``np.array(df).size`` samples are drawn. Returns ------- out : ndarray or scalar Drawn samples from the parameterized standard Student's t distribution. See Also -------- Generator.standard_t: which should be used for new code. Notes ----- The probability density function for the t distribution is .. math:: P(x, df) = \frac{\Gamma(\frac{df+1}{2})}{\sqrt{\pi df} \Gamma(\frac{df}{2})}\Bigl( 1+\frac{x^2}{df} \Bigr)^{-(df+1)/2} The t test is based on an assumption that the data come from a Normal distribution. The t test provides a way to test whether the sample mean (that is the mean calculated from the data) is a good estimate of the true mean. The derivation of the t-distribution was first published in 1908 by William Gosset while working for the Guinness Brewery in Dublin. Due to proprietary issues, he had to publish under a pseudonym, and so he used the name Student. References ---------- .. [1] Dalgaard, Peter, "Introductory Statistics With R", Springer, 2002. .. [2] Wikipedia, "Student's t-distribution" https://en.wikipedia.org/wiki/Student's_t-distribution Examples -------- From Dalgaard page 83 [1]_, suppose the daily energy intake for 11 women in kilojoules (kJ) is: >>> intake = np.array([5260., 5470, 5640, 6180, 6390, 6515, 6805, 7515, \ ... 7515, 8230, 8770]) Does their energy intake deviate systematically from the recommended value of 7725 kJ? We have 10 degrees of freedom, so is the sample mean within 95% of the recommended value? >>> s = np.random.standard_t(10, size=100000) >>> np.mean(intake) 6753.636363636364 >>> intake.std(ddof=1) 1142.1232221373727 Calculate the t statistic, setting the ddof parameter to the unbiased value so the divisor in the standard deviation will be degrees of freedom, N-1. >>> t = (np.mean(intake)-7725)/(intake.std(ddof=1)/np.sqrt(len(intake))) >>> import matplotlib.pyplot as plt >>> h = plt.hist(s, bins=100, density=True) For a one-sided t-test, how far out in the distribution does the t statistic appear? >>> np.sum(s>> from numpy.random import MT19937 >>> from numpy.random import RandomState, SeedSequence >>> rs = RandomState(MT19937(SeedSequence(123456789))) # Later, you want to restart the stream >>> rs = RandomState(MT19937(SeedSequence(987654321))) rayleigh(scale=1.0, size=None) Draw samples from a Rayleigh distribution. The :math:`\chi` and Weibull distributions are generalizations of the Rayleigh. .. note:: New code should use the ``rayleigh`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- scale : float or array_like of floats, optional Scale, also equals the mode. Must be non-negative. Default is 1. size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. If size is ``None`` (default), a single value is returned if ``scale`` is a scalar. Otherwise, ``np.array(scale).size`` samples are drawn. Returns ------- out : ndarray or scalar Drawn samples from the parameterized Rayleigh distribution. See Also -------- Generator.rayleigh: which should be used for new code. Notes ----- The probability density function for the Rayleigh distribution is .. math:: P(x;scale) = \frac{x}{scale^2}e^{\frac{-x^2}{2 \cdotp scale^2}} The Rayleigh distribution would arise, for example, if the East and North components of the wind velocity had identical zero-mean Gaussian distributions. Then the wind speed would have a Rayleigh distribution. References ---------- .. [1] Brighton Webs Ltd., "Rayleigh Distribution," https://web.archive.org/web/20090514091424/http://brighton-webs.co.uk:80/distributions/rayleigh.asp .. [2] Wikipedia, "Rayleigh distribution" https://en.wikipedia.org/wiki/Rayleigh_distribution Examples -------- Draw values from the distribution and plot the histogram >>> from matplotlib.pyplot import hist >>> values = hist(np.random.rayleigh(3, 100000), bins=200, density=True) Wave heights tend to follow a Rayleigh distribution. If the mean wave height is 1 meter, what fraction of waves are likely to be larger than 3 meters? >>> meanvalue = 1 >>> modevalue = np.sqrt(2 / np.pi) * meanvalue >>> s = np.random.rayleigh(modevalue, 1000000) The percentage of waves larger than 3 meters is: >>> 100.*sum(s>3)/1000000. 0.087300000000000003 # random random_integers(low, high=None, size=None) Random integers of type `np.int_` between `low` and `high`, inclusive. Return random integers of type `np.int_` from the "discrete uniform" distribution in the closed interval [`low`, `high`]. If `high` is None (the default), then results are from [1, `low`]. The `np.int_` type translates to the C long integer type and its precision is platform dependent. This function has been deprecated. Use randint instead. .. deprecated:: 1.11.0 Parameters ---------- low : int Lowest (signed) integer to be drawn from the distribution (unless ``high=None``, in which case this parameter is the *highest* such integer). high : int, optional If provided, the largest (signed) integer to be drawn from the distribution (see above for behavior if ``high=None``). size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. Default is None, in which case a single value is returned. Returns ------- out : int or ndarray of ints `size`-shaped array of random integers from the appropriate distribution, or a single such random int if `size` not provided. See Also -------- randint : Similar to `random_integers`, only for the half-open interval [`low`, `high`), and 0 is the lowest value if `high` is omitted. Notes ----- To sample from N evenly spaced floating-point numbers between a and b, use:: a + (b - a) * (np.random.random_integers(N) - 1) / (N - 1.) Examples -------- >>> np.random.random_integers(5) 4 # random >>> type(np.random.random_integers(5)) >>> np.random.random_integers(5, size=(3,2)) array([[5, 4], # random [3, 3], [4, 5]]) Choose five random numbers from the set of five evenly-spaced numbers between 0 and 2.5, inclusive (*i.e.*, from the set :math:`{0, 5/8, 10/8, 15/8, 20/8}`): >>> 2.5 * (np.random.random_integers(5, size=(5,)) - 1) / 4. array([ 0.625, 1.25 , 0.625, 0.625, 2.5 ]) # random Roll two six sided dice 1000 times and sum the results: >>> d1 = np.random.random_integers(1, 6, 1000) >>> d2 = np.random.random_integers(1, 6, 1000) >>> dsums = d1 + d2 Display results as a histogram: >>> import matplotlib.pyplot as plt >>> count, bins, ignored = plt.hist(dsums, 11, density=True) >>> plt.show() randint(low, high=None, size=None, dtype=int) Return random integers from `low` (inclusive) to `high` (exclusive). Return random integers from the "discrete uniform" distribution of the specified dtype in the "half-open" interval [`low`, `high`). If `high` is None (the default), then results are from [0, `low`). .. note:: New code should use the ``integers`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- low : int or array-like of ints Lowest (signed) integers to be drawn from the distribution (unless ``high=None``, in which case this parameter is one above the *highest* such integer). high : int or array-like of ints, optional If provided, one above the largest (signed) integer to be drawn from the distribution (see above for behavior if ``high=None``). If array-like, must contain integer values size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. Default is None, in which case a single value is returned. dtype : dtype, optional Desired dtype of the result. Byteorder must be native. The default value is int. .. versionadded:: 1.11.0 Returns ------- out : int or ndarray of ints `size`-shaped array of random integers from the appropriate distribution, or a single such random int if `size` not provided. See Also -------- random_integers : similar to `randint`, only for the closed interval [`low`, `high`], and 1 is the lowest value if `high` is omitted. Generator.integers: which should be used for new code. Examples -------- >>> np.random.randint(2, size=10) array([1, 0, 0, 0, 1, 1, 0, 0, 1, 0]) # random >>> np.random.randint(1, size=10) array([0, 0, 0, 0, 0, 0, 0, 0, 0, 0]) Generate a 2 x 4 array of ints between 0 and 4, inclusive: >>> np.random.randint(5, size=(2, 4)) array([[4, 0, 2, 1], # random [3, 2, 2, 0]]) Generate a 1 x 3 array with 3 different upper bounds >>> np.random.randint(1, [3, 5, 10]) array([2, 2, 9]) # random Generate a 1 by 3 array with 3 different lower bounds >>> np.random.randint([1, 5, 7], 10) array([9, 8, 7]) # random Generate a 2 by 4 array using broadcasting with dtype of uint8 >>> np.random.randint([1, 3, 5, 7], [[10], [20]], dtype=np.uint8) array([[ 8, 6, 9, 7], # random [ 1, 16, 9, 12]], dtype=uint8) power(a, size=None) Draws samples in [0, 1] from a power distribution with positive exponent a - 1. Also known as the power function distribution. .. note:: New code should use the ``power`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- a : float or array_like of floats Parameter of the distribution. Must be non-negative. size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. If size is ``None`` (default), a single value is returned if ``a`` is a scalar. Otherwise, ``np.array(a).size`` samples are drawn. Returns ------- out : ndarray or scalar Drawn samples from the parameterized power distribution. Raises ------ ValueError If a < 1. See Also -------- Generator.power: which should be used for new code. Notes ----- The probability density function is .. math:: P(x; a) = ax^{a-1}, 0 \le x \le 1, a>0. The power function distribution is just the inverse of the Pareto distribution. It may also be seen as a special case of the Beta distribution. It is used, for example, in modeling the over-reporting of insurance claims. References ---------- .. [1] Christian Kleiber, Samuel Kotz, "Statistical size distributions in economics and actuarial sciences", Wiley, 2003. .. [2] Heckert, N. A. and Filliben, James J. "NIST Handbook 148: Dataplot Reference Manual, Volume 2: Let Subcommands and Library Functions", National Institute of Standards and Technology Handbook Series, June 2003. https://www.itl.nist.gov/div898/software/dataplot/refman2/auxillar/powpdf.pdf Examples -------- Draw samples from the distribution: >>> a = 5. # shape >>> samples = 1000 >>> s = np.random.power(a, samples) Display the histogram of the samples, along with the probability density function: >>> import matplotlib.pyplot as plt >>> count, bins, ignored = plt.hist(s, bins=30) >>> x = np.linspace(0, 1, 100) >>> y = a*x**(a-1.) >>> normed_y = samples*np.diff(bins)[0]*y >>> plt.plot(x, normed_y) >>> plt.show() Compare the power function distribution to the inverse of the Pareto. >>> from scipy import stats # doctest: +SKIP >>> rvs = np.random.power(5, 1000000) >>> rvsp = np.random.pareto(5, 1000000) >>> xx = np.linspace(0,1,100) >>> powpdf = stats.powerlaw.pdf(xx,5) # doctest: +SKIP >>> plt.figure() >>> plt.hist(rvs, bins=50, density=True) >>> plt.plot(xx,powpdf,'r-') # doctest: +SKIP >>> plt.title('np.random.power(5)') >>> plt.figure() >>> plt.hist(1./(1.+rvsp), bins=50, density=True) >>> plt.plot(xx,powpdf,'r-') # doctest: +SKIP >>> plt.title('inverse of 1 + np.random.pareto(5)') >>> plt.figure() >>> plt.hist(1./(1.+rvsp), bins=50, density=True) >>> plt.plot(xx,powpdf,'r-') # doctest: +SKIP >>> plt.title('inverse of stats.pareto(5)') pareto(a, size=None) Draw samples from a Pareto II or Lomax distribution with specified shape. The Lomax or Pareto II distribution is a shifted Pareto distribution. The classical Pareto distribution can be obtained from the Lomax distribution by adding 1 and multiplying by the scale parameter ``m`` (see Notes). The smallest value of the Lomax distribution is zero while for the classical Pareto distribution it is ``mu``, where the standard Pareto distribution has location ``mu = 1``. Lomax can also be considered as a simplified version of the Generalized Pareto distribution (available in SciPy), with the scale set to one and the location set to zero. The Pareto distribution must be greater than zero, and is unbounded above. It is also known as the "80-20 rule". In this distribution, 80 percent of the weights are in the lowest 20 percent of the range, while the other 20 percent fill the remaining 80 percent of the range. .. note:: New code should use the ``pareto`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- a : float or array_like of floats Shape of the distribution. Must be positive. size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. If size is ``None`` (default), a single value is returned if ``a`` is a scalar. Otherwise, ``np.array(a).size`` samples are drawn. Returns ------- out : ndarray or scalar Drawn samples from the parameterized Pareto distribution. See Also -------- scipy.stats.lomax : probability density function, distribution or cumulative density function, etc. scipy.stats.genpareto : probability density function, distribution or cumulative density function, etc. Generator.pareto: which should be used for new code. Notes ----- The probability density for the Pareto distribution is .. math:: p(x) = \frac{am^a}{x^{a+1}} where :math:`a` is the shape and :math:`m` the scale. The Pareto distribution, named after the Italian economist Vilfredo Pareto, is a power law probability distribution useful in many real world problems. Outside the field of economics it is generally referred to as the Bradford distribution. Pareto developed the distribution to describe the distribution of wealth in an economy. It has also found use in insurance, web page access statistics, oil field sizes, and many other problems, including the download frequency for projects in Sourceforge [1]_. It is one of the so-called "fat-tailed" distributions. References ---------- .. [1] Francis Hunt and Paul Johnson, On the Pareto Distribution of Sourceforge projects. .. [2] Pareto, V. (1896). Course of Political Economy. Lausanne. .. [3] Reiss, R.D., Thomas, M.(2001), Statistical Analysis of Extreme Values, Birkhauser Verlag, Basel, pp 23-30. .. [4] Wikipedia, "Pareto distribution", https://en.wikipedia.org/wiki/Pareto_distribution Examples -------- Draw samples from the distribution: >>> a, m = 3., 2. # shape and mode >>> s = (np.random.pareto(a, 1000) + 1) * m Display the histogram of the samples, along with the probability density function: >>> import matplotlib.pyplot as plt >>> count, bins, _ = plt.hist(s, 100, density=True) >>> fit = a*m**a / bins**(a+1) >>> plt.plot(bins, max(count)*fit/max(fit), linewidth=2, color='r') >>> plt.show() numpy.core.multiarray failed to import normal(loc=0.0, scale=1.0, size=None) Draw random samples from a normal (Gaussian) distribution. The probability density function of the normal distribution, first derived by De Moivre and 200 years later by both Gauss and Laplace independently [2]_, is often called the bell curve because of its characteristic shape (see the example below). The normal distributions occurs often in nature. For example, it describes the commonly occurring distribution of samples influenced by a large number of tiny, random disturbances, each with its own unique distribution [2]_. .. note:: New code should use the ``normal`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- loc : float or array_like of floats Mean ("centre") of the distribution. scale : float or array_like of floats Standard deviation (spread or "width") of the distribution. Must be non-negative. size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. If size is ``None`` (default), a single value is returned if ``loc`` and ``scale`` are both scalars. Otherwise, ``np.broadcast(loc, scale).size`` samples are drawn. Returns ------- out : ndarray or scalar Drawn samples from the parameterized normal distribution. See Also -------- scipy.stats.norm : probability density function, distribution or cumulative density function, etc. Generator.normal: which should be used for new code. Notes ----- The probability density for the Gaussian distribution is .. math:: p(x) = \frac{1}{\sqrt{ 2 \pi \sigma^2 }} e^{ - \frac{ (x - \mu)^2 } {2 \sigma^2} }, where :math:`\mu` is the mean and :math:`\sigma` the standard deviation. The square of the standard deviation, :math:`\sigma^2`, is called the variance. The function has its peak at the mean, and its "spread" increases with the standard deviation (the function reaches 0.607 times its maximum at :math:`x + \sigma` and :math:`x - \sigma` [2]_). This implies that normal is more likely to return samples lying close to the mean, rather than those far away. References ---------- .. [1] Wikipedia, "Normal distribution", https://en.wikipedia.org/wiki/Normal_distribution .. [2] P. R. Peebles Jr., "Central Limit Theorem" in "Probability, Random Variables and Random Signal Principles", 4th ed., 2001, pp. 51, 51, 125. Examples -------- Draw samples from the distribution: >>> mu, sigma = 0, 0.1 # mean and standard deviation >>> s = np.random.normal(mu, sigma, 1000) Verify the mean and the variance: >>> abs(mu - np.mean(s)) 0.0 # may vary >>> abs(sigma - np.std(s, ddof=1)) 0.1 # may vary Display the histogram of the samples, along with the probability density function: >>> import matplotlib.pyplot as plt >>> count, bins, ignored = plt.hist(s, 30, density=True) >>> plt.plot(bins, 1/(sigma * np.sqrt(2 * np.pi)) * ... np.exp( - (bins - mu)**2 / (2 * sigma**2) ), ... linewidth=2, color='r') >>> plt.show() Two-by-four array of samples from N(3, 6.25): >>> np.random.normal(3, 2.5, size=(2, 4)) array([[-4.49401501, 4.00950034, -1.81814867, 7.29718677], # random [ 0.39924804, 4.68456316, 4.99394529, 4.84057254]]) # random noncentral_f(dfnum, dfden, nonc, size=None) Draw samples from the noncentral F distribution. Samples are drawn from an F distribution with specified parameters, `dfnum` (degrees of freedom in numerator) and `dfden` (degrees of freedom in denominator), where both parameters > 1. `nonc` is the non-centrality parameter. .. note:: New code should use the ``noncentral_f`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- dfnum : float or array_like of floats Numerator degrees of freedom, must be > 0. .. versionchanged:: 1.14.0 Earlier NumPy versions required dfnum > 1. dfden : float or array_like of floats Denominator degrees of freedom, must be > 0. nonc : float or array_like of floats Non-centrality parameter, the sum of the squares of the numerator means, must be >= 0. size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. If size is ``None`` (default), a single value is returned if ``dfnum``, ``dfden``, and ``nonc`` are all scalars. Otherwise, ``np.broadcast(dfnum, dfden, nonc).size`` samples are drawn. Returns ------- out : ndarray or scalar Drawn samples from the parameterized noncentral Fisher distribution. See Also -------- Generator.noncentral_f: which should be used for new code. Notes ----- When calculating the power of an experiment (power = probability of rejecting the null hypothesis when a specific alternative is true) the non-central F statistic becomes important. When the null hypothesis is true, the F statistic follows a central F distribution. When the null hypothesis is not true, then it follows a non-central F statistic. References ---------- .. [1] Weisstein, Eric W. "Noncentral F-Distribution." From MathWorld--A Wolfram Web Resource. http://mathworld.wolfram.com/NoncentralF-Distribution.html .. [2] Wikipedia, "Noncentral F-distribution", https://en.wikipedia.org/wiki/Noncentral_F-distribution Examples -------- In a study, testing for a specific alternative to the null hypothesis requires use of the Noncentral F distribution. We need to calculate the area in the tail of the distribution that exceeds the value of the F distribution for the null hypothesis. We'll plot the two probability distributions for comparison. >>> dfnum = 3 # between group deg of freedom >>> dfden = 20 # within groups degrees of freedom >>> nonc = 3.0 >>> nc_vals = np.random.noncentral_f(dfnum, dfden, nonc, 1000000) >>> NF = np.histogram(nc_vals, bins=50, density=True) >>> c_vals = np.random.f(dfnum, dfden, 1000000) >>> F = np.histogram(c_vals, bins=50, density=True) >>> import matplotlib.pyplot as plt >>> plt.plot(F[1][1:], F[0]) >>> plt.plot(NF[1][1:], NF[0]) >>> plt.show() noncentral_chisquare(df, nonc, size=None) Draw samples from a noncentral chi-square distribution. The noncentral :math:`\chi^2` distribution is a generalization of the :math:`\chi^2` distribution. .. note:: New code should use the ``noncentral_chisquare`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- df : float or array_like of floats Degrees of freedom, must be > 0. .. versionchanged:: 1.10.0 Earlier NumPy versions required dfnum > 1. nonc : float or array_like of floats Non-centrality, must be non-negative. size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. If size is ``None`` (default), a single value is returned if ``df`` and ``nonc`` are both scalars. Otherwise, ``np.broadcast(df, nonc).size`` samples are drawn. Returns ------- out : ndarray or scalar Drawn samples from the parameterized noncentral chi-square distribution. See Also -------- Generator.noncentral_chisquare: which should be used for new code. Notes ----- The probability density function for the noncentral Chi-square distribution is .. math:: P(x;df,nonc) = \sum^{\infty}_{i=0} \frac{e^{-nonc/2}(nonc/2)^{i}}{i!} P_{Y_{df+2i}}(x), where :math:`Y_{q}` is the Chi-square with q degrees of freedom. References ---------- .. [1] Wikipedia, "Noncentral chi-squared distribution" https://en.wikipedia.org/wiki/Noncentral_chi-squared_distribution Examples -------- Draw values from the distribution and plot the histogram >>> import matplotlib.pyplot as plt >>> values = plt.hist(np.random.noncentral_chisquare(3, 20, 100000), ... bins=200, density=True) >>> plt.show() Draw values from a noncentral chisquare with very small noncentrality, and compare to a chisquare. >>> plt.figure() >>> values = plt.hist(np.random.noncentral_chisquare(3, .0000001, 100000), ... bins=np.arange(0., 25, .1), density=True) >>> values2 = plt.hist(np.random.chisquare(3, 100000), ... bins=np.arange(0., 25, .1), density=True) >>> plt.plot(values[1][0:-1], values[0]-values2[0], 'ob') >>> plt.show() Demonstrate how large values of non-centrality lead to a more symmetric distribution. >>> plt.figure() >>> values = plt.hist(np.random.noncentral_chisquare(3, 20, 100000), ... bins=200, density=True) >>> plt.show() negative_binomial(n, p, size=None) Draw samples from a negative binomial distribution. Samples are drawn from a negative binomial distribution with specified parameters, `n` successes and `p` probability of success where `n` is > 0 and `p` is in the interval [0, 1]. .. note:: New code should use the ``negative_binomial`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- n : float or array_like of floats Parameter of the distribution, > 0. p : float or array_like of floats Parameter of the distribution, >= 0 and <=1. size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. If size is ``None`` (default), a single value is returned if ``n`` and ``p`` are both scalars. Otherwise, ``np.broadcast(n, p).size`` samples are drawn. Returns ------- out : ndarray or scalar Drawn samples from the parameterized negative binomial distribution, where each sample is equal to N, the number of failures that occurred before a total of n successes was reached. See Also -------- Generator.negative_binomial: which should be used for new code. Notes ----- The probability mass function of the negative binomial distribution is .. math:: P(N;n,p) = \frac{\Gamma(N+n)}{N!\Gamma(n)}p^{n}(1-p)^{N}, where :math:`n` is the number of successes, :math:`p` is the probability of success, :math:`N+n` is the number of trials, and :math:`\Gamma` is the gamma function. When :math:`n` is an integer, :math:`\frac{\Gamma(N+n)}{N!\Gamma(n)} = \binom{N+n-1}{N}`, which is the more common form of this term in the the pmf. The negative binomial distribution gives the probability of N failures given n successes, with a success on the last trial. If one throws a die repeatedly until the third time a "1" appears, then the probability distribution of the number of non-"1"s that appear before the third "1" is a negative binomial distribution. References ---------- .. [1] Weisstein, Eric W. "Negative Binomial Distribution." From MathWorld--A Wolfram Web Resource. http://mathworld.wolfram.com/NegativeBinomialDistribution.html .. [2] Wikipedia, "Negative binomial distribution", https://en.wikipedia.org/wiki/Negative_binomial_distribution Examples -------- Draw samples from the distribution: A real world example. A company drills wild-cat oil exploration wells, each with an estimated probability of success of 0.1. What is the probability of having one success for each successive well, that is what is the probability of a single success after drilling 5 wells, after 6 wells, etc.? >>> s = np.random.negative_binomial(1, 0.1, 100000) >>> for i in range(1, 11): # doctest: +SKIP ... probability = sum(s>> mean = [0, 0] >>> cov = [[1, 0], [0, 100]] # diagonal covariance Diagonal covariance means that points are oriented along x or y-axis: >>> import matplotlib.pyplot as plt >>> x, y = np.random.multivariate_normal(mean, cov, 5000).T >>> plt.plot(x, y, 'x') >>> plt.axis('equal') >>> plt.show() Note that the covariance matrix must be positive semidefinite (a.k.a. nonnegative-definite). Otherwise, the behavior of this method is undefined and backwards compatibility is not guaranteed. References ---------- .. [1] Papoulis, A., "Probability, Random Variables, and Stochastic Processes," 3rd ed., New York: McGraw-Hill, 1991. .. [2] Duda, R. O., Hart, P. E., and Stork, D. G., "Pattern Classification," 2nd ed., New York: Wiley, 2001. Examples -------- >>> mean = (1, 2) >>> cov = [[1, 0], [0, 1]] >>> x = np.random.multivariate_normal(mean, cov, (3, 3)) >>> x.shape (3, 3, 2) The following is probably true, given that 0.6 is roughly twice the standard deviation: >>> list((x[0,0,:] - mean) < 0.6) [True, True] # random multinomial(n, pvals, size=None) Draw samples from a multinomial distribution. The multinomial distribution is a multivariate generalization of the binomial distribution. Take an experiment with one of ``p`` possible outcomes. An example of such an experiment is throwing a dice, where the outcome can be 1 through 6. Each sample drawn from the distribution represents `n` such experiments. Its values, ``X_i = [X_0, X_1, ..., X_p]``, represent the number of times the outcome was ``i``. .. note:: New code should use the ``multinomial`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- n : int Number of experiments. pvals : sequence of floats, length p Probabilities of each of the ``p`` different outcomes. These must sum to 1 (however, the last element is always assumed to account for the remaining probability, as long as ``sum(pvals[:-1]) <= 1)``. size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. Default is None, in which case a single value is returned. Returns ------- out : ndarray The drawn samples, of shape *size*, if that was provided. If not, the shape is ``(N,)``. In other words, each entry ``out[i,j,...,:]`` is an N-dimensional value drawn from the distribution. See Also -------- Generator.multinomial: which should be used for new code. Examples -------- Throw a dice 20 times: >>> np.random.multinomial(20, [1/6.]*6, size=1) array([[4, 1, 7, 5, 2, 1]]) # random It landed 4 times on 1, once on 2, etc. Now, throw the dice 20 times, and 20 times again: >>> np.random.multinomial(20, [1/6.]*6, size=2) array([[3, 4, 3, 3, 4, 3], # random [2, 4, 3, 4, 0, 7]]) For the first run, we threw 3 times 1, 4 times 2, etc. For the second, we threw 2 times 1, 4 times 2, etc. A loaded die is more likely to land on number 6: >>> np.random.multinomial(100, [1/7.]*5 + [2/7.]) array([11, 16, 14, 17, 16, 26]) # random The probability inputs should be normalized. As an implementation detail, the value of the last entry is ignored and assumed to take up any leftover probability mass, but this should not be relied on. A biased coin which has twice as much weight on one side as on the other should be sampled like so: >>> np.random.multinomial(100, [1.0 / 3, 2.0 / 3]) # RIGHT array([38, 62]) # random not like: >>> np.random.multinomial(100, [1.0, 2.0]) # WRONG Traceback (most recent call last): ValueError: pvals < 0, pvals > 1 or pvals contains NaNs logseries(p, size=None) Draw samples from a logarithmic series distribution. Samples are drawn from a log series distribution with specified shape parameter, 0 < ``p`` < 1. .. note:: New code should use the ``logseries`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- p : float or array_like of floats Shape parameter for the distribution. Must be in the range (0, 1). size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. If size is ``None`` (default), a single value is returned if ``p`` is a scalar. Otherwise, ``np.array(p).size`` samples are drawn. Returns ------- out : ndarray or scalar Drawn samples from the parameterized logarithmic series distribution. See Also -------- scipy.stats.logser : probability density function, distribution or cumulative density function, etc. Generator.logseries: which should be used for new code. Notes ----- The probability density for the Log Series distribution is .. math:: P(k) = \frac{-p^k}{k \ln(1-p)}, where p = probability. The log series distribution is frequently used to represent species richness and occurrence, first proposed by Fisher, Corbet, and Williams in 1943 [2]. It may also be used to model the numbers of occupants seen in cars [3]. References ---------- .. [1] Buzas, Martin A.; Culver, Stephen J., Understanding regional species diversity through the log series distribution of occurrences: BIODIVERSITY RESEARCH Diversity & Distributions, Volume 5, Number 5, September 1999 , pp. 187-195(9). .. [2] Fisher, R.A,, A.S. Corbet, and C.B. Williams. 1943. The relation between the number of species and the number of individuals in a random sample of an animal population. Journal of Animal Ecology, 12:42-58. .. [3] D. J. Hand, F. Daly, D. Lunn, E. Ostrowski, A Handbook of Small Data Sets, CRC Press, 1994. .. [4] Wikipedia, "Logarithmic distribution", https://en.wikipedia.org/wiki/Logarithmic_distribution Examples -------- Draw samples from the distribution: >>> a = .6 >>> s = np.random.logseries(a, 10000) >>> import matplotlib.pyplot as plt >>> count, bins, ignored = plt.hist(s) # plot against distribution >>> def logseries(k, p): ... return -p**k/(k*np.log(1-p)) >>> plt.plot(bins, logseries(bins, a)*count.max()/ ... logseries(bins, a).max(), 'r') >>> plt.show() lognormal(mean=0.0, sigma=1.0, size=None) Draw samples from a log-normal distribution. Draw samples from a log-normal distribution with specified mean, standard deviation, and array shape. Note that the mean and standard deviation are not the values for the distribution itself, but of the underlying normal distribution it is derived from. .. note:: New code should use the ``lognormal`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- mean : float or array_like of floats, optional Mean value of the underlying normal distribution. Default is 0. sigma : float or array_like of floats, optional Standard deviation of the underlying normal distribution. Must be non-negative. Default is 1. size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. If size is ``None`` (default), a single value is returned if ``mean`` and ``sigma`` are both scalars. Otherwise, ``np.broadcast(mean, sigma).size`` samples are drawn. Returns ------- out : ndarray or scalar Drawn samples from the parameterized log-normal distribution. See Also -------- scipy.stats.lognorm : probability density function, distribution, cumulative density function, etc. Generator.lognormal: which should be used for new code. Notes ----- A variable `x` has a log-normal distribution if `log(x)` is normally distributed. The probability density function for the log-normal distribution is: .. math:: p(x) = \frac{1}{\sigma x \sqrt{2\pi}} e^{(-\frac{(ln(x)-\mu)^2}{2\sigma^2})} where :math:`\mu` is the mean and :math:`\sigma` is the standard deviation of the normally distributed logarithm of the variable. A log-normal distribution results if a random variable is the *product* of a large number of independent, identically-distributed variables in the same way that a normal distribution results if the variable is the *sum* of a large number of independent, identically-distributed variables. References ---------- .. [1] Limpert, E., Stahel, W. A., and Abbt, M., "Log-normal Distributions across the Sciences: Keys and Clues," BioScience, Vol. 51, No. 5, May, 2001. https://stat.ethz.ch/~stahel/lognormal/bioscience.pdf .. [2] Reiss, R.D. and Thomas, M., "Statistical Analysis of Extreme Values," Basel: Birkhauser Verlag, 2001, pp. 31-32. Examples -------- Draw samples from the distribution: >>> mu, sigma = 3., 1. # mean and standard deviation >>> s = np.random.lognormal(mu, sigma, 1000) Display the histogram of the samples, along with the probability density function: >>> import matplotlib.pyplot as plt >>> count, bins, ignored = plt.hist(s, 100, density=True, align='mid') >>> x = np.linspace(min(bins), max(bins), 10000) >>> pdf = (np.exp(-(np.log(x) - mu)**2 / (2 * sigma**2)) ... / (x * sigma * np.sqrt(2 * np.pi))) >>> plt.plot(x, pdf, linewidth=2, color='r') >>> plt.axis('tight') >>> plt.show() Demonstrate that taking the products of random samples from a uniform distribution can be fit well by a log-normal probability density function. >>> # Generate a thousand samples: each is the product of 100 random >>> # values, drawn from a normal distribution. >>> b = [] >>> for i in range(1000): ... a = 10. + np.random.standard_normal(100) ... b.append(np.product(a)) >>> b = np.array(b) / np.min(b) # scale values to be positive >>> count, bins, ignored = plt.hist(b, 100, density=True, align='mid') >>> sigma = np.std(np.log(b)) >>> mu = np.mean(np.log(b)) >>> x = np.linspace(min(bins), max(bins), 10000) >>> pdf = (np.exp(-(np.log(x) - mu)**2 / (2 * sigma**2)) ... / (x * sigma * np.sqrt(2 * np.pi))) >>> plt.plot(x, pdf, color='r', linewidth=2) >>> plt.show() logistic(loc=0.0, scale=1.0, size=None) Draw samples from a logistic distribution. Samples are drawn from a logistic distribution with specified parameters, loc (location or mean, also median), and scale (>0). .. note:: New code should use the ``logistic`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- loc : float or array_like of floats, optional Parameter of the distribution. Default is 0. scale : float or array_like of floats, optional Parameter of the distribution. Must be non-negative. Default is 1. size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. If size is ``None`` (default), a single value is returned if ``loc`` and ``scale`` are both scalars. Otherwise, ``np.broadcast(loc, scale).size`` samples are drawn. Returns ------- out : ndarray or scalar Drawn samples from the parameterized logistic distribution. See Also -------- scipy.stats.logistic : probability density function, distribution or cumulative density function, etc. Generator.logistic: which should be used for new code. Notes ----- The probability density for the Logistic distribution is .. math:: P(x) = P(x) = \frac{e^{-(x-\mu)/s}}{s(1+e^{-(x-\mu)/s})^2}, where :math:`\mu` = location and :math:`s` = scale. The Logistic distribution is used in Extreme Value problems where it can act as a mixture of Gumbel distributions, in Epidemiology, and by the World Chess Federation (FIDE) where it is used in the Elo ranking system, assuming the performance of each player is a logistically distributed random variable. References ---------- .. [1] Reiss, R.-D. and Thomas M. (2001), "Statistical Analysis of Extreme Values, from Insurance, Finance, Hydrology and Other Fields," Birkhauser Verlag, Basel, pp 132-133. .. [2] Weisstein, Eric W. "Logistic Distribution." From MathWorld--A Wolfram Web Resource. http://mathworld.wolfram.com/LogisticDistribution.html .. [3] Wikipedia, "Logistic-distribution", https://en.wikipedia.org/wiki/Logistic_distribution Examples -------- Draw samples from the distribution: >>> loc, scale = 10, 1 >>> s = np.random.logistic(loc, scale, 10000) >>> import matplotlib.pyplot as plt >>> count, bins, ignored = plt.hist(s, bins=50) # plot against distribution >>> def logist(x, loc, scale): ... return np.exp((loc-x)/scale)/(scale*(1+np.exp((loc-x)/scale))**2) >>> lgst_val = logist(bins, loc, scale) >>> plt.plot(bins, lgst_val * count.max() / lgst_val.max()) >>> plt.show() hypergeometric(ngood, nbad, nsample, size=None) Draw samples from a Hypergeometric distribution. Samples are drawn from a hypergeometric distribution with specified parameters, `ngood` (ways to make a good selection), `nbad` (ways to make a bad selection), and `nsample` (number of items sampled, which is less than or equal to the sum ``ngood + nbad``). .. note:: New code should use the ``hypergeometric`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- ngood : int or array_like of ints Number of ways to make a good selection. Must be nonnegative. nbad : int or array_like of ints Number of ways to make a bad selection. Must be nonnegative. nsample : int or array_like of ints Number of items sampled. Must be at least 1 and at most ``ngood + nbad``. size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. If size is ``None`` (default), a single value is returned if `ngood`, `nbad`, and `nsample` are all scalars. Otherwise, ``np.broadcast(ngood, nbad, nsample).size`` samples are drawn. Returns ------- out : ndarray or scalar Drawn samples from the parameterized hypergeometric distribution. Each sample is the number of good items within a randomly selected subset of size `nsample` taken from a set of `ngood` good items and `nbad` bad items. See Also -------- scipy.stats.hypergeom : probability density function, distribution or cumulative density function, etc. Generator.hypergeometric: which should be used for new code. Notes ----- The probability density for the Hypergeometric distribution is .. math:: P(x) = \frac{\binom{g}{x}\binom{b}{n-x}}{\binom{g+b}{n}}, where :math:`0 \le x \le n` and :math:`n-b \le x \le g` for P(x) the probability of ``x`` good results in the drawn sample, g = `ngood`, b = `nbad`, and n = `nsample`. Consider an urn with black and white marbles in it, `ngood` of them are black and `nbad` are white. If you draw `nsample` balls without replacement, then the hypergeometric distribution describes the distribution of black balls in the drawn sample. Note that this distribution is very similar to the binomial distribution, except that in this case, samples are drawn without replacement, whereas in the Binomial case samples are drawn with replacement (or the sample space is infinite). As the sample space becomes large, this distribution approaches the binomial. References ---------- .. [1] Lentner, Marvin, "Elementary Applied Statistics", Bogden and Quigley, 1972. .. [2] Weisstein, Eric W. "Hypergeometric Distribution." From MathWorld--A Wolfram Web Resource. http://mathworld.wolfram.com/HypergeometricDistribution.html .. [3] Wikipedia, "Hypergeometric distribution", https://en.wikipedia.org/wiki/Hypergeometric_distribution Examples -------- Draw samples from the distribution: >>> ngood, nbad, nsamp = 100, 2, 10 # number of good, number of bad, and number of samples >>> s = np.random.hypergeometric(ngood, nbad, nsamp, 1000) >>> from matplotlib.pyplot import hist >>> hist(s) # note that it is very unlikely to grab both bad items Suppose you have an urn with 15 white and 15 black marbles. If you pull 15 marbles at random, how likely is it that 12 or more of them are one color? >>> s = np.random.hypergeometric(15, 15, 15, 100000) >>> sum(s>=12)/100000. + sum(s<=3)/100000. # answer = 0.003 ... pretty unlikely! gumbel(loc=0.0, scale=1.0, size=None) Draw samples from a Gumbel distribution. Draw samples from a Gumbel distribution with specified location and scale. For more information on the Gumbel distribution, see Notes and References below. .. note:: New code should use the ``gumbel`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- loc : float or array_like of floats, optional The location of the mode of the distribution. Default is 0. scale : float or array_like of floats, optional The scale parameter of the distribution. Default is 1. Must be non- negative. size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. If size is ``None`` (default), a single value is returned if ``loc`` and ``scale`` are both scalars. Otherwise, ``np.broadcast(loc, scale).size`` samples are drawn. Returns ------- out : ndarray or scalar Drawn samples from the parameterized Gumbel distribution. See Also -------- scipy.stats.gumbel_l scipy.stats.gumbel_r scipy.stats.genextreme weibull Generator.gumbel: which should be used for new code. Notes ----- The Gumbel (or Smallest Extreme Value (SEV) or the Smallest Extreme Value Type I) distribution is one of a class of Generalized Extreme Value (GEV) distributions used in modeling extreme value problems. The Gumbel is a special case of the Extreme Value Type I distribution for maximums from distributions with "exponential-like" tails. The probability density for the Gumbel distribution is .. math:: p(x) = \frac{e^{-(x - \mu)/ \beta}}{\beta} e^{ -e^{-(x - \mu)/ \beta}}, where :math:`\mu` is the mode, a location parameter, and :math:`\beta` is the scale parameter. The Gumbel (named for German mathematician Emil Julius Gumbel) was used very early in the hydrology literature, for modeling the occurrence of flood events. It is also used for modeling maximum wind speed and rainfall rates. It is a "fat-tailed" distribution - the probability of an event in the tail of the distribution is larger than if one used a Gaussian, hence the surprisingly frequent occurrence of 100-year floods. Floods were initially modeled as a Gaussian process, which underestimated the frequency of extreme events. It is one of a class of extreme value distributions, the Generalized Extreme Value (GEV) distributions, which also includes the Weibull and Frechet. The function has a mean of :math:`\mu + 0.57721\beta` and a variance of :math:`\frac{\pi^2}{6}\beta^2`. References ---------- .. [1] Gumbel, E. J., "Statistics of Extremes," New York: Columbia University Press, 1958. .. [2] Reiss, R.-D. and Thomas, M., "Statistical Analysis of Extreme Values from Insurance, Finance, Hydrology and Other Fields," Basel: Birkhauser Verlag, 2001. Examples -------- Draw samples from the distribution: >>> mu, beta = 0, 0.1 # location and scale >>> s = np.random.gumbel(mu, beta, 1000) Display the histogram of the samples, along with the probability density function: >>> import matplotlib.pyplot as plt >>> count, bins, ignored = plt.hist(s, 30, density=True) >>> plt.plot(bins, (1/beta)*np.exp(-(bins - mu)/beta) ... * np.exp( -np.exp( -(bins - mu) /beta) ), ... linewidth=2, color='r') >>> plt.show() Show how an extreme value distribution can arise from a Gaussian process and compare to a Gaussian: >>> means = [] >>> maxima = [] >>> for i in range(0,1000) : ... a = np.random.normal(mu, beta, 1000) ... means.append(a.mean()) ... maxima.append(a.max()) >>> count, bins, ignored = plt.hist(maxima, 30, density=True) >>> beta = np.std(maxima) * np.sqrt(6) / np.pi >>> mu = np.mean(maxima) - 0.57721*beta >>> plt.plot(bins, (1/beta)*np.exp(-(bins - mu)/beta) ... * np.exp(-np.exp(-(bins - mu)/beta)), ... linewidth=2, color='r') >>> plt.plot(bins, 1/(beta * np.sqrt(2 * np.pi)) ... * np.exp(-(bins - mu)**2 / (2 * beta**2)), ... linewidth=2, color='g') >>> plt.show() geometric(p, size=None) Draw samples from the geometric distribution. Bernoulli trials are experiments with one of two outcomes: success or failure (an example of such an experiment is flipping a coin). The geometric distribution models the number of trials that must be run in order to achieve success. It is therefore supported on the positive integers, ``k = 1, 2, ...``. The probability mass function of the geometric distribution is .. math:: f(k) = (1 - p)^{k - 1} p where `p` is the probability of success of an individual trial. .. note:: New code should use the ``geometric`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- p : float or array_like of floats The probability of success of an individual trial. size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. If size is ``None`` (default), a single value is returned if ``p`` is a scalar. Otherwise, ``np.array(p).size`` samples are drawn. Returns ------- out : ndarray or scalar Drawn samples from the parameterized geometric distribution. See Also -------- Generator.geometric: which should be used for new code. Examples -------- Draw ten thousand values from the geometric distribution, with the probability of an individual success equal to 0.35: >>> z = np.random.geometric(p=0.35, size=10000) How many trials succeeded after a single run? >>> (z == 1).sum() / 10000. 0.34889999999999999 #random gamma(shape, scale=1.0, size=None) Draw samples from a Gamma distribution. Samples are drawn from a Gamma distribution with specified parameters, `shape` (sometimes designated "k") and `scale` (sometimes designated "theta"), where both parameters are > 0. .. note:: New code should use the ``gamma`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- shape : float or array_like of floats The shape of the gamma distribution. Must be non-negative. scale : float or array_like of floats, optional The scale of the gamma distribution. Must be non-negative. Default is equal to 1. size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. If size is ``None`` (default), a single value is returned if ``shape`` and ``scale`` are both scalars. Otherwise, ``np.broadcast(shape, scale).size`` samples are drawn. Returns ------- out : ndarray or scalar Drawn samples from the parameterized gamma distribution. See Also -------- scipy.stats.gamma : probability density function, distribution or cumulative density function, etc. Generator.gamma: which should be used for new code. Notes ----- The probability density for the Gamma distribution is .. math:: p(x) = x^{k-1}\frac{e^{-x/\theta}}{\theta^k\Gamma(k)}, where :math:`k` is the shape and :math:`\theta` the scale, and :math:`\Gamma` is the Gamma function. The Gamma distribution is often used to model the times to failure of electronic components, and arises naturally in processes for which the waiting times between Poisson distributed events are relevant. References ---------- .. [1] Weisstein, Eric W. "Gamma Distribution." From MathWorld--A Wolfram Web Resource. http://mathworld.wolfram.com/GammaDistribution.html .. [2] Wikipedia, "Gamma distribution", https://en.wikipedia.org/wiki/Gamma_distribution Examples -------- Draw samples from the distribution: >>> shape, scale = 2., 2. # mean=4, std=2*sqrt(2) >>> s = np.random.gamma(shape, scale, 1000) Display the histogram of the samples, along with the probability density function: >>> import matplotlib.pyplot as plt >>> import scipy.special as sps # doctest: +SKIP >>> count, bins, ignored = plt.hist(s, 50, density=True) >>> y = bins**(shape-1)*(np.exp(-bins/scale) / # doctest: +SKIP ... (sps.gamma(shape)*scale**shape)) >>> plt.plot(bins, y, linewidth=2, color='r') # doctest: +SKIP >>> plt.show() f(dfnum, dfden, size=None) Draw samples from an F distribution. Samples are drawn from an F distribution with specified parameters, `dfnum` (degrees of freedom in numerator) and `dfden` (degrees of freedom in denominator), where both parameters must be greater than zero. The random variate of the F distribution (also known as the Fisher distribution) is a continuous probability distribution that arises in ANOVA tests, and is the ratio of two chi-square variates. .. note:: New code should use the ``f`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- dfnum : float or array_like of floats Degrees of freedom in numerator, must be > 0. dfden : float or array_like of float Degrees of freedom in denominator, must be > 0. size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. If size is ``None`` (default), a single value is returned if ``dfnum`` and ``dfden`` are both scalars. Otherwise, ``np.broadcast(dfnum, dfden).size`` samples are drawn. Returns ------- out : ndarray or scalar Drawn samples from the parameterized Fisher distribution. See Also -------- scipy.stats.f : probability density function, distribution or cumulative density function, etc. Generator.f: which should be used for new code. Notes ----- The F statistic is used to compare in-group variances to between-group variances. Calculating the distribution depends on the sampling, and so it is a function of the respective degrees of freedom in the problem. The variable `dfnum` is the number of samples minus one, the between-groups degrees of freedom, while `dfden` is the within-groups degrees of freedom, the sum of the number of samples in each group minus the number of groups. References ---------- .. [1] Glantz, Stanton A. "Primer of Biostatistics.", McGraw-Hill, Fifth Edition, 2002. .. [2] Wikipedia, "F-distribution", https://en.wikipedia.org/wiki/F-distribution Examples -------- An example from Glantz[1], pp 47-40: Two groups, children of diabetics (25 people) and children from people without diabetes (25 controls). Fasting blood glucose was measured, case group had a mean value of 86.1, controls had a mean value of 82.2. Standard deviations were 2.09 and 2.49 respectively. Are these data consistent with the null hypothesis that the parents diabetic status does not affect their children's blood glucose levels? Calculating the F statistic from the data gives a value of 36.01. Draw samples from the distribution: >>> dfnum = 1. # between group degrees of freedom >>> dfden = 48. # within groups degrees of freedom >>> s = np.random.f(dfnum, dfden, 1000) The lower bound for the top 1% of the samples is : >>> np.sort(s)[-10] 7.61988120985 # random So there is about a 1% chance that the F statistic will exceed 7.62, the measured value is 36, so the null hypothesis is rejected at the 1% level. choice(a, size=None, replace=True, p=None) Generates a random sample from a given 1-D array .. versionadded:: 1.7.0 .. note:: New code should use the ``choice`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- a : 1-D array-like or int If an ndarray, a random sample is generated from its elements. If an int, the random sample is generated as if a were np.arange(a) size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. Default is None, in which case a single value is returned. replace : boolean, optional Whether the sample is with or without replacement p : 1-D array-like, optional The probabilities associated with each entry in a. If not given the sample assumes a uniform distribution over all entries in a. Returns ------- samples : single item or ndarray The generated random samples Raises ------ ValueError If a is an int and less than zero, if a or p are not 1-dimensional, if a is an array-like of size 0, if p is not a vector of probabilities, if a and p have different lengths, or if replace=False and the sample size is greater than the population size See Also -------- randint, shuffle, permutation Generator.choice: which should be used in new code Notes ----- Sampling random rows from a 2-D array is not possible with this function, but is possible with `Generator.choice` through its ``axis`` keyword. Examples -------- Generate a uniform random sample from np.arange(5) of size 3: >>> np.random.choice(5, 3) array([0, 3, 4]) # random >>> #This is equivalent to np.random.randint(0,5,3) Generate a non-uniform random sample from np.arange(5) of size 3: >>> np.random.choice(5, 3, p=[0.1, 0, 0.3, 0.6, 0]) array([3, 3, 0]) # random Generate a uniform random sample from np.arange(5) of size 3 without replacement: >>> np.random.choice(5, 3, replace=False) array([3,1,0]) # random >>> #This is equivalent to np.random.permutation(np.arange(5))[:3] Generate a non-uniform random sample from np.arange(5) of size 3 without replacement: >>> np.random.choice(5, 3, replace=False, p=[0.1, 0, 0.3, 0.6, 0]) array([2, 3, 0]) # random Any of the above can be repeated with an arbitrary array-like instead of just integers. For instance: >>> aa_milne_arr = ['pooh', 'rabbit', 'piglet', 'Christopher'] >>> np.random.choice(aa_milne_arr, 5, p=[0.5, 0.1, 0.1, 0.3]) array(['pooh', 'pooh', 'pooh', 'Christopher', 'piglet'], # random dtype=' 0. size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. If size is ``None`` (default), a single value is returned if ``df`` is a scalar. Otherwise, ``np.array(df).size`` samples are drawn. Returns ------- out : ndarray or scalar Drawn samples from the parameterized chi-square distribution. Raises ------ ValueError When `df` <= 0 or when an inappropriate `size` (e.g. ``size=-1``) is given. See Also -------- Generator.chisquare: which should be used for new code. Notes ----- The variable obtained by summing the squares of `df` independent, standard normally distributed random variables: .. math:: Q = \sum_{i=0}^{\mathtt{df}} X^2_i is chi-square distributed, denoted .. math:: Q \sim \chi^2_k. The probability density function of the chi-squared distribution is .. math:: p(x) = \frac{(1/2)^{k/2}}{\Gamma(k/2)} x^{k/2 - 1} e^{-x/2}, where :math:`\Gamma` is the gamma function, .. math:: \Gamma(x) = \int_0^{-\infty} t^{x - 1} e^{-t} dt. References ---------- .. [1] NIST "Engineering Statistics Handbook" https://www.itl.nist.gov/div898/handbook/eda/section3/eda3666.htm Examples -------- >>> np.random.chisquare(2,4) array([ 1.89920014, 9.00867716, 3.13710533, 5.62318272]) # random bytes(length) Return random bytes. .. note:: New code should use the ``bytes`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- length : int Number of random bytes. Returns ------- out : str String of length `length`. See Also -------- Generator.bytes: which should be used for new code. Examples -------- >>> np.random.bytes(10) ' eh\x85\x022SZ\xbf\xa4' #random binomial(n, p, size=None) Draw samples from a binomial distribution. Samples are drawn from a binomial distribution with specified parameters, n trials and p probability of success where n an integer >= 0 and p is in the interval [0,1]. (n may be input as a float, but it is truncated to an integer in use) .. note:: New code should use the ``binomial`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- n : int or array_like of ints Parameter of the distribution, >= 0. Floats are also accepted, but they will be truncated to integers. p : float or array_like of floats Parameter of the distribution, >= 0 and <=1. size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. If size is ``None`` (default), a single value is returned if ``n`` and ``p`` are both scalars. Otherwise, ``np.broadcast(n, p).size`` samples are drawn. Returns ------- out : ndarray or scalar Drawn samples from the parameterized binomial distribution, where each sample is equal to the number of successes over the n trials. See Also -------- scipy.stats.binom : probability density function, distribution or cumulative density function, etc. Generator.binomial: which should be used for new code. Notes ----- The probability density for the binomial distribution is .. math:: P(N) = \binom{n}{N}p^N(1-p)^{n-N}, where :math:`n` is the number of trials, :math:`p` is the probability of success, and :math:`N` is the number of successes. When estimating the standard error of a proportion in a population by using a random sample, the normal distribution works well unless the product p*n <=5, where p = population proportion estimate, and n = number of samples, in which case the binomial distribution is used instead. For example, a sample of 15 people shows 4 who are left handed, and 11 who are right handed. Then p = 4/15 = 27%. 0.27*15 = 4, so the binomial distribution should be used in this case. References ---------- .. [1] Dalgaard, Peter, "Introductory Statistics with R", Springer-Verlag, 2002. .. [2] Glantz, Stanton A. "Primer of Biostatistics.", McGraw-Hill, Fifth Edition, 2002. .. [3] Lentner, Marvin, "Elementary Applied Statistics", Bogden and Quigley, 1972. .. [4] Weisstein, Eric W. "Binomial Distribution." From MathWorld--A Wolfram Web Resource. http://mathworld.wolfram.com/BinomialDistribution.html .. [5] Wikipedia, "Binomial distribution", https://en.wikipedia.org/wiki/Binomial_distribution Examples -------- Draw samples from the distribution: >>> n, p = 10, .5 # number of trials, probability of each trial >>> s = np.random.binomial(n, p, 1000) # result of flipping a coin 10 times, tested 1000 times. A real world example. A company drills 9 wild-cat oil exploration wells, each with an estimated probability of success of 0.1. All nine wells fail. What is the probability of that happening? Let's do 20,000 trials of the model, and count the number that generate zero positive results. >>> sum(np.random.binomial(9, 0.1, 20000) == 0)/20000. # answer = 0.38885, or 38%. a must be greater than 0 unless no samples are taken'a' cannot be empty unless no samples are takenUnsupported dtype %r for randintRandomState.standard_gamma (line 1503)RandomState.multivariate_normal (line 3944)RandomState.logseries (line 3856)RandomState.lognormal (line 2883)RandomState.hypergeometric (line 3723)RandomState.geometric (line 3662)RandomState.dirichlet (line 4238)RandomState.chisquare (line 1844) wald(mean, scale, size=None) Draw samples from a Wald, or inverse Gaussian, distribution. As the scale approaches infinity, the distribution becomes more like a Gaussian. Some references claim that the Wald is an inverse Gaussian with mean equal to 1, but this is by no means universal. The inverse Gaussian distribution was first studied in relationship to Brownian motion. In 1956 M.C.K. Tweedie used the name inverse Gaussian because there is an inverse relationship between the time to cover a unit distance and distance covered in unit time. .. note:: New code should use the ``wald`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- mean : float or array_like of floats Distribution mean, must be > 0. scale : float or array_like of floats Scale parameter, must be > 0. size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. If size is ``None`` (default), a single value is returned if ``mean`` and ``scale`` are both scalars. Otherwise, ``np.broadcast(mean, scale).size`` samples are drawn. Returns ------- out : ndarray or scalar Drawn samples from the parameterized Wald distribution. See Also -------- Generator.wald: which should be used for new code. Notes ----- The probability density function for the Wald distribution is .. math:: P(x;mean,scale) = \sqrt{\frac{scale}{2\pi x^3}}e^ \frac{-scale(x-mean)^2}{2\cdotp mean^2x} As noted above the inverse Gaussian distribution first arise from attempts to model Brownian motion. It is also a competitor to the Weibull for use in reliability modeling and modeling stock returns and interest rate processes. References ---------- .. [1] Brighton Webs Ltd., Wald Distribution, https://web.archive.org/web/20090423014010/http://www.brighton-webs.co.uk:80/distributions/wald.asp .. [2] Chhikara, Raj S., and Folks, J. Leroy, "The Inverse Gaussian Distribution: Theory : Methodology, and Applications", CRC Press, 1988. .. [3] Wikipedia, "Inverse Gaussian distribution" https://en.wikipedia.org/wiki/Inverse_Gaussian_distribution Examples -------- Draw values from the distribution and plot the histogram: >>> import matplotlib.pyplot as plt >>> h = plt.hist(np.random.wald(3, 2, 100000), bins=200, density=True) >>> plt.show() standard_normal(size=None) Draw samples from a standard Normal distribution (mean=0, stdev=1). .. note:: New code should use the ``standard_normal`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. Default is None, in which case a single value is returned. Returns ------- out : float or ndarray A floating-point array of shape ``size`` of drawn samples, or a single sample if ``size`` was not specified. See Also -------- normal : Equivalent function with additional ``loc`` and ``scale`` arguments for setting the mean and standard deviation. Generator.standard_normal: which should be used for new code. Notes ----- For random samples from :math:`N(\mu, \sigma^2)`, use one of:: mu + sigma * np.random.standard_normal(size=...) np.random.normal(mu, sigma, size=...) Examples -------- >>> np.random.standard_normal() 2.1923875335537315 #random >>> s = np.random.standard_normal(8000) >>> s array([ 0.6888893 , 0.78096262, -0.89086505, ..., 0.49876311, # random -0.38672696, -0.4685006 ]) # random >>> s.shape (8000,) >>> s = np.random.standard_normal(size=(3, 4, 2)) >>> s.shape (3, 4, 2) Two-by-four array of samples from :math:`N(3, 6.25)`: >>> 3 + 2.5 * np.random.standard_normal(size=(2, 4)) array([[-4.49401501, 4.00950034, -1.81814867, 7.29718677], # random [ 0.39924804, 4.68456316, 4.99394529, 4.84057254]]) # random standard_gamma(shape, size=None) Draw samples from a standard Gamma distribution. Samples are drawn from a Gamma distribution with specified parameters, shape (sometimes designated "k") and scale=1. .. note:: New code should use the ``standard_gamma`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- shape : float or array_like of floats Parameter, must be non-negative. size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. If size is ``None`` (default), a single value is returned if ``shape`` is a scalar. Otherwise, ``np.array(shape).size`` samples are drawn. Returns ------- out : ndarray or scalar Drawn samples from the parameterized standard gamma distribution. See Also -------- scipy.stats.gamma : probability density function, distribution or cumulative density function, etc. Generator.standard_gamma: which should be used for new code. Notes ----- The probability density for the Gamma distribution is .. math:: p(x) = x^{k-1}\frac{e^{-x/\theta}}{\theta^k\Gamma(k)}, where :math:`k` is the shape and :math:`\theta` the scale, and :math:`\Gamma` is the Gamma function. The Gamma distribution is often used to model the times to failure of electronic components, and arises naturally in processes for which the waiting times between Poisson distributed events are relevant. References ---------- .. [1] Weisstein, Eric W. "Gamma Distribution." From MathWorld--A Wolfram Web Resource. http://mathworld.wolfram.com/GammaDistribution.html .. [2] Wikipedia, "Gamma distribution", https://en.wikipedia.org/wiki/Gamma_distribution Examples -------- Draw samples from the distribution: >>> shape, scale = 2., 1. # mean and width >>> s = np.random.standard_gamma(shape, 1000000) Display the histogram of the samples, along with the probability density function: >>> import matplotlib.pyplot as plt >>> import scipy.special as sps # doctest: +SKIP >>> count, bins, ignored = plt.hist(s, 50, density=True) >>> y = bins**(shape-1) * ((np.exp(-bins/scale))/ # doctest: +SKIP ... (sps.gamma(shape) * scale**shape)) >>> plt.plot(bins, y, linewidth=2, color='r') # doctest: +SKIP >>> plt.show() standard_exponential(size=None) Draw samples from the standard exponential distribution. `standard_exponential` is identical to the exponential distribution with a scale parameter of 1. .. note:: New code should use the ``standard_exponential`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. Default is None, in which case a single value is returned. Returns ------- out : float or ndarray Drawn samples. See Also -------- Generator.standard_exponential: which should be used for new code. Examples -------- Output a 3x8000 array: >>> n = np.random.standard_exponential((3, 8000)) standard_cauchy(size=None) Draw samples from a standard Cauchy distribution with mode = 0. Also known as the Lorentz distribution. .. note:: New code should use the ``standard_cauchy`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. Default is None, in which case a single value is returned. Returns ------- samples : ndarray or scalar The drawn samples. See Also -------- Generator.standard_cauchy: which should be used for new code. Notes ----- The probability density function for the full Cauchy distribution is .. math:: P(x; x_0, \gamma) = \frac{1}{\pi \gamma \bigl[ 1+ (\frac{x-x_0}{\gamma})^2 \bigr] } and the Standard Cauchy distribution just sets :math:`x_0=0` and :math:`\gamma=1` The Cauchy distribution arises in the solution to the driven harmonic oscillator problem, and also describes spectral line broadening. It also describes the distribution of values at which a line tilted at a random angle will cut the x axis. When studying hypothesis tests that assume normality, seeing how the tests perform on data from a Cauchy distribution is a good indicator of their sensitivity to a heavy-tailed distribution, since the Cauchy looks very much like a Gaussian distribution, but with heavier tails. References ---------- .. [1] NIST/SEMATECH e-Handbook of Statistical Methods, "Cauchy Distribution", https://www.itl.nist.gov/div898/handbook/eda/section3/eda3663.htm .. [2] Weisstein, Eric W. "Cauchy Distribution." From MathWorld--A Wolfram Web Resource. http://mathworld.wolfram.com/CauchyDistribution.html .. [3] Wikipedia, "Cauchy distribution" https://en.wikipedia.org/wiki/Cauchy_distribution Examples -------- Draw samples and plot the distribution: >>> import matplotlib.pyplot as plt >>> s = np.random.standard_cauchy(1000000) >>> s = s[(s>-25) & (s<25)] # truncate distribution so it plots well >>> plt.hist(s, bins=100) >>> plt.show() shuffle(x) Modify a sequence in-place by shuffling its contents. This function only shuffles the array along the first axis of a multi-dimensional array. The order of sub-arrays is changed but their contents remains the same. .. note:: New code should use the ``shuffle`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- x : array_like The array or list to be shuffled. Returns ------- None See Also -------- Generator.shuffle: which should be used for new code. Examples -------- >>> arr = np.arange(10) >>> np.random.shuffle(arr) >>> arr [1 7 5 2 9 4 3 6 0 8] # random Multi-dimensional arrays are only shuffled along the first axis: >>> arr = np.arange(9).reshape((3, 3)) >>> np.random.shuffle(arr) >>> arr array([[3, 4, 5], # random [6, 7, 8], [0, 1, 2]]) random_sample(size=None) Return random floats in the half-open interval [0.0, 1.0). Results are from the "continuous uniform" distribution over the stated interval. To sample :math:`Unif[a, b), b > a` multiply the output of `random_sample` by `(b-a)` and add `a`:: (b - a) * random_sample() + a .. note:: New code should use the ``random`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. Default is None, in which case a single value is returned. Returns ------- out : float or ndarray of floats Array of random floats of shape `size` (unless ``size=None``, in which case a single float is returned). See Also -------- Generator.random: which should be used for new code. Examples -------- >>> np.random.random_sample() 0.47108547995356098 # random >>> type(np.random.random_sample()) >>> np.random.random_sample((5,)) array([ 0.30220482, 0.86820401, 0.1654503 , 0.11659149, 0.54323428]) # random Three-by-two array of random numbers from [-5, 0): >>> 5 * np.random.random_sample((3, 2)) - 5 array([[-3.99149989, -0.52338984], # random [-2.99091858, -0.79479508], [-1.23204345, -1.75224494]]) randn(d0, d1, ..., dn) Return a sample (or samples) from the "standard normal" distribution. .. note:: This is a convenience function for users porting code from Matlab, and wraps `standard_normal`. That function takes a tuple to specify the size of the output, which is consistent with other NumPy functions like `numpy.zeros` and `numpy.ones`. .. note:: New code should use the ``standard_normal`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. If positive int_like arguments are provided, `randn` generates an array of shape ``(d0, d1, ..., dn)``, filled with random floats sampled from a univariate "normal" (Gaussian) distribution of mean 0 and variance 1. A single float randomly sampled from the distribution is returned if no argument is provided. Parameters ---------- d0, d1, ..., dn : int, optional The dimensions of the returned array, must be non-negative. If no argument is given a single Python float is returned. Returns ------- Z : ndarray or float A ``(d0, d1, ..., dn)``-shaped array of floating-point samples from the standard normal distribution, or a single such float if no parameters were supplied. See Also -------- standard_normal : Similar, but takes a tuple as its argument. normal : Also accepts mu and sigma arguments. Generator.standard_normal: which should be used for new code. Notes ----- For random samples from :math:`N(\mu, \sigma^2)`, use: ``sigma * np.random.randn(...) + mu`` Examples -------- >>> np.random.randn() 2.1923875335537315 # random Two-by-four array of samples from N(3, 6.25): >>> 3 + 2.5 * np.random.randn(2, 4) array([[-4.49401501, 4.00950034, -1.81814867, 7.29718677], # random [ 0.39924804, 4.68456316, 4.99394529, 4.84057254]]) # random rand(d0, d1, ..., dn) Random values in a given shape. .. note:: This is a convenience function for users porting code from Matlab, and wraps `random_sample`. That function takes a tuple to specify the size of the output, which is consistent with other NumPy functions like `numpy.zeros` and `numpy.ones`. Create an array of the given shape and populate it with random samples from a uniform distribution over ``[0, 1)``. Parameters ---------- d0, d1, ..., dn : int, optional The dimensions of the returned array, must be non-negative. If no argument is given a single Python float is returned. Returns ------- out : ndarray, shape ``(d0, d1, ..., dn)`` Random values. See Also -------- random Examples -------- >>> np.random.rand(3,2) array([[ 0.14022471, 0.96360618], #random [ 0.37601032, 0.25528411], #random [ 0.49313049, 0.94909878]]) #random poisson(lam=1.0, size=None) Draw samples from a Poisson distribution. The Poisson distribution is the limit of the binomial distribution for large N. .. note:: New code should use the ``poisson`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- lam : float or array_like of floats Expectation of interval, must be >= 0. A sequence of expectation intervals must be broadcastable over the requested size. size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. If size is ``None`` (default), a single value is returned if ``lam`` is a scalar. Otherwise, ``np.array(lam).size`` samples are drawn. Returns ------- out : ndarray or scalar Drawn samples from the parameterized Poisson distribution. See Also -------- Generator.poisson: which should be used for new code. Notes ----- The Poisson distribution .. math:: f(k; \lambda)=\frac{\lambda^k e^{-\lambda}}{k!} For events with an expected separation :math:`\lambda` the Poisson distribution :math:`f(k; \lambda)` describes the probability of :math:`k` events occurring within the observed interval :math:`\lambda`. Because the output is limited to the range of the C int64 type, a ValueError is raised when `lam` is within 10 sigma of the maximum representable value. References ---------- .. [1] Weisstein, Eric W. "Poisson Distribution." From MathWorld--A Wolfram Web Resource. http://mathworld.wolfram.com/PoissonDistribution.html .. [2] Wikipedia, "Poisson distribution", https://en.wikipedia.org/wiki/Poisson_distribution Examples -------- Draw samples from the distribution: >>> import numpy as np >>> s = np.random.poisson(5, 10000) Display histogram of the sample: >>> import matplotlib.pyplot as plt >>> count, bins, ignored = plt.hist(s, 14, density=True) >>> plt.show() Draw each 100 values for lambda 100 and 500: >>> s = np.random.poisson(lam=(100., 500.), size=(100, 2)) permutation(x) Randomly permute a sequence, or return a permuted range. If `x` is a multi-dimensional array, it is only shuffled along its first index. .. note:: New code should use the ``permutation`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- x : int or array_like If `x` is an integer, randomly permute ``np.arange(x)``. If `x` is an array, make a copy and shuffle the elements randomly. Returns ------- out : ndarray Permuted sequence or array range. See Also -------- Generator.permutation: which should be used for new code. Examples -------- >>> np.random.permutation(10) array([1, 7, 4, 3, 0, 9, 2, 5, 8, 6]) # random >>> np.random.permutation([1, 4, 9, 12, 15]) array([15, 1, 9, 4, 12]) # random >>> arr = np.arange(9).reshape((3, 3)) >>> np.random.permutation(arr) array([[6, 7, 8], # random [0, 1, 2], [3, 4, 5]]) laplace(loc=0.0, scale=1.0, size=None) Draw samples from the Laplace or double exponential distribution with specified location (or mean) and scale (decay). The Laplace distribution is similar to the Gaussian/normal distribution, but is sharper at the peak and has fatter tails. It represents the difference between two independent, identically distributed exponential random variables. .. note:: New code should use the ``laplace`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- loc : float or array_like of floats, optional The position, :math:`\mu`, of the distribution peak. Default is 0. scale : float or array_like of floats, optional :math:`\lambda`, the exponential decay. Default is 1. Must be non- negative. size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. If size is ``None`` (default), a single value is returned if ``loc`` and ``scale`` are both scalars. Otherwise, ``np.broadcast(loc, scale).size`` samples are drawn. Returns ------- out : ndarray or scalar Drawn samples from the parameterized Laplace distribution. See Also -------- Generator.laplace: which should be used for new code. Notes ----- It has the probability density function .. math:: f(x; \mu, \lambda) = \frac{1}{2\lambda} \exp\left(-\frac{|x - \mu|}{\lambda}\right). The first law of Laplace, from 1774, states that the frequency of an error can be expressed as an exponential function of the absolute magnitude of the error, which leads to the Laplace distribution. For many problems in economics and health sciences, this distribution seems to model the data better than the standard Gaussian distribution. References ---------- .. [1] Abramowitz, M. and Stegun, I. A. (Eds.). "Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables, 9th printing," New York: Dover, 1972. .. [2] Kotz, Samuel, et. al. "The Laplace Distribution and Generalizations, " Birkhauser, 2001. .. [3] Weisstein, Eric W. "Laplace Distribution." From MathWorld--A Wolfram Web Resource. http://mathworld.wolfram.com/LaplaceDistribution.html .. [4] Wikipedia, "Laplace distribution", https://en.wikipedia.org/wiki/Laplace_distribution Examples -------- Draw samples from the distribution >>> loc, scale = 0., 1. >>> s = np.random.laplace(loc, scale, 1000) Display the histogram of the samples, along with the probability density function: >>> import matplotlib.pyplot as plt >>> count, bins, ignored = plt.hist(s, 30, density=True) >>> x = np.arange(-8., 8., .01) >>> pdf = np.exp(-abs(x-loc)/scale)/(2.*scale) >>> plt.plot(x, pdf) Plot Gaussian for comparison: >>> g = (1/(scale * np.sqrt(2 * np.pi)) * ... np.exp(-(x - loc)**2 / (2 * scale**2))) >>> plt.plot(x,g) dirichlet(alpha, size=None) Draw samples from the Dirichlet distribution. Draw `size` samples of dimension k from a Dirichlet distribution. A Dirichlet-distributed random variable can be seen as a multivariate generalization of a Beta distribution. The Dirichlet distribution is a conjugate prior of a multinomial distribution in Bayesian inference. .. note:: New code should use the ``dirichlet`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- alpha : sequence of floats, length k Parameter of the distribution (length ``k`` for sample of length ``k``). size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n)``, then ``m * n * k`` samples are drawn. Default is None, in which case a vector of length ``k`` is returned. Returns ------- samples : ndarray, The drawn samples, of shape ``(size, k)``. Raises ------- ValueError If any value in ``alpha`` is less than or equal to zero See Also -------- Generator.dirichlet: which should be used for new code. Notes ----- The Dirichlet distribution is a distribution over vectors :math:`x` that fulfil the conditions :math:`x_i>0` and :math:`\sum_{i=1}^k x_i = 1`. The probability density function :math:`p` of a Dirichlet-distributed random vector :math:`X` is proportional to .. math:: p(x) \propto \prod_{i=1}^{k}{x^{\alpha_i-1}_i}, where :math:`\alpha` is a vector containing the positive concentration parameters. The method uses the following property for computation: let :math:`Y` be a random vector which has components that follow a standard gamma distribution, then :math:`X = \frac{1}{\sum_{i=1}^k{Y_i}} Y` is Dirichlet-distributed References ---------- .. [1] David McKay, "Information Theory, Inference and Learning Algorithms," chapter 23, http://www.inference.org.uk/mackay/itila/ .. [2] Wikipedia, "Dirichlet distribution", https://en.wikipedia.org/wiki/Dirichlet_distribution Examples -------- Taking an example cited in Wikipedia, this distribution can be used if one wanted to cut strings (each of initial length 1.0) into K pieces with different lengths, where each piece had, on average, a designated average length, but allowing some variation in the relative sizes of the pieces. >>> s = np.random.dirichlet((10, 5, 3), 20).transpose() >>> import matplotlib.pyplot as plt >>> plt.barh(range(20), s[0]) >>> plt.barh(range(20), s[1], left=s[0], color='g') >>> plt.barh(range(20), s[2], left=s[0]+s[1], color='r') >>> plt.title("Lengths of Strings") RandomState.vonmises (line 2181)RandomState.rayleigh (line 2998)RandomState.logistic (line 2798)RandomState.binomial (line 3258)state dictionary is not valid.probabilities do not sum to 1RandomState.weibull (line 2371)RandomState.uniform (line 1004)RandomState.tomaxint (line 586)RandomState.shuffle (line 4386)RandomState.poisson (line 3495)RandomState.laplace (line 2582)RandomState.randint (line 644)RandomState.pareto (line 2269)RandomState.normal (line 1396)RandomState.gumbel (line 2675)'a' and 'p' must have same sizeRandomState.randn (line 1171)RandomState.power (line 2474)RandomState.gamma (line 1583)RandomState.choice (line 805)mean must be 1 dimensionalRange exceeds valid boundsRandomState.zipf (line 3576)RandomState.wald (line 3074)RandomState.rand (line 1127)RandomState.bytes (line 769)probabilities contain NaNRandomState.seed (line 222)'p' must be 1-dimensionala must be 1-dimensionalRandomState.f (line 1666)standard_exponentialnoncentral_chisquarenumpy.random.mtrandmultivariate_normalngood + nbad < nsamplecline_in_tracebackDeprecationWarningnegative_binomial__randomstate_ctormay_share_memorysum(pvals[:-1]) > 1.0standard_normalstandard_cauchyrandom_integers_poisson_lam_maxstandard_gamma_legacy_seedinghypergeometricRuntimeWarningrandom_samplecount_nonzerobit_generatorOverflowErrorsearchsortedreturn_indexnoncentral_fnewbyteorderpermutationmultinomialexponentialcheck_validRandomStateImportErrortriangularstandard_t__pyx_vtable__numpy.dualmtrand.pyxmode > rightlogical_orless_equalleft == rightissubdtypeempty_likeValueErrorIndexErrorset_statelogserieslognormalleft > modehas_gaussget_stategeometricdirichletchisquareTypeErrorMT19937warningsvonmisessubtractreversedrayleighoperatorlogisticitemsizeisscalarisnativeisfinitefloatingbinomialallcloseweibulluniformtobytesstridesshufflereshapereplacerandintpoissonnsample_mt19937laplaceintegergreaterfloat64castingcapsule at 0x{:X}asarrayalpha <= 0_MT19937unsafeuniqueuint64uint32uint16samplereducerandom_rand_pickleparetonormallegacykwargs__import__ignoregumbelformatdoublecumsumcompatchoiceastypearangezerosuint8statesigmashapescalerightravelrangerandnraisepvalspowernumpyngoodkappaisnanint64int32int16indexgaussgammafinfoequal__enter__emptydtypedfnumdfden__class__bytesarrayalpha__all__zipfwarnwald__test__takesqrtsortsizesideseedrtolranfrandprodnoncndimnbad__name__modemean__main__longlocklessleftitemintpint8high__exit__copybool_betaatolargstolsvd__str__poslowloclamkeygetepsdotcovanyalladd?UUUUUU?"@m{??@>@3?r?q?0@0C@?/*p?3f?(_?xY?յS?N?J?F?DB?Qt??u+ ?A?Į?"?ʝ?G??i>l>7>>*J>>>^>>F>>7P>>K{>>>u>;->>>|>eO>4(>8>L>N>ȿ>>>>·>ε>߳>>>0>U>~>|>ަ>Y>IP>w>ҟ>B>e>)>~>_>>C>{>>J>﷍>X(>'>N>Í>x >b>x>>!>^}>;z>Хw>@t>wr>byl>i>g>Sd>3a>^>]\>&Y>z)W>T>P R>O>L>5~J>3H>E>nC>@>VK>>;>9>07>4>2>>0>p->+>s)>7'>%>"> >s>L>*>= >T>T>4>>y >ϣ > >>L>>l>=+==0 =C==8==hp==0== =n==|===;=ں=Z=o,=ް=ߗ=.W===%==r=W= C=4=M,=4*=D.=y8=H=~=x=3E3lM3FT3/[3b3i34p3fw3&~3[3B3ψ3g37!3>3T3d3n3r3Fq3j3_31P3r<3$3k 33ȸ3q3|{3P3#3C333dY3"3+3®3r35333x37333p3-33731b33l44(44h4C44 4` 4M 47 44?4nB44L4 i4a4T044542`44p. 4!4"4i$4%4@'4t(4>*4+4,4j.4/4'P1424):4454&)7484c:4;4$=4+>4@4A4KC4vD4B(F4G4:I4J4rTL4M4GuO4Q4R44T4U4EiW4Y4 Z4G\4]4_4:a4b4d4Bf4\g4ji4bk4m4n4p4\r4}"t4Yu4Hw4[y4X{46.}4 4q4a4]S4F4N<434,4+(4{%4$4o&4,*4'04m84 C4P4_4q474{4w4>ԕ44s4<4d444$4 (4a44lߢ4$4l44x 4_444{4 4EP4±4{:4귴4);4nķ4S444<*4տ44A4.44ע44f4RW4R4*Y4Fk44δ444444g44k4<444y44u4_45555@5ó 5 5]5^555q5v 5!5%5V*5s/5;S55:<5D5NO5^5Nv5QHqoMֻanjDotTrotou$w'xx,jyy7\z׻z{W{S{{.|3|]|ȃ|||I||}C0}F}Z}m}}S}(}}-}}"}}|}M}~i ~~~B(~o0~C8~?~F~M~T~Z~a~f~l~r~]w~v|~`~ ~~$~m~~~w~:~ަ~f~ѭ~#~Z~y~~q~K~~~^~~a~~~`~~~~~~~~f~*~~~-~~J~~=~~~\~~~$~U~}~~~~~pH`  i   6  H  A!B+m 5XttW3 `wK\ L   s   G {V~~~d~~x~~K~~~~~~~~~)~~~a~~~{~;~~A~~~m~~z~~~"~k~]~~~ԃ~|~s~j~Ua~W~K~?~2~$~~~ }}} }}i}A}}|Q|D|{3N{zeyww7ms?7E?P?'{{?*!?bv?mU?9U1T?/v?x]?&1$-?~ n?cK[!?I?\Omg?f?uLi=?sڂl?x?Qf?ij?%ᨯC?+?Dܻ?z?cE#;?^E#?$O?2m?P"K?>?{s?%;?omo?3;?J9?++?*T[?};1s?HeC?$`?vE!=?ſ-r?MBц?K=?Q}6Ei?7u? !?z}k? ~?@?`x?*?8? Qi?oTC?_(4?ָ?@je?!u v?7Zi?{ ?I?]T?9]??}?8aD:?Yζi?Ɲҷ?r^sSw?ꍰ07?d>[?%۹? Ə{?'HB>?vX#?l1&?:l?磽!O?ލ?&?ڋ?ﾀ+ j?A1?N0Z?0H?}G?(V?5$1!?pB9 ?b"FS?)vEW(?vG}rO?~ /? {^?Z? ?ބS?i"?lR?3Sn?>N?Ґ]b?,|y2?jG>?TLҫ?~>\O??@YH?/֎@?9O"H?>?1 7?8?Ox?]4?5D9g?r|?>ܸ$8? [B/?I䠟?O?y%d?bPޱ?c?PR?j?F}?9(Q1?c?(ڦ^w?0U^Q?1j?T ξ?x.BTv?Imb.??6YJ?)ِ?\C}?%d?w?SN?эv?pa?,Q&?@oű?SuFe?PV?;?I?viׯ?4D?.g?X1Iα?Jy?!dJ?پz?j»?8G;?L|{ʎ?mwn?k9:9??Ry?A&E?U?Ŗ<?k&_?G??~#? V#?_?S?Q| z? Y&?$?htQz? 3Tݜ?pXP?N梚?H*g?gS(u?1c?w@rT?Q=I?QA?]1%? RD?lj?W'n?-BU؊?h?t4? n?boQ?qvi?_)N?]tQW}?6H#z? 67w?"Ηs?C@Wi=q?ḰXl?f?$ka?%> T+Y? O?K 2=?]d<A]X`<+M[Ij<[5q&<.8eG< h#ឪV <;LC%K<ꆭh NVeΙVn6nvK zicp%E tQ)2U1WQ9Lin?23F:L"3\LQ V f[_rWDdx h+*k2=Ko:qr Mu\x?A{FS~8;b=ZV`bBtu9=JE>XدGwdO 8cx AFẙi&zqVYםΡag6 X83:뇡koɣj_ۤ| Mg^ݧt|Ψ_ΓXp2X^ttH蟿W;ޭl~$\z[߁İPp:J+N!X ɦ֬ ᆴX7(. Ɉ?5}h.G{tr&oya=cA/˺DH0⤮<)9O@ᣩTrVj֋@?˷dsI^i@(0߾ta&⊂l1EA1T[n&mi#d)B}QJwt}B < EOvpc/F<Ң"Ae އ0~ Rfq(*QtH3D@M`P}hwx%ƿ8*JG+[EliPIw+ E>ҙ02yΩ4A (Nt.Ȱ--̕^&܌z#;ޖu~g6X .pmF 3n bH޵LaEZvpR(-x_b˿ӰdyQӶVg<7܆ut7$MH𯋉ld"rqտH)݄ /0 wپ}2}K D5z&R cM,}uc?Ѡp5.bJ3ʸT[vv+\[U@ضBi"7oLeiFγ>SR(D2Z> B0$y1gWr-ެ @樫(afoeW-|&aY +M?V#z?u?q?}n?k?Lh?e?Rc?`?Zw^?*+\?Y?RW?U?_S?XQ?߱O?M?3K?J?GH?F?jD?`C?(`A?j??>?x,>N>>q>>>j>>k>>Π>>F>>>'>\>#>u>J>*>_F>d>+>$>w>>>JK>y>|>iݿ>>I>;>ʾ>t>5<> ~>>>O>>>~3>T>ե>(>g~>ՠ>G/>>>F>J> >:n>bԓ>Q<>>x>~>>>^>Ј>D>l>1>>%>\D>@|>?y>Bv>Hs>Qp>#^m>mj>|g>md>a>^>$[> Y>=3V>[S>P>M>J>~H>UE>B>?>=>S:>7>"4>=22>T/>d,>m+*>m'>c$>N?">,>>m>t>F>>1*> > >Y>>ʗ>>I=_={==^==&=_=g=='0===P6=˙=\= s==d= =yo=/=6=.=fЍ=x=i'=܀=a1y=p=xIh=_==W=TO=G=>=N6=.=&===-H==<א<̀<<<.4V?4=3@4A4A4qB4C4D4udE4-CF4K"G4H4H41I4J4vK4\fL4HM4+N4aO4O4bP4ٽQ4R4ԊS4crT4ZU4CV4-W4ZX4Y4UY4Z4[4(\4_]4^4_4C`4va4alb40cc47[d4~Te4Of4Jg42Hh4Fi4Fj4Hk4Kl4MPm4Vn4^o48hp4sq4r4s4 t4u4v4Cw4x4 z42{40S|4u}4~44v4@ 4L4>4ق4v444lV44R4F44p4 I44"4_44Ќ4l4L4`4ԏ4坐4y4ݖ4%44r&4k44(4444.4Q4N4t44\۶4H94̻4p44~X4w4p_4~444wE`mru\zw8xky5zz/ {ԃ{{7|3}|&|H|}C}g}ۇ}}a}g}]}~~4%~5~C~Q~g^~ij~u~>~2~~r~դ~Ƭ~N~u~C~~~~k~~~~~~t~~~6 < :#%](*.-z/13579;=?EABD:FGNIJ8LMNLPQR T=UdVWXYZ[\]^~__`;abbcod.eefLggh~~7~~/~7~~ ~ ~w~G]~>~Y~,}6}b}|O|06{x?yjD?l[T?w'??o?Wp?xI?-3?x^j??N?R:e?4:>?l?*?%z?PՋt?4?e;?$"?zaWF}?Gz‘B?Oq1? OU?ߺH?7a?nV,? K?Xhw?հ<?Vp\?m?)?zP?ZcX?*;Q^?#*'g? U7?e&$ ?jJo?\Ȭ)?L&?FS?leZ&?g ?NIO??xRr!?P_hy?y6IJO?_5%?[X~?1>?bU?+À?PX?5:pɗ0?8d?;U?J?͓?)m?ېZ]G?/|!? ?iT??Wq?PF9 ?ߓ^??ۮY?3???i?Z8o? O5?ٸ?P?R9?igP?La;?L?!ވ?%o?{7=8?Ҁt?DvC?6?=p\?;So&?mj?W?j?$O?z5Ѽ?Ҏ?C|P?yh|?%H?/ZM?f!w;??>ǭ?MAz?G?y?.?P9կ?TT}?g4K?#$O? Y?BM?6C;?B"_U?~t$?œ߉?52?Ҙl'?DɤT?<(i?qE8 ? Uī?OQM?o^?Sq͒?Gط5?zx?1zd}?:R!?Wg?~& ~k?=~-2?ZҿҶ?'|j_]?it?[?8R?uqb?#h?z|J?G~`?\!>?GF?vJ?l󈬚?5hȩmE?㭍?-l ?uG?1i%?調?M?e*|?zè?^V?4<%F?B}u?c-@c?n? R=?Kr?*}T#?,"k>?R) ?K{o?vaӽ?命8? t;I_? h?3xk?3Ӻ?b3?vZ9S?LJisk?M$a.?ftW?+ ?"@|?&#?p>_?1fҲ? DE?} ?/?%,?0?5nl+,&?QG?b. ?,*(>?p_8?cU)?h*?'wާ?dИۦ?ԭ<ڥ?]']ۤ?ݣ?=|?j?.?ĥׁ?u? ̓0?"NR? y? ڥ?d֔?^8 ?0`4I?IrO*?O'?x A?B?/)?7h`|?] ٨v?p?gC_e?T?yx;I< <[,L< Ŀk<4xV<=A[<'?}y<NG<~;[xo6xu{fUY>9>{ppCBwS(:5^dܓAN}8) YfHqն&|s f2,2Ztզޗ .n ZR'ӯB)[l@u Pҍ'TȈt(5wI'L/$;nXMØT`OArW,+jtȳRfARnqӊ<KZW$eKs) 4<=>)G'QA@Y.(5bX jz>lq{2Xx{~JH҄Cc`Qz%~ )Q\HsrUb'Bkq-hnק Ψ;3Kd)P^٨Tv$Hx"$ 5..&$ŗ: Aޓ=?~)@ lѿ3 ; @@@5gG8?SˆB?AAz?<ٰj_?$+K?88C?J?llf?UUUUUU?dg?$@= ףp=@n?[ m?h|?5?333333 @r?$~?B>٬ @r鷯?Q?Q?9v?(\@ffffff@.@4@x&??UUUUUU?a@X@`@|@@MA-DT! @h㈵>-DT!@C;d } P @ `#R1@`H\pp  d @ X x P p| ` PD h 0  \ ` ,@`\``X|0  P \<  #(&)d`,@/2@57d@; >B`pE HK$ OQHTVPZ]x `fL h l!@p\!r!u!px"p{`" }"@"8#0$$$ %%H&@&@+'2'H(g(@} )) )D*@** @+!@,G,P -S-rl.u.x/{0p0:1;@1 1>1?1@?1?1? 2@@20A`20B2`B2B2@C2pC2C3@EH3Eh3E3@F3K3K4K4K(4K<4KP4 Lh40L|4pL4L4M(5 NX5`O5O5P6P@6 R6`R60T7pT07Wl7Y7Y7Z7 Z70Z8[88 \P8@\h8p\8\8\8]8]8 ^9P^49^L9^d9_|9_9`9P`9p`:`:a@:`d:d:0o:pq0; rT;Ps;s;t;Pw<`x4<xL< yd<@yx<z<{<P|<}@=p~=>>>>??t@P@zRx $xy FJ w?;*3$"DXXD{ A 4tEBDD d GBI AAB4yADD K CAH K CAA @ <(4 XAAD0M AAK O AAG D_LX BBB A(A0p (A BBBA Y (A BBBH @BEB D(D0G@p 0A(A BBBH 4~A| C j F <$AD A AI  AH ^ AI G AH @dvBDA G0e  JABH H  AABD H,BID D(GP (C ABBJ (F ABBAT K ~D BBF B(A0A8DP8A0A(B BBBP\BEH D(D0GxHfA\0D(A BBB8a{BEE G(A0](C BBBDBEE L(D0A8B@8C0A(B BBBD4[BEE L(D0A8B@8C0A(B BBB\|h BBE D(A0O (D BBBI K (D BBBK (A EBB8bBEA A(A0N(D ABB4QADG [ CAE O CAE 4PAAD0K AAE O AAG l|@dBAC D02  AABH l  AABH xAP G b F @`YAAG0~ DAD h AAF k AAC dH|[BEE B(A0D8H] 8A0A(B BBBF  8F0A(B BBBA DtsCA e DBN AABDh l,BBB A(D0DPj 0D(A BBBL l 0D(A BBBI ` 0D(D BBBB \hhBBE B(D0A8G@WHJPGXC`AhBpI@o 8D0A(B BBBF XD E (mADG e DAJ 4$@AAG \ DAF N DAE 4\AAG \ DAF N DAE \hBBI D(D0 (D ABBD N (D ABBI \ (C DBBI yD Y AA 8 BBA A(D@` (A ABBH 8T pWBBA A(D0T (A ABBD d SBA A(G0 (D ABBG pP0T (I ABBN @BBB B(D0C8Fp 8A0A(B BBBL O 8A0A(B BBBG mxTAABAAAAAIp 8A0A(B BBBF ^BFB B(D0D8DpKxZBFFBFABFJpk 8A0A(B BBBA ixDkxFp^ 8A0A(B BBBF xW_xApP 4BBB A(D0D@dHLP`HF@^ 0D(A BBBB UH^PBXA`AhBpAxDBFP@c 0D(A BBBD \yBBB D(A0D`h_pBxFABFAEFP`Y 0D(A BBBE N 0D(A BBBG khLp`hF`^ 0D(A BBBB | 8 yBBB D(A0D`h_pBxFABFAEFP`Y 0D(A BBBE N 0D(A BBBG khLp`hF`^ 0D(A BBBB  yBBB D(A0D`h_pBxFABFAEFP`Y 0D(A BBBE N 0D(A BBBG khLp`hF`^ 0D(A BBBB yBBB D(A0D`h_pBxFABFAEFP`Y 0D(A BBBE N 0D(A BBBG khLp`hF`^ 0D(A BBBB hBBB B(D0D8D`JhepBxAABADBFQ`m 8A0A(B BBBA ~hHpYhF`^ 8A0A(B BBBD BBB B(D0D8D`JhepBxAABADBFQ`m 8A0A(B BBBA ~hHpYhF`^ 8A0A(B BBBD \BBB B(D0D8D`JhepBxAABADBFQ`m 8A0A(B BBBA ~hHpYhF`^ 8A0A(B BBBD 0^BFB B(D0D8DpKxZBFFBFABFJpk 8A0A(B BBBA ixDkxFp^ 8A0A(B BBBF xW_xApXBBB B(D0D8D`JhepBxAABADBFQ`m 8A0A(B BBBA ~hHpYhF`^ 8A0A(B BBBD tZBBB A(D0DP{Xe`BhApBxBABBAJPk 0A(A BBBG yXH`YXFP^ 0A(A BBBJ t^BFB B(D0D8DpKxZBFFBFABFJpk 8A0A(B BBBA ixDkxFp^ 8A0A(B BBBF xW_xAp("BBB B(D0D8D`JhepBxAABADBFQ`m 8A0A(B BBBA ~hHpYhF`^ 8A0A(B BBBD Dp$BFB B(D0A8GpOx`BFAEFABFJpk 8A0A(B BBBE UxDkxFp^ 8A0A(B BBBF xW_xApNxV`xGp'^BFB B(D0D8DpKxZBFFBFABFJpk 8A0A(B BBBA ixDkxFp^ 8A0A(B BBBF xW_xAp|\*PBBB B(D0D8D`hHpYhF`^ 8D0A(B BBBI ShZpBxFFBFABFP`(,-BBB B(D0D8D`JhepBxAABADBFQ`m 8A0A(B BBBA ~hHpYhF`^ 8A0A(B BBBD t/yBBB D(A0D`h_pBxAABFAEAW`Y 0D(A BBBH N 0D(A BBBG khLp`hF`^ 0D(A BBBB |dP2aBBA D(DPwXW`BhBpBxBBBBBJPk (A ABBJ yXH`YXFP^ (A ABBD |@4aBBA D(DPwXW`BhBpBxBBBBBJPk (A ABBJ yXH`YXFP^ (A ABBD d06BBB A(D0D@dHLP`HF@^ 0D(A BBBB UH^PBXA`AhBpAxDBFP@c 0D(A BBBD X8^BFB B(D0D8DpKxZBFFBFABFJpk 8A0A(B BBBA ixDkxFp^ 8A0A(B BBBF xW_xApx ;BBB D(D0D@$ 0D(A BBBG yHHPYHF@_ 0D(A BBBF  0D(A BBBD `p>*BBB A(D0DPy 0A(A BBBH yXH`YXFP^ 0A(A BBBB lx<@`BBB A(A0D@I 0D(A BBBH  0D(A BBBH  0D(A BBBD `,FBBIB A(A0 (D BBBF K (D BBBK v (D BBBH `LHBBA D(D0 (D ABBG  (D ABBE t (D ABBK DdKbAD G0  DABK `  AABA LNjBED A(GP (D ABBC n (D ABBI (HPyAD0 AAH (tSyAD0 AAH XdVBBE A(A0D@ 0A(A BBBF ` 0C(A BBBF LYBBA A(D@ (D ABBF ~ (G ABBF HLhZ BBB E(A0A8D` 8D0A(B BBBI 8BEB B(A0D8DPH 8D0A(B BBBG l"TBFB B(D0A8DTDkF^ 8D0A(B BBBG W_Ad,#hkBBB B(A0A8G` 8A0A(B BBBH V 8C0A(B BBBF H# yBBB B(A0D8GP  8D0A(B BBBG H#dBBB B(A0D8GP  8D0A(B BBBG \,$9BBB B(D0A8G HYFb 8D0A(B BBBE L$'BBE H(A0A8D* 8D0A(B BBBB $(BBB E(A0A8D_QB 8D0A(B BBBD _TA-IYF_QAm_RB_RB)GQABTA ERBZGQAl%x9%BIB B(A0A8GMEkFb 8D0A(B BBBF W_FXL&H BBE A(A0D@i 0D(A BBBE G 0D(A BBBF &#BBE D(D0DPkXH`YXFP^ 0A(A BBBC TXa`AhApBxADBFATPE 0A(A BBBH 4'@&BFB B(A0D8D bFABFBBWDkF^ 8D0A(B BBBC HSEBFBBFBTW_AV`G(LDBBE D(D0DPkXH`YXFP^ 0A(A BBBC TXa`AhApBxADBFATPE 0A(A BBBH (FBBE D(D0DPkXH`YXFP^ 0A(A BBBC TXa`AhApBxADBFATPE 0A(A BBBH )4IBBD D(DPeXL``XFP^ (A ABBE SXa`AhApBxAHEFAPPB (A ABBK )KBFE D(D0D`KhDpkhF`^ 0A(A BBBA YhZpFxFBFAEFAP`B 0A(A BBBB hWp_hA`\@*NIBBE B(A0A8G 8D0A(B BBBA vHYF*F $* (LG0EDU0* /Dj8* ]G@| AG x AG +AD[@0+ D UH+ 'D b`+4 >\ ]x+\ ?D n+ DQ0+ &OK0w EJ KALK0+WAG AA +IO0 EA  ,(D c8,DI P,AG0e EA t,`&IX,t/AG ]A0,AG@ AQ l AS A,SAG }A-0D U-8}Ai F LH<-YBBE E(D0D8DU 8D0A(B BBBD ------%G]. ,.9GED ^ABG,H.IGED qABDHx.BIH H(GP (E ABBE c(A AFB,.9GED _ABFT.2BEI H(H0D@ 0D(A BBBH r0A(A FBB,L/9GED _ABF,|/QGED {ABB,/qGED UABHH/8BBE I(H0K8K` 8E0A(B BBBI ,(09GED _ABF@X0BEI H(H0D@ 0A(A BBBF ,0(9GED _ABF808]G@y AB x AG (AG[@81[G0 AD t AK ;AD[0D1"GJ\1"GJt1 "GJ1(" 01$"rAD@C EAH h1#(D c1#D U2#,D g2#D U42#D U(L2#AG0J AM Ax2$DQ2$SAG }A2%/AG ]A2%'D b2,%>\ ]3T%?D n(3|%AG R AM XAD3%gAG UAd30&NAG DA3`&DI3h&^D B E 3&AG0e EA D3H'AHDpa DAE M DAF ! DAA $4)&IXL@4) BFG E(A0D8J 8D0A(B BBBG 8444:BED D(Dpk (A ABBD 486YiFPL<46/AG0 AD m AJ L AC P DE 057WAG AA P57IO0 EA 4t58AGP AG ^ AA L AC 58;AG@ AG 5$MGG T ABF hH6T?ZBBB B(D0A8DP} 8D0A(B BBBE H6h@BBB B(A0A8FPm 8C0A(B BBBG x(7@BDB B(A0A8DP 8A0A(B BBBB @ 8D0A(B BBBC \ 8A0A(E BBBG x7BBDB B(A0A8DP 8A0A(B BBBK ~ 8D0A(B BBBE \ 8A0A(E BBBG ( 8$CGACD a AAE HL8HCBBB B(A0A8DPR 8A0A(B BBBF 8EBBB B(A0A8DP 8A0A(B BBBB  8A0A(B BBBE i 8A0A(B BBBE i 8A0A(B BBBA d09TGBBB B(A0A8DP 8A0A(B BBBG  8A0A(B BBBA t9IKbEE B(A0A8GP8A0A(B BBBAJP 8A0A(B BBBC ,:dKoKHE wABF\@:KBEB B(E0D8D`p 8A0A(B BBBA S8A0A(B BBB@{'Q[k {'{'o`  '@81n o0oo.oW|'&6FVfvƮ֮&6FVfvƯ֯&6FVfvưְ&6FVfvƱֱ&6FVfvƲֲ&6FVfvƳֳ&6FVfvƴִ&6FVfvƵֵ&6FVfvƶֶ&6FVfv This is an alias of `random_sample`. See `random_sample` for the complete documentation. This is an alias of `random_sample`. See `random_sample` for the complete documentation. permutation(x) Randomly permute a sequence, or return a permuted range. If `x` is a multi-dimensional array, it is only shuffled along its first index. .. note:: New code should use the ``permutation`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- x : int or array_like If `x` is an integer, randomly permute ``np.arange(x)``. If `x` is an array, make a copy and shuffle the elements randomly. Returns ------- out : ndarray Permuted sequence or array range. See Also -------- Generator.permutation: which should be used for new code. Examples -------- >>> np.random.permutation(10) array([1, 7, 4, 3, 0, 9, 2, 5, 8, 6]) # random >>> np.random.permutation([1, 4, 9, 12, 15]) array([15, 1, 9, 4, 12]) # random >>> arr = np.arange(9).reshape((3, 3)) >>> np.random.permutation(arr) array([[6, 7, 8], # random [0, 1, 2], [3, 4, 5]]) shuffle(x) Modify a sequence in-place by shuffling its contents. This function only shuffles the array along the first axis of a multi-dimensional array. The order of sub-arrays is changed but their contents remains the same. .. note:: New code should use the ``shuffle`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- x : array_like The array or list to be shuffled. Returns ------- None See Also -------- Generator.shuffle: which should be used for new code. Examples -------- >>> arr = np.arange(10) >>> np.random.shuffle(arr) >>> arr [1 7 5 2 9 4 3 6 0 8] # random Multi-dimensional arrays are only shuffled along the first axis: >>> arr = np.arange(9).reshape((3, 3)) >>> np.random.shuffle(arr) >>> arr array([[3, 4, 5], # random [6, 7, 8], [0, 1, 2]]) dirichlet(alpha, size=None) Draw samples from the Dirichlet distribution. Draw `size` samples of dimension k from a Dirichlet distribution. A Dirichlet-distributed random variable can be seen as a multivariate generalization of a Beta distribution. The Dirichlet distribution is a conjugate prior of a multinomial distribution in Bayesian inference. .. note:: New code should use the ``dirichlet`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- alpha : sequence of floats, length k Parameter of the distribution (length ``k`` for sample of length ``k``). size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n)``, then ``m * n * k`` samples are drawn. Default is None, in which case a vector of length ``k`` is returned. Returns ------- samples : ndarray, The drawn samples, of shape ``(size, k)``. Raises ------- ValueError If any value in ``alpha`` is less than or equal to zero See Also -------- Generator.dirichlet: which should be used for new code. Notes ----- The Dirichlet distribution is a distribution over vectors :math:`x` that fulfil the conditions :math:`x_i>0` and :math:`\sum_{i=1}^k x_i = 1`. The probability density function :math:`p` of a Dirichlet-distributed random vector :math:`X` is proportional to .. math:: p(x) \propto \prod_{i=1}^{k}{x^{\alpha_i-1}_i}, where :math:`\alpha` is a vector containing the positive concentration parameters. The method uses the following property for computation: let :math:`Y` be a random vector which has components that follow a standard gamma distribution, then :math:`X = \frac{1}{\sum_{i=1}^k{Y_i}} Y` is Dirichlet-distributed References ---------- .. [1] David McKay, "Information Theory, Inference and Learning Algorithms," chapter 23, http://www.inference.org.uk/mackay/itila/ .. [2] Wikipedia, "Dirichlet distribution", https://en.wikipedia.org/wiki/Dirichlet_distribution Examples -------- Taking an example cited in Wikipedia, this distribution can be used if one wanted to cut strings (each of initial length 1.0) into K pieces with different lengths, where each piece had, on average, a designated average length, but allowing some variation in the relative sizes of the pieces. >>> s = np.random.dirichlet((10, 5, 3), 20).transpose() >>> import matplotlib.pyplot as plt >>> plt.barh(range(20), s[0]) >>> plt.barh(range(20), s[1], left=s[0], color='g') >>> plt.barh(range(20), s[2], left=s[0]+s[1], color='r') >>> plt.title("Lengths of Strings") multinomial(n, pvals, size=None) Draw samples from a multinomial distribution. The multinomial distribution is a multivariate generalization of the binomial distribution. Take an experiment with one of ``p`` possible outcomes. An example of such an experiment is throwing a dice, where the outcome can be 1 through 6. Each sample drawn from the distribution represents `n` such experiments. Its values, ``X_i = [X_0, X_1, ..., X_p]``, represent the number of times the outcome was ``i``. .. note:: New code should use the ``multinomial`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- n : int Number of experiments. pvals : sequence of floats, length p Probabilities of each of the ``p`` different outcomes. These must sum to 1 (however, the last element is always assumed to account for the remaining probability, as long as ``sum(pvals[:-1]) <= 1)``. size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. Default is None, in which case a single value is returned. Returns ------- out : ndarray The drawn samples, of shape *size*, if that was provided. If not, the shape is ``(N,)``. In other words, each entry ``out[i,j,...,:]`` is an N-dimensional value drawn from the distribution. See Also -------- Generator.multinomial: which should be used for new code. Examples -------- Throw a dice 20 times: >>> np.random.multinomial(20, [1/6.]*6, size=1) array([[4, 1, 7, 5, 2, 1]]) # random It landed 4 times on 1, once on 2, etc. Now, throw the dice 20 times, and 20 times again: >>> np.random.multinomial(20, [1/6.]*6, size=2) array([[3, 4, 3, 3, 4, 3], # random [2, 4, 3, 4, 0, 7]]) For the first run, we threw 3 times 1, 4 times 2, etc. For the second, we threw 2 times 1, 4 times 2, etc. A loaded die is more likely to land on number 6: >>> np.random.multinomial(100, [1/7.]*5 + [2/7.]) array([11, 16, 14, 17, 16, 26]) # random The probability inputs should be normalized. As an implementation detail, the value of the last entry is ignored and assumed to take up any leftover probability mass, but this should not be relied on. A biased coin which has twice as much weight on one side as on the other should be sampled like so: >>> np.random.multinomial(100, [1.0 / 3, 2.0 / 3]) # RIGHT array([38, 62]) # random not like: >>> np.random.multinomial(100, [1.0, 2.0]) # WRONG Traceback (most recent call last): ValueError: pvals < 0, pvals > 1 or pvals contains NaNs multivariate_normal(mean, cov, size=None, check_valid='warn', tol=1e-8) Draw random samples from a multivariate normal distribution. The multivariate normal, multinormal or Gaussian distribution is a generalization of the one-dimensional normal distribution to higher dimensions. Such a distribution is specified by its mean and covariance matrix. These parameters are analogous to the mean (average or "center") and variance (standard deviation, or "width," squared) of the one-dimensional normal distribution. .. note:: New code should use the ``multivariate_normal`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- mean : 1-D array_like, of length N Mean of the N-dimensional distribution. cov : 2-D array_like, of shape (N, N) Covariance matrix of the distribution. It must be symmetric and positive-semidefinite for proper sampling. size : int or tuple of ints, optional Given a shape of, for example, ``(m,n,k)``, ``m*n*k`` samples are generated, and packed in an `m`-by-`n`-by-`k` arrangement. Because each sample is `N`-dimensional, the output shape is ``(m,n,k,N)``. If no shape is specified, a single (`N`-D) sample is returned. check_valid : { 'warn', 'raise', 'ignore' }, optional Behavior when the covariance matrix is not positive semidefinite. tol : float, optional Tolerance when checking the singular values in covariance matrix. cov is cast to double before the check. Returns ------- out : ndarray The drawn samples, of shape *size*, if that was provided. If not, the shape is ``(N,)``. In other words, each entry ``out[i,j,...,:]`` is an N-dimensional value drawn from the distribution. See Also -------- Generator.multivariate_normal: which should be used for new code. Notes ----- The mean is a coordinate in N-dimensional space, which represents the location where samples are most likely to be generated. This is analogous to the peak of the bell curve for the one-dimensional or univariate normal distribution. Covariance indicates the level to which two variables vary together. From the multivariate normal distribution, we draw N-dimensional samples, :math:`X = [x_1, x_2, ... x_N]`. The covariance matrix element :math:`C_{ij}` is the covariance of :math:`x_i` and :math:`x_j`. The element :math:`C_{ii}` is the variance of :math:`x_i` (i.e. its "spread"). Instead of specifying the full covariance matrix, popular approximations include: - Spherical covariance (`cov` is a multiple of the identity matrix) - Diagonal covariance (`cov` has non-negative elements, and only on the diagonal) This geometrical property can be seen in two dimensions by plotting generated data-points: >>> mean = [0, 0] >>> cov = [[1, 0], [0, 100]] # diagonal covariance Diagonal covariance means that points are oriented along x or y-axis: >>> import matplotlib.pyplot as plt >>> x, y = np.random.multivariate_normal(mean, cov, 5000).T >>> plt.plot(x, y, 'x') >>> plt.axis('equal') >>> plt.show() Note that the covariance matrix must be positive semidefinite (a.k.a. nonnegative-definite). Otherwise, the behavior of this method is undefined and backwards compatibility is not guaranteed. References ---------- .. [1] Papoulis, A., "Probability, Random Variables, and Stochastic Processes," 3rd ed., New York: McGraw-Hill, 1991. .. [2] Duda, R. O., Hart, P. E., and Stork, D. G., "Pattern Classification," 2nd ed., New York: Wiley, 2001. Examples -------- >>> mean = (1, 2) >>> cov = [[1, 0], [0, 1]] >>> x = np.random.multivariate_normal(mean, cov, (3, 3)) >>> x.shape (3, 3, 2) The following is probably true, given that 0.6 is roughly twice the standard deviation: >>> list((x[0,0,:] - mean) < 0.6) [True, True] # random logseries(p, size=None) Draw samples from a logarithmic series distribution. Samples are drawn from a log series distribution with specified shape parameter, 0 < ``p`` < 1. .. note:: New code should use the ``logseries`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- p : float or array_like of floats Shape parameter for the distribution. Must be in the range (0, 1). size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. If size is ``None`` (default), a single value is returned if ``p`` is a scalar. Otherwise, ``np.array(p).size`` samples are drawn. Returns ------- out : ndarray or scalar Drawn samples from the parameterized logarithmic series distribution. See Also -------- scipy.stats.logser : probability density function, distribution or cumulative density function, etc. Generator.logseries: which should be used for new code. Notes ----- The probability density for the Log Series distribution is .. math:: P(k) = \frac{-p^k}{k \ln(1-p)}, where p = probability. The log series distribution is frequently used to represent species richness and occurrence, first proposed by Fisher, Corbet, and Williams in 1943 [2]. It may also be used to model the numbers of occupants seen in cars [3]. References ---------- .. [1] Buzas, Martin A.; Culver, Stephen J., Understanding regional species diversity through the log series distribution of occurrences: BIODIVERSITY RESEARCH Diversity & Distributions, Volume 5, Number 5, September 1999 , pp. 187-195(9). .. [2] Fisher, R.A,, A.S. Corbet, and C.B. Williams. 1943. The relation between the number of species and the number of individuals in a random sample of an animal population. Journal of Animal Ecology, 12:42-58. .. [3] D. J. Hand, F. Daly, D. Lunn, E. Ostrowski, A Handbook of Small Data Sets, CRC Press, 1994. .. [4] Wikipedia, "Logarithmic distribution", https://en.wikipedia.org/wiki/Logarithmic_distribution Examples -------- Draw samples from the distribution: >>> a = .6 >>> s = np.random.logseries(a, 10000) >>> import matplotlib.pyplot as plt >>> count, bins, ignored = plt.hist(s) # plot against distribution >>> def logseries(k, p): ... return -p**k/(k*np.log(1-p)) >>> plt.plot(bins, logseries(bins, a)*count.max()/ ... logseries(bins, a).max(), 'r') >>> plt.show() hypergeometric(ngood, nbad, nsample, size=None) Draw samples from a Hypergeometric distribution. Samples are drawn from a hypergeometric distribution with specified parameters, `ngood` (ways to make a good selection), `nbad` (ways to make a bad selection), and `nsample` (number of items sampled, which is less than or equal to the sum ``ngood + nbad``). .. note:: New code should use the ``hypergeometric`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- ngood : int or array_like of ints Number of ways to make a good selection. Must be nonnegative. nbad : int or array_like of ints Number of ways to make a bad selection. Must be nonnegative. nsample : int or array_like of ints Number of items sampled. Must be at least 1 and at most ``ngood + nbad``. size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. If size is ``None`` (default), a single value is returned if `ngood`, `nbad`, and `nsample` are all scalars. Otherwise, ``np.broadcast(ngood, nbad, nsample).size`` samples are drawn. Returns ------- out : ndarray or scalar Drawn samples from the parameterized hypergeometric distribution. Each sample is the number of good items within a randomly selected subset of size `nsample` taken from a set of `ngood` good items and `nbad` bad items. See Also -------- scipy.stats.hypergeom : probability density function, distribution or cumulative density function, etc. Generator.hypergeometric: which should be used for new code. Notes ----- The probability density for the Hypergeometric distribution is .. math:: P(x) = \frac{\binom{g}{x}\binom{b}{n-x}}{\binom{g+b}{n}}, where :math:`0 \le x \le n` and :math:`n-b \le x \le g` for P(x) the probability of ``x`` good results in the drawn sample, g = `ngood`, b = `nbad`, and n = `nsample`. Consider an urn with black and white marbles in it, `ngood` of them are black and `nbad` are white. If you draw `nsample` balls without replacement, then the hypergeometric distribution describes the distribution of black balls in the drawn sample. Note that this distribution is very similar to the binomial distribution, except that in this case, samples are drawn without replacement, whereas in the Binomial case samples are drawn with replacement (or the sample space is infinite). As the sample space becomes large, this distribution approaches the binomial. References ---------- .. [1] Lentner, Marvin, "Elementary Applied Statistics", Bogden and Quigley, 1972. .. [2] Weisstein, Eric W. "Hypergeometric Distribution." From MathWorld--A Wolfram Web Resource. http://mathworld.wolfram.com/HypergeometricDistribution.html .. [3] Wikipedia, "Hypergeometric distribution", https://en.wikipedia.org/wiki/Hypergeometric_distribution Examples -------- Draw samples from the distribution: >>> ngood, nbad, nsamp = 100, 2, 10 # number of good, number of bad, and number of samples >>> s = np.random.hypergeometric(ngood, nbad, nsamp, 1000) >>> from matplotlib.pyplot import hist >>> hist(s) # note that it is very unlikely to grab both bad items Suppose you have an urn with 15 white and 15 black marbles. If you pull 15 marbles at random, how likely is it that 12 or more of them are one color? >>> s = np.random.hypergeometric(15, 15, 15, 100000) >>> sum(s>=12)/100000. + sum(s<=3)/100000. # answer = 0.003 ... pretty unlikely! geometric(p, size=None) Draw samples from the geometric distribution. Bernoulli trials are experiments with one of two outcomes: success or failure (an example of such an experiment is flipping a coin). The geometric distribution models the number of trials that must be run in order to achieve success. It is therefore supported on the positive integers, ``k = 1, 2, ...``. The probability mass function of the geometric distribution is .. math:: f(k) = (1 - p)^{k - 1} p where `p` is the probability of success of an individual trial. .. note:: New code should use the ``geometric`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- p : float or array_like of floats The probability of success of an individual trial. size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. If size is ``None`` (default), a single value is returned if ``p`` is a scalar. Otherwise, ``np.array(p).size`` samples are drawn. Returns ------- out : ndarray or scalar Drawn samples from the parameterized geometric distribution. See Also -------- Generator.geometric: which should be used for new code. Examples -------- Draw ten thousand values from the geometric distribution, with the probability of an individual success equal to 0.35: >>> z = np.random.geometric(p=0.35, size=10000) How many trials succeeded after a single run? >>> (z == 1).sum() / 10000. 0.34889999999999999 #random zipf(a, size=None) Draw samples from a Zipf distribution. Samples are drawn from a Zipf distribution with specified parameter `a` > 1. The Zipf distribution (also known as the zeta distribution) is a continuous probability distribution that satisfies Zipf's law: the frequency of an item is inversely proportional to its rank in a frequency table. .. note:: New code should use the ``zipf`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- a : float or array_like of floats Distribution parameter. Must be greater than 1. size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. If size is ``None`` (default), a single value is returned if ``a`` is a scalar. Otherwise, ``np.array(a).size`` samples are drawn. Returns ------- out : ndarray or scalar Drawn samples from the parameterized Zipf distribution. See Also -------- scipy.stats.zipf : probability density function, distribution, or cumulative density function, etc. Generator.zipf: which should be used for new code. Notes ----- The probability density for the Zipf distribution is .. math:: p(x) = \frac{x^{-a}}{\zeta(a)}, where :math:`\zeta` is the Riemann Zeta function. It is named for the American linguist George Kingsley Zipf, who noted that the frequency of any word in a sample of a language is inversely proportional to its rank in the frequency table. References ---------- .. [1] Zipf, G. K., "Selected Studies of the Principle of Relative Frequency in Language," Cambridge, MA: Harvard Univ. Press, 1932. Examples -------- Draw samples from the distribution: >>> a = 2. # parameter >>> s = np.random.zipf(a, 1000) Display the histogram of the samples, along with the probability density function: >>> import matplotlib.pyplot as plt >>> from scipy import special # doctest: +SKIP Truncate s values at 50 so plot is interesting: >>> count, bins, ignored = plt.hist(s[s<50], 50, density=True) >>> x = np.arange(1., 50.) >>> y = x**(-a) / special.zetac(a) # doctest: +SKIP >>> plt.plot(x, y/max(y), linewidth=2, color='r') # doctest: +SKIP >>> plt.show() poisson(lam=1.0, size=None) Draw samples from a Poisson distribution. The Poisson distribution is the limit of the binomial distribution for large N. .. note:: New code should use the ``poisson`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- lam : float or array_like of floats Expectation of interval, must be >= 0. A sequence of expectation intervals must be broadcastable over the requested size. size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. If size is ``None`` (default), a single value is returned if ``lam`` is a scalar. Otherwise, ``np.array(lam).size`` samples are drawn. Returns ------- out : ndarray or scalar Drawn samples from the parameterized Poisson distribution. See Also -------- Generator.poisson: which should be used for new code. Notes ----- The Poisson distribution .. math:: f(k; \lambda)=\frac{\lambda^k e^{-\lambda}}{k!} For events with an expected separation :math:`\lambda` the Poisson distribution :math:`f(k; \lambda)` describes the probability of :math:`k` events occurring within the observed interval :math:`\lambda`. Because the output is limited to the range of the C int64 type, a ValueError is raised when `lam` is within 10 sigma of the maximum representable value. References ---------- .. [1] Weisstein, Eric W. "Poisson Distribution." From MathWorld--A Wolfram Web Resource. http://mathworld.wolfram.com/PoissonDistribution.html .. [2] Wikipedia, "Poisson distribution", https://en.wikipedia.org/wiki/Poisson_distribution Examples -------- Draw samples from the distribution: >>> import numpy as np >>> s = np.random.poisson(5, 10000) Display histogram of the sample: >>> import matplotlib.pyplot as plt >>> count, bins, ignored = plt.hist(s, 14, density=True) >>> plt.show() Draw each 100 values for lambda 100 and 500: >>> s = np.random.poisson(lam=(100., 500.), size=(100, 2)) negative_binomial(n, p, size=None) Draw samples from a negative binomial distribution. Samples are drawn from a negative binomial distribution with specified parameters, `n` successes and `p` probability of success where `n` is > 0 and `p` is in the interval [0, 1]. .. note:: New code should use the ``negative_binomial`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- n : float or array_like of floats Parameter of the distribution, > 0. p : float or array_like of floats Parameter of the distribution, >= 0 and <=1. size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. If size is ``None`` (default), a single value is returned if ``n`` and ``p`` are both scalars. Otherwise, ``np.broadcast(n, p).size`` samples are drawn. Returns ------- out : ndarray or scalar Drawn samples from the parameterized negative binomial distribution, where each sample is equal to N, the number of failures that occurred before a total of n successes was reached. See Also -------- Generator.negative_binomial: which should be used for new code. Notes ----- The probability mass function of the negative binomial distribution is .. math:: P(N;n,p) = \frac{\Gamma(N+n)}{N!\Gamma(n)}p^{n}(1-p)^{N}, where :math:`n` is the number of successes, :math:`p` is the probability of success, :math:`N+n` is the number of trials, and :math:`\Gamma` is the gamma function. When :math:`n` is an integer, :math:`\frac{\Gamma(N+n)}{N!\Gamma(n)} = \binom{N+n-1}{N}`, which is the more common form of this term in the the pmf. The negative binomial distribution gives the probability of N failures given n successes, with a success on the last trial. If one throws a die repeatedly until the third time a "1" appears, then the probability distribution of the number of non-"1"s that appear before the third "1" is a negative binomial distribution. References ---------- .. [1] Weisstein, Eric W. "Negative Binomial Distribution." From MathWorld--A Wolfram Web Resource. http://mathworld.wolfram.com/NegativeBinomialDistribution.html .. [2] Wikipedia, "Negative binomial distribution", https://en.wikipedia.org/wiki/Negative_binomial_distribution Examples -------- Draw samples from the distribution: A real world example. A company drills wild-cat oil exploration wells, each with an estimated probability of success of 0.1. What is the probability of having one success for each successive well, that is what is the probability of a single success after drilling 5 wells, after 6 wells, etc.? >>> s = np.random.negative_binomial(1, 0.1, 100000) >>> for i in range(1, 11): # doctest: +SKIP ... probability = sum(s>> n, p = 10, .5 # number of trials, probability of each trial >>> s = np.random.binomial(n, p, 1000) # result of flipping a coin 10 times, tested 1000 times. A real world example. A company drills 9 wild-cat oil exploration wells, each with an estimated probability of success of 0.1. All nine wells fail. What is the probability of that happening? Let's do 20,000 trials of the model, and count the number that generate zero positive results. >>> sum(np.random.binomial(9, 0.1, 20000) == 0)/20000. # answer = 0.38885, or 38%. triangular(left, mode, right, size=None) Draw samples from the triangular distribution over the interval ``[left, right]``. The triangular distribution is a continuous probability distribution with lower limit left, peak at mode, and upper limit right. Unlike the other distributions, these parameters directly define the shape of the pdf. .. note:: New code should use the ``triangular`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- left : float or array_like of floats Lower limit. mode : float or array_like of floats The value where the peak of the distribution occurs. The value must fulfill the condition ``left <= mode <= right``. right : float or array_like of floats Upper limit, must be larger than `left`. size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. If size is ``None`` (default), a single value is returned if ``left``, ``mode``, and ``right`` are all scalars. Otherwise, ``np.broadcast(left, mode, right).size`` samples are drawn. Returns ------- out : ndarray or scalar Drawn samples from the parameterized triangular distribution. See Also -------- Generator.triangular: which should be used for new code. Notes ----- The probability density function for the triangular distribution is .. math:: P(x;l, m, r) = \begin{cases} \frac{2(x-l)}{(r-l)(m-l)}& \text{for $l \leq x \leq m$},\\ \frac{2(r-x)}{(r-l)(r-m)}& \text{for $m \leq x \leq r$},\\ 0& \text{otherwise}. \end{cases} The triangular distribution is often used in ill-defined problems where the underlying distribution is not known, but some knowledge of the limits and mode exists. Often it is used in simulations. References ---------- .. [1] Wikipedia, "Triangular distribution" https://en.wikipedia.org/wiki/Triangular_distribution Examples -------- Draw values from the distribution and plot the histogram: >>> import matplotlib.pyplot as plt >>> h = plt.hist(np.random.triangular(-3, 0, 8, 100000), bins=200, ... density=True) >>> plt.show() wald(mean, scale, size=None) Draw samples from a Wald, or inverse Gaussian, distribution. As the scale approaches infinity, the distribution becomes more like a Gaussian. Some references claim that the Wald is an inverse Gaussian with mean equal to 1, but this is by no means universal. The inverse Gaussian distribution was first studied in relationship to Brownian motion. In 1956 M.C.K. Tweedie used the name inverse Gaussian because there is an inverse relationship between the time to cover a unit distance and distance covered in unit time. .. note:: New code should use the ``wald`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- mean : float or array_like of floats Distribution mean, must be > 0. scale : float or array_like of floats Scale parameter, must be > 0. size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. If size is ``None`` (default), a single value is returned if ``mean`` and ``scale`` are both scalars. Otherwise, ``np.broadcast(mean, scale).size`` samples are drawn. Returns ------- out : ndarray or scalar Drawn samples from the parameterized Wald distribution. See Also -------- Generator.wald: which should be used for new code. Notes ----- The probability density function for the Wald distribution is .. math:: P(x;mean,scale) = \sqrt{\frac{scale}{2\pi x^3}}e^ \frac{-scale(x-mean)^2}{2\cdotp mean^2x} As noted above the inverse Gaussian distribution first arise from attempts to model Brownian motion. It is also a competitor to the Weibull for use in reliability modeling and modeling stock returns and interest rate processes. References ---------- .. [1] Brighton Webs Ltd., Wald Distribution, https://web.archive.org/web/20090423014010/http://www.brighton-webs.co.uk:80/distributions/wald.asp .. [2] Chhikara, Raj S., and Folks, J. Leroy, "The Inverse Gaussian Distribution: Theory : Methodology, and Applications", CRC Press, 1988. .. [3] Wikipedia, "Inverse Gaussian distribution" https://en.wikipedia.org/wiki/Inverse_Gaussian_distribution Examples -------- Draw values from the distribution and plot the histogram: >>> import matplotlib.pyplot as plt >>> h = plt.hist(np.random.wald(3, 2, 100000), bins=200, density=True) >>> plt.show() rayleigh(scale=1.0, size=None) Draw samples from a Rayleigh distribution. The :math:`\chi` and Weibull distributions are generalizations of the Rayleigh. .. note:: New code should use the ``rayleigh`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- scale : float or array_like of floats, optional Scale, also equals the mode. Must be non-negative. Default is 1. size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. If size is ``None`` (default), a single value is returned if ``scale`` is a scalar. Otherwise, ``np.array(scale).size`` samples are drawn. Returns ------- out : ndarray or scalar Drawn samples from the parameterized Rayleigh distribution. See Also -------- Generator.rayleigh: which should be used for new code. Notes ----- The probability density function for the Rayleigh distribution is .. math:: P(x;scale) = \frac{x}{scale^2}e^{\frac{-x^2}{2 \cdotp scale^2}} The Rayleigh distribution would arise, for example, if the East and North components of the wind velocity had identical zero-mean Gaussian distributions. Then the wind speed would have a Rayleigh distribution. References ---------- .. [1] Brighton Webs Ltd., "Rayleigh Distribution," https://web.archive.org/web/20090514091424/http://brighton-webs.co.uk:80/distributions/rayleigh.asp .. [2] Wikipedia, "Rayleigh distribution" https://en.wikipedia.org/wiki/Rayleigh_distribution Examples -------- Draw values from the distribution and plot the histogram >>> from matplotlib.pyplot import hist >>> values = hist(np.random.rayleigh(3, 100000), bins=200, density=True) Wave heights tend to follow a Rayleigh distribution. If the mean wave height is 1 meter, what fraction of waves are likely to be larger than 3 meters? >>> meanvalue = 1 >>> modevalue = np.sqrt(2 / np.pi) * meanvalue >>> s = np.random.rayleigh(modevalue, 1000000) The percentage of waves larger than 3 meters is: >>> 100.*sum(s>3)/1000000. 0.087300000000000003 # random lognormal(mean=0.0, sigma=1.0, size=None) Draw samples from a log-normal distribution. Draw samples from a log-normal distribution with specified mean, standard deviation, and array shape. Note that the mean and standard deviation are not the values for the distribution itself, but of the underlying normal distribution it is derived from. .. note:: New code should use the ``lognormal`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- mean : float or array_like of floats, optional Mean value of the underlying normal distribution. Default is 0. sigma : float or array_like of floats, optional Standard deviation of the underlying normal distribution. Must be non-negative. Default is 1. size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. If size is ``None`` (default), a single value is returned if ``mean`` and ``sigma`` are both scalars. Otherwise, ``np.broadcast(mean, sigma).size`` samples are drawn. Returns ------- out : ndarray or scalar Drawn samples from the parameterized log-normal distribution. See Also -------- scipy.stats.lognorm : probability density function, distribution, cumulative density function, etc. Generator.lognormal: which should be used for new code. Notes ----- A variable `x` has a log-normal distribution if `log(x)` is normally distributed. The probability density function for the log-normal distribution is: .. math:: p(x) = \frac{1}{\sigma x \sqrt{2\pi}} e^{(-\frac{(ln(x)-\mu)^2}{2\sigma^2})} where :math:`\mu` is the mean and :math:`\sigma` is the standard deviation of the normally distributed logarithm of the variable. A log-normal distribution results if a random variable is the *product* of a large number of independent, identically-distributed variables in the same way that a normal distribution results if the variable is the *sum* of a large number of independent, identically-distributed variables. References ---------- .. [1] Limpert, E., Stahel, W. A., and Abbt, M., "Log-normal Distributions across the Sciences: Keys and Clues," BioScience, Vol. 51, No. 5, May, 2001. https://stat.ethz.ch/~stahel/lognormal/bioscience.pdf .. [2] Reiss, R.D. and Thomas, M., "Statistical Analysis of Extreme Values," Basel: Birkhauser Verlag, 2001, pp. 31-32. Examples -------- Draw samples from the distribution: >>> mu, sigma = 3., 1. # mean and standard deviation >>> s = np.random.lognormal(mu, sigma, 1000) Display the histogram of the samples, along with the probability density function: >>> import matplotlib.pyplot as plt >>> count, bins, ignored = plt.hist(s, 100, density=True, align='mid') >>> x = np.linspace(min(bins), max(bins), 10000) >>> pdf = (np.exp(-(np.log(x) - mu)**2 / (2 * sigma**2)) ... / (x * sigma * np.sqrt(2 * np.pi))) >>> plt.plot(x, pdf, linewidth=2, color='r') >>> plt.axis('tight') >>> plt.show() Demonstrate that taking the products of random samples from a uniform distribution can be fit well by a log-normal probability density function. >>> # Generate a thousand samples: each is the product of 100 random >>> # values, drawn from a normal distribution. >>> b = [] >>> for i in range(1000): ... a = 10. + np.random.standard_normal(100) ... b.append(np.product(a)) >>> b = np.array(b) / np.min(b) # scale values to be positive >>> count, bins, ignored = plt.hist(b, 100, density=True, align='mid') >>> sigma = np.std(np.log(b)) >>> mu = np.mean(np.log(b)) >>> x = np.linspace(min(bins), max(bins), 10000) >>> pdf = (np.exp(-(np.log(x) - mu)**2 / (2 * sigma**2)) ... / (x * sigma * np.sqrt(2 * np.pi))) >>> plt.plot(x, pdf, color='r', linewidth=2) >>> plt.show() logistic(loc=0.0, scale=1.0, size=None) Draw samples from a logistic distribution. Samples are drawn from a logistic distribution with specified parameters, loc (location or mean, also median), and scale (>0). .. note:: New code should use the ``logistic`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- loc : float or array_like of floats, optional Parameter of the distribution. Default is 0. scale : float or array_like of floats, optional Parameter of the distribution. Must be non-negative. Default is 1. size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. If size is ``None`` (default), a single value is returned if ``loc`` and ``scale`` are both scalars. Otherwise, ``np.broadcast(loc, scale).size`` samples are drawn. Returns ------- out : ndarray or scalar Drawn samples from the parameterized logistic distribution. See Also -------- scipy.stats.logistic : probability density function, distribution or cumulative density function, etc. Generator.logistic: which should be used for new code. Notes ----- The probability density for the Logistic distribution is .. math:: P(x) = P(x) = \frac{e^{-(x-\mu)/s}}{s(1+e^{-(x-\mu)/s})^2}, where :math:`\mu` = location and :math:`s` = scale. The Logistic distribution is used in Extreme Value problems where it can act as a mixture of Gumbel distributions, in Epidemiology, and by the World Chess Federation (FIDE) where it is used in the Elo ranking system, assuming the performance of each player is a logistically distributed random variable. References ---------- .. [1] Reiss, R.-D. and Thomas M. (2001), "Statistical Analysis of Extreme Values, from Insurance, Finance, Hydrology and Other Fields," Birkhauser Verlag, Basel, pp 132-133. .. [2] Weisstein, Eric W. "Logistic Distribution." From MathWorld--A Wolfram Web Resource. http://mathworld.wolfram.com/LogisticDistribution.html .. [3] Wikipedia, "Logistic-distribution", https://en.wikipedia.org/wiki/Logistic_distribution Examples -------- Draw samples from the distribution: >>> loc, scale = 10, 1 >>> s = np.random.logistic(loc, scale, 10000) >>> import matplotlib.pyplot as plt >>> count, bins, ignored = plt.hist(s, bins=50) # plot against distribution >>> def logist(x, loc, scale): ... return np.exp((loc-x)/scale)/(scale*(1+np.exp((loc-x)/scale))**2) >>> lgst_val = logist(bins, loc, scale) >>> plt.plot(bins, lgst_val * count.max() / lgst_val.max()) >>> plt.show() gumbel(loc=0.0, scale=1.0, size=None) Draw samples from a Gumbel distribution. Draw samples from a Gumbel distribution with specified location and scale. For more information on the Gumbel distribution, see Notes and References below. .. note:: New code should use the ``gumbel`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- loc : float or array_like of floats, optional The location of the mode of the distribution. Default is 0. scale : float or array_like of floats, optional The scale parameter of the distribution. Default is 1. Must be non- negative. size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. If size is ``None`` (default), a single value is returned if ``loc`` and ``scale`` are both scalars. Otherwise, ``np.broadcast(loc, scale).size`` samples are drawn. Returns ------- out : ndarray or scalar Drawn samples from the parameterized Gumbel distribution. See Also -------- scipy.stats.gumbel_l scipy.stats.gumbel_r scipy.stats.genextreme weibull Generator.gumbel: which should be used for new code. Notes ----- The Gumbel (or Smallest Extreme Value (SEV) or the Smallest Extreme Value Type I) distribution is one of a class of Generalized Extreme Value (GEV) distributions used in modeling extreme value problems. The Gumbel is a special case of the Extreme Value Type I distribution for maximums from distributions with "exponential-like" tails. The probability density for the Gumbel distribution is .. math:: p(x) = \frac{e^{-(x - \mu)/ \beta}}{\beta} e^{ -e^{-(x - \mu)/ \beta}}, where :math:`\mu` is the mode, a location parameter, and :math:`\beta` is the scale parameter. The Gumbel (named for German mathematician Emil Julius Gumbel) was used very early in the hydrology literature, for modeling the occurrence of flood events. It is also used for modeling maximum wind speed and rainfall rates. It is a "fat-tailed" distribution - the probability of an event in the tail of the distribution is larger than if one used a Gaussian, hence the surprisingly frequent occurrence of 100-year floods. Floods were initially modeled as a Gaussian process, which underestimated the frequency of extreme events. It is one of a class of extreme value distributions, the Generalized Extreme Value (GEV) distributions, which also includes the Weibull and Frechet. The function has a mean of :math:`\mu + 0.57721\beta` and a variance of :math:`\frac{\pi^2}{6}\beta^2`. References ---------- .. [1] Gumbel, E. J., "Statistics of Extremes," New York: Columbia University Press, 1958. .. [2] Reiss, R.-D. and Thomas, M., "Statistical Analysis of Extreme Values from Insurance, Finance, Hydrology and Other Fields," Basel: Birkhauser Verlag, 2001. Examples -------- Draw samples from the distribution: >>> mu, beta = 0, 0.1 # location and scale >>> s = np.random.gumbel(mu, beta, 1000) Display the histogram of the samples, along with the probability density function: >>> import matplotlib.pyplot as plt >>> count, bins, ignored = plt.hist(s, 30, density=True) >>> plt.plot(bins, (1/beta)*np.exp(-(bins - mu)/beta) ... * np.exp( -np.exp( -(bins - mu) /beta) ), ... linewidth=2, color='r') >>> plt.show() Show how an extreme value distribution can arise from a Gaussian process and compare to a Gaussian: >>> means = [] >>> maxima = [] >>> for i in range(0,1000) : ... a = np.random.normal(mu, beta, 1000) ... means.append(a.mean()) ... maxima.append(a.max()) >>> count, bins, ignored = plt.hist(maxima, 30, density=True) >>> beta = np.std(maxima) * np.sqrt(6) / np.pi >>> mu = np.mean(maxima) - 0.57721*beta >>> plt.plot(bins, (1/beta)*np.exp(-(bins - mu)/beta) ... * np.exp(-np.exp(-(bins - mu)/beta)), ... linewidth=2, color='r') >>> plt.plot(bins, 1/(beta * np.sqrt(2 * np.pi)) ... * np.exp(-(bins - mu)**2 / (2 * beta**2)), ... linewidth=2, color='g') >>> plt.show() laplace(loc=0.0, scale=1.0, size=None) Draw samples from the Laplace or double exponential distribution with specified location (or mean) and scale (decay). The Laplace distribution is similar to the Gaussian/normal distribution, but is sharper at the peak and has fatter tails. It represents the difference between two independent, identically distributed exponential random variables. .. note:: New code should use the ``laplace`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- loc : float or array_like of floats, optional The position, :math:`\mu`, of the distribution peak. Default is 0. scale : float or array_like of floats, optional :math:`\lambda`, the exponential decay. Default is 1. Must be non- negative. size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. If size is ``None`` (default), a single value is returned if ``loc`` and ``scale`` are both scalars. Otherwise, ``np.broadcast(loc, scale).size`` samples are drawn. Returns ------- out : ndarray or scalar Drawn samples from the parameterized Laplace distribution. See Also -------- Generator.laplace: which should be used for new code. Notes ----- It has the probability density function .. math:: f(x; \mu, \lambda) = \frac{1}{2\lambda} \exp\left(-\frac{|x - \mu|}{\lambda}\right). The first law of Laplace, from 1774, states that the frequency of an error can be expressed as an exponential function of the absolute magnitude of the error, which leads to the Laplace distribution. For many problems in economics and health sciences, this distribution seems to model the data better than the standard Gaussian distribution. References ---------- .. [1] Abramowitz, M. and Stegun, I. A. (Eds.). "Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables, 9th printing," New York: Dover, 1972. .. [2] Kotz, Samuel, et. al. "The Laplace Distribution and Generalizations, " Birkhauser, 2001. .. [3] Weisstein, Eric W. "Laplace Distribution." From MathWorld--A Wolfram Web Resource. http://mathworld.wolfram.com/LaplaceDistribution.html .. [4] Wikipedia, "Laplace distribution", https://en.wikipedia.org/wiki/Laplace_distribution Examples -------- Draw samples from the distribution >>> loc, scale = 0., 1. >>> s = np.random.laplace(loc, scale, 1000) Display the histogram of the samples, along with the probability density function: >>> import matplotlib.pyplot as plt >>> count, bins, ignored = plt.hist(s, 30, density=True) >>> x = np.arange(-8., 8., .01) >>> pdf = np.exp(-abs(x-loc)/scale)/(2.*scale) >>> plt.plot(x, pdf) Plot Gaussian for comparison: >>> g = (1/(scale * np.sqrt(2 * np.pi)) * ... np.exp(-(x - loc)**2 / (2 * scale**2))) >>> plt.plot(x,g) power(a, size=None) Draws samples in [0, 1] from a power distribution with positive exponent a - 1. Also known as the power function distribution. .. note:: New code should use the ``power`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- a : float or array_like of floats Parameter of the distribution. Must be non-negative. size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. If size is ``None`` (default), a single value is returned if ``a`` is a scalar. Otherwise, ``np.array(a).size`` samples are drawn. Returns ------- out : ndarray or scalar Drawn samples from the parameterized power distribution. Raises ------ ValueError If a < 1. See Also -------- Generator.power: which should be used for new code. Notes ----- The probability density function is .. math:: P(x; a) = ax^{a-1}, 0 \le x \le 1, a>0. The power function distribution is just the inverse of the Pareto distribution. It may also be seen as a special case of the Beta distribution. It is used, for example, in modeling the over-reporting of insurance claims. References ---------- .. [1] Christian Kleiber, Samuel Kotz, "Statistical size distributions in economics and actuarial sciences", Wiley, 2003. .. [2] Heckert, N. A. and Filliben, James J. "NIST Handbook 148: Dataplot Reference Manual, Volume 2: Let Subcommands and Library Functions", National Institute of Standards and Technology Handbook Series, June 2003. https://www.itl.nist.gov/div898/software/dataplot/refman2/auxillar/powpdf.pdf Examples -------- Draw samples from the distribution: >>> a = 5. # shape >>> samples = 1000 >>> s = np.random.power(a, samples) Display the histogram of the samples, along with the probability density function: >>> import matplotlib.pyplot as plt >>> count, bins, ignored = plt.hist(s, bins=30) >>> x = np.linspace(0, 1, 100) >>> y = a*x**(a-1.) >>> normed_y = samples*np.diff(bins)[0]*y >>> plt.plot(x, normed_y) >>> plt.show() Compare the power function distribution to the inverse of the Pareto. >>> from scipy import stats # doctest: +SKIP >>> rvs = np.random.power(5, 1000000) >>> rvsp = np.random.pareto(5, 1000000) >>> xx = np.linspace(0,1,100) >>> powpdf = stats.powerlaw.pdf(xx,5) # doctest: +SKIP >>> plt.figure() >>> plt.hist(rvs, bins=50, density=True) >>> plt.plot(xx,powpdf,'r-') # doctest: +SKIP >>> plt.title('np.random.power(5)') >>> plt.figure() >>> plt.hist(1./(1.+rvsp), bins=50, density=True) >>> plt.plot(xx,powpdf,'r-') # doctest: +SKIP >>> plt.title('inverse of 1 + np.random.pareto(5)') >>> plt.figure() >>> plt.hist(1./(1.+rvsp), bins=50, density=True) >>> plt.plot(xx,powpdf,'r-') # doctest: +SKIP >>> plt.title('inverse of stats.pareto(5)') weibull(a, size=None) Draw samples from a Weibull distribution. Draw samples from a 1-parameter Weibull distribution with the given shape parameter `a`. .. math:: X = (-ln(U))^{1/a} Here, U is drawn from the uniform distribution over (0,1]. The more common 2-parameter Weibull, including a scale parameter :math:`\lambda` is just :math:`X = \lambda(-ln(U))^{1/a}`. .. note:: New code should use the ``weibull`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- a : float or array_like of floats Shape parameter of the distribution. Must be nonnegative. size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. If size is ``None`` (default), a single value is returned if ``a`` is a scalar. Otherwise, ``np.array(a).size`` samples are drawn. Returns ------- out : ndarray or scalar Drawn samples from the parameterized Weibull distribution. See Also -------- scipy.stats.weibull_max scipy.stats.weibull_min scipy.stats.genextreme gumbel Generator.weibull: which should be used for new code. Notes ----- The Weibull (or Type III asymptotic extreme value distribution for smallest values, SEV Type III, or Rosin-Rammler distribution) is one of a class of Generalized Extreme Value (GEV) distributions used in modeling extreme value problems. This class includes the Gumbel and Frechet distributions. The probability density for the Weibull distribution is .. math:: p(x) = \frac{a} {\lambda}(\frac{x}{\lambda})^{a-1}e^{-(x/\lambda)^a}, where :math:`a` is the shape and :math:`\lambda` the scale. The function has its peak (the mode) at :math:`\lambda(\frac{a-1}{a})^{1/a}`. When ``a = 1``, the Weibull distribution reduces to the exponential distribution. References ---------- .. [1] Waloddi Weibull, Royal Technical University, Stockholm, 1939 "A Statistical Theory Of The Strength Of Materials", Ingeniorsvetenskapsakademiens Handlingar Nr 151, 1939, Generalstabens Litografiska Anstalts Forlag, Stockholm. .. [2] Waloddi Weibull, "A Statistical Distribution Function of Wide Applicability", Journal Of Applied Mechanics ASME Paper 1951. .. [3] Wikipedia, "Weibull distribution", https://en.wikipedia.org/wiki/Weibull_distribution Examples -------- Draw samples from the distribution: >>> a = 5. # shape >>> s = np.random.weibull(a, 1000) Display the histogram of the samples, along with the probability density function: >>> import matplotlib.pyplot as plt >>> x = np.arange(1,100.)/50. >>> def weib(x,n,a): ... return (a / n) * (x / n)**(a - 1) * np.exp(-(x / n)**a) >>> count, bins, ignored = plt.hist(np.random.weibull(5.,1000)) >>> x = np.arange(1,100.)/50. >>> scale = count.max()/weib(x, 1., 5.).max() >>> plt.plot(x, weib(x, 1., 5.)*scale) >>> plt.show() pareto(a, size=None) Draw samples from a Pareto II or Lomax distribution with specified shape. The Lomax or Pareto II distribution is a shifted Pareto distribution. The classical Pareto distribution can be obtained from the Lomax distribution by adding 1 and multiplying by the scale parameter ``m`` (see Notes). The smallest value of the Lomax distribution is zero while for the classical Pareto distribution it is ``mu``, where the standard Pareto distribution has location ``mu = 1``. Lomax can also be considered as a simplified version of the Generalized Pareto distribution (available in SciPy), with the scale set to one and the location set to zero. The Pareto distribution must be greater than zero, and is unbounded above. It is also known as the "80-20 rule". In this distribution, 80 percent of the weights are in the lowest 20 percent of the range, while the other 20 percent fill the remaining 80 percent of the range. .. note:: New code should use the ``pareto`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- a : float or array_like of floats Shape of the distribution. Must be positive. size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. If size is ``None`` (default), a single value is returned if ``a`` is a scalar. Otherwise, ``np.array(a).size`` samples are drawn. Returns ------- out : ndarray or scalar Drawn samples from the parameterized Pareto distribution. See Also -------- scipy.stats.lomax : probability density function, distribution or cumulative density function, etc. scipy.stats.genpareto : probability density function, distribution or cumulative density function, etc. Generator.pareto: which should be used for new code. Notes ----- The probability density for the Pareto distribution is .. math:: p(x) = \frac{am^a}{x^{a+1}} where :math:`a` is the shape and :math:`m` the scale. The Pareto distribution, named after the Italian economist Vilfredo Pareto, is a power law probability distribution useful in many real world problems. Outside the field of economics it is generally referred to as the Bradford distribution. Pareto developed the distribution to describe the distribution of wealth in an economy. It has also found use in insurance, web page access statistics, oil field sizes, and many other problems, including the download frequency for projects in Sourceforge [1]_. It is one of the so-called "fat-tailed" distributions. References ---------- .. [1] Francis Hunt and Paul Johnson, On the Pareto Distribution of Sourceforge projects. .. [2] Pareto, V. (1896). Course of Political Economy. Lausanne. .. [3] Reiss, R.D., Thomas, M.(2001), Statistical Analysis of Extreme Values, Birkhauser Verlag, Basel, pp 23-30. .. [4] Wikipedia, "Pareto distribution", https://en.wikipedia.org/wiki/Pareto_distribution Examples -------- Draw samples from the distribution: >>> a, m = 3., 2. # shape and mode >>> s = (np.random.pareto(a, 1000) + 1) * m Display the histogram of the samples, along with the probability density function: >>> import matplotlib.pyplot as plt >>> count, bins, _ = plt.hist(s, 100, density=True) >>> fit = a*m**a / bins**(a+1) >>> plt.plot(bins, max(count)*fit/max(fit), linewidth=2, color='r') >>> plt.show() vonmises(mu, kappa, size=None) Draw samples from a von Mises distribution. Samples are drawn from a von Mises distribution with specified mode (mu) and dispersion (kappa), on the interval [-pi, pi]. The von Mises distribution (also known as the circular normal distribution) is a continuous probability distribution on the unit circle. It may be thought of as the circular analogue of the normal distribution. .. note:: New code should use the ``vonmises`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- mu : float or array_like of floats Mode ("center") of the distribution. kappa : float or array_like of floats Dispersion of the distribution, has to be >=0. size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. If size is ``None`` (default), a single value is returned if ``mu`` and ``kappa`` are both scalars. Otherwise, ``np.broadcast(mu, kappa).size`` samples are drawn. Returns ------- out : ndarray or scalar Drawn samples from the parameterized von Mises distribution. See Also -------- scipy.stats.vonmises : probability density function, distribution, or cumulative density function, etc. Generator.vonmises: which should be used for new code. Notes ----- The probability density for the von Mises distribution is .. math:: p(x) = \frac{e^{\kappa cos(x-\mu)}}{2\pi I_0(\kappa)}, where :math:`\mu` is the mode and :math:`\kappa` the dispersion, and :math:`I_0(\kappa)` is the modified Bessel function of order 0. The von Mises is named for Richard Edler von Mises, who was born in Austria-Hungary, in what is now the Ukraine. He fled to the United States in 1939 and became a professor at Harvard. He worked in probability theory, aerodynamics, fluid mechanics, and philosophy of science. References ---------- .. [1] Abramowitz, M. and Stegun, I. A. (Eds.). "Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables, 9th printing," New York: Dover, 1972. .. [2] von Mises, R., "Mathematical Theory of Probability and Statistics", New York: Academic Press, 1964. Examples -------- Draw samples from the distribution: >>> mu, kappa = 0.0, 4.0 # mean and dispersion >>> s = np.random.vonmises(mu, kappa, 1000) Display the histogram of the samples, along with the probability density function: >>> import matplotlib.pyplot as plt >>> from scipy.special import i0 # doctest: +SKIP >>> plt.hist(s, 50, density=True) >>> x = np.linspace(-np.pi, np.pi, num=51) >>> y = np.exp(kappa*np.cos(x-mu))/(2*np.pi*i0(kappa)) # doctest: +SKIP >>> plt.plot(x, y, linewidth=2, color='r') # doctest: +SKIP >>> plt.show() standard_t(df, size=None) Draw samples from a standard Student's t distribution with `df` degrees of freedom. A special case of the hyperbolic distribution. As `df` gets large, the result resembles that of the standard normal distribution (`standard_normal`). .. note:: New code should use the ``standard_t`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- df : float or array_like of floats Degrees of freedom, must be > 0. size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. If size is ``None`` (default), a single value is returned if ``df`` is a scalar. Otherwise, ``np.array(df).size`` samples are drawn. Returns ------- out : ndarray or scalar Drawn samples from the parameterized standard Student's t distribution. See Also -------- Generator.standard_t: which should be used for new code. Notes ----- The probability density function for the t distribution is .. math:: P(x, df) = \frac{\Gamma(\frac{df+1}{2})}{\sqrt{\pi df} \Gamma(\frac{df}{2})}\Bigl( 1+\frac{x^2}{df} \Bigr)^{-(df+1)/2} The t test is based on an assumption that the data come from a Normal distribution. The t test provides a way to test whether the sample mean (that is the mean calculated from the data) is a good estimate of the true mean. The derivation of the t-distribution was first published in 1908 by William Gosset while working for the Guinness Brewery in Dublin. Due to proprietary issues, he had to publish under a pseudonym, and so he used the name Student. References ---------- .. [1] Dalgaard, Peter, "Introductory Statistics With R", Springer, 2002. .. [2] Wikipedia, "Student's t-distribution" https://en.wikipedia.org/wiki/Student's_t-distribution Examples -------- From Dalgaard page 83 [1]_, suppose the daily energy intake for 11 women in kilojoules (kJ) is: >>> intake = np.array([5260., 5470, 5640, 6180, 6390, 6515, 6805, 7515, \ ... 7515, 8230, 8770]) Does their energy intake deviate systematically from the recommended value of 7725 kJ? We have 10 degrees of freedom, so is the sample mean within 95% of the recommended value? >>> s = np.random.standard_t(10, size=100000) >>> np.mean(intake) 6753.636363636364 >>> intake.std(ddof=1) 1142.1232221373727 Calculate the t statistic, setting the ddof parameter to the unbiased value so the divisor in the standard deviation will be degrees of freedom, N-1. >>> t = (np.mean(intake)-7725)/(intake.std(ddof=1)/np.sqrt(len(intake))) >>> import matplotlib.pyplot as plt >>> h = plt.hist(s, bins=100, density=True) For a one-sided t-test, how far out in the distribution does the t statistic appear? >>> np.sum(s>> import matplotlib.pyplot as plt >>> s = np.random.standard_cauchy(1000000) >>> s = s[(s>-25) & (s<25)] # truncate distribution so it plots well >>> plt.hist(s, bins=100) >>> plt.show() noncentral_chisquare(df, nonc, size=None) Draw samples from a noncentral chi-square distribution. The noncentral :math:`\chi^2` distribution is a generalization of the :math:`\chi^2` distribution. .. note:: New code should use the ``noncentral_chisquare`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- df : float or array_like of floats Degrees of freedom, must be > 0. .. versionchanged:: 1.10.0 Earlier NumPy versions required dfnum > 1. nonc : float or array_like of floats Non-centrality, must be non-negative. size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. If size is ``None`` (default), a single value is returned if ``df`` and ``nonc`` are both scalars. Otherwise, ``np.broadcast(df, nonc).size`` samples are drawn. Returns ------- out : ndarray or scalar Drawn samples from the parameterized noncentral chi-square distribution. See Also -------- Generator.noncentral_chisquare: which should be used for new code. Notes ----- The probability density function for the noncentral Chi-square distribution is .. math:: P(x;df,nonc) = \sum^{\infty}_{i=0} \frac{e^{-nonc/2}(nonc/2)^{i}}{i!} P_{Y_{df+2i}}(x), where :math:`Y_{q}` is the Chi-square with q degrees of freedom. References ---------- .. [1] Wikipedia, "Noncentral chi-squared distribution" https://en.wikipedia.org/wiki/Noncentral_chi-squared_distribution Examples -------- Draw values from the distribution and plot the histogram >>> import matplotlib.pyplot as plt >>> values = plt.hist(np.random.noncentral_chisquare(3, 20, 100000), ... bins=200, density=True) >>> plt.show() Draw values from a noncentral chisquare with very small noncentrality, and compare to a chisquare. >>> plt.figure() >>> values = plt.hist(np.random.noncentral_chisquare(3, .0000001, 100000), ... bins=np.arange(0., 25, .1), density=True) >>> values2 = plt.hist(np.random.chisquare(3, 100000), ... bins=np.arange(0., 25, .1), density=True) >>> plt.plot(values[1][0:-1], values[0]-values2[0], 'ob') >>> plt.show() Demonstrate how large values of non-centrality lead to a more symmetric distribution. >>> plt.figure() >>> values = plt.hist(np.random.noncentral_chisquare(3, 20, 100000), ... bins=200, density=True) >>> plt.show() chisquare(df, size=None) Draw samples from a chi-square distribution. When `df` independent random variables, each with standard normal distributions (mean 0, variance 1), are squared and summed, the resulting distribution is chi-square (see Notes). This distribution is often used in hypothesis testing. .. note:: New code should use the ``chisquare`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- df : float or array_like of floats Number of degrees of freedom, must be > 0. size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. If size is ``None`` (default), a single value is returned if ``df`` is a scalar. Otherwise, ``np.array(df).size`` samples are drawn. Returns ------- out : ndarray or scalar Drawn samples from the parameterized chi-square distribution. Raises ------ ValueError When `df` <= 0 or when an inappropriate `size` (e.g. ``size=-1``) is given. See Also -------- Generator.chisquare: which should be used for new code. Notes ----- The variable obtained by summing the squares of `df` independent, standard normally distributed random variables: .. math:: Q = \sum_{i=0}^{\mathtt{df}} X^2_i is chi-square distributed, denoted .. math:: Q \sim \chi^2_k. The probability density function of the chi-squared distribution is .. math:: p(x) = \frac{(1/2)^{k/2}}{\Gamma(k/2)} x^{k/2 - 1} e^{-x/2}, where :math:`\Gamma` is the gamma function, .. math:: \Gamma(x) = \int_0^{-\infty} t^{x - 1} e^{-t} dt. References ---------- .. [1] NIST "Engineering Statistics Handbook" https://www.itl.nist.gov/div898/handbook/eda/section3/eda3666.htm Examples -------- >>> np.random.chisquare(2,4) array([ 1.89920014, 9.00867716, 3.13710533, 5.62318272]) # random noncentral_f(dfnum, dfden, nonc, size=None) Draw samples from the noncentral F distribution. Samples are drawn from an F distribution with specified parameters, `dfnum` (degrees of freedom in numerator) and `dfden` (degrees of freedom in denominator), where both parameters > 1. `nonc` is the non-centrality parameter. .. note:: New code should use the ``noncentral_f`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- dfnum : float or array_like of floats Numerator degrees of freedom, must be > 0. .. versionchanged:: 1.14.0 Earlier NumPy versions required dfnum > 1. dfden : float or array_like of floats Denominator degrees of freedom, must be > 0. nonc : float or array_like of floats Non-centrality parameter, the sum of the squares of the numerator means, must be >= 0. size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. If size is ``None`` (default), a single value is returned if ``dfnum``, ``dfden``, and ``nonc`` are all scalars. Otherwise, ``np.broadcast(dfnum, dfden, nonc).size`` samples are drawn. Returns ------- out : ndarray or scalar Drawn samples from the parameterized noncentral Fisher distribution. See Also -------- Generator.noncentral_f: which should be used for new code. Notes ----- When calculating the power of an experiment (power = probability of rejecting the null hypothesis when a specific alternative is true) the non-central F statistic becomes important. When the null hypothesis is true, the F statistic follows a central F distribution. When the null hypothesis is not true, then it follows a non-central F statistic. References ---------- .. [1] Weisstein, Eric W. "Noncentral F-Distribution." From MathWorld--A Wolfram Web Resource. http://mathworld.wolfram.com/NoncentralF-Distribution.html .. [2] Wikipedia, "Noncentral F-distribution", https://en.wikipedia.org/wiki/Noncentral_F-distribution Examples -------- In a study, testing for a specific alternative to the null hypothesis requires use of the Noncentral F distribution. We need to calculate the area in the tail of the distribution that exceeds the value of the F distribution for the null hypothesis. We'll plot the two probability distributions for comparison. >>> dfnum = 3 # between group deg of freedom >>> dfden = 20 # within groups degrees of freedom >>> nonc = 3.0 >>> nc_vals = np.random.noncentral_f(dfnum, dfden, nonc, 1000000) >>> NF = np.histogram(nc_vals, bins=50, density=True) >>> c_vals = np.random.f(dfnum, dfden, 1000000) >>> F = np.histogram(c_vals, bins=50, density=True) >>> import matplotlib.pyplot as plt >>> plt.plot(F[1][1:], F[0]) >>> plt.plot(NF[1][1:], NF[0]) >>> plt.show() f(dfnum, dfden, size=None) Draw samples from an F distribution. Samples are drawn from an F distribution with specified parameters, `dfnum` (degrees of freedom in numerator) and `dfden` (degrees of freedom in denominator), where both parameters must be greater than zero. The random variate of the F distribution (also known as the Fisher distribution) is a continuous probability distribution that arises in ANOVA tests, and is the ratio of two chi-square variates. .. note:: New code should use the ``f`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- dfnum : float or array_like of floats Degrees of freedom in numerator, must be > 0. dfden : float or array_like of float Degrees of freedom in denominator, must be > 0. size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. If size is ``None`` (default), a single value is returned if ``dfnum`` and ``dfden`` are both scalars. Otherwise, ``np.broadcast(dfnum, dfden).size`` samples are drawn. Returns ------- out : ndarray or scalar Drawn samples from the parameterized Fisher distribution. See Also -------- scipy.stats.f : probability density function, distribution or cumulative density function, etc. Generator.f: which should be used for new code. Notes ----- The F statistic is used to compare in-group variances to between-group variances. Calculating the distribution depends on the sampling, and so it is a function of the respective degrees of freedom in the problem. The variable `dfnum` is the number of samples minus one, the between-groups degrees of freedom, while `dfden` is the within-groups degrees of freedom, the sum of the number of samples in each group minus the number of groups. References ---------- .. [1] Glantz, Stanton A. "Primer of Biostatistics.", McGraw-Hill, Fifth Edition, 2002. .. [2] Wikipedia, "F-distribution", https://en.wikipedia.org/wiki/F-distribution Examples -------- An example from Glantz[1], pp 47-40: Two groups, children of diabetics (25 people) and children from people without diabetes (25 controls). Fasting blood glucose was measured, case group had a mean value of 86.1, controls had a mean value of 82.2. Standard deviations were 2.09 and 2.49 respectively. Are these data consistent with the null hypothesis that the parents diabetic status does not affect their children's blood glucose levels? Calculating the F statistic from the data gives a value of 36.01. Draw samples from the distribution: >>> dfnum = 1. # between group degrees of freedom >>> dfden = 48. # within groups degrees of freedom >>> s = np.random.f(dfnum, dfden, 1000) The lower bound for the top 1% of the samples is : >>> np.sort(s)[-10] 7.61988120985 # random So there is about a 1% chance that the F statistic will exceed 7.62, the measured value is 36, so the null hypothesis is rejected at the 1% level. gamma(shape, scale=1.0, size=None) Draw samples from a Gamma distribution. Samples are drawn from a Gamma distribution with specified parameters, `shape` (sometimes designated "k") and `scale` (sometimes designated "theta"), where both parameters are > 0. .. note:: New code should use the ``gamma`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- shape : float or array_like of floats The shape of the gamma distribution. Must be non-negative. scale : float or array_like of floats, optional The scale of the gamma distribution. Must be non-negative. Default is equal to 1. size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. If size is ``None`` (default), a single value is returned if ``shape`` and ``scale`` are both scalars. Otherwise, ``np.broadcast(shape, scale).size`` samples are drawn. Returns ------- out : ndarray or scalar Drawn samples from the parameterized gamma distribution. See Also -------- scipy.stats.gamma : probability density function, distribution or cumulative density function, etc. Generator.gamma: which should be used for new code. Notes ----- The probability density for the Gamma distribution is .. math:: p(x) = x^{k-1}\frac{e^{-x/\theta}}{\theta^k\Gamma(k)}, where :math:`k` is the shape and :math:`\theta` the scale, and :math:`\Gamma` is the Gamma function. The Gamma distribution is often used to model the times to failure of electronic components, and arises naturally in processes for which the waiting times between Poisson distributed events are relevant. References ---------- .. [1] Weisstein, Eric W. "Gamma Distribution." From MathWorld--A Wolfram Web Resource. http://mathworld.wolfram.com/GammaDistribution.html .. [2] Wikipedia, "Gamma distribution", https://en.wikipedia.org/wiki/Gamma_distribution Examples -------- Draw samples from the distribution: >>> shape, scale = 2., 2. # mean=4, std=2*sqrt(2) >>> s = np.random.gamma(shape, scale, 1000) Display the histogram of the samples, along with the probability density function: >>> import matplotlib.pyplot as plt >>> import scipy.special as sps # doctest: +SKIP >>> count, bins, ignored = plt.hist(s, 50, density=True) >>> y = bins**(shape-1)*(np.exp(-bins/scale) / # doctest: +SKIP ... (sps.gamma(shape)*scale**shape)) >>> plt.plot(bins, y, linewidth=2, color='r') # doctest: +SKIP >>> plt.show() standard_gamma(shape, size=None) Draw samples from a standard Gamma distribution. Samples are drawn from a Gamma distribution with specified parameters, shape (sometimes designated "k") and scale=1. .. note:: New code should use the ``standard_gamma`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- shape : float or array_like of floats Parameter, must be non-negative. size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. If size is ``None`` (default), a single value is returned if ``shape`` is a scalar. Otherwise, ``np.array(shape).size`` samples are drawn. Returns ------- out : ndarray or scalar Drawn samples from the parameterized standard gamma distribution. See Also -------- scipy.stats.gamma : probability density function, distribution or cumulative density function, etc. Generator.standard_gamma: which should be used for new code. Notes ----- The probability density for the Gamma distribution is .. math:: p(x) = x^{k-1}\frac{e^{-x/\theta}}{\theta^k\Gamma(k)}, where :math:`k` is the shape and :math:`\theta` the scale, and :math:`\Gamma` is the Gamma function. The Gamma distribution is often used to model the times to failure of electronic components, and arises naturally in processes for which the waiting times between Poisson distributed events are relevant. References ---------- .. [1] Weisstein, Eric W. "Gamma Distribution." From MathWorld--A Wolfram Web Resource. http://mathworld.wolfram.com/GammaDistribution.html .. [2] Wikipedia, "Gamma distribution", https://en.wikipedia.org/wiki/Gamma_distribution Examples -------- Draw samples from the distribution: >>> shape, scale = 2., 1. # mean and width >>> s = np.random.standard_gamma(shape, 1000000) Display the histogram of the samples, along with the probability density function: >>> import matplotlib.pyplot as plt >>> import scipy.special as sps # doctest: +SKIP >>> count, bins, ignored = plt.hist(s, 50, density=True) >>> y = bins**(shape-1) * ((np.exp(-bins/scale))/ # doctest: +SKIP ... (sps.gamma(shape) * scale**shape)) >>> plt.plot(bins, y, linewidth=2, color='r') # doctest: +SKIP >>> plt.show() normal(loc=0.0, scale=1.0, size=None) Draw random samples from a normal (Gaussian) distribution. The probability density function of the normal distribution, first derived by De Moivre and 200 years later by both Gauss and Laplace independently [2]_, is often called the bell curve because of its characteristic shape (see the example below). The normal distributions occurs often in nature. For example, it describes the commonly occurring distribution of samples influenced by a large number of tiny, random disturbances, each with its own unique distribution [2]_. .. note:: New code should use the ``normal`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- loc : float or array_like of floats Mean ("centre") of the distribution. scale : float or array_like of floats Standard deviation (spread or "width") of the distribution. Must be non-negative. size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. If size is ``None`` (default), a single value is returned if ``loc`` and ``scale`` are both scalars. Otherwise, ``np.broadcast(loc, scale).size`` samples are drawn. Returns ------- out : ndarray or scalar Drawn samples from the parameterized normal distribution. See Also -------- scipy.stats.norm : probability density function, distribution or cumulative density function, etc. Generator.normal: which should be used for new code. Notes ----- The probability density for the Gaussian distribution is .. math:: p(x) = \frac{1}{\sqrt{ 2 \pi \sigma^2 }} e^{ - \frac{ (x - \mu)^2 } {2 \sigma^2} }, where :math:`\mu` is the mean and :math:`\sigma` the standard deviation. The square of the standard deviation, :math:`\sigma^2`, is called the variance. The function has its peak at the mean, and its "spread" increases with the standard deviation (the function reaches 0.607 times its maximum at :math:`x + \sigma` and :math:`x - \sigma` [2]_). This implies that normal is more likely to return samples lying close to the mean, rather than those far away. References ---------- .. [1] Wikipedia, "Normal distribution", https://en.wikipedia.org/wiki/Normal_distribution .. [2] P. R. Peebles Jr., "Central Limit Theorem" in "Probability, Random Variables and Random Signal Principles", 4th ed., 2001, pp. 51, 51, 125. Examples -------- Draw samples from the distribution: >>> mu, sigma = 0, 0.1 # mean and standard deviation >>> s = np.random.normal(mu, sigma, 1000) Verify the mean and the variance: >>> abs(mu - np.mean(s)) 0.0 # may vary >>> abs(sigma - np.std(s, ddof=1)) 0.1 # may vary Display the histogram of the samples, along with the probability density function: >>> import matplotlib.pyplot as plt >>> count, bins, ignored = plt.hist(s, 30, density=True) >>> plt.plot(bins, 1/(sigma * np.sqrt(2 * np.pi)) * ... np.exp( - (bins - mu)**2 / (2 * sigma**2) ), ... linewidth=2, color='r') >>> plt.show() Two-by-four array of samples from N(3, 6.25): >>> np.random.normal(3, 2.5, size=(2, 4)) array([[-4.49401501, 4.00950034, -1.81814867, 7.29718677], # random [ 0.39924804, 4.68456316, 4.99394529, 4.84057254]]) # random standard_normal(size=None) Draw samples from a standard Normal distribution (mean=0, stdev=1). .. note:: New code should use the ``standard_normal`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. Default is None, in which case a single value is returned. Returns ------- out : float or ndarray A floating-point array of shape ``size`` of drawn samples, or a single sample if ``size`` was not specified. See Also -------- normal : Equivalent function with additional ``loc`` and ``scale`` arguments for setting the mean and standard deviation. Generator.standard_normal: which should be used for new code. Notes ----- For random samples from :math:`N(\mu, \sigma^2)`, use one of:: mu + sigma * np.random.standard_normal(size=...) np.random.normal(mu, sigma, size=...) Examples -------- >>> np.random.standard_normal() 2.1923875335537315 #random >>> s = np.random.standard_normal(8000) >>> s array([ 0.6888893 , 0.78096262, -0.89086505, ..., 0.49876311, # random -0.38672696, -0.4685006 ]) # random >>> s.shape (8000,) >>> s = np.random.standard_normal(size=(3, 4, 2)) >>> s.shape (3, 4, 2) Two-by-four array of samples from :math:`N(3, 6.25)`: >>> 3 + 2.5 * np.random.standard_normal(size=(2, 4)) array([[-4.49401501, 4.00950034, -1.81814867, 7.29718677], # random [ 0.39924804, 4.68456316, 4.99394529, 4.84057254]]) # random random_integers(low, high=None, size=None) Random integers of type `np.int_` between `low` and `high`, inclusive. Return random integers of type `np.int_` from the "discrete uniform" distribution in the closed interval [`low`, `high`]. If `high` is None (the default), then results are from [1, `low`]. The `np.int_` type translates to the C long integer type and its precision is platform dependent. This function has been deprecated. Use randint instead. .. deprecated:: 1.11.0 Parameters ---------- low : int Lowest (signed) integer to be drawn from the distribution (unless ``high=None``, in which case this parameter is the *highest* such integer). high : int, optional If provided, the largest (signed) integer to be drawn from the distribution (see above for behavior if ``high=None``). size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. Default is None, in which case a single value is returned. Returns ------- out : int or ndarray of ints `size`-shaped array of random integers from the appropriate distribution, or a single such random int if `size` not provided. See Also -------- randint : Similar to `random_integers`, only for the half-open interval [`low`, `high`), and 0 is the lowest value if `high` is omitted. Notes ----- To sample from N evenly spaced floating-point numbers between a and b, use:: a + (b - a) * (np.random.random_integers(N) - 1) / (N - 1.) Examples -------- >>> np.random.random_integers(5) 4 # random >>> type(np.random.random_integers(5)) >>> np.random.random_integers(5, size=(3,2)) array([[5, 4], # random [3, 3], [4, 5]]) Choose five random numbers from the set of five evenly-spaced numbers between 0 and 2.5, inclusive (*i.e.*, from the set :math:`{0, 5/8, 10/8, 15/8, 20/8}`): >>> 2.5 * (np.random.random_integers(5, size=(5,)) - 1) / 4. array([ 0.625, 1.25 , 0.625, 0.625, 2.5 ]) # random Roll two six sided dice 1000 times and sum the results: >>> d1 = np.random.random_integers(1, 6, 1000) >>> d2 = np.random.random_integers(1, 6, 1000) >>> dsums = d1 + d2 Display results as a histogram: >>> import matplotlib.pyplot as plt >>> count, bins, ignored = plt.hist(dsums, 11, density=True) >>> plt.show() randn(d0, d1, ..., dn) Return a sample (or samples) from the "standard normal" distribution. .. note:: This is a convenience function for users porting code from Matlab, and wraps `standard_normal`. That function takes a tuple to specify the size of the output, which is consistent with other NumPy functions like `numpy.zeros` and `numpy.ones`. .. note:: New code should use the ``standard_normal`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. If positive int_like arguments are provided, `randn` generates an array of shape ``(d0, d1, ..., dn)``, filled with random floats sampled from a univariate "normal" (Gaussian) distribution of mean 0 and variance 1. A single float randomly sampled from the distribution is returned if no argument is provided. Parameters ---------- d0, d1, ..., dn : int, optional The dimensions of the returned array, must be non-negative. If no argument is given a single Python float is returned. Returns ------- Z : ndarray or float A ``(d0, d1, ..., dn)``-shaped array of floating-point samples from the standard normal distribution, or a single such float if no parameters were supplied. See Also -------- standard_normal : Similar, but takes a tuple as its argument. normal : Also accepts mu and sigma arguments. Generator.standard_normal: which should be used for new code. Notes ----- For random samples from :math:`N(\mu, \sigma^2)`, use: ``sigma * np.random.randn(...) + mu`` Examples -------- >>> np.random.randn() 2.1923875335537315 # random Two-by-four array of samples from N(3, 6.25): >>> 3 + 2.5 * np.random.randn(2, 4) array([[-4.49401501, 4.00950034, -1.81814867, 7.29718677], # random [ 0.39924804, 4.68456316, 4.99394529, 4.84057254]]) # random rand(d0, d1, ..., dn) Random values in a given shape. .. note:: This is a convenience function for users porting code from Matlab, and wraps `random_sample`. That function takes a tuple to specify the size of the output, which is consistent with other NumPy functions like `numpy.zeros` and `numpy.ones`. Create an array of the given shape and populate it with random samples from a uniform distribution over ``[0, 1)``. Parameters ---------- d0, d1, ..., dn : int, optional The dimensions of the returned array, must be non-negative. If no argument is given a single Python float is returned. Returns ------- out : ndarray, shape ``(d0, d1, ..., dn)`` Random values. See Also -------- random Examples -------- >>> np.random.rand(3,2) array([[ 0.14022471, 0.96360618], #random [ 0.37601032, 0.25528411], #random [ 0.49313049, 0.94909878]]) #random uniform(low=0.0, high=1.0, size=None) Draw samples from a uniform distribution. Samples are uniformly distributed over the half-open interval ``[low, high)`` (includes low, but excludes high). In other words, any value within the given interval is equally likely to be drawn by `uniform`. .. note:: New code should use the ``uniform`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- low : float or array_like of floats, optional Lower boundary of the output interval. All values generated will be greater than or equal to low. The default value is 0. high : float or array_like of floats Upper boundary of the output interval. All values generated will be less than or equal to high. The default value is 1.0. size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. If size is ``None`` (default), a single value is returned if ``low`` and ``high`` are both scalars. Otherwise, ``np.broadcast(low, high).size`` samples are drawn. Returns ------- out : ndarray or scalar Drawn samples from the parameterized uniform distribution. See Also -------- randint : Discrete uniform distribution, yielding integers. random_integers : Discrete uniform distribution over the closed interval ``[low, high]``. random_sample : Floats uniformly distributed over ``[0, 1)``. random : Alias for `random_sample`. rand : Convenience function that accepts dimensions as input, e.g., ``rand(2,2)`` would generate a 2-by-2 array of floats, uniformly distributed over ``[0, 1)``. Generator.uniform: which should be used for new code. Notes ----- The probability density function of the uniform distribution is .. math:: p(x) = \frac{1}{b - a} anywhere within the interval ``[a, b)``, and zero elsewhere. When ``high`` == ``low``, values of ``low`` will be returned. If ``high`` < ``low``, the results are officially undefined and may eventually raise an error, i.e. do not rely on this function to behave when passed arguments satisfying that inequality condition. The ``high`` limit may be included in the returned array of floats due to floating-point rounding in the equation ``low + (high-low) * random_sample()``. For example: >>> x = np.float32(5*0.99999999) >>> x 5.0 Examples -------- Draw samples from the distribution: >>> s = np.random.uniform(-1,0,1000) All values are within the given interval: >>> np.all(s >= -1) True >>> np.all(s < 0) True Display the histogram of the samples, along with the probability density function: >>> import matplotlib.pyplot as plt >>> count, bins, ignored = plt.hist(s, 15, density=True) >>> plt.plot(bins, np.ones_like(bins), linewidth=2, color='r') >>> plt.show() choice(a, size=None, replace=True, p=None) Generates a random sample from a given 1-D array .. versionadded:: 1.7.0 .. note:: New code should use the ``choice`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- a : 1-D array-like or int If an ndarray, a random sample is generated from its elements. If an int, the random sample is generated as if a were np.arange(a) size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. Default is None, in which case a single value is returned. replace : boolean, optional Whether the sample is with or without replacement p : 1-D array-like, optional The probabilities associated with each entry in a. If not given the sample assumes a uniform distribution over all entries in a. Returns ------- samples : single item or ndarray The generated random samples Raises ------ ValueError If a is an int and less than zero, if a or p are not 1-dimensional, if a is an array-like of size 0, if p is not a vector of probabilities, if a and p have different lengths, or if replace=False and the sample size is greater than the population size See Also -------- randint, shuffle, permutation Generator.choice: which should be used in new code Notes ----- Sampling random rows from a 2-D array is not possible with this function, but is possible with `Generator.choice` through its ``axis`` keyword. Examples -------- Generate a uniform random sample from np.arange(5) of size 3: >>> np.random.choice(5, 3) array([0, 3, 4]) # random >>> #This is equivalent to np.random.randint(0,5,3) Generate a non-uniform random sample from np.arange(5) of size 3: >>> np.random.choice(5, 3, p=[0.1, 0, 0.3, 0.6, 0]) array([3, 3, 0]) # random Generate a uniform random sample from np.arange(5) of size 3 without replacement: >>> np.random.choice(5, 3, replace=False) array([3,1,0]) # random >>> #This is equivalent to np.random.permutation(np.arange(5))[:3] Generate a non-uniform random sample from np.arange(5) of size 3 without replacement: >>> np.random.choice(5, 3, replace=False, p=[0.1, 0, 0.3, 0.6, 0]) array([2, 3, 0]) # random Any of the above can be repeated with an arbitrary array-like instead of just integers. For instance: >>> aa_milne_arr = ['pooh', 'rabbit', 'piglet', 'Christopher'] >>> np.random.choice(aa_milne_arr, 5, p=[0.5, 0.1, 0.1, 0.3]) array(['pooh', 'pooh', 'pooh', 'Christopher', 'piglet'], # random dtype='>> np.random.bytes(10) ' eh\x85\x022SZ\xbf\xa4' #random randint(low, high=None, size=None, dtype=int) Return random integers from `low` (inclusive) to `high` (exclusive). Return random integers from the "discrete uniform" distribution of the specified dtype in the "half-open" interval [`low`, `high`). If `high` is None (the default), then results are from [0, `low`). .. note:: New code should use the ``integers`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- low : int or array-like of ints Lowest (signed) integers to be drawn from the distribution (unless ``high=None``, in which case this parameter is one above the *highest* such integer). high : int or array-like of ints, optional If provided, one above the largest (signed) integer to be drawn from the distribution (see above for behavior if ``high=None``). If array-like, must contain integer values size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. Default is None, in which case a single value is returned. dtype : dtype, optional Desired dtype of the result. Byteorder must be native. The default value is int. .. versionadded:: 1.11.0 Returns ------- out : int or ndarray of ints `size`-shaped array of random integers from the appropriate distribution, or a single such random int if `size` not provided. See Also -------- random_integers : similar to `randint`, only for the closed interval [`low`, `high`], and 1 is the lowest value if `high` is omitted. Generator.integers: which should be used for new code. Examples -------- >>> np.random.randint(2, size=10) array([1, 0, 0, 0, 1, 1, 0, 0, 1, 0]) # random >>> np.random.randint(1, size=10) array([0, 0, 0, 0, 0, 0, 0, 0, 0, 0]) Generate a 2 x 4 array of ints between 0 and 4, inclusive: >>> np.random.randint(5, size=(2, 4)) array([[4, 0, 2, 1], # random [3, 2, 2, 0]]) Generate a 1 x 3 array with 3 different upper bounds >>> np.random.randint(1, [3, 5, 10]) array([2, 2, 9]) # random Generate a 1 by 3 array with 3 different lower bounds >>> np.random.randint([1, 5, 7], 10) array([9, 8, 7]) # random Generate a 2 by 4 array using broadcasting with dtype of uint8 >>> np.random.randint([1, 3, 5, 7], [[10], [20]], dtype=np.uint8) array([[ 8, 6, 9, 7], # random [ 1, 16, 9, 12]], dtype=uint8) tomaxint(size=None) Return a sample of uniformly distributed random integers in the interval [0, ``np.iinfo(np.int_).max``]. The `np.int_` type translates to the C long integer type and its precision is platform dependent. Parameters ---------- size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. Default is None, in which case a single value is returned. Returns ------- out : ndarray Drawn samples, with shape `size`. See Also -------- randint : Uniform sampling over a given half-open interval of integers. random_integers : Uniform sampling over a given closed interval of integers. Examples -------- >>> rs = np.random.RandomState() # need a RandomState object >>> rs.tomaxint((2,2,2)) array([[[1170048599, 1600360186], # random [ 739731006, 1947757578]], [[1871712945, 752307660], [1601631370, 1479324245]]]) >>> rs.tomaxint((2,2,2)) < np.iinfo(np.int_).max array([[[ True, True], [ True, True]], [[ True, True], [ True, True]]]) standard_exponential(size=None) Draw samples from the standard exponential distribution. `standard_exponential` is identical to the exponential distribution with a scale parameter of 1. .. note:: New code should use the ``standard_exponential`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. Default is None, in which case a single value is returned. Returns ------- out : float or ndarray Drawn samples. See Also -------- Generator.standard_exponential: which should be used for new code. Examples -------- Output a 3x8000 array: >>> n = np.random.standard_exponential((3, 8000)) exponential(scale=1.0, size=None) Draw samples from an exponential distribution. Its probability density function is .. math:: f(x; \frac{1}{\beta}) = \frac{1}{\beta} \exp(-\frac{x}{\beta}), for ``x > 0`` and 0 elsewhere. :math:`\beta` is the scale parameter, which is the inverse of the rate parameter :math:`\lambda = 1/\beta`. The rate parameter is an alternative, widely used parameterization of the exponential distribution [3]_. The exponential distribution is a continuous analogue of the geometric distribution. It describes many common situations, such as the size of raindrops measured over many rainstorms [1]_, or the time between page requests to Wikipedia [2]_. .. note:: New code should use the ``exponential`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- scale : float or array_like of floats The scale parameter, :math:`\beta = 1/\lambda`. Must be non-negative. size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. If size is ``None`` (default), a single value is returned if ``scale`` is a scalar. Otherwise, ``np.array(scale).size`` samples are drawn. Returns ------- out : ndarray or scalar Drawn samples from the parameterized exponential distribution. See Also -------- Generator.exponential: which should be used for new code. References ---------- .. [1] Peyton Z. Peebles Jr., "Probability, Random Variables and Random Signal Principles", 4th ed, 2001, p. 57. .. [2] Wikipedia, "Poisson process", https://en.wikipedia.org/wiki/Poisson_process .. [3] Wikipedia, "Exponential distribution", https://en.wikipedia.org/wiki/Exponential_distribution beta(a, b, size=None) Draw samples from a Beta distribution. The Beta distribution is a special case of the Dirichlet distribution, and is related to the Gamma distribution. It has the probability distribution function .. math:: f(x; a,b) = \frac{1}{B(\alpha, \beta)} x^{\alpha - 1} (1 - x)^{\beta - 1}, where the normalization, B, is the beta function, .. math:: B(\alpha, \beta) = \int_0^1 t^{\alpha - 1} (1 - t)^{\beta - 1} dt. It is often seen in Bayesian inference and order statistics. .. note:: New code should use the ``beta`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- a : float or array_like of floats Alpha, positive (>0). b : float or array_like of floats Beta, positive (>0). size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. If size is ``None`` (default), a single value is returned if ``a`` and ``b`` are both scalars. Otherwise, ``np.broadcast(a, b).size`` samples are drawn. Returns ------- out : ndarray or scalar Drawn samples from the parameterized beta distribution. See Also -------- Generator.beta: which should be used for new code. random(size=None) Return random floats in the half-open interval [0.0, 1.0). Alias for `random_sample` to ease forward-porting to the new random API. random_sample(size=None) Return random floats in the half-open interval [0.0, 1.0). Results are from the "continuous uniform" distribution over the stated interval. To sample :math:`Unif[a, b), b > a` multiply the output of `random_sample` by `(b-a)` and add `a`:: (b - a) * random_sample() + a .. note:: New code should use the ``random`` method of a ``default_rng()`` instance instead; please see the :ref:`random-quick-start`. Parameters ---------- size : int or tuple of ints, optional Output shape. If the given shape is, e.g., ``(m, n, k)``, then ``m * n * k`` samples are drawn. Default is None, in which case a single value is returned. Returns ------- out : float or ndarray of floats Array of random floats of shape `size` (unless ``size=None``, in which case a single float is returned). See Also -------- Generator.random: which should be used for new code. Examples -------- >>> np.random.random_sample() 0.47108547995356098 # random >>> type(np.random.random_sample()) >>> np.random.random_sample((5,)) array([ 0.30220482, 0.86820401, 0.1654503 , 0.11659149, 0.54323428]) # random Three-by-two array of random numbers from [-5, 0): >>> 5 * np.random.random_sample((3, 2)) - 5 array([[-3.99149989, -0.52338984], # random [-2.99091858, -0.79479508], [-1.23204345, -1.75224494]]) set_state(state) Set the internal state of the generator from a tuple. For use if one has reason to manually (re-)set the internal state of the bit generator used by the RandomState instance. By default, RandomState uses the "Mersenne Twister"[1]_ pseudo-random number generating algorithm. Parameters ---------- state : {tuple(str, ndarray of 624 uints, int, int, float), dict} The `state` tuple has the following items: 1. the string 'MT19937', specifying the Mersenne Twister algorithm. 2. a 1-D array of 624 unsigned integers ``keys``. 3. an integer ``pos``. 4. an integer ``has_gauss``. 5. a float ``cached_gaussian``. If state is a dictionary, it is directly set using the BitGenerators `state` property. Returns ------- out : None Returns 'None' on success. See Also -------- get_state Notes ----- `set_state` and `get_state` are not needed to work with any of the random distributions in NumPy. If the internal state is manually altered, the user should know exactly what he/she is doing. For backwards compatibility, the form (str, array of 624 uints, int) is also accepted although it is missing some information about the cached Gaussian value: ``state = ('MT19937', keys, pos)``. References ---------- .. [1] M. Matsumoto and T. Nishimura, "Mersenne Twister: A 623-dimensionally equidistributed uniform pseudorandom number generator," *ACM Trans. on Modeling and Computer Simulation*, Vol. 8, No. 1, pp. 3-30, Jan. 1998. get_state() Return a tuple representing the internal state of the generator. For more details, see `set_state`. Parameters ---------- legacy : bool, optional Flag indicating to return a legacy tuple state when the BitGenerator is MT19937, instead of a dict. Returns ------- out : {tuple(str, ndarray of 624 uints, int, int, float), dict} The returned tuple has the following items: 1. the string 'MT19937'. 2. a 1-D array of 624 unsigned integer keys. 3. an integer ``pos``. 4. an integer ``has_gauss``. 5. a float ``cached_gaussian``. If `legacy` is False, or the BitGenerator is not MT19937, then state is returned as a dictionary. See Also -------- set_state Notes ----- `set_state` and `get_state` are not needed to work with any of the random distributions in NumPy. If the internal state is manually altered, the user should know exactly what he/she is doing. seed(self, seed=None) Reseed a legacy MT19937 BitGenerator Notes ----- This is a convenience, legacy function. The best practice is to **not** reseed a BitGenerator, rather to recreate a new one. This method is here for legacy reasons. This example demonstrates best practice. >>> from numpy.random import MT19937 >>> from numpy.random import RandomState, SeedSequence >>> rs = RandomState(MT19937(SeedSequence(123456789))) # Later, you want to restart the stream >>> rs = RandomState(MT19937(SeedSequence(987654321))) @)x))))))X)))))))))))H))))))))X)X)))))X))))))))))))))))))))))))))X)X))X)X))X)X)))))X)))X))))))P)H))P)H))))))H)))8)))H)))))h))P)))8))@))@A))&) )p )>) ) x) p)$h)`)X) P) H) !@) 8)`i"0)`() i" ))@)h"))h')@ )!)`h") h")`$)g,) *)-)%)))`$)  ) ))`x)p) (h)%`)!X)`P) H)(@)`,8)g'0) (()# ) )#) )`!)) )))))@G) L) )`g!)` )x))))) x) g0p)h)&`)f5X)tP)pH)X@) 8)N0) ()l )s).)H))l) )))))$)$) ) )X)))B)B)Uj)()x)p)h) `)4X) P) H)`L @)e8)e0) @3 ()8  ))^)))h)@%)))W))),),)&)&) ) ) 1 )d)P) )x)P p) h)``) X) P)p H)p @)8)0) 2 () )) )I)))@& )) ) )J)\) ) )u)x)B)B) ) ))x)p)1h)`);X)0 P)H)@)8)0)()p )) )) ) )@ )) )))X)%))T)T)h)h)` )) )0x)p)h)`)  X)PP)PH)@) 8) 0) ()`?  ) ) )) ) ) ))L) ))))@#))) )X ) )))` x)` p) h)@`)@X) P)H)@) 8)0)() )))G )@ )))`))))) )0 )0 )3 ))) ~e)})P)Px)p)}'h)"`) X) P)x H)@)8)0)() )n)P )P )))H)H) )p)H)))@` )#)@)p)))))x)p)h)`)`qX)@P)@H)TE @)8)0)u() ))`)`)I )))@))))))h )h )? ))8)0)  )X )x)p)h)`)X)P)H) @)8)0)@=}()  ) )=?)))()()]))))))~)P)P) )))))x)| p)@h)@`)tX) P) H) / @)8)0)P().! )@) )H ) )7)y)p ))3))S) ) ) [ )y)))))))0 x)p)h)8 `)8 X) P)jH)j@)i: 8)e0)e()(  )))@ )/)z)`)`)  ) )p0D `))0pN!]jw0PY){`)@y)Wr)P q)Kk)? c)6 _)bY)0'`N)K)G?)Q`2)-)0`%)`@)&0}`)/y)v( s( p( 0l(Pi(e(c(`(P](pZ(W@y(Tk(0Q](MJ(0J>(F,(D"(@(w@ (*O`'!'Ц@'У' Р@''~ 'kP'P`'P '''1'J'GCC: (GNU) 4.4.7 20120313 (Red Hat 4.4.7-23)GCC: (GNU) 8.3.1 20190311 (Red Hat 8.3.1-3)`.081     .x4{'{'{'|'}'''@) p*3 Pm pX)) E yG   (  _   )= ~e 0x v P   ( {B V k `  x) b' !Q !  p"|' "d> `%x[ %Y~ @'[ ) * p,h -? .U p/mj)r / p1 3h p4 5 @7W 8* `:@=)N)V)kp)h) )) @^))%P)5)D )i)xX))@)  D) ) FyH)X)h)  0JyP)X))  My" ) 9  0Qyq )  T ) ) )  W% `)<  pZs @)  P]^ ) ) ) )  )   `O )[ )h )u )  cZ )  e^( )7 )F ) ]  Pi )  0l ) ) ) `)(2 )B  p^t @)  sP ) )  )  v7)N yy)  0}a) a8)O ) ^)))  =)U)l *0)) 0`()<x)M)h)y) B ()@)#)1)? V Pjo   ()   0 C )Q)d)u) P @)x)))#8)3)A)O)h)8))p)() pX@)`@) )),)<)Q)j)yh))))))))6h)N)j)}))))))) )/)[)j)0))()x))3p)B`)RX)bP)r`)H)@)h)8)`)%0)5p)X()hx) )8)))) )2)B)n)~))))p))/)[)k){))))))))")@)P)v)))))h)`):)J)v))x))p)0)h)`))0X)@p)kP){h)))h)))@)-`)[)pX))))) `)7 X)o P) ) )!)@!)w!)!)!x)"p)R"h)"H)"@)"8)#()P#)u#)#)#P)#x)$) $)!$)3$)M$)Y$h)j$)$)$)$)$ )$)$)%)%)1%)O%)_%)x%)%X)%)%)%@)%) &))&)=&)V&)t&P)&)&)&@)&)&)')')-'x)K'p)d'h)')'`)'X)')'P)'H)().(@)G(8)e()w(0)(()(8)( )()( ) ))%))C))W))p)))))))))h)))*)0* )L*)e*)*)*)*)*)*) +)'+)8+)Q+)o+0)+)+)+)+)+x),),p)/,h)M,)],`)v,X),x),P),H),X),@)-8)#-@)3-0)L-()j-(){- )-)-)-)-).).):.)M.)f.).@).).).).)/)/),/)J/)d/)}/)/)/)/)/) 0)#0)A0p)[0)t0x)0X)0p)0h)0)0`) 1X)*1)<1P)U1H)s1h)1@)18)1P)10)1()2 )2 ).2)L2)[2X)y2 ) 2) 2)2)2)2P)38)"3)63H)L38)X3)h3)|3)3)3x)3)30)3)3)4x)4`);4)W4)v4)4)4()4)4)4)4p)4P)58)5 ))5)C5)[5)j5)}5`)58)5 )5)5)5)5)6h)/6P)D6)Y6)k6`)~6H)6)6)6P)6H)60)6X)$7)N7h)z7)7@)7)7 )$8H)O8)w8)8@)80)80)9)E9)n9`)9)90)9x):)::p)f:`):0):):);x)9;8)d;););0); )<)/<)[<H)<8)<)<)=)2=H)^=H)=()=X)=) > )5>)]>)>)>)>)?)-?)V?)?)?()?)?))@)T@)@`)@@)@)@)$A)PA){AH)A)A)A)&B)OB)zB)B)B)Bp)!C)LC)wC)CX)C)Cp)#D)OD)yD()D)DP)D)!E)ME)\E E)E)E E)E)F PF)iF)F)F)F)FP)F)F)G))G)BG)`G)nG)}G) G 0 Gx)G)G)H)'HH)6H)OH)mHp)H )H H)H)I()#I)P)lP0)P()P)P) P w!Q):Q)XQ()fQ)Qx)Q)Qp)Qh)Q`)QX)RP)6RH)TR@)mR8)R`)R)R`)(R)R)R S)(S PeS)uS)S)SP)S)S)S)TH)TP)T)+T) BT xT)Tx)T)T)T)T 0U KU P9U0)U()U )U)U`) V)"V)@V)YV)wV)V)V )V8)V)V ' W@)9W8)WWx)lW)~W)W`)WX)WP)WH)W0)X 0'(FX)YXp)rXh)X)X`)XX)X@)XP)YH)%Y@)>Y8)\YH)lY)Y)Y)Y)Y)Y)Y0)Z()1Z)(HZ )aZ)Z)Z)Z)Z)Z)Z)[)([)F[)V[)o[)[)[)[ O9%\@) \)%\)C\)\\)z\H)\)\)\) \ u ]0)]()8])K]p)\]p)n] ~]p)] ] )^)5^)N^)l^h){^)^)^X)^)^)^)_)._)G_)e_)u_)_0)_)_@)(_8)_)_ Р` )/` Уd`){` Ц`)`)`)` (a) ?a Iva)a)a)a)a)a)b)b)9b)Hb)ab)b)bx)b()bp)bh)bh) c )$c)Bc)Rc)kc)c@)c)c)c)c)c)d).dH)Edx)Ud)dd)}d)d)d)d)d) e)e`)4eX)Re)geP)eH)e)e@)e8)e0)f()f@)(6f)Of)mf)f)f)f)f)f)g)g):gx)Kg)bg)qg)g)hg @Ag g &g  h p $h >Mh  ]h oh $h h h  h !i 5i `i"]i `i i"i i @i h"j :j h'bj @ j !j `h"j h"j `$(k g,Pk *yk -k %k k l `$>l  dl l l `l l (m %Fm !mm `m  m (m `,n g'/n (Xn #n  n #n  n `!o @o  fo o o o o @Go L!p  3p `g![p ` np xzp p p p  p g0p q &/q f5Wq tcq poq X}q  q Nq  q lq sq .q Hq q lr  r )r (r $5r  Fr Xnr r r Br Ujr (r s s  $s 4Ms  _s `L s es @3 s 8 s s ^s t t h%t @%Nt )wt Wt t ,t &t  t 1 t dt Pu u u P 0u  >u `Ju Xu  eu p yu u 2 u u u  u Iu u @& v -v  ?v Jgv \sv  v uv xv Bv v  w w +w 1Sw ^w ;mwX)~w 0 w w w w w w pw w  x x  x  0x @ Cx Px  ax ox X{x %x x Tx hx ` x x  x 0 y y /y (? Z,("( Ϗ(: @ ([ A`'{'G @' ' -@'Jh'1 ' ')`' g '1 ']ݒ''hB'hju w  @){'֓ @{' `" `, `6 `? `H `Q `[ `$e `o ` x ` `jo{'|'.@)͔'  #4F[g G y Ц`˕ PsSԕ > ЋS  l'$1>Miz p& 0/˖ݖ)6M`)x m p}9ٗ h(   @)'  <O_ `x @p( ^ zĘ٘ P,u   s}' BUc y ęEؙ `" j/>Wj Nz y Pq&Ӛ zI `Z-> Rc {   ˛ݛ Ќ?  K&3 `WGb ~qΜޜ @o ->J^l ȝ؝  0 *>Qa n y z%ў @ߞ0  PN? m>Ncu 0|2 `'П()& Ї< 0jR pWjx  b   ՠ p  0z +@)7IY Pm?f (t s  q/ˡס l {9/ ? K 0/gs ~ q nWƢ }Q `& EVh  PtY 0 ͣޣ g  @z9* p<P` @9~ yƤפ o.J[ @:u  m&˥ 0ݥ%7DU"q w 09 ppѦ/usr/lib/../lib64/crti.ocall_gmon_startmtrand.c__pyx_f_5numpy_6random_6mtrand_11RandomState__reset_gauss__pyx_tp_new_5numpy_6random_6mtrand_RandomState__pyx_vtabptr_5numpy_6random_6mtrand_RandomState__pyx_empty_tuple__pyx_tp_traverse_5numpy_6random_6mtrand_RandomState__pyx_tp_clear_5numpy_6random_6mtrand_RandomState__pyx_getprop_5numpy_6random_6mtrand_11RandomState__bit_generator__Pyx_PyCFunction_FastCall__Pyx_ErrRestoreInState__Pyx__ExceptionSave__Pyx_PyObject_Call__Pyx_PyObject_GetAttrStr__Pyx_PyFunction_FastCallNoKw__pyx_pyframe_localsplus_offset__Pyx_PyNumber_IntOrLongWrongResultType__Pyx_PyInt_As_int__Pyx_PyObject_LookupSpecial__Pyx__GetException__pyx_tp_dealloc_5numpy_6random_6mtrand_RandomState__pyx_f_5numpy_6random_6mtrand_11RandomState__shuffle_raw__Pyx_ImportType__Pyx_copy_spec_to_module__Pyx_ImportVoidPtr__Pyx_ImportFunction__Pyx_Import__pyx_m__pyx_pymod_createmain_interpreter_id.21296__pyx_setprop_5numpy_6random_6mtrand_11RandomState__bit_generator__Pyx__ExceptionReset.isra.5__Pyx_PyInt_NeObjC.isra.16__Pyx_PyUnicode_Equals__Pyx_PyDict_GetItem.part.29__Pyx_GetItemInt_Fast.constprop.35__Pyx_ParseOptionalKeywords.constprop.36__Pyx_Raise.constprop.37__Pyx_PyObject_GetSlice.isra.19.constprop.39__Pyx_PyFunction_FastCallDict.constprop.40__Pyx_PyErr_GivenExceptionMatchesTuple__Pyx_TypeTest.isra.7__Pyx_GetBuiltinName__pyx_b__Pyx_PyInt_As_Py_intptr_t.part.26__Pyx_PyInt_As_int64_t.part.27__Pyx__PyObject_CallOneArg__Pyx_PyInt_As_long__Pyx_IternextUnpackEndCheck__Pyx_IterFinish__Pyx_PyObject_CallNoArg__Pyx_AddTraceback__pyx_code_cache__pyx_d__pyx_cython_runtime__pyx_dict_version.22150__pyx_dict_cached_value.22151__pyx_n_s_cline_in_traceback__pyx_empty_bytes__pyx_pw_5numpy_6random_6mtrand_11RandomState_83wald__pyx_kp_u__12__pyx_float_0_0__pyx_n_u_scale__pyx_n_u_mean__pyx_f_5numpy_6random_7_common_cont__pyx_n_s_mean__pyx_n_s_scale__pyx_n_s_size__pyx_pyargnames.18713__pyx_pw_5numpy_6random_6mtrand_11RandomState_81rayleigh__pyx_float_1_0__pyx_pyargnames.18655__pyx_pw_5numpy_6random_6mtrand_11RandomState_79lognormal__pyx_n_u_sigma__pyx_n_s_sigma__pyx_pyargnames.18593__pyx_pw_5numpy_6random_6mtrand_11RandomState_77logistic__pyx_n_u_loc__pyx_n_s_loc__pyx_pyargnames.18530__pyx_pw_5numpy_6random_6mtrand_11RandomState_75gumbel__pyx_pyargnames.18467__pyx_pw_5numpy_6random_6mtrand_11RandomState_73laplace__pyx_pyargnames.18404__pyx_pw_5numpy_6random_6mtrand_11RandomState_71power__pyx_n_u_a__pyx_n_s_a__pyx_pyargnames.18348__pyx_pw_5numpy_6random_6mtrand_11RandomState_69weibull__pyx_pyargnames.18293__pyx_pw_5numpy_6random_6mtrand_11RandomState_67pareto__pyx_pyargnames.18238__pyx_pw_5numpy_6random_6mtrand_11RandomState_65vonmises__pyx_n_u_kappa__pyx_n_u_mu__pyx_n_s_mu__pyx_n_s_kappa__pyx_pyargnames.18180__pyx_pw_5numpy_6random_6mtrand_11RandomState_63standard_t__pyx_int_0__pyx_n_u_df__pyx_n_s_df__pyx_pyargnames.18124__pyx_pw_5numpy_6random_6mtrand_11RandomState_61standard_cauchy__pyx_pyargnames.18072__pyx_pw_5numpy_6random_6mtrand_11RandomState_59noncentral_chisquare__pyx_n_u_nonc__pyx_n_s_nonc__pyx_pyargnames.18015__pyx_pw_5numpy_6random_6mtrand_11RandomState_57chisquare__pyx_pyargnames.17959__pyx_pw_5numpy_6random_6mtrand_11RandomState_55noncentral_f__pyx_n_u_dfden__pyx_n_u_dfnum__pyx_n_s_dfnum__pyx_pyargnames.17898__pyx_n_s_dfden__pyx_pw_5numpy_6random_6mtrand_11RandomState_53f__pyx_pyargnames.17838__pyx_pw_5numpy_6random_6mtrand_11RandomState_51gamma__pyx_n_u_shape__pyx_n_s_shape__pyx_pyargnames.17777__pyx_pw_5numpy_6random_6mtrand_11RandomState_49standard_gamma__pyx_pyargnames.17721__pyx_pw_5numpy_6random_6mtrand_11RandomState_47normal__pyx_pyargnames.17659__pyx_pw_5numpy_6random_6mtrand_11RandomState_45standard_normal__pyx_pyargnames.17606__pyx_pw_5numpy_6random_6mtrand_11RandomState_27standard_exponential__pyx_pyargnames.16242__pyx_pw_5numpy_6random_6mtrand_11RandomState_25exponential__pyx_pyargnames.16186__pyx_pw_5numpy_6random_6mtrand_11RandomState_23beta__pyx_n_u_b__pyx_n_s_b__pyx_pyargnames.16128__pyx_pw_5numpy_6random_6mtrand_11RandomState_21random__pyx_n_s_random_sample__pyx_pyargnames.16071__pyx_pw_5numpy_6random_6mtrand_11RandomState_19random_sample__pyx_f_5numpy_6random_7_common_double_fill__pyx_pyargnames.16020__pyx_pw_5numpy_6random_6mtrand_11RandomState_11__reduce____pyx_n_s_get_state__pyx_n_s_legacy__pyx_n_s_randomstate_ctor__pyx_n_s_pickle__pyx_n_u_bit_generator__pyx_pw_5numpy_6random_6mtrand_11RandomState_7__getstate____pyx_pw_5numpy_6random_6mtrand_11RandomState_5__str____pyx_n_s_class__pyx_n_s_name__pyx_kp_u__3__pyx_kp_u__4__Pyx_PyObject_GetItem__Pyx_PyObject_Call2Args__Pyx_PyInt_As_int64_t__Pyx_PyInt_As_Py_intptr_t__pyx_pw_5numpy_6random_6mtrand_11RandomState_9__setstate____pyx_n_s_set_state__Pyx_PyObject_CallOneArg__pyx_pw_5numpy_6random_6mtrand_11RandomState_3__repr____pyx_n_s_str__pyx_kp_u_at_0x_X__pyx_n_s_format__pyx_builtin_id__Pyx__GetModuleGlobalName__pyx_pw_5numpy_6random_6mtrand_11RandomState_15get_state__pyx_n_s_state__pyx_n_u_MT19937_2__pyx_n_u_has_gauss__pyx_n_u_gauss__pyx_n_u_state__pyx_n_u_key__pyx_n_u_pos__pyx_dict_version.15916__pyx_dict_cached_value.15917__pyx_n_s_warn__pyx_tuple__6__pyx_pyargnames.15879__pyx_n_s_warnings__pyx_pymod_exec_mtrand__pyx_string_tab__pyx_float_1eneg_8__pyx_int_1__pyx_int_4294967296__pyx_int_neg_1__pyx_n_s_ValueError__pyx_builtin_ValueError__pyx_n_s_main__pyx_n_s_id__pyx_n_s_TypeError__pyx_builtin_TypeError__pyx_n_s_RuntimeWarning__pyx_builtin_RuntimeWarning__pyx_n_s_range__pyx_n_s_DeprecationWarning__pyx_builtin_DeprecationWarning__pyx_n_s_OverflowError__pyx_builtin_OverflowError__pyx_n_s_reversed__pyx_n_s_IndexError__pyx_builtin_IndexError__pyx_n_s_ImportError__pyx_builtin_ImportError__pyx_n_u_l__pyx_tuple___pyx_kp_u_Invalid_bit_generator_The_bit_ge__pyx_tuple__2__pyx_kp_u_can_only_re_seed_a_MT19937_BitGe__pyx_tuple__5__pyx_kp_u_get_state_and_legacy_can_only_be__pyx_kp_u_state_dictionary_is_not_valid__pyx_tuple__7__pyx_kp_u_state_must_be_a_dict_or_a_tuple__pyx_tuple__8__pyx_kp_u_set_state_can_only_be_used_with__pyx_tuple__9__pyx_tuple__10__pyx_tuple__11__pyx_tuple__13__pyx_kp_u_Providing_a_dtype_with_a_non_nat__pyx_tuple__15__pyx_tuple__16__pyx_kp_u_a_must_be_1_dimensional_or_an_in__pyx_tuple__17__pyx_kp_u_a_must_be_greater_than_0_unless__pyx_tuple__18__pyx_kp_u_a_must_be_1_dimensional__pyx_tuple__19__pyx_kp_u_a_cannot_be_empty_unless_no_sam__pyx_tuple__20__pyx_kp_u_p_must_be_1_dimensional__pyx_tuple__21__pyx_kp_u_a_and_p_must_have_same_size__pyx_tuple__22__pyx_kp_u_probabilities_contain_NaN__pyx_tuple__23__pyx_kp_u_probabilities_are_not_non_negati__pyx_tuple__24__pyx_kp_u_probabilities_do_not_sum_to_1__pyx_tuple__25__pyx_kp_u_Cannot_take_a_larger_sample_than__pyx_tuple__26__pyx_kp_u_Negative_dimensions_are_not_allo__pyx_tuple__27__pyx_kp_u_Fewer_non_zero_entries_in_p_than__pyx_tuple__28__pyx_tuple__29__pyx_kp_u_Range_exceeds_valid_bounds__pyx_tuple__30__pyx_kp_u_left_mode__pyx_tuple__31__pyx_kp_u_mode_right__pyx_tuple__32__pyx_kp_u_left_right__pyx_tuple__33__pyx_kp_u_ngood_nbad_nsample__pyx_tuple__34__pyx_kp_u_mean_must_be_1_dimensional__pyx_tuple__35__pyx_kp_u_cov_must_be_2_dimensional_and_sq__pyx_tuple__36__pyx_kp_u_mean_and_cov_must_have_same_leng__pyx_tuple__37__pyx_slice__38__pyx_kp_u_check_valid_must_equal_warn_rais__pyx_tuple__39__pyx_kp_u_covariance_is_not_positive_semid__pyx_tuple__40__pyx_tuple__41__pyx_tuple__42__pyx_kp_u_sum_pvals_1_1_0__pyx_tuple__43__pyx_kp_u_alpha_0__pyx_tuple__44__pyx_tuple__45__pyx_kp_u_x_must_be_an_integer_or_at_least__pyx_tuple__46__pyx_kp_u_numpy_core_multiarray_failed_to__pyx_tuple__47__pyx_kp_u_numpy_core_umath_failed_to_impor__pyx_n_s_kwargs__pyx_n_s_args__pyx_n_s_sample__pyx_kp_s_mtrand_pyx__pyx_n_s_ranf__pyx_vtable_5numpy_6random_6mtrand_RandomState__pyx_type_5numpy_6random_6mtrand_RandomState__pyx_n_s_pyx_vtable__pyx_n_s_RandomState__pyx_ptype_5numpy_6random_6mtrand_RandomState__pyx_ptype_5numpy_dtype__pyx_ptype_5numpy_broadcast__pyx_ptype_5numpy_ndarray__pyx_vp_5numpy_6random_7_common_POISSON_LAM_MAX__pyx_vp_5numpy_6random_7_common_LEGACY_POISSON_LAM_MAX__pyx_vp_5numpy_6random_7_common_MAXSIZE__pyx_f_5numpy_6random_17_bounded_integers__rand_uint64__pyx_f_5numpy_6random_17_bounded_integers__rand_uint32__pyx_f_5numpy_6random_17_bounded_integers__rand_uint16__pyx_f_5numpy_6random_17_bounded_integers__rand_uint8__pyx_f_5numpy_6random_17_bounded_integers__rand_bool__pyx_f_5numpy_6random_17_bounded_integers__rand_int64__pyx_f_5numpy_6random_17_bounded_integers__rand_int32__pyx_f_5numpy_6random_17_bounded_integers__rand_int16__pyx_f_5numpy_6random_17_bounded_integers__rand_int8__pyx_f_5numpy_6random_7_common_check_constraint__pyx_f_5numpy_6random_7_common_check_array_constraint__pyx_f_5numpy_6random_7_common_kahan_sum__pyx_f_5numpy_6random_7_common_validate_output_shape__pyx_f_5numpy_6random_7_common_disc__pyx_f_5numpy_6random_7_common_cont_broadcast_3__pyx_f_5numpy_6random_7_common_discrete_broadcast_iii__pyx_n_s_operator__pyx_n_s_numpy__pyx_n_s_np__pyx_n_s_MT19937_2__pyx_n_s_mt19937__pyx_n_s_poisson_lam_max__pyx_k__14__pyx_n_s_rand_2__pyx_dict_version.21338__pyx_dict_cached_value.21339__pyx_n_s_beta__pyx_n_s_MT19937PyArray_API__pyx_dict_version.21342__pyx_dict_cached_value.21343__pyx_n_s_binomial__pyx_dict_version.21346__pyx_dict_cached_value.21347__pyx_n_s_bytes__pyx_dict_version.21350__pyx_dict_cached_value.21351__pyx_n_s_chisquare__pyx_dict_version.21354__pyx_dict_cached_value.21355__pyx_n_s_choice__pyx_dict_version.21358__pyx_dict_cached_value.21359__pyx_n_s_dirichlet__pyx_dict_version.21362__pyx_dict_cached_value.21363__pyx_n_s_exponential__pyx_dict_version.21366__pyx_dict_cached_value.21367__pyx_n_s_f__pyx_dict_version.21370__pyx_dict_cached_value.21371__pyx_n_s_gamma__pyx_dict_version.21374__pyx_dict_cached_value.21375__pyx_dict_version.21378__pyx_dict_cached_value.21379__pyx_n_s_geometric__pyx_dict_version.21382__pyx_dict_cached_value.21383__pyx_n_s_gumbel__pyx_dict_version.21386__pyx_dict_cached_value.21387__pyx_n_s_hypergeometric__pyx_dict_version.21390__pyx_dict_cached_value.21391__pyx_n_s_laplace__pyx_dict_version.21394__pyx_dict_cached_value.21395__pyx_n_s_logistic__pyx_dict_version.21398__pyx_dict_cached_value.21399__pyx_n_s_lognormal__pyx_dict_version.21402__pyx_dict_cached_value.21403__pyx_n_s_logseries__pyx_dict_version.21406__pyx_dict_cached_value.21407__pyx_n_s_multinomial__pyx_dict_version.21410__pyx_dict_cached_value.21411__pyx_n_s_multivariate_normal__pyx_dict_version.21414__pyx_dict_cached_value.21415__pyx_n_s_negative_binomial__pyx_dict_version.21418__pyx_dict_cached_value.21419__pyx_n_s_noncentral_chisquare__pyx_dict_version.21422__pyx_dict_cached_value.21423__pyx_n_s_noncentral_f__pyx_dict_version.21426__pyx_dict_cached_value.21427__pyx_n_s_normal__pyx_dict_version.21430__pyx_dict_cached_value.21431__pyx_n_s_pareto__pyx_dict_version.21434__pyx_dict_cached_value.21435__pyx_n_s_permutation__pyx_dict_version.21438__pyx_dict_cached_value.21439__pyx_n_s_poisson__pyx_dict_version.21442__pyx_dict_cached_value.21443__pyx_n_s_power__pyx_dict_version.21446__pyx_dict_cached_value.21447__pyx_n_s_rand__pyx_dict_version.21450__pyx_dict_cached_value.21451__pyx_n_s_randint__pyx_dict_version.21454__pyx_dict_cached_value.21455__pyx_n_s_randn__pyx_dict_version.21458__pyx_dict_cached_value.21459__pyx_n_s_random__pyx_dict_version.21462__pyx_dict_cached_value.21463__pyx_n_s_random_integers__pyx_dict_version.21466__pyx_dict_cached_value.21467__pyx_dict_version.21470__pyx_dict_cached_value.21471__pyx_n_s_rayleigh__pyx_dict_version.21474__pyx_dict_cached_value.21475__pyx_n_s_seed__pyx_dict_version.21478__pyx_dict_cached_value.21479__pyx_dict_version.21482__pyx_dict_cached_value.21483__pyx_n_s_shuffle__pyx_dict_version.21486__pyx_dict_cached_value.21487__pyx_n_s_standard_cauchy__pyx_dict_version.21490__pyx_dict_cached_value.21491__pyx_n_s_standard_exponential__pyx_dict_version.21494__pyx_dict_cached_value.21495__pyx_n_s_standard_gamma__pyx_dict_version.21498__pyx_dict_cached_value.21499__pyx_n_s_standard_normal__pyx_dict_version.21502__pyx_dict_cached_value.21503__pyx_n_s_standard_t__pyx_dict_version.21506__pyx_dict_cached_value.21507__pyx_n_s_triangular__pyx_dict_version.21510__pyx_dict_cached_value.21511__pyx_n_s_uniform__pyx_dict_version.21514__pyx_dict_cached_value.21515__pyx_n_s_vonmises__pyx_dict_version.21518__pyx_dict_cached_value.21519__pyx_n_s_wald__pyx_dict_version.21522__pyx_dict_cached_value.21523__pyx_n_s_weibull__pyx_dict_version.21526__pyx_dict_cached_value.21527__pyx_n_s_zipf__pyx_n_s_numpy_random_mtrand__pyx_mdef_5numpy_6random_6mtrand_1sample__pyx_mdef_5numpy_6random_6mtrand_3ranf__pyx_n_u_beta__pyx_n_u_binomial__pyx_n_u_bytes__pyx_n_u_chisquare__pyx_n_u_choice__pyx_n_u_dirichlet__pyx_n_u_exponential__pyx_n_u_f__pyx_n_u_gamma__pyx_n_u_geometric__pyx_n_u_get_state__pyx_n_u_gumbel__pyx_n_u_hypergeometric__pyx_n_u_laplace__pyx_n_u_logistic__pyx_n_u_lognormal__pyx_n_u_logseries__pyx_n_u_multinomial__pyx_n_u_multivariate_normal__pyx_n_u_negative_binomial__pyx_n_u_noncentral_chisquare__pyx_n_u_noncentral_f__pyx_n_u_normal__pyx_n_u_pareto__pyx_n_u_permutation__pyx_n_u_poisson__pyx_n_u_power__pyx_n_u_rand__pyx_n_u_randint__pyx_n_u_randn__pyx_n_u_random__pyx_n_u_random_integers__pyx_n_u_random_sample__pyx_n_u_ranf__pyx_n_u_rayleigh__pyx_n_u_sample__pyx_n_u_seed__pyx_n_u_set_state__pyx_n_u_shuffle__pyx_n_u_standard_cauchy__pyx_n_u_standard_exponential__pyx_n_u_standard_gamma__pyx_n_u_standard_normal__pyx_n_u_standard_t__pyx_n_u_triangular__pyx_n_u_uniform__pyx_n_u_vonmises__pyx_n_u_wald__pyx_n_u_weibull__pyx_n_u_zipf__pyx_n_u_RandomState__pyx_n_s_all_2__pyx_kp_u_seed_self_seed_None_Reseed_a_le__pyx_kp_u_RandomState_seed_line_222__pyx_kp_u_random_sample_size_None_Return__pyx_kp_u_RandomState_random_sample_line_3__pyx_kp_u_standard_exponential_size_None__pyx_kp_u_RandomState_standard_exponential__pyx_kp_u_tomaxint_size_None_Return_a_sam__pyx_kp_u_RandomState_tomaxint_line_586__pyx_kp_u_randint_low_high_None_size_None__pyx_kp_u_RandomState_randint_line_644__pyx_kp_u_bytes_length_Return_random_byte__pyx_kp_u_RandomState_bytes_line_769__pyx_kp_u_choice_a_size_None_replace_True__pyx_kp_u_RandomState_choice_line_805__pyx_kp_u_uniform_low_0_0_high_1_0_size_N__pyx_kp_u_RandomState_uniform_line_1004__pyx_kp_u_rand_d0_d1_dn_Random_values_in__pyx_kp_u_RandomState_rand_line_1127__pyx_kp_u_randn_d0_d1_dn_Return_a_sample__pyx_kp_u_RandomState_randn_line_1171__pyx_kp_u_random_integers_low_high_None_s__pyx_kp_u_RandomState_random_integers_line__pyx_kp_u_standard_normal_size_None_Draw__pyx_kp_u_RandomState_standard_normal_line__pyx_kp_u_normal_loc_0_0_scale_1_0_size_N__pyx_kp_u_RandomState_normal_line_1396__pyx_kp_u_standard_gamma_shape_size_None__pyx_kp_u_RandomState_standard_gamma_line__pyx_kp_u_gamma_shape_scale_1_0_size_None__pyx_kp_u_RandomState_gamma_line_1583__pyx_kp_u_f_dfnum_dfden_size_None_Draw_sa__pyx_kp_u_RandomState_f_line_1666__pyx_kp_u_noncentral_f_dfnum_dfden_nonc_s__pyx_kp_u_RandomState_noncentral_f_line_17__pyx_kp_u_chisquare_df_size_None_Draw_sam__pyx_kp_u_RandomState_chisquare_line_1844__pyx_kp_u_noncentral_chisquare_df_nonc_si__pyx_kp_u_RandomState_noncentral_chisquare__pyx_kp_u_standard_cauchy_size_None_Draw__pyx_kp_u_RandomState_standard_cauchy_line__pyx_kp_u_standard_t_df_size_None_Draw_sa__pyx_kp_u_RandomState_standard_t_line_2079__pyx_kp_u_vonmises_mu_kappa_size_None_Dra__pyx_kp_u_RandomState_vonmises_line_2181__pyx_kp_u_pareto_a_size_None_Draw_samples__pyx_kp_u_RandomState_pareto_line_2269__pyx_kp_u_weibull_a_size_None_Draw_sample__pyx_kp_u_RandomState_weibull_line_2371__pyx_kp_u_power_a_size_None_Draws_samples__pyx_kp_u_RandomState_power_line_2474__pyx_kp_u_laplace_loc_0_0_scale_1_0_size__pyx_kp_u_RandomState_laplace_line_2582__pyx_kp_u_gumbel_loc_0_0_scale_1_0_size_N__pyx_kp_u_RandomState_gumbel_line_2675__pyx_kp_u_logistic_loc_0_0_scale_1_0_size__pyx_kp_u_RandomState_logistic_line_2798__pyx_kp_u_lognormal_mean_0_0_sigma_1_0_si__pyx_kp_u_RandomState_lognormal_line_2883__pyx_kp_u_rayleigh_scale_1_0_size_None_Dr__pyx_kp_u_RandomState_rayleigh_line_2998__pyx_kp_u_wald_mean_scale_size_None_Draw__pyx_kp_u_RandomState_wald_line_3074__pyx_kp_u_triangular_left_mode_right_size__pyx_kp_u_RandomState_triangular_line_3150__pyx_kp_u_binomial_n_p_size_None_Draw_sam__pyx_kp_u_RandomState_binomial_line_3258__pyx_kp_u_negative_binomial_n_p_size_None__pyx_kp_u_RandomState_negative_binomial_li__pyx_kp_u_poisson_lam_1_0_size_None_Draw__pyx_kp_u_RandomState_poisson_line_3495__pyx_kp_u_zipf_a_size_None_Draw_samples_f__pyx_kp_u_RandomState_zipf_line_3576__pyx_kp_u_geometric_p_size_None_Draw_samp__pyx_kp_u_RandomState_geometric_line_3662__pyx_kp_u_hypergeometric_ngood_nbad_nsamp__pyx_kp_u_RandomState_hypergeometric_line__pyx_kp_u_logseries_p_size_None_Draw_samp__pyx_kp_u_RandomState_logseries_line_3856__pyx_kp_u_multivariate_normal_mean_cov_si__pyx_kp_u_RandomState_multivariate_normal__pyx_kp_u_multinomial_n_pvals_size_None_D__pyx_kp_u_RandomState_multinomial_line_411__pyx_kp_u_dirichlet_alpha_size_None_Draw__pyx_kp_u_RandomState_dirichlet_line_4238__pyx_kp_u_shuffle_x_Modify_a_sequence_in__pyx_kp_u_RandomState_shuffle_line_4386__pyx_kp_u_permutation_x_Randomly_permute__pyx_kp_u_RandomState_permutation_line_448__pyx_n_s_test__pyx_pw_5numpy_6random_6mtrand_3ranf__pyx_dict_version.20889__pyx_dict_cached_value.20890__pyx_pw_5numpy_6random_6mtrand_1sample__pyx_dict_version.20848__pyx_dict_cached_value.20849__pyx_pw_5numpy_6random_6mtrand_11RandomState_37uniform__pyx_dict_version.17316__pyx_dict_cached_value.17317__pyx_n_s_subtract__pyx_dict_version.17332__pyx_dict_cached_value.17333__pyx_n_s_all__pyx_dict_version.17335__pyx_dict_cached_value.17336__pyx_n_s_isfinite__pyx_dict_version.17298__pyx_dict_cached_value.17299__pyx_n_s_low__pyx_n_s_high__pyx_pyargnames.17229__pyx_pw_5numpy_6random_6mtrand_11RandomState_1__init____pyx_n_u_capsule__pyx_dict_version.15571__pyx_dict_cached_value.15572__pyx_n_s_capsule__pyx_n_s_lock__pyx_dict_version.15581__pyx_dict_cached_value.15582__pyx_n_s_legacy_seeding__pyx_pyargnames.15537__pyx_pw_5numpy_6random_6mtrand_11RandomState_109permutation__pyx_dict_version.20671__pyx_dict_cached_value.20672__pyx_n_s_integer__pyx_dict_version.20677__pyx_dict_cached_value.20678__pyx_n_s_arange__pyx_dict_version.20696__pyx_dict_cached_value.20697__pyx_n_s_asarray__pyx_n_s_ndim__pyx_dict_version.20710__pyx_dict_cached_value.20711__pyx_n_s_may_share_memory__pyx_dict_version.20725__pyx_dict_cached_value.20726__pyx_n_s_array__pyx_dict_version.20745__pyx_dict_cached_value.20746__pyx_dict_version.20749__pyx_dict_cached_value.20750__pyx_n_s_intp__pyx_n_s_dtype__pyx_pw_5numpy_6random_6mtrand_11RandomState_29tomaxint__pyx_dict_version.16377__pyx_dict_cached_value.16378__pyx_n_s_empty__pyx_dict_version.16380__pyx_dict_cached_value.16381__pyx_n_s_int64__pyx_n_s_exit__pyx_n_s_enter__pyx_pyargnames.16293__pyx_pw_5numpy_6random_6mtrand_11RandomState_101multivariate_normal__pyx_n_u_warn__pyx_n_s_svd__pyx_n_s_numpy_dual__pyx_dict_version.19813__pyx_dict_cached_value.19814__pyx_dict_version.19824__pyx_dict_cached_value.19825__pyx_dict_version.19836__pyx_dict_cached_value.19837__pyx_n_s_cov__pyx_n_s_check_valid__pyx_n_s_tol__pyx_pyargnames.19746__pyx_n_s_reshape__pyx_n_s_astype__pyx_dict_version.19881__pyx_dict_cached_value.19882__pyx_n_s_double__pyx_n_u_ignore__pyx_dict_version.19940__pyx_dict_cached_value.19941__pyx_n_s_dot__pyx_dict_version.19943__pyx_dict_cached_value.19944__pyx_n_s_sqrt__pyx_n_u_raise__pyx_dict_version.19910__pyx_dict_cached_value.19911__pyx_n_s_allclose__pyx_dict_version.19913__pyx_dict_cached_value.19914__pyx_n_s_T__pyx_n_s_rtol__pyx_n_s_atol__pyx_dict_version.19933__pyx_dict_cached_value.19934__pyx_pw_5numpy_6random_6mtrand_11RandomState_13seed__pyx_dict_version.15843__pyx_dict_cached_value.15844__pyx_pyargnames.15813__pyx_pw_5numpy_6random_6mtrand_11RandomState_43random_integers__pyx_dict_version.17551__pyx_dict_cached_value.17552__pyx_kp_u_This_function_is_deprecated_Plea_2__pyx_dict_version.17526__pyx_dict_cached_value.17527__pyx_kp_u_This_function_is_deprecated_Plea__pyx_pyargnames.17485__pyx_pw_5numpy_6random_6mtrand_11RandomState_85triangular__pyx_dict_version.18860__pyx_dict_cached_value.18861__pyx_n_s_any__pyx_dict_version.18863__pyx_dict_cached_value.18864__pyx_n_s_greater__pyx_dict_version.18886__pyx_dict_cached_value.18887__pyx_dict_version.18889__pyx_dict_cached_value.18890__pyx_dict_version.18912__pyx_dict_cached_value.18913__pyx_dict_version.18915__pyx_dict_cached_value.18916__pyx_n_s_equal__pyx_n_s_left__pyx_pyargnames.18773__pyx_n_s_mode__pyx_n_s_right__pyx_pw_5numpy_6random_6mtrand_11RandomState_17set_state__pyx_n_s_get__pyx_pw_5numpy_6random_6mtrand_11RandomState_103multinomial__pyx_n_u_pvals__pyx_dict_version.20095__pyx_dict_cached_value.20096__pyx_n_s_index__pyx_dict_version.20131__pyx_dict_cached_value.20132__pyx_n_s_zeros__pyx_n_u_n__pyx_n_s_n__pyx_n_s_pvals__pyx_pyargnames.20024__pyx_pw_5numpy_6random_6mtrand_11RandomState_33bytes__pyx_dict_version.16646__pyx_dict_cached_value.16647__pyx_n_s_uint32__pyx_kp_u_u4__pyx_n_s_tobytes__pyx_pw_5numpy_6random_6mtrand_11RandomState_41randn__pyx_pw_5numpy_6random_6mtrand_11RandomState_39rand__pyx_pw_5numpy_6random_6mtrand_11RandomState_105dirichlet__pyx_dict_version.20262__pyx_dict_cached_value.20263__pyx_dict_version.20265__pyx_dict_cached_value.20266__pyx_n_s_less_equal__pyx_dict_version.20290__pyx_dict_cached_value.20291__pyx_dict_version.20332__pyx_dict_cached_value.20333__pyx_dict_version.20335__pyx_dict_cached_value.20336__pyx_n_s_float64__pyx_n_s_alpha__pyx_pyargnames.20196__pyx_pw_5numpy_6random_6mtrand_11RandomState_107shuffle__pyx_dict_version.20508__pyx_dict_cached_value.20509__pyx_n_s_empty_like__pyx_n_s_strides__pyx_n_s_itemsize__pyx_dict_version.20448__pyx_dict_cached_value.20449__pyx_dict_version.20451__pyx_dict_cached_value.20452__pyx_n_s_int8__pyx_pw_5numpy_6random_6mtrand_11RandomState_31randint__pyx_n_s_isnative__pyx_dict_version.16494__pyx_dict_cached_value.16495__pyx_n_s_newbyteorder__pyx_dict_version.16507__pyx_dict_cached_value.16508__pyx_n_s_int32__pyx_dict_version.16514__pyx_dict_cached_value.16515__pyx_dict_version.16520__pyx_dict_cached_value.16521__pyx_n_s_int16__pyx_dict_version.16568__pyx_dict_cached_value.16569__pyx_n_s_compat__pyx_n_s_long__pyx_dict_version.16575__pyx_dict_cached_value.16576__pyx_dict_version.16526__pyx_dict_cached_value.16527__pyx_pyargnames.16440__pyx_dict_version.16532__pyx_dict_cached_value.16533__pyx_n_s_uint64__pyx_dict_version.16538__pyx_dict_cached_value.16539__pyx_dict_version.16544__pyx_dict_cached_value.16545__pyx_n_s_uint16__pyx_dict_version.16550__pyx_dict_cached_value.16551__pyx_n_s_uint8__pyx_dict_version.16556__pyx_dict_cached_value.16557__pyx_n_s_bool__pyx_kp_u_Unsupported_dtype_r_for_randint__pyx_pw_5numpy_6random_6mtrand_11RandomState_87binomial__pyx_n_u_p__pyx_dict_version.19054__pyx_dict_cached_value.19055__pyx_dict_version.19165__pyx_dict_cached_value.19166__pyx_n_s_p__pyx_dict_version.19070__pyx_dict_cached_value.19071__pyx_pyargnames.18976__pyx_f_5numpy_6random_6mtrand_int64_to_long__pyx_dict_version.15499__pyx_dict_cached_value.15500__pyx_n_s_isscalar__pyx_n_u_unsafe__pyx_n_s_casting__pyx_pw_5numpy_6random_6mtrand_11RandomState_99logseries__pyx_pyargnames.19685__pyx_pw_5numpy_6random_6mtrand_11RandomState_97hypergeometric__pyx_dict_version.19564__pyx_dict_cached_value.19565__pyx_dict_version.19567__pyx_dict_cached_value.19568__pyx_n_s_less__pyx_dict_version.19570__pyx_dict_cached_value.19571__pyx_n_s_add__pyx_dict_version.19606__pyx_dict_cached_value.19607__pyx_dict_version.19618__pyx_dict_cached_value.19619__pyx_dict_version.19630__pyx_dict_cached_value.19631__pyx_n_u_ngood__pyx_n_u_nsample__pyx_n_u_nbad__pyx_n_s_ngood__pyx_pyargnames.19476__pyx_n_s_nbad__pyx_n_s_nsample__pyx_pw_5numpy_6random_6mtrand_11RandomState_95geometric__pyx_pyargnames.19416__pyx_pw_5numpy_6random_6mtrand_11RandomState_93zipf__pyx_pyargnames.19358__pyx_pw_5numpy_6random_6mtrand_11RandomState_91poisson__pyx_n_u_lam__pyx_pyargnames.19298__pyx_n_s_lam__pyx_pw_5numpy_6random_6mtrand_11RandomState_89negative_binomial__pyx_pyargnames.19237__pyx_pw_5numpy_6random_6mtrand_11RandomState_35choice__pyx_dict_version.16769__pyx_dict_cached_value.16770__pyx_n_s_copy__pyx_dict_version.16781__pyx_dict_cached_value.16782__pyx_n_s_item__pyx_dict_version.16819__pyx_dict_cached_value.16820__pyx_n_s_prod__pyx_dict_version.16849__pyx_dict_cached_value.16850__pyx_dict_version.16852__pyx_dict_cached_value.16853__pyx_n_s_finfo__pyx_dict_version.16855__pyx_dict_cached_value.16856__pyx_n_s_eps__pyx_dict_version.16938__pyx_dict_cached_value.16939__pyx_n_s_isnan__pyx_dict_version.16950__pyx_dict_cached_value.16951__pyx_n_s_logical_or__pyx_n_s_reduce__pyx_dict_version.16966__pyx_dict_cached_value.16967__pyx_dict_version.16969__pyx_dict_cached_value.16970__pyx_n_s_cumsum__pyx_n_s_searchsorted__pyx_n_u_right__pyx_n_s_side__pyx_dict_version.16999__pyx_dict_cached_value.17000__pyx_dict_version.17155__pyx_dict_cached_value.17156__pyx_dict_version.16837__pyx_dict_cached_value.16838__pyx_n_s_replace__pyx_dict_version.16873__pyx_dict_cached_value.16874__pyx_n_s_issubdtype__pyx_dict_version.16876__pyx_dict_cached_value.16877__pyx_n_s_floating__pyx_dict_version.16895__pyx_dict_cached_value.16896__pyx_dict_version.16898__pyx_dict_cached_value.16899__pyx_pyargnames.16698__pyx_dict_version.17020__pyx_dict_cached_value.17021__pyx_n_s_count_nonzero__pyx_dict_version.17041__pyx_dict_cached_value.17042__pyx_n_s_ravel__pyx_dict_version.17067__pyx_dict_cached_value.17068__pyx_dict_version.17088__pyx_dict_cached_value.17089__pyx_n_s_unique__pyx_n_s_return_index__pyx_n_s_sort__pyx_n_s_take__pyx_moduledef__pyx_k_Cannot_take_a_larger_sample_than__pyx_k_DeprecationWarning__pyx_k_Fewer_non_zero_entries_in_p_than__pyx_k_ImportError__pyx_k_IndexError__pyx_k_Invalid_bit_generator_The_bit_ge__pyx_k_MT19937__pyx_k_MT19937_2__pyx_k_Negative_dimensions_are_not_allo__pyx_k_OverflowError__pyx_k_Providing_a_dtype_with_a_non_nat__pyx_k_RandomState__pyx_k_RandomState_binomial_line_3258__pyx_k_RandomState_bytes_line_769__pyx_k_RandomState_chisquare_line_1844__pyx_k_RandomState_choice_line_805__pyx_k_RandomState_dirichlet_line_4238__pyx_k_RandomState_f_line_1666__pyx_k_RandomState_gamma_line_1583__pyx_k_RandomState_geometric_line_3662__pyx_k_RandomState_gumbel_line_2675__pyx_k_RandomState_hypergeometric_line__pyx_k_RandomState_laplace_line_2582__pyx_k_RandomState_logistic_line_2798__pyx_k_RandomState_lognormal_line_2883__pyx_k_RandomState_logseries_line_3856__pyx_k_RandomState_multinomial_line_411__pyx_k_RandomState_multivariate_normal__pyx_k_RandomState_negative_binomial_li__pyx_k_RandomState_noncentral_chisquare__pyx_k_RandomState_noncentral_f_line_17__pyx_k_RandomState_normal_line_1396__pyx_k_RandomState_pareto_line_2269__pyx_k_RandomState_permutation_line_448__pyx_k_RandomState_poisson_line_3495__pyx_k_RandomState_power_line_2474__pyx_k_RandomState_rand_line_1127__pyx_k_RandomState_randint_line_644__pyx_k_RandomState_randn_line_1171__pyx_k_RandomState_random_integers_line__pyx_k_RandomState_random_sample_line_3__pyx_k_RandomState_rayleigh_line_2998__pyx_k_RandomState_seed_line_222__pyx_k_RandomState_shuffle_line_4386__pyx_k_RandomState_standard_cauchy_line__pyx_k_RandomState_standard_exponential__pyx_k_RandomState_standard_gamma_line__pyx_k_RandomState_standard_normal_line__pyx_k_RandomState_standard_t_line_2079__pyx_k_RandomState_tomaxint_line_586__pyx_k_RandomState_triangular_line_3150__pyx_k_RandomState_uniform_line_1004__pyx_k_RandomState_vonmises_line_2181__pyx_k_RandomState_wald_line_3074__pyx_k_RandomState_weibull_line_2371__pyx_k_RandomState_zipf_line_3576__pyx_k_Range_exceeds_valid_bounds__pyx_k_RuntimeWarning__pyx_k_T__pyx_k_This_function_is_deprecated_Plea__pyx_k_This_function_is_deprecated_Plea_2__pyx_k_TypeError__pyx_k_Unsupported_dtype_r_for_randint__pyx_k_ValueError__pyx_k__12__pyx_k__3__pyx_k__4__pyx_k_a__pyx_k_a_and_p_must_have_same_size__pyx_k_a_cannot_be_empty_unless_no_sam__pyx_k_a_must_be_1_dimensional__pyx_k_a_must_be_1_dimensional_or_an_in__pyx_k_a_must_be_greater_than_0_unless__pyx_k_add__pyx_k_all__pyx_k_all_2__pyx_k_allclose__pyx_k_alpha__pyx_k_alpha_0__pyx_k_any__pyx_k_arange__pyx_k_args__pyx_k_array__pyx_k_asarray__pyx_k_astype__pyx_k_at_0x_X__pyx_k_atol__pyx_k_b__pyx_k_beta__pyx_k_binomial__pyx_k_binomial_n_p_size_None_Draw_sam__pyx_k_bit_generator__pyx_k_bool__pyx_k_bytes__pyx_k_bytes_length_Return_random_byte__pyx_k_can_only_re_seed_a_MT19937_BitGe__pyx_k_capsule__pyx_k_casting__pyx_k_check_valid__pyx_k_check_valid_must_equal_warn_rais__pyx_k_chisquare__pyx_k_chisquare_df_size_None_Draw_sam__pyx_k_choice__pyx_k_choice_a_size_None_replace_True__pyx_k_class__pyx_k_cline_in_traceback__pyx_k_compat__pyx_k_copy__pyx_k_count_nonzero__pyx_k_cov__pyx_k_cov_must_be_2_dimensional_and_sq__pyx_k_covariance_is_not_positive_semid__pyx_k_cumsum__pyx_k_df__pyx_k_dfden__pyx_k_dfnum__pyx_k_dirichlet__pyx_k_dirichlet_alpha_size_None_Draw__pyx_k_dot__pyx_k_double__pyx_k_dtype__pyx_k_empty__pyx_k_empty_like__pyx_k_enter__pyx_k_eps__pyx_k_equal__pyx_k_exit__pyx_k_exponential__pyx_k_f__pyx_k_f_dfnum_dfden_size_None_Draw_sa__pyx_k_finfo__pyx_k_float64__pyx_k_floating__pyx_k_format__pyx_k_gamma__pyx_k_gamma_shape_scale_1_0_size_None__pyx_k_gauss__pyx_k_geometric__pyx_k_geometric_p_size_None_Draw_samp__pyx_k_get__pyx_k_get_state__pyx_k_get_state_and_legacy_can_only_be__pyx_k_greater__pyx_k_gumbel__pyx_k_gumbel_loc_0_0_scale_1_0_size_N__pyx_k_has_gauss__pyx_k_high__pyx_k_hypergeometric__pyx_k_hypergeometric_ngood_nbad_nsamp__pyx_k_id__pyx_k_ignore__pyx_n_s_import__pyx_k_import__pyx_k_index__pyx_k_int16__pyx_k_int32__pyx_k_int64__pyx_k_int8__pyx_k_integer__pyx_k_intp__pyx_k_isfinite__pyx_k_isnan__pyx_k_isnative__pyx_k_isscalar__pyx_k_issubdtype__pyx_k_item__pyx_k_itemsize__pyx_k_kappa__pyx_k_key__pyx_k_kwargs__pyx_k_l__pyx_k_lam__pyx_k_laplace__pyx_k_laplace_loc_0_0_scale_1_0_size__pyx_k_left__pyx_k_left_mode__pyx_k_left_right__pyx_k_legacy__pyx_k_legacy_seeding__pyx_k_less__pyx_k_less_equal__pyx_k_loc__pyx_k_lock__pyx_k_logical_or__pyx_k_logistic__pyx_k_logistic_loc_0_0_scale_1_0_size__pyx_k_lognormal__pyx_k_lognormal_mean_0_0_sigma_1_0_si__pyx_k_logseries__pyx_k_logseries_p_size_None_Draw_samp__pyx_k_long__pyx_k_low__pyx_k_main__pyx_k_may_share_memory__pyx_k_mean__pyx_k_mean_and_cov_must_have_same_leng__pyx_k_mean_must_be_1_dimensional__pyx_k_mode__pyx_k_mode_right__pyx_k_mt19937__pyx_k_mtrand_pyx__pyx_k_mu__pyx_k_multinomial__pyx_k_multinomial_n_pvals_size_None_D__pyx_k_multivariate_normal__pyx_k_multivariate_normal_mean_cov_si__pyx_k_n__pyx_k_name__pyx_k_nbad__pyx_k_ndim__pyx_k_negative_binomial__pyx_k_negative_binomial_n_p_size_None__pyx_k_newbyteorder__pyx_k_ngood__pyx_k_ngood_nbad_nsample__pyx_k_nonc__pyx_k_noncentral_chisquare__pyx_k_noncentral_chisquare_df_nonc_si__pyx_k_noncentral_f__pyx_k_noncentral_f_dfnum_dfden_nonc_s__pyx_k_normal__pyx_k_normal_loc_0_0_scale_1_0_size_N__pyx_k_np__pyx_k_nsample__pyx_k_numpy__pyx_k_numpy_core_multiarray_failed_to__pyx_k_numpy_core_umath_failed_to_impor__pyx_k_numpy_dual__pyx_k_numpy_random_mtrand__pyx_k_operator__pyx_k_p__pyx_k_p_must_be_1_dimensional__pyx_k_pareto__pyx_k_pareto_a_size_None_Draw_samples__pyx_k_permutation__pyx_k_permutation_x_Randomly_permute__pyx_k_pickle__pyx_k_poisson__pyx_k_poisson_lam_1_0_size_None_Draw__pyx_k_poisson_lam_max__pyx_k_pos__pyx_k_power__pyx_k_power_a_size_None_Draws_samples__pyx_k_probabilities_are_not_non_negati__pyx_k_probabilities_contain_NaN__pyx_k_probabilities_do_not_sum_to_1__pyx_k_prod__pyx_k_pvals__pyx_k_pyx_vtable__pyx_k_raise__pyx_k_rand__pyx_k_rand_2__pyx_k_rand_d0_d1_dn_Random_values_in__pyx_k_randint__pyx_k_randint_low_high_None_size_None__pyx_k_randn__pyx_k_randn_d0_d1_dn_Return_a_sample__pyx_k_random__pyx_k_random_integers__pyx_k_random_integers_low_high_None_s__pyx_k_random_sample__pyx_k_random_sample_size_None_Return__pyx_k_randomstate_ctor__pyx_k_ranf__pyx_k_range__pyx_k_ravel__pyx_k_rayleigh__pyx_k_rayleigh_scale_1_0_size_None_Dr__pyx_k_reduce__pyx_k_replace__pyx_k_reshape__pyx_k_return_index__pyx_k_reversed__pyx_k_right__pyx_k_rtol__pyx_k_sample__pyx_k_scale__pyx_k_searchsorted__pyx_k_seed__pyx_k_seed_self_seed_None_Reseed_a_le__pyx_k_set_state__pyx_k_set_state_can_only_be_used_with__pyx_k_shape__pyx_k_shuffle__pyx_k_shuffle_x_Modify_a_sequence_in__pyx_k_side__pyx_k_sigma__pyx_k_size__pyx_k_sort__pyx_k_sqrt__pyx_k_standard_cauchy__pyx_k_standard_cauchy_size_None_Draw__pyx_k_standard_exponential__pyx_k_standard_exponential_size_None__pyx_k_standard_gamma__pyx_k_standard_gamma_shape_size_None__pyx_k_standard_normal__pyx_k_standard_normal_size_None_Draw__pyx_k_standard_t__pyx_k_standard_t_df_size_None_Draw_sa__pyx_k_state__pyx_k_state_dictionary_is_not_valid__pyx_k_state_must_be_a_dict_or_a_tuple__pyx_k_str__pyx_k_strides__pyx_k_subtract__pyx_k_sum_pvals_1_1_0__pyx_k_svd__pyx_k_take__pyx_k_test__pyx_k_tobytes__pyx_k_tol__pyx_k_tomaxint_size_None_Return_a_sam__pyx_k_triangular__pyx_k_triangular_left_mode_right_size__pyx_k_u4__pyx_k_uint16__pyx_k_uint32__pyx_k_uint64__pyx_k_uint8__pyx_k_uniform__pyx_k_uniform_low_0_0_high_1_0_size_N__pyx_k_unique__pyx_k_unsafe__pyx_k_vonmises__pyx_k_vonmises_mu_kappa_size_None_Dra__pyx_k_wald__pyx_k_wald_mean_scale_size_None_Draw__pyx_k_warn__pyx_k_warnings__pyx_k_weibull__pyx_k_weibull_a_size_None_Draw_sample__pyx_k_x_must_be_an_integer_or_at_least__pyx_k_zeros__pyx_k_zipf__pyx_k_zipf_a_size_None_Draw_samples_f__pyx_methods__pyx_moduledef_slots__pyx_methods_5numpy_6random_6mtrand_RandomState__pyx_getsets_5numpy_6random_6mtrand_RandomState__pyx_doc_5numpy_6random_6mtrand_11RandomState_12seed__pyx_doc_5numpy_6random_6mtrand_11RandomState_14get_state__pyx_doc_5numpy_6random_6mtrand_11RandomState_16set_state__pyx_doc_5numpy_6random_6mtrand_11RandomState_18random_sample__pyx_doc_5numpy_6random_6mtrand_11RandomState_20random__pyx_doc_5numpy_6random_6mtrand_11RandomState_22beta__pyx_doc_5numpy_6random_6mtrand_11RandomState_24exponential__pyx_doc_5numpy_6random_6mtrand_11RandomState_26standard_exponential__pyx_doc_5numpy_6random_6mtrand_11RandomState_28tomaxint__pyx_doc_5numpy_6random_6mtrand_11RandomState_30randint__pyx_doc_5numpy_6random_6mtrand_11RandomState_32bytes__pyx_doc_5numpy_6random_6mtrand_11RandomState_34choice__pyx_doc_5numpy_6random_6mtrand_11RandomState_36uniform__pyx_doc_5numpy_6random_6mtrand_11RandomState_38rand__pyx_doc_5numpy_6random_6mtrand_11RandomState_40randn__pyx_doc_5numpy_6random_6mtrand_11RandomState_42random_integers__pyx_doc_5numpy_6random_6mtrand_11RandomState_44standard_normal__pyx_doc_5numpy_6random_6mtrand_11RandomState_46normal__pyx_doc_5numpy_6random_6mtrand_11RandomState_48standard_gamma__pyx_doc_5numpy_6random_6mtrand_11RandomState_50gamma__pyx_doc_5numpy_6random_6mtrand_11RandomState_52f__pyx_doc_5numpy_6random_6mtrand_11RandomState_54noncentral_f__pyx_doc_5numpy_6random_6mtrand_11RandomState_56chisquare__pyx_doc_5numpy_6random_6mtrand_11RandomState_58noncentral_chisquare__pyx_doc_5numpy_6random_6mtrand_11RandomState_60standard_cauchy__pyx_doc_5numpy_6random_6mtrand_11RandomState_62standard_t__pyx_doc_5numpy_6random_6mtrand_11RandomState_64vonmises__pyx_doc_5numpy_6random_6mtrand_11RandomState_66pareto__pyx_doc_5numpy_6random_6mtrand_11RandomState_68weibull__pyx_doc_5numpy_6random_6mtrand_11RandomState_70power__pyx_doc_5numpy_6random_6mtrand_11RandomState_72laplace__pyx_doc_5numpy_6random_6mtrand_11RandomState_74gumbel__pyx_doc_5numpy_6random_6mtrand_11RandomState_76logistic__pyx_doc_5numpy_6random_6mtrand_11RandomState_78lognormal__pyx_doc_5numpy_6random_6mtrand_11RandomState_80rayleigh__pyx_doc_5numpy_6random_6mtrand_11RandomState_82wald__pyx_doc_5numpy_6random_6mtrand_11RandomState_84triangular__pyx_doc_5numpy_6random_6mtrand_11RandomState_86binomial__pyx_doc_5numpy_6random_6mtrand_11RandomState_88negative_binomial__pyx_doc_5numpy_6random_6mtrand_11RandomState_90poisson__pyx_doc_5numpy_6random_6mtrand_11RandomState_92zipf__pyx_doc_5numpy_6random_6mtrand_11RandomState_94geometric__pyx_doc_5numpy_6random_6mtrand_11RandomState_96hypergeometric__pyx_doc_5numpy_6random_6mtrand_11RandomState_98logseries__pyx_doc_5numpy_6random_6mtrand_11RandomState_100multivariate_normal__pyx_doc_5numpy_6random_6mtrand_11RandomState_102multinomial__pyx_doc_5numpy_6random_6mtrand_11RandomState_104dirichlet__pyx_doc_5numpy_6random_6mtrand_11RandomState_106shuffle__pyx_doc_5numpy_6random_6mtrand_11RandomState_108permutation__pyx_doc_5numpy_6random_6mtrand_2ranf__pyx_doc_5numpy_6random_6mtrand_samplecrtstuff.cderegister_tm_clones__do_global_dtors_auxcompleted.7182__do_global_dtors_aux_fini_array_entryframe_dummy__frame_dummy_init_array_entrylegacy-distributions.cfe_doublewe_doubleke_doublefe_floatwe_floatke_floatwi_doubleki_doublefi_doublewi_floatki_floatfi_float__FRAME_END____dso_handle_DYNAMIC__GNU_EH_FRAME_HDR__TMC_END___GLOBAL_OFFSET_TABLE_PyUnicode_FromFormatPyObject_SetItemPyList_Newrandom_laplace_PyUnicode_ReadyPyExc_SystemErrorPyDict_SetItemStringPyDict_Sizerandom_buffered_bounded_boollegacy_random_zipfrandom_geometric_inversionPyException_SetTracebacklegacy_frandom_weibullPyMethod_Typerandom_f_ITM_deregisterTMCloneTablelegacy_paretoPyFloat_TypePyTuple_TypePyList_AsTuple_PyThreadState_UncheckedGetPyModuleDef_InitPyEval_RestoreThreadPyFrame_Newrandom_negative_binomialrandom_standard_cauchyPyCFunction_NewEx__isnan@@GLIBC_2.2.5PyCapsule_GetNamePyNumber_InPlaceAddexp@@GLIBC_2.2.5PyNumber_AddPyObject_GetAttrString__pyx_module_is_main_numpy__random__mtrandlegacy_chisquarePyImport_AddModulePyBytes_FromStringAndSizerandom_standard_exponential_fill_fPyObject_SetAttrStringlegacy_gaussPyErr_WarnExrandom_standard_gamma_edatarandom_binomial_btpePyModule_NewObjectPyErr_SetObjectPyErr_NormalizeExceptionlegacy_normalPyNumber_Multiplyrandom_rayleighrandom_standard_exponentialPyObject_RichComparerandom_uniformPyCode_New_finiPyImport_GetModuleDictlegacy_random_binomialrandom_bounded_uint64_fillPyExc_RuntimeErrorPyNumber_LongPyErr_GivenExceptionMatcheslegacy_random_multinomialPyErr_SetStringrandom_bounded_uint16_fillPyObject_IsInstancePyExc_ExceptionPyExc_ValueErrorPyExc_DeprecationWarningPyExc_TypeErrorlegacy_standard_exponentialPyInterpreterState_GetIDPyEval_EvalFrameExrandom_logisticPySequence_Containslegacy_random_logserieslegacy_negative_binomialmemset@@GLIBC_2.2.5PyMem_Reallocrandom_standard_uniform_fill_fPyErr_ExceptionMatchesrandom_bounded_uint64pow@@GLIBC_2.2.5random_positive_intlog@@GLIBC_2.2.5random_standard_gamma_frandom_triangularrandom_buffered_bounded_uint32PyOS_snprintfPyTraceBack_Herefmod@@GLIBC_2.2.5PyObject_CallFinalizerFromDeallocrandom_powerrandom_bounded_uint8_fillPyObject_Notrandom_noncentral_fPyNumber_InPlaceTrueDividerandom_standard_exponential_inv_fill_fPyLong_FromSsize_tPyFloat_FromDoublePyType_Readyacos@@GLIBC_2.2.5PyLong_FromLongmemcmp@@GLIBC_2.2.5PyLong_AsSsize_tlegacy_waldrandom_buffered_bounded_uint8PyModule_GetNamePyErr_Clearmemcpy@@GLIBC_2.2.5PyList_Append_Py_CheckRecursiveCall_Py_CheckRecursionLimitPyCapsule_IsValidPyExc_KeyErrorrandom_beta_Py_FalseStruct__gmon_start__random_exponentialexpf@@GLIBC_2.2.5PyTuple_NewPyThreadState_GetPyExc_OverflowErrorPyNumber_RemainderPyType_Modifiedrandom_gammalegacy_random_poissonPyObject_SetAttrPyErr_Occurredrandom_standard_uniform_f_Py_EllipsisObjectrandom_loggamPyLong_AsLongPyImport_ImportModulesqrtf@@GLIBC_2.2.5_PyDict_GetItem_KnownHashrandom_gamma_flegacy_weibullPyDict_GetItemStringPyEval_EvalCodeExpowf@@GLIBC_2.2.5PyObject_Sizerandom_standard_exponential_frandom_pareto_Py_NoneStructPyFloat_AsDouble_endPyObject_IsTrue_PyType_LookupPyImport_ImportModuleLevelObjectrandom_positive_int64legacy_standard_gammarandom_geometric_searchPyObject_Hashrandom_standard_tPyUnicode_ComparePyInit_mtrandrandom_vonmisesrandom_bounded_uint32_fillrandom_standard_normal_frandom_positive_int32random_standard_uniform_Py_TrueStruct__bss_startlogf@@GLIBC_2.2.5PyFunction_Typelegacy_powerrandom_normallegacy_exponentialrandom_chisquarePyDict_Newlegacy_standard_cauchyPyExc_IndexErrorPyBool_TypePyDict_TypePyDict_Nextlegacy_gammaPyBaseObject_Typerandom_standard_exponential_fillrandom_intervalrandom_waldrandom_noncentral_chisquarePyLong_TypePyFrame_Typerandom_standard_normallegacy_betaPyCapsule_Typelegacy_noncentral_frandom_standard_exponential_inv_fill_PyObject_GetDictPtrrandom_lognormalPyUnicode_FromStringrandom_buffered_bounded_uint16PyObject_GetIterPyEval_SaveThreadPyUnicode_InternFromStringPyExc_ImportErrorlegacy_random_hypergeometricPyDict_SetItemrandom_uintPySequence_TuplePyExc_AttributeErrorrandom_gumbelPyDict_Copyrandom_standard_uniform_filllegacy_standard_tPyExc_StopIterationPySequence_Listrandom_standard_normal_fill_ffloor@@GLIBC_2.2.5legacy_random_geometricPyUnicode_TypePyCapsule_NewPyUnicode_DecodePyErr_Formatrandom_bounded_bool_fillPyCapsule_GetPointerPySlice_NewPyExc_NameErrorPyUnicode_FromStringAndSizePyModule_GetDictrandom_binomial_inversion_ITM_registerTMCloneTablelegacy_noncentral_chisquarePyNumber_IndexPyObject_GetAttrsqrt@@GLIBC_2.2.5PyCFunction_Type_PyDict_NewPresizedceil@@GLIBC_2.2.5PyUnicode_FormatPyLong_FromStringPyMem_MallocPyErr_WarnFormat__cxa_finalize@@GLIBC_2.2.5_initPyNumber_Subtractrandom_standard_normal_fillPyTuple_PackPy_GetVersionlegacy_lognormalPyObject_GC_UnTrackPyDict_GetItemWithErrorPyList_Type.symtab.strtab.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.got.plt.data.bss.comment$.o8 @``Ho..Uo00@d8181nnB@xs ~t   r ..dx4x4:{'{{'{{'{|'|}'} ''`R @)@  0@ Y o q