From a23b65c0b007b64d37787afec1ef2de7e0e95244 Mon Sep 17 00:00:00 2001 From: madmax-codewarrior-0 <> Date: Tue, 2 Aug 2022 11:02:53 -0700 Subject: [PATCH] Added all original files with some edits --- .gitignore | 7 + AC922-SMT-Performance.ods | Bin 0 -> 30720 bytes AC922-SMT-Performance.pdf | Bin 0 -> 28948 bytes README.md | 5 +- ansible/get-gcc.yml | 7 + ansible/hosts.ini | 15 + ansible/m-queens-test.yml | 49 +++ ansible/monitor.sh | 3 + ansible/wrapper.sh | 13 + m-queens/CMakeLists.txt | 4 + m-queens/LICENSE | 674 ++++++++++++++++++++++++++++++++++++++ m-queens/Makefile | 19 ++ m-queens/README.md | 36 ++ m-queens/main-10-thread.c | 309 +++++++++++++++++ m-queens/main-20-thread.c | 309 +++++++++++++++++ m-queens/main.c | 309 +++++++++++++++++ notes.md | 10 + 17 files changed, 1768 insertions(+), 1 deletion(-) create mode 100644 .gitignore create mode 100644 AC922-SMT-Performance.ods create mode 100644 AC922-SMT-Performance.pdf create mode 100644 ansible/get-gcc.yml create mode 100644 ansible/hosts.ini create mode 100644 ansible/m-queens-test.yml create mode 100755 ansible/monitor.sh create mode 100755 ansible/wrapper.sh create mode 100644 m-queens/CMakeLists.txt create mode 100644 m-queens/LICENSE create mode 100644 m-queens/Makefile create mode 100644 m-queens/README.md create mode 100644 m-queens/main-10-thread.c create mode 100644 m-queens/main-20-thread.c create mode 100644 m-queens/main.c create mode 100644 notes.md diff --git a/.gitignore b/.gitignore new file mode 100644 index 0000000..2cf95ca --- /dev/null +++ b/.gitignore @@ -0,0 +1,7 @@ +# Ignored items + +# Vi's swap files +*.swp + +# Archives +*.tar* \ No newline at end of file diff --git a/AC922-SMT-Performance.ods b/AC922-SMT-Performance.ods new file mode 100644 index 0000000000000000000000000000000000000000..fa6f7ef3e7f3a4e8469f93c9eb8132780e042725 GIT binary patch literal 30720 zcmbTd1yH2D^Dc_(vWvUz;_eO$i@UqKyZhj-i@Uom?(VR-!{YAlFmu@NC;wBY?mczu zPE96Br_*ohtt8LWnU1^^BosOr7#tWFQj3dnur*f%Js23+-}E5@v$3!-arUq`F|fC{ zwlFeqwy?8haJ4n2w=;0EaH6-fH?cLgGjg#pv2~_*vUfBwFm^IGF>#jv$0i&c+&?xy z%>4I*_fe8Fv@|htRy47WElTmz*>94O zg?E8pz}MR76>TgUGn%f8&;tvTnl$4|83MrB^rH+d4GrDVP-V9A!e@kqgcyCv$PL9w zd$GC+d$5V#+!ao^9yjKA{#?vA)kEr-6{o#VZFn65FW=A8(&~BI&m)?f$eLmG`9{dV zn*Ck4Fk#>hATueUum>@cZD32wp`J((w>a6w{KLchTQF+RR3oYul}|94+`*ewcT|%Z zM^K9zRb$YGU^aV%WqjmFe%Q`$lYA45UKlu{Vt3}NC8;5!m)Q-w+((v)u3 zE4JD`M&O3H*15)*fV*RGNamIlaJ3e&Jd3{yg>Os_^mjgz5t^@1y_e~9yI1xPb47j2 zZGj?xR!3FQn`DJsw9A^Sti z@X*jf*sDBr4+XYvieqE;FnvX{Ws##T2cNBqk&Z2PKGMa?=KzNiP0T`C7x>5NyOy;< zO05B-MD0Oo`cfQSasJ84MDn!giU#G$pm{cJ)r8+eZ0fXTf+x826%wYq+(Zf`8DWtv zl^;4*7V7`iX=EV%uMX~)v9!3hka5eOtu5v-vDNlm@r*Lw+JwC-81XD$U64{Nc6M*z zst;5CrN(;g-~qK%9SUD<+Xi?AqN1q*D<>@{_j5gD`PM?XacZuzo%N%em> z{KU{y6ZzYturU8lyLK_Q;6GZ(i;@as3gh>4TwsMSOlx~gRrw7Tk&Cg8CjYYEsabO0 z%Zt-kIf>6HDYj%uHf zd%Lu$Xrm$4>WjSfLd1;HET&?CT*EMhOtEs~s+x;>#YmGo^=Bzuw#_^~yoKqLPv$P) z8|J6GG^_I#@TO0E%**ns%BQDsKba$aXU*t$iVkV&^=s-4HFa`dG&jdXGRN~VXAeCj zN3ux(w@LUy$JP)L47R2!Zq5eNfJ?NhY+j-8>IA0C06o+3Lq7oo9rP<2>PVyCdV3JE zNo8Y8QsZ5t^1U^6101YUEI^oDi`S^ms=icsp(xyrcf4s#>!=x>`6a|+x`d^{=MLfB z${@VUHNCXvzF-6Cjz1W?(`SC^Md1?WWr7RUXPs3+@9?@5z{E8Dem<##P180l0yGwl6i_9BBHlM7iwxcgPvrl@V*YY@@g>SFrgAXbm4=M()<=(I55U=H7J}P-WD)BZdFQ2c{ zHlX(a+Z^5u0)#&Plld7A2b-FSW3B6Fms{#t)mW0SizkA|J(Bx>Y#(yEw6c67KO}Xf z&iWraRSHf{U&6C$gH}up1cBp(J@UhjdBT%eNmg+Fotm~>fdkRQQ!qC{j6O$uzXJR=v%QB5&$VNo`g1{6MN4_zXS=gz< zs5lzxtn{9HygRPw^{8^VR)ddrTbrP$LJoKU(S5t3-;@z6Vo#U{F51TWxA*96mE@n> z^ilrU&XLAX@Cx;MztdJj?KuJ4nl-am{3_Hyl4>jzdXvcAmh8b9U;vkXisazt&>bCS z^6`^dYGR||1xloR4GUo}UGzXhsMcfV&+Ar`KkFP!IG2-qynKX>Rb!=d{U``~t(kt!N555!NC6iVmZ@!mevQBV-I)RSh%GWt&J<@3Qj1Z z{~}IlYH0LRPZ7cOoU>gXf*ltWz$+TWME1FX$S1}nV@oBLgNcGq5f{9Z5ZQ(H=z|r? zpAq)yLln)2m#Et0Fzd=bb}nw<;hA=sj9UR+aG6blGB@M<*jPGe5PyNsGn_(5`1{QqV1hr zfU{@*0p&ECSM2KCehei?Np>e0u%SF-!9Gv4ax4T8o4W78O?QTonl_)Gk*kpV3xhH4 z{$jcHW5oAQ$Hr&)HHpABF~AVg`h4@OE?vu3_6RV)>`%so%Dmb*l( zO$Pk~n-TudoBpK^_2GT{DBAmO5&sYa>wNnU#J?Fd{0GxBC_ktHMh)ga)ZibB^e?u- zrhQme+P(j>8QHDmfRVC7>gBKiW7}t<@z>f1kn0Vy|LyyM?IM7Gi#ACN{*EGO{9a4) zH#tH|sC}z1Y|LMy$n;Bg>dgPvf7dZZ3;s(Lc>Yoa8Cwi`!i~1ao}DE*sRpL~-acHW z)lF4#9So?dOqJJa8k^9O_59FrsY2gaJ|(USme8;75f^5Ng{p>A|A2dhuUKDN>3sKF zZc;tB)01oQ(YAToJS3+p^#>EM?-IZJ)h&E7ifq3BfvU35B46IWmL2we=x&T`SIHz9 zaoQ(#=~3L@$AxLCntjGE8cvq*p{31FUP$`@|8X~obsfroSE>=p=)h6_1THuwHW}@bJsfLyL60IhWu0u0ZPut~YJa!Nr8ut0GUkmsdVPS+?&C<$ghq zf|6%{0ixr@PGFw)1)}b3$$sGbi*(4*(h@_!ThT+pGT4_CdxBPN2COuNq$YU2S9veh zqUh|OO}XD++_kKijg?jEeN@_OBdkkehYZ9E$axyu)^W~WV@wv?H+#9*~D*O4M?;6`iUhMvIH1XKm7+6AcAMpa;7w?tz_pM zUDyTz2(dL7zNh8ST6tfZelUEu4Mk73=|#1ausPh8hne2Rw$<{_`Yyyn?~VALs-m`Y zWV%gpj9Sf848cp#XN=-zNrVBG`3W+!A99#S1k4Uy$!^!t1wA>edM0Iu@(A9j}Z_B=~fH=pVy&@(vTTmc{ zf=Z2oG7GW3iehOTH0=O^%1u@_9n$s- z(o1HKEzBJpPHl8VoEF|!pR|czQ+c{s@K+*}6iB1|~# zA*U&+9&APzD0KO{!+Zf+xZxUEsuXsHLs^-3qwbXhUDSqJNh;dp>~vZnQA)GmXRz0QJ6qVAInle@Sf6X!s1-kd$d_Y7jzXE#| zkwv&IH{*muRclkf=kvtvf@WQ} z5UGCL@`1h!7mBMw0yW10+|ZP2g-ynzXG}DwBhx$%6eg0@X@()rSVmZw=B+rN%G9Zy zgD?CmjO+lreG%&o_OoFV(#zA?Sp%;(QU0-Y#Yws2&AzkRTR&J(XxNiI_`8e-;|4Hy zmTT5x*%2$+z21B9*Kya9FrMxL;*qOF9Ignl{iOI z<4?TS_kB}?g!@)U!&P7Eh@Eqo?-EeKf8iLC+LnFcAnJ*#LzVrUCZMZwgtuBl*Dyuw zQwD&3YNMFOFFt}Hp2NRI|E*)?^O)JP_)An*l`1?Vp8T7 zB_zI0zUi|Nl_ex&u!O4*R_BqZ(WLnwBXbsq_C!NC@hU2HC`1_8>q4eHyWZfIggwIm z3vbAh9<77Xbg0NGJfaNGAd;nU<`e1}0QhZ{ zLKG01Ke_pkaHLDcz(dzWq9Ac(?hjvMv!MV2A}Z4hLEZtY#i@1pn1IUi95?dHOWs9< zs99KTOG4;@Tn8cuJxrk_I0>}y->ew9de`mZBM_+R<2^;G8TL+q&B(a<-PfOdTR}fY z&X&JQ?EH2qLH*%6C<7rFiTgnckCk7Mh<*rNGbc_?6R zL}?REpiHR%*uPNswJB{xL!< z=k0r$ScTRyy~G6}TqlDbQEi-!Va;BaYD|DlUygN0?;3uV8L%m?2SOTZBPlz*aG-mp z>!dfKzwr^z)~WUmyo8CffZAZ^QpG?eg$@i54S&O*kJtEh3z-__Cj+b(tOD?MLzjg8 z5vNzd&J%ibJ4~6lBO0xViv%&W-0YtOhf$Ffe!KBR!jWLPX8e{N){}g(>kIXcxdCc_ zQr<7r3)!EeyxYgj*_{1O4=3YqHxic1yrh=vAz4F=HE#pzFXz)hFIVOxEM-X~Y?69A%)p}t)?hz3A1c&XW9 zvP$%Y;Pj=6aGgI#?^wr-6qKXwG4YAj_^xfNpp0R)kZcL4;Xqi;D%41FxUKcnV!iGK z9`lynX$_m+VK=^84Kbw2+MwkWi#T6fX^&`dW&h;Z8Pk^E~drJ$MfK&bpG)A-nc|$f7shwjZfj?au?(-K@Ewl3;aMusP2qeX4(dIcKUtBi``qfPbonVH zdEIhFr^;xpN~=FxrZRq!>0-*cz;3vD;MdSgBb2q{(XrxBWb+?a<@bq0k^7D>HR+%a&kYui>N2&c5E=}ujqE?W`+rV)JC7!a z4vE3Q{wC~?-Cfz-#m3Oqz{1*z!TCQ$dV5>5aCuoVBm`W94;3T{abd-e9Q2WX!$E%h zMsfzff`LJT$xADXKtn>qAz&h+;9?@epd(=6p(0{qVIg3U!s9bx;!zNi5Mq&0VUn>^ zU?Py=W3mt+G7@4D6OoXT60nnFGcyuWQBsl7uv2o-QLu8b(vWkp(r~bI5Yqi1ViYE! z6QE)jr~fX`&LcwggPT`~mQ#p@PvJZF4@q`Wb#56$K1DNOI&4v9LM=8Nadt9MURDKO zN=1GqLvB0)egR=2T2WzcaV2&YL0UCYHdS?2D^W5-S#C2$K6kON?kdb;V&WpwDuU`_ zk_wutQX=wlN*eN#>T2rZYGx8T4jS6Vs=5xcM$&Q?%IYQ}>dqR{2CiEA<{GBX8eT^F zazbY6V#eAU4%(82dioaDKP(KijT~fM4P;zR)g3)$-Q6_I&CE@#T&x^DoUKhAZJa$E zEL~k))olWF9Rkf=Lo9vboxMX`eB(TVHLN2o0e%3VpN0;Jj@Eujp8nykp=lm5`QC9w zp=z`N+8p5~d`YI9Wj0*3c3i()`9sYG{jAl)opsY}ex$od_}LnSxLE{wIsf#ri1)Ft za2GB0m2dX=5gyDl@j(d zBPl8H+uFTaw26Nl8gzRby#gTVrL>ubN+Nb>+=XO{tZ=nYDu@&BLXgGfkZXIejr@LlLDD zi8a%SRlSRCeWT4IORW>zowK{Wl_`U@nZwN`1Dy@CU8SRat%K|J^SxC|Bh9PR9iZV@ z&_u@e@8-RkPS8sI(D3l!#Qem}#OUnm{O^I4+0o_YrJ<$$v5l*RKfB9^kC&KqvtzQ$2-fwt-iaX)%WX-qvNCf^V`$wgVVdGoAdpr+Y=xV z=&mkm3kF7zFCqLx*?sjq3&|VpFze8SvX~S~Fsu`t;wx!0r%dwnY{T8iU}6up!;)5e z?GitWFxRE~K@T-y zK7W>NDy&@~CYj-4xhZ(Qyd4oBj^9t*pg7Xc9uQ=iio9F6{e27Ko8p}U7+=}LrVTJ$ zOTD3X|9{Cq(^s$*VD5m-j;vcJi%66X;B$~0)O(MZY|z`08_>5GPT)5H@U%2$y2ZA_ z^>$HJ*>Og2+||Kmb^21-vwqk#|Hoyd#*37p;?eEZwZ3L-b?fM7huO5x_LN0?t!WzU zR>W_}xAH~0Q2p^dbKMPD*35cYSO%=Bu`Ha)Q7Y0m8gSj}<>G#L`l``Mgc=`VS6e9= zb06L9^Vx@e5=MF=jTm}5SRvU-FxI`jhnT9|WJ0LjbbNxuw(meBL*RtXuU1j*^ERTl zinO=*sjBZ3a3%bav62s42mFsCmVczcr4=<9^5E(QIWMisv&(6tTp z!TZ#L@dp-|LQ4~iuf6^?Aq^hX#g}U1bjqG4U91zLSFCFroU)2*QYTahybeDk)&SXS zup{l%f&T&O4Vh`#rMOa#%AIURPBA!arR>M-o1fJ`ed|ZE_P?AC8P~em^V!z(xoE7k zs<`HmqUGt)sOPQeTy8#_jz`MmzN%ZS5X@i#NjS+_-*0)p4$F{k)}F;NR3t=JmBYbn zeO@>SJsPQ+#Z7q(Y1$Vv$ub$|S9i^q<7ls(TV!p**YQ@KmUge-DLc{2)Yd{_$J9s> zzJLX+1T)c{wF`J&tV=oRFm|;|UP>MzrhnCJ8;5SBr^LHcXcy<;s7o;p+kt}YhlYlB zeRC7tOqf2i1pR7BzGo(bfLzdlE6_`j>wzQt5;Z>aq~Sg1_+ppG}Ju~V@+np5hyisjm=gfm-G37JA12Ru;HKy4_~N8h7De$ zK7)v`1TwgdvF=0{q+#BT4(Cva*i(I}3L7rZxF;(_yG789*e-HaAFK{$B-zhOkk!>< zq`D>H24uxr%4hq%*-b}tcP?JP``Gpuh6BZw)z}7rHfTJ)3t9Jsc13uV-+FBikbm-H z=MmKgg9HLCdi64$X`AQj{v!Px9E5xq9ABVDOmQ9`q&Ca{e=J*2)l~+-bE{vQ8wlWj z1wsNhR|cN|Pw$VLuNyT}z@u0Gw~fcH$5^weY#%HlJ^=$1U?bqEPYFQt`m)j(3p`FS z)_bY1Hv^HrN{x2`3*5Rvr=fwMTEJ_+9_Soxs{4JQz-)8U6ZBqx$@lQZ4Djns3UJk@ z^aTd^8hO?IdbtGZ1^56*YkcTN0S{+hA5s05F|JK1hX zT&OisCjY7wEk3dNZL*lvaoR3wg7M3yXbU|gz*pPp?BG!S0WY==ZS8h}OX+b$u6Hnd zhlZQelhAv0o89QJOvp2vSvwp;)r25O5ems{=)wK*#KniZrmm*BSLAu~ zmw6{2DK$=vvbG*o^$1$i_uhT=J+N*al$h%LZV#hqjtm_aU}N7;!Ggt>AN7jb3k?sh zLY( zZ5%+n!TPaH^k-*%KGJ>hHT0Sviys6kma2MkjIr;b+C(~8_Sx(Tg`O=wCgjFsQ@x-B6pjf<~#+f`HiP2 zJF>*}13j(Q)&=$2qC*ttJ$3+Qz;H3Yrx5>(c6c!}$KBb}oH?Ebo%56aPY`n}k#o(t z-lP^SUZ6e5J5?J- zX{|=g!+prJVXj?Odn+c zf1D0jt1b2JG?R(+MlCm*^=60pGX8mEqI>%e6>#xXzuWSQ=V_3_QdE!2E%wdwZQ`7< zZ)XfsYZ=atd9Zz#*9x_*+)EfkcDh8h)#nWU$nbg)r}8tB|DdakHIqz~GLMX_(s)o> z7V@#yV6-{-p&|(q^W6CpE}dBJwN*M!HR|ufs_avh82@h{tiXQybDfpISh?+c}%SPbvm!fcIfFPuk<&_(o z#9HLd_eG~ryiJN~HFopql<`gX=`cDv ziY({zYvkP$WzskTYDRwb+?Y>zL%anlVD6`uii(_1$QQYd5j5i@Z+fNQ$+i(up~eUO+DpN4STb2e0gwK))cJ#8b5+M; zhCs!F8tfLW0DmIt<#6fVJD^&}KYz@XF*^{Yl8M1E3;M+(e`?MCw>D?7ws=o$14J2M z06yXc@!KGLKZQd-I8oEtD4F784uI6{bjT{Q#4z=jhR*1zfLwcSwku@ha0)G28G}A& zo3}rTtQ)gG^)iCz5QfQ#4#}9LF)d{dE*I=~&n5U#pu}II2GDy2sX0bqp@iYmahiJw z*YufYGb|kS$cM?SzTg;npacv>)DlP|Af{7R`723sZ*(%1N+}lym(YvT~L?TA%RA5Y&P56(v-h=Qk>9S+-J*HL5)Yde+2pjtDnj z8!Y-b$uJ%4+vdK6@)_htbqb};01Hk()BZG6jg&A|VU(nGMPH&BF<5pn7Byh7F)^j_ zmRT>;oW{sf57PT30MViy=IU0_c9R#0;D?3fboYDkAvr>N>(M2m!W45`4W+XL&z78p z7$p}O$TfdP!`5d^QlNa;I_f~}s|d;xIN>jcen-br<|fws5mDv_4lA*c3BCkM?>t@u zgiTtxPQSKlhkQPEm(*da@GZyHn^lY6SAU#1@kU?2zSh*V|qEXSoV@v86X^=Vrk@<#$x?mgBNg+_kF1Q6oAK`lOV+0T}i6;*wNR>$SX5J*g zuua^3$d0ffsCxvV>Wh`FJ*|4Xg z*fhpo;PjZde~>3cESoq*iPX5HU0|8}fi;rDb}L^L+LNPJMvDL3l6c)bXU~R; zuj??FiRVF3pVO}PuL^Jhn}-WX5B@`<@2f5FE6{rC(SwQ?fynP|7o zMJfbydntfusMd0q^PRK{vv_#*=NtN`oB@Y|_{5h(AzxWy_^VS}wu~i|gS!xLdE(vR zPsbqocZc-Jyzg@RB^+$K@xRd{aZ_>43oEu0VMQ^Z2}oF@y={<-j?v1Tv^FVm%Qwp% z=bTF>&1T!RK<3@{~qv-v@~sQd+eMR-f0geppw0{}h$ z8i6<(f&A82P_$umCoIal5ih?+1ihNG3=Yrvb({e;6I8_LRW$lbDA9sHT4g6Ve87c9|)W`dSG@Bf|Ztd(2+J^qzbuJpzO=4bV&N|R8Zh>$?OeDXXqbLxt|7^MyN`} z2p{8w3aw{t(6Qz4HP!uG5-wbs{5Jtpr0^igF?}E72Qd7>rO0nl`^KVIHClS9qM%eK zndso+2NaXCVX$;d+?X0OuHZaN?P^ySJ02s=sh52VbEovFr;2(sRfwiiB zAykfH^0a)_S6FFD>(uuGrct2T&j4ufJTCCUTQgVWW34#GMyM| zY(lV8KRH>mfw!e)r=4Av<9ni-KGzJ|CERNNQ_V_$yA9B{m*G_j-Ll|Yio{zS0b>Yt zWUrEku<^(rD?7N+(Yol{LCIb~!qdg9ZP)gD~=D^#N~ ziz-0l>M*nExNFY^JjybQ-^PpzlSuH=#=dJN;Jk>{0Y3I?(Dcn~lkGaT9;asmTy7D( zsPaI(V`LfbZ|S7cJU)0)v@oh-4^biL`8x-~7(F~H%l10F@a_Y8Jo_OWS}?!7k6jRfFqQDnWAda5iQFvEi$A*X zzq~V?=FZ240)5OYML)aH*$CiF=`EQKJv}Df{wf86TY*=DG?Va!U9QDNC~F$l%Sn=n za7}xfy@*{lL`{0xkYb(mHpe@0uQBd+{-DTkv6b&PdAcbC;`HV;z1XdTcJ<$gpPL;R zKZ#B9c$ThK7&6TO)Hm$SzrG9g!Zp_W8e#XWDRBEIOq7+FCABDUo++Y9Z1Tu0geq!Uy5?%zsr~jR!e%RFvRW$(&UkJ4yi3HJ&BYQ! zA~-5&eaEU(3n$o0oTG7=K(NPd><$T;J;8l@7bZ}`+6&*XLR;;bwW4-+jIknrZGFa# zNu&#dAZ;;b&J+@OGIpeqHvJ8fe9+qgls-q_8NLGW3BV5gMwm}5^8G`4et*6uXGb-T z6>2VnO19*5M*jJN$Ucay7 zeFwWY^Ka<3^l%{Yy@%NBE0QopO-{Cv%{LL2y!XRYqUaL4uQ7r#EQ`Xw9MRT|R*Bh) zT`sJTj>_flV0^qN%4QC#(eW0b*TAc*)y@-N-JC9h{zxEx_7K>#I#cGvxQ=WYFY8Rk zdDkm7iw|A9dUti3wmn1zXNJT->ka|!n9oP!yLtt=D_c0X2mmrC33wJ@A!-P-2;6PKLw-2iBRs-5u z-h5kd(*wNUcMsuoy}r2lKG&aJRs$2ijnLGgrR4vfW0cmE_C?c#aZ4|@mmoty+W>-OlgZQj&zqy{bdxY@=y zE+6(IL!G0!m7txYz&&g}0DM^T_-MIbFV{i$3xyyn{%gSbxyY7%U!k6T%U9>q$S-!t zWfCIzqI-hzMgfnohMcAiMB(pELZk}E1a3`>o?As3z?y{T=c0xC6dU(N>_i z`8QU7z?pnE=mF`S#tLE3H}NR?9+v4>qq9h3nXc-(m3M>=;4#)^4&(yDr}~6iOqU^D z{8LQE|C}ey>j6*&7GG?pVsDJA-}u`}ggj%mrhdd&t(&&J)mTO5mbwn1gq`Lp#JYcZ zF#>gkXj7dU4?B5(Ax`)u?TZx6agd4N1I%*W!K&#>(+%lJQG{geR+HWh9620tY3(u_=BNbHKF{3W0&C1n zSbj~p*u5Dt$vHW0{@8K4ZUUWFtWmF^9b`0HANv{J5wFDN+_5QJ*>!e|<~lNm7$VRU zFwgPnxA&90-Iqke4q}9+L0XZt-!=%m>6tB&zUv)+_<>|u5}+x~YnF|qtAnchw;j#% z1EFY)oJ$Qfz^N=~a{zQNR^5z5hMWAy(>%1^G^@|9I28l_KZ(m>Tbu>mOsCs&cfEyWwZi1DWt- zMMT72t<}8^fSy_GOF(uGS(CLJPO)z$VNcx;iwQTH((yr~=$Da*A>?@(=bbB?+vYo3 zLdN_@U~7f2FXdiOC%W~`ZEFiAM`YFP{GUivII~9bL)@i2V7o+d{9f{2T$3vTlKt-A zT-M>P0TTj|CwR@?YmeJ?Y3@Q4%gP8lAnw&5{tA45^E^7DYruLUWB7tMTMZ;l>xRvf z6s(m!gOXhPMI%s1#^T$1PEX6z=k-X5Ro%P!;kGm86W^z9Ou$s%Oy_>O)czz=Z^;zH z1i%-e*9x9Cn{s9W^6R)fvj;wYGMw|{*2UMDq|d+-AAho-jzRbzhzgQlrBa*mhsSb> z25G@(96Km91jx@olWcqR8%^WIl{T~`ss5!A33{{FJb17nR@U?AscwE%Y;At95+Vc3 z8l&f;j9LQEv?z5bQ*x8FwI<^MQl4W>|9b6NxZA(j>%FxX*sf^NA4oqeJAh zvw|Xs=OC7PWo=diDYiuzqEW5-sB!rha|c$JACmq zG8g+C*)gvIb(FV0|j@Y%zO3LZFH`es_;}`C^3;>5~%NlLY3;!TqToKL>-Cv2^H4$GPnCqm*)F~Aw zA%1MwU0bw=Y$^K&oNNwqwJW(Jhb5onR@cwV-J{j4+yHeHiaJa3Ixl|PmhezFkIS9n zx_t0>rvA@~uBZ`bAXQSL1J=bnDEsLq!{YjCO%{yuJn(P?D5SC%(B8|T)ZLHLPDxXu zaV_QaA1KxY(94v>3NiY;EKeS$Ou&y*q?wbzIQfa0pzb1!QXe(5$MWEJabvz7wI7nc z@gd`FiVq7GeR3R`;0X8&%Md4g@Du1z<1BrkWAR!BFLD{)q)Gq-w~uI4nzY9xx$}Ud zd|}j~FU@eMEz$*EWnkH}zu@A=R|kH<8MIt;uJ|~f^dDz_B=nko*JHo003?e_HWo%I zzKtDRBdq>700TtlZ8y~+y2T3ng61p7knlA{Hb6~VY2cov0q>HW0Lk2E81m^{L(le9 zQz9K*3p%sHLxA`jD#+){ZFLnE0t9J}GCMygB@;(DKkm~t)CzY5iTuei5fmwSdb>-a zH2H5VK}iheK>kjU)h&5y0aBK#sQBh8!QrE7#j!1Z!L@7tDZd(_5u!hQ! zfC2a9O!D5=lf6h{HUGzclcMo}7(&39uk2VKxE*%r6HUfHjZ( zT9EZ3$jSx?jV6E~l%&xrD>chpD@D7Fz%kQ&X)DXuO*RjAzouz88qzLFen^DdM3}PJ zxuvl3^a3+x|IO6qRM4psWd0wu;OiQiycxyGJ?JpdX^6!RdcG#S%Q=dJ{~=%tsv+hH zfNwI7$3_@$xO_kSrAOiBjkk+8`|JB=5#;gRl&Xrb(3h^V`IeJ-f3m7vRBOUNZw{OC zvLq}8k+Ws4)1Fdp&gv=+J-@8cIbv51pk#KfVT_H(xegX21GWD-vj=Q;gAW(^fLR*@ zd#fbmFyrn3{`#K}!{Xsccm7bu*Ma4y+gI-i2JeL;_x8h&LJ(&%y-=jfs1>n%$&ATKbDPUUDqCqEb1igT5 z8EPXSlFeU&b=~QUUg_!nXe>b+Mlf$79z*Ip__6bPS%pa1!e2_DqQTR?DtzM}T8jps zC|_LaYYmzg@@$X!4Z2D+5hRsL@|>VYFWhZWb|w?b26+C-@nNfaf5c34OQl1iuLQ{0 zx#vbcl%JJXlRJss0I{ldeq=cUD`4&j(!T~DFIcq9pcU*qsWEG*V>!>E#F_oR)$@_5 zZFmJ?^oZqCBMdp<2^ivrlamRUjD$CN1PIv-7?ba$b9NvH}?@31lbL*yC z)-y%v%ePlIN8C$W$#+&zJ!5NxY^Mc`DR6tNOZ?;Uk^w{6-dI?pYKZx4!LmLA7{DY% zWQD5*^#lIj!`x9mwElBH?c>nP+2C*dTeRZ1Z6G6Z$0JQ#1`Ta2s|+o%;uk)VlcFTg zNNq2nKLOEE@Xv2BkQRy}DqoU2R@1W58t3k7sXHOlMJ@_fY@P_&IRkGz5RmP?#0aP z=_smMP-+@&U22HIKJQp=rJMlu-m7S4RSL~7wNOQs6}RO__D~3uPaFX6MO*aJwoj{B zrMlIIrflT{^FSZcp%lgS=|1Sd%k(TKkrE1)d&+GB6hhd1ZW#L*Ng*lzy;H0^i`RvR zT0YM}HN%^P|5Fzy7%z;&l|A>iHHnJXpDqThwZT8_e%4k6{PAlE$16%SQrp8+Z|SLh zNrZo1ke)gI2B3I%q|lOqgMmpw{3ihA|LIyF+W-EJot!8QU10$IvE+w=Pi%X@sspDyj(a!!*Ls8u%Ubmffhfa5?ispzuB;8t=sBh9F3#!tg} zoB`!Crwn^tMIq5JWGpYTiQs<0U~~xyT@+b$yh4PmEJN)U1IfO=-*e(Y+(K+B9gVu& zWK75tY{`WNxOfrkO!WZ#{Ms7Nmy#Xn#4j&~r+K|Y$y66d!unbQt4E1a{pbyx`k{_w ztXf@i8p$M);u>}fcTt%7PM-MHCuC;`+#0AxcnucDb=Z_aFqSIG88aG)(B<(9WEN8^ zS1z@cBUc)3_@+a6H{{FoUwKHrXu|lxy$}U+|&FmaElVEaXM|AO#px05 z>q{W{(<__mP@oz{2ke5Y`ag@&$j;XJ@6FS{@u*rhP6eE(K;Q1Z z{i@fINcZ6+<5Nr58;g23mxT598ibKlJb}cX+RkpECWJrna&NssLMwL(HJT=!%i~Qs;l6`k#pIL8u=qA;s$24=xC7|PV9BJKlF3j2x_uNTwUQ;*{ z7pT*FmcJ^@^V?GL_}o)%X@7{(Tq43WLRQ02otzmduOXSGe5{)1zJEKH$U5)kNiHzf zf{kl2WL{Ps-%M#W*nw`)p%_4DIX1c=UN8D zVc}|=k%amf$BJM*Oh(9L3IAiw=_~a)J#-s#@74Ajh11; z+JCANnKO&Ne9E%|zU3qH^?-F2>b#;o!?eHQwK%>yovydDT?b@XEhbsJ^zB7NiOqn#EZPYNZ~jYR@D=9A@jZt}ve@aF-E1mfvuemrulkvv#Mbuh+#!I{j2 zdxt+nW6rNI)R*l-f|)pypy@`46Hq27m2Zi%t%3En4b2wG66>B-ytiRebNxz zT+5J_y0E3UGJeG(iRVW7=d+yT!I<&1fzeHa8qnK%TRF`0LFExvqV`qs9hGv9gHc;% z`D87L+)+x^+cuTkBxNtwlhMmrF)bJoU3zb2RE-DUupKm$aK2mM_-gulTlYrNH@X5CKDbQ zDDy~*+xu~as)%%?qlIL04g~4A`pOACH@{vXW$KO+b;V8l2C9DtWS;lVT7T&#X$w_r zw!w1ZTcTy&^vviKJ*8PoNudk3Fg$bjhN^BOl?@wuI+yGybOODggvU(Y?Ga%cBYK%) z`>GM=wAy&<$2DuAec!|wsnIs7?$!b3@r+tG>$TEqtLRYhMhqMli4Cn_L7(@aMa!)R zUL9W)f6aNK>oC9E99a??4n}N2zF38%o|l>15xh=!sy8zBYF~7D*3OZP@f@3@!;7Ho zS6TS>%cD2>n{pM_$&)T~jJ0uHuzY(YwxN(|MqNM1&^|UrL*m z!NJvUymD4mx=+#6_Jo-*Gyyh~Mhk94a8$eW%Uj04%Ho&fP zJe8C-nqujb*dWC)DDUjkXAFaP9A0Y4V(mj5GcQF8EJje-@LP%RWBB@_v=>+2TJ_c8 ziY3)L`fE#}g@T*f;7>3LL*gt{4YY~O<>|NO?~k=U*%)hw-k2g-bUkF0 zgSB8^iQ*`VklW%c5?>+fSjvH&a4JQ?jYS@k< zT}bb~;Z-TqC2JZfbP{0(->_nMDQBCOS!etac9K1xD^YE#z^>$NZD#pm_g9kd84`*R zJ-h~UG7d^6v8VT6K254989vM!!xSIU+|JB}C zM#YtMYm*?sA!xAR0fG}e5Zpp=cWvBhB)Gda?(QzZo!}Z=g1cLQ;J2B%d6Su&neYDj z{@u-5y-u@wKj&1{Io`GjphTx}o#9c-dYTda2n1(&amXg$ql>G(SV$?&X zk$Z?4tEX!A%g{C7^CM71Vk-!h8@5QM6>Sy*vEH*(+6@SqCV8*64@ zcFj@P2OyA7PnwTc(LnD?R?FK+a4#>E6&Wb?FVZ%fIJbO#cOkL#?RLepI4I7g| zW4~ylA&NHI0DF$}Sp(-Mb%#poajsZ-0hvqq+`C*MH|{r1W-ZZ?Qfm*J)|Xn3Q{p>N zK2$!qxCRB&zs+=hp&g9>M?3z%(+)=Z|DzrMM>`%%;rx!D{z5w#>Hk7I)GXH;p1U2D zF}RG1EF1~1dh60lQRE4+H8(M#(H2n$J|*w5cX##Arj!ZV@12M3!;*loWX88KXt`p? z@1JSZk`iih>aHFZ{n%Oqv~BJHd;k@HIGT2MzAg0K)2el^BW={cT9e>k74RGo4i=kj zYo(6Ym`ZXCHxhuY*E&kdoqGXOU`3U??UUbL zyxx`%GeAZ@zc1CMm<}WjOm2i9hrTEn$HCc@G;G*aPY1X_D^CZ=ymV-1-NGM1j-v|y zKv0&*IffWOI*IT#y}l;?&_nN|qFd{rCF|Uob7`bpis@S$Vqc|Nw$HD?q~rd-NryG) z%Eub?L~RsII&8qC<0EA%L&~3|V}BD&I`;o09ply1wQp@G+y5jTxqp%lr&AJd>OV;b zFxySit?j=_N7Sk=96;y=Pt_yo=={i3=7nC8-?Nc41STEpe~^xeefs^*Q84MaKRHfv zni~Z4eAh0}OH`;r$QXSI)s0n5|JeXf*Rk2;L@x2EVRH-t1Sd0;?yzp?c+28qAkz3D z9!?%W~2u)*1&e=a_$6u`LdHvZz|?Mew@vc2KZ* zIzmo1sF2%Hoo|fMoJqaxg}V;b`YuvE~|SMsh4D zw&g2E+zdO-Bz0arNx|QL!eR+IaYxKs#WaipH+7)`T9ysAPVE$)&uH>HE<2XOLCYvy z_0yd&s>@HTQfKVh#xbQT%ti)8qc=$~13T=}hU%X?k3X;FU%WiyVab_NhbHaYeJx^0 zDn>v44N~_T? zCXFFeLq^6^1;+335zTDUPhc&8{U+pmo0A0A3HO8%P%Th+Jdz@&u`NX z9@flI;tZU>p?~3Ss5fs++^aXBJu9i5HLY%`aQ!$7ihsoqmYyyb21j9-MlY0p7w0?* zCyd;l@=d*k^fn`13du}^Uq`47ML|5ZFzgtSf&*VQt-C}MTNSz$ImF%6?b0{I6 zgyg8QqFaaUHiWvJ`Q%3z;dwXnM`$vubhbfx^I~Z^NQiJ+8CXK$4;YTfna-5MSVk5e z)cW^KrVUJLF#zZlW}NTeW)U>J!FW4n6eg$siu#<7<9NlGmb;Q`0U5H3Tm(fG`y=jL z-*@>8*{0T6NV9R|Gd(#(c@EDaT%cW4P#gJ4X0*mRGki15ehpbhJn@ZrxV7F++O5RR zv{DUV4kkJdO_Q&hyHJQ!wdz&Y>?QF|=^oW{l?DRf2nasxP`NwP#9h85HJrssgR`5q zmUp1;NAmJAS8EN*a?<{@o$_co-8ccylqs8-n8r>hdu)2_+bUWDU17=eV&hfkJkQvg z9?JIUa~%K7Vt+mUUc?1fJz2`T=UPnFL8{>~l$wuxBX6Dk55A$VIF*Dg9$XQbeM9H> zypWqLUBKI-o?hMENm401Jnh<~%lQ+=H5a7^TcXptkcA6Lj8Gl9DQLNE(t*>_QWPr-p{wKt{o4iNeS@BECcVdEi4XZU zlRs7%MGJT{YTko*ApMC7a1^V%A>q}EQ7f>3OgmjE;D48oNEk+=#{-Mg{d!-vQa$sI z0jO>mZ$#`|D@fgCRzb4amVj}ksO_(*jr4xjN+0KDl(wA;Uw9?m6D`x1#GXbQwANs9 zva5d-Yl7*KBTK-`k5g#^$}uZog|)zmHH6u%_}UlyzPz9@a?8&fN_;jH?xpx{M!xgP zm|G}Gt1}LFkfr+i`1c1Zvj@mWrlELwAesbb8c_erG#+#N&2=n{4FI-4Ivah1p{Sw9 z*oMy$moH#=hL;{1+J>^f-XyJ!#ZMWU{xlJ7u_Y`@Q6{@^H*I3ARQSzOSas5Y4t{TN zWq!LnvmO%atyD+87RpB_tGOiUJ`K!FK`y5SHkPm$Ts`e z5Jh_OhQfX5_W^q2H%N+iy@@@O;b_k|Snbhn9{0}V(mtjR8<|-QK+N6HTy8EuRQFzT zi7|3I)N`^M?>bo`jn+z;1p0cW+W+FsC%cR0)NI%2E(lu$vW?6Lc* zFO9~a!AsKK;8fRtjt~7&ChOZ~ zdiRr3x6eUq86%-sBKJ3s&v+w_i{SP0gN^J=?D7<5r|>bKbXaCK{$2auo+OcW~9gQp<_G;&wf%)IM`r6kEfHYdSAL#Nr|5jO1jUv{<30tJrXzhRoE$ zCoj(x-;4t*^%^+%dhiW55uGZu!M`DMi6-qzMYfg-3~2b?UNRFa%wi`U&6EZ1T6;9K z18Dx^z9u0mfqK|-i{#xfQs@21lMll2hS>arN0uU(&ju^qsI~h#eBz*izWJbKK5h z`s<=MXW$P{aX~t`5wK}F6$pMXOq#}{@IS{pNVcrB1&KUy7?R-|lqgF{dz;9M{Jun) z&tL*yqzF0>b{f;Imel3IJ^$h9pxyt&?=g4# zcUSuFXZxL(ftjTa5b$r;_&YCf0Z+SsKiBVCW@Tw*XZ7g%FFiu|o0b`y>lgxT>G_R; z<~mlk|Kj|+fzZ*@1DFB8<7xS$k-y`5kD2a2*8&~`OY?Ql?-#Y&WpY#ObD637#b_pD z^Wwf;+xG!M>Nh7aBz*8JqE-;Sm1ld6j#;8X*~Vh_i5%1kU!UJ-J9rv8JmDYRIM6+Ac!jj}t|4c(HWY2PSH4uK^weED4Bp#bf)*bBAm4uHyhJBi|Q>p&!B4XC#m}=u!E-#G=ymQTpBj57fMW0Kmvl$vx1TR|z0%ToH^&Mx;z1ref%JEiiOEL|Y!uy6 zQOJ_5p+b|>3So6o(v^&cm02+VGFr}t*SS6fiBw3jr|ob2f-J1cf-@tR4^JaePuz7_1Be9ybQ(kOE9J!2Pp1&Z;F*GHkp?Uj4j??-W z%{tmzzVr?a4Z&7S8^u7-1BSNv8#)Qu>j@^b)aF-R7TpuLtxHljv*>nIZ*=)uyc}_3 zWou>R_3@(l(CL5zh~%O+;85^LRE;WOB@$-J;J!z{2PEzr;cXg@+38PF%2ATXhiff5 zpGf3frg181$1$tN9mzGKYOdaYy9`gfMON&QF5w`z?y7RND2KMDAv0v_C+ycQabY0P z-;wF5_6OcVD*?Pd!9aOt5Y!t;p=xzfwy2HVfDK`hlnbQOkbI63Wg_ScC4ADEy7up4 z>L*zjzU3R|wy_@9Xz?bf;z3YFW2K9V)o2_3Zbf3xG3yddQEn_* zH0J8a`A?D90kImngW@c~tqTA}cMku=s4&X+$s74Eip36S!d^ypVTdbt+~Ex(aN8Pi z-5k!)FyFWIJP183hNwlTkF?C~t~Y-9rVzUQy--J^$mZH(Mc&o$hl?>kQ=*}r%sm*z9BwGQ}bUB{m& zK~|vWux3o>B!}-3^Vhh3&SxKy!}!?L@;ik>5MRALegNms0%95DXQ0H-a%5z zDxjNiQ!S8FiNY&E9xZ9iY!z`PKbqF!tM=7E_)JOd4tCv$}5JyV!7)3|~whviM5jAFZMSig_orWVCEp*q|4q#88!( za$-&dQ$&0XEiwmz?gNt)B zpb6BACq|QTEaIenBe^rqIBvOe{L~%gjqz}8S_G~_{mDIEkM!6CkRNXJov!~Em3hcn zkYLKo!pnh|f@yNCi{EZ(BEJUYsZ!kcE89d^>`f6<3*qm@=zics>14CyyuhS~cBRyP zw;H<6k}@J#v;Yy3VfW5GyCiE|SdBjOvbYQpLAwI3nSa$+PzC6fSthvNP40 z+xR69_xYC(3kB%K>L{th1obwd>`8l?_1{8+@K5jthYsNJjLJE_mNLHg(P*kJ#_Yos zF4L-=W^~P$y&Lx=+BfU$;n%iJc@>wBj>u% z#Zqbxp}CzTCwckma?+KbEXI@$kHhicjimkMBGqfO=UJ7U_ZFJc8DHay7M#+*n}rY5 zRBhA0df1a2F;IJ#5 zoV#eUE5yAGIi4c%Z$`S9`4~_xb>ScZ=_2Ipl0Xsm#%@~n>RuUMLZJM%`HDx3tVCew zjPPQ!RHx!gwr%x>kXJTd(LIu&YbU}DO4-w^+5n4*l46FSTdPeG)C`>$+pRiA&C+cf zgxp&UAtZ>{*OuUtVpgnoH*_RZk?0d|x05^vu9_Cxt6gtkQ5vWfM(^Z0H~uUGl$!Ku zrUOh=3fcdS$smAdKEEz*YnX@6H^khxw06Wl6;dnK2RUVZO~T+a$Tf1N7+PG{#89Sz z4;7rB>je?@oq?q8Q11M1#ABlc-@AQ@2T6q6tPzQJuM6yQ`1@}~V1#e^^Kh4B_CfZY zG6XKE^AV^^i0)JHy`W!Izq`Fs>{N1hx*_BtJNvjDr4sRd4>J&9NNUyVo+qPZ%_Y`= zEHAAob6-EDtLpPWrwf)dHE0ChJvN(c)7-Gp++f4D$cASmbaiO5l5%Voc>Vo*J`b)F zh&DIPJ+YFrgh;9@ItyC`Rq$pM7DBHf9!7J;7=`%bEt2I)HI1UP8t=4S9)Q+=ILho? zen0>^-%c7%C{-5Z`{5;hA~~FSI(fS~LV;=}Sqck5HNd&Q6S>stI=qpP=SsZt)QIro zO4qxUlFI5YBAwo~)wwugQN_#KZP?4e6d`h&<2*8w5VLo_oEURwahi&~$jWdQ;!!*_ z`t!1sEC~wlMQ+}a97uW%I!7P)>J(_yB)!p#Fdr^Is1XBwr>C4szSdkv&OvRLVZqPwOhjW5x14iLkzV`j;z`Q?zR<@M2W`2$we40SBQ8LHHg5#VZMA^gCI)RbV}ll-!ZA;#VZ z(@B6~N@tN6FHvz)DGFS9bHmH}Jhlv}Q1h&SGJc%Ji}lha6Z&)bX)TZZI3I>o;Yi3% zQW2p5XYKo>c$ZV%YZ_c8b|9wkh-InUUXIv(53Ra_Bg^b|;>suJz@1~+XK6fsA6q;{ zJ3I0O&Xxf>#tY++6Ci-{htfW8Y-fbI+@yIdX}_yuiDK!BarNwuA$W@+$ zT$rQ`E^$s;j4pjtX$~T|6EBrJ2|GQ8#M9N<$~)>X(z~|EZMN0d(=CVx4n>C92{}B{ z$HS99w&-;A^56BU7)~TlPH*nNF+py0tpjL8v53E{4fq0LEh-Gcq!X)C#@b)W-7D8| zPB`JDPz7PF^aoelpVeb;WTTvgC2$3BJe_$l*wj1K9N;i`%J(_Ld*pND@kJ6mz516J zroQS4HPjLlYl+Q8&et_QCUEj4!`=*1q(}9ea+lo~vcRPL5|GCQ20+z%Nv}Jy6jd-Y zU^-i~8=0>kMZ;&O!Orwm>jjOUAfgYPjS8r-E+#-m)d!!r9tKGCZlE?N(Hi!yL)lO~Oj!mp=#U&t&OAE8 zCPkGX6mugQ*#FCXF1K&l4W?+R;KtzFE@}FD#Ae>|n8*hcKWMBayhIfzPxo`DxJjQI)x~4HadfDqmcDi0I7~>x-7>%eOt{+ORKV#c)y8{BBl)_^ik=c| zEysOp1T^DMDXw;GKH0lD8X)L>Xwl@)`b`x`sYVDVn?s*pC4t=UGWZzKeY z9YmV`T39a?%eb5lap;yor5JAqVI*d(SO&md*o|c4Ov$z?WmSj@-ikSujM`3#; zO*ND~O;(oi$yM*cadxDyKKU$?SWODck)`FpE^lZ_TZdyx@fnixDUtV_v=X)~WoSiC&5d>T3=`D zF3yAfr<&lgEU>5TtTnKw&ztK?jkmZf8dl%Ir6!sB8Fyb?it`77zu9UbW)`OG+AD5_cEV;K1G{3=yuKTVSsm`M>ySlDyX1x zuLemyeH{4Qr^%YdWe5Pf7&d$m4X4U69Wtflc2OieTPY*xV!N=L&h;KGj|0zNdE@nW z9mb+?EHeTn2QFnC9u)@QfFK>cYa!i|GBSO-WZ#7OxV|9@OU3%V`;KC>lYTPB%B@OP zqGsL`0)>X9X(p2yvMr{)ql1L+#vSf9f;h~ME1w`V5thL(Y;AZ?nw~$t7<<${b)cg!1kdDINsJ0)#)mW?2)|hw>jw*JPkuqg=BAYA0R1+ha~@zJzzPaXA~(MNRu6>&!fib8rIy0%shk@@_-kg2Z^o~;$5&ky;iy@drwiHg z$+U|=8R0{q9_|r+CBEA2FZVS#q5eD>`LgV<5hWK7g|n%wGMOcC2$!7`{8?KTBQ5{@V+s=I#9#H1tiRG zpJ0~94RF10(yj7KY-&tXhsOGv?u@G{^5Pq;`EdY_9m(3P6tPq@d+7_ar}-~cKb7Mw zjifC}-5+T^q`DyQm;@a1F2&80*Vsn9a7Z(^6HO<;u$f!XZL53R*|RY7<}lB;#vc+X zwifZsC!9sHh*3p%+i3dx&f(em5mTlCv?wg;~h#lohb6U4QYj86qoyF(p&FFW@fhd2ogtU7Pp=(6r5@9 zx~3Kgz*?K8Jp-B%H=SMcNOaUSy-R;WkN{x^(U1HAYF7_7ZQ+i@@;R?4q@UliA%ww( zRs&=K^`1<8^n*F9VCPaWvb%_uuHX_k%`0YukoLO64o7DBro0O2t9UL@G112i?&9Sc z*o=zjOx?o0T|KSePUIbkFz!S?*actGS3Ia@Zk7PkuD#>!IX9S6XLorqFFZiin_PtLxfqE#9 znz0S8JWhvMcnDN!El56kLvJ$z-g!UKL$e%TB?1T-F}>}uHEkN4VJLMw)E8vIS)`EK zKIDKEE1?!&V9jCqdt!R5faZQ#UpiwNr5GU$giS z)&oZ27L!DM2z!(9_iLxRI6FptVDa|D*Bby;k*DCb0lH^ZICMKG?8+ZeaT(rCD9paV z%U$n(?b+a~jv`E*zjgFiHl8*+* z8kW(9wRIaTPQ)-*Co{Rj(9_c1$*>UQ^T=592EW_67O$dAZ{Rcx=%@->l^kb2GAsz+ z?J(aFD{(Bfb1V|Nf_e)cT6OjgcEe(S9;F>L#~}{O8t=_^?W^rCEXQgAYLDxT@n3jS z2_f)o^l4Z&B!<<7r-KKLa6*Qq?yP9f3Vf})pG2qcZETTG5m&aa-#!A-6Qx?78V>}( zh#i!=#`dQVJvHQ8)gEaa-@*nzdltM6+k==5euZBe6xMEI6+vA<@I*;u>syOmNJgv3 z^{TZ>WlHFJ6^Y0Rt7`222^Ah7ciqLUDamGoB}6g-t~sUBWz6O1i@s4}9Mq62aM!*p zDLoK457AA|cLqu?0QHmeRiR{vdu{RwgFhhPLkE|*WbE}yAIG!YA?OthP=_cbQzbKo z@CqsFGm}Q&+xe#@w{4aYWT?ubHtw{eL6Y|)8B;RGoBERa7;2|S+!E-O$-Fc4RHzLN z#xpg6W)~u?BRW-)HYgmtbj!Pbp)|A3M^8(?iXcZoCo~-J2Iw#GTh%q_xv$TR#eFlW z=48?v8&VlOT#ZHv?F<-WB_2Taxs!!5&(<5arcqA%Y_$Nw- zA^stuB?9x6<=LIjt%Q(!46fp9bo$0ttQ3IVIVoo^Qk(44!#o1XTA$^5rmZ8LJK(|# zN4EtkClc+(z1r4YU}5kJ%Z6ifob=QVV4j(z4M3vgcmjR`h+YsOJXNm!FwaPa(gmd+ zX~_|8vT=YV`xc57)PzU2Y_c6tKQCNu{J)>A2q$js_dT4ikY%lppa) zmV-2hl1D7n$Jj@rx&xI#;FghXmzO~RJxM>J(k=Is>bR?v=TuGBuA6A2$B1;?gNR^( zgNyS6^+7PD7CGU>tbkg;)6)JW0fI*5i}^*|x(0Kc?%b7La4-5c3YsN?`ko=(4$fCv zC$QJp1=A(zw@M{uVMcOzliplF9tD8do{OUi-hrTYhR2>DmlNz<>K$P9cOF3mM&!JO ziN5pt4pYhnaTy1#Qfd*81#*F2Y*T2qWh^L-IOuH=+prP>;)}37u`=(&kbI(qaRT0U zY(oVi^cb{MH_#5hD8Vp}YlEk!wjLv%v#gT*t_CicLY|#+6QTzO*@bFo| zaj`(>gF!jHyR9Mh*wM{Uj(_a4$s>@SaC(;VoUS-tW~x2RZ{FT^xeb3pOJY6;!t{J zu*A2n>faV*Fu@Bl5<>EPv|^IN^#2LbgVUXc6uB+u8BiC_sG*QG;3H)!p+YtgX=Q=1 z@K8JIqZ2X)e33LfXg5o7(WLWy+HFk5M0kB~n=cO+WR~|WCJR<^lH-J@^E=}5A%-MK z?bNcCq%Jp*8j`dIIdgL$2)D~A#~kJ?YgvLMUEzp-?|E0-6h0PTv)SR8*VEUY(Pllsp$!}qa#$& z3xC9ozRmnPPX3|7!Pl%|(dJP!@HFU)Exp+XT@TN@?P&C|_vjxo;c9tW9$ZAlE~$)d zt?23}4WsvneV8|2<{5LO(`P>+;oyS*Zj96DYasg(&5yjMft#1)?bOr06ZEfirJ}66 z`z&T(T$QQWTSe4dEP%an`b=KqN3>c@4r8ITgq)`KzuRyTJmSCDkL?$Kc>Rc1{<=ZafW9q8BHAN~qN z1irw324eg>(65EY9|a{p4H5OPTSxrx{Luq{FGT*+a~FL7|5I7=A1FV1W(r<1{ZIPu&$#g40e%(rKdOa)S~TY`0KY7+{vF|; zTi_<}AB3N&0DpJ?=N7CA{^I`6E%;R|^w$<3i2MTZFD>|0FZ0)XU|Z_15~IIg{I8-6 z@O}4-QOJNj|65)2!|TVL^UKE|9z_N}?G{|7{&%8?AM%aAK7&8~ARr!f13!&f?tkL^ zRnGCxNPoQ|i{BvqD)0DboJY~cPs{xc&Z98pPYK5V7Uk=2P=3lk{=HGz*RX*}3(vPp7Ujr0r@d*I>(FE))|11A(o91r!ety_B(ysgoH2^FKv_Uc}tW$=HEj#7f`E zSjgDW*2tKT56aQW!C2oK$}Ou~TQZiUJ-TP5cI@F7?ZwwGEKn(BSK8f;RoGX(OKVpb z{YM%--OrcQMe4FRl!&nk3HUheahL?8r+6Y^;|yl|kCz30+s_fq)Ne8n^eHoE<{W0) zqbuE?ug6who1d4V^d}WAw<%~t-cQRemHp@1A9sZmNFbbf2Ag4NyP5PMeiBEWz@Uwr zULMF@I{>G+$RwmG4$dd|Z11O=LQFV;4Fd>TQ`^^T?MCjlpFrKOMf~2M zFKToxhbNj|hiLlaw@8XwG)TJdv%A?iyf@TuPx0CBlURO!@1MKJ4Vm)4DQ||=>IdkN z2A3s>kZ_Q-%zFwBB>{X$-?UI4e961NA2xTQ@MxK4;1G7A0_gh&~t_!k&*aR~Rwpy_FnL&bumT7uxmR<+V}lEy)Lu-!MN#FJFHVg_#h zn@{qBc7Nb&+Z}B(pD(1YKz(PCE7p1!J5AVZeQhQstV-Ya7bVvh3z@;6yKAs^AZ8I) ziQeD0zMqB|5hy$d-ji!VKNw`n+Z_tOR5is$Ns$?qhG}WPd3P+@&O+BH72Qw7CWJPP zka)kc`B~p?(&=I+^OidfOQ>bX|LyNTGpQjx}p^7baU(Wz^5wv zBtH6Z#M{`^$}y{oLWGoCv#eF_0Dlg{v=>dFWmI{;c%6YjG3x`=JYxjYn7Qy; z|DF<1p6usvPDrcbg_F!meTiZN2@g+H5LGnEXM|B{tKXdGx!kldH;IqZxXm3@S+pBy z@XS}B9>LAS(SlQ~P$wzQ%&F<#XSvE-L+4kFr<~xa6P@B>eQg&uI3IUF^~j!05SMo7 zkja~71SxyrTcF4{MQc#?=tA}^lw$7iDQi)C?X(9(E2D<1ED)hJxKprA3#$D6-9TzI zPwq6_(V4-V*;1qTl{9L{sNHuip~7tbet1HC7zV9ckQJD(z`?o(LCdC#{aVcyrHJ*g zf37fD`K+9<@)Tk(Q%Hz4j^Xe(FW>q~E)+|+b7V1}#GWV_;WpzwMcBi^8@Dm|gHy(N zsd``kxeBg%Sq(M?hf1_CAf5IpkuqUAg4Hq~g^zo9o7OBV?dE>T8i;Nr$bVx!c|&2w zoh5M#DXuFmv3I!1Lax7AV?{Jfl(HMo}Lra}nP4~Y6G?e|fyDV!zC zgZ>plB)Ls0(b@tA&3NBA>_T$OVCLlL{a=;~pf3JF#A6;pvb~EX(?gdY>m_ z{!pcyr8ZTgzG(w%7PLEDsbaq`XUJJc={w3>W>J+Z@%yZN1dCk7@sdzlZ}YHv7^@QJ zEor0#tcXM2i01;Let9Wnu}mT^sc|H>5pmx;k$QovzS+%~aG_Z;)GPwFRX$_76K7;f zhCdi2lp|wnlv5X00x5xHt97tPq8Cac$q_HvLe;Kf0|15{JCs?_+(nX)E`RuU34=Gg(1RypCS zRQuf+@9O=qXLrppNi~s&zrPT$Kd^{m>(3{QfiV3*=tl#RU8mCbAg{XF!8}r8+o}J; zJOR0a!aZ(zs_N0*Uw8hdj(6QgGo{epMty}Tj_mxMoA2PRs#pE! zcn#$>Vx;lg0#CWs=ij)5jVjjJdPcBEWqT=8x83ix84>p(u6W6*Dr-! z1Fl?F9Ls8zTW8w-s`KR!rEu7I?4uF)q1A?*Rve6@-*)N<(J4dmh0r2P)k(o9W{YZS zTNq{>q9gU52P`Mi-S%);&}-EySZ8Qkx?%a5Dv<8ftr-?m{tC{HB;p9L4Np@JM=GI? zRneB6{DYQ!)(_pun%NqoCBcA9NN=^=RE6PcJd>q!l?%=m5n4(|%<*L-H%{jeSBHqh z-ClDp7jg@79QA!w%lCtlC)|J#$7>bu9$9X4C-ddzVI@OH+@SSfu7;gQyf(XX+T#v0 z@a$*)545TMvbJNd6(?)X9Z>BhYuPgkn~-_0uVVGu!CTEOmtf>h-Odtekoj3;CA*`2-Pw|00i07sU}pVBna%u z7+p~uhL+$p-Bu0+qGEJl&Y2at#-*rpYVJir&7y96-uSj;BUPpL_urhS3XZKK%MvAe z>~YD?Pm7o@VaN_td2}5dpG7-+3B$%o#maf`P%Mh$gKl7N> z`k-=ByE4ZYPHf)4xfc_u5O^o=PaDrs7jyOq&$D-~Fn~|iz?*S$`;~!_q~Y)G$Z128 zPE)U?_HI0J+l@r=02yx=KrDo18qtxa2g4Tp?b)3$v^QTU$u4a;yAu`S7w3k%Hyy~| z^RY1FBk7`F@MEj|qAeV$U4swSOiz7NDe96jn+m^brLIX2VvXY>F?zT57vFUWk$V0d@sIH9-p^+0X+Rs>{DhQ#!xVmu4uZX?GGN1mN9x&r`096=$ud#+MI=0f zp*hFFecqAiH6E#;4$Nv2ilL@4qEW27nRu;I$ObE0{eLNA<)49sq1iT3Fj z6cI=TJB*R)>%!+a7*7zUKGXc^Bi2fH7(2T4=_vY7fy$B?!9+TM7>kkuDh#Ve5vtYZ zkuy^vC!%$PDHbIacd~p=hc^~jWFJJ1%$FwWFx~`>ElcRd5-We|@n4etbO1>UT~O>X z<1T$&xfM_PZ9h*2cL_?p^S@!T&mqyJuoC#gje*~kIeNRq_LMx^vktU*J&|V$2tMcw z#eH9NC6fK$+EVCjVIS%>)|58}9Zj%X!;5d*X^;z2kw1aH#eugV?l?tuQ=I25eq4gB zDS$Wtvo#|yHBWLwY67#^Kf;m3S7+%@oL|)g{E*P5$_ygX+^CG{i^tG@-_s{(P?jIi z4obU_?NS6ro|zt(Cv_*$XljfJv~L(mlIw4*=1kla2dPs#{T+~}^u!cqdYSSRB#{If zt|l*F768Cf@sbq=mnu9fG+625RMCO@2YP8I5~BP*9G}um(*CcBMkb#!LbMSHfC#D8 zA%4@BVB#*E4=GZ5QWnqX4Oo2I3m?t*vh6nn6Ye7ARZ-9^cp~a`ks)NMNWdQjWuXQ6 z;oRsql3B_@3~*v#51SW1%E>fnA_Q1bxC5w=8!n{~(0CM))6f9$he26j0l#o;2@Hwe zp@D!%G?PpK;0Gja!USR}8JG=XZ`~lOcYG`e(@A*4kSw&{zgW~J5H$~9Ao%>Y;PT?< z4LQVZ=D-t@jkMx{Py*~C+}C!Q5j{Z2$B*LjgRxDR6Z+jCznKIi>_iCJg;W6GYasDx z)@g(GXf%v&gkqQl)HZ%qNqCLoE|F}0xo`-vVqVlBl(3Bxh<{WhV%LHa(d_&Zf4yZB zEKq|akrY`nq*L-*C0>F#5NLF&J=hj70~zYo#S}0hbFG#fSs{RPK%T974vLfM{r#&V zCuaf(T_kREl{7u&IkU#a#R*gWa-Sx$f zJ#oQFN#|!@ij34)X;qC#Plykj4op$ z-0ZY67cTs1#r)7t4qW=cVB@_TK`jnmIl+W?Chlmhj^krI|AEs9K&fhCC^*UtI6Elej; zh!A}g|Dusv5lY-t-6ENYe#t>BU7?{dO5L&ym_tR6U6}nRO#c^Jz|&P=lK%-Tv5-Ot zzX;v!{vmoC?uH0@6K0x_i+EWKtWUlsb0lotWqch75BA*==d{TAsT2X$MpDHm4=05J z)l=QPZBpf7n1YId+X#EW{9)^T;xSVUs&20>f65HA^>(XZE-cVTmM%gAns2f8C~@=a z#?=N(SFGnc_O&@OncGwakm9V=aoBil=;#+vB2wbs88KOy z80j**l<43>oaZ^v!rrZ(DVlMq1ZN&8Eg%V9fsGn44(fWkm-Cjr}5V%oB&0A9^< zE6=Chg}`CBT8-#J5U05#+@l0dSfp%x_rr3nzi@& zYPw^i(nUl`fIjdtI#LG`nUD;i1USUXKy%WfKF)B?!eCuX->b z%++SUT|?L+|55KBxG@5(>;xo5;&uv^vldZGgXaY~^-F;W|BSAQkheM5B((wz+suJ3a&A zFFUfT8Lv*k>-G=CE@>PR$Gr8PgkgDol&AtGgie2@&CK<|%^>~#83IzI5Cj-dI~!5c zgXaU;$8G$<8(4ihvtQK+!(M+7%CW6XB;a>~QqbJ|(9%j1hgO6AcEb7!%>t$YXM34O zt$l;@u#-8AhN z2c-cw*pzJcjK3ZMOKb5q(punFDRaSM^;masKw3(9EFElK_Ft;_lT_)jtH4Atzz*PH7)B?uK1p3FynMfZpotj%$|(0LeYH5o)JEp7M&w*t_~*N z8f7#Au8z#rMqF(}sRpbqofO)w3DP=e)?KXUPBywJT~Vz<8~r09*OV0AuITYta1N_X z6*^Kq<=N+NHacYB)pkCeqj{wLk33ON9sq^vEyszLX{&>PaDAtbokBqrI^7*^r)^~e$V^xdGldl_};^!lK32*ZIWF;56jcc{zuJ&?la9&cpz z_{YZ850C=U!90|)jnRL*r~j(|7_LzN@mc>~H)qTF)J+x(a!;UV6UAOozOJ!7HLP$vi_20&o(C&@5jG;fI0 zOR$-T4T}hhM}#y;Lo{`g)5qb@4TOp=*k#*w%*50ivd34#5XQ}geg$&|6FbWG?BoW~ z+P-=D>gnx)Q+7^uoZ)@3dfC(zE^`&eju*q<3tykVf;PeqMFEWI1NxR5n2Ihnj%i2l zApvcg8^DsCzKynXn1CQSz@ulXOSR1n#?yu-M7#)Mf{(0dX6@4zKlED=%9SYA0ax7~ z*_EkBRqlv~hp6jmhqS{+WKfj!zn8%~bJIp_=XWvo^Y02LCj&f>w}o@#xA{ zi=o~{s#+~6Ne%Zde8@H!29eRZz&ie^HFR9RD47B78*+;t_AdUHxZ2_z*C=#>j4eaP ze$gvPq8hj$_K9>P`<=R(4 zE<-p;ymAnXw}2)3_4<L>ng91_{LUbOJ2;Nn$w!^g#>6< zfX67&6$pZl-?CCuFY?%yibH@^Fq8uT<{s|SEz~o7bFlUxCQfkdA$ilp3Y*9_aZnB< znMCY40UXnxAg0xwM408}V_f_27`l3&?n>Q$OAoOg&Ra5vWR?lCiu9|<9pj9}3smzj zIj){xn#>Qv#iHuNWE(lB%`IHjX8_IcB=`-{qlwQu>B3t1TQeNOIPO?~C_^j^L9+I` z;yUmlRzs#|B1_y489bB=t_SLmtHIt3QsXn&=gMFHai0-S=x}TncyDCF5>4_dB9}dF z3qe78b4&Re(J|k`#~qMRF3Y{&wuXY6b8jAxg~wo>FE%su&cUtNxVv`^aLaaOR0p9Mr=f5L{U#vD`3`Wtj+1JMez*e za4bm8PO&Na;H?=(3>x6146Nn!;f>{hRrMLG%B&9}3i9BhnQEL_!mi9%R#n+`Y;Avb zt?hxxf?g0YV~*F^n5fN)QDrANH;At#y4L-)e4#ZIajIH8HNB&;hPdPJKR+aYePItQ zZ`#F_5@k7ljiY3_YjVsg%45zHE1gW?z68A`c_M}vdPNi7fs-k06gI+0p5b}B$1!U< zrmD6Doz9gXPJ)n6XsuuzF_k4k;Wck{+edl(&syLH7r)im1?uzcp@Q4f0d_sm7Krmt{z4ObX%~txfJA4Gj37X z;V7M9Hr);wfs_{^!cEGGlXr*2lr3ZifWb0YjWJL}XC=N6<$+=+QPH@WNcDTF;7H~2dy!Xa92RT(xg_bx0XY$3y3X}IXr6yao|!o8*AdYGC!s^5x) zi@^w^RJK%42cx*E|K}r1eLACzMzL&;Iy#3fc4Z+yXlY%9i=7IO?5K<(ZK|-NqPL6< zphiKqKXR=W48^RKe1Su`c}t^$U!$Ts&&$1B{fN!uc>YdlFPlUlFk>1D$*S)hurzJ} zZ0)w)b;<^`3ib+r6GGRm=Q!Zv$*Ek4>aQi=jlTAr9wSr?;*s+N;@s5j8NohelU zysOprVX1W+^CK*qgf#=1ugwat)5QBTt^J|es}l`-EMqhS+JK2~;aeW@@q|E4w?I-3 zv``|Y%W=F0T7Sf7;fby+LL56l8VYoTH<&h^{>ZnDm3I~)ct-$4+qqc|2Ipg=vGCC$ z3K_cMn1Oxew--6(HQ1|{D`}MHZ=PPA+CD3o5;IkR{Rm+2EXYacn2&|YKxOh+GY{D3 zU^aDUwWNx!J2z>^lKp!n^}s*xVS`!xjmFk7N1D9I&-p>Ct03*pSoWyNHzRr+qsOKY z-;`x|~oi9Bxy|J$K%MhqyjtojHk*xRR|+ zosuny#%CCgycUKTfNf4H*ve%@KA!R#bO<6Ep*K%XMs7lS52hGFxiN$-9qz)Mt4Gix z4cE2|$Xf)mhg0J^^h<=}IP^2csoMb3 z#I*|q{)8*D`$Kme0dpD!9K*S*4EFE^1jl%uiLnn@);ayv4|Kq9>g|bJ7Y!T9aTbNM z--U>6%S*g+_)Et54=46*6R=F(oC}8@ts&|LDmae}PF}Bx{bj4y+kMGVysqt|tNh8Z zHoB`QkeIu@z5Do3_^SVTm>K9&fQP-N`Yf+RP@XGG2AmW(#8h1&&61RqGPs>27&Z;3 znNMo-$uO_TtxM-bd~!;HTm{;m8bpFq7Ryw&AsJ<3D7I;~SF*F8-yO_^42w)bIR@}|r6_NcX8wMn)qdYCr4gg@5f-kH40KU@x+-NJi4C$Y~`F!xiC zJCGZgz%sN40c{UXf{fKdKS0Nppg}-JT&8aARijoq<?JxG z?6=B?*^5Zc{^$313~i$gM3+z6hP1IxWY-b2DiXFmLN6Edno<3Py*-aD>)nhJr%jKl zi)Pi52_}+|IvJPtzE|xG0O{C$MWYY!gXrFg{3&DR0EkA0%I>3qU8B|N;-KKg=!Ev`{DjfSIGZxvfz#BxjE~-JI*Yhw(je;sFV{_D60~W04=r_6L(fiNRV3= zM;o^yc*ZTSBSn=d1#qAe9sQxolK9d!x@ytjG3Po*FHTp#X4Iok4^at<8JP9%@s55j z9}67H3<{6U>uM*%==MC=ZS;Ct`tBO~Ip|=#9og%5PwKTuYK4BAB));W=JC>cRc z$S6W~pmQ80e;7ABcK=y`oR-<0mPt)yhLkaF2xgytAUj)l%F>ygY)%z;WuoYSS)9zf zWiq+#UffJ?lPoLBlzUXVM5agNAc0&w994Y4R}ER9*qx9V-6KhO0{ugtN<9)vRkQ@8m>Ll%Hd4USO($i#tCe{9OH|=Vol`kVNS-K8= zQr&5?QP|tT>pb$9KpA{sU4C#<1K1egpwnQ88I2cGs6I|}=IRcb4CEDWVsRIiH)Tl6 z>;lszx;^D}BU||56}ZK#wIJoH2a%_^WG%U?|Cn~Vn9s!Xdl8mu23^Xx;$<7b~xYe5v#=^Zze8IlG)(#%`ePOqN z*r^MsiBd>}YXnzkVe z%0D_x5&u`H+p87j(@tvK_h>+PO(%okSJKJ_C=mwipKEoq5CDvt55_O~eSzeK3IT*0 zbqW}a{56PX5j)I&s~|$+ET#c@VjPy=F07dOBM`!AIT-l|%EUMf12)7~jDTFk-y#&T zdsz$v8pN-dzX8-y6ZT-ef&J(WKyed63ouyaR;I*NxQsp^Cj^3FQCc%*>KG~%XpSaX;`VVa z53~?AYod0G1ijrh4sjGEol?Pg!LdktatjL5a?uE4E<=-mN;7pZtZHvunq?P%cqxVl z*6+8Kou5~&E6cJ`bqw?dyDLdDJcUxUsQNQ!N~B`}Ha_C5OE`DZ#x>*PsIE1uldGA$ zm70@i0eUK2;($PppZmx_YjK*@6qs6%#V2NlsTgd0bux*CGX>QQOnWaY^oFL|8U8O1 zJd6gmTCGWAzV-J@ECXyIM@Cl% zvkY0LYSaZ=eNyglgHy&%@u!1TmV}nEh9a}LrXrkuuTg5enEEl&k-e$DUrEI}Ntwg* zDe;IQbhl>A7pYKuzf=OuDow(P+#jn=x<1}Ae_qcsZT$|pKcT7uLF*6zwLJWm zYZ<=T?%dD+)sy8&Nw4%L=a$wW@wjx z&b!j|m@J`~C&PqLSHkqrOzaQ#86>hvuq24TWddDE3M_I11Tp?G&#{Z)Y;$r>3*d@h zvy^@a_mpuc1<(Rp!HC>u7>UbH9$5$)NXVL4C>jV>A0D@IBgS4f74&A4nh7ynyOmqe(DCryriMh*Qn%vSen=N$J`F@YSm|B z*Cr{@@Ra%*eILYtJaK6*Ji#b}eF!=r3y1!E2&)!y#XdV-&9WYf{(?e&IF3%l~ewWqX8Z@vV zcZ`!wqlk(kgblMo#+V`Z`O9)voy@HSJvL7F;*moV25fah`}GXB*OT47vnyv!vaounPk@E?lNgK97;u&9^Ed9)67TBnjRv5a{j#`uPW8k7UyHaGHEAyt(7pqXZjLUTR=R@#3ncUky+oTJoC`BnlMIMT~y! zMP&;ydVJ5#E*$V8u|B6V6q(I7JKpRqD#rfMRul%_CC~X?|NNY(p}xUTm)6)o-ENP| zUFcx{7SmEK^^Ev<{-=t+S-_!qZgiG=1)(FV(bHquR~voL5ghCts!0s*%9ZZn?`|+i zF-piLDP&F4WVLZ&<=*&`SDA_e(!oS2_tfR}xcl&H5=iKgZmBj9uI95ng;z^#T3xVS zKfkuXdP;d)z}fzM6?gX9u6hy@K&Cw_H)iPvoHJ$kotojW-6?DeK()^o2_lmim8Mq@rS;Pr_MY_s^*1A=Rh2LpG-^*xF$a2$z zJ{l?Nt6r7jN3s^hmV=HIMZ&jDaXa2%bikpRh>i{}-!z}BPQd1rk2@}x1S7$Oo123i zHP$yi{B9}$VTd5aZ10&M6HDztf{T7^E^7{Nz~*zyvxT-iC0OqVR%J*i}HufLkow zlU4Jo*)0t&`*t)VtN5r>6pUNs6VVTQA&Mw3V3 zN3p93-JRncpSP3^a-9#TsNcXLC`X{P&f(gvxj!GJy0`eBqs;5t>(8b{j~W zLsMr<`ECSArhURO=uQO!45#jq%JlZq+irmr;#?(JnpFr5fJ)T!DuxB9VwJJF04vZL zsGp_*aq2Gp;MA(yB2*vKVD75AZ7Axhzc#@h)JjaRPSmT_1Zw#Q*wkJ)f^M5oMxm%a z;|z8|q$*|212EJm%u!Kavj(>h)pGj5_AuK6yR!^2+Y$Xc zw!zgZeVA27%wc`RqUkDP4FNJwn)(C2qjKL1P@dJd1PA25W0}hg`q-#{=`Y6HtU_^P zY=x;=7z!m~r<;QP{3Yi@6_+^=5lZ(bt(l}zj^`2h{=P#7Nq zYzSFI1rsAXJ{E?nWW2Yze*&|UB|`cQ)8ufxK8Q`1n*hW5#sG!6&m$C6EguS)>zQnW`58QjBCI zp_lk4ZZ`@fSL{|5@|WNo@Vrj=MPiGXRwYUThjK+S2S^LUSTTf$5*MMpXE8ddO(@7k zJX2_XC7>deLpXp0ayw2&Vv`WEMU0!oh8NZfC_M5RT^t9H74tioG|$i~87~e*Il!r0 zX+I3)pxtkgJh(V;-dx-&;V&ai0@a-;>8f;jfNp>W7R@B7O*IPvZk&v`U_zL*$#`&d z*Y;StGeV1K!71w?R~}c#F;cac?t(P2^K7UfnplV zYv(@y@n^85Ne?fmV=~{AGSl2-=hFRS6;1bcj^50H`(|5m@_ECFCnN9+nG>1aTba3I z0JT3e6eOGGCQt43J_SiI>$VenJbaRXG-e%zme<}Pp+k#dBwj=m#OT~-g_9O%Qax@q zA8`h_$bA(^4k>nrkoWJ=gh+EaFzg#xeD3$PqbJoFHjB}$Tzsy30hxHFk@)OveiQXf z@z(iH&Mkle(PFzZzj?$3_oljeXd0Jrk#v z#-y24B_KJCZGJnrYk}do*1~L11OhXyOuSN?I`-GgOjvLRa}W%wyaA;P)_ghzaWaK= zmm2NDO^6!X{Mn{;1j4k_MAMZvVjvlT25Ve0nl}XV2Qw44rON+K!oEwu-x`PO&3gUz z47(W~h0Z}^)z`egwefGq$xSaVWn`?!*@Ek~^(xSGvb5zVa+h$`mwAI{;7QqCg?xi2 z;}G2f{@u#zI~(4Qr$7IeN~hbu#nIN|wBTW*>x4gQo~Aiwl#!wT?@@e;a{R7Eqn23AGzS-@yyn>w9lYf*I0;r@yE$FxsYuJS? zu7;}a3VWfGW9PHo{lpi>XWW2=D|B}x%NZrTqC+7ZrB)Uv8ACRRvG8e#NE|JaG0dGq z99ASIUQEKtS0=GKUh^TL!JGjPx6LUimz)&Bqt$!)Rj_xho(YXm-1uD{Q{{B&QXzTAYs()T{B zOU4LROV*lyl^M@1(N0H;%YGjv-@a!T1`Tat3~E1i3a8X=jFC7eDKF}GSoLk`86Y86 z0mdv5s#V1Pp8Z-<(h1m1)oKu>Z?|&^#B>P9WvE>|V|4Wu;%073sSFgKwLpH4jqbGFlx~5XWMN*C4^|d(PVR;W5~sLHy$~*A^zazYfjpRIAZpEn>2{cI2KlaPRQB^XHMZ z%N_7>-G@95eZ1q4_;Uj7K5Dtn3q3RcWDhq(N$xS@9-P5EQWBY}01@xxCDO5lIe^== zHHJNX`ui@f@4y9A@XudKcYL2t#G`JbLnMr~F82cZq(h_lb~4B4NEr^t8Q)vm&D8W+ z{%?z#XYJ$nqlSVUiQp%1&duO(xP1o5FK9=ez`WU(w1^hbk%9Dqmzr@>~ls+R@V8r?LB*r?(EKM=#lHDjr#ycea9aBpG^`>xzG4 z#B=@P=IixGv-Vw_h0e2C&SJsIp0swUXb3=va?-sGQef@oDRpV8m4Tc8My z+-sJ%cEk8xU7(~x64yB{VJO4>N6g-hxCoK-=7rm!{Yd|4548H}ZiE4TXqL+__Rlxb z=)oHdyIZtnuT3ERXH>~PAQRE(!ts7=qei_$j$-Gdh{3i4+NmoHy zJ$94b?6y4kXe-$_-nI(_FMD~_I-cZ@khbAH@Te+zw8Qat6^VZ1dMp|H`;T1&Ly~#y zX~IMZp87oAobp;ac=g(crK@O+g$5Qq9v0myEu?ArxVqBt*L$XNdDWqvd%fq)#`}8@ zox6E0dUezW$d3;vowZzVrORXwNw#6s_t9_ormjXKd^UJomD=Gdj%ing?W^FMX5tG? z)ZqqFv)jWPHd7HpDGU2aOb0AmvIGfNlzYAZ0#NrF*$oH!>C(8lNG_*evjFjm`M0&p)vA{>YY{-jwl&MjL;;Kx)Dm@ zkz2#mX=DnrSoxit@X7p)+{u%5wL~TTp`ym8|5A6hBsW09MKVS~i={;@{pf}M%0kiP z-4pm*N4IQYM^P`sol>oy313|41K>V!nUfOGo-MgfR40*LOU^O4v&6-_I={TIzFc`o zo%*PwpiJ?oY~3xeE~mxNl6U$0*VSz47qJ~zV1z8>)4Rq-hj;f1)%SCxy1d6miVK*a zb@%G(S|JO{A}U35kDR8g*xgeT)ze@Y>(x~@t#ws>aW(s)pq_6TFs4pRK`Zm>`WiqK z8VzRFFzC-Yz?ym^iP|e)PV?^$^C0?AeO%*NclOpdkFm0-sbpxw1iF&OMnJZtXPx7? z#gPFHsHZnaY7X9y1W9`XE&Q9!jWx83(=&~7fD%oA%l6DO1tjU>9`szgYiqCvx2Bi2 zcBQ=Y7Lbs3K!?T>=6PP>M~4fVP}`sSrb4mgnd?8bzNCiq{HyaD%gccWuNvNxT%BBk zVugb%7nTD0`9oZq0a6$gz@)nuov5z9b&P6R7vuQ@c3gaAA>_XzYMW6{q5|$)t4>R(0Fa>uQ*Rm` zU#sY+_rY-zu623DC{R*VG+NCT%Kr2f$!JOvKnir90NOuO^V|1kejuZwz34aayh0bi zO*_`VBALSNt?qhI0s1cSm%6kErV@AyRok!)A?GU%nXnO!4pe%uoX_PAzzY-|n|}a& zb!+tWT^ye5hiv&_VKJhfg?~brb#P{I-fGBJ0Ll^37VM4#O-T#ShC@ba& zE$FG5p&AS^VSo4-Z79CCHWt4nj%#E~g6$Z!DtkGw$`))naL!%W zh%GyMC7P8gQh5v#w>2=?TPmj-CR0O07R3>AJ?B30fI?nNSBakY^+a?PA{B+4p6bTM z1-`-F(+&o7lF<^f!QF+aJNgiykMzL!ChD{u-AxF#5pbpb+RAnAyhV{aRwh~C(;VS$ zK6<-}xSc)1;wgZJXlWj+Q9hsntoF>jZ8$$^ik1J_%2;DIKHB92Y2Z|EPvqsqka^1( z-6G72W3V~$?^Ml3J!0t7xECjF1UtX5mKWEFW;D2lSBMg`ED{DwudOn2=={?eYQHhD z{yCUXET=sePsDs}P=C6vU){t^9Vu3uEI;{!_}0R_7F1C9jwxFGiazH!RPY(r8DLJk zFN}x{=Pm2NN2cqGLhr}xR0To5HAT&pwgoyyB1H)u&;732S7lpN+a$zWOfccN_rr>J zMBPWiF;DFg>V77IcOv55W4gMc5_P+tMt06{KV>XWgwUK@QFfRlNg=1(&SDT_jQFsx zE>u;Id_g!O8#mtIH?2?kys``7Nc`q#R9hI|Iu8F?!v2R7C`}AYPvemjSZS(Jn*leM z&P#@jlmT*sd>8p+9N3LN5FLEji0XI+mSr>q;Dx52&G$eM3PWfD*PKeCuVqSKIcLAe2};pkdvd>_+f*vsKLPn0S?yB1o7>dmlN1y+v3%Dfc<^3 zU|ch>up#RxU7B~Rv_Sb&epMQii^R`a-p0qrx%9LbPP4KjE9H!v`|dLcuE^-=+k5JL z?Y)Z)RXW;_QDoiU8IT%*&hLaUQnnT&uY7YSNaq0aO(tdEeYYZCv+|R1X5nK!X$h`- za7G*zj9eT35emomonh#N%Jd-^1Fp_G=+AG|v1sa0qFO#%WUPDz-kR}tsD!=- z|NT|xn>#N24765ysrbTr1AU2nW;oeX_#tzH{1R9&qDp*!|=lXVi)d~7wBj-v!rhGWpSLhvk zPmag?Me%Yw!?ZH9F14b#8?-oDA{V2O3-WN&|B1i@Jsu}kl81MBF5RrC^-J=IzSz!D)TD~XcyRy?3XPlAEX^F&@GtW z&tG$A>0iTVH{~u*N~oO*gvI^x3G;dMd)Q88==l3=?5Ld?x9-yc7Apl6G%Ew3EA41X z(axl38(2b%HF8tzukH*FM_#ZuCoA^`inwLYYwpSxTWKs^q$Nt)+&>|2na2+g79#By zcMgk(i+0-?GgvnKtBao%Fe{f-p_LsIR~f;H->RrkKqAWA*oOw5fv8ikDF%+f;AZtk zW6k(gv7FJbb!Bg_PU(}=(#Opv{Z@1=D`{WHKo9m0aq7A;)}>Qjxqo2&`7ni6;WeKZ zSB{Qn)@t!H_{pnkwJ}082Qi%=Yi2YNmbb9TV4>02u7TRNJ|3ns$D`&P2Zo)a_m1bb zIrmg(%9{R$f=-_DGNtdqh6LoJw$I^%2tEp&5{Cur#kl}kV}a>U_v=xh5FsY%*~A^r zbG!W77LNlWf&ndQD){l+hQy751%_e5DEI^84%*#_WnCP!3NH!)2R}<8ibweajENm_ z_P=Cc{}XQgPwthGfs=vl|Ak=L|0e{i?RZLvYt%Z^`xh-}k@s_MB#Bs=KRt zYpVL}!bgoGv?c-cQo-2XoJ~ad@x?4>ZDQ_X>}Kugpla;k$|B-uX9jpITwv)+!2vyi zjusJd^wMSF;098#fFWEIKrlO)0>};q>$6F_8QWQ#3OiWZnNzR>*o0k8%^lnx&mQgl zekyA0BxP=GY32574uDP7&D>stf*U&MQ8%@-ox*86*xc~ z|BtE)`U!&$LF^dfm%bq>`&2OVMnsGv19@>ZTcYwePvPhoRZL?=@vd)tHYYT8VB8{q zIKOsoUbOdUBc7ZYgS;gAT77DtE$fepS`3@Pn`MbyZ0}h^x;0 z;6~py6eUPb6Q(z%SokMc8(;B7&m4K)vih8)EcE*iqCCWZ=eR{KhJDa8q4V!WdFW(U zyr%`vC)#0FXwyW$HEXis>5G;@gV(0NggWO8#%k(7N9^@_{~rHc zW=0MDfMrv4H*tH6UNskY^IuXCV^{OXi22{+*4o9@P1MTR z>E5=`4W+8n&1(7ns%7GbM~l6Ciy!j}-{pFs5qbO4kIS38 z^A@MW3^3SoB>f$a>!#itE;e*5RBOuT$5YQw!wiK!{-71+TZ-oHbLBu0xTnoeM3ThnEZmgPGHAA71t=3@F5>ncIfHE6W|F#D@f=_Q{C+Y{SsS z&pf_&sYIBw!$1?o_T!Dmsiy@z=)jeZrQo6xSPj>bZ_2*swOx79$d zU)(j1ewdq?_HEF=>;1z_iZ9D1JoaS?fvBHj&rJ5gVNO`)3)|MsCX*EyL-mb?2%g$c zwH5DqOn)X#4pcHQXYiVzY>-`k7^E}c%~_8>UW@3(!CQ|R86=F$NZKB9`o=;RWKg(~ zFvXNF!n&q~AeD&`v@=1FMoTboJEBt9?(3GRWK*2Q%Ue06twD-?D}rLES6|zjo|}H3 zs>Jf8=6HiVxFXs+w)TQbK{0R={P~%WG1WT;v=tna!UEn91uga#z>2(Th9KnyZHT2x z>R4`(4TPy1M zc+btO-7DypQLZX0BC22Q&G#hN*L}wWulGps7WPOi9#z9zl0|Ot6ejn$h!;=(K#2t3 zb;e>Om~Ur@%r`(O_S=)UIRx#&ahBWdv{VG91z(I5l0;j}%&m6o>p_J|(;DA55BF@f zcW}-|>d~SKSo9(`=@yxA#%C|TNZ6L`p&7~<>Z4=(PD~AM%Ei!*8ff8~)(iyu2$>ws z?7QiixDz0FwYE#pS>bV@>3mzk7_O?G6iqgvo(8orjpOyH?7muM>^tvHwTYYfstDAK zNKAe;@Z!>j{-=kJxVmoS;Cno$f~>DpB9$0cpj5w1L82F4?0gQs=x z@vJaRYV0_$E{GPMu1V}o6cnQFdxp=XXpm6M8{x>LGe{(=?mRC~ex*63tMvMHDC?*^ zT<1bbswEQ)S^IkRM06+2-b$rJ7^htRNF*+I7cjx~VB{iu}GN(^kvK2Lpsn7^xbUSP3t>CrJHnr&fr%rf??kNA;D=v9Wt@37OrTA zj>&}GWi8{~&e8Nuj7N2#94(95Icmf-_PG?SDSE!u)X6KX0!A7JpkQI5YND0wTY@u@ zB=FW5&u&O+uP*I~JO_GRjTwrKYrm#z*hd6HMhaz(XLuWIgkXmfclz6+ z2AT$9B>(WWI7ha~^=J2wC0wDlC@ZJq3!H$UCtj$gK8w{bnvEmA>ji?I}<8Q?fGB zZ?m`)<=qJVeofO)8}yg_9UKnY-c{attLa*^N- zW>wWdfUJtt%h|bt2bHr#^aPo-`-JhL1;#S5h$;uO@W5{Z{M0GcE*klX)g-wKg#ZP@ zNF@~$Cqg|_KmsX(WKD-LcQ^c~eO5O8p#+9#NzoX%4(^L+>5l9C_bho;51+v&)NE-=?$4s+vSyT4;&izwT&k~ z+r9U#;qfg*v6HbXuL53cG+I*s>ldjW?+FwTbr*v$LO)$6VdEP`YxWoMdT4kggXYf} zoi>Qx$W9m%;i4!6xaj!y>-?ez53c(RGZ!x<8~P`09{bz!&x4>Y3A02brMI znu15Zud~Y`zUF(UXq4j%zYZRAU1=<7S{||lHfi{oAgw`eF>pX3v)MJimWB4PY4xzk)sH%O zZ@J=r^Kp7VaSgulnUpl(J`e4dE4nD|_iA>Ny7xJ2>%=UxG4!EnJO z-H6%5F1)waBGqB?WuLiNMT+L61wIuHlLo71sdlAehDk#w)fAzgrR@(1xhvrn~Aw)rHOpULU%XEy-N8{O<~ z7-M8L-OsiGBFO3WpL2JyW-8~kIF7&BsSV2|ZH7LaeN8d!q8IXg<=aJmu=Mdb6A=R1 zK8_iWM`LFXIR+o2`xyA`w=Z4GdQyezcDu6gB+I3fed6aKRD4fYt57lR%FD0Y1gz2v zLU1SSiFV3Q)lc}Wo@i5$M|6;QsNvGIGB;E<6uyGH_hGYsq%5j#M{+x&d)lN>n?$m>*vQ^pTD4XeV)ko^5gvk(9f6It`|wc_0Y-r z4q(wh(#@Fz7%=1LtTgYka-lLpNr7x(G}1klp17kTBlehVGWFNnZ7hQj)RrZ3|Gm8? z*N5QCtg*VKdWSTUHviS6?v1<~qz|G*RurEugY)-C{l7It&6UHMp0GnQBB`E^iiPlZ z+0~u|YYn@wLSjaZSnyhAENi#4>t+g#RL{J%ess<9Z}kUN@E45)CG$I(vScE@#ZxAS zK(HHR)8D+^F+2gEZ;V9lVXjS%A3;AuSm3`9RORHyBHbKdmVUGTgcawBUg8ret zVWF+SW_xabx5D={3D$9rY^vP0nNp|mYH_%AaRF=>ZM&yyj^b#g{Kq0#XEVI z5LdnGT7qed9}A6*JD++hnoduqzaG-A+97U&NQcdv$gm5|QfZKA(vA z;>Dbe8ODgRR{qU67T2-~1??2A=&cYem^|cqzA>D9|9(B)JdHs2oItmWT_`^mT6AF@ z4bsOcT^vl)uWeaCIh?f4pTzaOzXcT+gCsG9m3CHJ!>%|GInuO@>0ZGowYh9OLQF zcsHi8DyA5fUV=}8bosO)1#D9S`#4NOv1isJY`GPmwHUd$-|DaFTcpfdW8jjGMxLGI7Fk+S6RwZZM@Y%*axptoXuh$6 zQ4|#8HO-yyEELux`ZBTn-0vb^Sdj>Y!m~h_TOMUwoTDtQyQn~eE4dNTB%}w-`GL^0 zusZxmywChIQs5vRznklxVwi-wX2q<>Q8vuCx|ylHo61EP3rANgyS>asT{HT%QnnUx zmW?E&OqilIMkLmH~?5@Tj4@f>vuF7 zrJMxut%7d$1v8Q=%@IbHm>=A+BslS>f5M>&$r+bO46ql!!&LDylPJq99>c6ty+Z-4mi-#JrhBjW=ipU%3i zR8A@2DKNm)Vn|6L(^hiLI=trG9Y{{Su=Cr?PH%DZJ57g2=;NQp9K9UT2tG$$N!xMI zJqiPm_u?Q}XsV;{@$C_w6*h8hdiS8v>y)#qS0q^SMp?LdW0k4_+>m9k8?rCtkSqfQ zuz!Mb=&_qY`BNMW?W<~tEy^gI)^ERT=Qm5dVU=^=6m_PWr=uIi!xwPrD#mvD5rvKq z91^}J(-^;L*mZ>dLC3>!x8&0~@@F_ai-o}a(&aBr>-uYF z(+z{7YAsf2dG0zbQ_N`}=ctgER0R}y!lTQq<{a!zT4n-Go=d>$zKLGN-rlyK2(4(v zSEoI@^lKGYh`AYBt6khOT_m7LGm~NU?f%iE`RkAC&qd-@)mrtS2#I)7TtZy!LgCn=^pN*-6Lw=rZb73O0Aomn)Nx=)(&pog9U*eADAua`D*V@Z~(wvNtQW z=r;%Lz?zk%N{@$|=`DNR2eJq2;m~c^tEPyx$FHD^y50 z04`8almv$wOI8Tz?eGmft8LQKn+n^le4g)Kt;KCnlz6(lRoAue><;XBx4U?8V_LN` z>#0Bjxpmw9**8aOn^vjoDJpey1s?5nm`@rZyqIitMF^NqEc2D9}+e;f^1Puk;Sf7e0>r{*qezL=?TH!)ddO#%&`)Q z&SO0s&$vx*Zyd?Jfu5s{Bl|5)>6W>Qez#pW4?ll4k?uOoHrH*G=vsmfdk@2xs+?Om z5nyOov=9~y7Z0O^S{*NKNiP>Ymm_qG%6E#&>*L)({nX#yXcTgwLw1oY@e{eq$5U~R z32|T8eVJ|#lYOR)5=&`2sm?F$p$xYi0OwD-$vg8MU2qIk>aM;{)`m^`a6v!W&`M@4 zZ>dnJ{c5=)&A}!E-@fUZx2qz>K#=!G2cjoiTf=kZpkd5io3p&A=NCA{2`t5Q*wPZZ z^m)~)@f!V8+ASNr^zcWo%sileNd{_fbDR$i zJM9H8*}pYxTPB|R-mz!tqwL92e1v0-#H`sr1!4^k;&8y}Wk_W78dJ4kBvdG#KH<;P z0Q25i6JpG26H-sEDxa_CisP?NDyam@r+5*oh=jTO-{&WV1;~AI`Q0 z%K0?NV*I&?;yKC}0-Mh#UojyT#3Vkj?@!wr(|iX{tEOds`Q{!ko_V|tDo<{}$TYL) zM?ryRspa&kn7svw2@BRBj3?elOJQ#0J?*g+cmeIPB-(wFyO#EOfmkd=d(v#rH#bJP zHaMPW@B$ioZtue(OINXPl|e5z5P6~Mc%Mh zmKb6@P~ERcj=K9_U6iga=5*HH%YCfIGKJ^{gcL-Y6TFL8FNLeq9L6ar{kp%ydahkp z_5u|UniPNu+qo}t?(C@;{4`2G3|lXjmrSqhB4iPpt*hMiN9WHJbK6m5q5HmzF)d$| z8Ay<6eh0}YA+q%3=^RJ-@IVQR4XG>+orbMlLx&G>usudqhZ=EYU4Rj60%}{ea06;) zZAVukrA?3x@lZaB53v(h(M@VR`kWCm?Mv$iIhn2zN9Bp1!Y%P5yHhC<-<)nHSj*9aZ`+O0rct=)mc!CzwU!m~@ zp%~49T1r|$Q@|)e?j5RWuc`G`Fbu!J+axNoeiizsyk98N3W>l}Z5z{9o3bR&8*WI- zIL!N#SaE~f%`f+?gfRFIjaxh*A<Dg~~g$+DS=0345BaSc>{p zN0@Me*AkiDMT23BkDhL;3daBxO0#9*fw=tHfp|D&FfD)}w~#`bp3ppu8Nh{$fNJOR_9e1Ou>AC-MeYgfB#z(n}FvM3Zue zDL5l!Oa%!(B%3+7He^ix>BedRbhAIplgtYt2G zS`)k4#f^$~QgRl(#M@z!5QNv3dN-PFUV9s=ar)Ph@i(=%FRq&->c28`X;!esj4pkP z=knvyYi?+JnrMV8u(+(aluOWXb9;I$`wf3uh}5_E$Kfbk^tpe#QF|x&1<~Bk z9l^uKXizB=PEFHU>hYN4ucJVFok%GVsY%ZE%VSbiZ(qgEn@ zvDXGc>Yoxhl2P>UL^X#iEusw-NKzr8nTy?J8R_vmp=S8lzI<&pyUh1kKi(W>Zql9k zxMUi(1$ra+DKA}y*x{Dn;lGs8^0SFh$(QNCj#Ezo@Ta|hpDvet70;79#VjCGS)<>i zI$OS{%*5&CHDR?b>-*l!c3}f5%X~JUrG)ak8)^2lHu0I2JFDKf zB2m!0&HlA>fWoM80KI9rPk0Osvc(oibO?oSc+4cUim+sOnG<#uk%ZBYk>E^PIyvs0 zJTt70=lCHk$?4+S@l}SRkmp%3B&(VE{*(3jtmJIn4@j2Rb{+og=j)dH+pgwddG3Xq zAK8L{TzX`IHLpmX(4@gcufX+0z_isE`xYPS-H~G?VTWySt;7~cqy@7iO35l1hWacl zH5FZt7Pi|MGc=|81DrpwPYdy_a{)|ICIcSATb%x-<2~2h*LJT+Jl1<= zPGU~N7!7(nFWkL*^tqZ^gTqkBULW~nUWbOUwxu1e%m(p)Jleli$c#Es8t&2~BE+iG$__}W9-)z#s2RrrED z(U4Zo9~kMp)Q(&7xfrX9%wJpb_U`KC=;ygBeYQY64z}LIK;4!8D>b^9@gDq6>Q75& zZNgg*)xfU$PoK`_7igQqm#|*0`WG3T+Sq!-z$?y&&*Jnfr9F)zf$bENrWKl*&yD~_v+ z6+hgG=#`eIhc>OdN10t{^k}}7DZ|uE*A6EHtx^v7H!I&GYH(}tr3EI)x-RdoHXCE4 z1XqD*(p>K(Un$;8+#_IT<7OIx-jxp}3|a0a?Pcs0E&vWHz0O*sFPhTh@caGQ9@K#9 z;}us5?+W8fTT4c#5)u-nXK41Ne@duUT!;EcjJ$#)3{tnHn%tIt+C&r(MuMT;I}YNlY{n(`qT$EeK$hQ7k!;VwKVG)JW23iQCnvVwG7e#@?w0CiKw` zm|~StYBE1icknk!e637Nj#MYjm{Xd;uy3R!z<{|gGAw!)qR9!F`YIWc{yt7bc_me3 zB|@pF0>~iuj5ADh_})sih|y3fDGD8#JRUWoYhCsw% zP&rqv;%=YrBfiU}BGSXevG|!cZbUQ1F-zW2tyDXhMw}dS5}b67%6Z-?<1dB;M~&(( zFQwNkLog@#qJ;d%#1xKB0F@@(snX%xrqPGCoMMGH%aI{cRZTe>Sd?PBcgoJ2gMs6l zp+x?sYfNr)HS8Yx5e7Q580Gkqmym-IMXLadVsTpl>R{(^4zAj#@woS!Mpe&xj}dQW ziHV4F8S)mF_9}%M47 zB^n=l9`|zY@Ca*gu(t6>MM5TeDHLxJf4S&>a%$873p*r9>g%}Bo?9hX{f@F4LNg|7 z3U@Eb~+C(`KY@YIZ<0SDRzm+O@Q_3fC^4=RsUi29!gDJv=Zp2haJiJOkIUQEc z-A!Ch)sbC~8vF}M65+_lR=P}#Gjr}`RDa@j%yhN&< z#>gE%mQ`qJ*xO`MxOHTecJWxO59LpimMUPh;F*?6?=<1$$zKgS!xdK=p2%X~2ggEk^1sn5 z)_Ah`No+OBbBDfm>g({WV4!% zEc5n28F?z-2_LA)lIoTq~kdQlTn;e?QhTi5;9nl{#nv}O3&6A}**ezwK-xf4Z{CCX3yv0f>NsUh94 z78=Nw<%*$5`djb_)j3M-;1_5!Fm2aFRz&y^c^ZSBBKN^eDctrKjzhf4r=*x^4JVqG z9~!fYG*fk)j!LY^#>@$KxJ7kNZ1MzN5rQPWHrDnN*rj^g&^% zZ%A2t8%UQ@u<+$x+|pi2@E*Swxh2Q=>HCCx)M0BU#P8D!A7O!A5~Lr?x{lFzyEP;? z?Sm4tqsbd{De2m-q2n3v+%5Xw4O?Dh#L@blI5*$rp%3mgqj#JdYe(D#WrA*O1qxq| zoK~vkw*Iuhc3tuM~joZK0b}^s3!g6ihNbK<|X>+=d2uC&r1i3>5Ac&)Ij|leZ|9_`R@I1nbwyMVPhIz zKFoG3#18G2vL*Tr-EHQ>$-}xo>-zwQCkx#l7vNWhS<>EJ43E_{y##}IqiH>Z4~!gH zc58*Io=#U1o5n~iTp%ex_uKJBH4QsOSlJEslzf#H6Xp%>bDIw=9XC5Qz>5&%fqmqo z3_Y{5#2oKNs`{EZcvQZ)j1I0ENOcXk_J%)THqz4LnASXVR-4DX(%V?)oe`U4zvl9% zN)&~Z3`SF(0gC)SJ?kg>`E62~{ZD>oz5ZU|x|_T;y~UkT@d6@?KVd(eF@3&`pG+OZ9S+VE#Fx^yfgzs8C_1LvxT}-km%?(3MAS*hcpC0c7PjZB ztg+wm`}&j>1Q$<#6FSYfIzS?DKT`Lo)Lvm zKmyIox)i>>VWp2-kb**gde4==NE!hqEueK8@pT z9y{n_Xf~erB*<*F>DS|apU-*6zw~u_xAn8qJBK0AsK4vWQxnZpv2OoU>rA<8EZv19^l6T{B5o7s3`~EQSVO6M|h%g{U0wQ&ZA}+B6;R z@y#yKRiUjo`A+mKWsf|!-OS%z#Nr_sv`3y-Yxb}eIduQ*eBpLmKTU|2;X<)mquM_> zGvdzlb`<)LYhUcR&za6&Li(ep?RSFl<%!$n^)rN5mM@9u z%W`*#{W-e&|0_T_{vyr(48{KiS+LPb%*ZLhq3Te53_Izf*tExqwGozsS5lC_m`&7exq_|4%~i zSAzZn(F6W^LfGG7SK!~u)=B^=9&t!0o(G};K6><@`SJ(x3(c2D7LwxERH%9-7e`Z7 zb2nW!=p)M5)Xcry^#5VtUw1~y*wUO$$=KzQ(EVkDO~u^R(cQ(=+?4|OXhMZe-rUUE z_>ud4;1va4= zvD2e+Q*Sm=RVWJVVQp%zA}PWqP2mQGIRypTM4?NE+IFRQ+`Ux(hW-9KgdP{_3iuzZ z1N^l-sDj_t_qe7<|I1pNx$08n|B6=c7;mAp>zk*Y+Ti2lVd$a~y<|``1cf3r7mzV?;e(h*9WL@NHQmMMQxT+)!;GE(vy^n24~LI2V_Mm>4HC z7XIHu9uq?hS~}Ru+|<_9-JXI?oKsi=8hSucaS3rz5J-Z92MCQk4pA`)AXro!BJsGH YxVjm;xcv$n5I2~M13*hFt|$TcKfI>v7XSbN literal 0 HcmV?d00001 diff --git a/README.md b/README.md index ccbfd00..ba5a08b 100644 --- a/README.md +++ b/README.md @@ -1,3 +1,6 @@ # power9-smt-testing -A set of testing utilities for testing SMT performance on POWER9 bare metal and a set of guest VMs set to test the host. Benchmark is a a fork of [sudden6's m-queens code](https://github.com/sudden6/m-queens), designed to use varying thread levels. \ No newline at end of file +A set of testing utilities for testing SMT performance on POWER9 bare metal and +a set of guest VMs set to test the host. Benchmark is a a fork of +[sudden6's m-queens code](https://github.com/sudden6/m-queens), designed to use +varying thread levels. diff --git a/ansible/get-gcc.yml b/ansible/get-gcc.yml new file mode 100644 index 0000000..b9e2c05 --- /dev/null +++ b/ansible/get-gcc.yml @@ -0,0 +1,7 @@ +- hosts: guests + become: true + tasks: + - name: Get GCC versions + shell: gcc --version + register: versions + - debug: var=versions.stdout diff --git a/ansible/hosts.ini b/ansible/hosts.ini new file mode 100644 index 0000000..0902ba8 --- /dev/null +++ b/ansible/hosts.ini @@ -0,0 +1,15 @@ +[guests] +192.168.3.232 +192.168.3.233 +192.168.3.234 +192.168.3.235 +192.168.3.236 +192.168.3.237 +192.168.3.238 +192.168.3.239 + +[all:vars] +ansible_connection=ssh +ansible_port=822 +ansible_user=root +ansible_python_interpreter=/usr/bin/python3 diff --git a/ansible/m-queens-test.yml b/ansible/m-queens-test.yml new file mode 100644 index 0000000..5ebb86d --- /dev/null +++ b/ansible/m-queens-test.yml @@ -0,0 +1,49 @@ +- hosts: guests + become: true + tasks: + - name: Start fresh + shell: rm -rf /root/m-queens + + - name: Update code base + copy: + src: /root/benchmark-testing/m-queens + dest: /root/ + + - name: Check if already compiled + stat: + path: /root/m-queens/m-queens-multithread.bin + register: result + + - name: Compile in directory if not compiled + shell: chdir=/root/m-queens make + when: result.stat.exists == false + + - name: Verify compilation succeeded + stat: + path: /root/m-queens/m-queens-multithread.bin + register: compiled + + - name: chmod 750 to the executables + file: + path: /root/m-queens/m-queens-multithread.bin + mode: '0750' + when: compiled.stat.exists == true + + - name: Run multithreaded benchmark + shell: chdir=/root/m-queens ./m-queens-multithread.bin 19 > result.txt + when: compiled.stat.exists == true + + - name: Wait for results + wait_for: + path: /root/m-queens/result.txt + + - name: Register if results available + stat: + path: /root/m-queens/result.txt + register: output + + - name: Fetch results if available + ansible.builtin.fetch: + src: /root/m-queens/result.txt + dest: ./results/ + when: output.stat.exists == true diff --git a/ansible/monitor.sh b/ansible/monitor.sh new file mode 100755 index 0000000..c41b4b7 --- /dev/null +++ b/ansible/monitor.sh @@ -0,0 +1,3 @@ +#!/bin/bash + +sensors | grep -e "^Core" diff --git a/ansible/wrapper.sh b/ansible/wrapper.sh new file mode 100755 index 0000000..661d616 --- /dev/null +++ b/ansible/wrapper.sh @@ -0,0 +1,13 @@ +#!/bin/bash + +rm -rf ./results/* + +# Script assumes $1 is the hosts.ini file usually fed to ansible + +ansible-playbook m-queens-test.yml -i "$1" + +find ./results/ -name "result.txt" -exec ls {} \; | sort + +cat "$(find ./results/ -name "result.txt" -exec ls {} \; | sort)" + +tar cf ./results.tar.bz2 ./results/ --use-compress-program='lbzip2 -n 4' \ No newline at end of file diff --git a/m-queens/CMakeLists.txt b/m-queens/CMakeLists.txt new file mode 100644 index 0000000..77e990b --- /dev/null +++ b/m-queens/CMakeLists.txt @@ -0,0 +1,4 @@ +cmake_minimum_required(VERSION 2.8) + +project(m-queens) +add_executable(${PROJECT_NAME} "main.c") diff --git a/m-queens/LICENSE b/m-queens/LICENSE new file mode 100644 index 0000000..9cecc1d --- /dev/null +++ b/m-queens/LICENSE @@ -0,0 +1,674 @@ + GNU GENERAL PUBLIC LICENSE + Version 3, 29 June 2007 + + Copyright (C) 2007 Free Software Foundation, Inc. + Everyone is permitted to copy and distribute verbatim copies + of this license document, but changing it is not allowed. + + Preamble + + The GNU General Public License is a free, copyleft license for +software and other kinds of works. + + The licenses for most software and other practical works are designed +to take away your freedom to share and change the works. By contrast, +the GNU General Public License is intended to guarantee your freedom to +share and change all versions of a program--to make sure it remains free +software for all its users. We, the Free Software Foundation, use the +GNU General Public License for most of our software; it applies also to +any other work released this way by its authors. You can apply it to +your programs, too. + + When we speak of free software, we are referring to freedom, not +price. Our General Public Licenses are designed to make sure that you +have the freedom to distribute copies of free software (and charge for +them if you wish), that you receive source code or can get it if you +want it, that you can change the software or use pieces of it in new +free programs, and that you know you can do these things. + + To protect your rights, we need to prevent others from denying you +these rights or asking you to surrender the rights. Therefore, you have +certain responsibilities if you distribute copies of the software, or if +you modify it: responsibilities to respect the freedom of others. + + For example, if you distribute copies of such a program, whether +gratis or for a fee, you must pass on to the recipients the same +freedoms that you received. You must make sure that they, too, receive +or can get the source code. And you must show them these terms so they +know their rights. + + Developers that use the GNU GPL protect your rights with two steps: +(1) assert copyright on the software, and (2) offer you this License +giving you legal permission to copy, distribute and/or modify it. + + For the developers' and authors' protection, the GPL clearly explains +that there is no warranty for this free software. For both users' and +authors' sake, the GPL requires that modified versions be marked as +changed, so that their problems will not be attributed erroneously to +authors of previous versions. + + Some devices are designed to deny users access to install or run +modified versions of the software inside them, although the manufacturer +can do so. This is fundamentally incompatible with the aim of +protecting users' freedom to change the software. The systematic +pattern of such abuse occurs in the area of products for individuals to +use, which is precisely where it is most unacceptable. Therefore, we +have designed this version of the GPL to prohibit the practice for those +products. If such problems arise substantially in other domains, we +stand ready to extend this provision to those domains in future versions +of the GPL, as needed to protect the freedom of users. + + Finally, every program is threatened constantly by software patents. +States should not allow patents to restrict development and use of +software on general-purpose computers, but in those that do, we wish to +avoid the special danger that patents applied to a free program could +make it effectively proprietary. To prevent this, the GPL assures that +patents cannot be used to render the program non-free. + + The precise terms and conditions for copying, distribution and +modification follow. + + TERMS AND CONDITIONS + + 0. Definitions. + + "This License" refers to version 3 of the GNU General Public License. + + "Copyright" also means copyright-like laws that apply to other kinds of +works, such as semiconductor masks. + + "The Program" refers to any copyrightable work licensed under this +License. Each licensee is addressed as "you". "Licensees" and +"recipients" may be individuals or organizations. + + To "modify" a work means to copy from or adapt all or part of the work +in a fashion requiring copyright permission, other than the making of an +exact copy. The resulting work is called a "modified version" of the +earlier work or a work "based on" the earlier work. + + A "covered work" means either the unmodified Program or a work based +on the Program. + + To "propagate" a work means to do anything with it that, without +permission, would make you directly or secondarily liable for +infringement under applicable copyright law, except executing it on a +computer or modifying a private copy. Propagation includes copying, +distribution (with or without modification), making available to the +public, and in some countries other activities as well. + + To "convey" a work means any kind of propagation that enables other +parties to make or receive copies. Mere interaction with a user through +a computer network, with no transfer of a copy, is not conveying. + + An interactive user interface displays "Appropriate Legal Notices" +to the extent that it includes a convenient and prominently visible +feature that (1) displays an appropriate copyright notice, and (2) +tells the user that there is no warranty for the work (except to the +extent that warranties are provided), that licensees may convey the +work under this License, and how to view a copy of this License. If +the interface presents a list of user commands or options, such as a +menu, a prominent item in the list meets this criterion. + + 1. Source Code. + + The "source code" for a work means the preferred form of the work +for making modifications to it. "Object code" means any non-source +form of a work. + + A "Standard Interface" means an interface that either is an official +standard defined by a recognized standards body, or, in the case of +interfaces specified for a particular programming language, one that +is widely used among developers working in that language. + + The "System Libraries" of an executable work include anything, other +than the work as a whole, that (a) is included in the normal form of +packaging a Major Component, but which is not part of that Major +Component, and (b) serves only to enable use of the work with that +Major Component, or to implement a Standard Interface for which an +implementation is available to the public in source code form. A +"Major Component", in this context, means a major essential component +(kernel, window system, and so on) of the specific operating system +(if any) on which the executable work runs, or a compiler used to +produce the work, or an object code interpreter used to run it. + + The "Corresponding Source" for a work in object code form means all +the source code needed to generate, install, and (for an executable +work) run the object code and to modify the work, including scripts to +control those activities. However, it does not include the work's +System Libraries, or general-purpose tools or generally available free +programs which are used unmodified in performing those activities but +which are not part of the work. For example, Corresponding Source +includes interface definition files associated with source files for +the work, and the source code for shared libraries and dynamically +linked subprograms that the work is specifically designed to require, +such as by intimate data communication or control flow between those +subprograms and other parts of the work. + + The Corresponding Source need not include anything that users +can regenerate automatically from other parts of the Corresponding +Source. + + The Corresponding Source for a work in source code form is that +same work. + + 2. Basic Permissions. + + All rights granted under this License are granted for the term of +copyright on the Program, and are irrevocable provided the stated +conditions are met. This License explicitly affirms your unlimited +permission to run the unmodified Program. The output from running a +covered work is covered by this License only if the output, given its +content, constitutes a covered work. This License acknowledges your +rights of fair use or other equivalent, as provided by copyright law. + + You may make, run and propagate covered works that you do not +convey, without conditions so long as your license otherwise remains +in force. You may convey covered works to others for the sole purpose +of having them make modifications exclusively for you, or provide you +with facilities for running those works, provided that you comply with +the terms of this License in conveying all material for which you do +not control copyright. Those thus making or running the covered works +for you must do so exclusively on your behalf, under your direction +and control, on terms that prohibit them from making any copies of +your copyrighted material outside their relationship with you. + + Conveying under any other circumstances is permitted solely under +the conditions stated below. Sublicensing is not allowed; section 10 +makes it unnecessary. + + 3. Protecting Users' Legal Rights From Anti-Circumvention Law. + + No covered work shall be deemed part of an effective technological +measure under any applicable law fulfilling obligations under article +11 of the WIPO copyright treaty adopted on 20 December 1996, or +similar laws prohibiting or restricting circumvention of such +measures. + + When you convey a covered work, you waive any legal power to forbid +circumvention of technological measures to the extent such circumvention +is effected by exercising rights under this License with respect to +the covered work, and you disclaim any intention to limit operation or +modification of the work as a means of enforcing, against the work's +users, your or third parties' legal rights to forbid circumvention of +technological measures. + + 4. Conveying Verbatim Copies. + + You may convey verbatim copies of the Program's source code as you +receive it, in any medium, provided that you conspicuously and +appropriately publish on each copy an appropriate copyright notice; +keep intact all notices stating that this License and any +non-permissive terms added in accord with section 7 apply to the code; +keep intact all notices of the absence of any warranty; and give all +recipients a copy of this License along with the Program. + + You may charge any price or no price for each copy that you convey, +and you may offer support or warranty protection for a fee. + + 5. Conveying Modified Source Versions. + + You may convey a work based on the Program, or the modifications to +produce it from the Program, in the form of source code under the +terms of section 4, provided that you also meet all of these conditions: + + a) The work must carry prominent notices stating that you modified + it, and giving a relevant date. + + b) The work must carry prominent notices stating that it is + released under this License and any conditions added under section + 7. This requirement modifies the requirement in section 4 to + "keep intact all notices". + + c) You must license the entire work, as a whole, under this + License to anyone who comes into possession of a copy. This + License will therefore apply, along with any applicable section 7 + additional terms, to the whole of the work, and all its parts, + regardless of how they are packaged. This License gives no + permission to license the work in any other way, but it does not + invalidate such permission if you have separately received it. + + d) If the work has interactive user interfaces, each must display + Appropriate Legal Notices; however, if the Program has interactive + interfaces that do not display Appropriate Legal Notices, your + work need not make them do so. + + A compilation of a covered work with other separate and independent +works, which are not by their nature extensions of the covered work, +and which are not combined with it such as to form a larger program, +in or on a volume of a storage or distribution medium, is called an +"aggregate" if the compilation and its resulting copyright are not +used to limit the access or legal rights of the compilation's users +beyond what the individual works permit. Inclusion of a covered work +in an aggregate does not cause this License to apply to the other +parts of the aggregate. + + 6. Conveying Non-Source Forms. + + You may convey a covered work in object code form under the terms +of sections 4 and 5, provided that you also convey the +machine-readable Corresponding Source under the terms of this License, +in one of these ways: + + a) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by the + Corresponding Source fixed on a durable physical medium + customarily used for software interchange. + + b) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by a + written offer, valid for at least three years and valid for as + long as you offer spare parts or customer support for that product + model, to give anyone who possesses the object code either (1) a + copy of the Corresponding Source for all the software in the + product that is covered by this License, on a durable physical + medium customarily used for software interchange, for a price no + more than your reasonable cost of physically performing this + conveying of source, or (2) access to copy the + Corresponding Source from a network server at no charge. + + c) Convey individual copies of the object code with a copy of the + written offer to provide the Corresponding Source. This + alternative is allowed only occasionally and noncommercially, and + only if you received the object code with such an offer, in accord + with subsection 6b. + + d) Convey the object code by offering access from a designated + place (gratis or for a charge), and offer equivalent access to the + Corresponding Source in the same way through the same place at no + further charge. You need not require recipients to copy the + Corresponding Source along with the object code. If the place to + copy the object code is a network server, the Corresponding Source + may be on a different server (operated by you or a third party) + that supports equivalent copying facilities, provided you maintain + clear directions next to the object code saying where to find the + Corresponding Source. Regardless of what server hosts the + Corresponding Source, you remain obligated to ensure that it is + available for as long as needed to satisfy these requirements. + + e) Convey the object code using peer-to-peer transmission, provided + you inform other peers where the object code and Corresponding + Source of the work are being offered to the general public at no + charge under subsection 6d. + + A separable portion of the object code, whose source code is excluded +from the Corresponding Source as a System Library, need not be +included in conveying the object code work. + + A "User Product" is either (1) a "consumer product", which means any +tangible personal property which is normally used for personal, family, +or household purposes, or (2) anything designed or sold for incorporation +into a dwelling. In determining whether a product is a consumer product, +doubtful cases shall be resolved in favor of coverage. For a particular +product received by a particular user, "normally used" refers to a +typical or common use of that class of product, regardless of the status +of the particular user or of the way in which the particular user +actually uses, or expects or is expected to use, the product. A product +is a consumer product regardless of whether the product has substantial +commercial, industrial or non-consumer uses, unless such uses represent +the only significant mode of use of the product. + + "Installation Information" for a User Product means any methods, +procedures, authorization keys, or other information required to install +and execute modified versions of a covered work in that User Product from +a modified version of its Corresponding Source. The information must +suffice to ensure that the continued functioning of the modified object +code is in no case prevented or interfered with solely because +modification has been made. + + If you convey an object code work under this section in, or with, or +specifically for use in, a User Product, and the conveying occurs as +part of a transaction in which the right of possession and use of the +User Product is transferred to the recipient in perpetuity or for a +fixed term (regardless of how the transaction is characterized), the +Corresponding Source conveyed under this section must be accompanied +by the Installation Information. But this requirement does not apply +if neither you nor any third party retains the ability to install +modified object code on the User Product (for example, the work has +been installed in ROM). + + The requirement to provide Installation Information does not include a +requirement to continue to provide support service, warranty, or updates +for a work that has been modified or installed by the recipient, or for +the User Product in which it has been modified or installed. Access to a +network may be denied when the modification itself materially and +adversely affects the operation of the network or violates the rules and +protocols for communication across the network. + + Corresponding Source conveyed, and Installation Information provided, +in accord with this section must be in a format that is publicly +documented (and with an implementation available to the public in +source code form), and must require no special password or key for +unpacking, reading or copying. + + 7. Additional Terms. + + "Additional permissions" are terms that supplement the terms of this +License by making exceptions from one or more of its conditions. +Additional permissions that are applicable to the entire Program shall +be treated as though they were included in this License, to the extent +that they are valid under applicable law. If additional permissions +apply only to part of the Program, that part may be used separately +under those permissions, but the entire Program remains governed by +this License without regard to the additional permissions. + + When you convey a copy of a covered work, you may at your option +remove any additional permissions from that copy, or from any part of +it. (Additional permissions may be written to require their own +removal in certain cases when you modify the work.) You may place +additional permissions on material, added by you to a covered work, +for which you have or can give appropriate copyright permission. + + Notwithstanding any other provision of this License, for material you +add to a covered work, you may (if authorized by the copyright holders of +that material) supplement the terms of this License with terms: + + a) Disclaiming warranty or limiting liability differently from the + terms of sections 15 and 16 of this License; or + + b) Requiring preservation of specified reasonable legal notices or + author attributions in that material or in the Appropriate Legal + Notices displayed by works containing it; or + + c) Prohibiting misrepresentation of the origin of that material, or + requiring that modified versions of such material be marked in + reasonable ways as different from the original version; or + + d) Limiting the use for publicity purposes of names of licensors or + authors of the material; or + + e) Declining to grant rights under trademark law for use of some + trade names, trademarks, or service marks; or + + f) Requiring indemnification of licensors and authors of that + material by anyone who conveys the material (or modified versions of + it) with contractual assumptions of liability to the recipient, for + any liability that these contractual assumptions directly impose on + those licensors and authors. + + All other non-permissive additional terms are considered "further +restrictions" within the meaning of section 10. If the Program as you +received it, or any part of it, contains a notice stating that it is +governed by this License along with a term that is a further +restriction, you may remove that term. If a license document contains +a further restriction but permits relicensing or conveying under this +License, you may add to a covered work material governed by the terms +of that license document, provided that the further restriction does +not survive such relicensing or conveying. + + If you add terms to a covered work in accord with this section, you +must place, in the relevant source files, a statement of the +additional terms that apply to those files, or a notice indicating +where to find the applicable terms. + + Additional terms, permissive or non-permissive, may be stated in the +form of a separately written license, or stated as exceptions; +the above requirements apply either way. + + 8. Termination. + + You may not propagate or modify a covered work except as expressly +provided under this License. Any attempt otherwise to propagate or +modify it is void, and will automatically terminate your rights under +this License (including any patent licenses granted under the third +paragraph of section 11). + + However, if you cease all violation of this License, then your +license from a particular copyright holder is reinstated (a) +provisionally, unless and until the copyright holder explicitly and +finally terminates your license, and (b) permanently, if the copyright +holder fails to notify you of the violation by some reasonable means +prior to 60 days after the cessation. + + Moreover, your license from a particular copyright holder is +reinstated permanently if the copyright holder notifies you of the +violation by some reasonable means, this is the first time you have +received notice of violation of this License (for any work) from that +copyright holder, and you cure the violation prior to 30 days after +your receipt of the notice. + + Termination of your rights under this section does not terminate the +licenses of parties who have received copies or rights from you under +this License. If your rights have been terminated and not permanently +reinstated, you do not qualify to receive new licenses for the same +material under section 10. + + 9. Acceptance Not Required for Having Copies. + + You are not required to accept this License in order to receive or +run a copy of the Program. Ancillary propagation of a covered work +occurring solely as a consequence of using peer-to-peer transmission +to receive a copy likewise does not require acceptance. However, +nothing other than this License grants you permission to propagate or +modify any covered work. These actions infringe copyright if you do +not accept this License. Therefore, by modifying or propagating a +covered work, you indicate your acceptance of this License to do so. + + 10. Automatic Licensing of Downstream Recipients. + + Each time you convey a covered work, the recipient automatically +receives a license from the original licensors, to run, modify and +propagate that work, subject to this License. You are not responsible +for enforcing compliance by third parties with this License. + + An "entity transaction" is a transaction transferring control of an +organization, or substantially all assets of one, or subdividing an +organization, or merging organizations. If propagation of a covered +work results from an entity transaction, each party to that +transaction who receives a copy of the work also receives whatever +licenses to the work the party's predecessor in interest had or could +give under the previous paragraph, plus a right to possession of the +Corresponding Source of the work from the predecessor in interest, if +the predecessor has it or can get it with reasonable efforts. + + You may not impose any further restrictions on the exercise of the +rights granted or affirmed under this License. For example, you may +not impose a license fee, royalty, or other charge for exercise of +rights granted under this License, and you may not initiate litigation +(including a cross-claim or counterclaim in a lawsuit) alleging that +any patent claim is infringed by making, using, selling, offering for +sale, or importing the Program or any portion of it. + + 11. Patents. + + A "contributor" is a copyright holder who authorizes use under this +License of the Program or a work on which the Program is based. The +work thus licensed is called the contributor's "contributor version". + + A contributor's "essential patent claims" are all patent claims +owned or controlled by the contributor, whether already acquired or +hereafter acquired, that would be infringed by some manner, permitted +by this License, of making, using, or selling its contributor version, +but do not include claims that would be infringed only as a +consequence of further modification of the contributor version. For +purposes of this definition, "control" includes the right to grant +patent sublicenses in a manner consistent with the requirements of +this License. + + Each contributor grants you a non-exclusive, worldwide, royalty-free +patent license under the contributor's essential patent claims, to +make, use, sell, offer for sale, import and otherwise run, modify and +propagate the contents of its contributor version. + + In the following three paragraphs, a "patent license" is any express +agreement or commitment, however denominated, not to enforce a patent +(such as an express permission to practice a patent or covenant not to +sue for patent infringement). To "grant" such a patent license to a +party means to make such an agreement or commitment not to enforce a +patent against the party. + + If you convey a covered work, knowingly relying on a patent license, +and the Corresponding Source of the work is not available for anyone +to copy, free of charge and under the terms of this License, through a +publicly available network server or other readily accessible means, +then you must either (1) cause the Corresponding Source to be so +available, or (2) arrange to deprive yourself of the benefit of the +patent license for this particular work, or (3) arrange, in a manner +consistent with the requirements of this License, to extend the patent +license to downstream recipients. "Knowingly relying" means you have +actual knowledge that, but for the patent license, your conveying the +covered work in a country, or your recipient's use of the covered work +in a country, would infringe one or more identifiable patents in that +country that you have reason to believe are valid. + + If, pursuant to or in connection with a single transaction or +arrangement, you convey, or propagate by procuring conveyance of, a +covered work, and grant a patent license to some of the parties +receiving the covered work authorizing them to use, propagate, modify +or convey a specific copy of the covered work, then the patent license +you grant is automatically extended to all recipients of the covered +work and works based on it. + + A patent license is "discriminatory" if it does not include within +the scope of its coverage, prohibits the exercise of, or is +conditioned on the non-exercise of one or more of the rights that are +specifically granted under this License. You may not convey a covered +work if you are a party to an arrangement with a third party that is +in the business of distributing software, under which you make payment +to the third party based on the extent of your activity of conveying +the work, and under which the third party grants, to any of the +parties who would receive the covered work from you, a discriminatory +patent license (a) in connection with copies of the covered work +conveyed by you (or copies made from those copies), or (b) primarily +for and in connection with specific products or compilations that +contain the covered work, unless you entered into that arrangement, +or that patent license was granted, prior to 28 March 2007. + + Nothing in this License shall be construed as excluding or limiting +any implied license or other defenses to infringement that may +otherwise be available to you under applicable patent law. + + 12. No Surrender of Others' Freedom. + + If conditions are imposed on you (whether by court order, agreement or +otherwise) that contradict the conditions of this License, they do not +excuse you from the conditions of this License. If you cannot convey a +covered work so as to satisfy simultaneously your obligations under this +License and any other pertinent obligations, then as a consequence you may +not convey it at all. For example, if you agree to terms that obligate you +to collect a royalty for further conveying from those to whom you convey +the Program, the only way you could satisfy both those terms and this +License would be to refrain entirely from conveying the Program. + + 13. Use with the GNU Affero General Public License. + + Notwithstanding any other provision of this License, you have +permission to link or combine any covered work with a work licensed +under version 3 of the GNU Affero General Public License into a single +combined work, and to convey the resulting work. The terms of this +License will continue to apply to the part which is the covered work, +but the special requirements of the GNU Affero General Public License, +section 13, concerning interaction through a network will apply to the +combination as such. + + 14. Revised Versions of this License. + + The Free Software Foundation may publish revised and/or new versions of +the GNU General Public License from time to time. Such new versions will +be similar in spirit to the present version, but may differ in detail to +address new problems or concerns. + + Each version is given a distinguishing version number. If the +Program specifies that a certain numbered version of the GNU General +Public License "or any later version" applies to it, you have the +option of following the terms and conditions either of that numbered +version or of any later version published by the Free Software +Foundation. If the Program does not specify a version number of the +GNU General Public License, you may choose any version ever published +by the Free Software Foundation. + + If the Program specifies that a proxy can decide which future +versions of the GNU General Public License can be used, that proxy's +public statement of acceptance of a version permanently authorizes you +to choose that version for the Program. + + Later license versions may give you additional or different +permissions. However, no additional obligations are imposed on any +author or copyright holder as a result of your choosing to follow a +later version. + + 15. Disclaimer of Warranty. + + THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY +APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT +HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY +OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, +THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR +PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM +IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF +ALL NECESSARY SERVICING, REPAIR OR CORRECTION. + + 16. Limitation of Liability. + + IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING +WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS +THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY +GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE +USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF +DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD +PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), +EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF +SUCH DAMAGES. + + 17. Interpretation of Sections 15 and 16. + + If the disclaimer of warranty and limitation of liability provided +above cannot be given local legal effect according to their terms, +reviewing courts shall apply local law that most closely approximates +an absolute waiver of all civil liability in connection with the +Program, unless a warranty or assumption of liability accompanies a +copy of the Program in return for a fee. + + END OF TERMS AND CONDITIONS + + How to Apply These Terms to Your New Programs + + If you develop a new program, and you want it to be of the greatest +possible use to the public, the best way to achieve this is to make it +free software which everyone can redistribute and change under these terms. + + To do so, attach the following notices to the program. It is safest +to attach them to the start of each source file to most effectively +state the exclusion of warranty; and each file should have at least +the "copyright" line and a pointer to where the full notice is found. + + {one line to give the program's name and a brief idea of what it does.} + Copyright (C) {year} {name of author} + + This program is free software: you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation, either version 3 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program. If not, see . + +Also add information on how to contact you by electronic and paper mail. + + If the program does terminal interaction, make it output a short +notice like this when it starts in an interactive mode: + + {project} Copyright (C) {year} {fullname} + This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. + This is free software, and you are welcome to redistribute it + under certain conditions; type `show c' for details. + +The hypothetical commands `show w' and `show c' should show the appropriate +parts of the General Public License. Of course, your program's commands +might be different; for a GUI interface, you would use an "about box". + + You should also get your employer (if you work as a programmer) or school, +if any, to sign a "copyright disclaimer" for the program, if necessary. +For more information on this, and how to apply and follow the GNU GPL, see +. + + The GNU General Public License does not permit incorporating your program +into proprietary programs. If your program is a subroutine library, you +may consider it more useful to permit linking proprietary applications with +the library. If this is what you want to do, use the GNU Lesser General +Public License instead of this License. But first, please read +. diff --git a/m-queens/Makefile b/m-queens/Makefile new file mode 100644 index 0000000..3e18b15 --- /dev/null +++ b/m-queens/Makefile @@ -0,0 +1,19 @@ +default: all + +maxthread: + gcc -o m-queens-multithread.bin main.c -O2 -mcpu=native -mtune=native -std=c99 -fopenmp + +nthread: + gcc -o m-queens-20thread.bin main-20-thread.c -O2 -mcpu=native -mtune=native -std=c99 -fopenmp + gcc -o m-queens-10thread.bin main-10-thread.c -O2 -mcpu=native -mtune=native -std=c99 -fopenmp + +singlethread: + gcc -o m-queens-singlethread.bin main.c -O2 -mcpu=native -mtune=native -std=c99 + +all: + make maxthread + make nthread + make singlethread + +clean: + rm -rf *.bin diff --git a/m-queens/README.md b/m-queens/README.md new file mode 100644 index 0000000..8f16fc1 --- /dev/null +++ b/m-queens/README.md @@ -0,0 +1,36 @@ +# m-queens + +Multi-queens, a very fast solver for the general +[eight queens problem](https://en.wikipedia.org/wiki/Eight_queens_puzzle) with OpenMP support. + +Based on code from https://rosettacode.org/wiki/N-queens_problem#C but much more optimized. + +If you find a way to make the code even faster, please let me know. +Also feel free to open a Pull Request to add your own benchmarks. + +# Benchmarks +## Single-Thread + +Compiled with `gcc-7 -o m-queens.bin main.c -O2 -march=native -mtune=native -std=c99` and +run with `./m-queens 18`. + +|CPU|N|Time to solve| +|---|---|---| +|Intel(R) Core(TM) i7-4600M CPU@ 3.5 GHz (single core)|18|129.56s| + +## Multi-Thread + +Compiled with `gcc-7 -o m-queens.bin main.c -O2 -march=native -mtune=native -std=c99 -fopenmp` and +run with `./m-queens 18`. + +|CPU|Cores (real/virtual)|N|Time to solve|Speedup from Single-Thread| +|---|---|---|---|---| +|Intel(R) Core(TM) i7-4600M CPU@ 3.4 GHz (all cores)|2/4|18|52.56s|2.46| + +# Future Improvements + +### Use the optimized placement mentioned in https://github.com/preusser/q27 to reduce symmetries. +probably very hard to do with the current implementation + +### Use OpenCL to make use of GPUs +Work in progress in the `sieves`, `split2_debug` and `ringbuffer` branches. diff --git a/m-queens/main-10-thread.c b/m-queens/main-10-thread.c new file mode 100644 index 0000000..de25502 --- /dev/null +++ b/m-queens/main-10-thread.c @@ -0,0 +1,309 @@ +#include +#include +#include +#include +#include +#include +#include + +// above this board size overflows may occur +#define MAXN 29 + +// get the current wall clock time in seconds +double get_time() { + struct timeval tp; + gettimeofday(&tp, NULL); + return tp.tv_sec + tp.tv_usec / 1000000.0; +} + +uint64_t nqueens(uint_fast8_t n) { + + // counter for the number of solutions + // sufficient until n=29 (estimated) + uint_fast64_t num = 0; + // + // The top level is two fors, to save one bit of symmetry in the enumeration + // by forcing second queen to be AFTER the first queen. + // + uint_fast16_t start_cnt = 0; + uint_fast32_t start_queens[(MAXN - 2)*(MAXN - 1)][2]; + #pragma omp simd + for (uint_fast8_t q0 = 0; q0 < n - 2; q0++) { + for (uint_fast8_t q1 = q0 + 2; q1 < n; q1++) { + start_queens[start_cnt][0] = 1 << q0; + start_queens[start_cnt][1] = 1 << q1; + start_cnt++; + } + } + + // maximum number of queens present at row 3 + #define START_LEVEL3 ((MAXN - 3) * (MAXN - 2) * (MAXN - 1)) + // store the state at level3 as cols, diagl, diagr + uint_fast32_t start_level3[START_LEVEL3][3]; + + uint_fast32_t start_level3_cnt = 0; +#define START_LEVEL4 (MAXN - 4) + +#pragma omp parallel for schedule(dynamic) num_threads(10) + for (uint_fast16_t cnt = 0; cnt < start_cnt; cnt++) { + uint_fast32_t start_level4[START_LEVEL4][3]; + uint_fast32_t level4_cnt = 0; + uint_fast32_t cols[MAXN], posibs[MAXN]; // Our backtracking 'stack' + uint_fast32_t diagl[MAXN], diagr[MAXN]; + int8_t rest[MAXN]; // number of rows left + uint_fast32_t bit0 = start_queens[cnt][0]; // The first queen placed + uint_fast32_t bit1 = start_queens[cnt][1]; // The second queen placed + int_fast16_t d = 1; // d is our depth in the backtrack stack + // The UINT_FAST32_MAX here is used to fill all 'coloumn' bits after n ... + cols[d] = bit0 | bit1 | (UINT_FAST32_MAX << n); + // This places the first two queens + diagl[d] = (bit0 << 2) | (bit1 << 1); + diagr[d] = (bit0 >> 2) | (bit1 >> 1); +#define LOOKAHEAD 3 + // we're allready two rows into the field here + rest[d] = n - 2 - LOOKAHEAD; + +#define STORE_LEVEL (n - 2 - LOOKAHEAD - 1) + + // The variable posib contains the bitmask of possibilities we still have + // to try in a given row ... + uint_fast32_t posib = (cols[d] | diagl[d] | diagr[d]); + + diagl[d] <<= 1; + diagr[d] >>= 1; + + while (d > 0) { + int8_t l_rest = rest[d]; + + while (posib != UINT_FAST32_MAX) { + // The standard trick for getting the rightmost bit in the mask + uint_fast32_t bit = ~posib & (posib + 1); + posib ^= bit; // Eliminate the tried possibility. + uint_fast32_t new_diagl = (bit << 1) | diagl[d]; + uint_fast32_t new_diagr = (bit >> 1) | diagr[d]; + bit |= cols[d]; + uint_fast32_t new_posib = (bit | new_diagl | new_diagr); + + if (new_posib != UINT_FAST32_MAX) { + uint_fast32_t lookahead1 = (bit | (new_diagl << (LOOKAHEAD - 2)) | (new_diagr >> (LOOKAHEAD - 2))); + uint_fast32_t lookahead2 = (bit | (new_diagl << (LOOKAHEAD - 1)) | (new_diagr >> (LOOKAHEAD - 1))); + uint_fast32_t allowed2 = l_rest > (int8_t)0; + + if(allowed2 && ((lookahead2 == UINT_FAST32_MAX) || (lookahead1 == UINT_FAST32_MAX))) { + continue; + } + + + if(l_rest == (STORE_LEVEL + 1)) { + start_level4[level4_cnt][0] = bit; // cols + start_level4[level4_cnt][1] = new_diagl; // diagl + start_level4[level4_cnt][2] = new_diagr; // diagr + level4_cnt++; + continue; + } + + l_rest--; + + // The next two lines save stack depth + backtrack operations + // when we passed the last possibility in a row. + // Go lower in the stack, avoid branching by writing above the current + // position + posibs[d] = posib; + d += posib != UINT_FAST32_MAX; // avoid branching with this trick + posib = new_posib; + + + // make values current + cols[d] = bit; + diagl[d] = new_diagl << 1; + diagr[d] = new_diagr >> 1; + rest[d] = l_rest; + } + } + d--; + posib = posibs[d]; // backtrack ... + } + + // copy the results into global memory + uint_fast32_t old_idx; + // fetch_and_add in OpenMP +#pragma omp atomic capture + { old_idx = start_level3_cnt; start_level3_cnt += level4_cnt; } // atomically update start_level3_cnt, but capture original value of start_level3_cnt in old_idx + memcpy(&start_level3[old_idx][0], &start_level4[0][0], level4_cnt*3*sizeof(uint_fast32_t)); + } + +#pragma omp parallel for reduction(+ : num) schedule(dynamic) num_threads(10) + for (uint_fast32_t cnt = 0; cnt < start_level3_cnt; cnt++) { + uint_fast32_t cols[MAXN], posibs[MAXN]; // Our backtracking 'stack' + uint_fast32_t diagl[MAXN], diagr[MAXN]; + int8_t rest[MAXN]; // number of rows left + int_fast16_t d = 1; // d is our depth in the backtrack stack + // The UINT_FAST32_MAX here is used to fill all 'coloumn' bits after n ... + cols[d] = start_level3[cnt][0]; + // This places the first two queens + diagl[d] = start_level3[cnt][1]; + diagr[d] = start_level3[cnt][2]; +#define LOOKAHEAD 3 + // we're allready two rows into the field here + rest[d] = STORE_LEVEL; + + // The variable posib contains the bitmask of possibilities we still have + // to try in a given row ... + uint_fast32_t posib = (cols[d] | diagl[d] | diagr[d]); + + diagl[d] <<= 1; + diagr[d] >>= 1; + + while (d > 0) { + int8_t l_rest = rest[d]; + + while (posib != UINT_FAST32_MAX) { + // The standard trick for getting the rightmost bit in the mask + uint_fast32_t bit = ~posib & (posib + 1); + posib ^= bit; // Eliminate the tried possibility. + uint_fast32_t new_diagl = (bit << 1) | diagl[d]; + uint_fast32_t new_diagr = (bit >> 1) | diagr[d]; + bit |= cols[d]; + uint_fast32_t new_posib = (bit | new_diagl | new_diagr); + + if (new_posib != UINT_FAST32_MAX) { + uint_fast32_t lookahead1 = (bit | (new_diagl << (LOOKAHEAD - 2)) | (new_diagr >> (LOOKAHEAD - 2))); + uint_fast32_t lookahead2 = (bit | (new_diagl << (LOOKAHEAD - 1)) | (new_diagr >> (LOOKAHEAD - 1))); + uint_fast32_t allowed2 = l_rest > (int8_t)0; + + if(allowed2 && ((lookahead2 == UINT_FAST32_MAX) || (lookahead1 == UINT_FAST32_MAX))) { + continue; + } + + // The next two lines save stack depth + backtrack operations + // when we passed the last possibility in a row. + // Go lower in the stack, avoid branching by writing above the current + // position + posibs[d] = posib; + d += posib != UINT_FAST32_MAX; // avoid branching with this trick + posib = new_posib; + + l_rest--; + + // make values current + cols[d] = bit; + diagl[d] = new_diagl << 1; + diagr[d] = new_diagr >> 1; + rest[d] = l_rest; + } else { + // when all columns are used, we found a solution + num += bit == UINT_FAST32_MAX; + } + } + d--; + posib = posibs[d]; // backtrack ... + } + } + return num * 2; +} + +// expected results from https://oeis.org/A000170 +const uint64_t results[MAXN] = { + 1ULL, + 0ULL, + 0ULL, + 2ULL, + 10ULL, + 4ULL, + 40ULL, + 92ULL, + 352ULL, + 724ULL, + 2680ULL, + 14200ULL, + 73712ULL, + 365596ULL, + 2279184ULL, + 14772512ULL, + 95815104ULL, + 666090624ULL, + 4968057848ULL, + 39029188884ULL, + 314666222712ULL, + 2691008701644ULL, + 24233937684440ULL, + 227514171973736ULL, + 2207893435808352ULL, + 22317699616364044ULL, + 234907967154122528ULL, + 0, // Not yet calculated + 0}; // Not yet calculated + +void print_usage() { + printf("usage: m-queens BOARDSIZE\n"); + printf(" or: m-queens START END\n"); + printf(" or: m-queens -h\n"); + printf(" or: m-queens --help\n"); + printf("\n"); + printf("\ +This program computes the number of solutions for the n queens problem\n\ +(see https://en.wikipedia.org/wiki/Eight_queens_puzzle) for the board size\n\ +BOARDSIZE or for a range of board sizes beginning with START and ending\n\ +with END.\n"); + printf("\n"); + printf("options:\n"); + printf(" -h, --help print this usage information\n"); + printf("\n"); + printf("AUTHOR : sudden6 \n"); + printf("SOURCE : https://github.com/sudden6/m-queens\n"); + printf("LICENSE: GNU General Public License v3.0\n"); +} + +int main(int argc, char **argv) { + + int start = 2; + int end = 16; // This should take a few minutes on a normal PC + + if (argc == 2) { + if((strcmp("-h", argv[1]) == 0) || (strcmp("--help", argv[1]) == 0)) { + print_usage(); + return EXIT_SUCCESS; + } + + start = atoi(argv[1]); + if (start < 2 || start > MAXN) { + printf("BOARDSIZE must be between 2 and %d!\n", MAXN); + return EXIT_FAILURE; + } + end = start; + } + + if (argc == 3) { + start = atoi(argv[1]); + if (start < 2 || start > MAXN) { + printf("START must be between 2 and %d\n", MAXN); + return EXIT_FAILURE; + } + end = atoi(argv[2]); + if (end < start || end > MAXN) { + printf("END must be between %d and %d\n", start, MAXN); + return EXIT_FAILURE; + } + } + + // properly cast + uint8_t start8 = (uint8_t) start; + uint8_t end8 = (uint8_t) end; + + // track if all results passed + int all_pass = 1; + + for (uint8_t n = start8; n <= end8; n++) { + double time_diff, time_start; // for measuring calculation time + time_start = get_time(); + uint64_t result = nqueens(n); + time_diff = (get_time() - time_start); // calculating time difference + // check if result is correct + int pass = result == results[n - 1]; + all_pass &= pass; + pass ? printf("PASS ") : printf("FAIL "); + printf("N %2d, Solutions %18" PRIu64 ", Expected %18" PRIu64 ", Time %f sec., Start Time %f, End Time %f, Solutions/s %f\n", n, result, results[n - 1], time_diff, time_start, (time_start + time_diff), result / time_diff); + } + + return all_pass ? EXIT_SUCCESS : EXIT_FAILURE; +} diff --git a/m-queens/main-20-thread.c b/m-queens/main-20-thread.c new file mode 100644 index 0000000..cdd21e0 --- /dev/null +++ b/m-queens/main-20-thread.c @@ -0,0 +1,309 @@ +#include +#include +#include +#include +#include +#include +#include + +// above this board size overflows may occur +#define MAXN 29 + +// get the current wall clock time in seconds +double get_time() { + struct timeval tp; + gettimeofday(&tp, NULL); + return tp.tv_sec + tp.tv_usec / 1000000.0; +} + +uint64_t nqueens(uint_fast8_t n) { + + // counter for the number of solutions + // sufficient until n=29 (estimated) + uint_fast64_t num = 0; + // + // The top level is two fors, to save one bit of symmetry in the enumeration + // by forcing second queen to be AFTER the first queen. + // + uint_fast16_t start_cnt = 0; + uint_fast32_t start_queens[(MAXN - 2)*(MAXN - 1)][2]; + #pragma omp simd + for (uint_fast8_t q0 = 0; q0 < n - 2; q0++) { + for (uint_fast8_t q1 = q0 + 2; q1 < n; q1++) { + start_queens[start_cnt][0] = 1 << q0; + start_queens[start_cnt][1] = 1 << q1; + start_cnt++; + } + } + + // maximum number of queens present at row 3 + #define START_LEVEL3 ((MAXN - 3) * (MAXN - 2) * (MAXN - 1)) + // store the state at level3 as cols, diagl, diagr + uint_fast32_t start_level3[START_LEVEL3][3]; + + uint_fast32_t start_level3_cnt = 0; +#define START_LEVEL4 (MAXN - 4) + +#pragma omp parallel for schedule(dynamic) num_threads(20) + for (uint_fast16_t cnt = 0; cnt < start_cnt; cnt++) { + uint_fast32_t start_level4[START_LEVEL4][3]; + uint_fast32_t level4_cnt = 0; + uint_fast32_t cols[MAXN], posibs[MAXN]; // Our backtracking 'stack' + uint_fast32_t diagl[MAXN], diagr[MAXN]; + int8_t rest[MAXN]; // number of rows left + uint_fast32_t bit0 = start_queens[cnt][0]; // The first queen placed + uint_fast32_t bit1 = start_queens[cnt][1]; // The second queen placed + int_fast16_t d = 1; // d is our depth in the backtrack stack + // The UINT_FAST32_MAX here is used to fill all 'coloumn' bits after n ... + cols[d] = bit0 | bit1 | (UINT_FAST32_MAX << n); + // This places the first two queens + diagl[d] = (bit0 << 2) | (bit1 << 1); + diagr[d] = (bit0 >> 2) | (bit1 >> 1); +#define LOOKAHEAD 3 + // we're allready two rows into the field here + rest[d] = n - 2 - LOOKAHEAD; + +#define STORE_LEVEL (n - 2 - LOOKAHEAD - 1) + + // The variable posib contains the bitmask of possibilities we still have + // to try in a given row ... + uint_fast32_t posib = (cols[d] | diagl[d] | diagr[d]); + + diagl[d] <<= 1; + diagr[d] >>= 1; + + while (d > 0) { + int8_t l_rest = rest[d]; + + while (posib != UINT_FAST32_MAX) { + // The standard trick for getting the rightmost bit in the mask + uint_fast32_t bit = ~posib & (posib + 1); + posib ^= bit; // Eliminate the tried possibility. + uint_fast32_t new_diagl = (bit << 1) | diagl[d]; + uint_fast32_t new_diagr = (bit >> 1) | diagr[d]; + bit |= cols[d]; + uint_fast32_t new_posib = (bit | new_diagl | new_diagr); + + if (new_posib != UINT_FAST32_MAX) { + uint_fast32_t lookahead1 = (bit | (new_diagl << (LOOKAHEAD - 2)) | (new_diagr >> (LOOKAHEAD - 2))); + uint_fast32_t lookahead2 = (bit | (new_diagl << (LOOKAHEAD - 1)) | (new_diagr >> (LOOKAHEAD - 1))); + uint_fast32_t allowed2 = l_rest > (int8_t)0; + + if(allowed2 && ((lookahead2 == UINT_FAST32_MAX) || (lookahead1 == UINT_FAST32_MAX))) { + continue; + } + + + if(l_rest == (STORE_LEVEL + 1)) { + start_level4[level4_cnt][0] = bit; // cols + start_level4[level4_cnt][1] = new_diagl; // diagl + start_level4[level4_cnt][2] = new_diagr; // diagr + level4_cnt++; + continue; + } + + l_rest--; + + // The next two lines save stack depth + backtrack operations + // when we passed the last possibility in a row. + // Go lower in the stack, avoid branching by writing above the current + // position + posibs[d] = posib; + d += posib != UINT_FAST32_MAX; // avoid branching with this trick + posib = new_posib; + + + // make values current + cols[d] = bit; + diagl[d] = new_diagl << 1; + diagr[d] = new_diagr >> 1; + rest[d] = l_rest; + } + } + d--; + posib = posibs[d]; // backtrack ... + } + + // copy the results into global memory + uint_fast32_t old_idx; + // fetch_and_add in OpenMP +#pragma omp atomic capture + { old_idx = start_level3_cnt; start_level3_cnt += level4_cnt; } // atomically update start_level3_cnt, but capture original value of start_level3_cnt in old_idx + memcpy(&start_level3[old_idx][0], &start_level4[0][0], level4_cnt*3*sizeof(uint_fast32_t)); + } + +#pragma omp parallel for reduction(+ : num) schedule(dynamic) num_threads(20) + for (uint_fast32_t cnt = 0; cnt < start_level3_cnt; cnt++) { + uint_fast32_t cols[MAXN], posibs[MAXN]; // Our backtracking 'stack' + uint_fast32_t diagl[MAXN], diagr[MAXN]; + int8_t rest[MAXN]; // number of rows left + int_fast16_t d = 1; // d is our depth in the backtrack stack + // The UINT_FAST32_MAX here is used to fill all 'coloumn' bits after n ... + cols[d] = start_level3[cnt][0]; + // This places the first two queens + diagl[d] = start_level3[cnt][1]; + diagr[d] = start_level3[cnt][2]; +#define LOOKAHEAD 3 + // we're allready two rows into the field here + rest[d] = STORE_LEVEL; + + // The variable posib contains the bitmask of possibilities we still have + // to try in a given row ... + uint_fast32_t posib = (cols[d] | diagl[d] | diagr[d]); + + diagl[d] <<= 1; + diagr[d] >>= 1; + + while (d > 0) { + int8_t l_rest = rest[d]; + + while (posib != UINT_FAST32_MAX) { + // The standard trick for getting the rightmost bit in the mask + uint_fast32_t bit = ~posib & (posib + 1); + posib ^= bit; // Eliminate the tried possibility. + uint_fast32_t new_diagl = (bit << 1) | diagl[d]; + uint_fast32_t new_diagr = (bit >> 1) | diagr[d]; + bit |= cols[d]; + uint_fast32_t new_posib = (bit | new_diagl | new_diagr); + + if (new_posib != UINT_FAST32_MAX) { + uint_fast32_t lookahead1 = (bit | (new_diagl << (LOOKAHEAD - 2)) | (new_diagr >> (LOOKAHEAD - 2))); + uint_fast32_t lookahead2 = (bit | (new_diagl << (LOOKAHEAD - 1)) | (new_diagr >> (LOOKAHEAD - 1))); + uint_fast32_t allowed2 = l_rest > (int8_t)0; + + if(allowed2 && ((lookahead2 == UINT_FAST32_MAX) || (lookahead1 == UINT_FAST32_MAX))) { + continue; + } + + // The next two lines save stack depth + backtrack operations + // when we passed the last possibility in a row. + // Go lower in the stack, avoid branching by writing above the current + // position + posibs[d] = posib; + d += posib != UINT_FAST32_MAX; // avoid branching with this trick + posib = new_posib; + + l_rest--; + + // make values current + cols[d] = bit; + diagl[d] = new_diagl << 1; + diagr[d] = new_diagr >> 1; + rest[d] = l_rest; + } else { + // when all columns are used, we found a solution + num += bit == UINT_FAST32_MAX; + } + } + d--; + posib = posibs[d]; // backtrack ... + } + } + return num * 2; +} + +// expected results from https://oeis.org/A000170 +const uint64_t results[MAXN] = { + 1ULL, + 0ULL, + 0ULL, + 2ULL, + 10ULL, + 4ULL, + 40ULL, + 92ULL, + 352ULL, + 724ULL, + 2680ULL, + 14200ULL, + 73712ULL, + 365596ULL, + 2279184ULL, + 14772512ULL, + 95815104ULL, + 666090624ULL, + 4968057848ULL, + 39029188884ULL, + 314666222712ULL, + 2691008701644ULL, + 24233937684440ULL, + 227514171973736ULL, + 2207893435808352ULL, + 22317699616364044ULL, + 234907967154122528ULL, + 0, // Not yet calculated + 0}; // Not yet calculated + +void print_usage() { + printf("usage: m-queens BOARDSIZE\n"); + printf(" or: m-queens START END\n"); + printf(" or: m-queens -h\n"); + printf(" or: m-queens --help\n"); + printf("\n"); + printf("\ +This program computes the number of solutions for the n queens problem\n\ +(see https://en.wikipedia.org/wiki/Eight_queens_puzzle) for the board size\n\ +BOARDSIZE or for a range of board sizes beginning with START and ending\n\ +with END.\n"); + printf("\n"); + printf("options:\n"); + printf(" -h, --help print this usage information\n"); + printf("\n"); + printf("AUTHOR : sudden6 \n"); + printf("SOURCE : https://github.com/sudden6/m-queens\n"); + printf("LICENSE: GNU General Public License v3.0\n"); +} + +int main(int argc, char **argv) { + + int start = 2; + int end = 16; // This should take a few minutes on a normal PC + + if (argc == 2) { + if((strcmp("-h", argv[1]) == 0) || (strcmp("--help", argv[1]) == 0)) { + print_usage(); + return EXIT_SUCCESS; + } + + start = atoi(argv[1]); + if (start < 2 || start > MAXN) { + printf("BOARDSIZE must be between 2 and %d!\n", MAXN); + return EXIT_FAILURE; + } + end = start; + } + + if (argc == 3) { + start = atoi(argv[1]); + if (start < 2 || start > MAXN) { + printf("START must be between 2 and %d\n", MAXN); + return EXIT_FAILURE; + } + end = atoi(argv[2]); + if (end < start || end > MAXN) { + printf("END must be between %d and %d\n", start, MAXN); + return EXIT_FAILURE; + } + } + + // properly cast + uint8_t start8 = (uint8_t) start; + uint8_t end8 = (uint8_t) end; + + // track if all results passed + int all_pass = 1; + + for (uint8_t n = start8; n <= end8; n++) { + double time_diff, time_start; // for measuring calculation time + time_start = get_time(); + uint64_t result = nqueens(n); + time_diff = (get_time() - time_start); // calculating time difference + // check if result is correct + int pass = result == results[n - 1]; + all_pass &= pass; + pass ? printf("PASS ") : printf("FAIL "); + printf("N %2d, Solutions %18" PRIu64 ", Expected %18" PRIu64 ", Time %f sec., Start Time %f, End Time %f, Solutions/s %f\n", n, result, results[n - 1], time_diff, time_start, (time_start + time_diff), result / time_diff); + } + + return all_pass ? EXIT_SUCCESS : EXIT_FAILURE; +} diff --git a/m-queens/main.c b/m-queens/main.c new file mode 100644 index 0000000..dc556a1 --- /dev/null +++ b/m-queens/main.c @@ -0,0 +1,309 @@ +#include +#include +#include +#include +#include +#include +#include + +// above this board size overflows may occur +#define MAXN 29 + +// get the current wall clock time in seconds +double get_time() { + struct timeval tp; + gettimeofday(&tp, NULL); + return tp.tv_sec + tp.tv_usec / 1000000.0; +} + +uint64_t nqueens(uint_fast8_t n) { + + // counter for the number of solutions + // sufficient until n=29 (estimated) + uint_fast64_t num = 0; + // + // The top level is two fors, to save one bit of symmetry in the enumeration + // by forcing second queen to be AFTER the first queen. + // + uint_fast16_t start_cnt = 0; + uint_fast32_t start_queens[(MAXN - 2)*(MAXN - 1)][2]; + #pragma omp simd + for (uint_fast8_t q0 = 0; q0 < n - 2; q0++) { + for (uint_fast8_t q1 = q0 + 2; q1 < n; q1++) { + start_queens[start_cnt][0] = 1 << q0; + start_queens[start_cnt][1] = 1 << q1; + start_cnt++; + } + } + + // maximum number of queens present at row 3 + #define START_LEVEL3 ((MAXN - 3) * (MAXN - 2) * (MAXN - 1)) + // store the state at level3 as cols, diagl, diagr + uint_fast32_t start_level3[START_LEVEL3][3]; + + uint_fast32_t start_level3_cnt = 0; +#define START_LEVEL4 (MAXN - 4) + +#pragma omp parallel for schedule(dynamic) + for (uint_fast16_t cnt = 0; cnt < start_cnt; cnt++) { + uint_fast32_t start_level4[START_LEVEL4][3]; + uint_fast32_t level4_cnt = 0; + uint_fast32_t cols[MAXN], posibs[MAXN]; // Our backtracking 'stack' + uint_fast32_t diagl[MAXN], diagr[MAXN]; + int8_t rest[MAXN]; // number of rows left + uint_fast32_t bit0 = start_queens[cnt][0]; // The first queen placed + uint_fast32_t bit1 = start_queens[cnt][1]; // The second queen placed + int_fast16_t d = 1; // d is our depth in the backtrack stack + // The UINT_FAST32_MAX here is used to fill all 'coloumn' bits after n ... + cols[d] = bit0 | bit1 | (UINT_FAST32_MAX << n); + // This places the first two queens + diagl[d] = (bit0 << 2) | (bit1 << 1); + diagr[d] = (bit0 >> 2) | (bit1 >> 1); +#define LOOKAHEAD 3 + // we're allready two rows into the field here + rest[d] = n - 2 - LOOKAHEAD; + +#define STORE_LEVEL (n - 2 - LOOKAHEAD - 1) + + // The variable posib contains the bitmask of possibilities we still have + // to try in a given row ... + uint_fast32_t posib = (cols[d] | diagl[d] | diagr[d]); + + diagl[d] <<= 1; + diagr[d] >>= 1; + + while (d > 0) { + int8_t l_rest = rest[d]; + + while (posib != UINT_FAST32_MAX) { + // The standard trick for getting the rightmost bit in the mask + uint_fast32_t bit = ~posib & (posib + 1); + posib ^= bit; // Eliminate the tried possibility. + uint_fast32_t new_diagl = (bit << 1) | diagl[d]; + uint_fast32_t new_diagr = (bit >> 1) | diagr[d]; + bit |= cols[d]; + uint_fast32_t new_posib = (bit | new_diagl | new_diagr); + + if (new_posib != UINT_FAST32_MAX) { + uint_fast32_t lookahead1 = (bit | (new_diagl << (LOOKAHEAD - 2)) | (new_diagr >> (LOOKAHEAD - 2))); + uint_fast32_t lookahead2 = (bit | (new_diagl << (LOOKAHEAD - 1)) | (new_diagr >> (LOOKAHEAD - 1))); + uint_fast32_t allowed2 = l_rest > (int8_t)0; + + if(allowed2 && ((lookahead2 == UINT_FAST32_MAX) || (lookahead1 == UINT_FAST32_MAX))) { + continue; + } + + + if(l_rest == (STORE_LEVEL + 1)) { + start_level4[level4_cnt][0] = bit; // cols + start_level4[level4_cnt][1] = new_diagl; // diagl + start_level4[level4_cnt][2] = new_diagr; // diagr + level4_cnt++; + continue; + } + + l_rest--; + + // The next two lines save stack depth + backtrack operations + // when we passed the last possibility in a row. + // Go lower in the stack, avoid branching by writing above the current + // position + posibs[d] = posib; + d += posib != UINT_FAST32_MAX; // avoid branching with this trick + posib = new_posib; + + + // make values current + cols[d] = bit; + diagl[d] = new_diagl << 1; + diagr[d] = new_diagr >> 1; + rest[d] = l_rest; + } + } + d--; + posib = posibs[d]; // backtrack ... + } + + // copy the results into global memory + uint_fast32_t old_idx; + // fetch_and_add in OpenMP +#pragma omp atomic capture + { old_idx = start_level3_cnt; start_level3_cnt += level4_cnt; } // atomically update start_level3_cnt, but capture original value of start_level3_cnt in old_idx + memcpy(&start_level3[old_idx][0], &start_level4[0][0], level4_cnt*3*sizeof(uint_fast32_t)); + } + +#pragma omp parallel for reduction(+ : num) schedule(dynamic) + for (uint_fast32_t cnt = 0; cnt < start_level3_cnt; cnt++) { + uint_fast32_t cols[MAXN], posibs[MAXN]; // Our backtracking 'stack' + uint_fast32_t diagl[MAXN], diagr[MAXN]; + int8_t rest[MAXN]; // number of rows left + int_fast16_t d = 1; // d is our depth in the backtrack stack + // The UINT_FAST32_MAX here is used to fill all 'coloumn' bits after n ... + cols[d] = start_level3[cnt][0]; + // This places the first two queens + diagl[d] = start_level3[cnt][1]; + diagr[d] = start_level3[cnt][2]; +#define LOOKAHEAD 3 + // we're allready two rows into the field here + rest[d] = STORE_LEVEL; + + // The variable posib contains the bitmask of possibilities we still have + // to try in a given row ... + uint_fast32_t posib = (cols[d] | diagl[d] | diagr[d]); + + diagl[d] <<= 1; + diagr[d] >>= 1; + + while (d > 0) { + int8_t l_rest = rest[d]; + + while (posib != UINT_FAST32_MAX) { + // The standard trick for getting the rightmost bit in the mask + uint_fast32_t bit = ~posib & (posib + 1); + posib ^= bit; // Eliminate the tried possibility. + uint_fast32_t new_diagl = (bit << 1) | diagl[d]; + uint_fast32_t new_diagr = (bit >> 1) | diagr[d]; + bit |= cols[d]; + uint_fast32_t new_posib = (bit | new_diagl | new_diagr); + + if (new_posib != UINT_FAST32_MAX) { + uint_fast32_t lookahead1 = (bit | (new_diagl << (LOOKAHEAD - 2)) | (new_diagr >> (LOOKAHEAD - 2))); + uint_fast32_t lookahead2 = (bit | (new_diagl << (LOOKAHEAD - 1)) | (new_diagr >> (LOOKAHEAD - 1))); + uint_fast32_t allowed2 = l_rest > (int8_t)0; + + if(allowed2 && ((lookahead2 == UINT_FAST32_MAX) || (lookahead1 == UINT_FAST32_MAX))) { + continue; + } + + // The next two lines save stack depth + backtrack operations + // when we passed the last possibility in a row. + // Go lower in the stack, avoid branching by writing above the current + // position + posibs[d] = posib; + d += posib != UINT_FAST32_MAX; // avoid branching with this trick + posib = new_posib; + + l_rest--; + + // make values current + cols[d] = bit; + diagl[d] = new_diagl << 1; + diagr[d] = new_diagr >> 1; + rest[d] = l_rest; + } else { + // when all columns are used, we found a solution + num += bit == UINT_FAST32_MAX; + } + } + d--; + posib = posibs[d]; // backtrack ... + } + } + return num * 2; +} + +// expected results from https://oeis.org/A000170 +const uint64_t results[MAXN] = { + 1ULL, + 0ULL, + 0ULL, + 2ULL, + 10ULL, + 4ULL, + 40ULL, + 92ULL, + 352ULL, + 724ULL, + 2680ULL, + 14200ULL, + 73712ULL, + 365596ULL, + 2279184ULL, + 14772512ULL, + 95815104ULL, + 666090624ULL, + 4968057848ULL, + 39029188884ULL, + 314666222712ULL, + 2691008701644ULL, + 24233937684440ULL, + 227514171973736ULL, + 2207893435808352ULL, + 22317699616364044ULL, + 234907967154122528ULL, + 0, // Not yet calculated + 0}; // Not yet calculated + +void print_usage() { + printf("usage: m-queens BOARDSIZE\n"); + printf(" or: m-queens START END\n"); + printf(" or: m-queens -h\n"); + printf(" or: m-queens --help\n"); + printf("\n"); + printf("\ +This program computes the number of solutions for the n queens problem\n\ +(see https://en.wikipedia.org/wiki/Eight_queens_puzzle) for the board size\n\ +BOARDSIZE or for a range of board sizes beginning with START and ending\n\ +with END.\n"); + printf("\n"); + printf("options:\n"); + printf(" -h, --help print this usage information\n"); + printf("\n"); + printf("AUTHOR : sudden6 \n"); + printf("SOURCE : https://github.com/sudden6/m-queens\n"); + printf("LICENSE: GNU General Public License v3.0\n"); +} + +int main(int argc, char **argv) { + + int start = 2; + int end = 16; // This should take a few minutes on a normal PC + + if (argc == 2) { + if((strcmp("-h", argv[1]) == 0) || (strcmp("--help", argv[1]) == 0)) { + print_usage(); + return EXIT_SUCCESS; + } + + start = atoi(argv[1]); + if (start < 2 || start > MAXN) { + printf("BOARDSIZE must be between 2 and %d!\n", MAXN); + return EXIT_FAILURE; + } + end = start; + } + + if (argc == 3) { + start = atoi(argv[1]); + if (start < 2 || start > MAXN) { + printf("START must be between 2 and %d\n", MAXN); + return EXIT_FAILURE; + } + end = atoi(argv[2]); + if (end < start || end > MAXN) { + printf("END must be between %d and %d\n", start, MAXN); + return EXIT_FAILURE; + } + } + + // properly cast + uint8_t start8 = (uint8_t) start; + uint8_t end8 = (uint8_t) end; + + // track if all results passed + int all_pass = 1; + + for (uint8_t n = start8; n <= end8; n++) { + double time_diff, time_start; // for measuring calculation time + time_start = get_time(); + uint64_t result = nqueens(n); + time_diff = (get_time() - time_start); // calculating time difference + // check if result is correct + int pass = result == results[n - 1]; + all_pass &= pass; + pass ? printf("PASS ") : printf("FAIL "); + printf("N %2d, Solutions %18" PRIu64 ", Expected %18" PRIu64 ", Time %f sec., Start Time %f, End Time %f, Solutions/s %f\n", n, result, results[n - 1], time_diff, time_start, (time_start + time_diff), result / time_diff); + } + + return all_pass ? EXIT_SUCCESS : EXIT_FAILURE; +} diff --git a/notes.md b/notes.md new file mode 100644 index 0000000..9265a1c --- /dev/null +++ b/notes.md @@ -0,0 +1,10 @@ +# Notes from SMT testing + +Using the command 'ppc64_cpu' to alter the kernel's use of SMT on the fly will +turn off/on SMT for the host, but not any KVM guests. + +Upon turning off SMT, and then back on, virtual machines will (unfortunately) +be "tagged to" or stuck on the physical cores' IDs (0,4,8,12,etc.). + +At the time of this writing, if one has to disable SMT and re-enable it, a +reboot will be required to get guest VMs the proper resources they need on the CPUs.