All Downloads are FREE. Search and download functionalities are using the official Maven repository.

clojure.core__init.class Maven / Gradle / Ivy

The newest version!
????1&?clojure/core__initjava/lang/Objectload()Vconst__0Lclojure/lang/Var;		clojure/lang/Var
getRawRoot()Ljava/lang/Object;

clojure/lang/IFnconst__1Lclojure/lang/AFn;	invoke&(Ljava/lang/Object;)Ljava/lang/Object;clojure/lang/Symbolclojure/lang/Namespacefind/(Lclojure/lang/Symbol;)Lclojure/lang/Namespace; 
!clojure/lang/AReference#const__4%	&clojure/lang/IPersistentMap(	resetMeta<(Lclojure/lang/IPersistentMap;)Lclojure/lang/IPersistentMap;*+
$,(clojure/core$loading__1595__auto____6392.0
/13const__55	6equals(Ljava/lang/Object;)Z89
:clojure/core$fn__6394<
=1java/util/concurrent/Callable?clojure/lang/LockingTransactionArunInTransaction3(Ljava/util/concurrent/Callable;)Ljava/lang/Object;CD
BEconst__6G	H	const__12J	KsetMeta (Lclojure/lang/IPersistentMap;)VMN
O	const__13Q	R	const__15T	U	const__16W	X	const__21Z	[clojure/lang/PersistentList]creatorLclojure/lang/IFn;_`	^abindRoot(Ljava/lang/Object;)Vcd
e	const__22g	h	const__26j	kclojure/core$cons__6396m
n1	const__27p	q	const__30s	tclojure/core$let__6398v
w1	const__31y	z	const__33|	}clojure/core$loop__6400
?1	const__34?	?	const__36?	?clojure/core$fn__6402?
?1	const__37?	?	const__40?	?clojure/core$first__6404?
?1	const__41?	?	const__46?	?clojure/core$next__6406?
?1	const__47?	?	const__50?	?clojure/core$rest__6408?
?1	const__51?	?	const__54?	?clojure/core$conj__6410?
?1	const__55?	?	const__58?	?clojure/core$second__6412?
?1	const__59?	?	const__62?	?clojure/core$ffirst__6414?
?1	const__63?	?	const__66?	?clojure/core$nfirst__6416?
?1	const__67?	?	const__70?	?clojure/core$fnext__6418?
?1	const__71?	?	const__74?	?clojure/core$nnext__6420?
?1	const__75?	?	const__78?	?clojure/core$seq__6422?
?1	const__79?	?	const__82?	?"clojure/core$instance_QMARK___6424?
?1	const__83?	?	const__86?	?clojure/core$seq_QMARK___6426?
?1	const__87?	?	const__90?	?clojure/core$char_QMARK___6428?
?1	const__91		const__94	 clojure/core$string_QMARK___6430
1	const__95		
	const__98	
clojure/core$map_QMARK___6432
1	const__99	
const__102	 clojure/core$vector_QMARK___6434
1
const__103	
const__106	clojure/core$assoc__6436!
"1
const__107$	%
const__110'	(clojure/core$meta__6438*
+1
const__111-	.
const__1140	1clojure/core$with_meta__64403
41
const__1156	7
setDynamic(Z)Lclojure/lang/Var;9:
;
const__119=	>clojure/core$assert_valid_fdecl@
A1
const__120C	D
const__122F	Gclojure/core$sigsI
J1
const__123L	M
const__126O	Pclojure/core$last__6448R
S1
const__127U	V
const__130X	Yclojure/core$butlast__6450[
\1
const__131^	_
const__134a	bclojure/core$defn__6452d
e1setMacrog
h
const__135j	k
const__138m	nclojure/core$to_arrayp
q1
const__139s	t
const__142v	wclojure/core$casty
z1
const__143|	}
const__146	?clojure/core$vector?
?1
const__147?	?
const__150?	?clojure/core$vec?
?1
const__151?	?
const__154?	?clojure/core$hash_map?
?1
const__155?	?
const__158?	?clojure/core$hash_set?
?1
const__159?	?
const__162?	?clojure/core$sorted_map?
?1
const__163?	?
const__166?	?clojure/core$sorted_map_by?
?1
const__167?	?
const__170?	?clojure/core$sorted_set?
?1
const__171?	?
const__174?	?clojure/core$sorted_set_by?
?1
const__175?	?	const__17Lclojure/lang/Keyword;??	?
const__176Ljava/lang/Object;??	?const__2??	?*Returns true if x is nil, false otherwise.?	const__43??	?
const__177??	?	const__19??	?1.0?	const__24??	?java/lang/Boolean?TRUELjava/lang/Boolean;??	??
const__178??	?&clojure/core$nil_QMARK___inliner__6464?
?1const__7??	?
const__179??	?const__9??	?	const__10??	?	const__11??	?clojure/core.clj?clojure/lang/RT?
mapUniqueKeys2([Ljava/lang/Object;)Lclojure/lang/IPersistentMap;
clojure/core$nil_QMARK_
1
const__180		
const__183	clojure/core$defmacro
1
const__184	
const__187	clojure/core$when
1
const__188	
const__191	clojure/core$when_not 
!1
const__192#	$
const__195&	'clojure/core$false_QMARK_)
*1
const__196,	-
const__199/	0clojure/core$true_QMARK_2
31
const__2005	6
const__2038	9clojure/core$boolean_QMARK_;
<1
const__204>	?
const__207A	Bclojure/core$notD
E1
const__208G	H
const__211J	Kclojure/core$some_QMARK_M
N1
const__212P	Q
const__215S	Tclojure/core$any_QMARK_V
W1
const__216Y	Z
const__220\	]clojure/core$str_
`1
const__221b	c
const__224e	fclojure/core$symbol_QMARK_h
i1
const__225k	l
const__228n	oclojure/core$keyword_QMARK_q
r1
const__229t	u
const__233w	xclojure/core$symbolz
{1
const__234}	~
const__237?	?clojure/core$gensym?
?1
const__238?	?
const__241?	?clojure/core$cond?
?1
const__242?	?
const__246?	?clojure/core$keyword?
?1
const__247?	?
const__250?	?clojure/core$find_keyword?
?1
const__251?	?
const__254?	?clojure/core$spread?
?1
const__255?	?
const__258?	?clojure/core$list_STAR_?
?1
const__259?	?
const__262?	?clojure/core$apply?
?1
const__263?	?
const__266?	?clojure/core$vary_meta?
?1
const__267?	?
const__270?	?clojure/core$lazy_seq?
?1
const__271?	?
const__275?	?clojure/core$chunk_buffer?
?1
const__276?	?
const__279?	?clojure/core$chunk_append?
?1
const__280?	?
const__284?	?clojure/core$chunk?
?1
const__285?	?
const__288?	?clojure/core$chunk_first?
?1
const__289?	?
const__292?	?clojure/core$chunk_rest?
?1
const__293?	?
const__296?	?clojure/core$chunk_next
1
const__297	
const__300	clojure/core$chunk_cons

1
const__301
	
const__304	clojure/core$chunked_seq_QMARK_
1
const__305	
const__308	clojure/core$concat
1
const__309	 
const__312"	#clojure/core$delay%
&1
const__313(	)
const__316+	,clojure/core$delay_QMARK_.
/1
const__3171	2
const__3204	5clojure/core$force7
81
const__321:	;
const__324=	>clojure/core$if_not@
A1
const__325C	D
const__326F?	G(Tests if 2 arguments are the same objectI,clojure/core$identical_QMARK___inliner__6524K
L1
const__327N?	O
const__329Q	R
const__330T?	Uclojure/core$identical_QMARK_W
X1
const__331Z	[
const__332]?	^ Equality. Returns true if x equals y, false if not. Same as
  Java x.equals(y) except it also works for nil, and compares
  numbers and collections in a type-independent manner.  Clojure's immutable data
  structures define equals() (and thus =) as a value, not an identity,
  comparison.` clojure/core$_EQ___inliner__6527b
c1
const__333e	f
const__334h?	iclojure/core$_EQ_k
l1
const__335n	o
const__338q	rclojure/core$not_EQ_t
u1
const__339w	x
const__340z?	{$Comparator. Returns a negative number, zero, or a positive number
  when x is logically 'less than', 'equal to', or 'greater than'
  y. Same as Java x.compareTo(y) except it also works for nil, and
  compares numbers and collections in a type-independent manner. x
  must implement Comparable}#clojure/core$compare__inliner__6531
?1
const__341??	?clojure/core$compare?
?1
const__342?	?
const__345?	?clojure/core$and?
?1
const__346?	?
const__349?	?clojure/core$or?
?1
const__350?	?
const__351??	?'Returns true if num is zero, else false?'clojure/core$zero_QMARK___inliner__6538?
?1
const__352??	?clojure/core$zero_QMARK_?
?1
const__353?	?
const__354??	??Returns the number of items in the collection. (count nil) returns
  0.  Also works on strings, arrays, and Java Collections and Maps?!clojure/core$count__inliner__6541?
?1
const__355??	?clojure/core$count?
?1
const__356?	?
const__357??	?
Coerce to int?clojure/core$int__inliner__6544?
?1
const__358??	?clojure/core$int?
?1
const__359?	?
const__360??	??Returns the value at the index. get returns nil if index out of
  bounds, nth throws an exception unless not-found is supplied.  nth
  also works for strings, Java arrays, regex Matchers and Lists, and,
  in O(n) time, for sequences.?clojure/core$nth__inliner__6547?
?1
const__362?	?
const__363??	?clojure/core$nth?
?1
const__364?	?
const__365??	?QReturns non-nil if nums are in monotonically increasing order,
  otherwise false.? clojure/core$_LT___inliner__6550?
?1
const__366?	?
const__367??	?clojure/core$_LT_?
?1
const__368?	?
const__369??	?TReturns a number one greater than num. Supports arbitrary precision.
  See also: inc?,clojure/core$inc_SINGLEQUOTE___inliner__6553?
?1
const__370?	clojure/core$inc_SINGLEQUOTE_
1
const__371	
const__372	?	
lReturns a number one greater than num. Does not auto-promote
  longs, will throw on overflow. See also: inc'clojure/core$inc__inliner__6556
11.2
const__373?	clojure/core$inc
1
const__374	
const__377	clojure/core$reduce1
 1
const__378"	#
const__381%	&clojure/core$reverse(
)1
const__382+	,
const__385.	/clojure/core$nary_inline1
21
const__3864	5
const__3897	8clojure/core$_GT_1_QMARK_:
;1
const__390=	>
const__393@	Aclojure/core$_GT_0_QMARK_C
D1
const__394F	G
const__395I?	JTReturns the sum of nums. (+') returns 0. Supports arbitrary precision.
  See also: +L
const__396N	O
const__397Q?	R clojure/core$_PLUS__SINGLEQUOTE_T
U1
const__398W	X
const__399Z?	[kReturns the sum of nums. (+) returns 0. Does not auto-promote
  longs, will throw on overflow. See also: +']
const__400_	`
const__401b	c8(Ljava/lang/Object;Ljava/lang/Object;)Ljava/lang/Object;ef
const__402h?	iclojure/core$_PLUS_k
l1
const__403n	o
const__404q?	rXReturns the product of nums. (*') returns 1. Supports arbitrary precision.
  See also: *t
const__405v	w
const__406y?	z clojure/core$_STAR__SINGLEQUOTE_|
}1
const__407	?
const__408??	?oReturns the product of nums. (*) returns 1. Does not auto-promote
  longs, will throw on overflow. See also: *'?
const__409?	?
const__410?	?
const__411??	?clojure/core$_STAR_?
?1
const__412?	?
const__413??	?rIf no denominators are supplied, returns 1/numerator,
  else returns numerator divided by all of the denominators.?
const__414?	?
const__415??	?clojure/core$_SLASH_?
?1
const__416?	?
const__417??	??If no ys are supplied, returns the negation of x, else subtracts
  the ys from x and returns the result. Supports arbitrary precision.
  See also: -?
const__418?	?
const__419??	?clojure/core$__SINGLEQUOTE_?
?1
const__420?	?
const__421??	??If no ys are supplied, returns the negation of x, else subtracts
  the ys from x and returns the result. Does not auto-promote
  longs, will throw on overflow. See also: -'?
const__422?	?
const__423?	?
const__424??	?clojure/core$_?
?1
const__425?	?
const__426??	?UReturns non-nil if nums are in monotonically non-decreasing order,
  otherwise false.?$clojure/core$_LT__EQ___inliner__6575?
?1
const__427?	?
const__428??	?clojure/core$_LT__EQ_?
?1
const__429?	?
const__430??	?QReturns non-nil if nums are in monotonically decreasing order,
  otherwise false.? clojure/core$_GT___inliner__6578?
?1
const__431?	?
const__432??	?clojure/core$_GT_?
?1
const__433?	?
const__434??	?UReturns non-nil if nums are in monotonically non-increasing order,
  otherwise false.?$clojure/core$_GT__EQ___inliner__6581?
?1
const__435?	?
const__436??	clojure/core$_GT__EQ_
1
const__437	
const__438?		[Returns non-nil if nums all have the equivalent
  value (type-independent), otherwise false$clojure/core$_EQ__EQ___inliner__6584
1
const__439	
const__440?	clojure/core$_EQ__EQ_
1
const__441	
const__442?	!Returns the greatest of the nums.
const__443!	"
const__444$?	%clojure/core$max'
(1
const__445*	+
const__446-?	.Returns the least of the nums.0
const__4472	3
const__4485?	6clojure/core$min8
91
const__449;	<
const__450>?	?QReturns a number one less than num. Supports arbitrary precision.
  See also: decA,clojure/core$dec_SINGLEQUOTE___inliner__6589C
D1
const__451F?	Gclojure/core$dec_SINGLEQUOTE_I
J1
const__452L	M
const__453O?	PiReturns a number one less than num. Does not auto-promote
  longs, will throw on overflow. See also: dec'Rclojure/core$dec__inliner__6592T
U1
const__454W?	Xclojure/core$decZ
[1
const__455]	^
const__456`?	adReturns a number one greater than x, an int.
  Note - uses a primitive operator subject to overflow.c-clojure/core$unchecked_inc_int__inliner__6595e
f1
const__457h?	iclojure/core$unchecked_inc_intk
l1
const__458n	o
const__459q?	rdReturns a number one greater than x, a long.
  Note - uses a primitive operator subject to overflow.t)clojure/core$unchecked_inc__inliner__6598v
w1
const__460y?	zclojure/core$unchecked_inc|
}1
const__461	?
const__462??	?aReturns a number one less than x, an int.
  Note - uses a primitive operator subject to overflow.?-clojure/core$unchecked_dec_int__inliner__6601?
?1
const__463??	?clojure/core$unchecked_dec_int?
?1
const__464?	?
const__465??	?aReturns a number one less than x, a long.
  Note - uses a primitive operator subject to overflow.?)clojure/core$unchecked_dec__inliner__6604?
?1
const__466??	?clojure/core$unchecked_dec?
?1
const__467?	?
const__468??	?ZReturns the negation of x, an int.
  Note - uses a primitive operator subject to overflow.?0clojure/core$unchecked_negate_int__inliner__6607?
?1
const__469??	?!clojure/core$unchecked_negate_int?
?1
const__470?	?
const__471??	?ZReturns the negation of x, a long.
  Note - uses a primitive operator subject to overflow.?,clojure/core$unchecked_negate__inliner__6610?
?1
const__472??	?clojure/core$unchecked_negate?
?1
const__473?	?
const__474??	?]Returns the sum of x and y, both int.
  Note - uses a primitive operator subject to overflow.?-clojure/core$unchecked_add_int__inliner__6613?
?1
const__475??	?clojure/core$unchecked_add_int?
?1
const__476?	?
const__477??	?^Returns the sum of x and y, both long.
  Note - uses a primitive operator subject to overflow.?)clojure/core$unchecked_add__inliner__6616?
?1
const__478??	?clojure/core$unchecked_add?
?1
const__479?	?
const__480??	?dReturns the difference of x and y, both int.
  Note - uses a primitive operator subject to overflow.?2clojure/core$unchecked_subtract_int__inliner__6619?
?1
const__481??	?#clojure/core$unchecked_subtract_int?
?1
const__482?	?
const__483??	?eReturns the difference of x and y, both long.
  Note - uses a primitive operator subject to overflow.?.clojure/core$unchecked_subtract__inliner__6622?
?1
const__484?	clojure/core$unchecked_subtract
1
const__485	
const__486
?	aReturns the product of x and y, both int.
  Note - uses a primitive operator subject to overflow.
2clojure/core$unchecked_multiply_int__inliner__6625
1
const__487?	#clojure/core$unchecked_multiply_int
1
const__488	
const__489?	bReturns the product of x and y, both long.
  Note - uses a primitive operator subject to overflow..clojure/core$unchecked_multiply__inliner__6628 
!1
const__490#?	$clojure/core$unchecked_multiply&
'1
const__491)	*
const__492,?	-cReturns the division of x by y, both int.
  Note - uses a primitive operator subject to truncation./0clojure/core$unchecked_divide_int__inliner__66311
21
const__4934?	5!clojure/core$unchecked_divide_int7
81
const__494:	;
const__495=?	>pReturns the remainder of division of x by y, both int.
  Note - uses a primitive operator subject to truncation.@3clojure/core$unchecked_remainder_int__inliner__6634B
C1
const__496E?	F$clojure/core$unchecked_remainder_intH
I1
const__497K	L
const__498N?	O4Returns true if num is greater than zero, else falseQ&clojure/core$pos_QMARK___inliner__6637S
T1
const__499V?	Wclojure/core$pos_QMARK_Y
Z1
const__500\	]
const__501_?	`1Returns true if num is less than zero, else falseb&clojure/core$neg_QMARK___inliner__6640d
e1
const__502g?	hclojure/core$neg_QMARK_j
k1
const__503m	n
const__504p?	q0quot[ient] of dividing numerator by denominator.s clojure/core$quot__inliner__6643u
v1
const__505x?	yclojure/core$quot{
|1
const__506~	
const__507??	?/remainder of dividing numerator by denominator.?clojure/core$rem__inliner__6646?
?1
const__508??	?clojure/core$rem?
?1
const__509?	?
const__512?	?clojure/core$rationalize?
?1
const__513?	?
const__514??	?Bitwise complement?#clojure/core$bit_not__inliner__6650?
?1
const__515??	?clojure/core$bit_not?
?1
const__516?	?
const__517??	?Bitwise and?
const__518?	?
const__519??	?clojure/core$bit_and?
?1
const__520?	?
const__521??	?
Bitwise or?
const__522?	?
const__523??	?clojure/core$bit_or?
?1
const__524?	?
const__525??	?Bitwise exclusive or?
const__526?	?
const__527??	?clojure/core$bit_xor?
?1
const__528?	?
const__529??	?Bitwise and with complement?
const__530?	?
const__531??	?clojure/core$bit_and_not?
?1
const__532?	?
const__535?	?clojure/core$bit_clear?
?1
const__536?	?
const__539?	?clojure/core$bit_set?
?1
const__540?	
const__543	clojure/core$bit_flip
1
const__544		
const__547	clojure/core$bit_test
1
const__548	
const__549?	Bitwise shift left*clojure/core$bit_shift_left__inliner__6661
1
const__550?	clojure/core$bit_shift_left
 1
const__551"	#
const__552%?	&Bitwise shift right(+clojure/core$bit_shift_right__inliner__6664*
+1
const__553-?	.clojure/core$bit_shift_right0
11
const__5543	4
const__5556?	7,Bitwise shift right, without sign-extension.94clojure/core$unsigned_bit_shift_right__inliner__6667;
<11.6>
const__556@?	A%clojure/core$unsigned_bit_shift_rightC
D1
const__557F	G
const__560I	Jclojure/core$integer_QMARK_L
M1
const__561O	P
const__564R	Sclojure/core$even_QMARK_U
V1
const__565X	Y
const__568[	\clojure/core$odd_QMARK_^
_1
const__569a	b
const__572d	eclojure/core$int_QMARK_g
h1
const__573j	k
const__576m	nclojure/core$pos_int_QMARK_p
q1
const__577s	t
const__580v	wclojure/core$neg_int_QMARK_y
z1
const__581|	}
const__584	?clojure/core$nat_int_QMARK_?
?1
const__585?	?
const__588?	?clojure/core$double_QMARK_?
?1
const__589?	?
const__592?	?clojure/core$bigdec_QMARK_?
?1
const__593?	?
const__596?	?clojure/core$complement?
?1
const__597?	?
const__600?	?clojure/core$constantly?
?1
const__601?	?
const__604?	?clojure/core$identity?
?1
const__605?	?
const__608?	?clojure/core$peek?
?1
const__609?	?
const__612?	?clojure/core$pop?
?1
const__613?	?
const__616?	?clojure/core$map_entry_QMARK_?
?1
const__617?	?
const__620?	?clojure/core$contains_QMARK_?
?1
const__621?	?
const__622??	?EReturns the value mapped to key, not-found or nil if key not present.?clojure/core$get__inliner__6701?
?1
const__623?	?
const__624??	?clojure/core$get?
?1
const__625?	?
const__628?	?clojure/core$dissoc?
?1
const__629?	?
const__632?	?clojure/core$disj?
?1
const__633?	?
const__636?	clojure/core$find
1
const__637	
const__640		clojure/core$select_keys
1
const__641	
const__644	clojure/core$keys
1
const__645	
const__648	clojure/core$vals
1
const__649 	!
const__652#	$clojure/core$key&
'1
const__653)	*
const__656,	-clojure/core$val/
01
const__6572	3
const__6605	6clojure/core$rseq8
91
const__661;	<
const__664>	?clojure/core$nameA
B1
const__665D	E
const__668G	Hclojure/core$namespaceJ
K1
const__669M	N
const__672P	Qclojure/core$ident_QMARK_S
T1
const__673V	W
const__676Y	Z clojure/core$simple_ident_QMARK_\
]1
const__677_	`
const__680b	c#clojure/core$qualified_ident_QMARK_e
f1
const__681h	i
const__684k	l!clojure/core$simple_symbol_QMARK_n
o1
const__685q	r
const__688t	u$clojure/core$qualified_symbol_QMARK_w
x1
const__689z	{
const__692}	~"clojure/core$simple_keyword_QMARK_?
?1
const__693?	?
const__696?	?%clojure/core$qualified_keyword_QMARK_?
?1
const__697?	?
const__700?	?clojure/core$locking?
?1
const__701?	?
const__704?	?clojure/core$_DOT__DOT_?
?1
const__705?	?
const__708?	?clojure/core$__GT_?
?1
const__709?	?
const__712?	?clojure/core$__GT__GT_?
?1
const__713?	?
const__715?	?
const__716?	?
const__719?	? clojure/core$check_valid_options?
?1
const__720?	?
const__722?	?
const__723?	?
const__726?	?clojure/core$defmulti?
?1
const__727?	?
const__730?	?clojure/core$defmethod?
?1
const__731?	?
const__734?	?clojure/core$remove_all_methods?
?1
const__735?	?
const__738?	?clojure/core$remove_method?
?1
const__739?	?
const__742?	?clojure/core$prefer_method?
?1
const__743?	?
const__746?	?clojure/core$methods?
?1
const__747?	?
const__750?	?clojure/core$get_method	
	1
const__751			
const__754			clojure/core$prefers	

	1
const__755	
		
const__758			clojure/core$assert_args	
	1
const__759			
const__762			clojure/core$if_let	
	1
const__763			 
const__766	"		#clojure/core$when_let	%
	&1
const__767	(		)
const__770	+		,clojure/core$if_some	.
	/1
const__771	1		2
const__774	4		5clojure/core$when_some	7
	81
const__775	:		;
const__778	=		>!clojure/core$push_thread_bindings	@
	A1
const__779	C		D
const__782	F		G clojure/core$pop_thread_bindings	I
	J1
const__783	L		M
const__786	O		P clojure/core$get_thread_bindings	R
	S1
const__787	U		V
const__790	X		Yclojure/core$binding	[
	\1
const__791	^		_
const__794	a		b clojure/core$with_bindings_STAR_	d
	e1
const__795	g		h
const__798	j		kclojure/core$with_bindings	m
	n1
const__799	p		q
const__802	s		tclojure/core$bound_fn_STAR_	v
	w1
const__803	y		z
const__806	|		}clojure/core$bound_fn	
	?1
const__807	?		?
const__810	?		?clojure/core$find_var	?
	?1
const__811	?		?
const__814	?		? clojure/core$binding_conveyor_fn	?
	?1
const__815	?		?
const__818	?		?clojure/core$setup_reference	?
	?1
const__819	?		?
const__822	?		?clojure/core$agent	?
	?1
const__823	?		?
const__826	?		?*clojure/core$set_agent_send_executor_BANG_	?
	?1
const__827	?		?
const__830	?		?.clojure/core$set_agent_send_off_executor_BANG_	?
	?1
const__831	?		?
const__834	?		?clojure/core$send_via	?
	?1
const__835	?		?
const__838	?		?clojure/core$send	?
	?1
const__839	?		?
const__842	?		?clojure/core$send_off	?
	?1
const__843	?		?
const__846	?		?"clojure/core$release_pending_sends	?
	?1
const__847	?		?
const__850	?		?clojure/core$add_watch	?
	?1
const__851	?		?
const__854	?		?clojure/core$remove_watch	?
	?1
const__855	?		?
const__858	?		?clojure/core$agent_error	?
	?1
const__859	?		?
const__862	?		?clojure/core$restart_agent	?
	?1
const__863
	

const__866
	
$clojure/core$set_error_handler_BANG_


1
const__867
		


const__870
	

clojure/core$error_handler


1
const__871
	

const__874
	
!clojure/core$set_error_mode_BANG_


1
const__875
	

const__878
	
clojure/core$error_mode
!

"1
const__879
$	
%
const__883
'	
(clojure/core$agent_errors
*

+1
const__884
-	
.
const__887
0	
1clojure/core$clear_agent_errors
3

41
const__888
6	
7
const__891
9	
:clojure/core$shutdown_agents
<

=1
const__892
?	
@
const__895
B	
Cclojure/core$ref
E

F1
const__896
H	
I
const__899
K	
Lclojure/core$deref_future
N

O1
const__900
Q	
R
const__903
T	
Uclojure/core$deref
W

X1
const__904
Z	
[
const__907
]	
^clojure/core$atom
`

a1
const__908
c	
d
const__911
f	
gclojure/core$swap_BANG_
i

j1
const__912
l	
m
const__915
o	
p"clojure/core$compare_and_set_BANG_
r

s1
const__916
u	
v
const__919
x	
yclojure/core$reset_BANG_
{

|1
const__920
~	

const__923
?	
? clojure/core$set_validator_BANG_
?

?1
const__924
?	
?
const__927
?	
?clojure/core$get_validator
?

?1
const__928
?	
?
const__931
?	
?clojure/core$alter_meta_BANG_
?

?1
const__932
?	
?
const__935
?	
?clojure/core$reset_meta_BANG_
?

?1
const__936
?	
?
const__939
?	
?clojure/core$commute
?

?1
const__940
?	
?
const__943
?	
?clojure/core$alter
?

?1
const__944
?	
?
const__947
?	
?clojure/core$ref_set
?

?1
const__948
?	
?
const__951
?	
?clojure/core$ref_history_count
?

?1
const__952
?	
?
const__955
?	
?clojure/core$ref_min_history
?

?1
const__956
?	
?
const__959
?	
?clojure/core$ref_max_history
?

?1
const__960
?	
?
const__963
?	
?clojure/core$ensure
?

?1
const__964
?	
?
const__967
?	
?clojure/core$sync
?

?1
const__968
?	
?
const__971
?	
?clojure/core$io_BANG_
?

?1
const__972
?	
?
const__976
?	
?clojure/core$volatile_BANG_
?

?1
const__977
?	
?
const__980
?	clojure/core$vreset_BANG_
1
const__981	
const__984		clojure/core$vswap_BANG_
1
const__985	
const__988	clojure/core$volatile_QMARK_
1
const__989	
const__992	clojure/core$comp
1
const__993 	!
const__996#	$clojure/core$juxt&
'1
const__997)	*const__1000,	-clojure/core$partial/
01const__10012	3const__10045	6clojure/core$sequence8
91const__1005;	<const__1008>	?clojure/core$every_QMARK_A
B1const__1009D	Econst__1012G	Hconst__1013J	Kconst__1016M	Nclojure/core$someP
Q1const__1017S	Tconst__1020V	Wconst__1021Y	Zconst__1024\	]clojure/core$dotimes_
`1const__1027b	cclojure/core$mape
f1const__1028h	iconst__1031k	lclojure/core$declaren
o1const__1032q	rconst__1035t	uconst__1036w	xconst__1039z	{clojure/core$mapcat}
~1const__1040?	?const__1043?	?clojure/core$filter?
?1const__1044?	?const__1047?	?clojure/core$remove?
?1const__1048?	?const__1051?	?clojure/core$reduced?
?1const__1052?	?const__1053??	?4Returns true if x is the result of a call to reduced?*clojure/core$reduced_QMARK___inliner__6915?
?1const__1055?	?1.5?const__1056??	?clojure/core$reduced_QMARK_?
?1const__1057?	?const__1060?	?clojure/core$ensure_reduced?
?1const__1061?	?const__1064?	?clojure/core$unreduced?
?1const__1065?	?const__1068?	?clojure/core$take?
?1const__1069?	?const__1072?	?clojure/core$take_while?
?1const__1073?	?const__1076?	?clojure/core$drop?
?1const__1077?	?const__1080?	?clojure/core$drop_last?
?1const__1081?	?const__1084?	?clojure/core$take_last?
?1const__1085?	?const__1088?	?clojure/core$drop_while?
?1const__1089?	?const__1092?	?clojure/core$cycle?
1const__1093	const__1096	clojure/core$split_at
	1const__1097	const__1100	clojure/core$split_with
1const__1101	const__1104	clojure/core$repeat
1const__1105	const__1108 	!clojure/core$replicate#
$1const__1109&	'const__1112)	*clojure/core$iterate,
-1const__1113/	0const__11162	3clojure/core$range5
61const__11178	9const__1120;	<clojure/core$merge>
?1const__1121A	Bconst__1124D	Eclojure/core$merge_withG
H1const__1125J	Kconst__1128M	Nclojure/core$zipmapP
Q1const__1129S	Tconst__1132V	Wclojure/core$line_seqY
Z1const__1133\	]const__1136_	`clojure/core$comparatorb
c1const__1137e	fconst__1140h	iclojure/core$sortk
l1const__1141n	oconst__1144q	rclojure/core$sort_byt
u1const__1145w	xconst__1148z	{clojure/core$dorun}
~1const__1149?	?const__1152?	?clojure/core$doall?
?1const__1153?	?const__1156?	?clojure/core$nthnext?
?1const__1157?	?const__1160?	?clojure/core$nthrest?
?1const__1161?	?const__1164?	?clojure/core$partition?
?1const__1165?	?const__1168?	?clojure/core$eval?
?1const__1169?	?const__1172?	?clojure/core$doseq?
?1const__1173?	?const__1176?	?clojure/core$await?
?1const__1177?	?const__1180?	?clojure/core$await1?
?1const__1181?	?const__1184?	?clojure/core$await_for?
?1const__1187?	?const__1188?	?const__1191?	?clojure/core$transient?
?1const__1192?	?const__1195?	?clojure/core$persistent_BANG_?
?1const__1196?	?const__1199?	?clojure/core$conj_BANG_?
?1const__1200?	?const__1203?	?clojure/core$assoc_BANG_?
?1const__1204?	?const__1207?	?clojure/core$dissoc_BANG_?
?1const__1208
	
const__1211
	
clojure/core$pop_BANG_


1const__1212
	
const__1215

	
clojure/core$disj_BANG_


1const__1216
	
const__1219
	
clojure/core$into1


1const__1220
	
const__1223
	
 clojure/core$import
"

#1const__1224
%	
&const__1227
(	
)clojure/core$into_array
+

,1const__1228
.	
/const__1231
1	
2clojure/core$array
4

51const__1232
7	
8const__1235
:	
;clojure/core$class
=

>1const__1236
@	
Aconst__1239
C	
Dclojure/core$type
F

G1const__1240
I	
Jconst__1241
L?	
MCoerce to Number
Oconst__1242
Q?	
Rclojure/core$num__inliner__7064
T

U1const__1243
W?	
Xclojure/core$num
Z

[1const__1244
]	
^const__1245
`?	
aCoerce to long
c clojure/core$long__inliner__7067
e

f1const__1246
h?	
iclojure/core$long
k

l1const__1247
n	
oconst__1248
q?	
rCoerce to float
t!clojure/core$float__inliner__7070
v

w1const__1249
y?	
zclojure/core$float
|

}1const__1250
	
?const__1251
??	
?Coerce to double
?"clojure/core$double__inliner__7073
?

?1const__1252
??	
?clojure/core$double
?

?1const__1253
?	
?const__1254
??	
?Coerce to short
?!clojure/core$short__inliner__7076
?

?1const__1255
??	
?clojure/core$short
?

?1const__1256
?	
?const__1257
??	
?Coerce to byte
? clojure/core$byte__inliner__7079
?

?1const__1258
??	
?clojure/core$byte
?

?1const__1259
?	
?const__1260
??	
?Coerce to char
? clojure/core$char__inliner__7082
?

?11.1
?const__1261
??	
?clojure/core$char
?

?1const__1262
?	
?const__1263
??	
?Coerce to boolean
?#clojure/core$boolean__inliner__7085
?

?1const__1264
??	
?clojure/core$boolean
?

?1const__1265
?	
?const__1266
??	
?2Coerce to byte. Subject to rounding or truncation.
?*clojure/core$unchecked_byte__inliner__7088
?

?11.3
?const__1267
??	
?clojure/core$unchecked_byte
?

?1const__1268
?	
?const__1269
??	
?3Coerce to short. Subject to rounding or truncation.
?+clojure/core$unchecked_short__inliner__7091
?

?1const__1270
??	
?clojure/core$unchecked_short
?

?1const__1271
?	
?const__1272
??	
?2Coerce to char. Subject to rounding or truncation.*clojure/core$unchecked_char__inliner__7094
1const__1273?	clojure/core$unchecked_char
	1const__1274	const__1275?	1Coerce to int. Subject to rounding or truncation.)clojure/core$unchecked_int__inliner__7097
1const__1276?	clojure/core$unchecked_int
1const__1277	const__1278?	 2Coerce to long. Subject to rounding or truncation."*clojure/core$unchecked_long__inliner__7100$
%1const__1279'?	(clojure/core$unchecked_long*
+1const__1280-	.const__12810?	1%Coerce to float. Subject to rounding.3+clojure/core$unchecked_float__inliner__71035
61const__12828?	9clojure/core$unchecked_float;
<1const__1283>	?const__1284A?	B&Coerce to double. Subject to rounding.D,clojure/core$unchecked_double__inliner__7106F
G1const__1285I?	Jclojure/core$unchecked_doubleL
M1const__1286O	Pconst__1289R	Sclojure/core$number_QMARK_U
V1const__1290X	Yconst__1293[	\clojure/core$mod^
_1const__1294a	bconst__1297d	eclojure/core$ratio_QMARK_g
h1const__1298j	kconst__1302m	nclojure/core$numeratorp
q1const__1303s	tconst__1306v	wclojure/core$denominatory
z1const__1307|	}const__1310	?clojure/core$decimal_QMARK_?
?1const__1311?	?const__1314?	?clojure/core$float_QMARK_?
?1const__1315?	?const__1318?	?clojure/core$rational_QMARK_?
?1const__1319?	?const__1323?	?clojure/core$bigint?
?1const__1324?	?const__1327?	?clojure/core$biginteger?
?1const__1328?	?const__1332?	?clojure/core$bigdec?
?1const__1333?	?const__1335?	?FALSE??	??clojure/core$fn__7124?
?1clojure/core$fn__7130?
?1const__1336?	?const__1339?	?clojure/core$pr_on?
?1const__1340?	?const__1343?	?clojure/core$pr?
?1const__1344?	?const__1346?	?line.separator?java/lang/String?java/lang/System?getProperty&(Ljava/lang/String;)Ljava/lang/String;??
??const__1347?	?const__1350?	?clojure/core$newline?
?1const__1351?	?const__1354?	?clojure/core$flush?
?1const__1355?	?const__1358?	?clojure/core$prn?
?1const__1359?	?const__1362	clojure/core$print
1const__1363	const__1366
	clojure/core$println
1const__1367	const__1370	clojure/core$read
1const__1371	const__1374	clojure/core$read_line
 1const__1375"	#const__1378%	&clojure/core$read_string(
)1const__1379+	,const__1382.	/clojure/core$subvec1
21const__13834	5const__13867	8clojure/core$with_open:
;1const__1387=	>const__1390@	Aclojure/core$dotoC
D1const__1391F	Gconst__1394I	Jclojure/core$memfnL
M1const__1395O	Pconst__1398R	Sclojure/core$timeU
V1
CURRENT_NSX	Yderef[
\java.lang.reflect.Array^classForNameNonLoading%(Ljava/lang/String;)Ljava/lang/Class;`a
bimportClass$(Ljava/lang/Class;)Ljava/lang/Class;de
fconst__1399h	iconst__1400k?	lEReturns the length of the Java array. Works on arrays of all
  types.n#clojure/core$alength__inliner__7156p
q1const__1401s?	tclojure/core$alengthv
w1const__1402y	zconst__1403|?	}DReturns a clone of the Java array. Works on arrays of known
  types."clojure/core$aclone__inliner__7159?
?1const__1404??	?clojure/core$aclone?
?1const__1405?	?const__1406??	?LReturns the value at the index/indices. Works on Java arrays of all
  types.? clojure/core$aget__inliner__7162?
?1const__1407?	?const__1408??	?clojure/core$aget?
?1const__1409?	?const__1410??	?\Sets the value at the index/indices. Works on Java arrays of
  reference types. Returns val.? clojure/core$aset__inliner__7165?
?1const__1411?	?const__1412??	?clojure/core$aset?
?1const__1413?	?const__1416?	?clojure/core$def_aset?
?1const__1417?	?const__1420?	?clojure/core$aset_int?
?1const__1421?	?const__1424?	?clojure/core$aset_long?
?1const__1425?	?const__1428?	?clojure/core$aset_boolean?
?1const__1429?	?const__1432?	?clojure/core$aset_float?
?1const__1433?	?const__1436?	?clojure/core$aset_double?
?1const__1437?	?const__1440?	?clojure/core$aset_short?
?1const__1441?	?const__1444?	?clojure/core$aset_byte?
?1const__1445?	?const__1448?	?clojure/core$aset_char
1const__1449	const__1452	clojure/core$make_array	

1const__1453	
const__1456	clojure/core$to_array_2d
1const__1457	const__1460	clojure/core$macroexpand_1
1const__1461	const__1464!	"clojure/core$macroexpand$
%1const__1465'	(const__1468*	+clojure/core$create_struct-
.1const__14690	1const__14723	4clojure/core$defstruct6
71const__14739	:const__1476<	=clojure/core$struct_map?
@1const__1477B	Cconst__1480E	Fclojure/core$structH
I1const__1481K	Lconst__1484N	Oclojure/core$accessorQ
R1const__1485T	Uconst__1488W	Xclojure/core$load_readerZ
[1const__1489]	^const__1492`	aclojure/core$load_stringc
d1const__1493f	gconst__1496i	jclojure/core$set_QMARK_l
m1const__1497o	pconst__1500r	sclojure/core$setu
v1const__1501x	yconst__1504{	|clojure/core$filter_key~
1const__1505?	?const__1508?	?clojure/core$find_ns?
?1const__1509?	?const__1512?	?clojure/core$create_ns?
?1const__1513?	?const__1516?	?clojure/core$remove_ns?
?1const__1517?	?const__1520?	?clojure/core$all_ns?
?1const__1521?	?const__1524?	?clojure/core$the_ns?
?1const__1525?	?const__1528?	?clojure/core$ns_name?
?1const__1529?	?const__1532?	?clojure/core$ns_map?
?1const__1533?	?const__1536?	?clojure/core$ns_unmap?
?1const__1537?	?const__1540?	?clojure/core$ns_publics?
?1const__1541?	?const__1544?	?clojure/core$ns_imports?
?1const__1545?	?const__1548?	?clojure/core$ns_interns?
?1const__1549?	?const__1552?	?clojure/core$refer?
?1const__1553?	?const__1556?	?clojure/core$ns_refers?
?1const__1557?	?const__1560?	?clojure/core$alias?
?1const__1561?	const__1564	clojure/core$ns_aliases
1const__1565		const__1568	clojure/core$ns_unalias
1const__1569	const__1572	clojure/core$take_nth
1const__1573	const__1576	clojure/core$interleave 
!1const__1577#	$const__1580&	'clojure/core$var_get)
*1const__1581,	-const__1584/	0clojure/core$var_set2
31const__15855	6const__15888	9clojure/core$with_local_vars;
<1const__1589>	?const__1592A	Bclojure/core$ns_resolveD
E1const__1593G	Hconst__1596J	Kclojure/core$resolveM
N1const__1597P	Qconst__1600S	Tclojure/core$array_mapV
W1const__1601Y	Zconst__1604\	]clojure/core$destructure_
`1const__1610b	cclojure/core$lete
f1const__1611h	iconst__1614k	lclojure/core$maybe_destructuredn
o1const__1618q	rclojure/core$fnt
u1const__1622w	xclojure/core$loopz
{1const__1623}	~const__1626?	?clojure/core$when_first?
?1const__1627?	?const__1630?	?clojure/core$lazy_cat?
?1const__1631?	?const__1634?	?clojure/core$for?
?1const__1635?	?const__1638?	?clojure/core$comment?
?1const__1639?	?const__1642?	?clojure/core$with_out_str?
?1const__1643?	?const__1646?	?clojure/core$with_in_str?
?1const__1647?	?const__1650?	?clojure/core$pr_str?
?1const__1651?	?const__1654?	?clojure/core$prn_str?
?1const__1655?	?const__1658?	?clojure/core$print_str?
?1const__1659?	?const__1662?	?clojure/core$println_str?
?1clojure.lang.ExceptionInfo?clojure.lang.IExceptionInfo?const__1663?	?const__1666?	?clojure/core$ex_info?
?1const__1667?	?const__1670?	?clojure/core$ex_data?
?1const__1671?	?const__1674?	?clojure/core$assert?
?1const__1675?	?const__1678?	?clojure/core$test?
?1const__1679?	const__1683	clojure/core$re_pattern
1const__1684		const__1688	clojure/core$re_matcher
1const__1689	const__1692	clojure/core$re_groups
1const__1693	const__1696	clojure/core$re_seq 
!1const__1697#	$const__1700&	'clojure/core$re_matches)
*1const__1701,	-const__1704/	0clojure/core$re_find2
31const__17055	6const__17088	9clojure/core$rand;
<1const__1709>	?const__1712A	Bclojure/core$rand_intD
E1const__1713G	Hconst__1716J	Kclojure/core$defn_M
N1const__1717P	Qconst__1720S	Tclojure/core$tree_seqV
W1const__1721Y	Zconst__1724\	]clojure/core$file_seq_
`1const__1725b	cconst__1728e	fclojure/core$xml_seqh
i1const__1729k	lconst__1732n	o"clojure/core$special_symbol_QMARK_q
r1const__1733t	uconst__1736w	xclojure/core$var_QMARK_z
{1const__1737}	~const__1740?	?clojure/core$subs?
?1const__1741?	?const__1744?	?clojure/core$max_key?
?1const__1745?	?const__1748?	?clojure/core$min_key?
?1const__1749?	?const__1752?	?clojure/core$distinct?
?1const__1753?	?const__1756?	?clojure/core$replace?
?1const__1757?	?const__1760?	?clojure/core$dosync?
?1const__1761?	?const__1764?	?clojure/core$with_precision?
?1const__1765?	?const__1768?	?clojure/core$mk_bound_fn?
?1const__1769?	?const__1772?	?clojure/core$subseq?
?1const__1773?	?const__1776?	?clojure/core$rsubseq?
?1const__1777?	?const__1780?	?clojure/core$repeatedly?
?1const__1781?	?const__1784?	?clojure/core$add_classpath?
?1const__1785?	?const__1788?	?clojure/core$hash?
?1const__1789?	?const__1792?	? clojure/core$mix_collection_hash?
?1const__1793?	?const__1796?	?clojure/core$hash_ordered_coll
1const__1797	const__1800	 clojure/core$hash_unordered_coll

1const__1801
	const__1804	clojure/core$interpose
1const__1805	const__1808	clojure/core$definline
1const__1809	 const__1812"	#clojure/core$empty%
&1const__1813(	)const__1816+	,clojure/core$amap.
/1const__18171	2const__18204	5clojure/core$areduce7
81const__1821:	;const__1822=?	>Creates an array of floats@'clojure/core$float_array__inliner__7501B
C1const__1823E	Fconst__1824H?	Iclojure/core$float_arrayK
L1const__1825N	Oconst__1826Q?	RCreates an array of booleansT)clojure/core$boolean_array__inliner__7504V
W1const__1827Y	Zconst__1828\?	]clojure/core$boolean_array_
`1const__1829b	cconst__1830e?	fCreates an array of bytesh&clojure/core$byte_array__inliner__7507j
k1const__1831m	nconst__1832p?	qclojure/core$byte_arrays
t1const__1833v	wconst__1834y?	zCreates an array of chars|&clojure/core$char_array__inliner__7510~
1const__1835?	?const__1836??	?clojure/core$char_array?
?1const__1837?	?const__1838??	?Creates an array of shorts?'clojure/core$short_array__inliner__7513?
?1const__1839?	?const__1840??	?clojure/core$short_array?
?1const__1841?	?const__1842??	?Creates an array of doubles?(clojure/core$double_array__inliner__7516?
?1const__1843?	?const__1844??	?clojure/core$double_array?
?1const__1845?	?const__1846??	?Creates an array of objects?(clojure/core$object_array__inliner__7519?
?1const__1847?	?const__1848??	?clojure/core$object_array?
?1const__1849?	?const__1850??	?Creates an array of ints?%clojure/core$int_array__inliner__7522?
?1const__1851?	?const__1852??	?clojure/core$int_array?
?1const__1853?	?const__1854??	?Creates an array of longs?&clojure/core$long_array__inliner__7525?
?1const__1855?	?const__1856??	?clojure/core$long_array?
?1const__1857?	?const__1860?	?clojure/core$booleans?
?1clojure/core$booleans__7533?
?1\(Ljava/lang/Object;Ljava/lang/Object;Ljava/lang/Object;Ljava/lang/Object;)Ljava/lang/Object;??const__1861?	?const__1864	clojure/core$bytes
1clojure/core$bytes__7540
1const__1865		
const__1868	
clojure/core$chars
1clojure/core$chars__7547
1const__1869	const__1872	clojure/core$shorts
1clojure/core$shorts__7554
1const__1873!	"const__1876$	%clojure/core$floats'
(1clojure/core$floats__7561*
+1const__1877-	.const__18800	1clojure/core$ints3
41clojure/core$ints__75686
71const__18819	:const__1884<	=clojure/core$doubles?
@1clojure/core$doubles__7575B
C1const__1885E	Fconst__1888H	Iclojure/core$longsK
L1clojure/core$longs__7582N
O1const__1889Q	Rconst__1892T	Uclojure/core$bytes_QMARK_W
X1"java.util.concurrent.BlockingQueueZ(java.util.concurrent.LinkedBlockingQueue\const__1893^	_const__1896a	bclojure/core$sequed
e1const__1897g	hconst__1900j	kclojure/core$class_QMARK_m
n1const__1901p	qconst__1904s	t!clojure/core$is_annotation_QMARK_v
w1const__1905y	zconst__1908|	})clojure/core$is_runtime_annotation_QMARK_
?1const__1909?	?const__1912?	?clojure/core$descriptor?
?1const__1913?	?const__1915?	?const__1916?	?const__1919?	?clojure/core$add_annotation?
?1const__1922?	?clojure/core$process_annotation?
?1const__1923?	?const__1926?	?clojure/core$add_annotations?
?1const__1927?	?const__1930?	?clojure/core$alter_var_root?
?1const__1931?	?const__1934?	?clojure/core$bound_QMARK_?
?1const__1935?	?const__1938?	? clojure/core$thread_bound_QMARK_?
?1const__1939?	?const__1942?	?clojure/core$make_hierarchy?
?1const__1944?	?const__1945?	?const__1948?	?clojure/core$not_empty?
?1const__1949?	?const__1952?	?clojure/core$bases?
?1const__1953?	?const__1956?	?clojure/core$supers?
?1const__1957?	?const__1960?	?clojure/core$isa_QMARK_?
?1const__1961?	?const__1964?	?clojure/core$parents?
?1const__1965?	?const__1968	clojure/core$ancestors
1const__1969	const__1972		
clojure/core$descendants

1const__1973	const__1976	clojure/core$derive
1const__1977	const__1979	const__1980	const__1983!	"clojure/core$underive$
%1const__1984'	(const__1987*	+clojure/core$distinct_QMARK_-
.1const__19880	1const__19913	4clojure/core$resultset_seq6
71const__19929	:const__1995<	=clojure/core$iterator_seq?
@1const__1996B	Cconst__1999E	Fclojure/core$enumeration_seqH
I1const__2000K	Lconst__2003N	Oclojure/core$formatQ
R1const__2004T	Uconst__2007W	Xclojure/core$printfZ
[1const__2008]	^const__2010`	aconst__2011c	dconst__2014f	g!clojure/core$with_loading_contexti
j1const__2015l	mconst__2018o	pclojure/core$nsr
s1const__2019u	vconst__2022x	yclojure/core$refer_clojure{
|1const__2023~	const__2026?	?clojure/core$defonce?
?1clojure/core$fn__7757?
?1clojure/core$fn__7760?
?1clojure/core$fn__7763?
?1const__2027?	?const__2030?	?clojure/core$throw_if?
?1const__2031?	?const__2034?	?clojure/core$libspec_QMARK_?
?1const__2035?	?const__2038?	?clojure/core$prependss?
?1const__2039?	?const__2042?	?clojure/core$root_resource?
?1const__2043?	?const__2046?	?clojure/core$root_directory?
?1const__2047?	?const__2050?	?const__2051?	?const__2054?	?clojure/core$load_one?
?1const__2055?	?const__2058?	?clojure/core$load_all?
?1const__2059?	?const__2062?	?clojure/core$load_lib?
?1const__2063?	?const__2066?	?clojure/core$load_libs?
?1const__2067?	?const__2070?	?$clojure/core$check_cyclic_dependency?
?1const__2071?	?const__2074?	?clojure/core$require?
?1const__2075?	?const__2078?	?clojure/core$use?
1const__2079	const__2082	clojure/core$loaded_libs
	1const__2085	clojure/core$load
1const__2086	const__2089	clojure/core$compile
1const__2090	const__2093	clojure/core$get_in 
!1const__2094#	$const__2097&	'clojure/core$assoc_in)
*1const__2098,	-const__2101/	0clojure/core$update_in2
31const__21025	6const__21058	9clojure/core$update;
<1const__2106>	?const__2109A	Bclojure/core$empty_QMARK_D
E1const__2110G	Hconst__2113J	Kclojure/core$coll_QMARK_M
N1const__2114P	Qconst__2117S	Tclojure/core$list_QMARK_V
W1const__2118Y	Zconst__2121\	]clojure/core$seqable_QMARK__
`1const__2122b	cconst__2125e	fclojure/core$ifn_QMARK_h
i1const__2126k	lconst__2129n	oclojure/core$fn_QMARK_q
r1const__2130t	uconst__2133w	xclojure/core$associative_QMARK_z
{1const__2134}	~const__2137?	?clojure/core$sequential_QMARK_?
?1const__2138?	?const__2141?	?clojure/core$sorted_QMARK_?
?1const__2142?	?const__2145?	?clojure/core$counted_QMARK_?
?1const__2146?	?const__2149?	?clojure/core$reversible_QMARK_?
?1const__2150?	?const__2153?	?clojure/core$indexed_QMARK_?
?1const__2154?	?const__2156?	?const__2157?	?const__2159?	?const__2160?	?const__2162?	?const__2163?	?const__2165?	?const__2166?	?const__2169?	?clojure/core$trampoline?
?1const__2170?	?const__2173?	?clojure/core$intern?
?1const__2174?	?const__2177?	?clojure/core$while?
?1const__2178?	?const__2181?	?clojure/core$memoize?
?1const__2182?	?const__2185?	?clojure/core$condp?
?1const__2186?	?const__2187?	?const__2188?	?const__2191?	?clojure/core$add_doc_and_meta?
?1const__2192?	?const__2193	xThe path of the file being evaluated, as a String.

  When there is no file, e.g. in the REPL, the value is not defined.J(Ljava/lang/Object;Ljava/lang/Object;Ljava/lang/Object;)Ljava/lang/Object;const__2194		
const__2195	
QA sequence of the supplied command line arguments, or nil if
  none were suppliedconst__2196	const__2197	?When set to true, the compiler will emit warnings when reflection is
  needed to resolve Java method calls or field accesses.

  Defaults to false.const__2198	const__2199	?Specifies the directory where 'compile' will write out .class
  files. This directory must be in the classpath for 'compile' to
  work.

  Defaults to "classes"const__2200!	"const__2201$	%2Set to true when compiling files, false otherwise.'const__2202)	*const__2203,	-?While bound to true, compilations of +, -, *, inc, dec and the
  coercions will be done without overflow checks. While bound
  to :warn-on-boxed, same behavior as true, and a warning is emitted
  when compilation uses boxed math. Default: false./const__22041	2const__22054	58A map of keys to options.
  Note, when binding dynamically make sure to merge with previous value.
  Supported options:
  :elide-meta - a collection of metadata keys to elide during compilation.
  :disable-locals-clearing - set to true to disable clearing, useful for using a debugger
  Alpha, subject to change.7const__22069	:const__2207<	=CA clojure.lang.Namespace object representing the current namespace.?const__2208A	Bconst__2209D	E?A java.io.Reader object representing standard input for read operations.

  Defaults to System/in, wrapped in a LineNumberingPushbackReaderGconst__2210I	Jconst__2211L	M?A java.io.Writer object representing standard output for print operations.

  Defaults to System/out, wrapped in an OutputStreamWriterOconst__2212Q	Rconst__2213T	U}A java.io.Writer object representing standard error for print operations.

  Defaults to System/err, wrapped in a PrintWriterWconst__2214Y	Zconst__2215\	]\When set to true, output will be flushed whenever a newline is printed.

  Defaults to true._const__2216a	bconst__2217d	e?If set to logical true, when printing an object, its metadata will also
  be printed in a form that can be read back by the reader.

  Defaults to false.gconst__2218i	jconst__2219l	m?When set to logical true, objects will be printed in a way that preserves
  their type when read in later.

  Defaults to false.oconst__2220q	rconst__2221t	u?When set to logical false, strings and characters will be printed with
  non-alphanumeric characters converted to the appropriate escape sequences.

  Defaults to truewconst__2222y	zconst__2223|	}eDefaults to true (or value specified by system property, see below)
  ***This setting implies that the full power of the reader is in play,
  including syntax that can cause code to execute. It should never be
  used with untrusted sources. See also: clojure.edn/read.***

  When set to logical false in the thread-local binding,
  the eval reader (#=) and record/type literal syntax are disabled in read/load.
  Example (will fail): (binding [*read-eval* false] (read-string "#=(* 2 21)"))

  The default binding can be controlled by the system property
  'clojure.read.eval' System properties can be set on the command line
  like this:

  java -Dclojure.read.eval=false ...

  The system property can also be set to 'unknown' via
  -Dclojure.read.eval=unknown, in which case the default binding
  is :unknown and all reads will fail in contexts where *read-eval*
  has not been explicitly bound to either true or false. This setting
  can be a useful diagnostic tool to ensure that all of your reads
  occur in considered contexts. You can also accomplish this in a
  particular scope by binding *read-eval* to :unknown
  const__2224?	?const__2227?	?clojure/core$future_QMARK_?
?1const__2228?	?const__2231?	?clojure/core$future_done_QMARK_?
?1const__2232?	?const__2237?	?clojure/core$letfn?
?1const__2238?	?const__2241?	?clojure/core$fnil?
?1const__2242?	?const__2245?	?clojure/core$shift_mask?
?1const__2246?	?const__2248?	?const__2249??	?const__2250?	?const__2252?	?clojure/lang/Numbers?	shiftLeft(JLjava/lang/Object;)J??
??num(J)Ljava/lang/Number;??
??const__2253?	?const__2256?	?clojure/core$maybe_min_hash?
?1const__2257?	?const__2260?	?clojure/core$case_map?
?1const__2261?	?const__2264?	?clojure/core$fits_table_QMARK_?
?1const__2265?	?const__2268?	?clojure/core$prep_ints?
?1const__2269?	?const__2272?	?"clojure/core$merge_hash_collisions?
?1const__2273?	?const__2276?	?clojure/core$prep_hashes?
?1const__2277?	?const__2280	clojure/core$case
1const__2281	+Fundamental library of the Clojure language	
core_proxy
core_print
genclasscore_deftypecore/protocolsgvecinstantclojure/core$fn__9319
1const__2282?	const__2283	 const__2284"	#const__2285Lclojure/lang/ISeq;%&	'const__2289)	*const__2290,?	-const__2291/	0const__22922?	3const__22935?	6const__22958	9const__2296;?	<get>
?const__2297A	Bconst__2298D	Econst__2299G?	Hclojure/core$fn__9322J
K1?(Ljava/lang/Object;Ljava/lang/Object;Ljava/lang/Object;Ljava/lang/Object;Ljava/lang/Object;Ljava/lang/Object;Ljava/lang/Object;Ljava/lang/Object;Ljava/lang/Object;)Ljava/lang/Object;MNconst__2300P	Qconst__2301S	Tconst__2302V	Wconst__2303Y?	Zconst__2294\?	]clojure/core$fn__9333_
`1clojure/core$fn__9335b
c1const__2304e	fconst__2307h	iclojure/core$inst_msk
l1const__2308n	oconst__2311q	rclojure/core$inst_QMARK_t
u1uuidwconst__2312y	zconst__2315|	}clojure/core$uuid_QMARK_
?1const__2316?	?const__2319?	?clojure/core$reduce?
?1const__2320?	?const__2321??	?clojure/core$fn__9350?
?1const__2322??	?clojure/core$fn__9352?
?1const__2323??	?clojure/core$fn__9360?
?1const__2324?	?const__2327?	?clojure/core$reduce_kv?
?1const__2328?	?const__2331?	?clojure/core$completing?
?1const__2332?	?const__2335?	?clojure/core$transduce?
?1const__2336?	?const__2339?	?clojure/core$into?
?1const__2340?	?const__2343?	?clojure/core$mapv?
?1const__2344?	?const__2347?	?clojure/core$filterv?
?1const__2348?	?const__2349?	?const__2352?	?!clojure/core$normalize_slurp_opts?
?1const__2353?	?const__2356?	?clojure/core$slurp?
?1const__2357?	?const__2360?	?clojure/core$spit?
?1const__2361?	?const__2364?	?clojure/core$future_call?
?1const__2365?	?const__2368	clojure/core$future
1const__2369	const__2372		
clojure/core$future_cancel

1const__2373	const__2376	$clojure/core$future_cancelled_QMARK_
1const__2377	const__2380	clojure/core$pmap
1const__2381!	"const__2384$	%clojure/core$pcalls'
(1const__2385*	+const__2388-	.clojure/core$pvalues0
11clojure/core$fn__94163
41const__23896	7const__23909	:The version info for Clojure core, as a map containing :major :minor 
  :incremental and :qualifier keys. Feature releases may increment 
  :minor and/or :major, bugfix releases will increment :incremental. 
  Possible values of :qualifier include "GA", "SNAPSHOT", "RC-x" "BETA-x"<const__2391>	?const__2394A	Bclojure/core$clojure_versionD
E1const__2395G	Hconst__2398J	Kclojure/core$promiseM
N1const__2399P	Qconst__2402S	Tclojure/core$deliverV
W1const__2405Y	Zclojure/core$flatten\
]1const__2406_	`const__2409b	cclojure/core$group_bye
f1const__2410h	iconst__2413k	lclojure/core$partition_byn
o1const__2414q	rconst__2417t	uclojure/core$frequenciesw
x1const__2418z	{const__2421}	~clojure/core$reductions?
?1const__2422?	?const__2425?	?clojure/core$rand_nth?
?1const__2426?	?const__2429?	?clojure/core$partition_all?
?1const__2430?	?const__2433?	?clojure/core$shuffle?
?1const__2434?	?const__2437?	?clojure/core$map_indexed?
?1const__2438?	?const__2441?	?clojure/core$keep?
?1const__2442?	?const__2445?	?clojure/core$keep_indexed?
?1const__2446?	?const__2449?	?clojure/core$bounded_count?
?1const__2450?	?const__2453?	?clojure/core$every_pred?
?1const__2454?	?const__2457?	?clojure/core$some_fn?
?1const__2460?	?const__2461?	?const__2464?	?clojure/core$with_redefs_fn?
?1const__2465?	?const__2468?	?clojure/core$with_redefs?
?1const__2469?	?const__2472?	?clojure/core$realized_QMARK_?
?1const__2473?	?const__2476?	?clojure/core$cond__GT_?
?1const__2477?	?const__2480?	?clojure/core$cond__GT__GT_
1const__2481	const__2484	clojure/core$as__GT_

1const__2485
	const__2488	clojure/core$some__GT_
1const__2489	const__2492	clojure/core$some__GT__GT_
1const__2493	 const__2496"	#clojure/core$preserving_reduced%
&1const__2499(	)clojure/core$cat+
,1const__2500.	/const__25031	2clojure/core$halt_when4
51const__25047	8const__2507:	;clojure/core$dedupe=
>1const__2508@	Aconst__2511C	Dclojure/core$random_sampleF
G1clojure/core$fn__9701I
J1const__2512L	Mconst__2515O	Pclojure/core$eductionR
S1const__2516U	Vclojure/lang/MultiFnXconst__2517Z?	[clojure/core$fn__9707]
^1	addMethod<(Ljava/lang/Object;Lclojure/lang/IFn;)Lclojure/lang/MultiFn;`a
Ybconst__2518d	econst__2521g	hclojure/core$run_BANG_j
k1const__2522m	nconst__2525p	q"clojure/core$tagged_literal_QMARK_s
t1const__2526v	wconst__2529y	zclojure/core$tagged_literal|
}1const__2530	?const__2533?	?&clojure/core$reader_conditional_QMARK_?
?1const__2534?	?const__2537?	?clojure/core$reader_conditional?
?1const__2538?	?const__2540?	?const__2541?	?const__2542?	?const__2543?	?const__2544?	?const__2545?	?const__2547?	?clojure/lang/PersistentArrayMap?EMPTY!Lclojure/lang/PersistentArrayMap;??	??const__2548?	?const__2550?	?const__2551?	?const__2554?	?clojure/core$data_reader_urls?
?1const__2555?	?const__2558?	?clojure/core$data_reader_var?
?1const__2559?	?const__2562?	?"clojure/core$load_data_reader_file?
?1const__2563?	?const__2566?	?clojure/core$load_data_readers?
?1clojure/core$fn__9731?
?1const__2567?	?const__2570?	?clojure/core$uri_QMARK_?
?1__init0clojure.core?in-ns?var8(Ljava/lang/String;Ljava/lang/String;)Lclojure/lang/Var;??
?intern;(Ljava/lang/String;Ljava/lang/String;)Lclojure/lang/Symbol;??
?clojure/lang/IObj?doc?keyword<(Ljava/lang/String;Ljava/lang/String;)Lclojure/lang/Keyword;??
?The core Clojure language.?author?Rich Hickey?map
withMeta2(Lclojure/lang/IPersistentMap;)Lclojure/lang/IObj;?clojure/lang/AFnclojure/lang/Keyword	unquoteline
columnjava/lang/IntegervalueOf(I)Ljava/lang/Integer;
fileunquote-splicinglistarglistsadded&!items#clojure/lang/Tuple%createF(Ljava/lang/Object;Ljava/lang/Object;)Lclojure/lang/IPersistentVector;'(
&)java/util/Arrays+asList%([Ljava/lang/Object;)Ljava/util/List;-.
,/0(Ljava/util/List;)Lclojure/lang/IPersistentList;'1
^2(Creates a new list containing the items.4cons6static8x:seq<GReturns a new seq where x is the first element and seq is
    the rest.>let@macroBloopDfnFfirstHcollJ4(Ljava/lang/Object;)Lclojure/lang/IPersistentVector;'L
&MeReturns the first item in the collection. Calls seq on its
    argument. If coll is nil, returns nil.OnextQtagSclojure.lang.ISeqUclassForNameWa
XrReturns a seq of the items after the first. Calls seq on its
  argument.  If there are no more items, returns nil.Zrest\WReturns a possibly empty seq of the items after the first. Calls seq on its
  argument.^conj`xsbj(Ljava/lang/Object;Ljava/lang/Object;Ljava/lang/Object;Ljava/lang/Object;)Lclojure/lang/IPersistentVector;'d
&e?conj[oin]. Returns a new collection with the xs
    'added'. (conj nil item) returns (item).  The 'addition' may
    happen at different 'places' depending on the concrete type.gsecondiSame as (first (next x))kffirstmSame as (first (first x))onfirstqSame as (next (first x))sfnextunnextwSame as (next (next x))yeReturns a seq on the collection. If the collection is
    empty, returns nil.  (seq nil) returns nil. seq also works on
    Strings, native Java arrays (of reference types) and any objects
    that implement Iterable. Note that seqs cache values, thus seq
    should not be used on any Iterable whose iterator repeatedly
    returns the same mutable object.{	instance?}cClass?TEvaluates x and tests if it is an instance of the class
    c. Returns true or false?seq?? Return true if x implements ISeq?char??Return true if x is a Character?string??Return true if x is a String?map??*Return true if x implements IPersistentMap?vector??__init1-Return true if x implements IPersistentVector?assoc?key?val?X(Ljava/lang/Object;Ljava/lang/Object;Ljava/lang/Object;)Lclojure/lang/IPersistentVector;'?
&?kvs?|(Ljava/lang/Object;Ljava/lang/Object;Ljava/lang/Object;Ljava/lang/Object;Ljava/lang/Object;)Lclojure/lang/IPersistentVector;'?
&?assoc[iate]. When applied to a map, returns a new map of the
    same (hashed/sorted) type, that contains the mapping of key(s) to
    val(s). When applied to a vector, returns a new vector that
    contains val at index. Note - index must be <= (count vector).?meta?obj?AReturns the metadata of obj, returns nil if there is no metadata.?	with-meta?clojure.lang.IObj?m?TReturns an object of the same type and value as obj, with
    map m as its metadata.?assert-valid-fdecl?private?dynamic?sigs?last?,Return the last item in coll, in linear time?butlast?=Return a seq of all but the last item in coll, in linear time?defn?Same as (def name (fn [params* ] exprs*)) or (def
    name (fn ([params* ] exprs*)+)) with any doc-string or attrs added
    to the var metadata. prepost-map defines a map with optional keys
    :pre and :post that contain collections of pre or post conditions.?name?doc-string??	attr-map??params*?prepost-map??body??(Ljava/lang/Object;Ljava/lang/Object;Ljava/lang/Object;Ljava/lang/Object;Ljava/lang/Object;Ljava/lang/Object;)Lclojure/lang/IPersistentVector;'?
&?+?to-array??Returns an array of Objects containing the contents of coll, which
  can be any Collection.  Maps to java.util.Collection.toArray().?[Ljava.lang.Object;?cast? key val
  Returns a new hash map with supplied mappings.  If any keys are
  equal, they are handled as if by repeated uses of assoc.hash-setkeys
hReturns a new hash set with supplied keys.  Any equal keys are
  handled as if by repeated uses of conj.
sorted-map?keyval => key val
  Returns a new sorted map with supplied mappings.  If any keys are
  equal, they are handled as if by repeated uses of assoc.
sorted-map-by
comparator?keyval => key val
  Returns a new sorted map with supplied mappings, using the supplied
  comparator.  If any keys are equal, they are handled as if by
  repeated uses of assoc.
sorted-setjReturns a new sorted set with supplied keys.  Any equal keys are
  handled as if by repeated uses of conj.
sorted-set-by?Returns a new sorted set with supplied keys, using the supplied
  comparator.  Any equal keys are handled as if by repeated uses of
  conj.nil? java.lang.Boolean"inline$defmacro&?Like defn, but the resulting function name is declared as a
  macro and will be used as a macro by the compiler when it is
  called.(when*test,BEvaluates test. If logical true, evaluates body in an implicit do..when-not0CEvaluates test. If logical false, evaluates body in an implicit do.2false?46Returns true if x is the value false, false otherwise.6true?85Returns true if x is the value true, false otherwise.:__init2boolean?=Return true if x is a Boolean?1.9AnotC4Returns true if x is logical false, false otherwise.Esome?G.Returns true if x is not nil, false otherwise.Iany?K Returns true given any argument.MstrOjava.lang.StringQObjectSysU?With no args, returns the empty string. With one arg x, returns
  x.toString().  (str nil) returns the empty string. With more than
  one arg, returns the concatenation of the str values of the args.Wsymbol?YReturn true if x is a Symbol[keyword?]Return true if x is a Keyword_symbolansc3Returns a Symbol with the given namespace and name.eclojure.lang.Symbolggensymi
prefix-stringk?Returns a new symbol with a unique name. If a prefix string is
  supplied, the name is prefix# where # is some unique number. If
  prefix is not supplied, the prefix is 'G__'.mcondoclausesq?Takes a set of test/expr pairs. It evaluates each test one at a
  time.  If a test returns logical true, cond evaluates and returns
  the value of the corresponding expr and doesn't evaluate any of the
  other tests or exprs. (cond) returns nil.s?|Returns a Keyword with the given namespace and name.  Do not use :
  in the keyword strings, it will be added automatically.vclojure.lang.Keywordxfind-keywordzReturns a Keyword with the given namespace and name if one already
  exists.  This function will not intern a new keyword. If the keyword
  has not already been interned, it will return nil.  Do not use :
  in the keyword strings, it will be added automatically.|spread~arglist?list*?more?pCreates a new seq containing the items prepended to the rest, the
  last of which will be treated as a sequence.?apply?clojure.lang.IFn?y?z?UApplies fn f to the argument list formed by prepending intervening arguments to args.?	vary-meta?fReturns an object of the same type and value as obj, with
  (apply f (meta obj) args) as its metadata.?lazy-seq??Takes a body of expressions that returns an ISeq or nil, and yields
  a Seqable object that will invoke the body only the first time seq
  is called, and will cache the result and return it on all subsequent
  seq calls. See also - realized??chunk-buffer?clojure.lang.ChunkBuffer?capacity?chunk-append?chunk?clojure.lang.IChunk?chunk-first?s?clojure.lang.IChunkedSeq?
chunk-rest?
chunk-next?
chunk-cons?__init3chunked-seq??concat?zs?XReturns a lazy seq representing the concatenation of the elements in the supplied colls.?delay??Takes a body of expressions and yields a Delay object that will
  invoke the body only the first time it is forced (with force or deref/@), and
  will cache the result and return it on all subsequent force
  calls. See also - realized??delay??/returns true if x is a Delay created with delay?force?VIf x is a Delay, returns the (possibly cached) value of its expression, else returns x?if-not?then?else?qEvaluates test. If logical false, evaluates and returns then expr, 
  otherwise else expr, if supplied, else nil.?
identical??inline-arities?java/lang/Long?(J)Ljava/lang/Long;?
??clojure/lang/PersistentHashSet?5([Ljava/lang/Object;)Lclojure/lang/PersistentHashSet;'?
??=?not=?Same as (not (= obj1 obj2))?compare?and??Evaluates exprs one at a time, from left to right. If a form
  returns logical false (nil or false), and returns that value and
  doesn't evaluate any of the other expressions, otherwise it returns
  the value of the last expr. (and) returns true.?or??Evaluates exprs one at a time, from left to right. If a form
  returns a logical true value, or returns that value and doesn't
  evaluate any of the other expressions, otherwise it returns the
  value of the last expression. (or) returns nil.?zero??count?int?nth?index?	not-found?<?inc'?increduce1reverse>Returns a seq of the items in coll in reverse order. Not lazy.nary-inline	opunchecked-op
>1?n>0?+'addP__init4add
unchecked_add*'	multiplyP *"multiply$unchecked_multiply&/(divide*-',minusP.-0minus2unchecked_minus4<=6>8>=:==<max>min@dec'BdecDunchecked-inc-intF
unchecked-incHunchecked-dec-intJ
unchecked-decLunchecked-negate-intNunchecked-negatePunchecked-add-intR
unchecked-addTunchecked-subtract-intVunchecked-subtractXunchecked-multiply-intZunchecked-multiply\unchecked-divide-int^unchecked-remainder-int`pos?b__init5neg?equotg?divjremlrationalizen!returns the rational value of numpbit-notrbit-andtbit-orvbit-xorxxorzbit-and-not|andNot~	bit-clear?Clear bit at index n?bit-set?Set bit at index n?bit-flip?Flip bit at index n?bit-test?Test bit at index n?bit-shift-left?bit-shift-right?unsigned-bit-shift-right?integer??Returns true if n is an integer?even??EReturns true if n is even, throws an exception if n is not an integer?odd??DReturns true if n is odd, throws an exception if n is not an integer?int??-Return true if x is a fixed precision integer?pos-int??6Return true if x is a positive fixed precision integer?neg-int??6Return true if x is a negative fixed precision integer?nat-int??:Return true if x is a non-negative fixed precision integer?double??Return true if x is a Double?bigdec?? Return true if x is a BigDecimal?
complement??Takes a fn f and returns a fn that takes the same arguments as f,
  has the same effects, if any, and returns the opposite truth value.?
constantly?__init6DReturns a function that takes any number of arguments and returns x.?identity?Returns its argument.?peek??For a list or queue, same as first, for a vector, same as, but much
  more efficient than, last. If the collection is empty, returns nil.?pop??For a list or queue, returns a new list/queue without the first
  item, for a vector, returns a new vector without the last item. If
  the collection is empty, throws an exception.  Note - not the same
  as next/butlast.?
map-entry??Return true if x is a map entry?1.8?	contains??YReturns true if key is present in the given collection, otherwise
  returns false.  Note that for numerically indexed collections like
  vectors and Java arrays, this tests if the numeric key is within the
  range of indexes. 'contains?' operates constant or logarithmic time;
  it will not perform a linear search for a value.  See also 'some'.?>dissoc?ks?odissoc[iate]. Returns a new map of the same (hashed/sorted) type,
  that does not contain a mapping for key(s).?disj?set?clojure.lang.IPersistentSet?^disj[oin]. Returns a new set of the same (hashed/sorted) type, that
  does not contain key(s).?9Returns the map entry for key, or nil if key not present.?select-keys?keyseq?GReturns a map containing only those entries in map whose key is in keys?EReturns a sequence of the map's keys, in the same order as (seq map).?vals?GReturns a sequence of the map's values, in the same order as (seq map).?java.util.Map$Entry?!Returns the key of the map entry.?#Returns the value in the map entry.?rseq?rev?clojure.lang.Reversible?Returns, in constant time, a seq of the items in rev (which
  can be a vector or sorted-map), in reverse order. If rev is empty returns nil7Returns the name String of a string, symbol or keyword.	namespaceclojure.lang.Named	KReturns the namespace String of a symbol or keyword, or nil if not present.ident?
'Return true if x is a symbol or keyword
simple-ident?;Return true if x is a symbol or keyword without a namespacequalified-ident?8Return true if x is a symbol or keyword with a namespacesimple-symbol?0Return true if x is a symbol without a namespacequalified-symbol?-Return true if x is a symbol with a namespacesimple-keyword?!1Return true if x is a keyword without a namespace#qualified-keyword?%.Return true if x is a keyword with a namespace'locking)__init7wExecutes exprs in an implicit do, while holding the monitor of x.
  Will release the monitor of x in all circumstances.,...form0oform => fieldName-symbol or (instanceMethodName-symbol args*)

  Expands into a member access (.) of the first member on the first
  argument, followed by the next member on the result, etc. For
  instance:

  (.. System (getProperties) (get "os.name"))

  expands to:

  (. (. System (getProperties)) (get "os.name"))

  but is easier to write, read, and understand.2->4forms6?Threads the expr through the forms. Inserts x as the
  second item in the first form, making a list of it if it is not a
  list already. If there are more forms, inserts the first form as the
  second item in second form, etc.8->>:?Threads the expr through the forms. Inserts x as the
  last item in the first form, making a list of it if it is not a
  list already. If there are more forms, inserts the first form as the
  last item in second form, etc.<check-valid-options>options@
valid-keysBbThrows an exception if the given option map contains keys not listed
  as valid, else returns nil.Dglobal-hierarchyFdefmultiH
docstring?Jdispatch-fnLCreates a new multimethod with the associated dispatch function.
  The docstring and attr-map are optional.

  Options are key-value pairs and may be one of:

  :default

  The default dispatch value, defaults to :default

  :hierarchy

  The value used for hierarchical dispatch (e.g. ::square is-a ::shape)

  Hierarchies are type-like relationships that do not depend upon type
  inheritance. By default Clojure's multimethods dispatch off of a
  global hierarchy map.  However, a hierarchy relationship can be
  created with the derive function used to augment the root ancestor
  created with make-hierarchy.

  Multimethods expect the value of the hierarchy option to be supplied as
  a reference type e.g. a var (i.e. via the Var-quote dispatch macro #'
  or the var special form).N	defmethodPmultifnRdispatch-valTfn-tailVQCreates and installs a new method of multimethod associated with dispatch-value. Xremove-all-methodsZclojure.lang.MultiFn\*Removes all of the methods of multimethod.^
remove-method`ARemoves the method of multimethod associated with dispatch-value.b
prefer-methodddispatch-val-xfdispatch-val-yhkCauses the multimethod to prefer matches of dispatch-val-x over dispatch-val-y 
   when there is a conflictjmethodslEGiven a multimethod, returns a map of dispatch values -> dispatch fnsn
get-methodp?Given a multimethod and a dispatch value, returns the dispatch fn
  that would apply to that value, or nil if none apply and no defaultrpreferstLGiven a multimethod, returns a map of preferred value -> set of other valuesvassert-argsxpairszif-let|bindings~oldform??bindings => binding-form test

  If test is true, evaluates then with binding-form bound to the value of 
  test, if not, yields else?when-let?obindings => binding-form test

  When test is true, evaluates body with binding-form bound to the value of test?if-some??bindings => binding-form test

   If test is not nil, evaluates then with binding-form bound to the
   value of test, if not, yields else?	when-some?vbindings => binding-form test

   When test is not nil, evaluates body with binding-form bound to the
   value of test?push-thread-bindings??WARNING: This is a low-level function. Prefer high-level macros like
  binding where ever possible.

  Takes a map of Var/value pairs. Binds each Var to the associated value for
  the current thread. Each call *MUST* be accompanied by a matching call to
  pop-thread-bindings wrapped in a try-finally!
  
      (push-thread-bindings bindings)
      (try
        ...
        (finally
          (pop-thread-bindings)))?pop-thread-bindings?qPop one set of bindings pushed with push-binding before. It is an error to
  pop bindings without pushing before.?get-thread-bindings?YGet a map with the Var/value pairs which is currently in effect for the
  current thread.?binding?_binding => var-symbol init-expr

  Creates new bindings for the (already-existing) vars, with the
  supplied initial values, executes the exprs in an implicit do, then
  re-establishes the bindings that existed before.  The new bindings
  are made in parallel (unlike let); all init-exprs are evaluated
  before the vars are bound to their new values.?with-bindings*?binding-map??Takes a map of Var/value pairs. Installs for the given Vars the associated
  values as thread-local bindings. Then calls f with the supplied arguments.
  Pops the installed bindings after f returned. Returns whatever f returns.?
with-bindings??Takes a map of Var/value pairs. Installs for the given Vars the associated
  values as thread-local bindings. Then executes body. Pops the installed
  bindings after body was evaluated. Returns the value of body.?	bound-fn*?__init8Returns a function, which will install the same bindings in effect as in
  the thread at the time bound-fn* was called and then call f with any given
  arguments. This may be used to define a helper function which runs on a
  different thread, but needs the same bindings in place.?bound-fn?fntail?Returns a function defined by the given fntail, which will install the
  same bindings in effect as in the thread at the time bound-fn was called.
  This may be used to define a helper function which runs on a different
  thread, but needs the same bindings in place.?find-var?sym?bReturns the global var named by the namespace-qualified symbol, or
  nil if no var with that name.?binding-conveyor-fn?setup-reference?r?clojure.lang.ARef?agent?state? TBD, pass nil for now

  Runs the exprs (in an implicit do) in a transaction that encompasses
  exprs and any nested calls.  Starts a transaction if none is already
  running on this thread. Any uncaught exception will abort the
  transaction and flow out of sync. The exprs may be run more than
  once, but any effects on Refs will be atomic.?io!??If an io! block occurs in a transaction, throws an
  IllegalStateException, else runs body in an implicit do. If the
  first expression in body is a literal string, will use that as the
  exception message.?	volatile!? [(a x) (b x) (c x)]?partial?__init10arg1?arg2?arg3??Takes a function f and fewer than the normal arguments to f, and
  returns a fn that takes a variable number of additional args. When
  called, the returned function calls f with args + additional args.?sequence?xform?colls??Coerces coll to a (possibly empty) sequence, if it is not already
  one. Will not force a lazy seq. (sequence nil) yields (), When a
  transducer is supplied, returns a lazy sequence of applications of
  the transform to the items in coll(s), i.e. to the set of first
  items of each coll, followed by the set of second
  items in each coll, until any one of the colls is exhausted.  Any
  remaining items in other colls are ignored. The transform should accept
  number-of-colls arguments?every??pred?KReturns true if (pred x) is logical true for every x in coll, else
  false.?
not-every??KReturns false if (pred x) is logical true for every x in
  coll, else true.?some??Returns the first logical true value of (pred x) for any x in coll,
  else nil.  One common idiom is to use a set as pred, for example
  this will return :fred if :fred is in the sequence, otherwise nil:
  (some #{:fred} coll)?not-any??IReturns false if (pred x) is logical true for any x in coll,
  else true.?dotimes?~bindings => name n

  Repeatedly executes body (presumably for side-effects) with name
  bound to integers from 0 through n-1.?c1?c2?c3?sReturns a lazy sequence consisting of the result of applying f to
  the set of first items of each coll, followed by applying f to the
  set of second items in each coll, until any one of the colls is
  exhausted.  Any remaining items in other colls are ignored. Function
  f should accept number-of-colls arguments. Returns a transducer when
  no collection is provided.?declare?names?Udefs the supplied var names with no bindings, useful for making forward declarations.?cat?declared?mapcat??Returns the result of applying concat to the result of applying map
  to f and colls.  Thus function f should return a collection. Returns
  a transducer when no collections are provided?filter??Returns a lazy sequence of the items in coll for which
  (pred item) returns true. pred must be free of side-effects.
  Returns a transducer when no collection is provided.?remove??Returns a lazy sequence of the items in coll for which
  (pred item) returns false. pred must be free of side-effects.
  Returns a transducer when no collection is provided.?reduced?CWraps x in a way such that a reduce will terminate with the value x?reduced??ensure-reduced?>If x is already reduced?, returns it, else returns (reduced x)?	unreduced?3If x is reduced?, returns (deref x), else returns x?take ?Returns a lazy sequence of the first n items in coll, or all items if
  there are fewer than n.  Returns a stateful transducer when
  no collection is provided. 
take-while ?Returns a lazy sequence of successive items from coll while
  (pred item) returns true. pred must be free of side-effects.
  Returns a transducer when no collection is provided. drop }Returns a lazy sequence of all but the first n items in coll.
  Returns a stateful transducer when no collection is provided. 
	drop-last FReturn a lazy sequence of all but the last n (default 1) items in coll 	take-last ?Returns a seq of the last n items in coll.  Depending on the type
  of coll may be no better than linear time.  For vectors, see also subvec. 
drop-while ?Returns a lazy sequence of the items in coll starting from the
  first item for which (pred item) returns logical false.  Returns a
  stateful transducer when no collection is provided. cycle HReturns a lazy (infinite!) sequence of repetitions of the items in coll. split-at 1Returns a vector of [(take n coll) (drop n coll)] 
split-with  __init11CReturns a vector of [(take-while pred coll) (drop-while pred coll)] #repeat %CReturns a lazy (infinite!, or length n if supplied) sequence of xs. '	replicate )@DEPRECATED: Use 'repeat' instead.
   Returns a lazy seq of n xs. +iterate -RReturns a lazy sequence of x, (f x), (f (f x)) etc. f must be free of side-effects /range 1end 3start 5step 7?Returns a lazy seq of nums from start (inclusive) to end
  (exclusive), by step, where start defaults to 0, step to 1, and end to
  infinity. When step is equal to 0, returns an infinite sequence of
  start. When start is equal to end, returns empty list. 9merge ;maps =?Returns a map that consists of the rest of the maps conj-ed onto
  the first.  If a key occurs in more than one map, the mapping from
  the latter (left-to-right) will be the mapping in the result. ?
merge-with AReturns a map that consists of the rest of the maps conj-ed onto
  the first.  If a key occurs in more than one map, the mapping(s)
  from the latter (left-to-right) will be combined with the mapping in
  the result by calling (f val-in-result val-in-latter). Czipmap E=Returns a map with the keys mapped to the corresponding vals. Gline-seq Irdr Kjava.io.BufferedReader MnReturns the lines of text from rdr as a lazy sequence of strings.
  rdr must implement java.io.BufferedReader. OBReturns an implementation of java.util.Comparator based upon pred. Qsort Sjava.util.Comparator U-Returns a sorted sequence of the items in coll. If no comparator is
  supplied, uses compare.  comparator must implement
  java.util.Comparator.  Guaranteed to be stable: equal elements will
  not be reordered.  If coll is a Java array, it will be modified.  To
  avoid this, sort a copy of the array. Wsort-by Ykeyfn [nReturns a sorted sequence of the items in coll, where the sort
  order is determined by comparing (keyfn item).  If no comparator is
  supplied, uses compare.  comparator must implement
  java.util.Comparator.  Guaranteed to be stable: equal elements will
  not be reordered.  If coll is a Java array, it will be modified.  To
  avoid this, sort a copy of the array. ]dorun _CWhen lazy sequences are produced via functions that have side
  effects, any effects other than those needed to produce the first
  element in the seq do not occur until the seq is consumed. dorun can
  be used to force any effects. Walks through the successive nexts of
  the seq, does not retain the head and returns nil. adoall cyWhen lazy sequences are produced via functions that have side
  effects, any effects other than those needed to produce the first
  element in the seq do not occur until the seq is consumed. doall can
  be used to force any effects. Walks through the successive nexts of
  the seq, retains the head and returns it, thus causing the entire
  seq to reside in memory at one time. enthnext g5Returns the nth next of coll, (seq coll) when n is 0. inthrest k/Returns the nth rest of coll, coll when n is 0. m	partition opad q^Returns a lazy sequence of lists of n items each, at offsets step
  apart. If step is not supplied, defaults to n, i.e. the partitions
  do not overlap. If a pad collection is supplied, use its elements as
  necessary to complete last partition upto n items. In case there are
  not enough padding elements, return a partition with less than n items. seval uEEvaluates the form data structure (not text!) and returns the result. wdoseq y	seq-exprs {?Repeatedly executes body (presumably for side-effects) with
  bindings and filtering as provided by "for".  Does not retain
  the head of the sequence. Returns nil. }await agents ??Blocks the current thread (indefinitely!) until all actions
  dispatched thus far, from this thread or agent, to the agent(s) have
  occurred.  Will block on failed agents.  Will never return if
  a failed agent is restarted with :clear-actions true. ?await1 ?	await-for ??Blocks the current thread until all actions dispatched thus
  far (from this thread or agent) to the agents have occurred, or the
  timeout (in milliseconds) has elapsed. Returns logical false if
  returning due to timeout, logical true otherwise. ?	transient ? clojure.lang.IEditableCollection ?EReturns a new, transient version of the collection, in constant time. ?persistent! ?!clojure.lang.ITransientCollection ??Returns a new, persistent version of the transient collection, in
  constant time. The transient collection cannot be used after this
  call, any such use will throw an exception. ?conj! ??Adds x to the transient collection, and return coll. The 'addition'
  may happen at different 'places' depending on the concrete type. ?__init12assoc! ?"clojure.lang.ITransientAssociative ??When applied to a transient map, adds mapping of key(s) to
  val(s). When applied to a transient vector, sets the val at index.
  Note - index must be <= (count vector). Returns coll. ?dissoc! ?clojure.lang.ITransientMap ?BReturns a transient map that doesn't contain a mapping for key(s). ?pop! ?clojure.lang.ITransientVector ?nRemoves the last item from a transient vector. If
  the collection is empty, throws an exception. Returns coll ?disj! ?clojure.lang.ITransientSet ?ddisj[oin]. Returns a transient set of the same (hashed/sorted) type, that
  does not contain key(s). ?into1 ?to ?from ?XReturns a new coll consisting of to-coll with all of the items of
  from-coll conjoined. ?import ?import-symbols-or-lists ??import-list => (package-symbol class-name-symbols*)

  For each name in class-name-symbols, adds a mapping from name to the
  class named by package.name to the current namespace. Use :import in the ns
  macro in preference to calling this directly. ?
into-array ?aseq ?type ?AReturns an array with components set to the values in aseq. The array's
  component type is type if provided, or the type of the first value in
  aseq if present, or Object. All values in aseq must be compatible with
  the component type. Class objects for the primitive types can be obtained
  using, e.g., Integer/TYPE. ?array ?class ?java.lang.Class ?Returns the Class of x ?5Returns the :type metadata of x, or its Class if none ?java.lang.Number ?long ?Number ?float ?double ?short ?byte ?char ?boolean ?unchecked-byte ?unchecked-short ?unchecked-char ?
unchecked-int ?unchecked-long ?unchecked-float ?unchecked-double ?number? ?Returns true if x is a Number ?mod ?;Modulus of num and div. Truncates toward negative infinity. ?ratio? ?Returns true if n is a Ratio ?	numerator!__init13&Returns the numerator part of a Ratio.!java.math.BigInteger!denominator!(Returns the denominator part of a Ratio.!	decimal?!!Returns true if n is a BigDecimal!
float?!,Returns true if n is a floating point number!	rational?!&Returns true if n is a rational number!bigint!Coerce to BigInt!clojure.lang.BigInt!
biginteger!Coerce to BigInteger!bigdec!!Coerce to BigDecimal!#java.math.BigDecimal!%print-initialized!'pr-on!)w!+pr!-?Prints the object(s) to the output stream that is the current value
  of *out*.  Prints the object(s), separated by spaces if there is
  more than one.  By default, pr and prn print in a way that objects
  can be read by the reader!/system-newline!1newline!3+Writes a platform-specific newline to *out*!5flush!7>Flushes the output stream that is the current value of
  *out*!9prn!;=Same as pr followed by (newline). Observes *flush-on-newline*!=print!??Prints the object(s) to the output stream that is the current value
  of *out*.  print and println produce output for human consumption.!Aprintln!C#Same as print followed by (newline)!Eread!Gstream!I
eof-error?!K	eof-value!M
recursive?!Oopts!Q?Reads the next object from stream, which must be an instance of
  java.io.PushbackReader or some derivee.  stream defaults to the
  current value of *in*.

  Opts is a persistent map with valid keys:
    :read-cond - :allow to process reader conditionals, or
                 :preserve to keep all branches
    :features - persistent set of feature keywords for reader conditionals
    :eof - on eof, return value unless :eofthrow, then throw.
           if not specified, will throw

  Note that read can execute code (controlled by *read-eval*),
  and as such should be used only with trusted sources.

  For data structure interop use clojure.edn/read!S	read-line!UCReads the next line from stream that is the current value of *in* .!Wread-string!YReads one object from the string s. Optionally include reader
  options, as specified in read.

  Note that read-string can execute code (controlled by *read-eval*),
  and as such should be used only with trusted sources.

  For data structure interop use clojure.edn/read-string![subvec!]v!_Returns a persistent vector of the items in vector from
  start (inclusive) to end (exclusive).  If end is not supplied,
  defaults to (count vector). This operation is O(1) and very fast, as
  the resulting vector shares structure with the original and no
  trimming is done.!a	with-open!c?bindings => [name init ...]

  Evaluates body in a try expression with names bound to the values
  of the inits, and a finally clause that calls (.close name) on each
  name in reverse order.!edoto!g?Evaluates x then calls all of the methods and functions with the
  value of x supplied at the front of the given arguments.  The forms
  are evaluated in order.  Returns x.

  (doto (new java.util.HashMap) (.put "a" 1) (.put "b" 2))!imemfn!k:Expands into code that creates a fn that expects to be passed an
  object and any args and calls the named instance method on the
  object passing the args. Use when you want to treat a Java method as
  a first-class fn. name may be type-hinted with the method receiver's
  type in order to avoid reflective calls.!mtime!oexpr!qHEvaluates expr and prints the time it took.  Returns the value of
 expr.!salength!u__init14aclone!xaget!zidx!|idxs!~aset!?idx2!?idxv!?def-aset!?method!?coerce!?aset-int!?ISets the value at the index/indices. Works on arrays of int. Returns val.!?	aset-long!?JSets the value at the index/indices. Works on arrays of long. Returns val.!?aset-boolean!?MSets the value at the index/indices. Works on arrays of boolean. Returns val.!?
aset-float!?KSets the value at the index/indices. Works on arrays of float. Returns val.!?aset-double!?LSets the value at the index/indices. Works on arrays of double. Returns val.!?
aset-short!?KSets the value at the index/indices. Works on arrays of short. Returns val.!?	aset-byte!?JSets the value at the index/indices. Works on arrays of byte. Returns val.!?	aset-char!?JSets the value at the index/indices. Works on arrays of char. Returns val.!?
make-array!?len!?dim!?	more-dims!?/Creates and returns an array of instances of the specified class of
  the specified dimension(s).  Note that a class object is required.
  Class objects can be obtained by using their imported or
  fully-qualified name.  Class objects for the primitive types can be
  obtained using, e.g., Integer/TYPE.!?to-array-2d!?java.util.Collection!??Returns a (potentially-ragged) 2-dimensional array of Objects
  containing the contents of coll, which can be any Collection of any
  Collection.!?[[Ljava.lang.Object;!?
macroexpand-1!?LIf form represents a macro form, returns its expansion,
  else returns form.!?macroexpand!??Repeatedly calls macroexpand-1 on form until it no longer
  represents a macro form, then returns it.  Note neither
  macroexpand-1 nor macroexpand expand macros in subforms.!?
create-struct!?!Returns a structure basis object.!?	defstruct!?*Same as (def name (create-struct keys...))!?
struct-map!?inits!??Returns a new structmap instance with the keys of the
  structure-basis. keyvals may contain all, some or none of the basis
  keys - where values are not supplied they will default to nil.
  keyvals can also contain keys not in the basis.!?struct!??Returns a new structmap instance with the keys of the
  structure-basis. vals must be supplied for basis keys in order -
  where values are not supplied they will default to nil.!?accessor!?#Returns a fn that, given an instance of a structmap with the basis,
  returns the value at the key.  The key must be in the basis. The
  returned function should be (slightly) more efficient than using
  get, but such use of accessors should be limited to known
  performance-critical areas.!?load-reader!?NSequentially read and evaluate the set of forms contained in the
  stream/file!?load-string!?ISequentially read and evaluate the set of forms contained in the
  string!?set?!?+Returns true if x implements IPersistentSet!?__init15/Returns a set of the distinct elements of coll.!?
filter-key!?amap!?find-ns!?EReturns the namespace named by the symbol or nil if it doesn't exist.!?	create-ns!??Create a new namespace named by the symbol if one doesn't already
  exist, returns it or the already-existing namespace of the same
  name.!?	remove-ns!?nRemoves the namespace named by the symbol. Use with caution.
  Cannot be used to remove the clojure namespace.!?all-ns!?%Returns a sequence of all namespaces.!?the-ns!?clojure.lang.Namespace"?If passed a namespace, returns it. Else, when passed a symbol,
  returns the namespace named by it, throwing an exception if not
  found."ns-name",Returns the name of the namespace, a symbol."ns-map"	4Returns a map of all the mappings for the namespace."ns-unmap"
7Removes the mappings for the symbol from the namespace."
ns-publics">Returns a map of the public intern mappings for the namespace."
ns-imports"7Returns a map of the import mappings for the namespace."
ns-interns"7Returns a map of the intern mappings for the namespace."refer"ns-sym"filters"!?refers to all public vars of ns, subject to filters.
  filters can include at most one each of:

  :exclude list-of-symbols
  :only list-of-symbols
  :rename map-of-fromsymbol-tosymbol

  For each public interned var in the namespace named by the symbol,
  adds a mapping from the name of the var to the var to the current
  namespace.  Throws an exception if name is already mapped to
  something else in the current namespace. Filters can be used to
  select a subset, via inclusion or exclusion, or to provide a mapping
  to a symbol different from the var's name, in order to prevent
  clashes. Use :use in the ns macro in preference to calling this directly."#	ns-refers"%6Returns a map of the refer mappings for the namespace."'alias")
namespace-sym"+?Add an alias in the current namespace to another
  namespace. Arguments are two symbols: the alias to be used, and
  the symbolic name of the target namespace. Use :as in the ns macro in preference
  to calling this directly."-
ns-aliases"//Returns a map of the aliases for the namespace."1
ns-unalias"34Removes the alias for the symbol from the namespace."5take-nth"7nReturns a lazy seq of every nth item in coll.  Returns a stateful
  transducer when no collection is provided."9
interleave";GReturns a lazy seq of the first item in each coll, then the second etc."=var-get"?clojure.lang.Var"A Gets the value in the var object"Cvar-set"EOSets the value in the var object to val. The var must be
 thread-locally bound."Gwith-local-vars"I
name-vals-vec"K?varbinding=> symbol init-expr

  Executes the exprs in a context in which the symbols are bound to
  vars with per-thread bindings to the init-exprs.  The symbols refer
  to the var objects themselves, and must be accessed with var-get and
  var-set"M
ns-resolve"Oenv"Q?Returns the var or Class to which a symbol will be resolved in the
  namespace (unless found in the environment), else nil.  Note that
  if the symbol is fully qualified, the var/Class to which it resolves
  need not be present in the namespace."Sresolve"UAsame as (ns-resolve *ns* symbol) or (ns-resolve *ns* &env symbol)"W	array-map"Y__init16cConstructs an array-map. If any keys are equal, they are handled as
  if by repeated uses of assoc."\destructure"^?binding => binding-form init-expr

  Evaluates the exprs in a lexical context in which the symbols in
  the binding-forms are bound to their respective init-exprs or parts
  therein."`special-form"b	bindings*"dexprs*"fmaybe-destructured"hparams"j?params => positional-params* , or positional-params* & next-param
  positional-param => binding-form
  next-param => binding-form
  name => symbol

  Defines a function"lname?"n?Evaluates the exprs in a lexical context in which the symbols in
  the binding-forms are bound to their respective init-exprs or parts
  therein. Acts as a recur target."p
when-first"robindings => x xs

  Roughly the same as (when (seq xs) (let [x (first xs)] body)) but xs is evaluated only once"tlazy-cat"v?Expands to code which yields a lazy sequence of the concatenation
  of the supplied colls.  Each coll expr is not evaluated until it is
  needed. 

  (lazy-cat xs ys zs) === (concat (lazy-seq xs) (lazy-seq ys) (lazy-seq zs))"xfor"z	body-expr"|?List comprehension. Takes a vector of one or more
   binding-form/collection-expr pairs, each followed by zero or more
   modifiers, and yields a lazy sequence of evaluations of expr.
   Collections are iterated in a nested fashion, rightmost fastest,
   and nested coll-exprs can refer to bindings created in prior
   binding-forms.  Supported modifiers are: :let [binding-form expr ...],
   :while test, :when test.

  (take 100 (for [x (range 100000000) y (range 1000000) :while (< y x)] [x y]))"~comment"?Ignores body, yields nil"?with-out-str"??Evaluates exprs in a context in which *out* is bound to a fresh
  StringWriter.  Returns the string created by any nested printing
  calls."?with-in-str"?kEvaluates body in a context in which *in* is bound to a fresh
  StringReader initialized with the string s."?pr-str"?pr to a string, returning it"?prn-str"?prn to a string, returning it"?	print-str"?print to a string, returning it"?println-str"?!println to a string, returning it"?ex-info"?msg"?cause"?jCreate an instance of ExceptionInfo, a RuntimeException subclass
   that carries a map of additional data."?1.4"?ex-data"?ex"?TReturns exception data (a map) if ex is an IExceptionInfo.
   Otherwise returns nil."?assert"?message"?QEvaluates expr and throws an exception if it does not evaluate to
  logical true."?etest [v] finds fn at key :test in var metadata and calls it,
  presuming failure will throw exception"?
re-pattern"?NReturns an instance of java.util.regex.Pattern, for use, e.g. in
  re-matcher."?java.util.regex.Pattern"?
re-matcher"?re"?KReturns an instance of java.util.regex.Matcher, for use, e.g. in
  re-find."?java.util.regex.Matcher"?	re-groups"??Returns the groups from the most recent match/find. If there are no
  nested groups, returns a string of the entire match. If there are
  nested groups, returns a vector of the groups, the first element
  being the entire match."?re-seq"??Returns a lazy sequence of successive matches of pattern in string,
  using java.util.regex.Matcher.find(), each such match processed with
  re-groups."?
re-matches"?__init17?Returns the match, if any, of string to pattern, using
  java.util.regex.Matcher.matches().  Uses re-groups to return the
  groups."?re-find"??Returns the next regex match, if any, of string to pattern, using
  java.util.regex.Matcher.find().  Uses re-groups to return the
  groups."?rand"?]Returns a random floating point number between 0 (inclusive) and
  n (default 1) (exclusive)."?rand-int"?AReturns a random integer between 0 (inclusive) and n (exclusive)."?defn-"?decls"?%same as defn, yielding non-public def"?tree-seq"?branch?"?children"?root"?iReturns a lazy sequence of the nodes in a tree, via a depth-first walk.
   branch? must be a fn of one arg that returns true if passed a node
   that can have children (but may not).  children must be a fn of one
   arg that returns a sequence of the children. Will only be called on
   nodes for which branch? returns true. Root is the root node of the
  tree."?file-seq"?dir"?A tree seq on java.io.Files"?xml-seq"?/A tree seq on the xml elements as per xml/parse"?special-symbol?"?&Returns true if s names a special form"?var?"?-Returns true if v is of type clojure.lang.Var"?subs"?String"?wReturns the substring of s beginning at start inclusive, and ending
  at end (defaults to length of string), exclusive.#max-key#k#5Returns the x for which (k x), a number, is greatest.#min-key#	2Returns the x for which (k x), a number, is least.#distinct#
?Returns a lazy sequence of the elements of coll with duplicates removed.
  Returns a stateful transducer when no collection is provided.#replace#smap#?Given a map of replacement pairs and a vector/collection, returns a
  vector/seq with any elements = a key in smap replaced with the
  corresponding val in smap.  Returns a transducer when no collection
  is provided.#dosync#exprs#@Runs the exprs (in an implicit do) in a transaction that encompasses
  exprs and any nested calls.  Starts a transaction if none is already
  running on this thread. Any uncaught exception will abort the
  transaction and flow out of dosync. The exprs may be run more than
  once, but any effects on Refs will be atomic.#with-precision#	precision#-Sets the precision and rounding mode to be used for BigDecimal operations.

  Usage: (with-precision 10 (/ 1M 3))
  or:    (with-precision 10 :rounding HALF_DOWN (/ 1M 3))

  The rounding mode is one of CEILING, FLOOR, HALF_UP, HALF_DOWN,
  HALF_EVEN, UP, DOWN and UNNECESSARY; it defaults to HALF_UP.#!mk-bound-fn##sc#%clojure.lang.Sorted#'subseq#)
start-test#+	start-key#-end-test#/end-key#1?sc must be a sorted collection, test(s) one of <, <=, > or
  >=. Returns a seq of those entries with keys ek for
  which (test (.. sc comparator (compare ek key)) 0) is true#3rsubseq#5?sc must be a sorted collection, test(s) one of <, <=, > or
  >=. Returns a reverse seq of those entries with keys ek for
  which (test (.. sc comparator (compare ek key)) 0) is true#7
repeatedly#9?Takes a function of no args, presumably with side effects, and
  returns an infinite (or length n if supplied) lazy sequence of calls
  to it#;
add-classpath#=url#?_DEPRECATED 

  Adds the url (String or URL object) to the classpath per
  URLClassLoader.addURL#Ahash#C?Returns the hash code of its argument. Note this is the hash code
  consistent with =, and thus is different than .hashCode for Integer,
  Short, Byte and Clojure collections.#Emix-collection-hash#G
hash-basis#I7Mix final collection hash for ordered or unordered collections.
   hash-basis is the combined collection hash, count is the number
   of elements included in the basis. Note this is the hash code
   consistent with =, different from .hashCode.
   See http://clojure.org/data_structures#hash for full algorithms.#Khash-ordered-coll#M?Returns the hash code, consistent with =, for an external ordered
   collection implementing Iterable.
   See http://clojure.org/data_structures#hash for full algorithms.#Ohash-unordered-coll#Q__init18Returns the hash code, consistent with =, for an external unordered
   collection implementing Iterable. For maps, the iterator should
   return map entries whose hash is computed as
     (hash-ordered-coll [k v]).
   See http://clojure.org/data_structures#hash for full algorithms.#T	interpose#Vsep#X|Returns a lazy seq of the elements of coll separated by sep.
  Returns a stateful transducer when no collection is provided.#Z	definline#\decl#^?Experimental - like defmacro, except defines a named function whose
  body is the expansion, calls to which may be expanded inline as if
  it were a macro. Cannot be used with variadic (&) args.#`empty#b@Returns an empty collection of the same category as coll, or nil#dret#f?Maps an expression across an array a, using an index named idx, and
  return value named ret, initialized to a clone of a, then setting 
  each element of ret to the evaluation of expr, returning the new 
  array ret.#hareduce#jinit#l?Reduces an expression across an array a, using an index named idx,
  and return value named ret, initialized to init, setting ret to the 
  evaluation of expr at each step, returning ret.#nfloat-array#psize-or-seq#rsize#tinit-val-or-seq#v
boolean-array#x
byte-array#z
char-array#|short-array#~double-array#?object-array#?	int-array#?
long-array#?booleans#?Casts to boolean[]#?bytes#?Casts to bytes[]#?chars#?Casts to chars[]#?shorts#?Casts to shorts[]#?floats#?Casts to float[]#?ints#?Casts to int[]#?doubles#?Casts to double[]#?longs#?Casts to long[]#?bytes?#? Return true if x is a byte array#?seque#?n-or-q#?bCreates a queued seq on another (presumably lazy) seq s. The queued
  seq will produce a concrete seq in the background, and can get up to
  n items ahead of the consumer. n-or-q can be an integer n buffer
  size, or an instance of java.util.concurrent BlockingQueue. Note
  that reading from a seque can block if the reader gets ahead of the
  producer.#?class?#?__init19)Returns true if x is an instance of Class#?is-annotation?#?is-runtime-annotation?#?
descriptor#?process-annotation#?add-annotation#?av#?clojure.asm.AnnotationVisitor#?add-annotations#?visitor#?i#?alter-var-root#?^Atomically alters the root binding of var v by applying f to its
  current value plus any args#?bound?#?vars#??Returns true if all of the vars provided as arguments have any bound value, root or thread-local.
   Implies that deref'ing the provided vars will succeed. Returns true if no vars are provided.#?
thread-bound?#??Returns true if all of the vars provided as arguments have thread-local bindings.
   Implies that set!'ing the provided vars will succeed.  Returns true if no vars are provided.#?make-hierarchy#?9Creates a hierarchy object for use with derive, isa? etc.#?	not-empty#?(If coll is empty, returns nil, else coll#?bases#?CReturns the immediate superclass and direct interfaces of c, if any#?supers#?KReturns the immediate and indirect superclasses and interfaces of c, if any#?isa?#?child#?parent#? Returns true if (= child parent), or child is directly or indirectly derived from
  parent, either via a Java type inheritance relationship or a
  relationship established via derive. h must be a hierarchy obtained
  from make-hierarchy, if not supplied defaults to the global
  hierarchy#?parents#??Returns the immediate parents of tag, either via a Java type
  inheritance relationship or a relationship established via derive. h
  must be a hierarchy obtained from make-hierarchy, if not supplied
  defaults to the global hierarchy#?	ancestors#??Returns the immediate and indirect parents of tag, either via a Java type
  inheritance relationship or a relationship established via derive. h
  must be a hierarchy obtained from make-hierarchy, if not supplied
  defaults to the global hierarchy#?descendants#?Returns the immediate and indirect children of tag, through a
  relationship established via derive. h must be a hierarchy obtained
  from make-hierarchy, if not supplied defaults to the global
  hierarchy. Note: does not work on Java type inheritance
  relationships.#?derive#??Establishes a parent/child relationship between parent and
  tag. Parent must be a namespace-qualified symbol or keyword and
  child can be either a namespace-qualified symbol or keyword or a
  class. h must be a hierarchy obtained from make-hierarchy, if not
  supplied defaults to, and modifies, the global hierarchy.#?flatten$underive$?Removes a parent/child relationship between parent and
  tag. h must be a hierarchy obtained from make-hierarchy, if not
  supplied defaults to, and modifies, the global hierarchy.$	distinct?$-Returns true if no two of the arguments are =$	
resultset-seq$rs$
java.sql.ResultSet$jCreates and returns a lazy sequence of structmaps corresponding to
  the rows in the java.sql.ResultSet rs$iterator-seq$iter$Returns a seq on a java.util.Iterator. Note that most collections
  providing iterators implement Iterable and thus support seq directly.
  Seqs cache values, thus iterator-seq should not be used on any
  iterator that repeatedly returns the same mutable object.$enumeration-seq$(Returns a seq on a java.util.Enumeration$__init20format$fmt$ bFormats a string using java.lang.String.format, see java.util.Formatter for format
  string syntax$"printf$$&Prints formatted output, as per format$&	gen-class$(with-loading-context$*references*$,/Sets *ns* to the namespace named by name (unevaluated), creating it
  if needed.  references can be zero or more of: (:refer-clojure ...)
  (:require ...) (:use ...) (:import ...) (:load ...) (:gen-class)
  with the syntax of refer-clojure/require/use/import/load/gen-class
  respectively, except the arguments are unevaluated and need not be
  quoted. (:gen-class ...), when supplied, defaults to :name
  corresponding to the ns name, :main true, :impl-ns same as ns, and
  :init-impl-ns true. All options of gen-class are
  supported. The :gen-class directive is ignored when not
  compiling. If :gen-class is not supplied, when compiled only an
  nsname__init.class will be generated. If :refer-clojure is not used, a
  default (refer 'clojure.core) is used.  Use of ns is preferred to
  individual calls to in-ns/require/use/import:

  (ns foo.bar
    (:refer-clojure :exclude [ancestors printf])
    (:require (clojure.contrib sql combinatorics))
    (:use (my.lib this that))
    (:import (java.util Date Timer Random)
             (java.sql Connection Statement)))$.
refer-clojure$0'Same as (refer 'clojure.core )$2defonce$4ldefs name to have the root value of the expr iff the named var has no root value,
  else expr is unevaluated$6throw-if$89Throws a CompilerException with a message if pred is true$:libspec?$<Returns true if x is a libspec$>	prependss$@"Prepends a symbol or a seq to coll$B
root-resource$Dlib$F)Returns the root directory path for a lib$Hroot-directory$J(Returns the root resource path for a lib$Lredef$Oload-one$Qneed-ns$Srequire$U?Loads a lib given its name. If need-ns, ensures that the associated
  namespace exists after loading. If require, records the load so any
  duplicate loads can be skipped.$Wload-all$Y?Loads a lib given its name and forces a load of any libs it directly or
  indirectly loads. If need-ns, ensures that the associated namespace
  exists after loading. If require, records the load so any duplicate loads
  can be skipped.$[load-lib$]prefix$_Loads a lib with options$a	load-libs$cWLoads libs, interpreting libspecs, prefix lists, and flags for
  forwarding to load-lib$echeck-cyclic-dependency$gpath$iDetects and rejects non-trivial cyclic load dependencies. The
  exception message shows the dependency chain with the cycle
  highlighted. Ignores the trivial case of a file attempting to load
  itself because that can occur when a gen-class'd class loads its
  implementation.$k
Loads libs, skipping any that are already loaded. Each argument is
  either a libspec that identifies a lib, a prefix list that identifies
  multiple libs whose names share a common prefix, or a flag that modifies
  how all the identified libs are loaded. Use :require in the ns macro
  in preference to calling this directly.

  Libs

  A 'lib' is a named set of resources in classpath whose contents define a
  library of Clojure code. Lib names are symbols and each lib is associated
  with a Clojure namespace and a Java package that share its name. A lib's
  name also locates its root directory within classpath using Java's
  package name to classpath-relative path mapping. All resources in a lib
  should be contained in the directory structure under its root directory.
  All definitions a lib makes should be in its associated namespace.

  'require loads a lib by loading its root resource. The root resource path
  is derived from the lib name in the following manner:
  Consider a lib named by the symbol 'x.y.z; it has the root directory
  /x/y/, and its root resource is /x/y/z.clj. The root
  resource should contain code to create the lib's namespace (usually by using
  the ns macro) and load any additional lib resources.

  Libspecs

  A libspec is a lib name or a vector containing a lib name followed by
  options expressed as sequential keywords and arguments.

  Recognized options:
  :as takes a symbol as its argument and makes that symbol an alias to the
    lib's namespace in the current namespace.
  :refer takes a list of symbols to refer from the namespace or the :all
    keyword to bring in all public vars.

  Prefix Lists

  It's common for Clojure code to depend on several libs whose names have
  the same prefix. When specifying libs, prefix lists can be used to reduce
  repetition. A prefix list contains the shared prefix followed by libspecs
  with the shared prefix removed from the lib names. After removing the
  prefix, the names that remain must not contain any periods.

  Flags

  A flag is a keyword.
  Recognized flags: :reload, :reload-all, :verbose
  :reload forces loading of all the identified libs even if they are
    already loaded
  :reload-all implies :reload and also forces loading of all libs that the
    identified libs directly or indirectly load via require or use
  :verbose triggers printing information about each load, alias, and refer

  Example:

  The following would load the libraries clojure.zip and clojure.set
  abbreviated as 's'.

  (require '(clojure zip [set :as s]))$muse$oYLike 'require, but also refers to each lib's namespace using
  clojure.core/refer. Use :use in the ns macro in preference to calling
  this directly.

  'use accepts additional options in libspecs: :exclude, :only, :rename.
  The arguments and semantics for :exclude, :only, and :rename are the same
  as those documented for clojure.core/refer.$qloaded-libs$s@Returns a sorted set of symbols naming the currently loaded libs$upaths$w?Loads Clojure code from resources in classpath. A path is interpreted as
  classpath-relative if it begins with a slash or relative to the root
  directory for the current namespace otherwise.$ycompile${Compiles the namespace named by the symbol lib into a set of
  classfiles. The source for the lib must be in a proper
  classpath-relative directory. The output files will go into the
  directory specified by *compile-path*, and that directory too must
  be in the classpath.$}get-in$?Returns the value in a nested associative structure,
  where ks is a sequence of keys. Returns nil if the key
  is not present, or the not-found value if supplied.$?assoc-in$??Associates a value in a nested associative structure, where ks is a
  sequence of keys and v is the new value and returns a new nested structure.
  If any levels do not exist, hash-maps will be created.$?	update-in$?__init21'Updates' a value in a nested associative structure, where ks is a
  sequence of keys and f is a function that will take the old value
  and any supplied args and return the new value, and returns a new
  nested structure.  If any levels do not exist, hash-maps will be
  created.$?update$??'Updates' a value in an associative structure, where k is a
  key and f is a function that will take the old value
  and any supplied args and return the new value, and returns a new
  structure.  If the key does not exist, nil is passed as the old value.$?empty?$?yReturns true if coll has no items - same as (not (seq coll)).
  Please use the idiom (seq x) rather than (not (empty? x))$?coll?$?2Returns true if x implements IPersistentCollection$?list?$?,Returns true if x implements IPersistentList$?seqable?$?2Return true if the seq function is supported for x$?ifn?$?eReturns true if x implements IFn. Note that many data structures
  (e.g. sets and maps) implement IFn$?fn?$?BReturns true if x implements Fn, i.e. is an object created via fn.$?associative?$?+Returns true if coll implements Associative$?sequential?$?*Returns true if coll implements Sequential$?sorted?$?&Returns true if coll implements Sorted$?counted?$?6Returns true if coll implements count in constant time$?reversible?$?*Returns true if coll implements Reversible$?indexed?$?LReturn true if coll implements Indexed, indicating efficient lookup by index$?*1$?7bound in a repl thread to the most recent value printed$?*2$?>bound in a repl thread to the second most recent value printed$?*3$?=bound in a repl thread to the third most recent value printed$?*e$?Fbound in a repl thread to the most recent exception caught by the repl$?
trampoline$??trampoline can be used to convert algorithms requiring mutual
  recursion without stack consumption. Calls f with supplied args, if
  any. If f returns a fn, calls that fn with no arguments, and
  continues to repeat, until the return value is not a fn, then
  returns that non-fn value. Note that if you want to return a fn as a
  final value, you must wrap it in some data structure and unpack it
  after trampoline returns.$??Finds or creates a var named by the symbol name in the namespace
  ns (which can be a symbol or a namespace), setting its root binding
  to val if supplied. The namespace must exist. The var will adopt any
  metadata from the name symbol.  Returns the var.$?while$??Repeatedly executes body while test expression is true. Presumes
  some side-effect will cause test to become false/nil. Returns nil$?memoize$?Returns a memoized version of a referentially transparent function. The
  memoized version of the function keeps a cache of the mapping from arguments
  to results and, when calls with the same arguments are repeated often, has
  higher performance at the expense of higher memory use.$?condp$?Takes a binary predicate, an expression, and a set of clauses.
  Each clause can take the form of either:

  test-expr result-expr

  test-expr :>> result-fn

  Note :>> is an ordinary keyword.

  For each clause, (pred test-expr expr) is evaluated. If it returns
  logical true, the clause is a match. If a binary clause matches, the
  result-expr is returned, if a ternary clause matches, its result-fn,
  which must be a unary function, is called with the result of the
  predicate as its argument, the result of that call being the return
  value of condp. A single default expression can follow the clauses,
  and its value will be returned if no clause matches. If no default
  expression is provided and no clause matches, an
  IllegalArgumentException is thrown.$?*agent*$?	load-file$?add-doc-and-meta$?	docstring$?*file*$?*command-line-args*$?*warn-on-reflection*$?*compile-path*$?__init22*compile-files*$?*unchecked-math*$?*compiler-options*$?*ns*$?*in*$?*out*$?*err*%*flush-on-newline*%*print-meta*%*print-dup*%*print-readably*%*read-eval*%
future?%Returns true if x is a future%future-done?% Returns true if future f is done%letfn%fnspecs%fnspec ==> (fname [params*] exprs) or (fname ([params*] exprs)+)

  Takes a vector of function specs and a body, and generates a set of
  bindings of functions to their names. All of the names are available
  in all of the definitions of the functions, as well as the body.%fnspecs*%fnil%7Takes a function f, and returns a function that calls f, replacing
  a nil first argument to f with the supplied value x. Higher arity
  versions can replace arguments in the second and third
  positions (y, z). Note that the function f can take any number of
  arguments, not just the one(s) being nil-patched.%
shift-mask% shift%"mask%$
max-mask-bits%&
max-switch-table-size%*maybe-min-hash%,hashes%.Jtakes a collection of hashes and returns [shift mask] or nil if none found%0case-map%2case-f%4test-f%6tests%8thens%:?Transforms a sequence of test constants and a corresponding sequence of then
  expressions into a sorted map to be consumed by case*. The form of the map
  entries are {(case-f test) [(test-f test) then]}.%<fits-table?%>cReturns true if the collection of ints can fit within the
  max-table-switch-size, false otherwise.%@	prep-ints%B
Takes a sequence of int-sized test constants and a corresponding sequence of
  then expressions. Returns a tuple of [shift mask case-map switch-type] where
  case-map is a map of int case values to [test then] tuples, and switch-type
  is either :sparse or :compact.%Dmerge-hash-collisions%Fexpr-sym%Hdefault%JNTakes a case expression, default expression, and a sequence of test constants
  and a corresponding sequence of then expressions. Returns a tuple of
  [tests thens skip-check-set] where no tests have the same hash. Each set of
  input test constants with the same hash is replaced with a single test
  constant (the case int), and their respective thens are combined into:
  (condp = expr
    test-1 then-1
    ...
    test-n then-n
    default).
  The skip-check is a set of case ints for which post-switch equivalence
  checking must not be done (the cases holding the above condp thens).%Lprep-hashes%N?Takes a sequence of test constants and a corresponding sequence of then
  expressions. Returns a tuple of [shift mask case-map switch-type skip-check]
  where case-map is a map of int case values to [test then] tuples, switch-type
  is either :sparse or :compact, and skip-check is a set of case ints for which
  post-switch equivalence checking must not be done (occurs with hash
  collisions).%Pcase%RTakes an expression, and a set of clauses.

  Each clause can take the form of either:

  test-constant result-expr

  (test-constant1 ... test-constantN)  result-expr

  The test-constants are not evaluated. They must be compile-time
  literals, and need not be quoted.  If the expression is equal to a
  test-constant, the corresponding result-expr is returned. A single
  default expression can follow the clauses, and its value will be
  returned if no clause matches. If no default expression is provided
  and no clause matches, an IllegalArgumentException is thrown.

  Unlike cond and condp, case does a constant-time dispatch, the
  clauses are not considered sequentially.  All manner of constant
  expressions are acceptable in case, including numbers, strings,
  symbols, keywords, and (Clojure) composites thereof. Note that since
  lists are used to group multiple constants that map to the same
  expression, a vector can be used to match a list if needed. The
  test-constants need not be all of the same type.%Tclojure.core.Inst%VInst%Xassert-same-protocol%Zinst-ms*%\inst%^clojure/lang/ISeq%`on%bon-interface%d?
method-map%gmethod-builders%iprotocol%k__init23-reset-methods%nextend%pjava.util.Date%rinst-ms%tEReturn the number of milliseconds since January 1, 1970, 00:00:00 GMT%vinst?%xReturn true if x satisfies Inst%zuuid?%|$Return true if x is a java.util.UUID%~reduce%?If should be a function of 2 arguments. If val is not supplied,
  returns the result of applying f to the first 2 items in coll, then
  applying f to that result and the 3rd item, etc. If coll contains no
  items, f must accept no arguments as well, and reduce returns the
  result of calling f with no arguments.  If coll has only 1 item, it
  is returned and f is not called.  If val is supplied, returns the
  result of applying f to val and the first item in coll, then
  applying f to that result and the 2nd item, etc. If coll contains no
  items, returns val and f is not called.%?clojure.core.protocols%?	IKVReduce%?	kv-reduce%?clojure.lang.IPersistentMap%?clojure.lang.IKVReduce%?	reduce-kv%?xReduces an associative collection. f should be a function of 3
  arguments. Returns the result of applying f to init, the first key
  and the first value in coll, then applying f to that result and the
  2nd key and value, etc. If coll contains no entries, returns init
  and f is not called. Note that reduce-kv is supported on vectors,
  where the keys will be the ordinals.%?
completing%?cf%??Takes a reducing function f of 2 args and returns a fn suitable for
  transduce by adding an arity-1 signature that calls cf (default -
  identity) on the result argument.%?	transduce%??reduce with a transformation of f (xf). If init is not
  supplied, (f) will be called to produce it. f should be a reducing
  step function that accepts both 1 and 2 arguments, if it accepts
  only 2 you can add the arity-1 with 'completing'. Returns the result
  of applying (the transformed) xf to init and the first item in coll,
  then applying xf to that result and the 2nd item, etc. If coll
  contains no items, returns init and f is not called. Note that
  certain transforms may inject or skip items.%?into%?vReturns a new coll consisting of to-coll with all of the items of
  from-coll conjoined. A transducer may be supplied.%?mapv%?5Returns a vector consisting of the result of applying f to the
  set of first items of each coll, followed by applying f to the set
  of second items in each coll, until any one of the colls is
  exhausted.  Any remaining items in other colls are ignored. Function
  f should accept number-of-colls arguments.%?filterv%?nReturns a vector of the items in coll for which
  (pred item) returns true. pred must be free of side-effects.%?clojure.java.io%?as%?jio%?normalize-slurp-opts%?slurp%??Opens a reader on f and reads all its contents, returning a string.
  See clojure.java.io/reader for a complete list of supported arguments.%?spit%?content%?sOpposite of slurp.  Opens f with writer, writes content, then
  closes f. Options passed to clojure.java.io/writer.%?future-call%?ITakes a function of no args and yields a future object that will
  invoke the function in another thread, and will cache the result and
  return it on all subsequent calls to deref/@. If the computation has
  not yet finished, calls to deref/@ will block, unless the variant
  of deref with timeout is used. See also - realized?.%?future%?ETakes a body of expressions and yields a future object that will
  invoke the body in another thread, and will cache the result and
  return it on all subsequent calls to deref/@. If the computation has
  not yet finished, calls to deref/@ will block, unless the variant of
  deref with timeout is used. See also - realized?.%?
future-cancel%? Cancels the future, if possible.%?future-cancelled?%?%Returns true if future f is cancelled%?pmap%?!Like map, except f is applied in parallel. Semi-lazy in that the
  parallel computation stays ahead of the consumption, but doesn't
  realize the entire result unless required. Only useful for
  computationally intensive functions where the time of f dominates
  the coordination overhead.%?pcalls%?fns%?PExecutes the no-arg fns in parallel, returning a lazy sequence of
  their values%?pvalues%?UReturns a lazy sequence of the values of the exprs, which are
  evaluated in parallel%?*clojure-version*%?clojure-version%?.Returns clojure version as a printable string.%?promise%?%Returns a promise object that can be read with deref/@, and set,
  once only, with deliver. Calls to deref/@ prior to delivery will
  block, unless the variant of deref with timeout is used. All
  subsequent derefs will return the same delivered value without
  blocking. See also - realized?.%?deliver%?__init24?Delivers the supplied value to the promise, releasing any pending
  derefs. A subsequent call to deliver on a promise will have no effect.%??Takes any nested combination of sequential things (lists, vectors,
  etc.) and returns their contents as a single, flat sequence.
  (flatten nil) returns an empty sequence.%?group-by%??Returns a map of the elements of coll keyed by the result of
  f on each element. The value at each key will be a vector of the
  corresponding elements, in the order they appeared in coll.%?partition-by%??Applies f to each value in coll, splitting it each time f returns a
   new value.  Returns a lazy seq of partitions.  Returns a stateful
   transducer when no collection is provided.%?frequencies%?OReturns a map from distinct items in coll to the number of times
  they appear.%?
reductions%?rReturns a lazy seq of the intermediate values of the reduction (as
  per reduce) of coll by f, starting with init.%?rand-nth%??Return a random element of the (sequential) collection. Will have
  the same performance characteristics as nth for the given
  collection.%?
partition-all%??Returns a lazy sequence of lists like partition, but may include
  partitions with fewer than n items at the end.  Returns a stateful
  transducer when no collection is provided.%?shuffle&#Return a random permutation of coll&map-indexed&7Returns a lazy sequence consisting of the result of applying f to 0
  and the first item of coll, followed by applying f to 1 and the second
  item in coll, etc, until coll is exhausted. Thus function f should
  accept 2 arguments, index and item. Returns a stateful transducer when
  no collection is provided.&keep&	?Returns a lazy sequence of the non-nil results of (f item). Note,
  this means false return values will be included.  f must be free of
  side-effects.  Returns a transducer when no collection is provided.&keep-indexed&
?Returns a lazy sequence of the non-nil results of (f index item). Note,
  this means false return values will be included.  f must be free of
  side-effects.  Returns a stateful transducer when no collection is
  provided.&
bounded-count&kIf coll is counted? returns its count, else will count at most the first n
  elements of coll using its seq&
every-pred&p&p1&p2&p3&ps&YTakes a set of predicates and returns a function f that returns true if all of its
  composing predicates return a logical true value against all of its arguments, else it returns
  false. Note that f is short-circuiting in that it will stop execution on the first
  argument that triggers a logical false result against the original predicates.&!some-fn&#eTakes a set of predicates and returns a function f that returns the first logical true value
  returned by one of its composing predicates against any of its arguments, else it returns
  logical false. Note that f is short-circuiting in that it will stop execution on the first
  argument that triggers a logical true result against the original predicates.&%fdecl&'EA good fdecl looks like (([a] ...) ([a b] ...)) near the end of defn.&)with-redefs-fn&+func&-eTemporarily redefines Vars during a call to func.  Each val of
  binding-map will replace the root value of its key which must be
  a Var.  After func is called with no args, the root values of all
  the Vars will be set back to their old values.  These temporary
  changes will be visible in all threads.  Useful for mocking out
  functions during testing.&/with-redefs&1?binding => var-symbol temp-value-expr

  Temporarily redefines Vars while executing the body.  The
  temp-value-exprs will be evaluated and each resulting value will
  replace in parallel the root value of its Var.  After the body is
  executed, the root values of all the Vars will be set back to their
  old values.  These temporary changes will be visible in all threads.
  Useful for mocking out functions during testing.&3	realized?&5clojure.lang.IPending&7XReturns true if a value has been produced for a promise, delay, future or lazy sequence.&9cond->&;Takes an expression and a set of test/form pairs. Threads expr (via ->)
  through each form for which the corresponding test
  expression is true. Note that, unlike cond branching, cond-> threading does
  not short circuit after the first true test expression.&=cond->>&?Takes an expression and a set of test/form pairs. Threads expr (via ->>)
  through each form for which the corresponding test expression
  is true.  Note that, unlike cond branching, cond->> threading does not short circuit
  after the first true test expression.&Aas->&C?Binds name to expr, evaluates the first form in the lexical context
  of that binding, then binds name to that result, repeating for each
  successive form, returning the result of the last form.&Esome->&GvWhen expr is not nil, threads it into the first form (via ->),
  and when that result is not nil, through the next etc&Isome->>&KwWhen expr is not nil, threads it into the first form (via ->>),
  and when that result is not nil, through the next etc&Mpreserving-reduced&Orf&QmA transducer which concatenates the contents of each input, which must be a
  collection, into the reduction.&S__init25	halt-when&Vretf&X?Returns a transducer that ends transduction when pred returns true
  for an input. When retf is supplied it must be a fn of 2 arguments -
  it will be passed the (completed) result so far and the input that
  triggered the predicate, and its return value (if it does not throw
  an exception) will be the return value of the transducer. If retf
  is not supplied, the input that triggered the predicate will be
  returned. If the predicate never returns true the transduction is
  unaffected.&Zdedupe&\wReturns a lazy sequence removing consecutive duplicates in coll.
  Returns a transducer when no collection is provided.&^
random-sample&`prob&b|Returns items from coll with random probability of prob (0.0 -
  1.0).  Returns a transducer when no collection is provided.&deduction&fxform*&h?Returns a reducible/iterable application of the transducers
  to the items in coll. Transducers are applied in order as if
  combined with comp. Note that these applications will be
  performed every time reduce/iterator is called.&jprint-method&lclojure.core.Eduction&nrun!&pproc&r|Runs the supplied procedure (via reduce), for purposes of side
  effects, on successive items in the collection. Returns nil&ttagged-literal?&vvalue&xGReturn true if the value is the data representation of a tagged literal&ztagged-literal&|SConstruct a data representation of a tagged literal from a
  tag symbol and a form.&~reader-conditional?&?KReturn true if the value is the data representation of a reader conditional&?reader-conditional&?	splicing?&?Boolean&?kConstruct a data representation of a reader conditional.
  If true, splicing? indicates read-cond-splicing.&?default-data-readers&?hDefault map of data reader functions provided by Clojure. May be
  overridden by binding *data-readers*.&?clojure.instant&?read-instant-date&?clojure.uuid&?default-uuid-reader&?*data-readers*&?Map from reader tag symbols to data reader Vars.

  When Clojure starts, it searches for files named 'data_readers.clj'
  at the root of the classpath. Each such file must contain a literal
  map of symbols, like this:

      {foo/bar my.project.foo/bar
       foo/baz my.project/baz}

  The first symbol in each pair is a tag that will be recognized by
  the Clojure reader. The second symbol in the pair is the
  fully-qualified name of a Var which will be invoked by the reader to
  parse the form following the tag. For example, given the
  data_readers.clj file above, the Clojure reader would parse this
  form:

      #foo/bar [1 2 3]

  by invoking the Var #'my.project.foo/bar on the vector [1 2 3]. The
  data reader function is invoked on the form AFTER it has been read
  as a normal Clojure data structure by the reader.

  Reader tags without namespace qualifiers are reserved for
  Clojure. Default reader tags are defined in
  clojure.core/default-data-readers but may be overridden in
  data_readers.clj or by rebinding this Var.&?*default-data-reader-fn*&??When no data reader is found for a tag and *default-data-reader-fn*
  is non-nil, it will be called with two arguments,
  the tag and the value.  If *default-data-reader-fn* is nil (the
  default), an exception will be thrown for the unknown tag.&?data-reader-urls&?data-reader-var&?load-data-reader-file&?mappings&?java.net.URL&?load-data-readers&?uri?&?"Return true if x is a java.net.URI&??
&??
&?<
&??
&?
&?d
&??
&?+
&??
&?+
&??
&? "
&? ?
&?!
&?!w
&?!?
&?"[
&?"?
&?#S
&?#?
&?$
&?$?
&?$?
&?%m
&?%?
&?&U
&?clojure.core__init&?java/lang/Class&?getClassLoader()Ljava/lang/ClassLoader;&?&?
&?&?clojure/lang/Compiler&?pushNSandLoader(Ljava/lang/ClassLoader;)V&?&?
&?&?
&?popThreadBindings&?
&?CodeLineNumberTable!???%5G????????JQTW????Zg??jpsy|??????????????????????????????	$'-06=CFLOUX^ajmsv|???????????????????????#&,/58>AGJPSY\bekntw}?????????????????????????????
"(+14:=CF?N?QT?Z]?eh?nqwz??????????????????????????????????????	??"%+.47=@FI?NQ?WZ?_bh?nq?vy???????????????????????????????????????????????!$?*-?25?;>?F?LO?W?]`?h?nq?y???????????????????????????????????????
???#?),?4?:=?E?KN?V?\_?g?mp?x?~??????????????????????????????????????????"%?-?36?@?FIORX[adjmsv|?????????????????????????????? #),25;>DGMPVY_bhkqtz}??????????????????????????????			
					"	(	+	1	4	:	=	C	F	L	O	U	X	^	a	g	j	p	s	y	|	?	?	?	?	?	?	?	?	?	?	?	?	?	?	?	?	?	?	?	?	?	?	?	?	?	?	?	?


	





$
'
-
0
6
9
?
B
H
K
Q
T
Z
]
c
f
l
o
u
x
~
?
?
?
?
?
?
?
?
?
?
?
?
?
?
?
?
?
?
?
?
?
?
?
?
?
?
?
?
? #),25;>DGJMSVY\bhkqtwz?????????????????????????????? &)/28;ADJMSV\_ehnqwz?????????????????????????????









%
(
.
1
7
:
@
C
I
L?
Q?
W?
]
`?
h?
n
q?
y?

??
??
?
??
??
?
??
??
?
??
??
?
??
??
?
??
??
?
??
??
?
??????'?-0?8?>A?I?ORX[adjmsv|?????????????????????????
"%+.47=@FIORhk?s?y|?????????????????????????????????!'*039<BEKNTW]`fiorx{?????????????????????????????#&,/58>AGJPSY\bhkqw}????????????????????????????#&,/58>AGJPSY\bekntw}?????????????????????????????
"(+14:=?EH?NQ?Y\?be?mp?vy?????????????????????????????????????	!$-09<EHQT^agjpsy|?????????????????????????????	!'*039<BEKNTW]`cfloux~???????????????????????????#&,/58>AGJPSY\bekntw}????????????????????????????????	!$),149<ADILQTY\adilqty|??????????????????????????????"%&),?/2?5?\?8;?ADG?PSVY?ehnqy|???????????????????????????????	!$*-69>AGJPSY_bhkqtz}?????????????????????????????
"(.17:@CLOUZ?dgmpvy???????????????????????	&?n?Wj_?
???????"?$?'?)?-?/Y?2??4???7?;??W?=Y?>?@?FW?IY?L?)?P?SY?V?)?P?YY?\?)?PY?b?f?iY?l?)?PY?nY?o?f?rY?u?)?PY?wY?x?f?{Y?~?)?PY??Y???f??Y???)?PY??Y???f??Y???)?PY??Y???f??Y???)?PY??Y???f??Y???)?PY??Y???f??Y???)?PY??Y???f??Y???)?PY??Y???f??Y???)?PY??Y???f??Y???)?PY??Y?ɶf??Y???)?PY??Y?Ҷf??Y???)?PY??Y?۶f??Y???)?PY??Y??f??Y???)?PY??Y???f??Y???)?PY??Y???f??Y???)?PY??Y???f?Y??)?PY?Y??f?Y??)?PY?Y??f?Y??)?PY?Y??f?Y? ?)?PY?"Y?#?f?&Y?)?)?PY?+Y?,?f?/Y?2?)?PY?4Y?5?f?8??f?
AY?
D?)?PY?
FY?
G?f?
JY?
M?)?PY?
OY?
P?f?
SY?
V?)?PY?
XY?
Y?f?
\Y?
_?)?PY?
aY?
b?f?
eY?
h?)?PY?
jY?
k?f?
nY?
q?)?PY?
sY?
t?f?
wY?
z?)?PY?
|Y?
}?f?
?Y?
??)?PY?
?Y?
??f?
?Y?
??)?PY?
?Y?
??f?
?Y?
??)?PY?
?Y?
??f?
?Y?
??)?PY?
?Y?
??f?
?Y?
??)?PY?
?Y?
??f?
?Y?
??)?PY?
?Y?
??f?
?Y?
??)?PY?
?Y?
??f?
?Y?
??)?PY?
?Y?
Ŷf?
?Y?
??)?PY?
?Y?
ζf?
?Y?
??)?PY?
?Y?
׶f?
?Y?
??)?PY?
?Y?
?f?
?Y?
??)?PY?
?Y?
?f?
???i?
?
?Y?
??)?PY?
?Y?
?f?
???i?
?
?Y?
??)?PY?
?Y?
??f?
?Y??)?PY?Y??f?Y?
?)?PY?Y?
?f???i??Y??)?PY?Y??f?Y??)?PY?Y??f?"Y?%?)?PY?'Y?(?f?+Y?.?)?PY?0Y?1?f?4Y?7?)?PY?9Y?:?f?=Y?@?)?PY?BY?C?f?FY?I?)?PY????@??=??g?f?LY?O?)?PY?QY?R?f?UY?X?)?PY????@??L??g?f?[Y?^?)?PY?`Y?a?f?[??i?[??Y?d?)?PY?fY?g?f?jY?m?)?PY?oY?p?f?j??i?j?sY?v?)?P?yY?|?)?PY?~Y??f??Y???)?PY??Y???f??Y???)?PY??Y???f??Y???)?PY??Y???f??Y?Y??SY??SY??SY?SY??SY??Y??SY?PSY??SY??SY	?SY
??SY??SY??SY
??SY??SY?S??)?PY??Y???f??Y???)?PY??Y???f??Y???)?PY??Y?¶f??Y???)?PY??Y?˶f??Y???)?PY??Y?Զf??Y???)?PY??Y?ݶf??Y???)?PY??Y??f??Y???)?PY??Y??f??Y???)?PY??Y???f??Y???)?PY?Y??f?Y??)?PY?	Y?
?f?
Y??)?PY?Y??f?Y??)?PY?Y??f?Y?"?)?PY?$Y?%?f?(Y?+?)?PY?-Y?.?f?1Y?4?)?PY?6Y?7?f?:Y?=?)?PY??Y?@?f?CY?F?)?PY?HY?I?f?LY?O?)?PY?QY?R?f?UY?X?)?PY?ZY?[?f?^Y?a?)?PY?cY?d?f?gY?j?)?PY?lY?m?f?pY?s?)?PY?uY?v?f?yY?|?)?PY?~Y??f??Y???)?PY??Y???f??Y???)?PY??Y???f??Y???)?PY??Y???f??Y???)?PY??Y???f??Y???)?PY??Y???f??Y???)?PY??Y???f????i????Y???)?PY??Y???f??Y???)?PY??Y?Ƕf??Y???)?PY??Y?жf?[Y???)?PY?`Y?a?f?[??i?[??Y???)?PY??Y?ܶf??Y???)?PY??Y??f??Y???)?PY??Y??f??Y???)?PY??Y???f??Y???)?PY??Y?
?f?
Y?
?)?PY?
Y?
	?f?
Y?
?)?PY?
Y?
?f?
Y?
?)?PY?
Y?
?f?
Y?
!?)?PY?
#Y?
$?f?
??i?
?
'Y?
*?)?PY?
,Y?
-?f?
0Y?
3?)?PY?
5Y?
6?f?
9Y?
Y?
??f?
BY?
E?)?PY?
GY?
H?f?
KY?Y??SY?
NSY??SY
PSY??SY?
SSY??SY?
UY?
VSY??SY	?SY
??SY?
YSY??SY
??SY??SY?S??)?PY?
[Y?
\?f?
_Y?Y??SY?
bSY??SY
dSY??SY?
fY?
gSY??SY?SY??SY	?
jSY
??SY??SY??SY
?S??)?PY?
lY?
m?f?
pY?Y??SY?
sSY??SY
uSY??SY?
wY?
xSY??SY?SY??SY	?
{SY
??SY??SY??SY
?S??)?PY?
}Y?
~?f?
?Y?Y??SY?
?SY??SY
?SY??SY?
?Y?
?SY??SY?SY??SY	?
?SY
??SY??SY??SY
?S??)?PY?
?Y?
??f?
?Y?Y??SY?
?SY??SY
?SY??SY?
?Y?
?SY??SY?SY??SY	?
?SY
??SY??SY??SY
?S??)?PY?
?Y?
??f?
?Y?Y??SY?
?SY??SY
?SY??SY?
?Y?
?SY??SY?SY??SY	?
?SY
??SY??SY??SY
?S??)?PY?
?Y?
??f?
?Y?Y??SY?
?SY??SY
?SY??SY?
?Y?
?SY??SY
?SY??SY	?
?SY
??SY??SY??SY
?S??)?PY?
?Y?
Ķf?
?Y?Y??SY?
?SY??SY
?SY??SY?
?Y?
?SY??SY?SY??SY	?
?SY
??SY??SY??SY
?S??)?PY?
?Y?
նf?
?Y?Y??SY?
?SY??SY
?SY??SY?
?Y?
?SY??SY
?SY??SY	?
?SY
??SY??SY??SY
?S??)?PY?
?Y?
?f?
?Y?Y??SY?
?SY??SY
?SY??SY?
?Y?
?SY??SY
?SY??SY	?
?SY
??SY??SY??SY
?S??)?PY?
?Y?
??f?
?Y?Y??SY?
?SY??SYSY??SY?Y?SY??SY
?SY??SY	?SY
??SY??SY??SY
?S??)?PY?	Y?
?f?
Y?Y??SY?SY??SYSY??SY?Y?SY??SY
?SY??SY	?SY
??SY??SY??SY
?S??)?PY?Y??f?Y?Y??SY?!SY??SY#SY??SY?%Y?&SY??SY
?SY??SY	?)SY
??SY??SY??SY
?S??)?PY?+Y?,?f?/Y?Y??SY?2SY??SY4SY??SY?6Y?7SY??SY
?SY??SY	?:SY
??SY??SY??SY
?S??)?PY??)?PY?@Y?A?f?DY?G?)?PY?IY?J?f?MY?P?)?PY?RY?S?f?VY?Y?)?PY?[Y?\?f?_Y?b?)?PY?dY?e?f?hY?k?)?PY?mY?n?f?qY?t?)?PY?vY?w?f?zY?}?)?PY?Y???f??Y???)?PY??Y???f??Y???)?PY??Y???f??Y???)?PY??Y???f??Y???)?PY??Y???f??Y???)?PY??Y???f??Y???)?PY??Y???f??Y???)?PY??Y???f??Y???)?PY??Y?ȶf??Y???)?PY??Y?Ѷf??Y???)?PY??Y?ڶf??Y???)?PY??Y??f??Y???)?PY??Y??f??Y???)?PY??Y???f??Y???)?PY??Y???f?Y??)?PY?Y??f?
Y?
?)?PY?Y??f?Y??)?PY?Y??f?Y??)?PY?!Y?"?f?%Y?(?)?PY?*Y?+?f?.Y?1?)?PY?3Y?4?f?7Y?:?)?PY??)?PY?@Y?A?f?
????;????CY?D???;?GY?J?)?PY?LY?M?f?
????G????OY?P???G?SY?V?)?PY?XY?Y?f?Z?]?[?c?g?Z?]?]?c?g?`Y?c?)?PY?eY?f?f?iY?l?)?PY?nY?o?f?rY?u?)?PY?wY?x?f?{Y?~?)?PY??Y???f??Y???)?PY??Y???f??Y???)?P??Y???)?PY??Y???f??Y???)?PY??Y???f??Y???)?PY??Y???f??Y???)?PY??Y???f??Y???)?PY??Y???f??Y???)?PY??Y?öf??Y???)?PY??Y?̶f??Y???)?PY?ƶ??4?f??Y???)?PY??Y?ضf??Y???)?PY??Y??f??Y???)?PY??Y??f??Y???)?PY??Y??f??Y???)?PY??Y???f??Y??)?PY?Y??f?Y??)?PY?
Y??f?Y??)?PY?Y??f?Y??)?P? Y?#?)?PY?%Y?&?f?)Y?,?)?PY?.Y?/?f?2Y?5?)?PY?7Y?8?f?;Y?>?)?PY?@Y?A?f?DY?G?)?PY?IY?J?f?MY?P?)?PY?RY?S?f?VY?Y?)?PY?[Y?\?f?_Y?b?)?P?eY?h?)?PY?jY?k?f?e??i?e?nY?q?)?PY?sY?t?f?n??i?n?wY?z?)?PY?|Y?}?f?w??i?w??Y???)?PY??Y???f????i????Y????4??Y????4??Y????4??Y???)?PY??Y???f??Y???)?PY??Y???f??Y???)?PY??Y???f??Y???)?PY??Y???f??Y???)?PY??Y???f??Y???)?P??Y???)?PY??Y?˶f??Y???)?PY??Y?Զf??Y???)?PY??Y?ݶf??Y???)?PY??Y??f??Y???)?PY??Y??f??Y???)?PY??Y???f??Y???)?PY?Y??f?Y??)?PY?	Y?
?f??Y?
?)?PY?Y??f?Y??)?PY?Y??f?Y??)?PY?!Y?"?f?%Y?(?)?PY?*Y?+?f?.Y?1?)?PY?3Y?4?f?7Y?:?)?PY???@???
????C?:?????F??H???
????K?:?????N??P???
????S?:?????V??X???
????[?:?????^??`???
????c?:?????f??h???
????k?:?????n??p???
????s?:?????v??x???
????{?:?????~???????Y???)?PY??Y???f??Y???)?PY??Y???f??Y???)?PY??Y???f????i????Y???)?PY??Y???f??Y???)?PY??Y???f??Y???)?PY???f??Y???)?PY
????¸ƶf??Y???)?PY??Y?϶f??Y???)?PY??Y?ضf??Y???)?PY??Y??f??Y???)?PY??Y??f??Y???)?PY??Y??f??Y???)?PY??Y???f??Y??)?PY?Y??f????i???
?????????????
??????????????????????????????????????Y???4??
????!???????$??!?(?g?????!?:?????+?.?1?4?!?7?:?=?Y?Ͷ??;?@?/???C?:???F?Y?ISY?!S??g?g?gSY?KY?LS??O
??R???!???U?X???[?!??Y?^SY?`Y?aS???cY?d??4?gY?j?)?PY?lY?m?f?pY?s?)?PY?uY?v?f????x??{Y?~?)?PY??Y???f??Y???)?PY??Y???f?X??????Y??SY??Y??S???X????????Y??SY??Y??S???X????????Y??SY??Y??S????Y???)?PY??Y???f??Y???)?PY??Y???f??Y???)?PY??Y???f??Y???)?PY??Y?öf??Y???)?PY??Y?̶f??Y???)?PY??Y?նf????ع??Y???)?PY??Y??f??Y???)?PY??Y??f??Y???)?PY??Y??f??Y???)?PY??Y???f??Y??)?PY?Y??f????i???Y??)?PY?
Y??f?Y??)?PY?Y??f?Y??)?PY?Y? ?f?#Y?&?)?PY?(Y?)?f?,Y?/?)?PY?1Y?2?f?,??i?,?4Y?5??4?
????8?:?????;??=???@Y?C?)?PY?EY?F?f?IY?L?)?PY?NY?O?f?RY?U?)?PY?WY?X?f?Y?[?)?PY?]Y?^?f?aY?d?)?PY?fY?g?f?jY?m?)?PY?oY?p?f?sY?v?)?PY?xY?y?f?|Y??)?PY??Y???f??Y???)?PY??Y???f??Y???)?PY??Y???f??Y???)?PY??Y???f??Y???)?PY??Y???f??Y???)?PY??Y???f??Y???)?PY??Y???f??Y???)?PY??Y???f??Y???)?PY??Y?ʶf??Y???)?PY??Y?Ӷf?8?Y???f?BY?E?)?PY?GY?H?f?JY?K??4?NY?Q?)?PY?SY?T?f?W??Y?\?^Y?_??c?fY?i?)?PY?kY?l?f?oY?r?)?PY?tY?u?f?xY?{?)?PY?}Y?~?f??Y???)?PY??Y???f??Y???)?PY??Y???f??Y???)?PY?Y??SY??SY??SY??S??f???	S	?0P????"?OO??V?
&B
KN?????!?????K?T?????~??WW?a?a ? ?!! !?!?"J""P"(qe(?q(??(??)7?)\?**6'*[;*?J*?^+?+O?+??/Y	?/~	?/?	?0~
g0?
g0?
z0?
z0?
}13
?4?u5]?6B
F?1;?4;?@>?C>??[@??@??@??@??CB/D??Gd?G?QH&qHK?Hp?H??H??H?7I2cI2cl2cw2c?2d5?d;?d??eCeQeTe_%eq%e}%e?%gq?g??g?g?h#hB1h??h??h??j> jA 	?&????????
?????Y???SY?SY???SY?S??)???????
???Y???SY?SY???SY?S???'????7?????I???
?????
????????
???Y??SY
?SY??SY?SY??SY?S???L?????S?Y??SY?SY??SY?SY??SY?S???V?????Y???
?? ???
???Y??SY?Y"??$??*S?0?3???Y??SY?SY??SY?S??)?SY???SY5SY ??SY?SY??SY?SY??SY	?SY
??SY?S???\?7????i9???
???Y??SY?Y;??=??*S?0?3???Y??SY?SY??SY?S??)?SY???SY?SY ??SY?SY9??SY??SY??SY	?SY
??SY?SY??SY
?S???l?A????r
?YC??SY??SY ??SY?SY??SY ?SY??SY?SY??SY	?S???u?E????{
?YC??SY??SY ??SY?SY??SY%?SY??SY?SY??SY	?S???~?G?????
?YC??SY??SY ??SY?SY??SY*?SY??SY?SY??SY	?S?????I??????Y??SY?YK??NS?0?3???Y??SY2?SY??SY?S??)?SY???SYPSY ??SY?SY9??SY??SY??SY	1?SY
??SY?SY??SY
?S?????R?????T???
???Y??SY?YK??NS?0?3???Y??SY:?SY??SY?S??)?SYT??SYV?YSY???SYY ??SY?SY9??SY	??SY
??SY9?SY??SY
?SY??SY?S?????]??????Y??SY?YK??NS?0?3???Y??SYC?SY??SY?S??)?SYT??SYV?YSY???SY_SY ??SY?SY9??SY	??SY
??SYB?SY??SY
?SY??SY?S?????a??????Y??SY?YK??;??*SYK??;??"??c??fS?0?3???Y??SYL?SY??SY?S??)?SY???SYhSY ??SY?SY9??SY??SY??SY	K?SY
??SY?SY??SY
?S?????j??????Y???SYlSY??SY?Y;??NS?0?3???Y??SY]?SY??SY?S??)?SY ??SY?SY9??SY??SY??SY	[?SY
??SY?SY??SY
?S?????n??????Y???SYpSY??SY?Y;??NS?0?3???Y??SYd?SY??SY?S??)?SY ??SY?SY9??SY??SY??SY	b?SY
??SY?SY??SY
?S?????r??????Y???SYtSY??SY?Y;??NS?0?3???Y??SYk?SY??SY?S??)?SY ??SY?SY9??SY??SY??SY	i?SY
??SY?SY??SY
?S?????v??????Y???SYlSY??SY?Y;??NS?0?3???Y??SYr?SY??SY?S??)?SY ??SY?SY9??SY??SY??SY	p?SY
??SY?SY??SY
?S?????x??????Y???SYzSY??SY?Y;??NS?0?3???Y??SYy?SY??SY?S??)?SY ??SY?SY9??SY??SY??SY	w?SY
??SY?SY??SY
?S?????=??????Y??SY?YK??N???YT??SYV??S??)?S?0?3???Y??SY?SY??SY?S??)?SY???SY|SYT??SYV?YSY ??SY?SY9??SY	??SY
??SY~?SY??SY
?SY??SY?S?????~??????Y??SY?Y??????YT??SY???S??)?;??*S?0?3???Y??SY??SY??SY?S??)?SY???SY?SY ??SY?SY??SY??SY??SY	?SY
??SY?S????????????Y??SY?Y;??NS?0?3???Y??SY??SY??SY?S??)?SY???SY?SY ??SY?SY9??SY??SY??SY	??SY
??SY?SY??SY
?S????????????Y??SY?Y;??NS?0?3???Y??SY??SY??SY?S??)?SY???SY?SY ??SY?SY9??SY??SY??SY	??SY
??SY?SY??SY
?S???????????Y??SY?Y;??NS?0?3???Y??SY??SY??SY?S??)?SY???SY?SY ??SY?SY9??SY??SY??SY	??SY
??SY?SY??SY
?S??????????Y??SY?Y;??NS?0?3???Y??SY??SY??SY?S??)?SY???SY?SY ??SY?SY9??SY??SY??SY	??SY
??SY?SY??SY
?S??????????	?&????Y??SY?Y;??NS?0?3???Y??SY??SY??SY?S??)?SY???SY?SY ??SY?SY9??SY??SY??SY	??SY
??SY?SY??SY
?S??????????Y??SY?Y??????????SY?????????"??????S?0?3???Y??SY??SY??SY?S??)?SY???SY?SY ??SY?SY9??SY??SY??SY	??SY
??SY?SY??SY
?S??? ??????&?Y??SY?Y???NS?0?3???Y??SY˸SY??SY?S??)?SY???SY?SY ??SY?SY9??SY??SY??SY	ʸSY
??SY?SY??SY
?S???)??????/?Y??SY?Y??????YT??SY???S??)????*S?0?3???Y??SYԸSY??SY?S??)?SY???SY?SY ??SY?SY9??SY??SY??SY	ӸSY
??SY?SY??SY
?S???2??????8
?Y???SY??SY???SY??SY??SYܸSY??SY?SY??SY	?S??????????E?Y???SY??SY??SY߸SY??SY?SY??SY?S???H?¸???N?Y??SY?YK??NS?0?3???Y??SY?SY??SY?S??)?SY???SY?SY ??SY?SY9??SY??SY??SY	?SY
??SY?SY??SY
?S???Q?Ƹ???W?Y??SY?YK??NS?0?3???Y??SY?SY??SY?S??)?SY???SY?SY ??SY?SY9??SY??SY??SY	?SY
??SY?SY??SY
?S???Z?ʸ???`?Y???SY?SY??SY?Yθ?и?Ҹ?Ը?Nָ?ظ??SYθ?и?Ҹ??YԸ?NSYָ?SYظ?S?0?3???Y??SY"?SY??SY-?S??)?ݸ?Ҹ??S?0?3???Y??SY!?SY??SY?S??)?SY ??SY?SY??SY?SY??SY	?SY
??SY?S???c?߸???l?Y??SY?YK??NS?0?3SY???SY?SYT??SY?SY ??SY?SY9??SY	??SY
??SYR?SY??SY
?SY??SY?S???o?????u?Y??SY?Y??????YT??SY???S??)?;??*S?0?3SY???SY?SY ??SY?SY9??SY??SY??SY	Z?SY
??SY?SY??SY
?S???x?????~?Y??SY?Y??SY??NSY????*SY????????SY?????????fSY?????????????SY????????????????SY?Y??SY??SY???SY??SY???SY???SY"??SY???S??S?0?3SY???SY?SY ??SY?SY9??SY??SY??SY	a?SY
??SY?SY??SY
?S????????????Y??SY?YK??NS?0?3SY???SYSY ??SY?SY9??SY??SY??SY	o?SY
??SY?SY??SY
?S???????????Y??SY?Y??SY"????*S?0?3SY???SYSY ??SY?SY9??SY??SY??SY	{?SY
??SY?SY??SY
?S?????	??????Y??SY?Y??SY"????*S?0?3SY???SY
SY ??SY?SY9??SY??SY??SY	??SY
??SY?SY??SY
?S???????????Y??SY?Y"????*S?0?3SY???SYSY ??SY?SY9??SY??SY??SY	??SY
??SY?SY??SY
?S???????????Y??SY?Y??"?????S?0?3SY???SYSY ??SY?SY9??SY??SY??SY	??SY
??SY?SY??SY
?S???????????Y??SY?Y"????*S?0?3SY???SYSY ??SY?SY9??SY??SY??SY	??SY
??SY?SY??SY
?S???????????Y??SY?Y??"?????S?0?3SY???SYSY ??SY
?SY9??SY??SY??SY	??SY
??SY?SY??SY
?S?????!??????Y;??NS?0?3??#?Y??%???
???????'????
?Y???SY)SY??SY?Yθ?и?Ҹ?Ը?Nظ??SYθ?и?Ҹ??YԸ?NSYظ?S?0?3???Y??SY¸SY??SY.?S??)?ݸ?Ҹ??S?0?3???Y??SY??SY??SY?S??)?SY ??SY?SY??SY??SY??SY	?SY
??SY?S???
?+?????Y??SY?Y-??"??ظ??S?0?3SY???SY/SY ??SY?SY??SY??SY??SY	?SY
??SY?S????1?????Y??SY?Y-??"??ظ??S?0?3SY???SY3SY ??SY?SY??SY?SY??SY	?SY
??SY?S????5????%?Y??SY?Y;??NS?0?3SY???SY7SYT??SY#?YSY ??SY?SY9??SY	??SY
??SY??SY??SY
?SY??SY?S???(?9????.?Y??SY?Y;??NS?0?3SY???SY;SYT??SY#?YSY ??SY?SY9??SY	??SY
??SY?SY??SY
?SY??SY?S???1?	<&????>????7?Y??SY?Y;??NS?0?3SY???SY@SY ??SYBSY??SY?SY??SY	?SY
??SY?S???:?D????@?Y??SY?Y;??NS?0?3SY???SYFSYT??SY#?YSY ??SY?SY9??SY	??SY
??SY?SY??SY
?SY??SY?S???C?H????I?Y??SY?Y;??NS?0?3SY???SYJSYT??SY#?YSY ??SY?SY9??SY	??SY
??SY?SY??SY
?SY??SY?S???L?L????R?Y??SY?Y;??NS?0?3SY???SYNSYT??SY#?YSY ??SYBSY??SY	?SY
??SY?SY??SY
?S???U?P????[?Y??SY?Y?????YT??SYR??S??)?SY;?????YT??SYT??S??)??N???YT??SYR??S??)?SY;??"??V??????YT??SYR??S??)?S?0?3SY???SYXSYT??SYR?YSY ??SY?SY9??SY	??SY
??SY ?SY??SY
?SY??SY?S???^?Z????d?Y??SY?Y;??NS?0?3SY???SY\SY ??SY?SY9??SY??SY??SY	2?SY
??SY?SY??SY
?S???g?^????m?Y??SY?Y;??NS?0?3SY???SY`SY ??SY?SY9??SY??SY??SY	8?SY
??SY?SY??SY
?S???p?b????v?Y??SY?Yθ?NSYd??θ?*S?0?3SY???SYfSYT??SYh?YSY ??SY?SY9??SY	??SY
??SY>?SY??SY
?SY??SY?S???y?j?????Y??SY?Y??SYl??NS?0?3SY???SYnSY ??SY?SY9??SY??SY??SY	F?SY
??SY?SY??SY
?S?????p??????Y??SY?Y"??r??*S?0?3SY???SYtSY ??SY?SY??SYO?SY??SY	?SY
??SY?S?????u??????Y??SY?Yθ?NSYd??θ?*S?0?3SY???SYwSYT??SYy?YSY ??SY?SY9??SY	??SY
??SY^?SY??SY
?SY??SY?S?????{??????Y??SY?Yθ?NSYd??θ?*S?0?3SY???SY}SYT??SYy?YSY ??SY
?SY9??SY	??SY
??SYi?SY??SY
?SY??SY?S???????????Y??SY?Y???NS?0?3SY???SY??SY9??SY??SY??SYw?SY??SY	?SY
??SY?S????????????Y??SY?Y???NSY?????*SY????????SY??????????fSY?????????"??????S?0?3SY???SY?SY ??SY?SY9??SY??SY??SY	??SY
??SY?SY??SY
?S????????????Y??SY?Y??????YT??SY???S??)????*SY??????YT??SY???S??)?;??????SY??????YT??SY???S??)?;????????fSY??????YT??SY???S??)?;????????????SY?Y??????YT??SY???S??)?SY??SY??SY???SY??SY"??SY???S??S?0?3SY???SY?SY ??SY?SY9??SY??SY??SY	??SY
??SY?SY??SY
?S????????????Y??SY?Y??????"?????fS?0?3SY???SY?SY ??SY?SY9??SY??SY??SY	??SY
??SY?SY??SY
?S????????????Y??SY?Y"??ظ?*S?0?3SY???SY?SY ??SY?SY??SY??SY??SY	?SY
??SY?S????????????YT??SY??YSY9??SY??SY??SY?Y???N???YT??SY???S??)?S?0?3SY??SY??SY??SY	?SY
??SY?S???????????
?Y9??SY??SY??SY?Y?????YT??SY???S??)?;??*S?0?3SY??SY??SY??SY?SY??SY	?S????????????YT??SY??YSY9??SY??SY??SY?Y?????YT??SY???S??)??NS?0?3SY??SY??SY??SY	?SY
??SY?S????????????YT??SY??YSY9??SY??SY??SY?Y??????YT??SY???S??)??N???YT??SY???S??)?S?0?3SY??SY??SY??SY	?SY
??SY?S????????????YT??SYV?YSY9??SY??SY??SY?Y??????YT??SY???S??)??N???YT??SYV??S??)?S?0?3SY??SY??SY??SY	?SY
??SY?S????????????YT??SYV?YSY9??SY??SY??SY?Y??????YT??SY???S??)??N???YT??SYV??S??)?S?0?3SY??SY??SY??SY	?SY
??SY?S??????????	?&? 
?Y9??SY??SY??SY?Y???]??*S?0?3SY??SY??SY??SY?SY??SY	?S???	??????
?Y9??SY??SY??SY?Y???NS?0?3SY??SYøSY??SY?SY??SY	?S??????????Y??SY?Y??SY;??NSY;?????*SY;?????"?????fS?0?3SY???SY?SY ??SY?SY9??SY??SY??SY	ƸSY
??SY?SY??SY
?S?????????!?Y??SY?Y"??ظ?*S?0?3SY???SY?SY ??SY?SY??SY?SY??SY	?SY
??SY?S???$??????*?Y??SY?Y;??NS?0?3SY???SY?SY ??SY?SY9??SY??SY??SY	?SY
??SY?SY??SY
?S???-?ĸ???3?Y??SY?Y;??NS?0?3SY???SY?SY ??SY?SY9??SY??SY??SY	?SY
??SY?SY??SY
?S???6?ȸ???<?Y??SY?Y-??ʸ?*SY-??ʸ?̸??S?0?3SY???SY?SY ??SY?SY??SY??SY??SY	?SY
??SY?S?????и???E?Y;?????*S?0?3?HҸ??
?P?YӸ?S????S???V?????\?Y;??NSY;?????*SY;?????"?????fS?0?3?_?YӸ?S????g??j?????p?Y??SY?Y;??NSY;?????*SY;?????"?????fS?0?3SY???SY?SYT??SY#?YSY ??SY?SY9??SY	??SY
??SY+?SY??SY
?SY??SY?S???s?????y?Y;?????*S?0?3?|7??????????Y??SY?Y??SY;??NSY;??"??R???S?0?3SY???SY?SY ??SY?SY??SYB?SY??SY	?SY
??SY?S???????????Y??SY?Y??SY;??NSY;??"??R???S?0?3SY???SY?SY ??SY?SY??SYN?SY??SY	?SY
??SY?S???????????Y;??NS?0?3??[??????????YK??NS?0?3??b???????????Y;??NS?0?3??j???????????YK?????*SYK?????????S?0?3???Y???SYӸ?S?????q???????????Y;??NSY;?????*SY;?????"?????fS?0?3???YӸ?S?????|??????????Y;??NS?0?3???????????Y;??NS?0?3??????????Y9??SY??SY???SY??SY??SY?Y???K??*SY??????K???S?0?3SY??SY??SY??SY	?SY
??SY?S????????$?Y??SY?YK??NS?0?3SY???SYSY ??SY?SY9??SY??SY??SY	??SY
??SY?SY??SY
?S???'?
????-
?Y???SY??SY??SY?Y??NSY????*S?0?3SY??SY??SY??SY?SY??SY	?S???0?????6
?Y???SY??SY??SY?Y??NS?0?3SY??SY??SY??SY?SY??SY	?S???9??????
?Y???SY??SY??SY?Y??NS?0?3SY??SY¸SY??SY?SY??SY	?S???B?????H?Y??SY;??NSY;?????*SY;?????"?????fS?0?3?K????Pĸ?S?ݸ???Y?Y??SY;??NSY;?????*SY;?????"?????fS?0?3?\?	&?	?????a????dи?j?????p?Y??SY;??NSY;?????*SY;?????"?????fS?0?3?s!????xܸ?{?#??????Y??SY;??NSY;?????*SY;?????"?????fS?0?3??%?????'?????????)??????Y;??NSY;?????*SY;?????"?????fS?0?3??+??????????-??????Y;??NSY;?????*SY;?????"?????fS?0?3??/??????????1??????Y;??NSY;?????*SY;?????"?????fS?0?3??3?????5?????????7??????Y;??NSY;?????*SY;?????"?????fS?0?3???YӸ?S?????????9??????Y;??NSY;?????*SY;?????"?????fS?0?3???YӸ?S?????&????;??????Y;??NSY;?????*SY;?????"?????fS?0?3???YӸ?S?????5???=?????Y;??NSY;?????*SY;?????"?????fS?0?3?
?YӸ?S????D?????????Y;??NSY;?????*SY;?????"?????fS?0?3??????#S??&?A????,?Y;??NSY;?????*SY;?????"?????fS?0?3?/A????4]??7?C????=?Y;??NS?0?3?@g??H?E????N?Y;??NS?0?3?Qn??Y?G????_?Y;??NS?0?3?bu??j?I????p?Y;??NS?0?3?s|??{?K??????Y;??NS?0?3???????M??????Y;??NS?0?3???????O??????Y;??NS?0?3???????Q??????Y;??NS?0?3???????S??????Y;?????*S?0?3???????U??????Y;?????*S?0?3???????W??????Y;?????*S?0?3???????Y??????Y;?????*S?0?3??????[????	?Y;?????*S?0?3?????]?????Y;?????*S?0?3?¸?%?_????+?Y;?????*S?0?3?.ɸ?6?a????<?Y;?????*S?0?3??и?G?c????M?Y;??NS?0?3?P׸?X?	d&?
	
?f????^?Y;??NS?0?3?a޸?i?h????o?Yi??k??*S?0?3?r??z?m??????Yi??k??*S?0?3???????o??????Y??SY?Yi??NS?0?3SY???SYqSY ??SY?SY9??SY??SY??SY	??SY
??SY?SY??SY
?S?????s??????Y;??NS?0?3???????u??????Y;?????*SY;?????"?????fS?0?3???????????w??????Y;?????*SY;?????"?????fS?0?3???????????y??????Y;?????*SY;?????"?????fS?0?3??{?????????}??????Y;?????*SY;?????"?????fS?0?3??????? ???????????Y??SY?Y;????*S?0?3SY???SY?SY ??SY?SY9??SY??SY??SY	+?SY
??SY?SY??SY
?S????????????Y??SY?Y;????*S?0?3SY???SY?SY ??SY?SY9??SY??SY??SY	1?SY
??SY?SY??SY
?S???????????Y??SY?Y;????*S?0?3SY???SY?SY ??SY?SY9??SY??SY??SY	7?SY
??SY?SY??SY
?S?????????
?Y??SY?Y;????*S?0?3SY???SY?SY ??SY?SY9??SY??SY??SY	=?SY
??SY?SY??SY
?S???
???????Y;????*S?0?3?D????????$?Y;????*S?0?3?'J??/??????5?Y;????*S?0?3?8P??B??????H?Y??SY?Y??NS?0?3SY???SY?SY ??SY?SY9??SY??SY??SY	V?SY
??SY?SY??SY
?S???K??????Q?Y??SY?Y??NS?0?3SY???SY?SY ??SY?SY9??SY??SY??SY	b?SY
??SY?SY??SY
?S???T??????Z?Y??SY?Y??NS?0?3SY???SY?SY ??SY?SY9??SY??SY??SY	j?SY
??SY?SY??SY
?S???]??????c?Y??SY?Y;??NS?0?3SY???SY?SY ??SYBSY??SYp?SY??SY	?SY
??SY?S???f??????l?Y??SY?Y;??NS?0?3SY???SY?SY ??SYBSY??SYx?SY??SY	?SY
??SY?S???o??????u?Y??SY?Y;??NS?0?3SY???SY?SY ??SYBSY??SY~?SY??SY	?SY
??SY?S???x??????~?Y??SY?Y;??NS?0?3SY???SY?SY ??SYBSY??SY??SY??SY	?SY
??SY?S????????????Y??SY?Y;??NS?0?3SY???SY?SY ??SYBSY??SY??SY??SY	?SY
??SY?S????????????Y??SY?Y;??NS?0?3SY???SY?SY ??SYBSY??SY??SY??SY	?SY
??SY?S????????????Y??SY?Y???NS?0?3SY???SY?SY ??SY?SY9??SY??SY??SY	??SY
??SY?SY??SY
?S????????????	?&????Y??SY?Y;??NS?0?3SY???SY?SY ??SY?SY9??SY??SY??SY	??SY
??SY?SY??SY
?S?????ĸ?????Y??SY?Y;??NS?0?3SY???SY?SY ??SY?SY9??SY??SY??SY	??SY
??SY?SY??SY
?S?????ȸ?????Y??SY?YK??NS?0?3SY???SY?SY ??SY?SY9??SY??SY??SY	??SY
??SY?SY??SY
?S?????̸?????Y??SY?YK??NS?0?3SY???SY?SY ??SY?SY9??SY??SY??SY	??SY
??SY?SY??SY
?S?????и?????Y??SY?Y;??NS?0?3SY???SY?SY ??SY?SY??SYøSY??SY	?SY
??SY?S?????ָ?????Y??SY?YK?????*S?0?3SY???SY?SY ??SY?SY9??SY??SY??SY	ɸSY
??SY?SY??SY
?S?????ٸ?????Y??????*SY??????????S?0?3???Y???SYӸ?S?????Ӹ???۸?????Y??SY?Y???NSY??????*SY??????"??ݸ?fS?0?3SY???SY?SY ??SY?SY9??SY??SY??SY	ݸSY
??SY?SY??SY
?S???????????Y??SY?Y??NSY?????YT??SY??S??)????*SY?????"??ݸ?fS?0?3SY???SY?SY ??SY?SY9??SY??SY??SY	?SY
??SY?SY??SY
?S???????????Y??SY?Y??????*S?0?3SY???SY?SY ??SY?SY9??SY??SY??SY	??SY
??SY?SY??SY
?S?????????Y??SY?Y?????*S?0?3SY???SY?SY ??SY?SY9??SY??SY??SY	?SY
??SY?SY??SY
?S???
??????Y??SY?Y???NS?0?3SY???SY?SY ??SY?SY9??SY??SY??SY	?SY
??SY?SY??SY
?S??????????Y??SY?Y???NS?0?3SY???SY?SY ??SY?SY9??SY??SY??SY	?SY
??SY?SY??SY
?S?????????"?Y??SY?Y??????YT??SY???S??)??NS?0?3SY???SY?SY ??SY?SY9??SY??SY??SY	?SY
??SY?SY??SY
?S???%??????+?Y??SY?Y??????YT??SY???S??)??NS?0?3SY???SY?SY ??SY?SY9??SY??SY??SY	#?SY
??SY?SY??SY
?S???.??????4?Y??SY?Y?????YT??SY??S??)??NS?0?3SY???SYSY ??SY?SY9??SY??SY??SY	*?SY
??SY?SY??SY
?S???7?θ???=?Y??SY?Y;??NS?0?3SY???SYSYT??SYR?YSY ??SY?SY9??SY	??SY
??SY2?SY??SY
?SY??SY?S???@?????F?Y??SY?Y;?????YT??SY
??S??)??NS?0?3SY???SYSYT??SYR?YSY ??SY?SY9??SY	??SY
??SY:?SY??SY
?SY??SY?S???I?????O?Y??SY?Y;??NS?0?3SY???SYSY ??SYBSY??SYB?SY??SY	?SY
??SY?S???R?????X?Y??SY?Y;??NS?0?3SY???SYSY ??SYBSY??SYG?SY??SY	?SY
??SY?S???[?????a?Y??SY?Y;??NS?0?3SY???SYSY ??SYBSY??SYL?SY??SY	?SY
??SY?S???d?????j?Y??SY?Y;??NS?0?3SY???SYSY ??SYBSY??SYQ?SY??SY	?SY
??SY?S???m?????s?Y??SY?Y;??NS?0?3SY???SY SY ??SYBSY??SYV?SY??SY	?SY
??SY?S???v?"????|?Y??SY?Y;??NS?0?3SY???SY$SY ??SYBSY??SY[?SY??SY	?SY
??SY?S????&??????Y??SY?Y;??NS?0?3SY???SY(SY ??SYBSY??SY`?SY??SY	?SY
??SY?S?????*??????	+&?O
C?Y??SY?Y;??"??ظ??S?0?3SY???SY-SY ??SY?SY??SYe?SY??SY	?SY
??SY?S?????/??????Y??SY?Y;??1??*SY;??1??"?????fS?0?3SY???SY3SY ??SY?SY??SYq?SY??SY	?SY
??SY?S?????5??????Y??SY?Y;??"??7???S?0?3SY???SY9SY ??SY?SY??SY??SY??SY	?SY
??SY?S?????;??????Y??SY?Y;??"??7???S?0?3SY???SY=SY ??SY
?SY??SY??SY??SY	?SY
??SY?S????????????Y??SY??SY??SY?SY??SY?S????????????Y???SY??SY??SY?YA??"??C???S?0?3SY???SYESY??SY??SY??SY	?SY
??SY?S?????G??????Y??SY??SY??SY?SY??SY?S?????I??????Y??SY?Yθ?K??Ҹ?M??"??A???S?0?3???Y??SYʸSY??SY?S??)?SY???SYOSY ??SY?SY??SY??SY??SY	?SY
??SY?S?????Q??????Y??SY?YS??U??"??W??fS?0?3SY???SYYSY ??SY?SY??SY??SY??SY	?SY
??SY?S?????[??????Y??SY?YS?????YT??SY]??S??)??NS?0?3SY???SY_SY ??SYSY9??SY??SY??SY	?SY
??SY?SY??SY
?S?????a??????Y??SY?YS?????YT??SY]??S??)?U??*S?0?3SY???SYcSY ??SY?SY9??SY??SY??SY	??SY
??SY?SY??SY
?S?????e??????Y??SY?YS?????YT??SY]??S??)?g??i???S?0?3SY???SYkSY ??SY?SY9??SY??SY??SY	?SY
??SY?SY??SY
?S?????m??????Y??SY?YS?????YT??SY]??S??)??NS?0?3SY???SYoSY ??SY?SY9??SY??SY??SY		?SY
??SY?SY??SY
?S?????q??????Y??SY?YS?????YT??SY]??S??)?U??*S?0?3SY???SYsSY ??SY?SY9??SY??SY??SY	?SY
??SY?SY??SY
?S???	?u????	?Y??SY?YS?????YT??SY]??S??)??NS?0?3SY???SYwSY ??SY?SY9??SY??SY??SY	?SY
??SY?SY??SY
?S???		?y????	
?Y???SY??SY??SY?Y"??{??*S?0?3SY??SY?SY??SY?SY??SY	?S???	?}????	?Y??SY?Y??ʸ?*SY??ʸ?̸?"??????S?0?3SY???SY?SY ??SY?SY??SY'?SY??SY	?SY
??SY?S???	??????	!?Y??SY?Y??"??ظ??S?0?3SY???SY?SY ??SY?SY??SY;?SY??SY	?SY
??SY?S???	$??????	*?Y??SY?Y??ʸ?*SY??ʸ?̸?"??????S?0?3SY???SY?SY ??SY?SY??SYJ?SY??SY	?SY
??SY?S???	-??????	3?Y??SY?Y??"??ظ??S?0?3SY???SY?SY ??SY?SY??SY^?SY??SY	?SY
??SY?S???	6??????	<?Y??SY?Y??NS?0?3SY???SY?SY ??SY
?SY9??SY??SY??SY	o?SY
??SY?SY??SY
?S???	???????	E?Y??SY?Y??S?0?3SY???SY?SY ??SY
?SY9??SY??SY??SY	??SY
??SY?SY??SY
?S???	H??????	N?Y??SY?Y??S?0?3SY???SY?SY ??SY
?SY9??SY??SY??SY	??SY
??SY?SY??SY
?S???	Q??????	W?Y??SY?Y??"??ظ??S?0?3SY???SY?SY ??SY?SY??SY??SY??SY	?SY
??SY?S???	Z??????	`?Y??SY?Y??????"?????fS?0?3SY???SY?SY ??SY
?SY9??SY??SY??SY	??SY
??SY?SY??SY
?S???	c??????	i?Y??SY?Y???"??ظ??S?0?3SY???SY?SY ??SY
?SY??SY??SY??SY	?SY
??SY?S???	l??????	r?	?&?=
1?Y??SY?Y???NS?0?3SY???SY?SY ??SY
?SY9??SY??SY??SY	??SY
??SY?SY??SY
?S???	u??????	{?Y??SY?Y"?????*S?0?3SY???SY?SY ??SY
?SY??SY̸SY??SY	?SY
??SY?S???	~??????	??Y??SY?Y???NS?0?3SY???SY?SY ??SY?SY9??SY??SY??SY	ոSY
??SY?SY??SY
?S???	???????	??Y??SY?Y???NS?0?3SY???SY??SY ??SY
?SY??SYܸSY??SY	?SY
??SY?S???	???????	?
?Y???SY??SY??SY?Y??????YT??SY¸?S??)?A??*S?0?3SY??SY?SY??SY?SY??SY	?S???	??ĸ???	??Y??SY?YƸ?"??A???S?0?3SY???SY?SY ??SY?SY9??SY??SY??SY	??SY
??SY?SY??SY
?S???	??ʸ???	??Y??SY?Y̸?NS?0?3SY???SY?SY ??SY?SY??SY?SY??SY	?SY
??SY?S???	??и???	??Y??SY?Y̸?NS?0?3SY???SY?SY ??SY?SY??SY%?SY??SY	?SY
??SY?S???	??Ը???	??Y??SY?Y̸??????YT??SYָ?S??)????"??????S?0?3SY???SY?SY ??SY?SY??SY+?SY??SY	?SY
??SY?S???	??ڸ???	??Y??SY?Y?????YT??SYָ?S??)????"?????fS?0?3SY???SY?SY ??SY?SY9??SY??SY??SY	5?SY
??SY?SY??SY
?S???	??޸???	??Y??SY?Y?????YT??SYָ?S??)????"?????fS?0?3SY???SY?SY ??SY?SY9??SY??SY??SY	@?SY
??SY?SY??SY
?S???	??????	??Y??SY?Y??S?0?3SY???SY?SY ??SY?SY9??SY??SY??SY	K?SY
??SY?SY??SY
?S???	??????	??Y??SY?Y?????YT??SY??S??)????G???S?0?3SY???SY?SY ??SY?SY9??SY??SY??SY	V?SY
??SY?SY??SY
?S???	??????	??Y??SY?Y?????YT??SY??S??)????*S?0?3SY???SY?SY ??SY?SY9??SY??SY??SY	h?SY
??SY?SY??SY
?S???	??????	??Y??SY?Y?????YT??SYָ?S??)??NS?0?3SY???SY?SY ??SYSY9??SY??SY??SY	o?SY
??SY?SY??SY
?S???	???????	??Y??SY?Y?????YT??SYָ?S??)????"??A??fS?0?3SY???SY?SY ??SYSY9??SY??SY??SY	w?SY
??SY?SY??SY
?S???	???????
?Y??SY?Y?????YT??SYָ?S??)????*S?0?3SY???SYSY ??SYSY9??SY??SY??SY	??SY
??SY?SY??SY
?S???
?????
?Y??SY?Y?????YT??SYָ?S??)??NS?0?3SY???SYSY ??SYSY9??SY??SY??SY	??SY
??SY?SY??SY
?S???
?????
?Y??SY?Y?????YT??SYָ?S??)???*S?0?3SY???SY
SY ??SYSY9??SY??SY??SY	??SY
??SY?SY??SY
?S???
?????
?Y??SY?Y?????YT??SYָ?S??)??NS?0?3SY???SYSY ??SYSY9??SY??SY??SY	??SY
??SY?SY??SY
?S???
 ?????
&?Y??SY?Y??NS?0?3SY???SYSY ??SY?SY??SYSY??SY	??SY
??SY?SY??SY
?S???
)?????
/?Y??SY?Y?????YT??SYָ?S??)??NS?0?3SY???SYSY ??SY?SY??SYSY??SY	??SY
??SY?SY??SY
?S???
2?????
8?Y??SY?Y??S?0?3SY???SYSY ??SY?SY9??SY??SY??SY	ĸSY
??SY?SY??SY
?S???
;?????
A?Y??SY?Y;??NSY;??"??A???S?0?3SY???SY SY ??SY?SY9??SY??SY??SY	̸SY
??SY?SY??SY
?S???
D?"????
J
?Y???SY??SY??SY?Y$?????YT??SY&??S??)??NSY$?????YT??SY&??S??)?(??*???S?0?3SY??SY?SY??SY?SY??SY	?S???
M?	+&??
??,????
S?Y??SY?Y??NSY??(??*???S?0?3SY???SY.SY ??SY?SY9??SY??SY??SY	??SY
??SY?SY??SY
?S???
V?0????
\?Y??SY?Y;??NSY;??"??A???S?0?3SY???SY2SY ??SY?SY9??SY??SY??SY		
?SY
??SY?SY??SY
?S???
_?4????
e?Y??SY?Y0?????YT??SY6??S??)????*SY0?????YT??SY6??S??)????;???SY0?????YT??SY6??S??)????;?????fSY0?????YT??SY6??S??)????;?????"??????S?0?3SY???SY8SY ??SY?SY9??SY??SY??SY		?SY
??SY?SY??SY
?S???
h?:????
n?Y??SY?Y0?????YT??SY6??S??)????S?0?3SY???SY@SY ??SY?SY9??SY??SY??SY		+?SY
??SY?SY??SY
?S???
q?B????
w?Y??SY?Y0?????YT??SY6??S??)?>??*S?0?3SY???SYDSY ??SY?SY9??SY??SY??SY		3?SY
??SY?SY??SY
?S???
z?F????
??Y??SY?YH?????YT??SY??S??)?J??*S?0?3SY???SYLSY ??SY?SY9??SY??SY??SY		:?SY
??SY?SY??SY
?S???
??N????
??Y??SY?YH?????YT??SY??S??)??NS?0?3SY???SYPSY ??SY?SY9??SY??SY??SY		E?SY
??SY?SY??SY
?S???
??R????
??Y??SY?YH?????YT??SYT??S??)????"?????fS?0?3SY???SYVSY ??SY?SY9??SY??SY??SY		K?SY
??SY?SY??SY
?S???
??X????
??Y??SY?YH?????YT??SYT??S??)?Z??*S?0?3SY???SY\SY ??SY?SY9??SY??SY??SY		U?SY
??SY?SY??SY
?S???
??^????
??Y??SY?Y?????YT??SY`??S??)?b??"?????fS?0?3SY???SYdSY ??SY?SY9??SY??SY??SY		[?SY
??SY?SY??SY
?S???
??f????
??Y??SY?Y?????YT??SY`??S??)?b??"?????fS?0?3SY???SYhSY ??SY?SY9??SY??SY??SY		p?SY
??SY?SY??SY
?S???
??j????
??Y??SY?Y?????YT??SY`??S??)????*S?0?3SY???SYlSY ??SY?SY9??SY??SY??SY		|?SY
??SY?SY??SY
?S???
??n????
??Y??SY?Y?????YT??SY`??S??)??NS?0?3SY???SYpSY ??SY
?SY9??SY??SY??SY		??SY
??SY?SY??SY
?S???
??r????
??Y??SY?Y?????YT??SY`??S??)??NSY?????YT??SY`??S??)???*S?0?3SY???SYtSY ??SY
?SY9??SY??SY??SY		??SY
??SY?SY??SY
?S???
??v????
??Y??SY?Y?????YT??SY`??S??)??NSY?????YT??SY`??S??)???*S?0?3SY???SYxSY ??SY
?SY9??SY??SY??SY		??SY
??SY?SY??SY
?S???
??z????
??Y??SY?Y?????YT??SY`??S??)??NS?0?3SY???SY|SY ??SY?SY9??SY??SY??SY		??SY
??SY?SY??SY
?S???
??~????
??Y??SY?Y???"??ظ??S?0?3SY???SY?SY ??SY?SY??SY	??SY??SY	?SY
??SY?S???
???????
??Y??SY?Y"??ظ?*S?0?3SY???SY?SY ??SY?SY??SY	??SY??SY	?SY
??SY?S???
???????
??Y??SY?Y???NS?0?3SY???SY?SY ??SY?SYT??SY??YSY??SY		¸SY
??SY?SY??SY
?S???
???????
??Y??SY?Y??????YT??SY???S??)?>??*S?0?3SY???SY?SY ??SY?SY??SY	ɸSY??SY	?SY
??SY?S??????????Y??SY?Y??????"?????fS?0?3SY???SY?SY ??SY?SY??SY	иSY??SY	?SY
??SY?S???
???????Y??SY?Y;??NS?0?3SY???SY?SY ??SY?SY??SY	ٸSY??SY	?SY
??SY?S??????????Y??SY?Y??SY???NSY??????*SY??????"?????fS?0?3SY???SY?SY ??SY?SY9??SY??SY??SY		?SY
??SY?SY??SY
?S?????????"?Y??SY?Y???NSY??????*SY??????????SY?????????"??????S?0?3SY???SY?SY ??SY
?SY9??SY??SY??SY		??SY
??SY?SY??SY
?S???%??????+?	?&?
s?Y??SY?Y???NSY??????*SY??????????SY????????????fSY????????????"??????S?0?3SY???SY?SY ??SY?SY9??SY??SY??SY	
?SY
??SY?SY??SY
?S???.??????4?Y??SY?YK??NSY???K??*SY???K??"?????fS?0?3SY???SY?SY ??SY?SY9??SY??SY??SY	
??*S?0?3SY???SY @SY ??SY?SY9??SY??SY??SY	ƸSY
??SY?SY??SY
?S???=? B????C?Y??SY?Y???"?? >???S?0?3SY???SY DSY ??SY?SY9??SY??SY??SY	иSY
??SY?SY??SY
?S???F? F????L?Y??SY?Y?????*S?0?3SY???SY HSY ??SY?SY9??SY??SY??SY	?SY
??SY?SY??SY
?S???O? J????U?Y??SY?Y L?????YT??SY N??S??)??NS?0?3SY???SY PSY ??SY?SY9??SY??SY??SY	?SY
??SY?SY??SY
?S???X?????^?Y??SY?Y???NS?0?3SY???SY RSY ??SY?SY9??SY??SY??SY	??SY
??SY?SY??SY
?S???a? T????g?Y??SY?YK??NSY??????YT??SY V??S??)?K??*S?0?3SY???SY XSY ??SY?SY9??SY??SY??SY	?SY
??SY?SY??SY
?S???j? Z????p?Y??SY?Y \??K??*SY \????????YT??SY V??S??)?K???S?0?3SY???SY ^SY ??SY?SY9??SY??SY??SY	?SY
??SY?SY??SY
?S???s? `????y?Y??SY?YK??NSY??K??*S?0?3SY???SY bSY ??SY?SY9??SY??SY??SY	"?SY
??SY?SY??SY
?S???|? d??????Y??SY?YK??NSY??K??*S?0?3SY???SY fSY ??SY?SY9??SY??SY??SY	1?SY
??SY?SY??SY
?S????? h??????Y??SY?YK????*S?0?3SY???SY jSY ??SY?SY9??SY??SY??SY	A?SY
??SY?SY??SY
?S????? l??????Y??SY?YK????*S?0?3SY???SY nSY ??SY
?SY9??SY??SY??SY	K?SY
??SY?SY??SY
?S????? p??????Y??SY?Y??K??*SY?? 8??K???SY?? 8?? r??K??fS?0?3SY???SY tSY ??SY?SY9??SY??SY??SY	U?SY
??SY?SY??SY
?S????? v??????Y??SY?Y1??NS?0?3SY???SY xSY ??SY?SY9??SY??SY??SY	o?SY
??SY?SY??SY
?S????? z??????Y??SY?Y |??"??ظ??S?0?3SY???SY ~SY ??SY?SY??SYu?SY??SY	?SY
??SY?S????? ???????Y??SY?Y"?? ???*S?0?3SY???SY ?SY ??SY?SY9??SY??SY??SY	??SY
??SY?SY??SY
?S????? ??????
?Y9??SY??SY??SY?Y?????YT??SYָ?S??)??NS?0?3SY??SY??SY??SY?SY??SY	?S????? ???????Y??SY?Y(??"?? ????S?0?3SY???SY ?SY ??SY?SY9??SY??SY??SY	ŸSY
??SY?SY??SY
?S?????Y??SY?Y??"??ظ??S?0?3SY???SY?SY ??SY?SY??SYָSY??SY	?SY
??SY?S????? ???????Y??SY?YK?????YT??SY ???S??)??NS?0?3SY???SY ?SY ??SY
?SY9??SY??SY??SY	?SY
??SY?SY??SY
?S????? ???????Y??SY?YK?????YT??SY ???S??)??NS?0?3SY???SY ?SY ??SY
?SY9??SY??SY??SY	??SY
??SY?SY??SY
?S????? ???????Y??SY?Y??SYK??NSYK?????YT??SY ???S??)?;??*S?0?3SY???SY ?SY ??SY
?SY9??SY??SY??SY	
?SY
??SY?SY??SY
?S????	 ?&?vj? ???????Y??SY?YK?????YT??SY ???S??)????????SYK?????YT??SY ???S??)???????"??????S?0?3SY???SY ?SY ??SY
?SY9??SY??SY??SY	

?SY
??SY?SY??SY
?S????? ???????Y??SY?Y??????YT??SY ???S??)????*SY??????YT??SY ???S??)????"??ݸ?fS?0?3SY???SY ?SY ??SY
?SY9??SY??SY??SY	
?SY
??SY?SY??SY
?S????? ?????
?Y??SY?YK?????YT??SY ???S??)??NS?0?3SY???SY ?SY ??SY
?SY9??SY??SY??SY	
%?SY
??SY?SY??SY
?S???
? ?????
?Y??SY?Y??NSY?????YT??SY ???S??)????*SY?????YT??SY ???S??)????"??ݸ?fS?0?3SY???SY ?SY ??SY
?SY9??SY??SY??SY	
-?SY
??SY?SY??SY
?S???
? ?????
?Y???SY??SY??SY?Y ??? ???*S?0?3SY???SY ?SY ??SY?SY9??SY	??SY
??SY
SY ??SY?SY9??SY??SY??SY	n?SY
??SY?SY??SY
?S?????!@?????Y??SY?Y"?????*S?0?3SY???SY!BSY ??SY?SY9??SY??SY??SY	x?SY
??SY?SY??SY
?S????!D????	?Y??SY?Y"?????*S?0?3SY???SY!FSY ??SY?SY9??SY??SY??SY	??SY
??SY?SY??SY
?S????!H?????Y??SY?Y??SY!J??NSY!J??!L??!N???SY!J??!L??!N??!P??fSY!R??!J??*S?0?3SY???SY!TSY ??SY?SY9??SY??SY??SY	??SY
??SY?SY??SY
?S????!V?????Y??SY?Y??S?0?3SY???SY!XSY ??SY?SY9??SY??SY??SY	??SY
??SY?SY??SY
?S????!Z????$?Y??SY?Y???NSY!R?????*S?0?3SY???SY!\SY ??SY?SY9??SY??SY??SY	??SY
??SY?SY??SY
?S???'?!^????-?Y??SY?Y!`?? 6??*SY!`?? 6?? 4???S?0?3SY???SY!bSY ??SY?SY9??SY??SY??SY	??SY
??SY?SY??SY
?S???0?!d????6?Y??SY?Y??"??ظ??S?0?3SY???SY!fSY ??SY?SY??SYɸSY??SY	?SY
??SY?S???9?!h??????Y??SY?Y;??"??7???S?0?3SY???SY!jSY ??SY?SY??SY޸SY??SY	?SY
??SY?S???B?!l????H?Y??SY?Yθ?"??????S?0?3SY???SY!nSY ??SY?SY??SY?SY??SY	?SY
??SY?S???K?!p????Q?Y??SY?Y!r??NS?0?3SY???SY!tSY ??SY?SY??SY??SY??SY	?SY
??SY?S???T?!v????j?	!w&??}?Y ˸?NS?0?3?m
??u?!y????{?Y ˸?NS?0?3?~????!{??????Y ˸?!}??*SY ˸?!}??"??!??fS?0?3???YӸ?S?????????!???????Y ˸?!}??????SY ˸?!}??!???"??!????S?0?3???Y???S?????#????!??????
?Y???SY??SY??SY?Yθ?!???!????S?0?3SY??SY/?SY??SY?SY??SY	?S?????!???????Y???SY!?SY ??SY?SY??SY?Y ˸?!}??????SY ˸?!}??!???"??!????S?0?3SY??SY:?SY??SY	?SY
??SY?S?????!???????Y???SY!?SY ??SY?SY??SY?Y ˸?!}??????SY ˸?!}??!???"??!????S?0?3SY??SY??SY??SY	?SY
??SY?S?????!???????Y???SY!?SY ??SY?SY??SY?Y ˸?!}??????SY ˸?!}??!???"??!????S?0?3SY??SYD?SY??SY	?SY
??SY?S?????!???????Y???SY!?SY ??SY?SY??SY?Y ˸?!}??????SY ˸?!}??!???"??!????S?0?3SY??SYI?SY??SY	?SY
??SY?S?????!???????Y???SY!?SY ??SY?SY??SY?Y ˸?!}??????SY ˸?!}??!???"??!????S?0?3SY??SYN?SY??SY	?SY
??SY?S?????!???????Y???SY!?SY ??SY?SY??SY?Y ˸?!}??????SY ˸?!}??!???"??!????S?0?3SY??SYS?SY??SY	?SY
??SY?S?????!???????Y???SY!?SY ??SY?SY??SY?Y ˸?!}??????SY ˸?!}??!???"??!????S?0?3SY??SYX?SY??SY	?SY
??SY?S?????!???????Y???SY!?SY ??SY?SY??SY?Y ˸?!}??????SY ˸?!}??!???"??!????S?0?3SY??SY]?SY??SY	?SY
??SY?S?????!??????Y??SY?Y Ǹ????YT??SY???S??)?!???*SY Ǹ????YT??SY???S??)?!???"??!???fS?0?3SY???SY!?SY ??SY?SY9??SY??SY??SY	b?SY
??SY?SY??SY
?S????!??????Y??SY?YK?????YT??SY!???S??)??NS?0?3SY???SY!?SYT??SY!?SY ??SY?SY9??SY	??SY
??SYs?SY??SY
?SY??SY?S????!??????Y??SY?Y1??NS?0?3SY???SY!?SY ??SY?SY9??SY??SY??SY	??SY
??SY?SY??SY
?S????!ø??? ?Y??SY?Y1??NS?0?3SY???SY!?SY ??SY?SY9??SY??SY??SY	??SY
??SY?SY??SY
?S???#?!Ǹ???)?Y??SY?Y"????*S?0?3SY???SY!?SY ??SY?SY9??SY??SY??SY	??SY
??SY?SY??SY
?S???,?!˸???2?Y??SY?Yθ?"?????S?0?3SY???SY!?SY ??SY?SY9??SY??SY??SY	??SY
??SY?SY??SY
?S???5?!ϸ???;?Y??SY?Y???"??!Ѹ??S?0?3SY???SY!?SY ??SY?SY9??SY??SY??SY	??SY
??SY?SY??SY
?S???>?!ո???D?Y??SY?Y???"??????S?0?3SY???SY!?SY ??SY?SY9??SY??SY??SY	??SY
??SY?SY??SY
?S???G?!ٸ???M?Y??SY?Y??????*S?0?3SY???SY!?SY ??SY?SY9??SY??SY??SY	??SY
??SY?SY??SY
?S???P?!ݸ???V?Y??SY?Y L??NS?0?3SY???SY!?SY ??SY?SY9??SY??SY??SY	¸SY
??SY?SY??SY
?S???Y?!????_?Y??SY?Y???NS?0?3SY???SY!?SY ??SY?SY9??SY??SY??SY	ɸSY
??SY?SY??SY
?S???b?!????h?Y??SY?Y;??NS?0?3SY???SY!?SY ??SY?SY9??SY??SY??SY	ӸSY
??SY?SY??SY
?S???k?????q?	!?&????Y??SY?YK??NS?0?3SY???SY!?SY ??SY?SY9??SY??SY??SY	ٸSY
??SY?SY??SY
?S???t?!????z?Y???SY??SY9??SY??SY??SY?Y \?????!???S?0?3SY??SY?SY??SY	?SY
??SY?S???}?!??????Y??SY?Y???NS?0?3SY???SY!?SY ??SY?SY9??SY??SY??SY	?SY
??SY?SY??SY
?S?????!???????Y??SY?Y???NS?0?3SY???SY!?SY ??SY?SY9??SY??SY??SY	??SY
??SY?SY??SY
?S?????!???????Y??SY?Y???NS?0?3SY???SY!?SY ??SY?SY9??SY??SY??SY	??SY
??SY?SY??SY
?S?????!???????Y??SY?Y??S?0?3SY???SY!?SY ??SY?SY9??SY??SY??SY	?SY
??SY?SY??SY
?S?????"??????Y??SY?Y;??N???YT??SY"??S??)?S?0?3SY???SY"SY ??SY?SY9??SY??SY??SY		?SY
??SY?SY??SY
?S?????"??????Y??SY?Yd??NS?0?3SY???SY"SY ??SY?SY9??SY??SY??SY	?SY
??SY?SY??SY
?S?????"
??????Y??SY?Yd??NS?0?3SY???SY"SY ??SY?SY9??SY??SY??SY	?SY
??SY?SY??SY
?S?????"??????Y??SY?Yd?????*S?0?3SY???SY"SY ??SY?SY9??SY??SY??SY	"?SY
??SY?SY??SY
?S?????"??????Y??SY?Yd??NS?0?3SY???SY"SY ??SY?SY9??SY??SY??SY	-?SY
??SY?SY??SY
?S?????"??????Y??SY?Yd??NS?0?3SY???SY"SY ??SY?SY9??SY??SY??SY	8?SY
??SY?SY??SY
?S?????"??????Y??SY?Yd??NS?0?3SY???SY"SY ??SY?SY9??SY??SY??SY	??SY
??SY?SY??SY
?S?????"??????Y??SY?Y" ??"??""???S?0?3SY???SY"$SY ??SY?SY??SYI?SY??SY	?SY
??SY?S?????"&??????Y??SY?Yd??NS?0?3SY???SY"(SY ??SY?SY9??SY??SY??SY	n?SY
??SY?SY??SY
?S?????"*??????Y??SY?Y"*??",??*S?0?3SY???SY".SY ??SY?SY9??SY??SY??SY	x?SY
??SY?SY??SY
?S?????"0?????Y??SY?Yd??NS?0?3SY???SY"2SY ??SY?SY9??SY??SY??SY	??SY
??SY?SY??SY
?S????"4????
?Y??SY?Yd?????*S?0?3SY???SY"6SY ??SY?SY9??SY??SY??SY	??SY
??SY?SY??SY
?S???
?"8?????Y??SY?Y??NSY??K??*S?0?3SY???SY":SY ??SY?SY9??SY??SY??SY	??SY
??SY?SY??SY
?S????"SY ??SY?SY9??SY??SY??SY	??SY
??SY?SY??SY
?S????"@????%?Y??SY?Y;?????YT??SY"B??S??)??NS?0?3SY???SY"DSY ??SY?SY9??SY??SY??SY	??SY
??SY?SY??SY
?S???(?"F????.?Y??SY?Y;?????YT??SY"B??S??)????*S?0?3SY???SY"HSY ??SY?SY9??SY??SY??SY	??SY
??SY?SY??SY
?S???1?"J????7?Y??SY?Y"L??"??ظ??S?0?3SY???SY"NSY ??SY?SY??SYĸSY??SY	?SY
??SY?S???:?"P????@?Y??SY?Yd?????*SYd??"R??????S?0?3SY???SY"TSY ??SY?SY9??SY??SY??SY	׸SY
??SY?SY??SY
?S???C?"V????I?Y??SY?Y???NSY"R?????*S?0?3SY???SY"XSY ??SY?SY9??SY??SY??SY	?SY
??SY?SY??SY
?S???L?"Z????R?	"[&??
??Y??SY?Y??SY"????*S?0?3SY???SY"]SY ??SY?SY9??SY??SY??SY	?SY
??SY?SY??SY
?S???U?"_????[?Y??SY?Y??NS?0?3SY??SY??SY??SY?SY??SY?S???^?Y??SY?Y??"??ظ??S?0?3SY???SY"aSY ??SY?SY"c??SY??SY7??SY	?YA??SY"e??NSY"g??S?0?3???Y??SYW?SY??SY/?S??)??NSY
??SYQ?SY??SY
?SY??SY?S???d?"i????j
?Y???SY??SY??SY?Y"k??ظ?*S?0?3SY??SY^?SY??SY?SY??SY	?S???m?Y??SY?Y"?????*S?0?3SY???SY"mSY ??SY?SY"c??SY??SY7??SY	?YG??SY"o??SYԸ?NSY"g??S?0?3???Y??SYy?SY??SY
?S??)??YG??SY"o??SY?YԸ?NSY"g??S?0?3???Y??SYy?SY??SY4?S??)?SYݸ?S?0?3???Y??SYy?SY??SY*?S??)??*SY
??SYq?SY??SY
?SY??SY?S???s?Y??SY?Y??"??ظ??S?0?3SY???SY"qSY ??SY?SY"c??SY??SY7??SY	?YE??SY"e??NSY"g??S?0?3???Y??SY??SY??SY/?S??)??NSY
??SY??SY??SY
?SY??SY?S???y?"s?????Y??SY?Y??"??ظ??S?0?3SY???SY"uSY ??SY?SY??SYȸSY??SY	?SY
??SY?S?????"w??????Y??SY?Y"?????*S?0?3SY???SY"ySY ??SY?SY??SYָSY??SY	?SY
??SY?S?????"{??????Y??SY?Y |??"}??*S?0?3SY???SY"SY ??SY?SY??SY?SY??SY	?SY
??SY?S?????"???????Y??SY?Y"??ظ?*S?0?3SY???SY"?SY ??SY?SY??SY7?SY??SY	?SY
??SY?S?????"???????Y??SY?Y"??ظ?*S?0?3SY???SY"?SY ??SY?SY??SY??????Y??SY?Y#@??NS?0?3SY???SY#BSY ??SY?SY??SY
?SY??SY	??SY
??SY?SY??SY
?S?????#D??????Y??SY?Y;??NS?0?3SY???SY#FSY ??SY?SY9??SY??SY??SY	͸SY
??SY?SY??SY
?S?????#H??????Y??SY?Y#J?????YT??SY ׸?S??)??????YT??SY ׸?S??)??*???YT??SY ׸?S??)?S?0?3SY???SY#LSY ??SY?SY9??SY??SY??SY	׸SY
??SY?SY??SY
?S?????#N??????Y??SY?YK??N???YT??SY ׸?S??)?S?0?3SY???SY#PSY ??SY?SY9??SY??SY??SY	?SY
??SY?SY??SY
?S????#R?????	#S&?
?
??Y??SY?YK??N???YT??SY ׸?S??)?S?0?3SY???SY#USY ??SY?SY9??SY??SY??SY	?SY
??SY?SY??SY
?S???	?#W?????Y??SY?Y#Y??NSY#Y??K??*S?0?3SY???SY#[SY ??SY?SY9??SY??SY??SY	??SY
??SY?SY??SY
?S????#]?????Y??SY?Yθ?"??#_???S?0?3SY???SY#aSY ??SY?SY??SY
?SY??SY	?SY
??SY?S????#c????!?Y??SY?YK??NS?0?3SY???SY#eSY ??SY?SY9??SY??SY??SY	?SY
??SY?SY??SY
?S???$?!????*?Y??SY?Y??!}??#g??!r??fS?0?3SY???SY#iSY ??SY?SY??SY!?SY??SY	?SY
??SY?S???-?#k????3?Y??SY?Y??!}??#g??#m??!r???S?0?3SY???SY#oSY ??SY?SY??SY1?SY??SY	?SY
??SY?S???6?#q????<?Y#s??NSY#u??#w??*S?0?3???Y
??SYӸ?S????G=??J?#y????P?Y#s??NSY#u??#w??*S?0?3?S?Y
??SYӸ?S????[E??^?#{????d?Y#s??NSY#u??#w??*S?0?3?g?Y
??SYӸ?S????oM??r?#}????x?Y#s??NSY#u??#w??*S?0?3?{?Y
??SYӸ?S?????U????#??????Y#s??NSY#u??#w??*S?0?3???Y
??SYӸ?S?????]????#???????Y#s??NSY#u??#w??*S?0?3???Y
??SYӸ?S?????e????#???????Y#s??NS?0?3???Y
??S?????m????#???????Y#s??NSY#u??#w??*S?0?3???Y
??SYӸ?S?????t????#???????Y#s??NSY#u??#w??*S?0?3???Y
??SYӸ?S?????|????#???????Y??SY?Yc??NS?0?3SY???SY#?SY ??SY
?SY??SY??SY??SY	?SY
??SY?S?????#???????Y??SY?Yc??NS?0?3SY???SY#?SY ??SY
?SY??SY??SY??SY	?SY
??SY?S????#??????Y??SY?Yc??NS?0?3SY???SY#?SY ??SY
?SY??SY??SY??SY	?SY
??SY?S????#??????Y??SY?Yc??NS?0?3SY???SY#?SY ??SY
?SY??SY??SY??SY	?SY
??SY?S????#?????#?Y??SY?Yc??NS?0?3SY???SY#?SY ??SY?SY??SY??SY??SY	?SY
??SY?S???&?#?????/?Y??SY?Yc??NS?0?3SY???SY#?SY ??SY?SY??SY??SY??SY	?SY
??SY?S???2?#?????;?Y??SY?Yc??NS?0?3SY???SY#?SY ??SY?SY??SY??SY??SY	?SY
??SY?S???>?#?????G?Y??SY?Yc??NS?0?3SY???SY#?SY ??SY?SY??SY??SY??SY	?SY
??SY?S???J?#?????S?Y??SY?Y;??NS?0?3SY???SY#?SY ??SYBSY??SY??SY??SY	?SY
??SY?S???V?#?????`?Y??SY?Y???NSY#??????*S?0?3SY???SY#?SY ??SY?SY9??SY??SY??SY	??SY
??SY?SY??SY
?S???c?#?????i?	#?&?5)?Y??SY?Y;??NS?0?3SY???SY#?SY ??SY?SY9??SY??SY??SY	?SY
??SY?SY??SY
?S???l?#?????r
?Y???SY??SY??SY?Y???NS?0?3SY??SY?SY??SY?SY??SY	?S???u?#?????{
?Y???SY??SY??SY?Y??????YT??SY???S??)??NS?0?3SY??SY??SY??SY?SY??SY	?S???~?#??????
?Y???SY??SY??SY?Y??????YT??SY???S??)??NS?0?3SY??SY??SY??SY?SY??SY	?S?????#???????Y??SY??SY??SY??SY??SY?SY??SY?S?????#??????
?Y???SY??SY??SY?Y#¸????YT??SY#ĸ?S??)?θ?!`???S?0?3SY??SY??SY??SY?SY??SY	?S????
?Y???SY??SY??SY?Y#¸?!`??*S?0?3SY??SY?SY??SY?SY??SY	?S?????#Ƹ????
?Y???SY??SY??SY?Y#ȸ????*SY#ȸ????#ʸ??S?0?3SY??SY?SY??SY?SY??SY	?S?????#̸?????Y??SY?Y!`?????YT??SY"B??S??)????"?????fS?0?3SY???SY#?SY ??SY?SY9??SY??SY??SY	!?SY
??SY?SY??SY
?S?????#и?????Y??SY?Y"??#Ҹ?*S?0?3SY???SY#?SY ??SYSY9??SY??SY??SY	(?SY
??SY?SY??SY
?S?????#ָ?????Y??SY?Y"??#Ҹ?*S?0?3SY???SY#?SY ??SYSY9??SY??SY??SY	0?SY
??SY?SY??SY
?S?????#ڸ?????Y??SY?Y??S?0?3SY???SY#?SY ??SY?SY9??SY??SY??SY	8?SY
??SY?SY??SY
?S?????Y???SY??SY??SY>?SY??SY?SY??SY?S?????#޸?????Y??SY?YK??NS?0?3SY???SY#?SY ??SY?SY9??SY??SY??SY	A?SY
??SY?SY??SY
?S?????#??????Y??SY?Y??????YT??SY???S??)??NS?0?3SY???SY#?SY ??SY?SY9??SY??SY??SY	G?SY
??SY?SY??SY
?S?????#??????Y??SY?Y ͸????YT??SY???S??)??NS?0?3SY???SY#?SY ??SY?SY9??SY??SY??SY	Q?SY
??SY?SY??SY
?S?????#??????Y??SY?Y#??#??*SY???#??#???S?0?3SY???SY#?SY ??SY?SY??SY\?SY??SY	?SY
??SY?S?????#??????Y??SY?YT??NSY???T??*S?0?3SY???SY#?SY ??SY?SY??SYq?SY??SY	?SY
??SY?S?????#???????Y??SY?YT??NSY???T??*S?0?3SY???SY#?SY ??SY?SY??SY~?SY??SY	?SY
??SY?S????#??????Y??SY?YT??NSY???T??*S?0?3SY???SY#?SY ??SY?SY??SY??SY??SY	?SY
??SY?S????#??????Y??SY?YT??#??*SY???T??#???S?0?3SY???SY$SY ??SY?SY??SY??SY??SY	?SY
??SY?S????$?????Y??SY??SY??SY??SY??SY?SY??SY?S????$???? ?Y??SY?YT??#??*SY???T??#???S?0?3SY???SY$SY ??SY?SY??SY??SY??SY	?SY
??SY?S???#?$????)?Y??SY?Y;??NSY;?????*SY;?????"?????fS?0?3SY???SY$
SYT??SY#?YSY ??SY?SY9??SY	??SY
??SYոSY??SY
?SY??SY?S???,?$????2?Y??SY?Y$?????YT??SY$??S??)??NS?0?3SY???SY$SY ??SY?SY??SY?SY??SY	?SY
??SY?S???5?$????;?Y??SY?Y$??NS?0?3SY???SY$SY ??SY?SY9??SY??SY??SY	??SY
??SY?SY??SY
?S???>?$????D?Y??SY?Y???NS?0?3SY???SY$SY ??SY?SY9??SY??SY??SY	?SY
??SY?SY??SY
?S???G?	$&?cW?$????M?Y??SY?Y$!??"?????????YT??SYR??S??)?S?0?3SY???SY$#SY ??SY?SY9??SY??SY??SY	
?SY
??SY?SY??SY
?S???P?$%????V?Y??SY?Y$!??"??????S?0?3SY???SY$'SY ??SY?SY9??SY??SY??SY	?SY
??SY?SY??SY
?S???Y?$)????_?Y??SY??SY??SY?SY??SY?SY??SY?S???b?$+????e?Y??SY?Y"??ظ?*S?0?3SY??SY?SY??SY?SY??SY?S???h?d????n?Y??SY?Yθ?K??Ҹ?$-??fS?0?3???Y??SY9?SY??SY?S??)?SY???SY$/SY ??SY?SY??SY$?SY??SY	?SY
??SY?S???q?$1????w?Y??SY?Y"??""??*S?0?3SY???SY$3SY ??SY?SY??SY^?SY??SY	?SY
??SY?S???z?$5??????Y??SY?Yθ?!r??*S?0?3SY???SY$7SY ??SY?SY??SYd?SY??SY	?SY
??SY?S?????$9??????Y???SY??SY??SY?Y???$!??"?????fS?0?3SY???SY$;SY??SY~?SY??SY	?SY
??SY?S?????$=??????Y???SY??SY??SY?Y;??NS?0?3SY???SY$?SY??SY??SY??SY	?SY
??SY?S?????$A??????Y???SY??SY??SY?Y;??K??*S?0?3SY???SY$CSY??SY??SY??SY	?SY
??SY?S?????$E??????Y???SY??SY??SY?Y$G??NS?0?3SY???SY$ISYT??SYR?YSY??SY	??SY
??SY?SY??SY
?S?????$K??????Y???SY??SY??SY?Y$G??NS?0?3SY???SY$MSY??SY??SY??SY	?SY
??SY?S?????$N?????
?Y$P??SY??SY??SY??SY??SY??SY??SY?SY??SY	?S?????$R??????Y???SY??SY??SY?Y$G??$T??$V???S?0?3SY???SY$XSY??SY??SY??SY	?SY
??SY?S?????$Z??????Y???SY??SY??SY?Y$G??$T??$V???S?0?3SY???SY$\SY??SY??SY??SY	?SY
??SY?S?????$^??????Y???SY??SY??SY?Y$`??$G??"??A??fS?0?3SY???SY$bSY??SYȸSY??SY	?SY
??SY?S?????$d??????Y???SY??SY??SY?Y"?????*S?0?3SY???SY$fSY??SY?SY??SY	?SY
??SY?S?????$h??????Y???SY??SY??SY?Y$j??NS?0?3SY???SY$lSY??SY?SY??SY	?SY
??SY?S?????$V??????Y??SY?Y"?????*S?0?3SY???SY$nSY ??SY?SY??SY?SY??SY	?SY
??SY?S?????$p??????Y??SY?Y"?????*S?0?3SY???SY$rSY ??SY?SY??SYW?SY??SY	?SY
??SY?S?????$t?????Y??SY?Y??S?0?3SY???SY$vSY ??SY?SY??SYb?SY??SY	?SY
??SY?S????Y??SY?Y"??$x??*S?0?3SY???SY$zSY$P??SY??SY ??SY?SY??SY	g?SY
??SY?SY??SY
?S???
?$|?????Y??SY?Y$G??NS?0?3SY???SY$~SY ??SY?SY??SYz?SY??SY	?SY
??SY?S????$??????Y??SY?Y???ݸ?*SY???ݸ?????S?0?3SY???SY$?SY ??SYSY9??SY??SY??SY	??SY
??SY?SY??SY
?S????$?????%?Y??SY?Y???#??"??ݸ??!`???S?0?3SY???SY$?SY ??SY?SY9??SY??SY??SY	??SY
??SY?SY??SY
?S???(?$?????.?	$?&??
??Y??SY?Y???ݸ????"??????S?0?3SY???SY$?SY ??SY?SY9??SY??SY??SY	??SY
??SY?SY??SY
?S???1?$?????7?Y??SY?Y???#??????SY???#?????;??fSY???#?????;??????SY???#?????;?????????SY?Y???SY#??SY???SY;??SY???SY???SY"??SY???S??S?0?3SY???SY$?SY ??SY?SY9??SY??SY??SY	??SY
??SY?SY??SY
?S???:?$?????@?Y??SY?YK??NS?0?3SY???SY$?SY ??SY?SY9??SY??SY??SY	ȸSY
??SY?SY??SY
?S???C?$?????I?Y??SY?Y;??NS?0?3SY???SY$?SY ??SY?SY9??SY??SY??SY	ϸSY
??SY?SY??SY
?S???L?$?????R?Y??SY?Y;??NS?0?3SY???SY$?SY ??SY?SY9??SY??SY??SY	ոSY
??SY?SY??SY
?S???U?$?????[?Y??SY?Y;??NS?0?3SY???SY$?SY ??SYBSY??SY۸SY??SY	?SY
??SY?S???^?$?????d?Y??SY?Y;??NS?0?3SY???SY$?SY ??SY?SY9??SY??SY??SY	?SY
??SY?SY??SY
?S???g?$?????m?Y??SY?Y;??NS?0?3SY???SY$?SY ??SY?SY9??SY??SY??SY	?SY
??SY?SY??SY
?S???p?$?????v?Y??SY?YK??NS?0?3SY???SY$?SY ??SY?SY9??SY??SY??SY	?SY
??SY?SY??SY
?S???y?$??????Y??SY?YK??NS?0?3SY???SY$?SY ??SY?SY9??SY??SY??SY	??SY
??SY?SY??SY
?S?????$???????Y??SY?YK??NS?0?3SY???SY$?SY ??SY?SY9??SY??SY??SY	??SY
??SY?SY??SY
?S?????$???????Y??SY?YK??NS?0?3SY???SY$?SY ??SY?SY9??SY??SY??SY	?SY
??SY?SY??SY
?S?????$???????Y??SY?YK??NS?0?3SY???SY$?SY ??SY?SY9??SY??SY??SY	?SY
??SY?SY??SY
?S?????$???????Y??SY?YK??NS?0?3SY???SY$?SY ??SYBSY??SY?SY??SY	?SY
??SY?S?????$???????Y???SY$?SY ??SY?SY???SY??SY??SY?SY??SY	?SY
??SY?S?????$Ÿ?????Y???SY$?SY ??SY?SY???SY??SY??SY?SY??SY	?SY
??SY?S?????$ɸ?????Y???SY$?SY ??SY?SY???SY??SY??SY?SY??SY	?SY
??SY?S?????$͸?????Y???SY$?SY ??SY?SY???SY??SY??SY ?SY??SY	?SY
??SY?S?????$Ѹ?????Y??SY?Y???NSY???"??????S?0?3SY???SY$?SY ??SY?SY9??SY??SY??SY	%?SY
??SY?SY??SY
?S?????$Ը?????Y??SY?Yd??θ????YT??SYh??S??)??*SYd??θ?????S?0?3SY???SY$?SY ??SY?SY9??SY??SY??SY	7?SY
??SY?SY??SY
?S?????$ظ?????Y??SY?Y-??"??ظ??S?0?3SY???SY$?SY ??SY?SY??SYG?SY??SY	?SY
??SY?S?????$ܸ?????Y??SY?Y???NS?0?3SY???SY$?SY ??SY?SY9??SY??SY??SY	Q?SY
??SY?SY??SY
?S?????$??????Y??SY?Y???!r??"??r??fS?0?3SY???SY$?SY ??SY?SY??SYa?SY??SY	?SY
??SY?S?????$??????$??????$?????
?Y??SY?Yθ?$??????S?0?3SY???SY??SY??SY??SY??SY?SY??SY	?S?????$?????Y ??SY?S????$?????Y ??SY?S????$?????Y ??SY?S????$?????Y ??SY?S????	$?&????$?????#?Y ??SY?S???&?$?????+?Y ??SY
?S???.?$?????3?Y ??SY"?S???6?$?????;?Y ??SY?S???>?$?????C?Y ??SY?S???F?$?????K?Y ??SY?S???N?%????S?Y ??SY?S???V?%????[?Y ??SY?S???^?%????c?Y ??SY?S???f?%????k?Y ??SY?S???n?%	????s?Y ??SY?S???v?%????{?Y ??SY?S???~?%
??????Y??SY?Y;??NS?0?3SY???SY%SY ??SY
?SY9??SY??SY??SY	?SY
??SY?SY??SY
?S?????%??????Y??SY?Y??????YT??SY&??S??)??NS?0?3SY???SY%SY ??SY
?SY9??SY??SY??SY	?SY
??SY?SY??SY
?S?????%??????Y??SY?Y%??"??ظ??S?0?3SY???SY%SY ??SY?SY7??SY?Y%??SY%??NSY"g??S?0?3???Y??SY?SY??SY?S??)??NSY"c??SY	??SY
#@??SYSY??SY
?SY??SY?SY??SY?S?????%??????Y??SY?Y???;??*SY???;??????SY???;????????fS?0?3SY???SY%SY ??SYSY9??SY??SY??SY	&?SY
??SY?SY??SY
?S?????%!?????
?Y???SY??SY??SY?Y%#??%%??;???S?0?3SY??SYA?SY??SY?SY??SY	?S?????%'??????Y???SY??SY??SYD?SY??SY?SY??SY?S????%(?ٳ??%+??????Y???SY??SY??SYE?SY??SY?SY??SY?S?????%-??????Y???SY??SY??SY?Y%/??NS?0?3SY???SY%1SY??SYG?SY??SY	?SY
??SY?S?????%3??????Y???SY??SY??SY?Y%5??%7??%9??%;??fS?0?3SY???SY%=SY??SYQ?SY??SY	?SY
??SY?S?????%???????Y???SY??SY??SY?Y#???NS?0?3SY???SY%ASY??SY\?SY??SY	?SY
??SY?S?????%C??????Y???SY??SY??SY?Y%9??%;??*S?0?3SY???SY%ESY??SYb?SY??SY	?SY
??SY?S?????%G??????Y???SY??SY??SY?Y%I??%K??%9??%;??fS?0?3SY???SY%MSY??SYr?SY??SY	?SY
??SY?S?????%O??????Y???SY??SY??SY?Y%I??%K??%9??%;??fS?0?3SY???SY%QSY??SY??SY??SY	?SY
??SY?S?????%S??????Y??SY?Y???"??r???S?0?3SY???SY%USY ??SYSY??SY??SY??SY	?SY
??SY?S???????%W?Y??%Y????!?%[????$?Y%]?????Y???SYSY??SY?Y%_??NS?0?3S??)?S?0?3?%a?(?Y%c??SY%W??SY%e??SY%W?YS???+????
?.?Y%]??SY?Yθ?SY%]?????Y???SYSY??SY?Y%_??NS?0?3S??)?SY??SY?Y%_??NS?0?3SY???SYS?S???1%f???
?4%h???
?7%]???
?^?Y%]??SY%]??S???:%j???
?=%]?????Y???SYSY??SY?Y%_??NS?0?3S??)???C?Yθ?SY%]?????Y???SYSY??SY?Y%_??NS?0?3S??)?SY??SY?Y%_??NS?0?3SY???SYS???F%l???
?I?	%m&?
s?%o????R%Y????U?%q????X%s?Y?[?%u????g?Y??SY?Y%_??NS?0?3SY???SY%wSY ??SYBSY??SY?SY??SY	?SY
??SY?S???j?%y????p?Y??SY?Y;??NS?0?3SY???SY%{SY ??SYBSY??SY?SY??SY	?SY
??SY?S???s?%}????{?Y??SY?Y;??NS?0?3SY???SY%SY ??SYBSY??SY?SY??SY	?SY
??SY?S???~?%???????Y??SY?Y???K??*SY??????K???S?0?3SY???SY%?SY ??SY?SY??SY?SY??SY	?SY
??SY?S????%?%??????%????
??%??Y??%??Y???%???????Y??SY?Y???#m??K???S?0?3SY???SY%?SY ??SY"?SY??SYC?SY??SY	?SY
??SY?S?????%???????Y??SY?Y???NSY???%???*S?0?3SY???SY%?SY ??SY?SY??SYN?SY??SY	?SY
??SY?S?????%???????Y??SY?Y??????K???SY??????#m??K??fS?0?3SY???SY%?SY ??SY?SY??SYZ?SY??SY	?SY
??SY?S?????%???????Y??SY?Y??SY ???NSY ??? ???*SY ?????? ????S?0?3SY???SY%?SY ??SY?SY9??SY??SY??SY	k?SY
??SY?SY??SY
?S?????%???????Y??SY?Y???K??*SY???ո?׸??SY???ո?׸?ٸ?fSY???ո?׸?ٸ?"??????S?0?3SY???SY%?SY ??SY"?SY9??SY??SY??SY	{?SY
??SY?SY??SY
?S?????%???????Y??SY?Y???K??*S?0?3SY???SY%?SY ??SY"?SY9??SY??SY??SY	??SY
??SY?SY??SY
?S????%???%???%????????%??????
?Y???SY??SY??SY?Y!R??NS?0?3SY??SY??SY??SY?SY??SY	?S?????%???????Y??SY?Y???"??!R???S?0?3SY???SY%?SY ??SY?SY??SY??SY??SY	?SY
??SY?S?????%???????Y??SY?Y???%???"??A??fS?0?3SY???SY%?SY ??SYSY??SY??SY??SY	?SY
??SY?S?????%???????Y??SY?Y???NS?0?3SY???SY%?SY ??SY
?SY9??SY??SY??SY	??SY
??SY?SY??SY
?S?????%???????Y??SY?Y"??ظ?*S?0?3SY???SY%?SY ??SY
?SY??SYѸSY??SY	?SY
??SY?S????%ø????Y??SY?Y??????YT??SY&??S??)??NS?0?3SY???SY%?SY ??SY
?SY9??SY??SY??SY	۸SY
??SY?SY??SY
?S????%Ǹ????Y??SY?Y??????YT??SY&??S??)??NS?0?3SY???SY%?SY ??SY
?SY9??SY??SY??SY	?SY
??SY?SY??SY
?S????%˸????Y??SY?Y???K??*SY???K??"?????fS?0?3SY???SY%?SY ??SY?SY9??SY??SY??SY	?SY
??SY?SY??SY
?S????%ϸ???#?Y??SY?Y"??%Ѹ?*S?0?3SY???SY%?SY ??SY?SY9??SY??SY??SY	?SY
??SY?SY??SY
?S???&?%ո???,?Y??SY?Y"??#??*S?0?3SY???SY%?SY ??SY?SY9??SY??SY??SY	?SY
??SY?SY??SY
?S???/?%ٸ???8?Y ??SY?S???;?%۸???@?Y??SY?Y??S?0?3SY???SY%?SY ??SY?SY??SY,?SY??SY	?SY
??SY?S???C?%߸???I?Y??SY?Y??S?0?3SY???SY%?SY ??SY
?SY9??SY??SY??SY	;?SY
??SY?SY??SY
?S???L?%????R?	%?&????Y??SY?Y%߸????*S?0?3SY???SY%?SY ??SY
?SY9??SY??SY??SY	Z?SY
??SY?SY??SY
?S???U?Y??SY?Y;??NS?0?3SY???SY%?SY ??SYSY9??SY??SY??SY	c?SY
??SY?SY??SY
?S???[?%????a?Y??SY?Y???K??*S?0?3SY???SY%?SY ??SYSY9??SY??SY??SY	m?SY
??SY?SY??SY
?S???d?%????j?Y??SY?Y???NSY???K??*S?0?3SY???SY%?SY ??SYSY9??SY??SY??SY	{?SY
??SY?SY??SY
?S???m?%????s?Y??SY?YK??NS?0?3SY???SY%?SY ??SYSY9??SY??SY??SY	??SY
??SY?SY??SY
?S???v?%?????|?Y??SY?Y???K??*SY???#m??K???S?0?3SY???SY%?SY ??SYSY??SY??SY??SY	?SY
??SY?S????%???????Y??SY?YK??NS?0?3SY???SY%?SY ??SYSY9??SY??SY??SY	¸SY
??SY?SY??SY
?S?????%???????Y??SY?Y?????YT??SY ׸?S??)??NSY??K??*SY?? 8??K???S?0?3SY???SY&SY ??SYSY9??SY??SY??SY	˸SY
??SY?SY??SY
?S?????&??????Y??SY?YK?????YT??SY!???S??)??NS?0?3SY???SY&SY ??SYSY9??SY??SY??SY	??SY
??SY?SY??SY
?S?????&??????Y??SY?Y???NSY???K??*S?0?3SY???SY&SY ??SYSY9??SY??SY??SY	??SY
??SY?SY??SY
?S?????&
??????Y??SY?Y???NSY???K??*S?0?3SY???SY&SY ??SYSY9??SY??SY??SY	?SY
??SY?SY??SY
?S?????&??????Y??SY?Y???NSY???K??*S?0?3SY???SY&SY ??SYSY9??SY??SY??SY	5?SY
??SY?SY??SY
?S?????&??????Y??SY?Y??K??*S?0?3SY???SY&SY ??SYBSY??SY[?SY??SY	?SY
??SY?S?????&??????Y??SY?Y&??NSY&??&??*SY&??&??&???SY&??&??&??"??& ???S?0?3SY???SY&"SY ??SY
?SY??SYg?SY??SY	?SY
??SY?S?????&$??????Y??SY?Y&??NSY&??&??*SY&??&??&???SY&??&??&??"??& ???S?0?3SY???SY&&SY ??SY
?SY??SY??SY??SY	?SY
??SY?S?????Y???SY??SY???SY??SY??SY?Y&(??NS?0?3SY???SY&*SY??SY	??SY
??SY?SY??SY
?S?????&,??????Y??SY?Y???&.??*S?0?3SY???SY&0SY ??SY
?SY??SY͸SY??SY	?SY
??SY?S?????&2??????Y??SY?Y??"??ظ??S?0?3SY???SY&4SY ??SY
?SY??SY?SY??SY	?SY
??SY?S?????&6??????Y??SY?Y;?????YT??SY&8??S??)??NS?0?3SY???SY&:SY ??SY
?SY??SY?SY??SY	?SY
??SY?S?????&SY ??SY?SY??SY??SY??SY	?SY
??SY?S?????&@??????Y??SY?Y!r??"??r???S?0?3SY???SY&BSY ??SY?SY??SY?SY??SY	?SY
??SY?S????&D?????Y??SY?Y!r??θ?"??7??fS?0?3SY???SY&FSY ??SY?SY??SY?SY??SY	?SY
??SY?S???	?&H?????Y??SY?Y!r??"??7???S?0?3SY???SY&JSY ??SY?SY??SY#?SY??SY	?SY
??SY?S????&L?????Y??SY?Y!r??"??7???S?0?3SY???SY&NSY ??SY?SY??SY1?SY??SY	?SY
??SY?S????&P????!
?Y???SY??SY??SY?Y&R??NS?0?3SY??SY??SY??SY?SY??SY	?S???$?Y??SY?Y&R??NS?0?3SY???SY&TSY ??SY?SY??SYF?SY??SY	?SY
??SY?S???*?	&U&?
?

??&W????0?Y??SY?Y???NSY???&Y??*S?0?3SY???SY&[SY ??SYBSY??SYR?SY??SY	?SY
??SY?S???3?&]????9?Y??SY?Y??SYK??NS?0?3SY???SY&_SY ??SY?SY??SYj?SY??SY	?SY
??SY?S???<?&a????B?Y??SY?Y&c??NSY&c??K??*S?0?3SY???SY&eSY ??SY?SY??SY|?SY??SY	?SY
??SY?S???E?&g????N?Y??SY?Y&i??K??*S?0?3???Y??SY??SY??SY?S??)?SY???SY&kSY ??SY?SY??SY??SY??SY	?SY
??SY?S???Q?&m????W&o?Y?\?&q????f?Y??SY?Y&s??K??*S?0?3SY???SY&uSY ??SY?SY??SY??SY??SY	?SY
??SY?S???i?&w????o?Y??SY?Y&y??NS?0?3SY???SY&{SY ??SY?SY??SY??SY??SY	?SY
??SY?S???r?&}????x?Y??SY?YT?????YT??SYh??S??)?1??*S?0?3SY???SY&SY ??SY?SY??SY??SY??SY	?SY
??SY?S???{?&???????Y??SY?Y&y??NS?0?3SY???SY&?SY ??SY?SY??SY??SY??SY	?SY
??SY?S?????&???????Y??SY?Y1??&??????YT??SY&???S??)??*S?0?3SY???SY&?SY ??SY?SY??SY??SY??SY	?SY
??SY?S?????&??????
?Y ??SY"?SY??SYɸSY??SY?SY??SY?SY???SY	&?S????%_?????&?&??????x?????&?&???????&???????Y ??SY"?SY???SY??SY??SYϸSY??SY?SY??SY	?SY
???SY&?S?????&???????Y ??SY?SY???SY??SY??SY?SY??SY?SY??SY	?SY
???SY&?S?????&??????
?Y???SY??SY??SY?Y??S?0?3SY??SY?SY??SY?SY??SY	?S?????&??????
?Y???SY??SY??SY?Y???NS?0?3SY??SY??SY??SY?SY??SY	?S?????&??????
?Y???SY??SY??SY?Y&???#@?????YT??SY&???S??)??*S?0?3SY??SY??SY??SY?SY??SY	?S?????&??????
?Y???SY??SY??SY?Y??S?0?3SY??SY?SY??SY?SY??SY	?S?????&???????Y??SY?Y;??NS?0?3SY???SY&?SY ??SYBSY??SY&?SY??SY	?SY
??SY?S????	&?&?|h?&??&??&??&??&??&??&??&??&¸&ĸ&Ƹ&ȸ&ʸ&̸&θ&и&Ҹ&Ը&ָ&ظ&ڸ&ܸ&޸&?&?&?&?Y?&?&?&??&???&???Z]c




© 2015 - 2025 Weber Informatics LLC | Privacy Policy