H8__PAGEZEROH__TEXT__text__TEXTL"?L__cstring__TEXTHbJHR__const__TEXT__literal8__TEXThhH__DATA!__data__DATA__dyld__DATAE 5 __const__DATAE 5 __bss__DATAL X__IMPORTP)@ __pointers__IMPORTP)@ __jump_table__IMPORT@P)@@ 8__LINKEDIT`)0P !P nb  P++ 86(a ; /usr/lib/dyldOb^j6!!=PL" 4/usr/lib/libbz2.1.0.dylib 4/usr/lib/libgcc_s.1.dylib 4o/usr/lib/libSystem.B.dylibj]\$ML$ˉ\$u\$ <D$-)X# X# UWVpED$$.)UEEUE@BEeƉ׋EkЋUi@BЉNjE׋Ep^_UD$ D$$-)U(YHEIEE} t} t&E\EEnE\EEtE‹EEEE}EuEHUWVS|[4 @fE}twE[EEM4 fp4 pЍ,)iȋEEԤE} EEu}t,,)D$ D$/D$`$,)}t,,)D$ D$D$`$+)}t,,)D$ D$D$a$+)}t,,)D$ D$4D$a$n+)}t,,)D$ D$D$=a$<+)}t,,)D$ D$D$Fa$ +)}t,,)D$ D$D$\a$*),)D$ D$D$ca$*),)D$ D$%D$la$*),)D$$ >*),)D$ D$ D$a$:*),)D$ D$<D$a$*),)D$$ )),)D$ D$ D$a$)),)D$ D$JD$a$)),)D$ D$ND$4b$p)),)D$ D$HD$b$D)),)D$ D$KD$b$)),)D$ D$JD$c$(),)D$ D$#D$hc$(),)D$$ ~(),)D$ D$D$c$z(),)D$ D$)D$c$N(),)D$ D$KD$c$"(),)D$ D$(D$d$'),)D$ D$ND$&),)D$ D$KD$f$&),)D$ D$KD$D$t$p),)D$ D$:D$t$D),)D$ D$?D$u$),)D$ D$<D$Du$)$`,)T$uD$ $),)D$ D$2D$u$),)D$ D$)D$u$^),)D$ D$/D$v$2)$,)T$LvD$ $),)D$ D$FD$v$)$D,)T$vD$ $m),)D$ D$D$v$n),)D$ D$.D$w$B),)D$ D$GD$0w$),)D$ D$ID$xw$),)D$ D$>D$w$),)D$ D$CD$x$),)D$ D$CD$Hx$f),)D$ D$CD$x$:),)D$ D$8D$x$),)D$ D$7D$ y$),)D$ D$3D$Dy$),)D$ D$ID$xy$),)D$ D$LD$y$^),)D$ D$5D$z$2),)D$ D$JD$Lz$),)D$ D$!D$z$),)D$ D$MD$z$),)D$ D$HD$ {$),)D$ D$HD$X{$V),)D$ D$D${$*),)D$ D$#D${$),)D$ D$,D${$),)D$ D$%D$|$),)D$ D$MD$<|$z),)D$ D$/D$|$N),)D$ D$HD$|$"),)D$ D$1D$}$),)D$ D$=D$<}$),)D$ D$MD$|}$),)D$ D$LD$}$r),)D$ D$!D$~$F),)D$ D$?D$@~$),)D$ D$JD$~$),)D$ D$MD$~$),)D$ D$ID$$),)D$ D$7D$h$j),)D$ D$KD$$>),)D$ D$DD$$),)D$ D$MD$4$),)D$ D$DD$$),)D$ D$>D$$),)D$ D$8D$Ā$b),)D$ D$$D$$6),)D$ D$6D$($ ),)D$ D$LD$`$),)D$ D$QD$$),)D$ D$OD$$)$,)T$TD$ $#),)D$ D$FD$$$),)D$ D$JD$$),)D$ D$OD$8$),)D$ D$QD$$),)D$ D$MD$܃$t),)D$ D$D$*$H)$,)T$DD$ $),)D$ D$QD$$),)D$ D$>D$$),)D$ D$TD$,$),)D$ D$WD$$b),)D$ D$QD$܅$6),)D$ D$D$.$ ),)D$ D$YD$H$),)D$ D$CD$$),)D$ D$CD$$),)D$ D$0D$,$Z)\$,)T$`D$ $),)D$ D$QD$$),)D$ D$QD$܇$),)D$ D$ID$0$),)D$ D$ND$|$t),)D$ D$QD$̈$H),)D$ D$ND$ $),)D$ D$:D$p$),)D$ D$KD$$),)D$ D$JD$$),)D$ D$LD$D$l),)D$ D$LD$$@),)D$ D$)D$$),)D$ D$3D$$ ),)D$ D$ED$D$ ),)D$ D$ND$$ ),)D$ D$LD$܋$d ),)D$ D$LD$,$8 ),)D$ D$)D$|$ ),)D$ D$LD$$ ),)D$ D$FD$$ ),)D$ D$9D$@$ ),)D$ D$'D$|$\ ),)D$ D$LD$$0 ),)D$ D$3D$$ ),)D$ D$3D$($ ),)D$ D$:D$\$ ),)D$ D$;D$$ ),)D$ D$BD$Ԏ$T ),)D$ D$OD$$( ),)D$ D$8D$h$ ),)D$ D$5D$$ ),)D$ D$=D$܏$ ),)D$ D$<D$$x ),)D$ D$=D$\$L ),)D$ D$AD$$ ),)D$ D$QD$$ ),)D$ D$4D$4$ ),)D$ D$@D$l$ ),)D$ D$AD$$p ),)D$ D$=D$$D ),)D$ D$FD$4$ ),)D$ D$?D$|$),)D$ D$$D$$),)D$ D$?D$$),)D$ D$+D$$$h),)D$ D$/D$P$<),)D$ D$BD$$),)D$ D$"D$ē$),)D$ D$GD$$),)D$ D$BD$0$),)D$ D$=D$t$`),)D$ D$.D$$4),)D$ D$(D$$),)D$ D$0D$$),)D$ D$KD$D$),),VD$D$$W),)D$ D$LD$$X),)D$ D$KD$ $,),)D$ D$DD$X$),)D$ D$KD$$),)D$ D$LD$$),)D$ D$KD$<$|),)D$ D$LD$$P),)D$ D$ED$ؗ$$),)D$ D$JD$ $),)D$ D$5D$l$),)D$ D$&D$$),)D$ D$:D$̘$t),)D$ D$4D$$H),)D$ D$:D$@$),)D$ D$4D$|$),)D$ D$ID$$),)D$ D$D$$),)D$ D$@D$ $l),)D$ D$AD$d$@),)D$ D$:D$$),)D$ D$4D$$),)D$ D$"D$$),)D$ D$"D$@$),)D$ D$"D$d$d),)D$ D$"D$$8),)D$ D$"D$$ ),)D$ D$"D$Л$),)D$ D$"D$$),)D$ D$"D$$),)D$ D$"D$<$\),)D$ D$"D$`$0),)D$ D$"D$$),)D$ D$KD$$),)D$ D$OD$$),)D$ D$+D$D$),)D$ D$PD$p$T),)D$ D$BD$ĝ$(),)D$ D$D$$(,)D$ D$D$$(,)D$ D$D$1$(,)D$ D$D$G$x(,)D$ D$D$d$L(,)D$ D$QD$$ (,)D$ D$D$֞$(,)D$ D$MD$$(,)D$ D$<D$8$(,)D$ D$3D$x$p(X$,)T$D$ $ (\$,)T$ԟD$ $(`$x,)T$D$ $(,)D$ D$JD$4$(,)D$ D$6D$$v(h$,)T$D$ $(,)D$ D$?D$$(,)D$ D$8D$8$($\,)T$tD$ $($&,)T$D$ $O(,)D$ D$?D$$P($,)T$ D$ $(,)D$ D$GD$`$(,)D$ D$0D$$(,)D$ D$+D$ܢ$(,)D$ D$+D$$j(,)D$ D$.D$4$>(,)D$ D$.D$d$(,)D$ D$.D$$(,)D$ D$.D$ģ$(,)D$ D$0D$$(,)D$ D$/D$($b(,)D$ D$HD$X$6(,)D$ D$GD$$ (,)D$ D$GD$$($R,)T$4D$ ${(,)D$ D$9D$`$|(,)D$ D$MD$$P($,)T$D$ $($,)T$ D$ $($X,)T$XD$ $(,)D$ D$ID$$(,)D$ D$D$$V($,)T$D$ $($,)T$XD$ $($^,)T$D$ $(,)D$ D$ID$̧$(,)D$ D$.D$$\(ص$,)T$HD$ $(,)D$ D$ED$$(,)D$ D$D$ʨ$(,)D$ D$CD$ܨ$(,)D$ D$DD$ $v(,)D$ D$GD$h$J(,)D$ D$?D$$(,)D$ D$?D$$(,)D$ D$6D$0$(,)D$ D$ID$h$(,)D$ D$ND$$n(,)D$ D$LD$$B(,)D$ D$FD$T$(,)D$ D$ID$$(,)D$D$$(,)D$ D$HD$0$(,)D$ D$HD$|$n(,)D$ D$FD$Ȭ$B(,)D$D$$(,)D$ D$HD$T$(,)D$ D$LD$$(,)D$ D$MD$$(,)D$ D$PD$@$n(,)D$ D$MD$$B(,)D$ D$LD$$(,)D$ D$KD$4$(,)D$ D$ND$$(,)D$ D$MD$Я$(,)D$ D$JD$ $f(,)D$ D$ID$l$:(,)D$ D$ED$$(,)D$ D$<D$$(,)D$ D$LD$@$(,)D$ D$4D$$(,)D$ D$<D$ȱ$^(,)D$ D$MD$$2(,)D$ D$?D$X$(,)D$ D$LD$$(,)D$ D$$D$$(,)D$ D$ND$$(,)D$ D$(D$`$V(,)D$ D$ND$$*(,)D$ D$OD$ܳ$(,)D$ D$JD$,$(,)D$ D$MD$x$(,)D$ D$JD$ȴ$z(,)D$ D$LD$$N(,)D$ D$MD$d$"(,)D$ D$4D$$(,)D$ D$$D$$(,)D$ D$OD$$(,)D$ D$HD$d$r(,)D$ D$!D$$F(,)D$ D$MD$Զ$(,)D$'$D$$(,)D$ D$ND$l$(,)D$ D$JD$$(,)D$ D$ND$$r(,)D$ D$MD$X$F(,)D$ D$LD$$(,)D$ D$ND$$(,)D$ D$QD$H$(,)D$ D$QD$$(,)D$ D$ND$$j(,)D$ D$JD$@$>(,)D$ D$HD$$(,)D$ D$GD$غ$(,)D$ D$JD$ $(,)D$ D$KD$l$(,)D$6D$$=(,)D$ D$KD$$>(,)D$ D$ND$L$(,)D$<D$$(,)D$D$$(,)D$ D$HD$8$(,)D$ D$ID$$r(,)D$ D$OD$н$F(,)D$ D$ID$ $(,)D$ D$HD$l$(,)D$ D$LD$$(,)D$ D$JD$$(,)D$ D$<D$T$j(,)D$ D$@D$$>(,)D$ D$QD$ؿ$(,)D$ D$!D$,$(,)D$ D$CD$P$(,)D$ D$FD$$(,)D$ D$KD$$b(,)D$ D$D$($6(,)D$ D$1D$D$ (,)D$ D$FD$x$(,)D$ D$ED$$(,)D$ D$GD$$(,)D$ D$KD$P$Z(,)D$ D$JD$$.(,)D$dD$$(,)D$ D$ED$4$(,)D$d|D$$(,)D$ D$ED$$(,)D$ D$AD$ $b(,)D$ D$D$N$6(,)D$ D$LD$l$ (,)D$ D$JD$$(,)D$ D$KD$$(,)D$ D$MD$T$(,)D$ D$D$$Z(,)D$ D$,D$$.(,)D$ D$MD$$(,)D$ D$OD$@$(,)D$ D$)D$$(,)D$ D$:D$$~(,)D$ D$'D$$R(,)D$ D$KD$ $&(,)D$ D$DD$l$(,)D$ D$'D$$(,)D$ D$5D$$(,)D$ D$$D$$v(,)D$ D$LD$<$J(,)D$ D$ED$$(,)D$ D$LD$$(,)D$ D$ND$$$(,)D$ D$MD$t$(,)D$ D$LD$$n(,)D$ D$LD$$B(,)D$ D$KD$d$(,)D$ D$LD$$(,)D$'D$$(,)D$ D$LD$L$(,)D$ D$JD$$n(,)D$ D$MD$$B(,)5D$8D$$(,)D$ D$:D$$(,)D$ D$6D$$(,)D$ D$'D$$(,)D$ D$D$ $f(,)D$ D$MD$@$:(,)D$ D$MD$$(,)D$ D$KD$$(,)D$ D$PD$,$(,)D$ D$D$}$(,)D$ D$LD$$^(,)D$ D$OD$$2(,)D$ D$MD$8$(,)D$ D$MD$$(,)D$ D$MD$$(,)D$ D$KD$($(,)D$ D$OD$t$V(,)D$ D$ND$$*(,)D$ D$MD$$(,)D$ D$KD$d$(,)D$ D$MD$$(,)D$ D$JD$$z(,)D$ D$QD$L$N(,)D$ D$.D$$"(,)D$ D$KD$$(,)D$ D$ID$$(,),XD$hD$$q(,)D$ D$LD$$r(,)D$ D$MD$$F(,)D$ D$ND$L$(,)D$ D$FD$$(,)D$ D$HD$$(,)D$ D$KD$0$(,)D$ D$AD$|$j(,)D$ D$ID$$>(,)D$ D$KD$ $(,)D$ D$OD$X$(,)D$ D$JD$$(,)D$ D$OD$$(,)D$ D$ND$D$b(,)D$ D$QD$$6(,)D$ D$PD$$ (,)D$ D$D$9$(EpUԉppUԉ,)t$ T$MD$ $F(pUԉP,)T$^D$ $(EpUԉ9,)D$ D$JD$x$(,)D$ D$6D$$(,)D$ D$LD$$(,)D$ D$JD$L$[(,)D$ D$ND$$/(,)D$ D$D$$(,)D$ D$ND$$(,)D$ D$OD$L$(,)D$ D$>D$$(,)D$ D$9D$$S(,)D$ D$D$$'(,)D$ D$OD$$(,)D$ D$3D$@$(EEԍ4| Eԍ4,)i@EEԍ4LEԍ4T,)0|$ED$L$ T$tD$4$(E} l,)D$ D$MD$$(,)D$ D$ND$$(,)D$ D$OD$0$(,)D$ D$OD$$(,)D$ D$JD$$S(,)D$ D$"D$$'(,)D$ D$/D$@$(,)D$ D$(D$p$(,)D$ D$)D$$(,)D$ D$7D$$w(,)D$ D$0D$$K(,)D$ D$.D$4$(,)D$ D$-D$d$(,)D$ D$<D$$(,)D$ D$&D$$(,)D$ D$BD$$o(,)D$ D$/D$@$C(,)D$ D$/D$p$(,)D$ D$/D$$(,)D$ D$'D$$(,)D$ D$9D$$(,)D$ D$;D$4$g(,)D$ D$ED$p$;(,)D$ D$.D$$(,)D$ D$DD$$(,)D$ D$DD$0$(,)D$ D$AD$x$(,)D$ D$AD$$_(,)D$ D$ID$$3(,)D$ D$ID$L$(,)D$ D$:D$$(,)D$ D$ND$$(,)D$ D$DD$$$(,)D$ D$MD$l$W(,)D$ D$#D$$+(,)D$ D$JD$$(,)D$ D$OD$,$(,)D$ D$ND$|$(,)D$ D$PD$${(,)D$ D$KD$ $O(,)D$ D$LD$l$#(,)D$ D$9D$$(,)D$ D$<D$$(,)D$ D$TD$8$(,)D$ D$>D$$s(,)D$ D$MD$$G(,)D$$ (,)D$ D$D$$(,)D$ D$LD$($(,)D$ D$PD$x$(,)D$ D$LD$$}(,)D$ D$GD$$Q(,)D$ D$ND$d$%(,)D$ D$LD$$(,)D$ D$GD$$(,)D$ D$OD$L$(,)D$ D$LD$$u(,)D$ D$OD$$I(,)D$ D$LD$<$(,)D$ D$MD$$(,)D$ D$LD$$(,)D$ D$&D$,$(,)D$$ W(,)D$ D$ND$T$S(,)D$ D$CD$$'(,)D$$ (EpUԉ@pUԉ@$EpUԉ@u#pUԉ@t u EpUԉ,)ut$ED$ T$D$ $(pUԉ@ {pUԉQu u >E,)ut$D$$i(EzpU؉ppUԉ@ !t3,)0pU؉t$$(EpU؉apUԉp pUԉ@ H!t E >u,)ED$D$$G(HE܍pUԉ@(tcpUԉ@(ȍHE܉)Ɖ‰L$ &D$T$E܉$@(EE.EpUԉ@)tcpUԉ@)ȍHE܉)Ɖ‰L$ &D$T$E܉$(EE.EpUԉ@*tlpUԉ@*ȍHE܉)Ɖ‰L$ &D$T$E܉$(EEH9Ev EH<.tݍH9EEpUԉEpUԉQu E >u,)HD$ED$ ut$,D$$(EpUԉ,)D$$ (,),TD$LD$$P(,)D$ D$ND$$Q(,),XD$D$$(,)D$ D$D$$$(,)D$$ (,)D$ D$GD$D$(,)D$ D$JD$$(,)D$ D$GD$$[(,)D$ D$HD$ $/(,)D$ D$ID$l$(,)D$ D$KD$$(,)D$ D$ID$$(,)D$ D$JD$P$(,)D$ D$ID$$S(,)D$ D$KD$$'(,)D$ D$CD$4$(,)D$ D$KD$x$(,)D$ D$HD$$(,)D$ D$ID$$w(,)D$ D$FD$\$K(,)D$ D$'D$$(,)D$ D$>D$$(,)D$ D$ID$ $(,)D$ D$GD$X$(,)D$ D$FD$$o(,)D$ D$HD$$C(,)D$ D$)D$4$(,)D$ D$KD$`$(,)D$ D$HD$$(,)D$ D$BD$$(,)D$ D$AD$<$g(,)D$ D$ID$$;(,)D$ D$MD$$(,)D$ D$OD$$(,)D$ D$JD$l$跿(,)D$ D$MD$$苿(,)D$ D$D$$_(,)D$$ (,)D$ D$KD$$(,)D$ D$ID$d$(,)D$ D$?D$$(,)D$ D$?D$$蕾(,)D$ D$?D$0$i(,)D$ D$?D$p$=(,)D$ D$MD$$(,)D$ D$AD$$(,)D$ D$BD$D$蹽(,)D$ D$@D$$荽(,)D$ D$CD$$a(,)D$ D$GD$$5(,)D$$ (,)D$ D$LD$X$(,)D$ D$QD$$ü(,)D$ D$RD$$藼(,)D$ D$MD$P$k(,)D$ D$MD$$?(,)D$ D$ID$$(,)D$ D$D$:$(,)D$$ 襻(,)D$ D$KD$X$衻(,)D$ D$GD$$u(,)D$ D$LD$$I(,)D$ D$LD$<$(,)D$ D$D$$(,)D$$ 诺(,)D$ D$QD$$諺(,)D$ D$OD$$(,)D$ D$LD$8$S(,)D$ D$JD$$'(,)D$ D$ND$$(,)D$ D$?D$$$Ϲ(,)D$$ 荹(,)D$ D$KD$d$艹(,)D$ D$OD$$](,)D$ D$LD$$1(,)D$ D$ND$P$(,)D$ D$MD$$ٸ(,)D$ D$PD$$譸(,)D$ D$ID$D$聸(,)D$ D$D$$U(,)D$$ (,)D$ D$ D$$(,)D$ D$ID$$(,)D$ D$HD$$跷(,)D$ D$:D$T$苷(,)D$$ I(,)D$ D$/D$$E(,)D$ D$D$$(,)D$ D$ND$$(,)D$ D$/D$,$(,)D$ \D$$p(,)D$ D$$L(,)D$$ 7(,)D$ D$DD$$3(,)D$$ (EEԍ" D EEԍ" EEԍ" D0tEԍ" DEE Eԍ" T,)ED$ut$EĉD$ T$%D$ $E(E}V,)D$ D$D$8$7(,)D$ D$ D$ D$ D$XD$$ƴ(,)D$ D$D$$Ǵ(,)D$ D$ D$ D$ D$D$$V(,)D$ D$&D$$W(,)D$ D$DD$0$+(,)D$ D$(D$x$(,)D$$ 轳(,)D$ D$D$$蹳(,)D$$ w(EHEԍ" t Eԍ" ,)t$ T$D$ $&(E} ~,)D$$ (,)D$ D$SD$$(,)D$ D$1D$($ֲ(,)D$$ 蔲(,)D$ D$ D$Z$萲(,)D$ D$FD$h$d(,)D$ D$OD$$8(,)D$ D$KD$$ (,)D$ D$ND$L$(,)D$ D$ND$$贱(,)D$ D$LD$$舱(,)D$ D$HD$< $\(,)D$ D$ID$ $0(,)D$ D$MD$ $(,)D$ D$LD$$ $ذ(,)D$ D$MD$t $謰(,)D$ D$ND$ $耰(,)D$ D$QD$ $T(,)D$ D$KD$h $((,)D$ D$PD$ $(,)D$ D$MD$ $Я(,)D$$ 莯(,)D$ D$D$V $芯(,)D$ D$D$m $^(,)D$ D$D$ $2(,)D$ D$D$ $(,)D$$ Į(,)D$ D$D$ $(,)D$ D$D$ $蔮(,)D$ D$D$ $h(,)D$$ &(,)D$ D$D$ $"(,)D$ D$D$* $(,)D$ D$D$E $ʭ(,)D$$ 舭(,)D$ D$MD$` $脭(,)D$ D$LD$ $X(,)D$ D$JD$$,(,)D$ D$2D$L$(,)D$$ 辬(,)D$ D$KD$$躬(,)D$ D$MD$$莬(,)D$ D$ID$$b(,)D$ D$D$f$6(,)jЍԤЍ,)T$xD$ $ʫ(,)kЍԤЍ,)T$D$ $苫(,)mЍԤЍ,)T$D$ $L(,)qЍԤЍ,)T$0D$ $ (,)yЍԤЍ,)T$|D$ $Ϊ(,)ЍԤЍ,)T$D$ $菪(,)ЍԤЍ,)T$D$ $P(,)D$ D$LD$@$Q(,)D$ D$ND$$%(,)D$$ (,)D$ D$D$$ߩ(,)D$ D$KD$$賩(,)D$ D$KD$<$臩(,)D$ D$LD$$[(,)D$ D$ID$$/(\${,)T$$D$ $̨(,)D$ D$HD$\$ͨ(,)D$$ 苨(,)D$ D$6D$$臨(,)D$ D$AD$$[(,)D$$ (,)D$ D$FD$$$(,)D$ D$BD$l$(,)D$ D$DD$$轧(,)D$ D$FD$$葧(,)D$ D$ED$@$e(,)D$ D$AD$$9(,)D$ D$ED$$ (,)D$ D$FD$$(,)D$ D$FD$\$赦(,)D$ D$CD$$艦(,)D$ D$D$$](,)D$$ (,)D$ D$D$$(,)D$ D$FD$$(,)D$ D$HD$\$迥(,)D$ D$JD$$蓥(,)D$ D$GD$$g(,)D$ D$FD$<$;(,)D$ D$CD$$(,)D$ D$FD$$(,)D$ D$0D$$跤(,)D$$ u(,)D$ D$MD$D$q(,)D$ D$ED$$E(,)D$ D$KD$$(,)D$ D$JD$($(,)D$ D$ID$t$(,)D$ D$ED$$蕣(,)D$$ S(,)D$ D$JD$$O(,)D$ D$LD$T$#(,)D$ D$KD$$(,)D$ D$!D$$ˢ(,)D$$ 艢(,)D$ D$ D$$腢(,)D$ D$ID$ $Y(,)D$ D$LD$l$-(,)D$ D$GD$$(,)D$ D$GD$$ա(,)D$ D$KD$L$詡(,)D$ D$LD$$}(,)D$$ ;(,)D$ D$ D$$7(,)D$ D$MD$$ (,)D$ D$PD$@$ߠ(,)D$ D$ND$$賠(,)D$ D$FD$$臠(,)D$ D$LD$,$[(,)D$ D$<D$|$/(,)D$ D$ED$$(,)D$ D$LD$,$ן(,)D$ D$?D$ $諟(,)D$ D$ED$D $(,)D$ D$&D$ $S(,)D$ D$5D$ $'(,)D$ D$GD$ $(,)D$ D$&D$ $Ϟ(,)D$ D$0D$4!$裞(,)D$ D$0D$h!$w(,)D$ D$KD$!$K(,)D$ D$*D$!$(,)D$ D$%D$"$(,)D$ D$<D$<"$ǝ(,)D$ D$"D$|"$蛝(,)D$ D$1D$"$o(,)D$ D$7D$"$C(,)D$ D$ID$ #$(,)D$ D$CD$X#$(,)D$ D$D$#$远(,)D$ D$ID$#$蓜(,)D$ D$!D$$$g(,)D$ D$#D$($$;(,)D$ D$CD$L$$(,)D$ D$(D$$$(,)D$ D$LD$$$跛(,)D$ D$3D$ %$苛(,)D$$ I(,)D$ D$D$@%$E(,)D$ D$3D$L%$(,)D$ D$2D$%$(,)D$ D$(D$%$(,)D$ D$'D$%$蕚(,)D$ D$,D$&$i(,)D$$ '(,)D$ D$ D$5&$#(,)D$ D$)D$@&$(,)D$$ 赙(,)D$ D$ D$j&$豙(,)D$ D$QD$x&$腙(,)D$ D$,D$&$Y(,)D$ D$D$&$-(,)D$$ (,)D$ D$D$'$(,)D$ D$0D$('$軘(,)D$ D$2D$\'$菘(,)D$ D$AD$'$c(,)D$ D$<D$'$7(}t,,)D$ D$D$($(}t,,)D$ D$D$($ӗ(}t,,)D$ D$D$"($街(|[^_UEE 9v EEE 9s EEEUWVS[Dž||tsDžxXtxft|Ѝ(iȍMQ|xx~tt~E} DžtDžxt@|xBUt(|(8t1x(U(85txЍUȃQ0|MЍUȃQ8tMЍUȃQ0|xЍUȃQ8EfE@d|BxA|F}Gt@hx@lt@pdD$ T$L$t$|$hT$ lL$pD$$(E}]||;xxttE[^_UWVS[} t E.E Dž tЍ(iE EDP6Ѝ(i<  PqQEEf@DžID TTT0~D }u2E}t E EEEEEdE5fDžhM܋( @ =M( @ =%~DžƄ ~㋽%(6щЍ @ E Ƅ&(6щЍ @ E Ƅ' (6щЍ  @ E Ƅ%(6щЍ @ E Ƅ&(6щЍ @ E ƄDžDž(6ЍЍ @ E <( ЉЉDžg(6ЍЍ @ E tt1tK()** (6Ѝ  @ E Ƅ5Dž%$(6ЍЍ$ @ E uz%((6ЍЍ( @ E Dž2%,(6ЍЍ, @ E 0@@4D8(644Ѝ8 @ E ЍD0)tu Dž< Dž<EE,[^_UWVS<[}tEEE )E}u E 6E}uE0EEE3EE@EUċEDUȋEDEd(6EEЍE @ E̋EEЍd(iЋEDEЋŰE DP6Ѝd(i<vQ}At EUԈEOOt!OED t EE EEЋEEUԈEEȃ}Eă}EE<[^_UEE f9} E!EE f9~ EEEUWVS<[DžbE DP6Ѝb(i 7EDP6Ѝb(i P~}t Dž DžRƅE E E} DžhM؋b( @ =(M܋b( @ =1~E Dž6U䋵#0=(~E Dž6U#0=1~Dž DžDžb( @ 7Uԋ(1b(6ЍЍ @ t3:}b( @ 7umUԋ(1b(6ЍЍ @ t 9 ZL*}t9Džȋ:b( @ 7E̋}ԋ(Ћ:1b(6щЍ @ EDžDžȋ:b( @ 7;E}ԋ(Ћ:1b(6щЍ @ ;Eu }}ԋ(Ћ:1b(6щЍ @ ;Eu9_f}tf+f)ȃ ff9Dž)Ƅ ~΋T$ D$D$$C\(Džȋ:b( @ 7}ԋ(Ћ:1b(6щЍ @ uGu5Ƅ}tM E;u}t& }u 9 9[}t 9 9 Dž DžUԋ(1b(6ЍЍ @ thuVDžAu)Ƅ ~ UB"B&B *B.B2B6BEԉ‹EfPE}GwE}GE}yE}^E}CEfE<[^_UVS[EEEEEEE0E}t=}tMETEEMEHTE(E}~METEEE}Pv}tMETEEtUTEEEE:EuU썃TUBT ȉT0EE9E|E@TT[^UWVSL[E@tE$EEEEEEUU܋M܉ME@~`EЋMA)M̃}u/EUЃMD$T$ $IV(Ẽ}E}EEE EЃD$E$RV(Ẽ}E}}UЋE@~dEЋMЋ@)M̃}u1EȋUЋUL$D$$U(Ẽ}E}EMM"UЋD$E$U(Ẽ}E}t,MЋ MԋUԋBMЉUЋEԉPMԉMЃ}D}t UЋE܉MЉMEЉE܋UЋUЋMUЋBE@~lEЋMЋA@)M̃}u5EȋUЋBUL$D$$T(E̋EE EEMÈM&UЋBD$E$T(E̋EE€}t(MЋIMԋUԋMЉAUЋEԉMԉMЃ}t:}t UЋE؉PMЉMEЉE؋UЋRUЋMA}O}t?}t UЋBM܉ EЋ@E}tUЋM؉AEЋEU($9E uQ}t'UMԉM܋E܋Eԃ}uMU܉ }t E@EUEE@PEP EЃ}tMЋQ $tTEP$9r>EPU(T$ fhD$RD$ $ZR($jzE@~EEEqEȉD$$Q(EЃ}uDžxbxM܋x'( @ D=xMx'( @ D=xx~EExDž|htxDȋ|D'(ȍ @DEED||~xxptEЍ'( Ѝ@D|tEЍ'( Ѝ@DD8StEЍ'( Ѝ@D|tEЍ'( Ѝ@DD8EtEЍ'( Ѝ@D|tEЍ'( Ѝ@DD8s EEeEEXEEEGtEЍ'( Ѝ@D|tEЍ'( Ѝ@DD8sEEEtEЍ'( Ѝ@D|tEЍ'( Ѝ@DD8s EEEEEEEDžxDž|ntxDȋ|D'(ȍ @DD‹EE||~xxjEED$D$<$U'(P$A E}E}tt~E}*Ĝ[^_UWVSl[pLuEMUEDDLjD E}~EEEoE]u EDȋED!(ȍ @EEEDE}~E}~u EЍ!( Ѝ@E|u EЍ!( Ѝ@ED8Ku EЍ!( Ѝ@E|u EЍ!( Ѝ@ED8Eu EЍ!( Ѝ@E|u EЍ!( Ѝ@ED8s EE]EEPEEE?u EЍ!( Ѝ@E|u EЍ!( Ѝ@ED8sEEEu EЍ!( Ѝ@E|u EЍ!( Ѝ@ED8s EEEEEEщEEuEcu EDȋED!(ȍ @ED‹EEE}~E}~EEщD$D$p<$@ l[^_UWVS,[w @0@t:ǕLOu)ǕƀLOw @0PD$ E$ҍǕhOu EǕOtǕO~ E^ǕOt+ǕO~ǕOE#Ǖ\O%t EǕ\O%t EǕ\O`t EǕ\OtEE YǕ\OtEE 3Ǖ\OtEEEEǕtOxOED$T$ 4$|$n(‹EE}~EE,[^_UYUB u E UB UUBy-UUVSP[EEE܍BUM܉ $ uۃ}+}+V}tb}!UHMEEU҉U܋M܉M@U}| }-tJ}~먋MHU} u E D$M $E ED$D$ E$ډUaED$D$ M $E?ED$D$ E$EED$D$ U$щMUfR m m m m m m m m m m m m m m m m m m m m m m m m m m m m m m m m Am m m m ( m m m m m m m m m m m m R m A m m m m m m m m m m m m m m m m m m m m m m m m m m m m \m m m m m m m m m m m m m m m m m m m m m m m m m m m m m } 2D$E$EU<%u*MqUEED$ T$L$U$։EED$D$M $EEEM<)BUt,MHU?D$M ${E:}t!RD$E$TEE} U<:uGM@UED$D$M $8E}uEEUB RD}t}t EEMĉL$D$E$EM<:BUt,MHUdD$M $mE,}t&EED$D$U$qCED$D$M $RE!U<|uu} M@U}t}u EEMȉL$D$E$E}u}t EEỦU} ED$D$M $EE En} ED$D$U$sEM1ME1EU􍃨'iЍqD ЍUEU'PE}u}tE}EUEE‰Љ($[USd[E{P )ȉ{{EEE2}%EỦUԋMԉMEEE}tE;Ev EȋUEMEȋEȉEE}ywȋUf'_D_'Ey_w}tUUEMEaEEAEU S'Ѓ}‰UE S'EEaEE#EAEE EaEEEAEE}tU3p̴U MEEEȍ3p̴tUUUȍ3p̴UzEhU S'iЃ}‰UE S'iEhD$E$-EP}ȋU S'i)‰ЃE"U S'iи)щM̃}t?EsEUUE)ȉ‹EĉD$ ED$T$U$h'E|}t#}t }uMM̋EE̋UcE MdEEUE)ȉ‹ẺD$ ED$T$U$'EM9Ms EȋUEMEȃ}E}tEEE͋U{d[US4[EЃ}t EUЈEEEDUȋEEE HDEȃ} ~ۃ}tEE EEDEE ;EM(EЋEЉEԋUȉŰEDUBMЈEЋEE E̋EDtǃ}tQE2EEȋE̋U)‰EEԈʋE̋M)ȈE̋E̋U‹E̋M)9rE)EEȃ} @9EuMЋU4[UVS [E EEE HEED$ D$D$$vLUE)Ɖ‰L$ .D$T$E$'EE@fED$ D$D$$rUE)Ɖ‰L$ .D$T$E$J'EED$ D$D$$cUE)Ɖ‰L$ .D$T$E$'EUE)ȉ1D$T$u4$'EED$ D$D$$r UE)Ɖ‰L$ .D$T$E$o'EED$ D$D$$cUE)Ɖ‰L$ .D$T$E$'EM;M u uiEEfv7EȋUE)Ɖ‰L$ 3D$T$E$'EME [^UVSP[EEE EE EuEEUD$@BD$ $T$'EEUD$@BD$ $T$'E} wBE̋EeD$UT$ D$D$$'?};wEkUdEԃCED$UT$ D$D$$'}Ww}kUdEԃCEEԉEe)ЋM)EԉEet$L$D$ D$D$$"'n}wdEԉEe)ЋM)EԉEeL$D$ D$D$$'}QwmEųEe iU)EԉEEųEe L$D$ D$D$$?'}: wmEE.‹EeiQU)EųE EE.‹EeL$D$ D$D$$'}(wmEMnEei: U)EE.‹EEMnEeL$D$ D$D$$S'}3EEEEE{DEi3)‰Љ E/tEEEE{DEL$D$ D$D$$'}wrE{DEei3U)‰EͣQEE{DEeL$D$ 'D$D$$0'EEUEy-Ei%)E_EQEUEy-EL$D$ 'D$D$$'UEP[^UY} uE 0UaEUHUEQUEDP6Ѝu'iE}tUEE EEUEE}P~EUaHUWVSL[MM@M@M@ ¸QD$D$$q'`xx%`Kt`\O%uM ` t Dž DžUEt`ƅt$ '$E$¸D$T$ $'`HD$ED$ D$ED$$$`ǀKǀ K`KP`KE`HHEU`@HEЋUtB6MЍH' @UB!ƋMЍH'! @UB!ƋMЍH'" @UB!EEiu }̋U䍃H'iEEiU ‰UċM̋U䍃H'iЉЋU BUԍH'P ‰EfFUE1UH'PE}PE}eEE}EE}*L[^_UWVS<[D$D$E$DžLDŽиz ~DžUDB6Ѝ'i<UtB6' @UB!Ƌ'! @UB!Ƌ'" @UB!Ѝ'iLиzLȸzPDž EE؉EEU؋EԋЍЍE'i~d}t0#DBft#DP~.LиzLȸzE},EE܃ } Dž} tE E DžL¸ztoLȴzLиzLдzLȸzLDŽдz;E N~:'D$ zD$GD$$'$EDžUDB6Ѝ'i<cUtB6' @UB!Ƌ'! @UB!Ƌ'" @UB!'iEE;E ~1M䍃LȸzPLȸzLH{'iLH{E'B^PaDžEE؉EEU؋EԋЍЍE'iE}E;E }#DBf#DP1M䍃LȸzPLȸzEԋM'i' P Lx{LH{E'B5E}tEE܃ }S.}tUE<[^_UYEtMEu'i<vMEt*EtME(tM(EPtMPEu'i<vEEE􍑕D;EuEEE} ~EEUS4[EEEUEEdECD;EuFECD@u.EC EEUE}tEE} ~E;Ev3E U}u EkE܉$xE}tUUO'ED$ &D$D$$O'DLPDLEE؃4[U(YEEEUЉUEEUЉU+E;Ete}u E+E‰ЉU+E;Ete}u Eo+E‰ЉUE;Ete}u E4UЉU+E;Ete}u E+E‰ЉU+E;Ete}u E+E‰ЉUE;Ete߃}u EUЉUE;Ete迃}u EOE}>E}%EE썑B;EuEEE} ~EEUS$[E EDE} ~EEU؉ЉUE}t'EE؋M܍O' <jU܉ЉU+Eu5E&Eo@t ETBTE} ~Ը+E؉‰ЉU+Eu7E(Eo@t ETBTE} ~Ҹ+E܉‰ЉUEu8E)Eo@t ETBTE} ~ыU؉ЉU+Eu8E)Eo@t ETBTE} ~Ѹ+E܉‰ЉU+Eu8E)Eo@t ETBTE} ~Ѹ+E؉‰ЉUEu8E)Eo@t ETBTE} ~ыU܉ЉUEu8E)Eo@t ETBTE} ~E܃}>E؃}%EEEETED8sM؉ME؃} ~݋ETE UE PE$[UWVS[E]EKMuEE}8EDP6Ѝ'i<‰ȍMQE}~E}~E$Č[^_UWVSl[Dž6EDP6ЍV'i<D P~V @} t:V fQE QE @E UQD$T$ $' V fEpEUE:DžhM؋V' @ = M܋V' @ =)~EDž6U䋵-0= ~E<Dž6U-0=)~DžDžUԋ )V'6ЍЍ @ TM-N,} PED$D$2$E 8rpU 8tPU R8r>U R8E 2D$QD$$'_V BBB "B&B*B.BЍV fEԉV fPE E PE 2QD$T$ $'2$V ftV ;~lV BBB "B&B*B.BEԉV fPV fE}GE}GTE}E}E}V fu} t2DžV T ~ڍV l[^_UST[D$($$'Ẽ}u8о'D$ D$D$$D'$EEUԋEЋM̉EmU؍̾'Uԍ̾'8<E&U܍̾'U؍̾'8U܍̾'Uԍ̾'8EE9EU9UM9MEtE9EeU9UYM9MMU䍃̾'U̾'8E E9EU9UM9MU荃̾'U䍃̾'8U荃̾'U̾'8EpE9EaU9UUM9MIE9E=U9U1M9M%EE9EU9UM9ME9EU9UM9MU̾'U썃̾'8EE9EqU9UeM9MYE9EMU9UAM9M5U̾'U̾'8U̾'U썃̾'8EЉEĸMM ¸M Љ‹EEM̉EЉEĸMM ¸M Љ‹EEẼEЉEĸMM ¸M Љ‹EEẼEE}vE}E}E}E}E}EE܃}E؃}Eԃ}`UԋEЋM̉7Ủ=7=T[UVS@[e2=te2=EEEEċU 'PEEEEEEEUԉUU؍'HEЋUЋEЋD DEDM؋u̍' @ EȋEȋUDB6Ѝ'i<EȋUtB6Mȍ' @UB!ƋMȍ'! @UB!ƋMȍ'" @UB!#E܅tfMЋEЋtU̍'P D>EȋUDB6#E܅t)MЋEЋtU̍'P DEẼ}E؃}n}$EEUU'iE̋E̋UċEȋE@UċEMUȉUċ!UȉUċ9ueMUȉEă!UȉEă9u4MUȉEă!UȉEă9uEEȋE9E_U1UE䍓'BE}EEԃ@[^UWVS[EE¸D$T$ $'EDž/0T4TDž扅x|i|i|x|=9/0T4T/4T0TƉT$L$ 4$|$蒵'DDDPM Dž^DEЍ5'i<'DEDȍ5' @Dȍ5' @E1fuDȍ5'! @Dȍ5'! @E1fuDȍ5'" @Dȍ5'" @E1fuDfDŽED$D$$glDfUDȍ5' @Dȍ5' @E1fuDȍ5'! @Dȍ5'! @E1fuDȍ5'" @Dȍ5'" @E1fu;E|P;U;M E/tB//D$ D$D$$6//HD$ T$D$$/SS Ѕtf/T T/SS9+9|9sE}/ǀEČ[^_UVS`[E E$EE;EU EDž&E ;Eu E QP~Dž E ;E E¸D$T$ $='E‹E ' @' @EEJ1fu'! @'! @EEJ1fu'" @'" @EEJ1fufDŽEJEHE}(\ 'i'E(`+EEE ;E0E‹EE M썓' @M썓' @EEEJ1fuM썓'! @M썓'! @EEEJ1fuM썓'" @M썓'" @EEEJ1fuEfDŽEJEE(e++EEE ;E0E‹EE M썓' @M썓' @EEEJ1fuM썓'! @M썓'! @EEEJ1fuM썓'" @M썓'" @EEEJ1fuEfDŽEJEE(b+EEE ;E0E‹EE M썓' @M썓' @EEEJ1fuM썓'! @M썓'! @EEEJ1fuM썓'" @M썓'" @EEEJ1fuEfDŽEJEE(`+EEE ;E0E‹EE M썓' @M썓' @EEEJ1fuM썓'! @M썓'! @EEEJ1fuM썓'" @M썓'" @EEEJ1fuEfDŽEJEE(e++EEE ;E0E‹EE M썓' @M썓' @EEEJ1fuM썓'! @M썓'! @EEEJ1fuM썓'" @M썓'" @EEEJ1fuEfDŽEJEE(b+EEE ;E0E‹EE M썓' @M썓' @EEEJ1fuM썓'! @M썓'! @EEEJ1fuM썓'" @M썓'" @EEEJ1fuEfDŽEJEE(]EEE ;E0E‹EE M썓' @M썓' @EEEJ1fuM썓'! @M썓'! @EEEJ1fuM썓'" @M썓'" @EEEJ1fuEfDŽEJEE;ED$D$$E ( TT;ws;r;sWE,D$$E(D$ D$T$ED$ED$ED$ ED$E D$$uDžlPEE .}E;EE;E((HD$ T$E,D$E$( TT;;r;s~(SS Ѕtv(T T(SS9|,99rEEM`[^UWVS\[KuDž TTSSE} t DžE} t| DžQU} }}u}tmE,ŰEDP6Ѝ'i<uEE}P~΋E D$ED$ ED$E܉D$E$} yEE:} ~&T TE EUEE} }ExEt( t6tt"EEƄEEƄQE}P~,E¸D$T$ $蜟'>D$ D$D$$\DžtD$T$ $2'EE؉EEqE¸D$T$ $'E@EE;E$EE*;E ŰEfU*M̍' @M̍' @E‹E1fuM̍'! @M̍'! @E‹E1fuM̍'" @M̍'" @E‹E1fuE}PD$ D$D$o$EWEE*Ѝ'i<u%EE*;EtEEƄQ EƄE}P~E2D$$D$ EUĉD$T$ED$ED$E܉D$ D$D$$EEE }E؉EDŰEDP6Ѝ'i<uEEƄQ EƄE}P~}t Dž DžE2T$$D$ EUĉD$T$ED$ED$E܉D$ D$D$E$\[^_UWVS[HKt7\O€\O\OK(ǀ`O`OK`OLLhHltlOExOtOE܍U܉PKPKF4 EUUUEDP6Ѝ'i<u 4P4UEtP6M' @ЋEP!ƋM'! @ЋEP!ƋM'" @ЋEP!Ѝ'i񍃕4P4uE}P48K8KFU䍃DLDLG} ~8,Guǀ,G,GK[^_UWVS [Ht}tDžԯ$T T T$TU ̴XXtXu DžXXuK} ct} su0}x* TTT TDž t}tE$船}t0}t* TTT TEEEEEߗ'E XXt";EEă(EċX붃}#WfeQwp444444444 $ 5   6-@"AGC^qT.lrzgߚΟDž| Dž|XX}u}}uExxEEEEt}u}u }uEU0E>TEXXtXDžT(uE;Tv.)uE}u׋TTTTTU`EEXXtXE%[uE9`sH]uE}u֍9`s``E``>}tldd 9dv d< u݋d)ЉE"9s EE;E|E}tEE;EvEE 9vH< u EDž 铡Dž 鄡Dž uEE;XuDž}tkXgXE}~{PXXt Xp%u;XXt X5?t,XX^tE;XDž}EgdP}u&D$ D$D$M $E}tHEEEatE}ӡoEEEEU΍tD$T$E$))d 9v5 )Ɖ‹ED$ T$D$ $|'E$0' Et tߗ'E ӗ'EEkd}N UCt%ct4EUDž EEDžMtA6ϗ' @}G!Ƌϗ'! @UB!Ƌϗ'" @MA!Ѝϗ'i9;~29}EEEPP}Cz0404UML[dC @0@t:LOu)ƀLO @0@D$ M $ЋuA4   8  8 EEDžP}DG6Ѝϗ'i<t%OD t EPP~uOEUWO@EU8EEDžPUDB6Ѝϗ'i<t%OD u EPP~O@EUEtƅEDžtEMB43f?A4 EE E|EDžDž]Mϗ' @ }DG6Ѝϗ'i<~fUZhhlrDž1UDB6Ѝϗ'i<uP~f LD$D$M $@ ‹LfDžcиzдz)‹<к<00fu9~hhl1@f@DžOMDA6Ѝϗ'itBP~@@@ @Dž(U@fU ~ύhhl/|E@@@ @DžQuDF6Ѝϗ'itHEBfEP~hhlxEDžt\u DžxxƅDž+/ZfMdO9rHKt|dOƄ.ZGdOHK1ZdOPdOHKfUhhl<|EDž)|$E$fu~΍hhl|E@@@ @DžUtB6ϗ' @MA!Ƌϗ'! @}G!Ƌϗ'" @UB!ϗ'i<w7Y1ϗ'PPU@fUϗ'BuPhhlXDž(B4fM~ύhhl}/DžGo}~(EEf9&EEf9t lh);q9tAEEEfUEfUlh)ljH;Thpd} |t E|E}t Phhtt.Zȍd)Ɖ‰L$ D$T$d$Y'dt1Z<v[t1Zȍd)lj‰L$ YD$T$d$'dtxuwhhh;lsNhp),Zhp)ƉP,Zf9t}tQPd)lj‹D$ED$ L$T$d$'dh;lxt]txTtJ,Zt,Zf9u Td)lj‹TD$ D$T$d$>~'d]EEEE|dhhtt.Zȍd)Ɖ‰L$ D$T$d$}'dt1Z<v[t1Zȍd)lj‰L$ YD$T$d$}'dtxuwhhh;lsNhp),Zhp)ƉP,Zf9t}tJd)lj‹D$ D$T$d$=|'dh;lxt]txTtJ,Zt,Zf9u Td)lj‹TD$ D$T$d${{'ddEqt@stNmt ;E5d?ddHEU؃@9duk Yd)lj‹D$L$ D$T$d$ez'dE؋@$E؃}edUċXEăXE ;EvUċXEăXEoH$y'H$iy'Tu Td|$ D$D$d$Yy'EEUE1"'pppppppppppU)pppppppppppppppp C"'ppppppppppp1)po)a,,Dž5MDA6Ѝϗ'i<u EPP~vLD$D$u4$褢Džtt3UDB6Ѝϗ'i<utP~ċLtLDžHиzдz)‹Ћtt9~*tLL*f(^f(dD$ D$D$d$v'5EEUEDž0@B0e(,Ek,ui@B,(,UMEU$T$dϗ'$D$T$ $u'DžwMDA6Ѝϗ'i<HuDF6fURϗ' @ϗ' @E}DG61fuϗ'! @ϗ'! @EMDA61fuϗ'" @ϗ'" @E}DG61fuP|dDž\ERϗ' @E!Ƌϗ'! @E!Ƌϗ'" @E!ƋU|B6ϗ' @MA!Njϗ'! @UB!Njϗ'" @MA!1d)Ɖ‹|$ D$T$d$r'di1ϗ'iȍd)Ɖ‰L$ YD$T$d$kr'dϗ'Bod)lj D$T$d$r'dPddYDžUtB6ϗ' @MA!Ƌϗ'! @}G!Ƌϗ'" @UB!Ѝϗ'i<u EPP=zEDžDžDž])0MDA6Ѝϗ'i< Ɖ~9}~ E]uEǃEƒEƒE dt$|$t$T$L$ D$D$d$o'G4T0TEUE"}tE$跂u Ex}tE$藂u Ex}uE,MB8-.m7m7??.????e2??46??m7:???c=?:???????.m7m7/?.?2?y1?4?4M6??m7:???c=?:}gt}Gu Dž DžE$I[t$D$}<$5&EEPEHE pExE@E@dT$4ED$0L$,ED$(t$$ED$ |$ED$D$ED$T$ /D$D$d$Ai'}EgdE}u&D$ D$D$M $E4urߗ'D$D$$L44u2ӗ'FD$SD$$g'$tD$T$E$GdDžHdЍ PЍϗ'i‹dP~dD$D$$S@EEЋd4T$ ED$t$ $rQ'$~4t>4D$0D$ D$T$$Js?4t4 da}~$}UJϗ' udE}Egd}u&D$ D$D$u4$jEtD$T$E$DžEЍ PЍϗ'i P~D$D$$/@Edd)lj‹ED$ D$T$d$Pe'dtD$0D$T$ D$ED$E$Dž{0u>@<0u+DžA @<0tddPxddD$0D$ D$UT$$MpdDžtttDžYUDB6Ѝϗ'i< Ј 8~~}ct}Cu Dž DžL$D$ $ԙ}ou+DdP)D dPPD$T$dD$ D$D$$b'd+}Egd }u&D$ D$D$u4$ED$D$E$qd}u1}<$D$D$E$E}pu(D$D$E$pdRxD$HD$D$ D$UT$E$d }Egd}st}St Dž Dž@xD$D$D$ D$EЉD$E$o$OtHLxD$D$T$ L$EЉD$E$$$d ;EvUċXEă\XEuTuC}pu@(@((dT<@t>T<*t1T<$T@<*tT@<@EƅdDžgȲd)lj‰L$D$ D$T$d$V'd9r}t,,R, ,,dTHD$T$Hx49sȲdiT<$LT@$gU'dd*1EEЍtEȃTu9E}8$ET<:uTEǀǀǀǀUT$ ˌD$D$T$Fǀt.EЍtEȍEDžTMit2tEuF||0EЍ¸D$T$ $S'EDžyEDP6E}tkt!EH#Eu0t: tCEE‹EfTH6PzEE EE|EFJ[[[[[N[[qQ[[T[[X[[[[[[[[[[[[[[[FJ[[[[[ N[\PxQ[[T[[XE\)ȉ‹\D$ بD$T$4$Q'Dž_Dž0VUUU0)000)Ɖ00Dž0980)444)Ɖ44t6)ljܨD$T$$P't 6u6)ȉ‹\D$T$4$P'9s|9s }tO@LtPE$/E9s Dž}tO@LtDžE̋ w EE̋cw EE̋=w EE̋='w EE̋=w EaE̋=?Bw ECE̋=w E%E̋=w EE |;E} E|PE}0EЍ¸D$T$ $G3'ED$tD$EЉ$[DžEfDP6P~Dž5EuEUE܋ЍЍGtEU䍃ϗ'i<M܋U䍃ϗ'PЍϗ'iϗ' @ M܋U䍃ϗ'PЍϗ'iϗ' @ ЋELP6ϗ'P ‹EfTx6M܋U䍃ϗ'P3U䍃ϗ'iϗ' @ M܋U䍃ϗ'P3U䍃ϗ'iϗ' @ ЋELP6ϗ'P ‹EfTx6E}E }DžtEDžEtP6ϗ' @ЋEP!Ƌϗ'! @ЋEP!Ƌϗ'" @ЋEP!#Uϗ'iEE;|~ E|P,}bt}Bu Dž Dž|@|}ft}pt}st}vt }Bd\}fu$d+d\+\(}su"d|d\*\Džx|ҍ@"d-d\-\uσ"d+d\+\{}fu$d+d\+\(}su"d|d\*\\ \d\d\\dDž }ft}pt}st}vt }BDž0VUUU0))Ɖ$Dž0980))ƉBt)}ft}su9s|9s t 6ul)ƉD$T$<$,'}ft }s(9|}ft }su6)ȉD$T$4$,'9|9s|nDž0980))Ɖu9s }tCE̋dT$ -D$D$d$+';}bt}Bu Dž Džtt_EDP6Ѝϗ'i<u:}uUDB6 Dž}EtP6ϗ' @ЋEP!Ƌϗ'! @ЋEP!Ƌϗ'" @ЋEP!EUϗ'i;EuE#Et M DžEtP6ϗ' @ЋEP!Ƌϗ'! @ЋEP!Ƌϗ'" @ЋEP!}!ljT$ $.ddxxHEU|)щʉEEU‹|)ЉE9s }EuӋ)ȉ‹dD$T$4$('9s }EuP}ft}sur9s|9s )ȉD$T$4$V''9s EɏECt*ldd;t1 <dE@dd#غd }Egd @0@t:LOu)ƀLO @0@D$ }<$ЍOyEdOuQd\Eƅd\EttU8tuHtAOEtƅ ƅEE}uĻEppЍPE)ЍpD$ D$D$$W,llЍPE@<<00E}EEDžNEE;E|ME\d)ȉD$ بD$T$d$ $'d@}t:\d)ƉYD$T$d$#'dDžtOD]ЍD$ D$T$$*\d)lj‰L$ D$T$d$9#'dtt;EaO@9OEtƅ ƅEE}uĻEhhЍPE)ЍpD$ D$eD$$)ddЍPE@<<00E}EEDž{EE;E|ME\d)ȉD$ بD$T$d$!'d@}t:\d)ƉYD$T$d$C!'dDžttOD]ȍOD]ЍL$ D$eT$$@(\d)lj‰L$ D$T$d$ 'dtt;E4O@9hDžUDB6Ѝϗ'i<OD uxD$ D$L$$:'\d)Ɖ‰L$D$ D$T$d$u'dP1Dž}DG6Ѝϗ'i<OD tЍT$ D$eT$$:&\d)Ɖ‰L$D$ D$T$d$u'dPdtu Dž Džd锎}A``4M`{|g|}JJJJJ=~JJJJJJJJJJJJJJJJJJJJJ{J|h}}JJJ ~JJ~~~J<J TTEUl@ t%@ @DžDžu} @ t%@ @ DžDžEU馋4t4@ EUW4t4@EU4t!4@DžDžDžUM鬊4t!4@DžDžDžu}PP$@ EU3@ t"@ PDžDžEUӉP<@8EUE E騉SSEU鋉SSEUnP,@(EUQP4@0EU4T T@DSS@D)׉EUSSEUˆTTEU饈TTEU鈈@ t$@ @Dž DžDž  EU&TTEU dDžTu U DžcC\\1;\πfyx0v 4%q}EgdEtDžƄTtT,V\A @t\A@OuAAƄ@OA PAD$M $ҋA0KA @9@d)Ɖ‹|$D$D$ ]D$T$d$'dA @ t+A P A$҉ DžPP#AKd)Ɖ‰L$ dD$T$d$'dDž|||x%A|ЋLtDžtmAtЋLd)lj‰L$ dD$T$d$;'dtt;|~WPtJPd)Ɖ‰L$ hD$T$d$'d\\9d_DžP Kt..Z1Zt<HKt DžG Dž-Džtt~EdtD$D$ lD$D$d$':dT$ D$D$d$w' Kt.2Z Dž$RHKtDž(cDž,Dž(Dž,(, $ $EUPHKtDžGDžtDž>2Z2Z8s  K9r.Z1Ztt~EdtD$t$ lD$D$d$';d|$ D$D$d$x'HKtEcEDž>2Z2Z8s  K9r2ZEEEU<Dž#)0J@0)0J@ȍd)lj‰t$L$ qD$T$d$'d)0J@~Jd)ȉ‹t$ YD$T$d$'d)0J@@d~Dž)0J@uЋH)0J@EEEUK} @@t:BOu)ƀBO @@D$}<$ЍKЉd} @@t:BOu)ƀBO @@D$U$ЍKDd~}EtDžƄTtT000,V00\A @t\A@OuAAƄ@OA PAD$M $ҋA0KA @9%A @d)Ɖ‹|$D$ xD$T$d$g 'dA @DžtzAtЋLtMtd)Ɖ‰L$ YD$T$d$ 'dtty\\9dIDž:DžtDžb2Z2Z8s 0Zt Džt K9rtt<.Z1Zt<HKt Dž4G Dž4-4Džtt~EdtD$L$ lD$D$d$'ydt$ D$D$d$'HyDžtDžb2Z2Z8s 0Zt Džt K9rtt52Z888Dž<RHKtDž@cDžDDž@DžD@D8<8D$ D$D$$aHFEEE;E\HFXD$T$ $*&H@QUD$T$ $&UE􉅤кHRHRt[UWVSL[ 0xF$T T11 ȅF$T T Q @ UD$T$ $ &FHD$D$ D$0ED$ $IE EԋUDB6Ѝ&i<rMԍ& @Mԍ& @Ѝ PUԍ P1 fpMԍ&! @Mԍ&! @Ѝ PUԍ P1 fpMԍ&" @Mԍ&" @Ѝ PUԍ P1 fpUԍ fDŽPUԍ fDP nUԍ PЍ&i<u6 @P PMԋUԍ P fTH Uԍ fDP Eԃ}P}t-F F @ E E}tLEtBE&ED$T$ )D$D$ $&$ @L[^_USD[E u E^EE}x} ~DE6&ED$T$ D$D$ $g&$"E2&$9EuU U6U E9| EME EED[USD[E u E^EE}x} ~DES&ED$T$ D$D$ $&$?EO&$9EuU􍃯U6U􍃯E9 EMEEED[UWVS[g 0xGA$T T11 ȅD$D$g $'zGA$T Tg Qg g&J $D$T$ $&g @GAtE䍓GA&tDž\\\g Ƅ\g fDŽPg Pg fTHB\UDB6Ѝg&i<\DUD$T$ $&\g& @\g& @ED\Ez1fuD\g&! @\g&! @ED\Ez1fuD\g&" @\g&" @ED\Ez1fuD\fDŽEz\Ez\g& @ED!Ƌ\g&! @ED!Ƌ\g&" @ED!‹\MDA61ElDD$T$ $&\EfU\g& @\g& @El‹E1ful\g&! @\g&! @El‹E1ful\g&" @\g&" @El‹E1fulGA>D$ D$(D$l${V\g DBBfut$g $sEE@u$\g Pg GAExE@ P\UDB6ЍGAT$ D$e\L$$nD$E$8|$PT$ t$D$$&\\g DPB‹E Љg fTHBlDD$T$ $2&\EfU\g& @\g& @El‹E1ful\g&! @\g&! @El‹E1ful\g&" @\g&" @El‹E1fullD$g $@qEE@u$\g Pg GAt{ExE@ TGAEȉD$ D$e\L$$"D$l$|$TT$ t$D$$>&UȍE1U̍g&PEȃ} \g DBBftG\\g TPB\uDF6 g fTHBg @Pg P\\PGAE䉂tEE؃}t7EEHEԍGAg @ GAg g @_E EЃ}MEm8#D$3D$EЉ$9&EЃ\g DPBЍg&iE̋d9M~ ủd\\P~dX&Ep8D$D$EЉ$&}ug @XEDž\\g DBBftrGAD$ D$\T$$UԋE؉)Ɖ‰L$E܉D$ D$T$E؉$=&E=E\\Pe Es8D$D$EЉ$&@f@DždEЃD$ D$D$$2 T D t P 2~f22D$ D$L$$Ut$D$x$藷& D PT2ǀ EE}tEEHE܍2 @ E E؃}Em8D$D$E؉$&eDžDžS D t9x$ L D 9v P~E؃E;E}U܋E؉)ыUE)9t]U܋E؉)ыUE)9tBE;E}U؋E܉)ыUE)9toU؋E܉)ыUE)9U/EċEă@[^US4[}uX0 , , t0, P( ( , @$ EEE, $ ( );Er+( E썃( E( EE^, E, , , t5, P( ( , @$ ZEE ;Es E EE$襢&, , u2&D$D$$&$ٹ0 u, 0  , E, E B, P( ( , @$ ( E썃( E( MME4[UWVS[UUED$EUB;EEMA M܃}6UpLhhhhhhhhLaLhhLhhaLLhhXhhhhhhhLhhhhhhhhhhhhhhhhhhLXLhhXEEEEUfBE MAE$UBUUED$E8MA;Eu!EUfBE MAE$UBlM M}uYEE}+UUED$E#UB;Eu EM M}u׍t ЛEP t ЛEUBEMfAE UBE$MAUUED$UUUEML$}}t ЛEP t ЛEUBEMfAE UBE$MAUUED$UUUEML$} EiDu }EiDU EE !‹E E ЉEiDu }EiDU EE !‹E E ЉEE[^_UWV0EiB3u UЋMAȉЍFEEiB3u UЋMAȉЍfFEiB3u UBЋMAȉЍFEEiB3u UBЋMAȉЍfFEiB3u UBЋMAȉЍFEEiB3u UBЋMAȉЍfF}tAUUED$T$ED$ ED$E D$E$PE.U‹EPMAЋEfPU EE }tAUUED$T$ED$ ED$E D$E$E/UB‹EPMA ЋEfPU EE }tAUUED$T$ED$ ED$E D$E$eE/UB‹EPMA ЋEfPU EE EiB3} UЋMAȋEƉЍf4GEiB3} UBЋMAȋEƉЍf4GEiB3} UBЋMAȋEƉЍf4GE0^_UWVS[E(t.EE}EUԉE@Ѝ.D$ D$T$$tƋUԉE@ ЍhUE@ȍ ЍȋME@;EhE@ȋE@E@Ų8Eă}% u }E}E@Et%EULME@P P  ƍ ȍiLPfG u ^fp E@ ^fp E@ ^fp E@ ^fp E@ƍ ^H E@ƍ ^P E@ƍ ^HETE@ȋUX P  ƍ ȍiTXfG E@ ^fp E@ ^fp E@ ^fp u ^fp E@ƍ ^H E@ƍ ^P E@ƍ ^HE@E@ƃE@ǃŲ8Eă}0E}E@\UE@ȍ ЍȋMɸ!‹MɋE \E@E`E@ЋM ЍȋMɸ!‹MɋE `E@E@ƃE@ǃŴ8Eă}Eĉddt7d dtGdt)dt/3E@E$E@EE@EMMԋEăt*EԋU LB6UEG&Pf9k*EԋU LB6UEG&P!fkkE Pu ^fp PE@ ^fp PE@ ^fp PE@ ^fp PE@ƍ ^H PE@ƍ ^P PE@ƍ ^HM  &^4 Ĝ  Ȝ< Ĝ  Ȝ‹ED$$L$ ED$t$ ^D$ pwD$ D$ !D$|$$BE̋EA%GPE9s EAM̍%GHE̍PHE}~EEp}GEAUB%ЋGH%GE@ E@ %kP@@@%kP@H t ;E U D$T$ $X:&Eăt&MԋUEG&P fH=uԋUԍ PUEG&P!ȉ fpUԍ PЍEG&i<oMԋUԍ P fHMԍEG& @MԍEG& @Ѝ PUԍ P1 fpMԍEG&! @MԍEG&! @Ѝ PUԍ P1 fpMԍEG&" @MԍEG&" @Ѝ PUԍ P1 fp%>D$D$ D$0ED$ $y%E}u  %u( $9E؍ 9E| ;E U Eĉ Ẻ E؉ Eԉ M ĜЍ ĜỦ % !׉  9t3   ԤP ԤEă E @ = EԈB @ UEG&PfA % KKfA  ԤfB l t& ~lE@uVuԋEԋU LB6UEG&P!ȋM fDq6U Dr6ЍEG&i<u Džp DžpplA lB !UԋEԋM DA6M fDQ6MԍEG& @MԍEG& @M AEԋM DA61ЋU frMԍEG&! @MԍEG&! @M AEԋM DA61ЋU frMԍEG&" @MԍEG&" @M AEԋM DA61ЋU fr P  E @ ^ EԈB @ UEG&PfA % KKfA  ԤfB t t& ~pE@uZMԋEԋU DB6ƋUEG&P!U fDJ6U DJ6ЍEG&i<u Džx DžxxtA tB !UԋEԋM DA6M fDQ6MԍEG& @MԍEG& @M AEԋM DA61ЋU frMԍEG&! @MԍEG&! @M AEԋM DA61ЋU frMԍEG&" @MԍEG&" @M AEԋM DA61ЋU fr P  ̤P ̤Et%ƅ Pu ^fp PE@ ^fp PE@ ^fp PE@ ^fp PE@ƍ ^H PE@ƍ ^P PE@ƍ ^HM  &^4 Ĝ  Ȝ< Ĝ  Ȝ‹ED$$L$ ED$t$ ^D$ pwD$ D$ !D$|$$aE̋EA%GPE9s EAM̍%GHE̍PHE}~EEp}GEAUB%ЋGH%GE@ E@ %kP@@@%kP@H Ĝ  ȜEUăaUUBm ̤$0‹ML$ED$ẺD$t$|$ ED$T$[$B-& Ȥ; ̤%9 ̤%9M  &^‹ED$$L$ ML$T$ ^D$ pwD$ D$ !D$D$$ ̤ Ȥ ZD$ !D$ED$EԉD$ ED$T$ $- ȤE Z EE}EE}E܋E܃}E}PE}~}\ P  9t3   ԤP Ԥ 1 E @ =  B @  EG&PfA % KKfA  ԤfB E t* E@un  U tB6 EG&P!U fDJ6U DJ6ЍEG&i<u EEEMA UB   M DA6M fDQ6 EG& @ EG& @M A M DA61ЋU fr EG&! @ EG&! @M A M DA61ЋU fr EG&" @ EG&" @M A M DA61ЋU fr P 2 E @ ^  B @  EG&PfA % KKfA  ԤfB E t* E@ur  U DB6ƍ EG&P!U fDJ6U DJ6ЍEG&i<u EEEMA UB   M DA6M fDQ6 EG& @ EG& @M A M DA61ЋU fr EG&! @ EG&! @M A M DA61ЋU fr EG&" @ EG&" @M A M DA61ЋU fr P  ̤P ̤Et%EE} Ĝu MEȠE UMȜMEE aE E Pm ̤$&‹ML$ED$ML$t$|$ ED$T$[$#& Ȥ ̤%9 ̤%9  ! %׉󤍃   ̤ƍ Ȥ ZD$ %D$T$L$ ED$t$<$Ž Ȥ[^_UWVS[| E䍃S$RS KK97S KKS$RS$RSRS KK9tSS KKSRSRt#D$StD$E $>J| ¸D$D$$\!&| s¸D$D$$5!&| Tt¸D$D$$!&| t¸B3D$D$$ &| ¸fD$D$$ &| ,¸D$D$$ &EtS E%!tN| ¸RD$D$$H &| pw¸D$D$$! &Ex| | Л| ǀФ| ǀ| Ȥt | U D$T$ $&| ǀQ| ǀ| ǀ| ǀĜE EỦUUs!&PE E ŰEuSЍЍGtE܋U܍s!&iE}U܍s!&PEMMUs!&is!& @ EԋMMU3U܍s!&is!& @ ED$D$D$ML$E؉D$ EԉD$| D$| ,$|}ԋE؉\UԋM؍| ЍFt‹E Љ| \fFt}؋Uԉ`U؋Mԍ| ЍFt‹E Љ| `fFtMԋUԍ| Ps‹E Љ| fHsM؋U؍| Ps‹E Љ| fHsEԋM tA6Mԍs!& @U B!ƋMԍs!&! @M A!ƋMԍs!&" @U B!EE؋M tA6M؍s!& @U B!ƋM؍s!&! @M A!ƋM؍s!&" @U B!9EuEs!&i<#uԋUԍ|  @ ‹E Љ|  fH u؋U؍|  @ ‹E Љ|  fH D$D$D$D$E؉D$ EԉD$D$| $yGEE| Ф9| ФPv0w!&D$Q5D$$"&$1| ФEԉƍ|  HB| ФEE| Ф9.U|  @;EtE | ФPv0w!&D$Q5D$$Y&$1| ФE؉ƍ|  HB| ФEtH.U|  @;EtESgƅggSD$ D$E؉D$$ hSD$ D$EԉD$$Z ƋUBG$‹hD$t$|$ ED$T$#6$f&| ȤSSȽUs!&P!ȅ| ȤUBGU؍s!&@lU؍s!&i@pUԍs!&@tUԍs!&i@xS̽| Ȥ)ȉ| Ȥ|$lD$pD$tD$xD$ G6D$T$ $/&| Ȥf}\EE܋U1}MMUs!&is!& @ Ѝ| fxt| xtЍ| PTt‹E Љ| fHTtEE܍s!&BE}QEMAMtU| PtȋU| PtD$D$D$UT$L$ D$| D$| ,$sEM9M|EEH;EkE}JEE }+E}S EEUs!&PEUMSFvЍE}EE}EE}UJuS~lE}RETDžPVUUUPTыT)‰|||T)|9ETDžPVUUUPTыT)‰Ѓ||MԋUJuS~lE}FETDžPVUUUPTыT)‰UEET)M6ETDžPVUUUPTыT)‰ЃEMMEEEE/Uԋu܍HEEċUč| Ps#EЅtMEĉڍ| fHtE4Uč| PTt#EЅtMEĉ| fHtEU؋u܍HEEċUč| Ps#EЅtMEĉڍ| fHE6Uč| PTt#EЅtMEĉ| fHEE}}}E2U܍| PtEă}EEU| PEȃ}yEUċMȍ| ЍȋMD$D$D$UT$EȉD$ EĉD$| D$| ,$4oMUċuȍ| ЍiѡpwMUȋuč| ЍiѡpwEtSEE}SD$ D$EĉD$$ESD$ D$EȉD$$Ƌ}GUBGE$'‹ML$t$|$ED$ ED$T$g6$&EU;UEM9ME2U܍| PEă}EEU| PtEȃ}yEUċMȍ| ЍȋMD$D$D$ED$EȉD$ EĉD$| D$| ,$lMUċuȍ| ЍiѡpwMUȋuč| ЍiѡpwEtSEE}SD$ D$EĉD$$ESD$ D$EȉD$$~Ƌ}GUBGE$‹ML$t$|$ED$ ED$T$g6$ &EU9UEE;E}xE}.E}E@t(D$ED$ ED$M L$E$| ;E[^_UWVSl[(R KK9p KK(R(R< KKEUD$D$E $E4xf ǀEU䉁K KExf ¸B3D$D$$ &EЉD$D$U $6xf ǀzEԍzEUԍP{Ѝxf UԍP{ȸ⍃xf xf U D$T$ $ &xf xf xf Pxf 1Љxf fHxf HEЋUЍ &i<~xf EЉxf fHxf  & @xf  & @Ѝxf P‹E1Љxf fpxf  &! @xf  &! @Ѝxf P‹E1Љxf fpxf  &" @xf  &" @Ѝxf P‹E1Љxf fpxf ǀE@t E@EEU>UED$D$ D$pẺD$xf $ xf =Cxf Eԉƍxf  P xf EE̅xËEEQxf EE UP xf  ƍxf  Pxf Pxf xf *xf ǀExf EU܍xf PExf U܍xf Pxf ȍGxf  Љxf EEEfFxf U܍xf PEċU܍xf Pxf ȍE@PExf ;EEE;Exf =D~Dxf  &D$ DT$ D$ $&xf ǀDEU䉁K Kxf ЉUEl[^_UWVS[_ EEyED$ED$ED$ ED$E D$E$FEċU T$E$u EĉE_ EoUBUVUċMȍ_ ЍFUȋMč_ ЍF!Eԃ}} E1EԋUЍ&iED$D$D$ỦT$EȉD$ UĉT$_ D$_ ,$bẺEUĉUEȉEỦUMȋEĉEUċuȍ_ Ѝ@@HǍ_ ȍiUEpw_ ȍiUEpw0_ EEiUEpwEt}EE}}D$ D$UȉT$$ Ǎ}D$ D$UĉT$$ EUċMȍ_ Ѝ@@EUЍ&iЍ[+$‰|$ED$ED$t$ ED$T$G$&Eԍ&BEЃ}zKUċMȍ_ ЍFEU1UԋUЍ&iED$D$D$ẺD$UȉT$ EĉD$_ D$_ ,$_}̋UĉUEȉEUċMȍ_ Ѝ@@Hƍ_ EEiסEpwEt}EE}}D$ D$UȉT$$Ǎ}D$ D$UĉT$$yEUċMȍ_ Ѝ@@EUЍ&iЍ[+$‰|$ED$ED$t$ ED$T$k$?&Eԍ&BEЃ}Eȃ}PEă}OE@t(D$ED$ ED$U T$E$}_ ;EEEČ[^_UWVS[E D$E$u Em MEEEUčMA t.^t6щ¸D$T$ $%S@ E S@ @ =S@ B S@ @ S@ fBS@ ^ KKfAS@ S@ ԤfBS@ S@ t&S@ ~hE @uRUDB6!ЋUfDJ6UDJ6Ѝ%i<u Dž DžA B BMDA6MfDQ6% @% @MAMDA61ЋUfr%! @%! @MAMDA61ЋUfr%" @%" @MAMDA61ЋUfrS@ PS@ S@ S@ 9t3S@ S@ S@ ԤPS@ ԤMDžEM ‹EfUB MA@UBS@ E S@ @ ^S@ B S@ @ S@ fBS@ ^ KKfAS@ S@ ԤfBS@ S@ t&S@ ~jE @uTUDB6!ЋUfDJ6UDJ6Ѝ%i<u Dž DžA B BMDA6MfDQ6% @% @MAMDA61ЋUfr%! @%! @MAMDA61ЋUfr%" @%" @MAMDA61ЋUfrS@ PS@ S@ S@ 9t3S@ S@ S@ ԤPS@ ԤEM ‹Ev^1MA S@ E S@ @ =S@ B S@ @ S@ fBS@ ^ KKfAS@ S@ ԤfBS@ S@ t&S@ ~hE @uRUDB6!ЋUfDJ6UDJ6Ѝ%i<u Dž DžA B BMDA6MfDQ6% @% @MAMDA61ЋUfr%! @%! @MAMDA61ЋUfr%" @%" @MAMDA61ЋUfrS@ PS@ S@ S@ 9t]S@ S@ S@ ԤPS@ Ԥ(EM ‹EE9MuEE;E }tS@ E􉂠Dž|S@ ;EuKUB u;EMA9E}+U^дzEU^иzE #S@ ‹E)P[^UWVSL[}tDžH& u{EEiDhD$$%& & u2%D$nD$$%$K& EĉB & 8& & & 0& & @@BBF F AABA+ EEPE@fEPE@f& EB& & @߉B^I& & @%B^IKP^IK^IK$& E@BBu/& ^IDBBu& @ & @ ~& @ D$D$u 4$$Eԍ& @;E~& EԉBEEPEB B uEEuEE;E}E؉E^I`FXD$T$ $%& $¸DD$D$$t%^IzǍ^Iz& $& 0ED$|$T$D$L$ E D$ED$4$`& @;E& @;E~& @EEPE؉B 9+ E䉂& 8& & & 0& & @@BBF F AABA^IF`XD$T$ $"%& $¸DD$D$$%^IzǍ^Iz& $& 0ED$|$T$D$L$ E D$ED$4$3EPB @B E@P E9 E@<& & @B& @E}uEEPE؉B ^IF`XD$T$ $%& 8& & & 0& & @@BBF F AABAEUЍ^IиzUЍ^Iдz)Ɖ@Eč& @ 9EEă?Eč& t+EiDh& T$$.%$EiDhD$$c%& & u2%D$nD$$E%$& EĉB EiD& $ѸEmUЍ^IдzEċEĉEUЍ^IиzEEЉEȃ}uD& @u4U^IP{UB^IP{8t UЍEEEH|U^IP{xU^IP{E̋M̸扵E |9E}+ E+ @ =+ xB + @ + fB+ ^I KKfA+ + ԤfB+ + t&+ ~hE@uRxxU DB6!Ћu fDN6U DJ6Ѝ~%i<u Dž DžA F BxxM DA6u fDV6x~% @x~% @M AxM DA61ЋU frx~%! @x~%! @M AxM DA61ЋU frx~%" @x~%" @M AxM DA61ЋU fr+ P+ + + 9t3+ + + ԤP+ Ԥ& 0UċE)׋x& UċE)щʋxЍȋT$M̸ L$E ^IuB& 0UċE)щʋxЍȋD$Mƃ Dž t sU D$T$ $,%xfUx~% @x~% @E1fux~%! @x~%! @E1fux~%" @x~%" @E1fu& @t/E E ^IƅtT^IT$ D$gxL$$-$t$D$b$a%& @E܍^IKP^IK^IK$QUԍ^IиzE;Eu(^Iu|FEԍ^I´z& H$UċE)iD& ED$D$t$EԉD$T$ D$ED$ $^IKP^IK^IK$[E& B@B+ E+ @ ^+ xB + @ + fB+ ^I KKfA+ + ԤfB+ + t&+ ~jE@uTxxU DB6!Ћu fDN6U DJ6Ѝ~%i<u Dž  Dž  A F BxxM DA6u fDV6x~% @x~% @M AxM DA61ЋU frx~%! @x~%! @M AxM DA61ЋU frx~%" @x~%" @M AxM DA61ЋU fr+ P+ + + 9t3+ + + ԤP+ Ԥ& 0UċE)׋x$& (UċE)щʋxЍȋ(T$M̸ $L$H& 0UċE)׋x,& 0UċE)щʋxЍȋ0T$M̸ ,L$& @;E+ E+ @ =+ xB + @ + fB+ ^I KKfA+ + ԤfB+ 4+ t&+ ~hE@uRxxu DF6!ЋU fDJ6u DN6Ѝ~%i<u Dž8 Dž884B 4A Bxxu DF6M fDQ6x~% @x~% @M AxM DA61ЋU frx~%! @x~%! @M AxM DA61ЋU frx~%" @x~%" @M AxM DA61ЋU fr+ P+ + + 9t3+ + + ԤP+ Ԥ& 0UċE)׋x<& @UċE)щʋxЍȋ@T$M̸ EMEM‹EME E}mE}RE}7 UEE}E2 uU E‹E@E}~$ EEEU DB6Ѝ%i<uEM |A6M% @U B!NjM%! @M A!NjM%" @U B!Ѝ%iEE}P)E$ EUEH$ EEEE`EM DA6Ѝ%i<5EEU tB6M% @M A!ƋM%! @U B!ƋM%" @M A!U%P!ft{UE‹EUE U%iAUE U%AUE U% AEE}E}PEEEUEEUE@EUE@EċUE@EȋE@EUEE̋UE@EЋUE@EԋUE@EEEE;EuoE;EugEEEE:UE@;EuUE@;EuEEUE9r}uEE;EunE;EufEEEE9UE;EuUE@;EuEEUE9r}uEE;EunE;EufEEEE9UE;EuUE@;EuEEUE9r}uEE;EunE;EufEEEE9UE;EuUE@;EuEEUE9r}uE}t}tUE }tUE UEEEUE9pEUE9EEEEE-E@EE@E ED$ ED$T$E$T ED$ ED$T$E$* ED$ ED$T$E$E EEE;EKEpEA(G@H(GHE@ E@ (kP@@@(kP@HEt(nƅnntY ED$ED$ ED$T$E$$詪‰t$ ED$T$$]%EHƋ}ED$ED$E$&EPH‰ )ȉƋ}ED$ED$E$ 0U )ȋ@Ƌ}ED$ED$E$Et(oƅoot> ED$ED$ ED$T$E$dD$$$%EEUE9EUE9EUE9}EpEA(GPE (GHE@ E@ (kP@@‹E(kP@HE}Ѝ T$ ED$L$E$EE E pp?ppt E;UEЍ%PEUE@Љ UE@EEU DB6Ѝ%i<EM tA6M% @U B!ƋM%! @M A!ƋM%" @U B!#EV EV @ ^V EB V @ V EfBV ( KKfAV V ԤfBV tV t&V ~`E@uJMEU DB6‹E!ЋU fDJ6U DJ6Ѝ%i<u Džx DžxxtA tB !UEM DA6M fDQ6M% @M% @M AEM DA61ЋU frM%! @M%! @M AEM DA61ЋU frM%" @M%" @M AEM DA61ЋU frV PV V V 9t3V V V ԤPV ԤE tEEEUE9pUEЍ%PEUE@Љ UE@EEM DA6Ѝ%i<fEU tB6M% @M A!ƋM%! @U B!ƋM%" @M A!#EV EV @ =V EB V @ V EfBV ( KKfAV V ԤfBV |V t&V ~[E@uEMEU DB6‹E!ЋU fDJ6U DJ6Ѝ%i<u EEE|A |B !UEM DA6M fDQ6M% @M% @M AEM DA61ЋU frM%! @M%! @M AEM DA61ЋU frM%" @M%" @M AEM DA61ЋU frV PV V V 9t3V V V ԤPV ԤE EEV ‹E)EEĬ[^_UWVS[E܍\ KKEUD$D$E $ Et%EPE@fEEED$D$U $\zE\zEU D$T$ $苛%P U\P{EU\P{ȸEEU\P{EU\P{ȸEE}u E;E }u E;E D$T$ $ǚ%MUP‹E1ЉfHHEU|%i<?MEfHM|% @M|% @ЍP‹E1ЉfpM|%! @M|%! @ЍP‹E1ЉfpM|%" @M|%" @ЍP‹E1ЉfpE@tE@\>T$D$ D$0ED$$'D$T$ $蜘%MUP‹E1ЉfHHEU|%i<?MEfHM|% @M|% @ЍP‹E1ЉfpM|%! @M|%! @ЍP‹E1ЉfpM|%" @M|%" @ЍP‹E1ЉfpE@tE@\>T$D$ D$0ED$$EEEEEEEM DA6Ѝ|%i<EU tB6M|% @M A!ƋM|%! @U B!ƋM|%" @M A!UPЍ|%i<UPM|% @ЍP!ƋM|%! @ЍP!ƋM|%" @ЍP!҉UPщ#UPЍ|%i<UPM|% @ЍP!ƋM|%! @ЍP!ƋM|%" @ЍP!҉UPщ#E}Et\ Dž;E}\ED$ D$eED$$Ǎ\ED$ D$eED$$Ú$:|$ t$D$$%EEE\Ļ;E,D$ ED$ED$$賒%EE\ED$ D$nED$$+D$ $q%E}uEEU tB6M|% @M A!ƋM|%! @U B!ƋM|%" @M A!#U|%iЍEE@ ^EB @ EfB\ KKfAԤfBt&~`E@uJMEU DB6‹E!ЋU fDJ6U DJ6Ѝ|%i<u Dž DžA B !UEM DA6M fDQ6M|% @M|% @M AEM DA61ЋU frM|%! @M|%! @M AEM DA61ЋU frM|%" @M|%" @M AEM DA61ЋU frP9t3ԤPԤE}PB}tED$$觎%E t;EwPEt7E;E}/EEč‹Eԉ)EȋEԉE؋EE̋E;E\EU䉁K KE}Et\ƅ}u |]UJ\P{ȸыUJ\P{Ѝ\L$ D$eT$$NjŨ\P{ȸыŨ\P{Ѝ\L$ D$eT$$蝔$‹L$EĉD$|$ t$T$$躌%E܉E?U؋BABAB A E؃QEE;E|‹E܉)Č[^_U8E@E}bt}ttE}#E}|[^_UVS[E HEEEOEEEE9}UEEDEUEEDEE}x0EEuUEEDEEEEuUEEDEE}yދEDE HEE H;Et]EEDžt98t)ƋEEDžt98t)9EE~4EE Dž|c Dž|b|x DžxrUE )ȉ‹xD$ D$T$E $'%E EEEE@E:EEEEEEEEMMUE )ȉ‹ED$ ED$T$E $藂%E E}uE \E E|E[}tOELDžt98t)ƋEHLDžt98t)9tlED~$ED EcEbEEErUE )ȉ‹ED$ D$T$E $蟁%E }~ETEHD9t|ED ED@E.EDEDE EDEMMUE )ȉ‹ED$ ED$T$E $ %E EEDE HEkE H;EtYEEDžt98t)ƋEEDžt98t)9ttEE~(EE EcEbEEErUE )ȉ‹ED$ D$T$E $%E EEEE@E:EEEEEEEEMMUE )ȉ‹ED$ ED$T$E $~%E E}Et E +E EEEEE@E:EEEEEEEEMMEE~(EE EcEbEEErUE )ȉ‹ED$ML$ uD$T$E $x~%E EEEE İ[^UVS[EEEEEEEEEEFUEEUMȋED!ЅtUE E8E}~EEE JE1UMȋED!ЅtUE E}~ɍE8E}~U}%iEU}%iEE;EEqEEOED#E܅1}tE ,E E E EE rE UЈu}t(}u ƅwƅwwvƅvuvP0E E E u UBx ExxUE tE܉ | Dž||EE t U UEEEEEED#EED#EMED#E܋M9u_EҍE}t}uEEUUEEEP0E E METE!ЉDE8 E( }UE}3E cE ED#E܋MEEE$E#EtEP0E E E8E}u֍E8 E( }E}EEEEEED#Eąt E E}~ރ}m}tE ,E E E EE rE EUEE:ED#E#EЅtUЉ‹EP0E E E8 E}uE}~E cE EȍP0E E E@EԋEHE؋EEEE2ED#EċM̉ED#EЋM9t E E}~ȃ}t9EԍP0E E EMETE!ЉDE}~E8EE}]E8EE};E Đ[^US[EEJE6EE Mmw%iЍEE }~čE}~E[UWVS,[EEEuEaEE8EE Mȋ!NjEEMȋ!t E}!E}~EE;E|EEE;EYEEԃ,[^_UWVSL[EЋEtƅEԍE؋Ev%iЍjȋU؋Eԉ)Ɖ‹E(D$L$ D$T$Eԉ${v%E} xE P0EԈE E-EE/E}xEP0EԈE E-EED$E$|U؋Eԉ)Ɖ‰L$ )D$T$Eԉ$u%E} ~7U؋Eԉ)ȉ‹E D$ /D$T$Eԉ$u%E.U؋Eԉ)ƉuD$T$Eԉ$yu%E}~7U؋Eԉ)ȉ‹ED$ 3D$T$Eԉ$>u%E.U؋Eԉ)ƉuD$T$Eԉ$u%EU؋Eԉ)ȉ7D$T$Eԉ$t%EEԃE܋E;EvE؉EEE`EEEEeEOEEMȋF U؋Eԉ)Ɖ‰L$ED$ED$ dD$T$Eԉ$Br%E E EE;EvE(D$E$D$E D$ED$ E؉D$EԉD$E$EԋU؋Eԉ)ȉmD$T$Eԉ$q%EED$ E؉D$EԉD$E$UEԋEv%iЍjȋU؋Eԉ)Ɖ‰L$ sD$T$Eԉ$Iq%EE$:tD$T$x$p%EEEEE#E{EȋUЈ}t(}u ƅƅƅ‹EȈEE u UB MuE tE DžME tu DžEEEEE#EE}MEEE#EM9u~Eҍ}t(}u ƅƅƅ‹EȈEEEE!‹EEE8 E( }0E}EE#EMEEEE#E{EfEЉEEEEtB6E8Mv% @G!ƋE8Mv%! @G!ƋE8Mv%" @G!ЋE!Ѕ9t3ԤPԤE@ ^EB E(B EfB KKfAԤfBt,~mE@uQEuEEDB6‹E!fDq6Dq6Ѝv%i<u Dž DžA F [E0MEEDB6fDN6E0Mv% @EMv% @ BEEDB61f~E0Mv%! @EMv%! @ BEEDB61f~E0Mv%" @EMv%" @ BEEDB61f~PEp}(EAU(ЋGHGE t DžjEE;EE8E}^E8 E( })E}‹EЉ)L[^_UWVS[OEEEEEtEE}~߃}t$bi%E9EEgEE8U؋M̍oȋ!tEẺEEE8U؋M̍oȋ!UDE}~}E؋UEuE؋UtE ^EE0E̋|UԋM̍oȋ!tEE}~ʃ} EEA}̋E̋DEUԋM̍oȋ#EDDtEE}~}EԋUEuEԋUoEYEE2E̋|UЋM̍oȋ!tEE}~ȃ}EЋUEuEЋUEEzM̉MEE8U؋M̍oȋ!NjUԋM̍oȋ!NjUЋM̍oȋ!UDMDtEE}~}/EEEET$ L$D$3$ f%EUMD$ T$L$W$e%EUMD$ T$L${$e%E@UBMAD$ T$L$$e%E؉EEԉEEЉEE+U ED$ ED$ED$E D$ED$E$D$ E D$T$E$)tE t EJE}E}E}O‹E)EEĜ[^_UWVS<[E`E`E`L$ T$D$|$d%E HEEEȃ0EEȃ8EEt$|$ D$ED$|$c%E}qEEET$ L$D$}$c%EEET$ L$D$;}$c%E HEEEȃ0EEȃ8EEt$|$ D$ED$Z}$c%E}qE E E T$ L$D$y}$b%E$E$E$T$ L$D$}$b%E(E(E(T$ L$D$}$hb%E,E,E,T$ L$D$}$9b%E0E0E0T$ L$D$}$ b%<[^_UWV`EEEEEVUUUEmыE)‰UEEM)M}uEEUEEE#EE#E#EE}usEE[u؋UE}؋MMЍЍM(EE !ЉD̋D̅tEE}~qEE[u؋E؋|̋UEM؉MMMЍЍEU(!D̋D̅tEE}~}u E0EE8}EE8 }\EEă`^_UWVS|[Dž0Dž4Dž8Dž<DžPDžTDžXDž\Dž`DždDž@@EDŽ@@~Dž@-@@DŽ@@~Dž@@DŽ@@~ރ} uEh['} uEd\'} uE`]'} uE\^'} uEX_'} uET`'DžPf'EtP@D$ey$n^%DžLDžHLPHȋ E`H!ȅt DžLHH~L&tEDŽPEDŽPEuP@ P@y DžT'&Et1} u $ U]%} T@D$ky$,]%DžLDžHLTHȋ E`H!ȅt DžLHH~Li%tEDŽTEDŽTEuT@ T@y DžX$Et1} u $ \%} X@D$py$[%DžLDžHLXHȋ E`H!ȅt DžLHH~L$tEDŽXEDŽXEuX@ X@} Dž\y#Et1} u $ Z%} \@D$uy$Z%DžLDžHL\Hȋ E`H!ȅt DžLHH~L"tEDŽ\EDŽ\Eu\@ \@ } Dž `""Et} `@D$zy$xY%DžLDžHL`Hȋ E`H!ȅt DžLHH~Lv!tEDŽ`EDŽ`Eu`@ `@} Džd DžLDžHLdHȋ E`H!ȅt DžLHH~L] tEDŽdEDŽdd@hDžLDžHLhHȋ E`H!ȅt DžLHH~L}tEDŽhEDŽhh@lDžLDžHLlHȋ E`H!ȅt DžLHH~LtEDŽlUDŽlDžHHDŽ$Dž@THH$@Hȋ $@@;E |HE`HH$!ЉHH<DžpDžH'HDŽDž@@@D@HȋH,UHȋ!tEHH~}EEEDžHH,EeE%(_%it>HEĉE̋E%EȋU؁(_%iЍEE8 E}uHHn}EEE#EԅuE8E}uŰE UЋEEDžHHŰHȋ HH UЃ Hȋ HH U܃Hȋ HH:EDžHHH H !ЉtEHHHH ! tEHHfEDžHHH UHȋ#tEHHHUHȋ! tEHH&} EEDžpt^E D$ D$D$D$D$D$ pD$D$E$ ZE D$ D$D$D$D$D$ D$D$E$ 0 0t"E tDžYDž8E}8tEGE5EEDžHE܃}uDžE$oEEEPE@8tE@EE@E)E@<u U Dž  ME@ЋEEEǀE~ EǀUEUEX@LUEUx/%J$D$T$ $.%EƅGx/%PEE5Eċ} DG6fuMċUċEDP:‹E1Љ‹EfTH:E}P~EU EEGEȋUȍx/%PE̋UẺuȋMȋUȉ}-U-}-U-M-EMDžK)ȉEЋuȋ}ЋUȋMЉȋPEċU DB6fMčx/% @M A!fMčx/%! @M A!fMčx/%" @M Af##E̅ ‰PE}PEEEpUȋMЉȋP#EԋMĉx/%i<u1uȋ}ЋUȋMЉȋPE!‰PE8 Eă( }uE}kEE;EnEEEzEGEȋUȍx/%PE̋UẺUȉPЉ‹E`EtXƅE`8E`E` E$UBU$.‰|$|$ D$$L$E؉D$ t$T$I$*%D$E؉D$E$[EЃ}EtX+ƅ++E`0E`8E`,E0UBU4$-‹EЉD$ t$|$,|$0D$E؉D$ 4L$T$ J$)%E tX@L\EE;Ez;EtX@LEE;E-Dž,[^_UWVSl[DžpEѠȮE䍃ѠltBEtѠƅtO$(%} uѠ`GPѠ`G)M U ѠHPѠH`C`dE/ll`9ls1lQ `F 8uӋlW`Af9u`9lѠ KK`fGѠ`BfƒѠЈЌ`G?Ɖ!! ЅtѠl؉EEx3`@y`A uDF6Ѝ'%i<I`G ȋ`B uTF6`G!ЋUfDJ6uDN6Ѝ'%i<`G Ћ`A uDF6}fDW6`B ȍ'% @`A ȍ'% @}G`A }DG61ЋUfr`A ȍ'%! @`G ȍ'%! @MA`G MDA61Ћ}fw`B ȍ'%" @`A ȍ'%" @}G`A }DG61ЋUfrEP`A uDF6Ѝ9$'%i`G Ѝ'%i8'%`B Ѝ'%8'% `F Ѝ'% 8te`W HѠ HPѠlt9;`v%`B`Rf9t `7`;`v`d9} ѠKd@ ѠKdEd@td@ E}܋EHEPѠFPѠFEHEPѠ@GEѠ@G}MѠK8E 'd@td@ u pѠ`;p}Ѡp`pѠkW@Pd@ 8$pѠkW@Pd@ 8sCpdp ѠkW@PpѠkQ@@0pѠkQ@@HѠkQ@Hpd@ ѠkP@HѠkX@HѠkX@@u3ppѠkQ@HѠkX@HѠ_@d@ 8Ѡ_@d@ 8s'dP Ѡ_@ѠƀY@ѠY@PѠY@d@ ѠkP@PѠ`@Ѡ`@uѠY@Ѡ`@Ѡ KѠlt3PffdvfѠf,ZѠ KEѠ.ZѠ KEԉѠ/ZѠ KdV Ѡ1ZѠ KdPѠ2ZѠ KdP Ѡ0ZѠ KPѠ KѠl>ѠK KѠ99r9wyѠK KѠ9r09w9rѠѠKPѠKѠ KKѠK KǀܤEEtѠƅhpѠlpѠ\tѠE \ܤѠ KK9t,Ѡ KKܤDž Dž$‹EԉD$ E܉D$T$O$s%} d$ k%VѠȮE)ȉ‹EԉD$E܉D$ OD$T$E$>%E d`9ds dt݋`9dDžtdhhyhV dG 8]hPdAf9@hllh9ls1lP hA 8uӋlVhGf9uh9lttGDžtѠȮE)ȉD$T$E$%EhF ЍѠD$ D$T$$$!ѠȮE)lj‰L$ &'D$T$E$c%Eh`9h^tdB <=udA dF׉ D$ $dB <=tѠ :ѠȮE)Ɖ‹|$D$ 8D$T$E$h%E.ѠlTѠȮEE$m$ %)}ѠK KѠ $$9$9r 9wuѠK K(,Ѡ0449,r,49,w09(rѠYѠ KKѠK KǀܤE;`}t-ѠǀHѠHPѠH^ѠHѠHѠHuѠHPѠHѠHPѠHѠl}u9ѠKu(E tѠKPѠKEtѠ?ƅ??t&ѠȮEE$Fk$ %}{ѠKfE UѠK KE؉)׉@DѠHLL9DL9DrH9@ѠK KE؉)׉PTѠX\\9TS\9TwX9P3ѠѠ|FXD$T$ $%ѠѠ0KFXD$T$ $%sѠ(K$K)׉Ѡ|OOD$ D$D$s}<$|zѠѠ9u $*ѠF|XD$T$ $%ѠǀhOǀԤl[^_UWVS[AlE}EuEƒ DžAlEt'LFXD$T$ $%AlԤEčAlE܍AlEAlE䍃AlAlAlAlPAlǀԤAlAlAlAlAlǀtbHuQKu@ut ̽ DžAlȤAlȤt ƀ̽Alǀ̤AlfǀAlǀܤR@@@ E EEEEEUB E؃}uEǀ E ̽tAlǀȤAlAl9tdE)EX ME)E@@ЉL$ ED$T$M $XAlǀEE EDž\\UDB6Ѝ%i<\MtA6\% @UB!Ƌ\%! @MA!Ƌ\%" @UB!dd%i``t!``;MrAlE \@uEtb~RD$ D$\L$$C$t$D$9$w %̽tPD$ D$D$sAl$gtƀ̽HƒHEUBAlE@Al@ =Al\B Al@ AldfBAl KKfAAlAlԤfBAlAlt)Al~kMXuR\\UDB6d!ЋUfDJ6UDJ6Ѝ%i<u Dž DžA B B\\MDA6MfDQ6\% @\% @MA\MDA61ЋUfr\%! @\%! @MA\MDA61ЋUfr\%" @\%" @MA\MDA61ЋUfrAlPAlAl\AlQAl0u` Dž E\UEAlhE4E t'`;MuM\AlhE\\PB ;ErB}AluAlAl9teE P }MAl9AlAl9}Et E%t$D$T$ $Z%Dž\\UtB6\E\% @Et!Nj\%! @Et!Nj\%" @Et!!ddzE \@u%EB.\E\% @Et!Ƌ\%! @Et!Ƌ\%" @Et!D$$ Nj\UDB6D$$ $D$ D$\L$$$ |$$T$ t$D$9$4%E,d%i<v\dfU2\dfU\% @\% @Etd1fut\%! @\%! @Etd1fut\%" @\%" @Etd1fut\\PUMAslt KK Ѕu* KKK KEEЉEE)E@uEE AlXAlԤEE)E@pE)EX }E)E@@(M@E)ЍED$|$ED$ (L$ED$$։``nE)E@@<vE@EЍAlXUAlԤ\u'E)E@@<5E)E@@ MAE)EX@fm w1E)EX +E)E@@;E4AlԤE)ȉ,`{EE\u(E)E@@<wUBE)E@@;E} w1E̍)EX E̍)E@@ tRMAt+AlAl)4Al4Eԋ4E̍)EX@;E~E)E@@EEAlԤE)‹EԍEԋE)EX@;E~wE)EX@;E}UEE̋E)E@@ =E)E@@<udE)EX ME)E@@ЉL$ ED$T$M $E)EX E 5Eԉ,,`E)E@@ tSMAt+AlAl)0Al00`E)EX@;`~`UEAlAl9tME)E@@<nE@)E@HEEE3ẺEE!EE @u%EE)EP@t*E)EP@8%E)E@8$8L$D$9$Q$EI}3@u%E}}wE)EX@E)E@@$‰|$EԉD$ t$T$9$$uE)EX@E)E@@$d‰|$EԉD$ t$T$9$$E E;E}EE}Al-Alx}} GAlGDž\Alu@E̍)ЍAl@ =Al\AlA Al@ Al\AlU|B6\Alȍ% @MA!Nj\Alȍ%! @UB!Nj\Alȍ%" @MA!fFAl KKfAAlAlԤfBAlUD$T$ $$bED$}<$u=KE tE܅yDžD&EDž<-4[UWVS[E Eԃ}uDȻE؍DǀȻ} t*} t$DPuD, DžE܋EEDF¸XD$D$$X$D$K(KDHƒDHDǀhOE¸D$T$ $$EtVD$?$D$T$ $$EU̍DfDŽP?E}P~UED$ T$D$$SEЃ}Dx5E@$DtFXD$T$ $$DF¸XD$D$$$Dx5D$ D$ED$$uEDFtXD$T$ $$c}t]D|5tME@$uCDD|5D$ T$ED$ $$tE}~DǀK=DD0KFXD$T$ $$DǀKEЉD$E$.E@(E8EpUED$ D$D$$ƻF EE}u‹E@$E}} tEDȴt5DȴED$ D$D$$_DSSD KKDSSDSS聚D(K$K)׉D|OODO|ODSSD0t E g} ua'&@@t:DBOu)DƀBO'&@PD$E$ҍDKuE } t"D$ EЉD$D$sE$.EkűU̍DOU̍DFDOűU̍DOU̍D@GDOE}~}x:E}t/D$E$EԉE EEE$k}uDE؉ȻEt2}t,D?D$ D$D$s$-EЁČ[^_UVS [ER¸D$T$ $R$i>t9i>>D$ D$D$R$y i>TTi>TT}tuEEԉE:UЋEDP6Ѝ$i<uUЋEDP6ЍE E}P~Eԍ$i<wDž i>>D$D$ D$ẺD$R$荲E؃}yDž }~Džr fDžƅEEEEEE9EEЍ$i<tUEЈEE}P~}uDž E EEEEЋEEMЍ$ @ER!ƋMЍ$! @ER!ƋMЍ$" @ER!E}u E LU$iE܋E9E}EԉE؋EEE܉E̋ẼtEE;EẼ jUBEfUBEE;Et3EEԋUEU؋EԈEXẼ Eȍ$ @Eȍ$ @EREE1fuREȍ$! @Eȍ$! @EREE1fuREȍ$" @Eȍ$" @EREE1fuREЋEE*fUE}EEEȍ$ @Eȍ$ @EREE1fuREȍ$! @Eȍ$! @EREE1fuREȍ$" @Eȍ$" @EREE1fuREЋEE*fU} EEȋEЋE DP6‹EE!Љ‹E fTH6E DH6EU$i<\EȋE‹E fTH6Eȍ$ @Eȍ$ @ЋE P‹E1Љ‹E fpEȍ$! @Eȍ$! @ЋE P‹E1Љ‹E fpEȍ$" @Eȍ$" @ЋE P‹E1Љ‹E fpEE;E }E}-}t Dž DžE;E~EEEȍ$ @Eȍ$ @EREE1fuREȍ$! @Eȍ$! @EREE1fuREȍ$" @Eȍ$" @EREE1fuREЋEE*fUEЍ$PE}ME‹E1fEЋEEfU*EЋEfUEȍ$ @Eȍ$ @ER‹E1fuREȍ$! @Eȍ$! @ER‹E1fuREȍ$" @Eȍ$" @ER‹E1fuRi>SSi>SS0Dž Dž [^UWVS[E EEE_1@LEED$D$E$J‹EBEċBEȋB E̋BEЋBEԋBE؋BE܍ZU6D$T$E$QD$D$E$UJE䍅U6D$T$E$QDžZ8twZ<1t<1uS$D$T$D$ T$D$/D$ $艷$PVDžY_1>D$ D$D$E$n?$D$ T$D$_D$ $$,EED$ D$D$E$s"‹EBEċBEȋB E̋BEЋBEԋBE؋BE܍Z_1tT$D$E$O_1>D$ D$D$E$?$D$ T$D$_D$ $$?D$ D$D$E$!E䍕_1tT$D$E$MHU} u ElD$M $DhEKEԉ$#vuD$$j$E}u!D$U$gEE}!uzD$$$E}u!D$M $gEEUԉED$ ED$D$ M $‹EPUEBUHME@E EU҉UԋMԉM@U}:3}:F}&}&(}}!Mԉ $tu}(te})t4ރ}?}? }=ƒ}^}|묃} D$E$fEE@t!.D$U$WfE^ED$ ED$D$M $‹EPE<)BUMHUD$M $eE} E@u!D$E$eEEUԉM<:t&ED$ ED$D$E$EEEUȉPM<:BUt,MHU@D$M $!eE(ED$ ED$D$E$P‹EP UHMEU<|u M@U} EMA z} E!E׋U<&u M@U} uE뭋M<=t!ZD$E$7dE>} 5U<=u M@UESE@t!.D$M $cED$$$E}t&D$@ $~$‹EPE@u!D$E${cEE@¸@ D$D$$%$EUHMUEEEEM҉UԋUԉU@M}+ }*}ڃ}(t<}(=}ta}<}-|}.~}{t}}t ލE럍E똍E둍E}t넃}zEԉ$ ~gUHMUEPED$D$ ED$ED$$EUԋM}t E?UEBE%E@u!D$E$aEEUԉED$ ED$ED$M $‹EPUEЃ}&t }|tEED$$|$E}uD$M $`aEjUEBE@tEEE@EE$|$E@u(E@uD$E$`EUUEd[UWVS\[EE̋ẺEEED$ ED$D$Ẻ$EE<:uyD$Ẻ$`E؅t\Eu؋}ԋEЉEċEԉ‹E){$t$|$EĉD$T$ 5D$zD$ ${$EԉẼ} tŰE E\[^_US4[E@u tE@$EE@$uD$@ ${$‹EP$E@$u2z$VD$D$${$EnE@$EE@EU <+t U <-u?Uu",XD$E$B{$EUuEEU썒,TUEu};uM E@~}[uEI}]uM>}u8}t2}+t}-t$UUEEUuEEUEU E}E m}uUUEEUu}t"U UUE EuEEE4[UVS [E EEU<[uuEU[UЋEEE8EQEU<{uEEUE}EtM-}}t'E썓BE}tE E뺃},tEUEEUx$iЉЋUU<,uEUD$D$ D$EԉD$$$ WE؋E$tEb }bbEQ+EEԃ}t$D$T$ $2i$tE$ t&U EDP6Ѝt$i<?E$t)U EDP6Ѝt$i<c'E EZЍt$i<ccE EZЍt$i<E EZM t$ @E$!ƋM t$! @E$!ƋM t$" @E$!dE EZddE}E EM t$ @Et!ƋM t$! @Et!ƋM t$" @Et!#E؅7E¸D$T$ $f$U EfU2M t$ @M t$ @E‹E1fuM t$! @M t$! @E‹E1fuM t$" @M t$" @E‹E1fu}t^E(D$ E$D$E D$ED$D$D$ ED$E D$E$DžXE$uID$tD$$؞;D$E$?@E$E44E(BȻt@ǀKȻD$ D$D$$jE$t(D$ D$D$c$6HD$ T$D$$?ǀ4E$ tBDžXzt&D$ D$D$o$U؍E1U܍t$PE؃}E E9E {DžXX[^_UWVS[r@ @$E@ EE@ u }mEEE@ EDžE@ %(u Et ME@tAE2E@PEDB6Ѝb$i<uEE}P~ȋE@E}EE/E@ t EyElEE@ RuV}tEt E;Etv E@E@ E@EЍEE@EԋE@ E܋UЋEԉ)щʍE}t,EtE;Ev}u E܃uE܃ }`FuG BrF A Q$rXE؃}eb$$D$T$ $`$}E܃t EQYEEPE}~>WEDB6Ѝb$i<u͍EE;E|E}~)PEHDB6Ѝb$i<uEpQEDB6Ѝb$i<?MVEDB6fMMb$ @Mb$ @EWEDB61fuMb$! @Mb$! @EPEDB61fuMb$" @Mb$" @EWEDB61fuEE;EBAUJNwD$ E܉D$T$EԉD$EЉD$L$ t$E D$E$s9tRE@ 938Et .uEt .uEt .uEt .uEt  .uEt .uEt .uEt" .uEt:E@t0Erv)lj‰@ DžEЉًE@+EpUrv)ljP‹D$4|$0D$,|$(D$$|$ D$|$D$EԉD$L$ t$T$.$[$EtP}t-Eu E}uE;Ev EEEEu UEE@ Att[E@ €@EP E@E}t;EE(E@ t EEuEE@ RuE@ RĜ[^_UWVSL[UB`t]UlMA`}GUB`@MA`}W`MAd9|}GdUBdMA`}G@@UB@EMA}}ȋEUBt!MAD$D$}ȉ<$Y$uUBdMEȹEĸ}HE}~4EEH< u&EEȃ< uEEȃ EEHUBLN}MMAdtCEEԋEE< tEE< u}W@MAd)ljUB@MAd}~I}'CEȃ 8u1EȃD$XT$$ Y$u E}uW}(}YEȃ 8uwEȃD$XT$$X$uSE}tFEԋuƋUl}OdAMAdt$${X$EE EE@}G@@UB@@Hv@\EԍM̋}̍Ȳ}̋E@Eȃ}tEȋU$IuM<#}$D$T$ $U$ UBh}Edt2ǀdgD$D$$yU$ǀSǀSMAXuFht#E¸QD$D$$U$UBTt MATuF UB $FDž%"U$M $D$T$ $T$@fDžhMA DI%5ȋuV DЍD Ѝ"U$PU fDJ6%5ȍ"U$ @%5ȍ"U$ @U  BEP DЍD Ѝ"U$P1ȋU fr%5ȍ"U$! @%5ȍ"U$! @U  BEP DЍD Ѝ"U$P1ȋU fr%5ȍ"U$" @%5ȍ"U$" @U  BEP DЍD Ѝ"U$P1ȋU frPDžMA DuV DЍ"U$PU fDJ6"U$ @"U$ @U  BEP DЍ"U$P1ȋU fr"U$! @"U$! @U  BEP DЍ"U$P1ȋU fr"U$" @"U$" @U  BEP DЍ"U$P1ȋU frP:Dž+!"U$M $D$T$ $ P$EDžDž-EDžDžh@ft%5 <VUBHLE؋E>utELE؋E@8u"@D$E؉$?O$t Dž Džv u%Lu2EЍBPfu{Au>EtE< t E@< u Dž Džu}*E*tXtKEPBUBtM $Dž DuVBUBtM $Dž@u fDV6u DV6UfJtbDžKMAEuVBUBtM $> t t t,tDžX0EPBUBtM $t/~ 7~tt uFtCEP@uN&U$0EԉD$T$L$ gD$D$4${I$-&U$EԉD$ gD$D$$LI$DžDž#uo@ft%5 M fDA6u DF6MfQtѽh:uVBUBtM $ t t,t}t{uFtD$4$G$&&U$gD$jD$$G$DžUB@MA8Q$rU0D$ D$L$$SF&U$t$t$T$ gD$D$ $ >$PMt;.t29t$$=u $.0t.uF<-}Dž|UBMAht4XAx4O'o4$TuX.9$< $C/uVBUBtM $0uF;^ERUB<.AMQBuFE$$.!,'_}~ $dS9t Dž.tEu^UB@MA8QEEDEEEMMUMȋUEEwEMUEE}}uU1DЉ Uč1D UQ($PEfTH6Em }yE}VE})E1Č[^_UVS [М(Мt}ММ(9BМȃuJМt МPМD$E$IМED$UT$М$u $c;М@TМ>D$ D$D$E$6m#$M$D$T$ $#$EEUDB6Ѝ#$i<E}EUtB6M썓#$ @UB!ƋM썓#$! @UB!ƋM썓#$" @UB!EEUDB6EEEМtE#EМtEЋE!Ѕh}QM썃МtEUfDJ6M썓#$ @M썓#$ @U BМtE1ȋUfrM썓#$! @M썓#$! @U BМtE1ȋUfrM썓#$" @M썓#$" @U BМtE1ȋUfrE}Pu}PE$М PМ Мǀ [^UWVS[EQSS ЅtNT TptSSpt׉x|DžxDž|x|EU䍃ǀ't DžE(@@T~2ǀE¸D$T$ $>$ǀ$7$$D$T$ $$DžpHEfU$ @$ @EE1fu$! @$! @EE1fu$" @$" @EE1fuPǀ>D$ D$D$$09Dž9P>P>f9tP~;u}S}܍ t$L$ T$D$U$)$TDžH T$ L$D$V$$DžDžqtAP>Ѝ$iЍE$g$ $.Y$P~$ >$$$$=D$T$ $$$$D$T$ $$DžpHEfU$ @$ @EE1fu$! @$! @EE1fu$" @$" @EE1fuPƒ>D$ T$D$$KE ET T;M;uq;}u]9Dž>P>P>f9D5P~=D$T$ $$E+EDDžD$ E؉D$uD$~$7B$$D$T$ $$DžDžX~ȋu$ @ Ef}$ @$ @Ef~ȋu$ @ Ef3f}$! @$! @Ef~ȋu$ @ Ef3f}$" @$" @Ef~ȋu$ @ Ef3f}mKǀ>D$ D$D$$&]$$D$T$ $$Dž`P>fM$ @$ @EP>1fu$! @$! @EP>1fu$" @$" @EP>1fuPkƒ>D$ T$D$$D~QE EtGT T;};E|;UPE}Pkt[9s?=D$T$ $ $$Ĭ[^_UWVS[ӈSS ЅtNӈT TӈSS׉DžDžEUE¸D$T$ $0$fDžƅEUEEEEEEEEEȍ$ @E!NjEEȍ$! @E!NjEEȍ$" @E!fu*EE;EEE E܉EEEEEM$ @E!ƋM$! @E!ƋM$" @E!Eԃ}u E JUԍ$iEЋE;E}EĉEȋEԉE؋EЉẼ}tEE;E } jUBEfUBEE;Et3EEċU܋EUȋEĈE6} D$T$ $ $D$D$$FẼ} D$ D$D$h$mtӈȻtFD$$dqӈȻD$ D$D$$j6ӈӈHD$ T$D$$?E EӈT T $$;M$;u ;}{}}uwE tjӈȴt4ӈȴD$ D$D$$M>BJtfb# @b# @Eb#P1fub#! @b#! @Eb#P1fub#" @b#" @Eb#P1fucb#fPPBJtfb#A ȍb#A Eb#1fMb#B ȍb#B Eb#1fMb#C ȍb#C Eb#1fMb#fRRBJtfb#D ȍb#D Eb#1fMb#E ȍb#E Eb#1fMb#F ȍb#F Eb#1fMb#fttBJt6fb#w ȍb#w Eb#1fMb#x ȍb#x Eb#1fMb#y ȍb#y Eb#1fMBJvE䍃BJvE1BJ(T,TBJ,T(TBJ$K(K0D$T$ $#Dž Ub#Ѝ)PfMfMfBJtf b# @ b# @E0Ub#Ѝ)P1fu0 b#! @ b#! @E0Ub#Ѝ)P1fu0 b#" @ b#" @E0Ub#Ѝ)P1fu0Dž@BJtЍb#i P~UBBJlT$ ED$D$ $y#BJBJ@ @$P$@ A0Q4BJ TTBJSSD$ D$D$b0$1BJȻu8D$b#D$ ED$D$0$6BJȻX0D$T$ $N#D$b#D$ ED$D$X$D$b#D$ ED$D$0$rBJȻu5D$b#D$ ED$D$0$)JBJȻu9D$b#D$ ED$D$0$BJTTƉ׍BJP4@0BJTTBJBJp(x,BJP$@ A(Q,BJSSxBJ(K$K)׉BJ|OOBJO|OBJSSD$ D$D$a0$N.EE;E<[^_US$[E/U#UBD$T$$#E}~ȸ$[UWVS[U#э$D$T$ $d#E¸QD$D$$K#>vE>vxEx#P Exxu>0T4TDž\\扅`ditdtid`d=9>0T4T>4T0TD$QD$ $T$#||EDP6Ѝ#i< |E DP6#E|D||E TP6EfTH6|# @|# @ЋE P|E DP61‹Efp|#! @|#! @ЋE P|E DP61‹Efp|#" @|#" @ЋE P|E DP61‹EfpM}U#э$D$T$ $k#DžxaxDHxxE TP6EfTH6x# @x# @ЋE PxE DP61‹Efpx#! @x#! @ЋE PxE DP61‹Efpx#" @x#" @ЋE PxE DP61‹EfpxxPĬ[^_US[D$E $T$#9 TT9T T[UWVS\[i9vEEEU#э$D$T$ $2#EEEЉEUči9P?Ѝ#i<UċEtP6Mč# @ЋEP!ƋMč#! @ЋEP!ƋMč#" @ЋEP!Ѝ#iEȃ}~-}tE"U9U~EȉEE U9UuEEă}Pi90T4TEEEUiUEEiEEU=9i90T4Ti94T0TƉEЉEUEUD$T$ 4$|$#EEUči9P?Ѝ#i<UċEtP6Mč# @ЋEP!ƋMč#! @ЋEP!ƋMč#" @ЋEP!Ѝ#iEȃ}~M}uU9Uu?MЃ}u6uċUċELP6i9tE1‹EfTp6M Eă}Pi9>D$ D$D$E$Ẽ}u E;E}\[^_UWVS[5vEU#э$D$T$ $藽#E6󪍅x6󪍅o@@DžXDždDžTTE DP6Ѝ#i``o;dTEDP6Ѝ#i<ZT#\Ћ`ЍUȃ:T#Ћ`Ѝuȃ:T#xT#OxTTE TP6EfTH6T# @T# @ЋE PTE DP61‹EfpT#! @T#! @ЋE PTE DP61‹EfpT#" @T#" @ЋE PTE DP61‹Efp`o@oT#\`HT#ȋ`LT#T#OƄxx5x5xȍuL:ȍUL:MH:XXt?D$D$E$ \\t\PCuTTP~TQTddDžPPļ[^_UEU D$T$ $#UWVS\[0ǀȻDžP~݋EU D$T$ $耸#Dž00T4TDž扅ii=900T4T04T0TD$QD$ $T$>#00T4TDž扅ii=900T4T04T0TD$QD$ $T$臶#9tFP+DžDž! EDP6Ѝ#i< E¸D$T$ $### @# @EEF1fu#! @#! @EEF1fu#" @#" @EEF1fufDŽEF}8 #i#EZ+# @# @EEF1fu#! @#! @EEF1fu#" @#" @EEF1fufDŽEFE_++# @# @EEF1fu#! @#! @EEF1fu#" @#" @EEF1fufDŽEFE^+Ћ‰# @# @EEF1fu#! @#! @EEF1fu#" @#" @EEF1fufDŽEFEZ+# @# @EEF1fu#! @#! @EEF1fu#" @#" @EEF1fufDŽEFE_++# @# @EEF1fu#! @#! @EEF1fu#" @#" @EEF1fufDŽEFE^+Ћ‰# @# @EEF1fu#! @#! @EEF1fu#" @#" @EEF1fufDŽEFEY‰# @# @EEF1fu#! @#! @EEF1fu#" @#" @EEF1fufDŽEFDžP~BDžED$T$ $h#PEFЍ#i<8D$T$ $## @# @E8En1fu8#! @#! @E8En1fu8#" @#" @E8En1fu8fDŽEnD$D$8$)< \[^_UWVS[U#э$D$T$ $B#E¸QD$D$$)#a vEa vEa 0T4TDž\\扅`dipdpid`d=9a 0T4Ta 4T0TD$QD$ $T$Ѧ#||EDP6Ѝ#i< |D||E TP6EfTH6|# @|# @ЋE P|E DP61‹Efp|#! @|#! @ЋE P|E DP61‹Efp|#" @|#" @ЋE P|E DP61‹EfpM} |#it|#xExx+t||D|D|EDP6Ѝ#i<K||E TP6EfTH6|# @|# @ЋE P|E DP61‹Efp|#! @|#! @ЋE P|E DP61‹Efp|#" @|#" @ЋE P|E DP61‹EfpME+t+x||D|D|EDP6Ѝ#i<K||E TP6EfTH6|# @|# @ЋE P|E DP61‹Efp|#! @|#! @ЋE P|E DP61‹Efp|#" @|#" @ЋE P|E DP61‹EfpME+xЋt‰||D|D|EDP6Ѝ#i<K||E TP6EfTH6|# @|# @ЋE P|E DP61‹Efp|#! @|#! @ЋE P|E DP61‹Efp|#" @|#" @ЋE P|E DP61‹EfpMEtt+x||D|D|EDP6Ѝ#i<K||E TP6EfTH6|# @|# @ЋE P|E DP61‹Efp|#! @|#! @ЋE P|E DP61‹Efp|#" @|#" @ЋE P|E DP61‹EfpME+x+t||D|D|EDP6Ѝ#i<K||E TP6EfTH6|# @|# @ЋE P|E DP61‹Efp|#! @|#! @ЋE P|E DP61‹Efp|#" @|#" @ЋE P|E DP61‹EfpME+tЋx‰||D|D|EDP6Ѝ#i<K||E TP6EfTH6|# @|# @ЋE P|E DP61‹Efp|#! @|#! @ЋE P|E DP61‹Efp|#" @|#" @ЋE P|E DP61‹EfpMExxt‰||D|D|EDP6Ѝ#i<K||E TP6EfTH6|# @|# @ЋE P|E DP61‹Efp|#! @|#! @ЋE P|E DP61‹Efp|#" @|#" @ЋE P|E DP61‹EfpMM}~Q}a €΀a HD$T$ D$ED$E$DU#э$D$T$ $谘#DžtatDHttE TP6EfTH6t# @t# @ЋE PtE DP61‹Efpt#! @t#! @ЋE PtE DP61‹Efpt#" @t#" @ЋE PtE DP61‹EfpttPļ[^_UWVS<[E¸D$T$ $#€΀HD$T$ D$ED$$E܃}y $趖#, }~$蝖# 0¸RD$D$$[#EEEEЍ(#i<UEEM(# @E!ƋM(#! @E!ƋM(#" @E!EU܍E1E¸D$T$ $d#UEfUM(# @M(# @E‹E1fuM(#! @M(#! @E‹E1fuM(#" @M(#" @E‹E1fuU܍(#iEEE"EEЍ(#i<EEMč(# @E!ƋMč(#! @E!ƋMč(#" @E!E̋U̍(#i000t7MUuċẺljЍifE0EE}PERRRR@RRRR@RExMԋuč(# @ E؋EEЍ(#i<%EEM؍(# @E!ƋM؍(#! @E!ƋM؍(#" @E!ExUЍ(#i0UЍ(#iЍ$D$T$ ${#}OEՑ8u-D$ՑD$E؉${#u UBh뱋EБ89D$БD$E؉$F{#}GD$D$$z#tWV#БD$ ɑD$D$$Qz#2LP2LEsUBD$D$$^}G E@UB uWV#БD$ ɑD$D$$y#2LP2LEEaE؉EEEt E< uEV#E؉D$ ɑD$D$$;y#2LP2LE`2dt22ǀdb#D$2Ȯ$x#E}GUBEEL[^_USD[,VE,RE䍃,TE荃@HE썃?E5EEUԍpȃ@E܋EE؉‹EEEuE؉‹EEE܃tE؉‹EEEtE؉‹EEEtE؉‹EEEtE؉‹EEM؃AUԉp+EUԍpE؃}EEEEEEEEEEE@HD$,X$Xw#E7E܍+u"M܋Uԉp+E}~ÃD[UWVS,[EEUEE>>EE@<-ugEo>EE@EEzX=>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>=>! Z >!%')*%,24A5b88{9 ::i;;<>>>>>>@[o !!Q'E(.*a+,2458V99S::~;<ǀ0ƒƒƒ_E@EEuuEEE:UD$ED$$ws#FHDžEB\B\-@\ u@\E@E} t*ԸED$$E@\t *E@EE$duE@yUԸE@EEt1tE;uE$dtEtE@EF} DŽԸǀpE@EE<ǀ)ƒ~E@$at7EPD$ED$$p#@EHE1@P@E@EEu}EEE7} t5ED$$EEuEDž88UȴǀHE@EEuUEEE7fu<DžsEtE<-uE@uE} sUBEu $a`uu#LD$D$$~n#EDž8~7Et5ED$$蛾EEuEDž8B7U̴PtNPu#T$ LD$D$ $m#EDž86E@EEЍPPuEHEǀPpPoEEuĉDžDžEDžDžDžE@EE} R%%%%%%%%_ %%%%%%%%%%%%%%%%%%%%%%_ %%%%%%%% x %%%%% %%%%%%%%%%%%%%%%%%%%%%% %%%%%%%% % % %%% %%% % %%%%% %% %v  }n_ PEỦ0E̋E@EE@/~ 9~}QUJX.‹0E@EE@/~ 9~mbDžQSt<Dž@BEtEPu#T$ LD$̭D$ $h#$U~t"DžDžDtDžPDž }t}tu}tz~quh̀ƍvpv@vP >~JPu#D$?T$ LD$D$ $g#$~ Eȉƍvpvpv@4vx v@ t2Ev vHHv@y:NHv@ٍvHHvHv@9t9v@vHyc}uhHٍvHNHv@̀vH-t3uDž+t DžDžDžHEEu0EI}s:${t9Uu#T$ LD$ D$ $d#${uxǀvvvvvvvvvvǀvDžЍTv@RPB006 0qf     *       s                M  Tk        v=v=~fvvu#0D$T$L$ LD$1D$4$a#EDž8*vu?vuǀv}vPv`vPvvuvvvPvCлb̻`Cлȯ̻7ܻ vuǀvvuǀv!ллvtǀv€΀>лLvDžVUUUы)vvǀvQvvDžVUUUы)‰9JǀȻ߸лohܻXػ#ܻv%8uxIv@ v@v)ƉXvH v@vH9}Hgv@vHv@nuevڍvvv vǀvR@Džv@ tY@ q@v@t/D qDv@ taH qHv@ tfL qLv@t5P qPv@t=T qTv@tGX qXv@tN\ q\v@tW` q`v@t^d qdv@teh qhv@t9v@v)Ɖ@l DžlvH v@B@|$v t Džp Džp6pvvuǀv<vuǀvǀܻJ2ܻ3ѽлǀ2ܻu#LD$D$$(V#EDž8(ǀ\0E@$AGt7EPD$ED$$hV#hEHEhPhǀdǀlE@$FtXEPD$ED$$U#E}uEǀU(EHE+ǀ(dE@$'Ft7EPD$ED$$SU#,EHEǀ,dE@EEu&UEEEtE@EUBEE<-t E<.u DžGE$SEt"ED$UT$$}T#EMĉDžEEEE@EE<-tE<.tUE9UD$ED$$S#UE9vEE-ut DžtctE<{uZDž/E<}u E@E;EЍP E@EEu 9}DžEHEC,,-Z,!$$%d%d%d%d%!%d%d%d%B%d%d%S%d%d%d%d%d%d%d%d%d%d%d%d%d%d%d%d%d%d%$%d%d%d%d%!%d%d%d%B%d%d%S%EE䋕E䋍HEPEǍE}tDž릍E땍E넍u#LD$D$$P#EDž8E@EEu&uEEEtEE҉x@ExIxIGxCtRu#LD$D$$9P#EDž89xct xitA뮍EUD$ED$$P#UE9E뿋EEE<,uE@EEǀǃ|ƒE4Ћ|?Ɖ M|T'EHENE@EEuUEEE} t5ED$$"EEuEDž8UغDE@EEuǀD UD$ED$$N#DDǀDE@E@EEu}EEEEuE<-uE@\u#UD$>D$$J#1Uu#T$ LD$AD$ $]J#EDž8]€E@AtSt.6E@E€ʀ E@EE@EElt:ltft2pt'ǀpEЍ@ftEUu#T$ LD$eD$ $I#EDž8DžEEUȍBEa(((-,..I....../........n.......E@EE<0E<9~Dž@3E܋E<(uDDž@*EDž@ EDž "EPu#T$ LD$D$ $G#EDž8Dž S+0 E܈EE@EE0~ 9~U<)BE E܈E<(+E}u !f@fP@fDžXD*T3T*T3~Džru#ЍD*ЉЉu#iЍD3%5P~Džru#iЍD*ЉЉu#ЍD3%5P~DžN!ȋD Pu#PfH ~ ǀE@EEuMEEE E<-u6E@u+ܻ2ܻE$5uE$5Dž5ruEUu#T$ LD$D$ $_C#EDž8_ 5rUD$$3EE5rD$$H=vMUu#D$T$ LD$ѯD$ $B#EDž8 5rDD$Ȯ$B#ED$D$Ȯ$tDž88 mEEEED$H$fEDž8 E@EEuUEEE EE5E@EEuMEEEY UD$ED$$A#0T4TEHE^E@EEuuEEEEtE<-uE@uE} t#EHEE@EEu}EEEPƋUD$ED$$=# EHEI$€@E@$.t7EPD$ED$$:=#EHEPR u#T$ D$!D$ $/<#EDž8/E@EEuUEEEUD$ED$$p<#ĻĻ'ǀĻ(EHEǀtE@EEuMEEEK} t5ED$$艋EEuEDž80EBǀ8!@T E@EEuuEEE} t5ED$$݊EEuEDž8UUD$$C:#uHUu#T$ LD$D$ $9#LPL ]E@EEu}EEEEE%E@EEu*UEEEIE;E҉@Ebtoetp8tHu#t$ LD$D$$8#EDž8ǀS8 IED$D$$,9#$$ EDž8hu#|$ LD$D$$ 8#EDž8 u#D$ LD$9D$$7#EDž8E<-q}tP% D$ \D$D$Eԉ$x5x5tV}te% D$ bD$D$E؉$ú|5|5uEDž8 U88,[^_UWVSL[Dž>}\ȋJ16#PQfH ~Qf@`QP`QfP\ѐѐѐѐpXp\H`phpqq!q\2qDqKqMqPqXqصǀǀ\&tt.pmqи2pǀǀ$ǀǀ|QǀĻP;sBEcU EԉD$D$$wE } u Eԉ$Kt;;EuصQ@fE}twE[EEMQfpQpЍ16#iȋEEE} EEu4T0T Ѕ$3#0T4T0T4T2#Ɖ׋ύ0T4T4T0T8T$iuOHЀD$D$ 5D$9YD$5$t $Htfult uǀĻPĻt"D$Ps$0#$H%tJǀD$ D$D$s16#$$聗$G(T,T,T(T@TDTpDžƄS~ݍ0KˆOXD$T$ $/#D$ D$D$i$褖Džq,D$D$T$IE܋,D‹E܉P,D‹E܉P ~л̻t̻Ѕǀ00T4TDž扅ii=90T4T4T0TƉD$T$ 4$|$J-#4$$0T4TDž扅ii=90T4T4T0TƉD$T$ 4$|$F,#лQD$$D$$х$_̀ȻЍHD$ L$T$$ _~FȻt6ȻD$ T$D$$贉D$ D$D$a$ђSS ЅtfT TSS99|9scP9} SS ЅT TSS 9b 99BԻԻ0t ܻuZtܻ6tܻܻػtػЅE @B@PBBPH4P\4P4@D@d@dB`B`AL$Zܻ$D$$҅u&D$ D$D$a$ȎT$D$ $Gq$utЍL$|>L[^_UEP\@hT$L$$2&#US[EU \@hT$L$$ &#;E t8%#D$ D$D$c$K&#$%#[UWV UXEM9M~EEU)UMTUTM\U MMH!‹MX+M U\MX+EUXMXEǀXUT@MTETMP9EǀTUTMƄ\UTM\EUBD$D$M $E@MTEM \UPD$M $EǀPUǂTMTUƄ\E%MTUƄ\}EEE ^_UVEUXEM 9M~E EuMUTM\ЋMX+MMH!Љ ‰UM)M UX+EMXUXu MǁXUT@MT} OE^UWVS<[UBt} t+D$D$M $t7EZD$D$u4$t E/UB D$ D$M $E} t%D$u4$kUBMAuFpD$ E$FUB MA ~ uF =~LEx MQщƒ"#0|$T$L$ `D$4$"#EW"#Mx$D$T$ $<"#EQMUB"#PufNM䍓"# @M䍓"# @ULBxUB"#P1ȋMfDqxM䍓"#! @M䍓"#! @ULBxUB"#P1ȋMfDqxM䍓"#" @M䍓"#" @ULBxUB"#P1ȋMfDqxE}"#uf"#A ȍ"#A uTFx"#1ЋUfDJx"#B ȍ"#B uTFx"#1ЋUfDJx"#C ȍ"#C uTFx"#1ЋUfDJx"#Mf"#D ȍ"#D uTFx"#1ЋUfDJx"#E ȍ"#E uTFx"#1ЋUfDJx"#F ȍ"#F uTFx"#1ЋUfDJx"#Mf"#w ȍ"#w uTFx"#1ЋUfDJx"#x ȍ"#x uTFx"#1ЋUfDJx"#y ȍ"#y uTFx"#1ЋUfDJxEM uF P"#EPЍ"#PUfJM "# @M "# @ULBxUB P"#EPЍ"#P1ȋMfDqxM "#! @M "#! @ULBxUB P"#EPЍ"#P1ȋMfDqxM "#" @M "#" @ULBxUB P"#EPЍ"#P1ȋMfDqxE}EE<[^_US[#ED$sXD$$~#[UWVS\[#Eԃ}t#u#@u[!$\{#Eԃ}uE*E)U䍃#Pn$ȋEu#E}~ыEǀXUǂTMԋAtt uƆ\}GEUԉBtMAeWEudžPEKE}ԉGlUԋBlu)MXD$E $=#MԉAluԋFl}ԋGlD$ D$D$E$6#UԋBl$#ƉMԋAl$#D$ t$|$$#uԋFl$#PXD$$\#}ԉGhUԋBhuC#D$ D$D$SX$#Mԉ $EhuF}G Eԃ¸QD$D$$~#&EUԉBlMԋAlu)gXD$E $#uԉFl}ԋGlsUԋBlUԁ\D$ D$D$$#t1#D$ D$D$jX$#E\UẺUEű}ȋMt FO)ȅt8#ED$D$ D$}XD$$#UԋBl$&#ƉMԋAl$#D$ t$|$$#uԋFl$#XD$$d#}ԉGhUԋBhu1#D$ D$D$X$#Mԉ $1#D$ D$D$jX$e#udžPD$}ԉ<$UԋBtt MApuԉuEЃ\[^_US$[EUBtMTUXt MǁXUT@MTUTEMǁTUTMƄ\UTM\EUBD$D$M $ ETEM \ED$E$vUBhtMAh$#UBltMAl$#q#t E$# q#UE$[UVS@[UB ;EE}tMA uEEUB }t&}D$M $uE3EE}PEMTEE 8tE}~RD$D$E$vU #D$D$U$GD$D$M $m$ED$D$E$HUxD$T$ $#EpMċEE Ѝ#PfM"Mč# @Mč# @EEE Ѝ#P1fuMč#! @Mč#! @EEE Ѝ#P1fuMč#" @Mč#" @EEE Ѝ#P1fuEE;EEEUċEE MD E}P~MDž98)‰ЉE E} U܉ DžM̋U̍#PEEEЉEԋEԉE؋E؉E%EEĉEEE"Ѝ#i<EE"M# @E!ƋM#! @E!ƋM#" @E!EU#i<UEfU"M# @M# @E‹E1fuM#! @M#! @E‹E1fuM#" @M#" @E‹E1fuE;Eu5E,E#Et"EE ;Eu EEԋE؉EEE}}W}MUԋEfU"Mԍ# @Mԍ# @E‹E1fuMԍ#! @Mԍ#! @E‹E1fuMԍ#" @Mԍ#" @E‹E1fuU؍#&E؃}t!EU؉T$D$E$U E} Eă }PUB@MAMQMQ@[^UWVS|[UBpHMApUBpM $*Dž UBtt M1yUBHMQEǀXUǂTMAtt Eƀ\D$U$MAtt E@p UBpHMApE@D$U$UxD$T$ $* #D$M $EExMEUDЍb #PfMMb # @Mb # @EEUDЍb #P1fuMb #! @Mb #! @EEUDЍb #P1fuMb #" @Mb #" @EEUDЍb #P1fuEE;E|MDž98)‰ЉEE} Uԉ DžMȋUȍb #PEEẺEЋEЉEEEE؋EEЍb #i<EEM؍b # @E!ƋM؍b #! @E!ƋM؍b #" @E!EU䍃b #i<U؋EfUM؍b # @M؍b # @E‹E1fuM؍b #! @M؍b #! @E‹E1fuM؍b #" @M؍b #" @E‹E1fuE;Eu"EE#EtUЋE؉DEE}}g}]UЍb #&EЃ}tEЉD$E$ DžDE؋U؋EfUM؍b # @M؍b # @E‹E1fuM؍b #! @M؍b #! @E‹E1fuM؍b #" @M؍b #" @E‹E1fuE} E }PE܉EEEЍb #i<EEMb # @E!ƋMb #! @E!ƋMb #" @E!EU䍃b #i< UEfUMb # @Mb # @E‹E1fuMb #! @Mb #! @E‹E1fuMb #" @Mb #" @E‹E1fuE}PED$U$u3D$M $b #Pn$UBD$M $buD$E$hUz MQщƒf #0|$T$L$ JKD$4$9#DžSMEEЍb #iUDE}P~͋MQMQDž|[^_UE EEE EEE EEEEEE1‹EE 1‹EE 1‹EE1‹EE1‹EE1‹EE1‹EE1ЉEEUWVEUEfDPE}~EK}MuUEfDPRETPREfTpETpEfTH@ETH@EfTxE}~E%MUEfDPdETPdEfTH,E} ~Ճ^_UVS` [E EE UEElE}P~EEEEEME싔lE@l‹ElEMElE l‹ElE}P~E(PE}uEEEԉEEEEEԋEEEEuUp U܉pL$D$E$EċEĉ,E;E'E;E} EĉEEŰEEEE}lE}QE؃ }E}}EEEE苄Dž*ы)Dž*)Ɖ)‰uUЋE苄EEE;E_EЉEEEEE)E苄EMDžK)ȉEԋUԉЍE)MDž98)ȉE؋U؉E)EEOE;EtBUԉЍUE,EċE;E~EĉEȍE}~E;E.E;E} EȉEEUЋE苄EEE;EEЉEE EEEE苄EMDžK)ȉEԋUԉЍE)MDž98)ȉE؋U؉E)uDž*ы)ƉE܃}}tUЋE苄EEE;EEЉEEE)EEE$E䋄EMDžK)ȉEԋUԉЍE)MDž98)ȉE؋U؉E)uDž*ы)ƉE܋U܉E)U؉ЉEU܉pEUpEEԉ‹EfEЉ‹EfPEЉ‹EfPEЉ‹EfPEEEE‹EfP@UEfDPEEEE‹EfPBUEfDPEEEE‹EfPDUEfDPEE;EÉ` [^UHE EE6E)EE؃}t}uEE AUJEDP@EEEEVUUUEmԉыE)‰ЉEEEEcEE|EUDBfyg}cuEEYE)EE܍EE܋U؉xD$T$ $"ME‹EfTHME‹EfTH@EE;ExEEME‹EfTHME‹EfTH@EE;E EUxEyD}  E[EEUEEE;E |E)E EE}xEEEE9؃}y EEEEEUEEDEE;E |E HEEEEEE9ETEEEE HEETEEEEE;E܋ETEEEEHEETEEEEE;E |EEUEE 9} EEE 9~ E{EE 9} E^EE 9~ EAEE 9} E$EE 9~ EEEUE tDžpVUUUptыt)‰ЉEE tDžpVUUUptыt)ȋt)‰ЉEUEDP@EEEUЍEUEDPEEEċEăEȋUЉEЋEЃEEEĉE1EE~EUDBfyUEDEEE;E|NjEEEĉE1EE~EUDBfxUEDEEE;E|EUEDDEE;E|E}E)EEEUxD$T$ $"EUEDDDEE;E|EUEDEEHEE̋UDBRfx EE;E}MẺ‹EfTHM̋E‹EfTHREE;E|EEDEU‹EDPRE}xxEEE؃}~cU؋EDP,E܃}$EE܋UDBdf~ E} ~UE܉DM؋E܉‹EfTH,M܋E؉‹EfTHdE}TED$E$E}yLEUxD$T$ $ "EETEEE}~E }uEED$E$(EUSD["uG$~"""uDž"~ ""E"E}t Dž0 DžEԃ} txEEEaUE DP6Ѝ"i<u/MUE DP6Ѝ"i kE EƄkE}P~dEEEOEE;Et.MEEE(‰Ј kE EƄkE}P~}`}tLEE‹EEE}P~}t%}t ƅ1ƅEPEkEEE9E%EU‹EkEE }P~ՍE}~D$E$É}?EEE}~)ED$ẺD$E$É}?EEEEEDŽ E}~E\E)EEčD$D$EЉD$ ED$E؉D$Eĉ$EЁ}?HEE;E|EEċEEEĉEEЉE̍EE}?E}EEċEEȃ}EEEEkUEDPRE}yE‹EE=UEDP@ЉE‹EȍЋEDP,‹E‹EEEE}~E}wEQ}EfEft fDž fDžEfPE@ELMAUBEDP,‹ETMUEDP@‹ETMUEDPR‹ETE}~ED[ @(#)$Id: sudoku (AT&T Research) 2009-07-17 $ sudokusudztemplatesudokuexemplarmminimalMsymmetric minimal-nonefIfull dihedralrIIfull rotational (90 180 270 degrees)hvIIIhorizontal and verticaldaIVdiagonal and antidiagonalpVpi rotational (180 degrees)vVIverticalhhorizontaldVIIdiagonal (main)aantidiagonalexrateexrate([SAMPLE]): suexrate style rating that is the average number of nodes for a depth-first singles only backtrack solver over SAMPLE (default 100) pseudo random permutations of the current puzzle. Suexrate counts Knuth DLX nodes. sudoku(1) is not DLX based and requires on average 9X less nodes per solution; the sudoku(1) node counts are multiplied by 9 to approximate suexrat(1).determinedCompute the number of candidate cell values determined by eliminating candidates that cause any constraint to fail. '%(determined())g' lists the grid with determined cells included.implicitDetermine the cell values implied by the constraints in scope. '%(implicit())g' lists the grid of implicit cells.maxmax([index,]expression): return 1 if expression is greater than the maximum value [for index 1..9], 0 otherwise. For the final -Ff format max([index]) returns the max value.minmin([index,]expression): return 1 if expression is less than the minimum value [for index 1..9], 0 otherwise. For the final -Ff format min([index]) returns the min value.mutableDetermine the clues that have more than one value that results in one solution. The format '%(mutable())h' lists the mutable clue candidate values. The operands are: () Number of mutable clues. (max) Maximum number of mutable values for one clue. (maxuni) Maximum number of unique puzzles for one clue. (pos) Mutable clue positions. (sig) Number of mutable candidates by clue, high to low. (siguni) Number of unique puzzles by clue, high to low. (tot) Total number of mutable candidate values. (totuni) Number of unique puzzles induced by mutable clues.requiredDetermine the non-mutable clues and count the number of solutions when each clue is omitted. The format '%(required())h' lists number of solutions when each clue is omitted, 0 for non-clue cells. The operands are: () Number of required clues. (max) Maximum number of solutions. (maxpos) Cell position with the maximum solutions. (min) Minimum number of solutions. (minpos) Cell position with the minimum solutions. (sig) Number of solutions, high to low. (tot) Total number of solutions.superfluousDetermine the clues that result in one solution when omitted. The format '%(superfluous())g' lists the grid of superfluous clues. The operands are: () Number of superfluous clues. (pos) Superfluous clue positions.symmetrizeThe highest dihedral symmetry order for the current puzzle.uniquniq() returns 1 if the current puzzle is different up to isomorphism from the previously listed puzzles. uniq(format) returns 1 if the -f format result is different from previous format results. Too many different puzzles/formats may may exhaust memory.boxlineCandidates in box confined to one row/col.lineboxCandidates in row/col confined to one box.cluesThe number of clues.1: minimal (irreducable), 2: symmetric minimal, 0: otherwise.inheritedThe number of forced moves inherited by the last constraint.candidatesThe number of initial (pencilmark) candidates.begstepsBegin game singles steps.begsinglesBegin game singles placements.begbasicBegin game basic constraint placements.endstepsEnd game singles steps.endsinglesEnd game singles placements.endbasicEnd game basic constraint placements.guessesThe number of backtrack guesses.depthBacktrack depth, 0 for no backtracking.stepsThe number of constraint propagation iterations.groupThe number of steps for constraint group 1<=n<=8.backdoorThe backdoor (magic cell set) size.magicThe number of backdoors (magic cell sets).guesstimateThe estimated number of guesses before a backdoor hit.propositionsThe number of proposition net propositions.luckThe number of proposition net solutions.contradictionsThe number of proposition net contradictions.iterationsThe number of proposition net iterations.girthMinimum maximum proposition net iteration.degreeMinimum maximum proposition candidate degree.nested2 for nested propositions, 1 for single propositions.workThe average amount of successful proposition iterations.ratingThe rating from 1 (very easy) to 99999 (very difficult).symmetricThe dihedral symmetry order, 0 if not symmetric.symmetryEquivalent to symmetric.dihedralThe dihedral symmetry operation.valid0 for invalid, the constraint index or 1 otherwise.rcb.123456789ABCDEFGHIJKLMNOPQR.?O?X/grid { 0 setlinewidth 60 294 moveto 8 { 486 0 rlineto -486 54 rmoveto } repeat 114 240 moveto 8 { 0 486 rlineto 54 -486 rmoveto } repeat stroke 2 setlinewidth 60 402 moveto 2 { 486 0 rlineto -486 162 rmoveto } repeat 222 240 moveto 2 { 0 486 rlineto 162 -486 rmoveto } repeat stroke 4 setlinewidth 60 240 moveto 486 0 rlineto 0 486 rlineto -486 0 rlineto closepath stroke } def /clue { /v exch def /c exch def /r exch def c 54 mul 60 add 36 sub 10 r sub 54 mul 240 add 40 sub moveto (0123456789) v 1 getinterval show } def /hint { /v exch def /c exch def /r exch def c 54 mul 60 add 36 sub 10 r sub 54 mul 240 add 40 sub moveto v { gsave 0.6 setgray 0.35 0.35 scale 18 20 rmoveto dup dup [ 0 -40 0 40 -40 0 40 -40 0 40 ] exch get exch [ 0 40 40 40 0 0 0 -40 -40 -40 ] exch get rmoveto (0123456789) exch 1 getinterval show grestore } forall } def /candidate { /v exch def /c exch def /r exch def c 54 mul 60 add 36 sub 10 r sub 54 mul 240 add 40 sub moveto v { gsave 0.35 0.35 scale 28 32 rmoveto dup dup [ 0 -40 0 40 -40 0 40 -40 0 40 ] exch get exch [ 0 40 40 40 0 0 0 -40 -40 -40 ] exch get rmoveto currentpoint /ac exch def /ar exch def 20 0 rmoveto ar ac 20 0 360 arc stroke grestore } forall } def /node { gsave currentpoint 2 0 360 arc stroke grestore } def /line { /bc exch def /br exch def /ac exch def /ar exch def 4 setlinewidth ac 54 mul 60 add 26 sub 10 ar sub 54 mul 240 add 28 sub moveto node bc 54 mul 60 add 26 sub 10 br sub 54 mul 240 add 28 sub lineto node stroke } def /coincident { /bc exch def /br exch def /ac exch def /ar exch def 4 setlinewidth ac 54 mul 60 add 26 sub 10 ar sub 54 mul 240 add 28 sub moveto node currentpoint ac bc eq { /xr -28 def } { ac bc lt { /xr 0 def } { /xr -56 def } ifelse } ifelse ar br eq { /xc -28 def } { ar br lt { /xc 0 def } { /xc -56 def } ifelse } ifelse bc ac add 2 div 54 mul 60 add xc add 10 br ar add 2 div sub 54 mul 240 add xr add bc 54 mul 60 add 26 sub 10 br sub 54 mul 240 add 28 sub curveto node stroke } def /C 4 def /D 5 def /edge { dup /c exch def c C eq { pop } if /t exch def gsave t 3 eq { 0.9 0.0 0.0 setrgbcolor } { t 1 eq { 0.0 0.9 0.0 setrgbcolor } { t 2 eq { 0.0 0.0 0.9 setrgbcolor } { 0.9 0.9 0.0 setrgbcolor } ifelse } ifelse } ifelse c C eq { coincident } { line } ifelse grestore } def /mark { gsave /c exch def /r exch def c 54 mul 60 add 36 sub 10 r sub 54 mul 240 add 40 sub moveto -14 -10 rmoveto 2 setlinewidth 0 46 rlineto 46 0 rlineto 0 -46 rlineto closepath stroke grestore } def /clear { gsave /v exch def /c exch def /r exch def 0.3 0.1 0.9 setrgbcolor r c mark r c v candidate grestore } def /magic { gsave /v exch def /c exch def /r exch def 0.57 0.44 0.86 setrgbcolor r c v candidate grestore } def /pair { gsave 0 0.9 0.9 setrgbcolor mark grestore } def /solution { 342 -80 translate 0.37 0.37 scale grid } def /AvantGarde-Demi findfont 36 scalefont setfont newpath %% puzzle data /label { /v exch def /c exch def /r exch def v 10 lt { c 54 mul 60 add 36 sub 10 r sub 54 mul 240 add 40 sub moveto gsave 0.7 0.7 scale (0123456789) v 1 getinterval show grestore } { c 54 mul 60 add 43 sub 10 r sub 54 mul 240 add 36 sub moveto gsave 0.7 0.7 scale (00010203040506070809101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899) v 2 mul 2 getinterval show grestore } ifelse } def solution showpage sudoku solver/generator man document 
NAME
  sudoku - sudoku solver / generator
SYNOPSIS
  sudoku [ options ] [ puzzle ... | [ < ] puzzle.file ... ]
DESCRIPTION
  sudoku solves 9x9 sudoku puzzles defined by the literal puzzle operands
  (containing no lower case letters) and puzzle file operands, and prints the
  puzzle properties and solutions, one line per puzzle, on the standard
  output.  If there are no operands then puzzle descriptions are read from
  the standard input.  The file "-" names the standard input.  A solvable
  puzzle has exactly one solution.
OPTIONS
  -a   List all solutions.  Implies -ou.
  -A   Force constraints to assume that constraints earlier in the default
       order have already been applied.
  -b   Enable breadth first search which is typically slower than the default
       depth first first.  Breadth first search applies constraint propagation
       to the lookahead candidates (guesses).
  -B   Batch moves within one constraint group (or constraint if -G is on)
       by first identifying all moves and then committing them in one
       operation.  By default moves are made as they are identified.
       Batching negates ordering affects between permutations of equivalent
       puzzles but usually results in higher constraint counts.  If -v is
       also on then the move trace is prefixed by the constraint
       propagation iteration count.
  -cNC File puzzle input is in the Nth C separated column counting from 1.
       If C is ' ' or omitted then 1 or more space characters separate the
       fields. C may be followed by C separated field names.  The fields may
       be accessed by %(name)f, %(N)f, %(*)f (all fields, no separator), %#C(*)f
       (all fields, C separator), or $N, $name in expressions.
  -C[X]If X is p or omitted then list the minimum Hamming/edit distance of each
       each input puzzle to the next input puzzle, the input puzzle in %v form,
       and the "best" map of the input puzzle to the next, also in %v form.
       Each odd-even pair of input puzzles is compared.  If X contains S then
       list the maximum similarity instead of Hamming distance.  If X contains D
       then list the default Hamming distance.  If X contains f then compare
       the first puzzle to each subsequent puzzle.  If X contains l then compare
       compare the last (previous) puzzle to the current input puzzle.
       The first puzzle can be listed by specifying width 1 in the grid -f format,
       and the second puzzle by specifying width 2: e.g. %1v %2#.c
  -d   Enable depth first search which is typically faster than breadth
       first.  This is the default.
  -DN  Set debug output level to N, or increment if N omitted.
  -eE  Only list puzzles with constraint expression E that evaluates non-0.
  -E   List puzzles just after applying the last easy (non-guess) constraint.
  -fF  Format output according to F (default '%s') after
       each puzzle is processed.  If format is "-" then per-puzzle output
       is disabled.  printf(3) style width, precision and fill apply.
       [A][B]... before the format char treats value as an index: 0 for A, 1,
       for B, etc.  Information for invalid puzzles represents the solver
       state when the puzzle was determined to be invalid.  The formats are:
        %XC Solution in canonical order.  X=#a: number of non-trivial
            canonical solution automorphisms.
        %NF Flush the current output and: N=1: write to the standard output;
            N=2: write to the standard error.
        %G  The number of clues (givens).
        %XI Puzzle file magic string.  X=#c: schema names separated by c.
            X=#I: schema names with input file separator.
        %XM The number of backdoors (magic cell sets).
              #a: The number of cells that are part of a backdoor.
              #b: The backdoor size.
              #g: Estimated number of placement guesses before backdoor hit.
              #u: The number of cells that are not part of a backdoor.
        %XYZP Property list of Pi elements:
              #c: Pi is the number of cells with i candidates.
              #d: Pi is the number candidates with degree i, P1: total.
              #g: Pi is the number of clue values with i-1 occurrences.
              #o: Pi is the number of occurrences for clue value i.
              #q: Pi is the constraint applied at constraint iteration i.
              #r: Pi is the number of rookery templates for value i.
              #s: Pi is the number placements at constraint iteration i.
              #B: Pi is the number of clues for box i.
              #C: Pi is the number of clues for col i.
              #R: Pi is the number of clues for row i.
              #S: #s with constraint id.
              #v: Pi is the number of cells with candidate i.
            Y=#S for separator S, otherwise no separator.
            Z=#G for group separator G, otherwise Y separator.
            -#: sorted high to low, +#: sorted low to high.
        %%XQ Equivalent to '%s'.  If #X is specified:
              #m: The magic/backdoor constraints.
              #q: The quick constraints.
              #s: The solver (-q) constraints.
        %%S  Default stats: equivalent to '%s'.
        %FT The current date formatted by strftime(3) using format F,
            default ('%s').
        %XX Miscellaneous:
              #c: The number of solved cells.
              #e: Elapsed time test. Format width interpreted as nsec.
              #E: Simple Sudoku pencilmark exclusion list, one per line.
              #f: The number of forced cells (naked singles).
              #F: The full dihedral symmetry pattern id n-n-n-n-n.
              #r: The current pseudo random number generator seed.
              #R: The initial pseudo random number generator seed.
              #t: The tuples of degree i, one per line.
              #u: The solution unavoidables of size 4.
              #v: The number of clue values (1-9).
        %AXYc Puzzle in canonical order with solution cells listed as 0.
            Leading 12345678945 omitted from row-order min-lex band values.
              #A: Solution cells listed as [A-IJ-R].
              #b: Band of 416 min-lex index 6-tuple, each 3-tuple sorted.
              #B: #b not sorted.
              #c: Grid symmetrized to minimize distance, dihedral order, and
                  pattern lexicographic order, ignoring the center box.
              #C: #c dihedral symmetry type and distance from symmetry.
                  X may be:
                  #s: Symmetry op.
                  #S: Symmetry description.
                  #t: Symmetry type.
              #d: Grid symmetrized to minimize distance, dihedral order, and
                  pattern lexicographic order.
              #D: #d dihedral symmetry type and distance from symmetry.
                  X is the same as for #C above.
              #e: sudz compressed minlex band/grid encoding.
              #g: Gang of 44 min-lex index 6-tuple, each 3-tuple sorted. The
                  gang index is the largest 416 index the gang may produce.
              #G: #g not sorted.
             N#i: Band of 416 index N row order min-lex value.
              #m: Puzzle in subgrid row order minlex canonical order with
                  solution cells listed as 0.  The default canonical form is
                  based on the solution grid; subgrid canonical does not
                  require the grid to have a solution.
              #o: The original grid dihedral symmetry id and distance from
                  symmetry, minimizing distance and dihedral order.
              #O: The original grid dihedral symmetry type and distance from
              #p: Permutations mapping original to canonical.
                  i:identity, v:value, r:row, c:column,
                  a:#automorphisms.
              #P: Row order pattern minlex canonical.
              #s: Grid symmetrized to largest dihedral order, "assymmetric"
                  if no symmetry (not a fast implementation). Y=#p: if symmetric
                  then list the cyclic permutation that symmetrizes the input.
              #t: Exemplar template with %s cells in subgrid row order minlex
                  canonical order. Y=#a: the number of canonical form
                  automorphisms.  Y=#p: list the cyclic permutations that
                  transform the exemplar to canonical order. A=(abc): exemplar
                  cell values weighted a=1 b=2 c=3. A=((ab)c(de)): exemplar cell
                  values weighted a=b=1 c=2 d=e=3.  Weights are in the range
                  1..9.
              #T: Exemplar template restricted to %s cells in subgrid row order
                  minlex canonical order. A: same as for #t, except listed cells
                  are restricted to the cells specified by A.
              #x: Clues treated as exemplar X in subgrid row order minlex canonical
                  order. Y=#a: the number of canonical form automorphisms.  Y=#p: list
                  the cyclic permutations that transform the puzzle to canonical
                  order.
              #X: Like #x, but list original puzzle in row order minlex canonical order.
              #z: Like #t, but symmetrize instead of canonicalize.
              #Z: Like #T, but symmetrize instead of canonicalize.
              #c: Solution cells listed as 'c'.
        %%d  The default format '%s'.
        %Xf Input file base name. X=#p: input file path name, X=(N): -c field N,
            X=(@)#C: all fields separated by C, X=(@): all fields, no separator.
        %XYg 9x9 text puzzle grid with no frame (default or X=#n), X=#f:
            framed player's, X=#g: gordon, X=#m: metcalf, X=#p: programmer's,
            forum, X=#s: simple, X=#v solver. #isupper: solution. Y=#t: template
            if current input is template or exemplar, Y=#i: inverse exemplar.
            Y=(:label): label appended to last grid line.
        %XYh 9x9 text puzzle grid with hints (pencilmarks) and no borders,
            X=#b: {hint}, X=#f: framed player's forum, X=#p: programmer's
            forum, X=#s: simple, X=#v solver. Y=#0: only list strong edges,
            Y=#N: only list exact N-tuples. %N..: only list candidate(s) N.
            X=#e: experimental encoding.
        %Xi Current identification, or %f if none.
              #C: The -C id: similarity for -CS, distance otherwise.
        %XYm The position list of all backdoors (magic cells) (X=#a default),
            X=#A lists #a with values, X=#u lists all non-backdoor solution
            cells, X=#U lists #u with values. Y=#c for 'c ' on split lines.
        %Xn Various counts and ordinals:
              #a: The ordinal within all listed puzzles (-f- still counts).
              #A: The number of automorphisms of the input sudz grid.
              #B: The band index of the input sudz grid.
              #c: The -g puzzle index.
              #C: The -go puzzle partition index or -C distance/similarity.
              #d: The -g number of unique puzzles.
              #e: The -g puzzle duplication count.
              #i: The ordinal within the all input files.
              #I: The window index of the input sudz grid.
              #l: Input file line number of the first puzzle row.
              #m: The ordinal within the current -a (multiple solution count).
              #n: The number of backtrack search nodes.
              #o: The ordinal within the current %i.
              #p: The ordinal within the current input file.
              #r: The ordinal within the current -m or -go.
              #R: The current -m or -go base puzzle ordinal.
              #s: The number of searched (for solution) puzzles.
              #u: The number of uniqued puzzles (splay tree lookups/insertions).
              #v: (default) The valid puzzle count.
              #W: The number of grids in the input sudz window.
        %Xq The constraints used to solve the puzzle.  X may be:
              #c: Constraint counts (see EXPRESSIONS below).
              #d: The diamond move (hardest up to first elimination).
              #D: The diamond move index (constraint ordinal).
              #h: The hardest move.
              #H: The hardest move index (constraint ordinal).
              #i: The -q index:method map.
              #I: The highest -q method index.
              #m: m: minimal, M: symmetric minimal, -: otherwise.
              #M: #m description.
              #o: The constraints and orders used to solve the puzzle.
              #p: The pearl move (hardest up to first placement).
              #P: The pearl move index (constraint ordinal).
              #s: Symmetry op (see -s below).
              #S: Symmetry description.
              #t: Symmetry type (see -s below).
            Trailing 0 values are dropped and only applied constraints are
            listed. The list order is %s.
        %Xr The puzzle rating from 1 (very easy) to 99999 (very difficult).
            Use -B or -S to normalize algorithm order bias. X=(E) uses the
            rating expression E instead of the -R option value. The
            90000-99999 range is exponential. X=#r for raw (no exponential
            normalization), X=#s for symbolic rating, X=#. for 99999 scaled
            9.9, X=#n for normalized puzzle rating from 1 (very easy) to 9
            (very difficult). The usual C integer arithmetic operators, ?:,
            x**y (x to the y power) and x@y (x log y) are supported.
        %Xs Puzzle in original order with solution cells listed as [1-9].
            X=#A: solution cells listed as [A-IJ-R].
        %Xt Various times.  X may be:
              #e: Total elapsed time since program start.
              #p: Elapsed time since the last %#pt.
              #s: (default) Current puzzle solution time.
              #t: Sum of all puzzle solution times.
        %XYv Puzzle in original order with solution cells listed as '.'.
            X and/or Y may be:
              #i: inverse exemplar if current input is exemplar
              #t: template if current input is template/exemplar
              #N: (N non-alpha) solution cell listed as N
        %Xx X=(E): the value of the expression (E).
        %a  Deprecated: use %#an.
        %e  Deprecated: use %#at.
        %j  Deprecated: use %#pn.
        %k  Deprecated: use %#in.
        %l  Deprecated: use %#ln.
        %o  Deprecated: use %#on.
        %p  Deprecated: use %#pt.
        %t  Deprecated: use %#st.
        %u  Deprecated: use %#tt.
        %y  Deprecated: use %#mn.
        %z  Deprecated: use %#rn.
        %@  Align to  characters past the previous %@, e.g., %-10@.
        %N/ Multi-column output with column width N. Format output after the /
            will be in the next column(s).
        %?V%?I If the puzzle is valid then output format V, otherwise format I.
            Empty V or I, whichever is selected, means no output.
        %,  Space.
        %:  Newline.
        %%  Percent.
        \c  C style escape.
        c   Literal character.
  -FCF Set output format default C to F.  The default is empty if not specified.
       C may be:
        a  Output after each puzzle is processed.  This format is used after
           all -a solutions are determined for each puzzle.
        b  Output before each puzzle is processed.
        c  -goc format (default '%s').
        d  The %%d format (default '%s').
        e  Value equality operator (default '%s').
        f  Output after all puzzles have been processed.  Puzzle property
           counters are accumulated from all puzzles.
        g  Value proposition (guess) operator (default '%s').
        h  The initial -gt grid before minimization/filtering.
        i  Output before the first puzzle is processed.
        m  The %%S stats format (default '%s').
        n  Value inequality operator (default '%s').
        o  The -go omitted (and possibly invalid) grid format.
        p  Cell position (coordinate) format (default '%s').
           F is a printf-style format string with the following format
           characters replacing the 'd' format:
             r  row offset counting from 1
             R  row offset counting from 0
             c  column offset counting from 1
             C  column offset counting from 0
             x  column offset counting from 1
             X  column offset counting from 0
             y  (10-row) offset counting from 1
             Y  (9-row) offset counting from 0
           %Ar%ac lists the rows as ABCDEFGHI and columns as abcdefghi.
           %Jr%c lists the rows as ABCDEFGHJ and columns as 123456789.
           %kc%r lists the rows as 123456789 and columns as abcdefghk.
        q  The %%Q format (default '%s').
        r  Output as each -g solution grid is generated.
        s  Output after each puzzle is solved. Equivalent to -fF.  Also used
           for each -a solution (default '%s').
        t  The default %%T time format (default '%s').
        v  The < position operator value > format (default '%s'),
           where %p is the -Fp position, %o is the -F[egn] operator, and
           %v is the value.
        w  Default exemplar canonicalization weights (see %%#tc, default '%s').
        x  -p permutation output (default '%s').
        y  The exemplar characters in order (default '%s').
           Up to nine characters may be specified.  The first seven have
           specific meaning for the Z method.
        C  The default -C output format (default '%s').
  -gTNA Generate puzzles of type T with optional parameters N and A.
       T may be:
         b  Canonical solution grids for each band N class member.
            If -m is also specified then only the min and max grids
            for selected bands are listed. %i:band-index, %#pn:#grids,
            %#in:#checked, %n:total#grids, %#on:total#checked,
            %#ln:#3-band-prunes, %#mn:2-band-prunes. N,M lists
            bands in the range N through M inclusive.
         B  Canonical band index table with leading 12345678945 omitted.
         d  -gdC.V generates pseudo puzzles (possibly more than one solution)
            with C clues (default 14) using V different values (default 3).
         g  Solution grids listed one per line (no other processing).
         h  Hint-only (pencilmark-only) puzzles with at least N (default
            %d) candidates. Even N => candidates evenly distributed.
         H  Generate using the hardest sudoku formula: at most one clue
            per minirow/minicol and no repeated values in bands/chutes,
            at most three clues per value, and minimal. N is the clue
            fill step (default %d) -- factors of 3 are removed.
         m  For each puzzle list the subgrid row order minlex canonical
            grid (the default canonical form is based on the solution grid,
            subgrid canonical does not require the grid to have a solution).
         o  +/-NX...: a sequence of -N and/or +N operands with option suffixes.
            -N: delete all combinations of N clues; +N: add all combinations
            of N clues.  Puzzles are checked for single solution after each
            addition phase. X may be one or more of the following options.
            Each occurrence toggles the previous value.  Values are inherited
            by subsequent operands in the sequence. X may be one or more of:
              a  assume the last +M clues have already been cleared for @
              c  use the -Fc format with no filtering, otherwise use the
                 default -f format, -q constraints, and -e filtering
              e  do not check off subpuzzles for duplicates
              i  add implicit (superfluous) candidates, otherwise skip them
              n  show off/on ops but do not execute
              o  list one generated puzzle per input puzzle
              p  the input puzzle is a pattern -- only change original clues
              r  -nX random {-N+M} operations per input puzzle
              @I start at clue index I counting from 1, clearing clues from
                 from that index on
              @  clear the last +M clues and start at the leftmost empty cell
                 from the cleared clues
            {...}xN repeats the bracketed group N times.  {...}:N repeats the
            bracketed group 0 or more times until the number of clues is <= N.
            Some sequences may exhaust memory.  {N}* (alternatively {N}!)
            repeats {-N+N} until closure (no new puzzles generated). NOTE: a
            recalcitrant bug sometimes omits a small number of puzzles in
            combined off/on sequences that would otherwise be listed if the
            sequence were done separately; if exact results are required (no
            omissions) then use separate sequences.
         p  (default) Puzzle grids.
         q  Run the quick verification solver on all input puzzles. The output
            one line containing: <#invalid> <#multi-solution> <#valid>.
         s  Solution grids only.
         t  Treat each input file as a template and generate -nN puzzles per
            template, filling only the template clues.  N (default %u)
            limits the number of shuffles for each solution grid projected on
            the template.  Template input may be a valid puzzle (but with
            multiple solutions ok) or a grid with [XxOo] marking the template
            clues.  Some templates may not admit valid puzzles.  There is no
            known predictor (other than maybe 17 clues).  If there are no O
            cells then -v lists improvements towards 1 solution in 4 columns:
            column 1 is the random solution grid count, column 2 is the solution
            grid shuffle count, column 3 is the number of soultions for the grid
            in column 4.  At 2 solutions column 3 also contains the number of
            unavoidable cells.  If any template cell value is O and -m is
            specified then only O template cells will be considered for
            minimization.  If O and clue values or candidate lists are
            specified then the clue values and/or candidates are fixed in
            generated solution grids, otherwise template clues are treated
            as X.  If there are no more than .A (default %d) candidate
            then an enumerative (as opposed to random) search is used. The
            enumerative search tests all candidate combinations.  -gtpN.R.F.S
            marks F%% (default %d%%) clues X cells at random, +/- S%% (default
            %d%%) and generates N random puzzles projected on the random
            template.  R (default 0 -- no limit) limits the number of X
            assignment rounds.  -gtpr ignores the enumerative checks and
            forces random search.  -gtpri continues the search on the modified
            candidate grid.  -gtm allows multiple solutions -- handy for
            generating subgrids.  -gtm.0 generates all subgrids.  -gtpe
            checks every pattern row-order minlex grid (not quite canonical
            so there may be some duplication); -gtpei.N retains the first
            N input grid clues; -gtpe.N.V sets clue N to V.
         x  Minimal superfluous (any clue unnecessary) puzzles.
         P  Input puzzle are treated as pattern exemplars with clue cells mapped
            to X and are listed.
         X  Input puzzles are treated as exemplars and are listed.
  -G   Ignore constraint order {...} groups and treat each constraint
       as if it were in its own group.  Group minima/maxima and iterations
       are not affected.
  -h   Add hints (pencilmarks) to the -P output.
  -H   Copy the first input file magic header, if any, to the output.
  -i   Force the constraint propagation iteration count to increment
       with each constraint that produces a move rather than with each
       constraint group.  This allows the capture of in-group pencilmarks.
  -jN  For each -g type that operates on complete solution grids, operate
       on the original and N (default %u) randomly shuffled automorphic
       copies. N=0 repeatedly uses the first grid without shuffling.
  -JN  Solve the original puzzle and, for N (default %u) repetitions,
       randomly shuffle (rows, columns, bands, stacks, values) to an
       automorphic copy and re-solve.  Handy for verifying order
       independent metrics.
  -kCR Constraint propagation iteration and/or cycle trace control.  R is a
       range of counts/lables on which the control is applied.  C may be:
         c  Add XY cycles in range R to -P output with strong edges (red),
            1-weak edges (green), 0-weak edges (purple), and eliminated cell
            values (blue).
         d  Add -P 0-weak details (yellow).
         i  List intermediate puzzles with propagation iteration in range R.
            If -v is also on then the move trace is prefixed by the constraint
            propagation iteration count.
         m  Add -P backdoor (magic cell) values (purple).
         p  Add -P cycle pairs (cyan).
  -KCL Constraint propagation iteration and/or cycle control.  L is a list
       of counts/labels on which the control is applied.  C may be:
         c  Disable XYW cycles list L.
         i  Disable constraint iterations in list L.
  -lX  Label -P output with text X.
  -LN  Limit P constraint propositions to candidates with degree (number of
       value/location choices) <= N.  The default is 0 for no limit.
  -mCN.M.X For each puzzle, derive, by dropping clues, up to N puzzles with
       the minimum number of clues.  If N is omitted then all minimal puzzles
       are derived.  If -s is also specified then symmetry will be preserved
       and symmetric minimal will be considered minimal.  If M is specified
       only minimal puzzles with >= M clues are derived.  If X is specified
       only minimal puzzles with <= X clues are derived.  If C is r then a
       typically much quicker random search (inspired by dukosu) is used to
       test N (default %d) random minimal puzzle candidates.  If C is rc
       then the -Fc format is used to list the minimal puzzles; this can be
       a factor of 2 faster than the default that generates puzzle stats.
  -MC  Restrict backdoor computations to the -q style constraints C (default
       %s).  Use this to avoid bad timing behavior with some constraints.
       If C is - then backdoor computations are disabled.
  -nN  Limit -g to N puzzles (default 0 -- no limit).
  -NN  Set the next -f %a and %n to N.
  -oF  Write output to file F.
  -OX  Attempt to find an optimal (shortest) solution within each constraint
       application. This will induce sub-optimal performance but may produce
       more reasonable ratings when XY constraints are involved. Currently
       limited to the XYP constraints. -O minimizes cycle size, -OA attempts to
       minimize steps.
  -pP  If P is p or omitted then list the value (v), row (r) and column (c)
       permutations that transform each input puzzle to the next input puzzle.
       Each odd-even pair of input puzzles must be valid and have isomorphic
       solutions.  Permutations are displayed in cyclic notation, where each
       (...) defines a label map, read from left to right.  (137)(25) means:
       1=>3, 3=>7, 7=>1, 2=>5, 5=>2; unspecified labels map to themselves.
       'v', 'r' and 'c' appear to the left of the value, row, and column label
       maps, respectively.  'x' denotes row-col transposition, identity v,r,c
       components are omitted and 'i' denotes the identity, and 'aN' denotes
       the number of automorphisms.  If P is f then list permutations that
       transform the first puzzle to each subsequent puzzle.  If P is l then
       list permutations that transform the last (previous) puzzle to the
       current input puzzle.  Otherwise P specifies a cyclic permutation applied
       to each input puzzle as it is read in.
  -P   Solve the puzzle and generate postscript output. To generate images
       for posting: 'convert -crop 490x490+30+20 -scale 60% t.ps t.png'.
  -qC  Change the current constraints using C (default %s).  If C
       does not start with - or + then the current constraints are cleared.
       If C is - then the input puzzles are not solved but are still listed.
       Initial constraints and those following + are enabled or size specific
       if a size is specified.  Constraints following - are disabled.
       Constraints are applied left to right as specified. {...} groups
       constraints to be treated as a single constraint.  : within a group
       commits the moves up to that point but continues with the
       remainder of the group.  : outside of {...} disables G and causes
       the constraints to the left to be ignored when they fail to advance
       the solution.  Multiple ;VARi=EXPRi may be appended; after the each -qC
       is applied the VARi are evaluated and assigned.  This also enables
       multiple -qC options, each with its own VAR assignments.  After all -qC
       are applied for the current puzzle the -e expression and -f format are
       are applied, where the VARi may be referenced in the expression / format.
       C may also be a lower case or numeric identifier that names a common set
       of options:
       %10s  %s
                   %s
       Common option constraints may be modfied by appending +constraints
       or -constraints to the common constraint name.
  -QE  Valid puzzles must additionally satisfy the constraint expression E.
       E is an expression of ( ! && || == != ?: ) operators and -qC style
       constraint operands.  For example, -Q'!{FN}&&{N}' specifies FN-invalid
       and N-valid.
  -rN  Set the pseudo random number generator seed to N (default time based).
       The %#rX value can be used to span most pseudo-random operations across
       multiple sudoku(1) invocations. Does not work for -gt.
  -RX  Set the %r rating expression to X. The default is
         P?(G?[r]98000+G:(10000+(P5>=1000?(P5/100)*100:P5))*10+
           (B0?10000000+B0*100:0)+
           ((T0||H0)?50000000+((T2+H2)+(T3+H3)*8+(T4+H4)*32)*32:0)):
           F+N*2+B*4+(T2+T3*4+T4*16)*8+(H2+H3*8+H4*32)*64+
	   (W*2+W2+W3*4+W4*16)*256+(X*2+X3+(X4+X5*2+X6*4+X7*8)*4)*128+
	   (Y*2+Y3+(Y4+Y5*2+Y6*4+Y7*8)*16)*128+
	   (K*2+K3+(K4+K5*2+K6*4+K7*8)*16)*512+
	   (Z*2+Z2+Z3*4+Z4*8+Z5*12+Z6*14+Z7*15+Z8*16)*512+
	   O*128*256+(G?(G*(15**M-M1+64)+89985):0)
  -sOS Generate puzzles with dihedral symmetry S (requires -g).  The symmetry,
       names, type, (order), and descriptions are:
         %2s %3s (%d) %s
       -sA (or -sg) cycles through all symmetries for each -g solution grid.
       -sE selects a pseudo-random symmetry before for each -g solution grid.
       -sF selects a pseudo-random symmetry before the first -g solution grid.
       -s[248][AEF] limits the symmetries to the specified consecutive orders.
  -S   Restart constraint propagation after the first move in each group.
  -tN  Limit solution count to N.
  -TM  Enable test code defined by the mask M:
        0x00010 List constraint orders.
        0x00020 List P constraint stats.
        0x00040 Don't cache P constraint propositions.
        0x00080 Don't prune P constraint pairs.
        0x00100 List sizeof(Grid_t) and exit.
        0x00200 Disable directional y-edges.
        0x00400 Enable directional y-edge ternary collapse.
        0x00800 Disable x box hinges.
        0x01000 Enable -v for backdoor (magic cell) search moves.
        0x02000 Enable -v for -m search moves.
        0x04000 List a -P empty grid and exit.
        0x08000 List postscript output labels.
        0x10000 Enable backdoor trace.
        0x20000 Enable mutable() canonical puzzle trace.
        0x40000 Disable the (not always) quick sub-solver.
  -u   Verify that there is exactly one puzzle solution.  By default
       searching stops at the first solution.
  -U   If -a is also set then the listed puzzle is the union of all
       solutions.  -f%h lists the unavoidables as pencilmark hints.
  -vN  Set verbose output level to N, or increment if N omitted.
  -V   Print the program version on the standard error and exit.
  -wN  Fold verbose output to be at most N characters wide (default 80).
  -W   Pause before exiting.  Handy for viewing windows shortcut output.
  -xS  Puzzle data is XML tagged by S (default question).
  -X   Limit proposition constraint moves to eliminations (ignore backdoors).
  -y   Use the original -Y grids instead of implied solution grids.
  -YF  Generate puzzles from the solution grids for puzzles in file F rather
       than random solution grids.
  -ZE  Puzzles not solved by the -q constraints are rechecked with the -Q
       style constraint expression E.  V(n) in each subexpression of a || list
       can be used to label the first subexpression from the left that solves
       the puzzle.  The -q constraint label is 1.  V(X), X not a number, within
       a constraint subexpression requires the constraint subexpression to
       solve the puzzle and the -e style expression X to evaluate non-zero,
       otherwise the remaining subexpressions are tried.
  -zX  Miscellaneous options (only -I is free!).  X may be:
        8  Octdoku: all clues with value 9 present and not subject to minimization.
        b  Set the process priority to "nice" ("background").
        eN Exit with a diagnostic when any dictionary entry count exceeds N.
DETAILS
  There are two basic solution techniques: constraint propagation ("logic")
  and searching.  Constraints limit candidate values for each cell.  Constraint
  propagation iteratively applies constraints until the puzzle is solved or
  until no more progress is made.  A constrained puzzle is solvable by
  constraint propagation alone (pure logic / no guessing).  Searching applies
  candidate cell values (guesses) and checks solutions using depth first or
  breadth first search.  The best search strategies combine constraint
  propagation with searching to prune the search tree.  The amount of guessing
  is determined by the strength of the constraints and the order of guesses
  already applied.  Some aficionados frown on solutions that require guessing,
  but the lines between constraint propagation, lookahead, and guessing are
  thin.  This topic is very subjective, your mileage will vary, and you will
  not win a "logic" vs. "trial and error" debate.  I still can't figure out
  out how my daughter solves so fast.
  This solver uses a depth first search by default.  Candidate cells with the
  least amount of choices are checked first.  The constraints are:
n     %c%s %s
          %sDisables the s constraint%s.
%d       %sThe default is %c%s.
  The -q option enables, disables, groups and orders constraints (%s must
  be explicitly disabled).  The enabled constraints are called the constraint
  set (default %s).  The THW constraints are further split
  by size: T2H2W2T3H3W3T4H4W4.
  Constraint propagation is an iterative process controlled by the -B,
  -G and -S options.  By default {...} constraint groups are applied as a
  unit; when -G is on {...} are ignored and each constraint is applied
  separately.  Constraints not enclosed in {...} are considered to be a
  group of size 1.  Each iteration applies the constraints in order from
  left to right as specified by -q.  The application of each constraint is
  done in an unspecified but exhaustive order over the entire puzzle.  A
  constraint advances the solution when it identifies a move (one or more
  cell placements or candidate eliminations).  An identified move may be
  committed (by actually making the placement(s) or elimination(s)), or it
  may be recorded for later committal.  Within a single constraint
  application, cells that do not advance the solution are not re-examined,
  even if subsequent moves within the same constraint application would
  allow them to do so.  This biases solutions to use constraints earlier
  in the order.  A new iteration starts with the leftmost constraint.
  When a constraint identifies a move:
    -S  The move is committed and a new iteration is started.
    -B  The move and all other moves in the current group are identified
        and recorded.  After all moves in the group have been recorded
        they are committed as a unit, and a new iteration is started.
        : within {...} commits any moves up to that point but continues
        with the remainder of the group.
    --  (default) The move is committed and all other moves in the current
        group are committed as they are identified.  After all moves in
        the group have been committed a new iteration is started.
  A step is a constraint propagation iteration that advances the
  solution.  The number of steps for -S and default solutions depends on
  the unspecified ordering within each constraint application; this ordering
  bias also allows the step counts to be different for isomorphic permutations
  of a given puzzle.  -B step counts, by design, are the same for a given
  ordered constraint set over all isomorphic puzzles, so they are a suitable
  puzzle metric.
  [...] options may appear at the start of each constraint group.  Options
  override the -A, -B, -O and -S command line options.  The options are:
    A   Enable -A for the group -- -A is diabled if A omitted.
    B   Enable -B for the group -- -B is diabled if B omitted.
    O   Enable -O for the group -- -O is diabled if O omitted.
    S   Enable -S for the group -- -S is diabled if S omitted.
    *   The group may supply any number of moves each application (default).
    ?   The group must supply zero or one move each application.
    +   The group must supply one or more moves each application.
    n   The group must supply exactly n moves each application.
    n:m The group must supply between n and m moves inclusive each
        application.  If m is * the at least n moves must be supplied.
  If F is disabled then the solution may advance to a position where only F
  constraints remain; these are attributed to most recent constraint applied. -d
  (default) depth first search with guesses biased to cells with the least number
  of candidates after constraint propagation.  X and Y are compute intensive
  but produce aesthetic solutions.  -qFNB typically solves the fastest (with
  backtracking).  If G is enabled then it is not applied until all other
  other constraints fail.
  Cycles are composed of edges between cells with the same candidate value
  within a single row/col/box or segments between exact pairs with the
  candidate value in both endpoints.  The vertices of a strong edge are the
  only cells with the candidate value within the row/col/box containing the
  edge.
  The generator generates random solution grids, and then places clues at random
  from the solution grid into an empty puzzle grid, honoring -sS if specified,
  and with -m generates the derived minimal puzzles for each random puzzle.
  A minimal puzzle has a minimal number of clues, i.e., removing any clue
  produces a puzzle with multiple solutions.  There is no duplicate checking;
  process generator output using -f%c as a duplicate/sort key.
  A backdoor or magic cell set is the smallest set of moves that lead to a
  constrained solution.  A puzzle with backdoor size N (magic cell set size N)
  for constraint set C is C-N-constrained.  The conjecture that all puzzles
  are FN-0, FN-1 or FN-2-constrained is false: a puzzle discovered by JPF has
  566 FN backdoors of size 3 (3 FNBT2 backdoors of size 2). A %#nr rating in
  [A-F] indicates a backdoor size of 3, 4 etc. Using -q may result in different
  backdoors than the default.  For this reason always qualify "backdoor"
  with the constraints used.
EXPRESSIONS
  Expressions are C language style signed long expressions on constraint
  counters.  A constraint counter is named by the constraint identifier
  and one optional digit.  The counters for constraint c:
    c   The number of constraint applications.
    c0  Equivalent to c.
    c1  The number of constraint placements.  Grouped modifications to a cell
        candidate list count as one placement.
    cn  Structure order 2<=n<=%d count (e.g., pair, triple, x-wing,
        swordfish).  c5..c%d are 0 for most constraints.
  with the following (long name) exceptions and pseudo constraints:
    %c%c  (%s) %s
    X2  Maximum X cycle size.
    Xn  X cycle sizes by range. X3:<%d, X3:<%d, X5:<%d, ... X%d:>=%d.
    Y2  Maximum Y cycle size.
    Yn  Y cycle sizes by range. Y3:<%d, Y3:<%d, Y5:<%d, ... Y%d:>=%d.
    bn  The number of batches for hn.
    hn  The ordinal of the rightmost constraint applied in group n.
    in  The number of instances for hn.
  and the following functions:
    %-12s %s
  (%F) converts the output of the %F format string to a number and $V converts the
  value of the environment variable to a number.
INPUT FORMAT
  Puzzle input is a sequence of numbers and spaces that fill the grid
  from left to right, top to bottom.  Space, comma, |, and - if + or | appear,
  are ignored, and all other non-digit (1 through 9) characters correspond
  to an empty grid space.  Most pencilmark grid forms are accepted.  Multiple
  descriptions  may be placed in one file.  A description ends after 81 cells
  have been specified.  If the first character in a line is a non-digit the
  line is ignored.  A description command line argument (file or actual
  data) may be immediately followed by one or more command line argument
  operations of the form [r,c]... that modify candidate values, where
   is a single digit cell value or a {...} list of candidate values, and
   is = to set V, ^ to clear V.  '#' starts a comment until end of line.
  "IDENT" sets a puzzle identification string for %i.  If there is no "IDENT"
  then the last comment for the current puzzle is used for %i.  A comment on the
  same line following the last puzzle cell is associated with that puzzle.
  Subsequent comments are associated with subsequent puzzles.  For example, one
  generated by -g -m -sp -q-YG -r12 -n1 -e 'V&&X' -f'"gmr11n1spq-YG"\n%#gg':
      "gmr11n1spq-YG"
      . 6 .  8 1 .  7 2 .
      8 2 4  . . 6  . . .
      . . .  . . 5  3 . .
      . 1 .  . . .  8 . .
      . 8 .  . . .  . 1 .
      . . 9  . . .  . 4 .
      . . 2  1 . .  . . .
      . . .  6 . .  2 3 5
      . 9 8  . 4 2  . 6 .
  The first input line in each file may be #!sudoku followed by options that
  override command line -c, -l and -x options for the duration of the file.
  The previous options are restored after the file is read.  For example:
    #!sudoku -c5,sym,num,clues,min,puz,author,seq
  The input line #!exemplar identifies the remaining input puzzles as fish
  pattern exemplars.  Exemplars may be listed with the %g format and subgrid
  canonicalized with the %#tv, %#tc and %#Tc formats.  The exemplar cell
  values are:
    %c  empty cell: a cell that may not have a candidate
    %c  base candidate: which may be missing
    %c  (exo-)fin cell: a base candidate not covered by any cover sector
    %c  endo-fin cell: a candidate in the intersection of two base sectors
    %c  potential exclusion if all fin cells are false
    %c  potential exclusion whether or not a fin cell is true
    %c  potential exclusion of base candidate covered by two cover sectors
  The octal 3 band bitmask form {O,O,O} (listed by -v2) is also recognized.
  #!template may be used to mark -gt template data when -gt is not specified.
OUTPUT FORMAT
  A solution is an 81 character string of [1-9A-IJ-R], [1-9] for clue cell
  values, [A-I] for solution cell values, A for 1, B for 2, and so on, and
  [J-R] for the backdoors, J for 1, K for 2, and so on.  The solution fills
  the grid from left to right, top to bottom.  The default output format
  for each input puzzle is '%s' (see -f above).  The
  output for the example above is the single line (folded for display):
      .6.81.72.824..6........53...1....8...8.....1...
      9....4...21........6..235.98.42.6. #   277 FNTX C28.M/S2.p
  The canonical solution is a puzzle solution transformed to have the
  smallest row order lexicographic value.  The canonical solution
  induces an equivalence relation on the set of all solutions.  The
  canonical puzzle retains the labeling of the canonical solution and
  induces an equivalence relation on the puzzle within the solution.
  If a canonical solution has non-trivial automorphisms then the
  canonical puzzle uses the canonical solution automorphism with the
  smallest row order lexicographic value (with empty cells treated as
  0).  There may be other canonical forms.  This one has an efficient
  algorithm that takes advantage of the group symmetries of sudoku
  solution grids.
COMPRESSED GRID FORMAT
  The sudz format efficiently compresses catalogs of row order minlex
  canonical solution grids.  Grids are organized by the top band (top 3
  rows).  There are 416 essentially different minlex bands and 5472730538
  essentially different grids.  A byproduct of minlex ordering is that
  earlier bands tend to account for more grids than later bands.  For
  example, band 001 contains 1007170 grids, band 006 (the largest)
  contains 96229042 grids, and bands 395,397,398,400,402,403,404,406,
  408,409,410,412,413,414,415 contain no grids.
  The sudz format is a sequence of windows.  Each window contains the number
  of grids and initial band index.  Each grid has the band index (if
  different from the previous grid), the number of automorphisms (if > 1),
  the number of cells that differ from the previous grid, and the list of
  differing cell values encoded using a basic singles constraint solver.
  The windows are compressed using the Burrows-Wheeler bzip library.
  The entire catalog of 5472730538 essentially different grids, in minlex
  order, compresses to 5.70GiB, an average 8.96 bits/grid.  Uncompress rate
  is ~100K grids/sec/Ghz, or ~5 hours minimum to stream through the entire
  catalog on a 2.8Ghz processor.
PERFORMANCE
  The solution rate for the best on average options -qFN on a collection
  of posted and generated puzzles is ~1000 puzzles/second/Ghz, the -gg full
  grid (81 clues) generation rate is ~5000 puzzles/second/Ghz, and the
  -g -m1 -qFN generation rate is ~75 puzzles/second/Ghz.  sudocoup(1),
  coded for speed, solves ~7000 puzzles/second/Ghz.  sudocoo(1), coded for
  simplicity, is in between and is more sensitive to input grid variations.
EXAMPLES
  Note: % must be entered as %% in windows .bat files and shortcut commands.
  Generate 100 minimal symmetric puzzles limited to pairs and x-wings in g.dat:
    sudoku -g -sg -m -q+T2H2W2-XYG -e "valid&&minimal==1" -n100 -f%v -o g.dat
  Reformat and collate for player's forum inferior low/high steppers:
    sudoku -f"%#tq,%(steps)x,%(clues)x,%(minimal)[-][M][SM]x,%#0v,gsf,%n" \
           -q{FN}-G -B *.dat | sort -t, -k1,1 -k2,3n -k4,4r
  Generate and search for player's forum ulterior low/high steppers:
           -e"V&&(I<4||I>20)" -g -q{B2:N}-G -Q!{FN} -AB -m -sg
  Count isomorphic puzzles and list each non-trivial representative:
    sudoku -f"%C %c %4n %#0v" *.dat |
    sort -k1,1 | uniq -c -s82 -w82 | grep -v "^ *1 "
  Count isomorphic solutions and list each non-trivial representative:
    sort -k1,1 | uniq -c -w82 | grep -v "^ *1 "
  Solve and categorize a collection of puzzles:
    sudoku -F"# %t seconds" -f"%v # %7n %10t %Q" puzzles.dat > puzzles.out
  Label and trace constraint interations:
    sudoku -ki -v2 puzzle.dat | less
  Capture the pencilmark grid after constraint iteration N:
    sudoku -kiN -f%#ph puzzle.dat
  Havard's "Making 17's from JPF's 19" sequence:
    sudoku -go"{-1+1}x3{-2+1}{-2+2}{1+1}x9" jpf-19.dat
  Generate 10 non-equivalent mimimal symmetric puzzles, each solved by a
  different set of constraints, with the same solution grid as the
  first puzzle in s.dat:
    sudoku -gp -Ys.dat -j0 -n10 -m -sg -e 'minimal==1&&uniq()&&uniq(%q)'
  Filter weak and strong pearls:
    sudoku -S -qss+G -e '(%#Pq)>2'
  Generate and compress the band 299 grids (133302) into 299.sudz:
    sudoku -gb299 -f '%#ec' -o 299.sudz
  Count the number of grid (97) with non-trivial automorphisms in 299.sudz:
    sudoku -e '(%#An)>1' -f- -Ff'%#an/%n' 299.sudz
CAVEATS
  This is a puzzle and algorithm analysis program.
  Look elsewhere for interactive gaming and GUIs.
  Its easier to solve than to generate,
  and easier to generate than to rate,
  and much easier to code than to document.
SEE ALSO
  sudocoup(1), sudocoo(1), pseudocoup(1)
CONTRIBUTORS
  Subgrid (multiple solution) row order minlex canonicalizer by Michael Deverin.
  Qb BRnet constraint method by Ed Russell.
  Z fish finder by Ron Kral.
IMPLEMENTATION
  version     sudoku (AT&T Research) 2009-07-17
  author      Glenn Fowler 
  copyright   Copyright (c) 2005-2009 AT&T Intellectual Property
  license     http://www.opensource.org/licenses/cpl1.0.txt
{%d%d,%d%d,%d%d,%d%d} %s: limit exceeded at %lu dictionary entries %s: out of space at %lu dictionary entries not solvedvery easyeasymoderatehardvery harddifficultvery difficult1 constrained2 constrainedrats -- 3 constrainedrats -- 4 constrainedrats -- 5 constrainedrats -- 6 constrainedrats -- 7 constrainedrats -- >=8 constrainedmore tokens expectedtoo many )'sclosing ) expectedoperator expected: expected for ? operatoroperator syntax errordivide by zeroinvalid log basesyntax erroroperand expectedinvalid use of :invalid function call argumentunknown functioninvalid actualwrong number of actual argumentsunknown variableinvalid tokenunknown token%s: %-.*s<<<%s: %s %2d[%d]%s %s [%d]%s%7llu %s [%d]%s %s %7llu %s %sxa%d0%lu.%05lus%lu.%02lus%lum%02lu.%02lus%lum%02lus%luh%02lum%lud%02luh%luw%02lud%luM%02lud%luY%02luMcheck backdoor size %d using %s %s: too many backdoors of size %d -- only %d recorded %%!PS %%%% generated by %s%%%% share puzzles and insights /grid { 0 setlinewidth 60 294 moveto 8 { 486 0 rlineto -486 54 rmoveto } repeat 114 240 moveto 8 { 0 486 rlineto 54 -486 rmoveto } repeat stroke 2 setlinewidth 60 402 moveto 2 { 486 0 rlineto -486 162 rmoveto } repeat 222 240 moveto 2 { 0 486 rlineto 162 -486 rmoveto } repeat stroke 4 setlinewidth 60 240 moveto 486 0 rlineto 0 486 rlineto -486 0 rlineto closepath stroke } def /clue { /v exch def /c exch def /r exch def c 54 mul 60 add 36 sub 10 r sub 54 mul 240 add 40 sub moveto (0123456789) v 1 getinterval show } def /hint { /v exch def /c exch def /r exch def c 54 mul 60 add 36 sub 10 r sub 54 mul 240 add 40 sub moveto v { gsave 0.6 setgray 0.35 0.35 scale 18 20 rmoveto dup dup [ 0 -40 0 40 -40 0 40 -40 0 40 ] exch get exch [ 0 40 40 40 0 0 0 -40 -40 -40 ] exch get rmoveto (0123456789) exch 1 getinterval show grestore } forall } def /candidate { /v exch def /c exch def /r exch def c 54 mul 60 add 36 sub 10 r sub 54 mul 240 add 40 sub moveto v { gsave 0.35 0.35 scale 28 32 rmoveto dup dup [ 0 -40 0 40 -40 0 40 -40 0 40 ] exch get exch [ 0 40 40 40 0 0 0 -40 -40 -40 ] exch get rmoveto currentpoint /ac exch def /ar exch def 20 0 rmoveto ar ac 20 0 360 arc stroke grestore } forall } def /node { gsave currentpoint 2 0 360 arc stroke grestore } def /line { /bc exch def /br exch def /ac exch def /ar exch def 4 setlinewidth ac 54 mul 60 add 26 sub 10 ar sub 54 mul 240 add 28 sub moveto node bc 54 mul 60 add 26 sub 10 br sub 54 mul 240 add 28 sub lineto node stroke } def /coincident { /bc exch def /br exch def /ac exch def /ar exch def 4 setlinewidth ac 54 mul 60 add 26 sub 10 ar sub 54 mul 240 add 28 sub moveto node currentpoint ac bc eq { /xr -28 def } { ac bc lt { /xr 0 def } { /xr -56 def } ifelse } ifelse ar br eq { /xc -28 def } { ar br lt { /xc 0 def } { /xc -56 def } ifelse } ifelse bc ac add 2 div 54 mul 60 add xc add 10 br ar add 2 div sub 54 mul 240 add xr add bc 54 mul 60 add 26 sub 10 br sub 54 mul 240 add 28 sub curveto node stroke } def /C 4 def /D 5 def /edge { dup /c exch def c C eq { pop } if /t exch def gsave t 3 eq { 0.9 0.0 0.0 setrgbcolor } { t 1 eq { 0.0 0.9 0.0 setrgbcolor } { t 2 eq { 0.0 0.0 0.9 setrgbcolor } { 0.9 0.9 0.0 setrgbcolor } ifelse } ifelse } ifelse c C eq { coincident } { line } ifelse grestore } def /mark { gsave /c exch def /r exch def c 54 mul 60 add 36 sub 10 r sub 54 mul 240 add 40 sub moveto -14 -10 rmoveto 2 setlinewidth 0 46 rlineto 46 0 rlineto 0 -46 rlineto closepath stroke grestore } def /clear { gsave /v exch def /c exch def /r exch def 0.3 0.1 0.9 setrgbcolor r c mark r c v candidate grestore } def /magic { gsave /v exch def /c exch def /r exch def 0.57 0.44 0.86 setrgbcolor r c v candidate grestore } def /pair { gsave 0 0.9 0.9 setrgbcolor mark grestore } def /solution { 342 -80 translate 0.37 0.37 scale grid } def /AvantGarde-Demi findfont 36 scalefont setfont newpath %% puzzle data/label { /v exch def /c exch def /r exch def v 10 lt { c 54 mul 60 add 36 sub 10 r sub 54 mul 240 add 40 sub moveto gsave 0.7 0.7 scale (0123456789) v 1 getinterval show grestore } { c 54 mul 60 add 43 sub 10 r sub 54 mul 240 add 36 sub moveto gsave 0.7 0.7 scale (00010203040506070809101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899) v 2 mul 2 getinterval show grestore } ifelse } def60 20 moveto gsave 0.5 0.5 scale((%u/%u) %s (%d)) show 120 80 moveto (%s) show grestore 2 20 translate grid %s %d %d [ %c ] magic %d %d %d label %d %d %c clue %d %d [ %c ] hintsolutionshowpage%s: too many tuples -- %d slots max %s: %s: invalid symmetry transform -- combinations of { f r p h v d a } expected out of space [constraint_O] no-puzzleinvalidno-solutionmultiple-solutionsone-solution%0*u%*u%c%u%s%s%.4fE%02d00 %d-%d-%d-%d-%d[%d] %s=%d ERROR%03d%c%03d%c%03d%c%03d%c%03d%c%03d%s: sudz SUDZ_WRITE open failure invalid-band-index%03d- distance-%s%s%dasymmetricnot-an-exemplarX+-------+-------+-------+ %s | | %s------+-------+------ *-----------* |---+---+---| | %s---+---+--- %lusimilaritydistancemagic-errorconstrained%s%c%d.%d.%s%c%d %d:%c%s%c%d.%d%Xan%s: %%%c is deprecated -- use %%#%s pninlnonmnrnetpttt%*.*s%*s%*.*llu%0*llu%*llu%llu%*.*lld%0*lld%*lld%lld%s: sudz flush failed %s: %s: %s: unknown argument %s: %s: %d: index must be in range 0..9 %s # %s %2lu %2lu possig%s%dtotrequired %s %u %ld%s%lu %s %.*sC %s: out of space [talloc] =>%s %c-trip%4d %c %s%s%s%s%s%s%s => %s%s%s%s%s%s312%%%% %c-cycle %2d %c %d %d %d %d %d D %sedge %d %d %d %d %s %sedge %d %d [ %c ] clear %s box-line %c %c/%d %s naked %c/%d %s%*s%s hidden %c/%d %s%*s%s x-wing %3d %c %c/%d %%%% x-wing %2d %c %d %d %d %d %d 1 edge %d %d %d %d S edge %d %d [ %s ] clear %s %c-cycle %2d %c %2d%c %s panic: more than %d exact ps.pairs %s %c-pair %c 2 3 %s%s %d %d %d %d 3 ps.edge %%%% %c %s %c-hinge %c %d %s-%s %d: too many knots -- %d max %s %c-edge %c %2d %s=%s %s %c-edge %c %2d %s>%s %s %c-knot %3d %c %2d%c %s#%s %s rookery %c %2d %s %s rookery %c %d %s P %s %s: out of space [propositions] %s propositions %6d solutions %3d contradictions %3d iterations %6d girth %3d degree %3d nesting %d (%u/%u) %s: panic: brnet_grl_index called with ii >= jj %s: panic: brnet_grl called with ii == jj ##00010*10*0^^--11~~*1<<1*>>==**%s %s %s %s %s %s %s%s: out of space %s brnet %3d %s => %s %s transport %s %s : %-*.*s %s (%d) %s transport %s %s : best : %d elimination%s x-wingswordjellystarwhaleleviathanoctopusfish %c %d %2dX%dx%dnsashimifinnedunfinnedmutantfrankenbasic%s %s %s ==> <>%c%s %s got here without exclusionsfingrp = 0%09o, 0%09o, 0%09o leftovers3 = 0%09o, 0%09o, 0%09o leftovers2 = 0%09o, 0%09o, 0%09o fins = %d, %d, %d gff->sdgrid = 0%09o, 0%09o, 0%09o buns[%d]= 0%09o, 0%09o, 0%09o base = 0%09o, 0%09o, 0%09o endofin= 0%09o, 0%09o, 0%09o cuns[%d]= 0%09o, 0%09o, 0%09o cover = 0%09o, 0%09o, 0%09o fingrp = 0%09o, 0%09o, 0%09o exc = 0%09o, 0%09o, 0%09o dblcov = 0%09o, 0%09o, 0%09o intsect= 0%09o, 0%09o, 0%09o O%d,L%d,W%d,S%d,J%d,endos = %d exactcover=%X %s fish %c %d.%d {%010o,%010o,%010o} %s fish %c %d.%d {%010o,%010o,%010o} %d Clue info.Symmetry info.Forced cell (naked single or T1): only one value possible.Only cell (hidden single or H1): only one value in row/col/box.Box claim: (2:boxline) candidates in box confined to one row/col. (3:linebox) candidates in row/col confined to one box.(naked) tuple: order <= n (4) n exact n-tuples in row/col/box.(hidden) tuple: order <= n (4) n hidden n-tuples in row/col/box.Row/col claim: order <= n (4) pure x-wing/swordfish/jellyfish.Singleton cycle: strong and 1-weak edges. Requires B, included in Y.Degree-2 cycle: strong, 1-weak and 0-weak (degree-2) edges. Includes X. NOTE: y-edge (0-weak) path details are currently disabled pending enhancement of the 2007-05-01 Y algorithm.Degree-2 singles knots (bivalue/location contradiction chains).Overlay: single digit 9-cell rookery templates (that WXY miss).Ronk's general fish finder. n is the max fish size, 2 <= n <= 8. .m is the max number of fins, 1 <= m <= 3. Fish sizes in the range 2..n are searched. .m always denotes a fin count range from 0..m. n.m.1 limits the size search to n.Constrained proposition net P(C) -- constraints C applied to candidate propositions. n is the girth (constraint iteration) limit. The default is 0 for no limit. .m is the candidate degree (value/location) limit; propositions are only made on cells/values with degree <= m, in order from least to most. The default is 0 for no limit. Degree 1 limits propositions to bivalue cells only. The basic constraints are used if (C) is omitted. If singleton propositions fail to advance the solution then: if P* or P..2 is specified then nested (paired) propositions are applied, otherwise if G is enabled then normal backtrack logic is used. -B is enabled and -S is disabled for this constraint. With -O the minimum girth/degree that advances the solution is used, and all propositions for that girth/degree are attempted and counted. Without -O the minimum degree that advances the solution is used. Related to error nets, 3D-medusa, T&E.Experimental constraints QX. Q prefix optional. Q stats account for all Q constraints applied. X may be: b: Red Ed's BR net which propagates 16 vertex-vertex boolean relationships derived from strong (3) and weak (1,2) edges by applying a triangle relationship on groups of the vertices. Q2 is the number of sweeps, Q3 is the number of triangle state changes. A sweep searches for triangle state changes. Sweeps are repeated until there are no more state changes. t(C): Michael McWilliams' red/green transport: select a degree 2 tuple and determine the common eliminations when one end and then the other is assigned, using constraints C to propagate (transport) the initial assignments. The quick constraints (FN) are used if (C) is omitted. Related to the P constraint. t1: test only bivalue cells, t2: test only bilocation cells. Fails on puzzles matching -e 'P&&(P8!=1||P7!=2||V!=2)'.btGuess: backtrack search guess (T&E).Backdoor info.Rating.Solving subexpression V(n) value or V(X) validation expression. -------%s %c%d %c%d%s D %s %s D %s [ %s vs %s ] %s D %c contradiction %s D {%d} %d > %d %s D {%d} %d < %d %s D %c%d %s S %s G %s DEAD %s=%s%s L%dERROR---- subexpression %d ---- %s: exemplars %llu and %llu are not isomorphic %s: puzzle %llu invalid %s: puzzle %llu and %llu solutions are not isomorphic constraint order %s : %s%s: too many )'s in constraint order %s: (%-*.*s): constraint method expected for parameter data %s: (%-*.*s): constraint parameter data too big -- %d max %s: (%-*.*s): constraint parameter value already specified %s: (%-*.*s): out of space %s: %-*.*s: invalid constraint options %s: constraint order {...} nesting too deep -- %d max %s: too many }'s in constraint order %s: %c: unknown constraint method %s: %c%c: unknown sub-constraint %s: %c%d: constraint size parameter invalid %s: %c%d: constraint size parameter must be in range %d..%d %s: missing } in constraint order %s: missing ) in constraint order %d:*:%d%d:%d*.%s.%dV%d(%d)V(%d);%s=%s : %s out of space%s: of space hardest|hSudoku Player's Forum hardest puzzle options. Ratings are exponentially normalized to the range 95000..99999 (fixed upper limit). Fairly consistent across puzzle permutations, but may take few minutes on some puzzles.-q-G -BOX -MFN -Z'{FN}P*V(2)||{FN}BP*V(3)||{FN}B{T2H2}P*V(4)'hardest-obsolete|oObsolete Sudoku Player's Forum hardest options.-q-G -B -Z'FNP(FN)V(P<=9)V(2)||-XY+P(FN)V(P<=9)V(3)|| FNP(FNB)V(P<=9)V(4)||FNP(FNBT2H2)V(5)|| FNP(FNBTHW)V(6)||FNP(FNBTHWX)V(7)|| FNP(FNBTHWXY)V(8)||FNP(FNBTHWXYO)V(9)|| FNP.3G||FNP.9G||FNBTHWXYP.9G'inferior|iSudoku Player's Forum inferior puzzle options.-q{FN}-G -B -eVSudoku Player's Forum hardest puzzle Q1 rating options. Ratings are steps+iterations plus a weight for propositions requiring B constraints. Values fall in the range 1 .. 99999. Much faster than -qhardest, and may be of similar quality.-q'{FN}-G' -Z'{FN}P*V(2)||{FN}BP*V(3)' -B -MFN -R'steps+iterations+B*1000'Sudoku Player's Forum hardest puzzle Q2 rating options. Similar to Q1 but averages the worst case work of a candidate degree ordered backtrack solver. Values fall in the range 1 .. 99999.-q'{FN}BP*-G' -B -MFN -RP?P9:I0simple|ssA close approximation to the Simple Sudoku constraint order. Differences will surface between SS coloring and X/Y cycles. With guessing off (-G) some valid puzzles will have no solution.-qT1H1T2BT3T4H2W2W3XH3H4Y-Gsuperior|sSudoku Player's Forum superior-plus puzzle options.-q{[B]T1H1BT2H2W2T3H3}{[B+]W3T4H4W4}-G -eVsuperior2|s2Sudoku Player's Forum superior-2 puzzle options.-q'{[B+]T1H1}{[B1]BT2H2W2T3H3}-G' -e'V&&S&&(W2||T3||H3)'ulterior|uSudoku Player's Forum ulterior puzzle options.-q{B2:N}-G -Q!{FN} -AB -eV SEEN MEMBER IMPLICIT EVERY DISPLAY DELTA CLUES CLASSIFYoffon %ld/%d %3d %2d %2ld %s%s%s%s%s%s%s%s #!%s%s %s: %s:%lu: invalid exemplar mask "%s" %s: invalid exemplar mask "%s" %s: %s:%lu: exemplar mask {...} imbalance %s: exemplar mask {...} imbalance %s: %s:%lu: invalid cell %s=%c %s: invalid cell %s=%c in %s %s: %s:%lu: unexpected EOF %s: incomplete puzzle operand %s: %s:%llu: invalid move %s %s %c %s %s: invalid move %s %s %c %s out of space [unbiased] # %6lu %8lu %6d/%-2d # %6lu %8lu %6d enumeraterandomemptytemplate %d cell%s %d candidate%s => %s pattern %d cell%s fill=%d slop=%d keep=%d %03d%03d %s %2d : %s%2d : %s %llu %llu %llu %s # %d stdin%s: %s: cannot read %s: %s input must be seekable %s: %s input corrupt %s: %s: unknown magic %s: -C: %s: [flpDS] option flag(s) expected %s: -F: format argument expected %s: -g%c: already specified %s: -g%c: unbalanced {...} %s: too many -g%c args -- %d max %s: %s: invalid option argument %s: -gb%d-%d: maximum band index is %u RANDOM ONE MULTIPLEGEN [%d] %2d %2d %2ld%s%s%s%s%s%s%s%s%s%s%s %s: -g: [bBcghHmopstxX][options][+|-][number]... argument expected %s: -k: [cdimp]min..max{..} argument expected %s: -K: [ci]n1,n2,... argument expected w%s: %s: cannot open for writing %s: %s: input permutation already specified %s: %s: invalid permutation %s: %s: unknown common option %s: %s: common option too large -- %d max %-.*s %s: -z%c: unknown option %s: -%c: unknown option %s: -%c: option argument expected extrawhich%#0v # %#Rn.%#cn.%#rn%v # %5r %q %(CSM)#c#/q?%#nr/%02(C)x/%02(K)x/%04(I)x/%(M)x^[%r%c]%5r %-11q %#c#/q%Y-%m-%d+%H:%M:%S%p%o%v/%x/X#@*$&%#Ci %#Cn %1v %2#.c P?(G?[r]98000+G:(10000+(P5>=1000?(P5/100)*100:P5))*10+ (B0?10000000+B0*100:0)+ ((T0||H0)?50000000+((T2+H2)+(T3+H3)*8+(T4+H4)*32)*32:0)): F+N*2+B*4+(T2+T3*4+T4*16)*8+(H2+H3*8+H4*32)*64+ (W*2+W2+W3*4+W4*16)*256+(X*2+X3+(X4+X5*2+X6*4+X7*8)*4)*128+ (Y*2+Y3+(Y4+Y5*2+Y6*4+Y7*8)*16)*128+ (K*2+K3+(K4+K5*2+K6*4+K7*8)*16)*512+ (Z*2+Z2+Z3*4+Z4*8+Z5*12+Z6*14+Z7*15+Z8*16)*512+ O*128*256+(G?(G*(15**M-M1+64)+89985):0)questionsolvequick%d #!sudz sudz: write error sudz: grid %ll u: %03d: invalid band sudz: vcodex: %s wbwosudz: encode error rbsudz: read error sudz: magic error -- expected '%-*.*s' rosudz: decode error sudz: grid %ll u: unknown attribute 67891237891234566789123789123465678912378912356467891237891324656789123789132546678912378913256467891237892315646789123789231645678912379813246567891237981325466789123798132564678912379821356467891237982136546789123798231564678912379823164567891238972315646789123897231645678913278912354667891327891325466789132789132564678913278921345667891327892136456789132789213654678913278923154667891327892315646789132879231564678923178912364567892317891325466789231789231564678923178931245667892317982136457189236689237145718923668923715471892366892374157189236689237451718923668923751471892366892375417189236689273145718923668927315471892366892734157189236689273451718923668927351471892366892735417189236689327145718923668932715471892366893274157189236689327451718923668932751471892366893275417189236689372145718923668937215471892366893724157189236689372451718923668937251471892366893725417189236689723145718923668972315471892366897234157189236689723514718923668972354171892366897321457189236689732154718923668973241571892366897325147189236689732541718923669823714571892366982371547189236698237415718923669823751471892366982375417189236698273145718923669827315471892366982734157189236698273514718923669827354171892366983271457189236698327154718923669832741571892366983275417189236698372145718923669837215471892366983724157189236698372514718923669837254171892366987231457189236698723154718923669872341571892366987235147189236698732145718923669873215471892366987324157189236698732514718923686923714571892368692375147189236869273145718923686927315471892368692734157189236869273514718923686932715471892368693274157189236869327514718923686937214571892368693721547189236869372415718923686937251471892368697231457189236869723154718923686972351471892368697321457189236869732154718923689623714571892368962371547189236896237514718923689627314571892368962731547189236896273514718923689632714571892368963271547189236896327514718923689637214571892368963721547189236896372514718923689672315471892368967235147189236896732154718923689673251471892369682371547189236968237514718923696827351471892369683271547189236968327514718923696837215471892369683725147189236968723154718923696873215471892369862371547189236986273154718923698632715471892369863721547189263689237145718926368923741571892636892374517189263689237514718926368927315471892636892734157189263689273451718926368927351471892636892735417189263689327154718926368932741571892636893275147189263689327541718926368937214571892636893721547189263689372415718926368937245171892636893725147189263689723145718926368972315471892636897234517189263689732145718926368973215471892636897324157189263689732451718926368973251471892636897325417189263698237154718926369823741571892636982374517189263698237514718926369827314571892636982734157189263698273451718926369827351471892636983271457189263698327154718926369832741571892636983274517189263698327514718926369837215471892636983724157189263698372514718926369837254171892636987321457189263698732154718926369873245171892638692371547189263869237415718926386923751471892638692734517189263869327415718926386932745171892638693275147189263869372145718926386937215471892638693725147189263896237145718926389623715471892638962374517189263896327145718926389632715471892638963274157189263896327451718926389632751471892638963275417189263896372145718926389637215471892638963724517189263968327145718926396832715471892639683274157189263968327514718926396832754171892639683721457189263986327145718926398632715471892639863274517189326689237451718932668923751471893266892375417189326689273145718932668927345171893266892735417189326689327154718932668932745171893266893275417189326689372415718932668937254171893266897231457189326689723415718932668973214571893266897324157189326689732514718932668973254171893266982371457189326698237541718932669827351471893266982735417189326698732415718932686937251471896236892371457189623689237154718962368927314571896236892731547189623689273541718962368932714571896236893271547189623689372145718962368937215471896236893725147189623689723145718962368972315471896236897234157189623689723451718962368972351471896236897235417189623689732145718962368973215471896236897324157189623689732451718962368973251471896236897325417189623698237145718962369823715471896236982375417189623698273145718962369827315471896236983271457189623698327154718962369832751471896236983721457189623698372154718962369873214571896236987321547189623698732415718962369873251471896236987325417189623869237145718962386927314571896238692731547189623869273451718962386932715471896238693721457189623869372154718962389623714571896238962371547189623896237415718962389623745171896238962375147189623896237541718962389632714571896238963271547189623896327415718962389632745171896238963275147189623896372145718962389637215471896238963724517189623968327145718962396832715471896239683274157189623968372145718962396837215471896239863271457189623986327154718962398632741571896239863274517189623986327514718962398632754171896326892371457189632689273145718963268927315471896326892735147189632689327154718963268937214571896326893721547189632689723145718963268972351471896326897321457189632689732154718963268973251471896326897325417189632698237145718963269823715471896326982375147189632698273145718963269832714571896326983271547189632698327541718963269837215471896326987321457189632698732514718963286927314571896328693721457189632896237145718963289623741571896328963271457189632896327154718963289632745171896328963275417189632896372145718963289637215471896328963724517189632968327145718963296832715471896329683274517189632986327145728916368917345272891636897132547289163698137425728916369813752472891636983172547289163698317524728916369871325472891638697132457289163869731245728916386973152472891638963172457289163896731524728961368917324572896136897132457289613689713254728961369813725472896136983172457289613698317254728961369871324572896138697132457289613869731245728961386973125472896138961372457289613896137254728961389631724572896138963174257289613896731245728961389673125472896139681372457289613968137254728961396873124572896139861372457289631689173245728963168971325472896316983172547289631869713245728963186971325472896318697312457289631869731254728963189613724572896318961372547289631896137425728963189631724572896318963172547289631896731245728963196813725472896319687312457289631968731254728963198613724572896319861372547389612896127345738961289612735473896128961723457389612896172354738961289621734573896128962173547389612896271345738961289627135473896128967123547389612896721354738961298617235473896129862173547389621896127345738962189621735473896219861273547893612896127345789361289612735478936128962173547893612986217354123478456129789563123479456128789365123479456128789635123479456128789653123479456182789653123489456127789356123489456127789365123489456127789563123489456127789635123489456127789653123489456723789156123489456723789165123569456178789234123569456178789432123578456129789364123579456128789346123579456128789364123579456128789463123579456128789643123579456182789436123579456183789246123589456127789346123589456127789364123589456127789436123589456127789463123589456127789634123678456129789345123678456129789354123678456129789435123678456129789534123678456129789543123679456128789345123679456128789354123679456128789435123679456128789453123679456128789534123689456127789345123689456127789354123789456123789456123789456123789465123789456123789564123789456132789546123789456231789645666999!!!<<<!!!666999<<<666 $$$???---HHH     $-6?H 6?H $-LLLDLLMMMTMTU VNNDNTNTDUVD TUTVTQ TeTUVLLFLL    , ,,  4F 44MMMVM  , M M M , ,U ^ 5VU 55\] ^ ,,, , ,,,NNFNVN  4] V 5 N  N F4 4V5V 5\F]^F F 44F4 4 444\]V^VY V] 55V5^ 5Z 555\\]^    !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOP #,5>GP"+4=FO!*3=<;:9876543210/.-,+*)('&%$#"!   H?6-$ I@7.% JA8/& KB90' LC:1( MD;2) NE<3*!OF=4+"PG>5,# #"! ,+*)('&%$543210/.->=<;:9876GFEDCBA@?PONMLKJIH PG>5,#OF=4+"NE<3*!MD;2) LC:1( KB90' JA8/& I@7.% H?6-$ HIJKLMNOP?@ABCDEFG6789:;<=>-./012345$%&'()*+, !"# @ $-6?H %.7@I &/8AJ '09BK (1:CL )2;DM!*3GP ( ( ( ( ( (@@@ @ @ @ @ @ @   8p8p8pחAA@B@cA*uA@~.A*aA@@i@@w+A@1@@@@AQaBRbCScbbbbbbbbb*cccR c#c&c@cBcDc`cbcec ncbcpc@{c}ccc}cc.