From def6b2864eb521f6f8fd04b0c479f20b33f7d481 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Tue, 5 Jul 2022 15:57:40 -0700
Subject: [PATCH 001/125] spec

---
 ConditionalConstraints.md | 55 +++++++++++++++++++++++++++++++++++++++
 1 file changed, 55 insertions(+)
 create mode 100644 ConditionalConstraints.md

diff --git a/ConditionalConstraints.md b/ConditionalConstraints.md
new file mode 100644
index 000000000..4d5ff0769
--- /dev/null
+++ b/ConditionalConstraints.md
@@ -0,0 +1,55 @@
+# Conditional Constraints
+
+## Syntax
+
+The front-end AST has a new constructor:
+
+```hs
+data BindDef name = DPropGuards [([Prop name], Expr name)] | ...
+```
+
+which is parsed from the following syntax:
+
+```
+<name> : <signature>
+<name> <pats>
+[ | <props> => <expr> ]
+```
+
+## Expanding PropGuards
+
+- Before renaming, a `Bind` with a `bDef = DPropGuards ...` will be expanded into several `Bind`s, one for each guard case. 
+- The generated `Bind`s will have fresh names, but the names will have the same location as the original function's name.
+- These generated `Bind`'s will have the same type as the original function, except that the list of type constraints will also include the `Prop name`s that appeared on the LHS of the originating ase of `DPropGuards`.
+- The original function will have the `Expr name` in each of the `DPropGuards` cases replaced with a function call the appropriate, generated function.
+
+## Renaming
+
+The new constructor of `BindDef` is traversed as normal during renaming. This ensures that a function with `DPropGuards` ends up in the same mutual-recursion group as the generated functions that it calls.
+
+## Typechecking
+
+The back-end AST has a new constructor:
+
+```hs
+data Expr = EPropGuards [([Prop], Expr)] | ...
+```
+
+During typechecking, a `BindDef` of the form
+
+```
+DPropGuards [(props1, f1 x y), (prop2, f2 x y)]
+```
+
+is processed into a `Decl` of the form
+
+```
+Decl 
+  { dDefinition =
+      DExpr (EPropGuards
+        [ (props1, f1 x y)
+        , (props2, f2 x y) ])
+  }
+```
+
+Each case of an `EPropGuards` is typechecked by first asssuming the `props` and then typechecking the expression. However, this typechecking isn't really that important because by construction the expression is just a simple application that is ensured to be well-typed. But we can use this structure for more general purposes.
\ No newline at end of file

From 2dd322f31a21f92e84f5294683149dda543fca73 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Tue, 5 Jul 2022 15:58:10 -0700
Subject: [PATCH 002/125] syntax

---
 src/Cryptol/Parser/AST.hs    | 1 +
 src/Cryptol/TypeCheck/AST.hs | 2 ++
 2 files changed, 3 insertions(+)

diff --git a/src/Cryptol/Parser/AST.hs b/src/Cryptol/Parser/AST.hs
index 41acb6987..70db2d48b 100644
--- a/src/Cryptol/Parser/AST.hs
+++ b/src/Cryptol/Parser/AST.hs
@@ -277,6 +277,7 @@ type LBindDef = Located (BindDef PName)
 
 data BindDef name = DPrim
                   | DExpr (Expr name)
+                  | DPropGuards [([Prop name], Expr name)]
                     deriving (Eq, Show, Generic, NFData, Functor)
 
 data Pragma   = PragmaNote String
diff --git a/src/Cryptol/TypeCheck/AST.hs b/src/Cryptol/TypeCheck/AST.hs
index a061630e2..eda6f75b9 100644
--- a/src/Cryptol/TypeCheck/AST.hs
+++ b/src/Cryptol/TypeCheck/AST.hs
@@ -149,6 +149,8 @@ data Expr   = EList [Expr] Type         -- ^ List value (with type of elements)
 
             | EWhere Expr [DeclGroup]
 
+            | EPropGuards [([Prop], Expr)]
+
               deriving (Show, Generic, NFData)
 
 

From 759befd311d64a4ec4c7f59bccfe4d7d3a1589e2 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Tue, 5 Jul 2022 15:59:15 -0700
Subject: [PATCH 003/125] first pass impl of checkSigB for DPropGuards

---
 src/Cryptol/TypeCheck/Infer.hs | 39 +++++++++++++++++++++++++++++++++-
 1 file changed, 38 insertions(+), 1 deletion(-)

diff --git a/src/Cryptol/TypeCheck/Infer.hs b/src/Cryptol/TypeCheck/Infer.hs
index 369aa19b5..98e1cf76c 100644
--- a/src/Cryptol/TypeCheck/Infer.hs
+++ b/src/Cryptol/TypeCheck/Infer.hs
@@ -43,13 +43,15 @@ import           Cryptol.TypeCheck.Kind(checkType,checkSchema,checkTySyn,
                                         checkPropSyn,checkNewtype,
                                         checkParameterType,
                                         checkPrimType,
-                                        checkParameterConstraints)
+                                        checkParameterConstraints,
+                                        checkPropGuard)
 import           Cryptol.TypeCheck.Instantiate
 import           Cryptol.TypeCheck.Subst (listSubst,apSubst,(@@),isEmptySubst)
 import           Cryptol.TypeCheck.Unify(rootPath)
 import           Cryptol.Utils.Ident
 import           Cryptol.Utils.Panic(panic)
 import           Cryptol.Utils.RecordMap
+import           Cryptol.Utils.PP (pp)
 
 import qualified Data.Map as Map
 import           Data.Map (Map)
@@ -966,6 +968,11 @@ checkMonoB b t =
                      , dFixity = P.bFixity b
                      , dDoc = P.bDoc b
                      }
+    
+    P.DPropGuards _ ->
+      tcPanic "checkMonoB"
+        [ "Used constraint guards without a signature, dumbwit, at "
+        , show . pp $ P.bName b ]
 
 -- XXX: Do we really need to do the defaulting business in two different places?
 checkSigB :: P.Bind Name -> (Schema,[Goal]) -> InferM Decl
@@ -1030,6 +1037,36 @@ checkSigB b (Forall as asmps0 t0, validSchema) = case thing (P.bDef b) of
         , dDoc        = P.bDoc b
         }
 
+ P.DPropGuards propGuards -> 
+  inRangeMb (getLoc b) $
+  withTParams as $ do
+    asmps1 <- applySubstPreds asmps0
+    t      <- applySubst t0
+    -- handle cases
+    let f :: ([P.Prop Name], P.Expr Name) -> InferM ([Prop], Expr)
+        f (ps0, e0) = do
+            -- validate props
+            (ps1, gss) <- unzip <$> mapM checkPropGuard ps0
+            let gs = concat gss
+                ps2 = asmps1 <> (goal <$> gs) <> ps1
+            -- typecheck expr
+            let tGoal = WithSource t0 (DefinitionOf nm) (getLoc b)
+                nm = thing $ P.bName b
+            e1 <- checkFun (P.FunDesc (Just nm) 0) (P.bParams b) e0 tGoal
+            e2 <- applySubst e1
+            pure (ps2, e2)
+            -- undefined :: InferM ([Prop], Expr)
+    cases <- mapM f propGuards
+   
+    return Decl
+      { dName       = thing (P.bName b)
+      , dSignature  = Forall as asmps1 t
+      , dDefinition = DExpr (EPropGuards cases)
+      , dPragmas    = P.bPragmas b
+      , dInfix      = P.bInfix b
+      , dFixity     = P.bFixity b
+      , dDoc        = P.bDoc b
+      }
 
 --------------------------------------------------------------------------------
 --------------------------------------------------------------------------------

From ea8e3127ff5b301e18985238f734c0307113afec Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Tue, 5 Jul 2022 15:59:24 -0700
Subject: [PATCH 004/125] checkPropGuard TODO

---
 src/Cryptol/TypeCheck/Kind.hs | 10 ++++++++--
 1 file changed, 8 insertions(+), 2 deletions(-)

diff --git a/src/Cryptol/TypeCheck/Kind.hs b/src/Cryptol/TypeCheck/Kind.hs
index 3625b40bd..7aaa9c897 100644
--- a/src/Cryptol/TypeCheck/Kind.hs
+++ b/src/Cryptol/TypeCheck/Kind.hs
@@ -19,6 +19,7 @@ module Cryptol.TypeCheck.Kind
   , checkPropSyn
   , checkParameterType
   , checkParameterConstraints
+  , checkPropGuard
   ) where
 
 import qualified Cryptol.Parser.AST as P
@@ -40,8 +41,6 @@ import           Data.Function(on)
 import           Data.Text (Text)
 import           Control.Monad(unless,when)
 
-
-
 -- | Check a type signature.  Returns validated schema, and any implicit
 -- constraints that we inferred.
 checkSchema :: AllowWildCards -> P.Schema Name -> InferM (Schema, [Goal])
@@ -413,3 +412,10 @@ checkKind _ (Just k1) k2
 checkKind t _ _ = return t
 
 
+-- | Validate a parsed proposition that appears on the LHS of a PropGuard.
+-- Returns the validated proposition as well as any inferred goal propisitions.
+checkPropGuard :: P.Prop Name -> InferM (Prop, [Goal])
+checkPropGuard p =
+  collectGoals $
+  (undefined :: KindM Type -> InferM Type) $ -- TODO
+  checkProp p

From b30ee0763b7f6f82572b70621a7ae051c4a34e32 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Tue, 5 Jul 2022 16:03:42 -0700
Subject: [PATCH 005/125] Rename DPropGuards

---
 src/Cryptol/ModuleSystem/Renamer.hs | 7 +++++++
 1 file changed, 7 insertions(+)

diff --git a/src/Cryptol/ModuleSystem/Renamer.hs b/src/Cryptol/ModuleSystem/Renamer.hs
index fdee53409..8d1a8ce3f 100644
--- a/src/Cryptol/ModuleSystem/Renamer.hs
+++ b/src/Cryptol/ModuleSystem/Renamer.hs
@@ -684,6 +684,13 @@ instance Rename Bind where
 instance Rename BindDef where
   rename DPrim     = return DPrim
   rename (DExpr e) = DExpr <$> rename e
+  rename (DPropGuards cases) = DPropGuards <$> traverse renameCase cases
+    where 
+      renameCase :: ([Prop PName], Expr PName) -> RenameM ([Prop Name], Expr Name)
+      renameCase (props, e) = do
+        props' <- traverse rename props
+        e' <- rename e
+        pure (props', e')
 
 -- NOTE: this only renames types within the pattern.
 instance Rename Pattern where

From 6000ce96d545b071a3067b8b5696eea2bf082ee7 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Tue, 5 Jul 2022 16:10:49 -0700
Subject: [PATCH 006/125] new module: Cryptol.Parser.PropGuards

---
 cryptol.cabal                    |  1 +
 src/Cryptol/Parser/PropGuards.hs | 32 ++++++++++++++++++++++++++++++++
 2 files changed, 33 insertions(+)
 create mode 100644 src/Cryptol/Parser/PropGuards.hs

diff --git a/cryptol.cabal b/cryptol.cabal
index 7cb8d0d0a..bc0f9a2a8 100644
--- a/cryptol.cabal
+++ b/cryptol.cabal
@@ -93,6 +93,7 @@ library
                        Cryptol.Parser.Names,
                        Cryptol.Parser.Name,
                        Cryptol.Parser.NoPat,
+                       Cryptol.Parser.PropGuards,
                        Cryptol.Parser.NoInclude,
                        Cryptol.Parser.Selector,
                        Cryptol.Parser.Utils,
diff --git a/src/Cryptol/Parser/PropGuards.hs b/src/Cryptol/Parser/PropGuards.hs
new file mode 100644
index 000000000..d2c931d11
--- /dev/null
+++ b/src/Cryptol/Parser/PropGuards.hs
@@ -0,0 +1,32 @@
+-- |
+-- Module      :  Cryptol.Parser.PropGuards
+-- Copyright   :  (c) 2022 Galois, Inc.
+-- License     :  BSD3
+-- Maintainer  :  cryptol@galois.com
+-- Stability   :  provisional
+-- Portability :  portable
+--
+-- Expands PropGuards into a top-level definition for each case, and rewrites
+-- the body of each case to be an appropriate call to the respectively generated
+-- function.
+--
+
+module Cryptol.Parser.PropGuards where
+
+import Cryptol.Parser.AST
+import Cryptol.Parser.Position (Range(..), emptyRange, start, at)
+import Cryptol.Parser.Names (namesP)
+import Cryptol.Utils.PP
+import Cryptol.Utils.Panic (panic)
+import Cryptol.Utils.RecordMap
+
+import           MonadLib hiding (mapM)
+import           Data.Maybe (maybeToList)
+import qualified Data.Map as Map
+import           Data.Text (Text)
+
+import GHC.Generics (Generic)
+import Control.DeepSeq
+
+class ExpandPropGuards t where
+  expandPropGuards :: t -> (t, [Error])

From a4c5d8a94f0cbcb735a22b48a2c1f63f0547bb50 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Tue, 5 Jul 2022 18:25:22 -0700
Subject: [PATCH 007/125] ExpandPropGuards pass

---
 src/Cryptol/ModuleSystem/Base.hs       | 11 ++++
 src/Cryptol/ModuleSystem/Monad.hs      |  8 +++
 src/Cryptol/Parser/ExpandPropGuards.hs | 88 ++++++++++++++++++++++++++
 src/Cryptol/Parser/PropGuards.hs       | 32 ----------
 4 files changed, 107 insertions(+), 32 deletions(-)
 create mode 100644 src/Cryptol/Parser/ExpandPropGuards.hs
 delete mode 100644 src/Cryptol/Parser/PropGuards.hs

diff --git a/src/Cryptol/ModuleSystem/Base.hs b/src/Cryptol/ModuleSystem/Base.hs
index 24eb393b9..6221f7304 100644
--- a/src/Cryptol/ModuleSystem/Base.hs
+++ b/src/Cryptol/ModuleSystem/Base.hs
@@ -58,6 +58,9 @@ import qualified Cryptol.Parser               as P
 import qualified Cryptol.Parser.Unlit         as P
 import Cryptol.Parser.AST as P
 import Cryptol.Parser.NoPat (RemovePatterns(removePatterns))
+import qualified Cryptol.Parser.ExpandPropGuards as ExpandPropGuards 
+  ( ExpandPropGuards(expandPropGuards)
+  , runExpandPropGuardsM )
 import Cryptol.Parser.NoInclude (removeIncludesModule)
 import Cryptol.Parser.Position (HasLoc(..), Range, emptyRange)
 import qualified Cryptol.TypeCheck     as T
@@ -114,6 +117,14 @@ noPat a = do
   unless (null errs) (noPatErrors errs)
   return a'
 
+-- ExpandPropGuards ------------------------------------------------------------
+
+-- | Run the expandPropGuards pass.
+expandPropGuards :: ExpandPropGuards.ExpandPropGuards a => a -> ModuleM a
+expandPropGuards a =
+  case ExpandPropGuards.runExpandPropGuardsM $ ExpandPropGuards.expandPropGuards a of
+    Left err -> expandPropGuardsError err
+    Right a' -> pure a'
 
 -- Parsing ---------------------------------------------------------------------
 
diff --git a/src/Cryptol/ModuleSystem/Monad.hs b/src/Cryptol/ModuleSystem/Monad.hs
index eaca216ff..c3dbe4f48 100644
--- a/src/Cryptol/ModuleSystem/Monad.hs
+++ b/src/Cryptol/ModuleSystem/Monad.hs
@@ -27,6 +27,7 @@ import qualified Cryptol.Parser.AST as P
 import           Cryptol.Parser.Position (Located)
 import           Cryptol.Utils.Panic (panic)
 import qualified Cryptol.Parser.NoPat as NoPat
+import qualified Cryptol.Parser.ExpandPropGuards as ExpandPropGuards
 import qualified Cryptol.Parser.NoInclude as NoInc
 import qualified Cryptol.TypeCheck as T
 import qualified Cryptol.TypeCheck.AST as T
@@ -98,6 +99,8 @@ data ModuleError
     -- ^ Problems during the renaming phase
   | NoPatErrors ImportSource [NoPat.Error]
     -- ^ Problems during the NoPat phase
+  | ExpandPropGuardsError ImportSource ExpandPropGuards.Error
+    -- ^ Problems during the ExpandExpandPropGuards phase
   | NoIncludeErrors ImportSource [NoInc.IncludeError]
     -- ^ Problems during the NoInclude phase
   | TypeCheckingFailed ImportSource T.NameMap [(Range,T.Error)]
@@ -238,6 +241,11 @@ noPatErrors errs = do
   src <- getImportSource
   ModuleT (raise (NoPatErrors src errs))
 
+expandPropGuardsError :: ExpandPropGuards.Error -> ModuleM a
+expandPropGuardsError err = do
+  src <- getImportSource
+  ModuleT (raise (ExpandPropGuardsError src err))
+
 noIncludeErrors :: [NoInc.IncludeError] -> ModuleM a
 noIncludeErrors errs = do
   src <- getImportSource
diff --git a/src/Cryptol/Parser/ExpandPropGuards.hs b/src/Cryptol/Parser/ExpandPropGuards.hs
new file mode 100644
index 000000000..f2aa43ac7
--- /dev/null
+++ b/src/Cryptol/Parser/ExpandPropGuards.hs
@@ -0,0 +1,88 @@
+-- |
+-- Module      :  Cryptol.Parser.PropGuards
+-- Copyright   :  (c) 2022 Galois, Inc.
+-- License     :  BSD3
+-- Maintainer  :  cryptol@galois.com
+-- Stability   :  provisional
+-- Portability :  portable
+--
+-- Expands PropGuards into a top-level definition for each case, and rewrites
+-- the body of each case to be an appropriate call to the respectively generated
+-- function.
+--
+
+{-# LANGUAGE FlexibleInstances #-}
+{-# LANGUAGE FlexibleContexts #-}
+{-# LANGUAGE DeriveGeneric #-}
+{-# LANGUAGE DeriveAnyClass #-}
+
+module Cryptol.Parser.ExpandPropGuards where
+
+import Cryptol.Parser.AST
+import Cryptol.Parser.Position (Range(..), emptyRange, start, at)
+import Cryptol.Parser.Names (namesP)
+import Cryptol.Utils.PP
+import Cryptol.Utils.Panic (panic)
+import Cryptol.Utils.RecordMap
+
+import           MonadLib hiding (mapM)
+import           Data.Maybe (maybeToList)
+import qualified Data.Map as Map
+import           Data.Text (Text)
+
+import GHC.Generics (Generic)
+import Control.DeepSeq
+
+-- | Monad
+
+type ExpandPropGuardsM a = Either Error a
+
+runExpandPropGuardsM :: ExpandPropGuardsM a -> Either Error a
+runExpandPropGuardsM m = m
+
+-- | Class
+class ExpandPropGuards a where
+  expandPropGuards :: a -> ExpandPropGuardsM a
+
+data Error = NoSignature (Located PName)
+  deriving (Show,Generic, NFData)
+
+-- | Instances
+
+instance ExpandPropGuards (Program PName) where
+  expandPropGuards (Program decls) = Program <$> expandPropGuards decls
+
+instance ExpandPropGuards [TopDecl PName] where
+  expandPropGuards topDecls = concat <$> traverse f topDecls 
+    where 
+      f :: TopDecl PName -> ExpandPropGuardsM [TopDecl PName]
+      f (Decl topLevelDecl) = fmap lift <$> expandPropGuards [tlValue topLevelDecl]
+        where lift decl = Decl $ topLevelDecl { tlValue = decl }
+      f topDecl = pure [topDecl]
+
+instance ExpandPropGuards [Decl PName] where 
+  expandPropGuards decls = concat <$> traverse f decls 
+    where 
+      f (DBind bind) = fmap DBind <$> expandPropGuards [bind]
+      f decl = pure [decl]
+
+instance ExpandPropGuards [Bind PName] where
+  expandPropGuards binds = concat <$> traverse f binds
+    where 
+      f bind = case thing $ bDef bind of 
+        DPropGuards guards -> do
+          Forall params props t rng <-
+            case bSignature bind of
+              Just schema -> pure schema 
+              Nothing -> Left . NoSignature $ bName bind
+          let
+            g :: ([Prop PName], Expr PName) -> ExpandPropGuardsM (Bind PName)
+            g (props', e) = pure bind
+              { -- include guarded props in signature
+                bSignature = Just $ Forall params (props <> props') t rng
+                -- keeps same location at original bind 
+                -- i.e. "on top of" original bind
+              , bDef = (bDef bind) {thing = DExpr e}
+              }
+          mapM g guards
+        _ -> pure [bind]
diff --git a/src/Cryptol/Parser/PropGuards.hs b/src/Cryptol/Parser/PropGuards.hs
deleted file mode 100644
index d2c931d11..000000000
--- a/src/Cryptol/Parser/PropGuards.hs
+++ /dev/null
@@ -1,32 +0,0 @@
--- |
--- Module      :  Cryptol.Parser.PropGuards
--- Copyright   :  (c) 2022 Galois, Inc.
--- License     :  BSD3
--- Maintainer  :  cryptol@galois.com
--- Stability   :  provisional
--- Portability :  portable
---
--- Expands PropGuards into a top-level definition for each case, and rewrites
--- the body of each case to be an appropriate call to the respectively generated
--- function.
---
-
-module Cryptol.Parser.PropGuards where
-
-import Cryptol.Parser.AST
-import Cryptol.Parser.Position (Range(..), emptyRange, start, at)
-import Cryptol.Parser.Names (namesP)
-import Cryptol.Utils.PP
-import Cryptol.Utils.Panic (panic)
-import Cryptol.Utils.RecordMap
-
-import           MonadLib hiding (mapM)
-import           Data.Maybe (maybeToList)
-import qualified Data.Map as Map
-import           Data.Text (Text)
-
-import GHC.Generics (Generic)
-import Control.DeepSeq
-
-class ExpandPropGuards t where
-  expandPropGuards :: t -> (t, [Error])

From f3c2f5841161310d53cc6282dc681b8a2f0c0b0b Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Wed, 6 Jul 2022 15:51:51 -0700
Subject: [PATCH 008/125] expandpropguards

---
 cryptol.cabal | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/cryptol.cabal b/cryptol.cabal
index bc0f9a2a8..afe7234f8 100644
--- a/cryptol.cabal
+++ b/cryptol.cabal
@@ -93,7 +93,7 @@ library
                        Cryptol.Parser.Names,
                        Cryptol.Parser.Name,
                        Cryptol.Parser.NoPat,
-                       Cryptol.Parser.PropGuards,
+                       Cryptol.Parser.ExpandPropGuards,
                        Cryptol.Parser.NoInclude,
                        Cryptol.Parser.Selector,
                        Cryptol.Parser.Utils,

From 0902f1282ab872d12c8cf3c6f149964ff4acbf16 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Wed, 6 Jul 2022 16:14:29 -0700
Subject: [PATCH 009/125] simple parsing

---
 src/Cryptol/Eval.hs                           |    8 +
 src/Cryptol/Eval/Reference.lhs                |    3 +-
 src/Cryptol/IR/FreeVars.hs                    |    1 +
 src/Cryptol/ModuleSystem/InstantiateModule.hs |    2 +
 src/Cryptol/ModuleSystem/Monad.hs             |    5 +-
 src/Cryptol/Parser.hs                         | 3954 +++++++++++++++++
 src/Cryptol/Parser.y                          |   21 +
 src/Cryptol/Parser/AST.hs                     |    1 +
 src/Cryptol/Parser/ExpandPropGuards.hs        |    4 +
 src/Cryptol/Parser/Lexer.x                    |    2 +
 src/Cryptol/Parser/Names.hs                   |    2 +
 src/Cryptol/Parser/NoPat.hs                   |    4 +
 src/Cryptol/Parser/ParserUtils.hs             |   21 +
 src/Cryptol/Parser/Token.hs                   |    1 +
 src/Cryptol/Transform/AddModParams.hs         |    1 +
 src/Cryptol/Transform/MonoValues.hs           |    2 +
 src/Cryptol/Transform/Specialize.hs           |    1 +
 src/Cryptol/TypeCheck/AST.hs                  |    2 +
 src/Cryptol/TypeCheck/Kind.hs                 |    6 +-
 src/Cryptol/TypeCheck/Parseable.hs            |    1 +
 src/Cryptol/TypeCheck/Sanity.hs               |    3 +
 src/Cryptol/TypeCheck/Subst.hs                |    2 +
 src/Cryptol/TypeCheck/TypeOf.hs               |    6 +
 23 files changed, 4049 insertions(+), 4 deletions(-)
 create mode 100644 src/Cryptol/Parser.hs

diff --git a/src/Cryptol/Eval.hs b/src/Cryptol/Eval.hs
index 874ecf5e1..4fcd17083 100644
--- a/src/Cryptol/Eval.hs
+++ b/src/Cryptol/Eval.hs
@@ -215,6 +215,14 @@ evalExpr sym env expr = case expr of
      env' <- evalDecls sym ds env
      evalExpr sym env' e
 
+  EPropGuards _guards -> do
+    -- -- -- TODO: modify this to work for propguards
+    -- b <- fromVBit <$> eval c
+    -- iteValue sym b (eval t) (eval f)
+    -- -- -- error "should not evaluate EPropGuards"
+    -- -- evalPanic "evalExpr" ["cannot evalute EPropGuards"]
+    pure $ VBit $ bitLit sym True
+
   where
 
   {-# INLINE eval #-}
diff --git a/src/Cryptol/Eval/Reference.lhs b/src/Cryptol/Eval/Reference.lhs
index 19a53b068..1735022f9 100644
--- a/src/Cryptol/Eval/Reference.lhs
+++ b/src/Cryptol/Eval/Reference.lhs
@@ -332,7 +332,8 @@ assigns values to those variables.
 >     EProofAbs _ e  -> evalExpr env e
 >     EProofApp e    -> evalExpr env e
 >     EWhere e dgs   -> evalExpr (foldl evalDeclGroup env dgs) e
-
+>
+>     EPropGuards _guards -> error "unimplemented: `evalExpr (EPropGuards _)`" -- TODO
 
 > appFun :: E Value -> E Value -> E Value
 > appFun f v = f >>= \f' -> fromVFun f' v
diff --git a/src/Cryptol/IR/FreeVars.hs b/src/Cryptol/IR/FreeVars.hs
index 9810af692..17e0cab41 100644
--- a/src/Cryptol/IR/FreeVars.hs
+++ b/src/Cryptol/IR/FreeVars.hs
@@ -116,6 +116,7 @@ instance FreeVars Expr where
       EProofAbs p e     -> freeVars p <> freeVars e
       EProofApp e       -> freeVars e
       EWhere e ds       -> foldFree ds <> rmVals (defs ds) (freeVars e)
+      EPropGuards _guards -> error "undefined: freeVars (EPropGuards _guards)"
     where
       foldFree :: (FreeVars a, Defs a) => [a] -> Deps
       foldFree = foldr updateFree mempty
diff --git a/src/Cryptol/ModuleSystem/InstantiateModule.hs b/src/Cryptol/ModuleSystem/InstantiateModule.hs
index 9d6b46729..8e1aa3318 100644
--- a/src/Cryptol/ModuleSystem/InstantiateModule.hs
+++ b/src/Cryptol/ModuleSystem/InstantiateModule.hs
@@ -217,6 +217,8 @@ instance Inst Expr where
         EProofApp e               -> EProofApp (go e)
         EWhere e ds               -> EWhere (go e) (inst env ds)
 
+        EPropGuards _guards       -> EPropGuards undefined -- TODO
+
 
 instance Inst DeclGroup where
   inst env dg =
diff --git a/src/Cryptol/ModuleSystem/Monad.hs b/src/Cryptol/ModuleSystem/Monad.hs
index c3dbe4f48..8ea081208 100644
--- a/src/Cryptol/ModuleSystem/Monad.hs
+++ b/src/Cryptol/ModuleSystem/Monad.hs
@@ -100,7 +100,7 @@ data ModuleError
   | NoPatErrors ImportSource [NoPat.Error]
     -- ^ Problems during the NoPat phase
   | ExpandPropGuardsError ImportSource ExpandPropGuards.Error
-    -- ^ Problems during the ExpandExpandPropGuards phase
+    -- ^ Problems during the ExpandPropGuards phase
   | NoIncludeErrors ImportSource [NoInc.IncludeError]
     -- ^ Problems during the NoInclude phase
   | TypeCheckingFailed ImportSource T.NameMap [(Range,T.Error)]
@@ -134,6 +134,7 @@ instance NFData ModuleError where
     RecursiveModules mods                -> mods `deepseq` ()
     RenamerErrors src errs               -> src `deepseq` errs `deepseq` ()
     NoPatErrors src errs                 -> src `deepseq` errs `deepseq` ()
+    ExpandPropGuardsError src err        -> src `deepseq` err `deepseq` ()
     NoIncludeErrors src errs             -> src `deepseq` errs `deepseq` ()
     TypeCheckingFailed nm src errs       -> nm `deepseq` src `deepseq` errs `deepseq` ()
     ModuleNameMismatch expected found    ->
@@ -181,6 +182,8 @@ instance PP ModuleError where
 
     NoPatErrors _src errs -> vcat (map pp errs)
 
+    ExpandPropGuardsError _src err -> pp err
+
     NoIncludeErrors _src errs -> vcat (map NoInc.ppIncludeError errs)
 
     TypeCheckingFailed _src nm errs -> vcat (map (T.ppNamedError nm) errs)
diff --git a/src/Cryptol/Parser.hs b/src/Cryptol/Parser.hs
new file mode 100644
index 000000000..307460339
--- /dev/null
+++ b/src/Cryptol/Parser.hs
@@ -0,0 +1,3954 @@
+{-# OPTIONS_GHC -w #-}
+{-# OPTIONS -cpp #-}
+-- |
+-- Module      :  Cryptol.Parser
+-- Copyright   :  (c) 2013-2016 Galois, Inc.
+-- License     :  BSD3
+-- Maintainer  :  cryptol@galois.com
+-- Stability   :  provisional
+-- Portability :  portable
+
+{-# LANGUAGE OverloadedStrings #-}
+{-# LANGUAGE Trustworthy #-}
+module Cryptol.Parser
+  ( parseModule
+  , parseProgram, parseProgramWith
+  , parseExpr, parseExprWith
+  , parseDecl, parseDeclWith
+  , parseDecls, parseDeclsWith
+  , parseLetDecl, parseLetDeclWith
+  , parseRepl, parseReplWith
+  , parseSchema, parseSchemaWith
+  , parseModName, parseHelpName
+  , ParseError(..), ppError
+  , Layout(..)
+  , Config(..), defaultConfig
+  , guessPreProc, PreProc(..)
+  ) where
+
+import           Control.Applicative as A
+import           Data.Maybe(fromMaybe)
+import           Data.List.NonEmpty ( NonEmpty(..), cons )
+import           Data.Text(Text)
+import qualified Data.Text as T
+import           Control.Monad(liftM2,msum)
+
+import Cryptol.Parser.AST
+import Cryptol.Parser.Position
+import Cryptol.Parser.LexerUtils hiding (mkIdent)
+import Cryptol.Parser.Token
+import Cryptol.Parser.ParserUtils
+import Cryptol.Parser.Unlit(PreProc(..), guessPreProc)
+import Cryptol.Utils.Ident(paramInstModName)
+import Cryptol.Utils.RecordMap(RecordMap)
+
+import Paths_cryptol
+import qualified Data.Array as Happy_Data_Array
+import qualified Data.Bits as Bits
+import qualified System.IO as Happy_System_IO
+import qualified System.IO.Unsafe as Happy_System_IO_Unsafe
+import qualified Debug.Trace as Happy_Debug_Trace
+import Control.Applicative(Applicative(..))
+import Control.Monad (ap)
+
+-- parser produced by Happy Version 1.20.0
+
+data HappyAbsSyn 
+	= HappyTerminal (Located Token)
+	| HappyErrorToken Prelude.Int
+	| HappyAbsSyn15 (Module PName)
+	| HappyAbsSyn17 ([TopDecl PName])
+	| HappyAbsSyn18 (Located (ImportG (ImpName PName)))
+	| HappyAbsSyn19 (Located (ImpName PName))
+	| HappyAbsSyn20 (Maybe (Located ModName))
+	| HappyAbsSyn21 (Maybe (Located ImportSpec))
+	| HappyAbsSyn22 ([LIdent])
+	| HappyAbsSyn23 ([Ident] -> ImportSpec)
+	| HappyAbsSyn24 (Program PName)
+	| HappyAbsSyn34 (TopDecl PName)
+	| HappyAbsSyn35 (Located Text)
+	| HappyAbsSyn36 (Maybe (Located Text))
+	| HappyAbsSyn37 ([([Prop PName], Expr PName)])
+	| HappyAbsSyn38 (Decl PName)
+	| HappyAbsSyn39 ([Decl PName])
+	| HappyAbsSyn41 (Newtype PName)
+	| HappyAbsSyn42 (Located (RecordMap Ident (Range, Type PName)))
+	| HappyAbsSyn43 ([ LPName ])
+	| HappyAbsSyn44 (LPName)
+	| HappyAbsSyn45 ([Pattern PName])
+	| HappyAbsSyn48 (([Pattern PName], [Pattern PName]))
+	| HappyAbsSyn53 (ReplInput PName)
+	| HappyAbsSyn58 ([LPName])
+	| HappyAbsSyn59 (Expr PName)
+	| HappyAbsSyn61 (Located [Decl PName])
+	| HappyAbsSyn65 ([(Expr PName, Expr PName)])
+	| HappyAbsSyn66 ((Expr PName, Expr PName))
+	| HappyAbsSyn71 (NonEmpty (Expr PName))
+	| HappyAbsSyn75 (Located Selector)
+	| HappyAbsSyn76 ([(Bool, Integer)])
+	| HappyAbsSyn77 ((Bool, Integer))
+	| HappyAbsSyn78 ([Expr PName])
+	| HappyAbsSyn79 (Either (Expr PName) [Named (Expr PName)])
+	| HappyAbsSyn80 ([UpdField PName])
+	| HappyAbsSyn81 (UpdField PName)
+	| HappyAbsSyn82 ([Located Selector])
+	| HappyAbsSyn83 (UpdHow)
+	| HappyAbsSyn85 ([[Match PName]])
+	| HappyAbsSyn86 ([Match PName])
+	| HappyAbsSyn87 (Match PName)
+	| HappyAbsSyn88 (Pattern PName)
+	| HappyAbsSyn92 (Named (Pattern PName))
+	| HappyAbsSyn93 ([Named (Pattern PName)])
+	| HappyAbsSyn94 (Schema PName)
+	| HappyAbsSyn95 (Located [TParam PName])
+	| HappyAbsSyn96 (Located [Prop PName])
+	| HappyAbsSyn98 (Located Kind)
+	| HappyAbsSyn99 (TParam PName)
+	| HappyAbsSyn100 ([TParam PName])
+	| HappyAbsSyn103 (Type PName)
+	| HappyAbsSyn107 ([ Type PName ])
+	| HappyAbsSyn108 (Located [Type PName])
+	| HappyAbsSyn109 ([Type PName])
+	| HappyAbsSyn110 (Named (Type PName))
+	| HappyAbsSyn111 ([Named (Type PName)])
+	| HappyAbsSyn112 (Located Ident)
+	| HappyAbsSyn114 (Located ModName)
+	| HappyAbsSyn116 (Located PName)
+
+happyExpList :: Happy_Data_Array.Array Prelude.Int Prelude.Int
+happyExpList = Happy_Data_Array.listArray (0,3774) ([0,0,0,0,0,0,0,0,2048,0,0,4,1,0,0,0,0,0,0,36864,974,516,136,16386,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,16128,32782,516,4744,771,1,0,0,0,0,0,0,4096,974,516,136,2,1,0,0,0,0,0,0,4096,974,516,136,2,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,17344,0,0,0,0,0,0,0,0,0,0,16128,50126,516,4744,771,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,12288,14,4,4096,0,0,0,0,0,0,0,0,12288,14,4,14,16352,0,0,0,0,0,0,0,0,2048,0,0,0,0,0,0,0,0,0,0,12288,14,4,4096,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,16352,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,12288,14,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,32768,0,0,0,0,0,0,0,0,0,0,0,16390,8160,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,14592,14,516,158,16354,0,0,0,0,0,0,0,4096,14,4,256,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,64,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8198,16352,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,32768,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16128,14,516,4744,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16384,0,0,0,0,0,0,0,0,0,0,0,16384,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,256,0,0,0,0,0,0,0,0,0,0,0,256,0,0,0,0,0,0,0,0,0,0,0,256,0,0,0,0,0,0,0,0,0,0,0,4096,14,68,8,0,0,0,0,0,0,0,0,4096,14,516,136,2,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,16128,32782,1540,4744,771,0,0,0,0,0,0,0,16128,32782,516,4766,16355,0,0,0,0,0,0,0,16128,14,516,5000,2,0,0,0,0,0,0,0,256,0,4,1024,0,0,0,0,0,0,0,0,12544,14,4,136,0,0,0,0,0,0,0,0,4096,14,516,136,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16128,32782,516,4744,3,0,0,0,0,0,0,0,16128,32782,516,4744,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,4096,974,516,136,10,0,0,0,0,0,0,0,0,0,0,64,0,0,0,0,0,0,0,0,0,0,0,8224,0,0,0,0,0,0,0,0,4096,14,516,136,2050,1,0,0,0,0,0,0,4096,974,516,136,2,0,0,0,0,0,0,0,0,0,0,2048,1024,0,0,0,0,0,0,0,0,0,0,6,5088,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,256,0,0,0,0,0,0,0,0,0,0,0,256,0,0,0,0,0,0,0,0,0,0,0,256,0,0,0,0,0,0,0,0,0,0,0,4096,14,68,8,0,0,0,0,0,0,0,0,4096,14,1540,136,2,0,0,0,0,0,0,0,4096,14,516,158,8162,0,0,0,0,0,0,0,4096,14,4,256,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,4096,991,516,136,16394,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,36864,974,516,136,16386,0,0,0,0,0,0,0,0,0,0,64,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,32,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1024,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,4096,991,516,136,16386,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,64,16,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,4096,990,516,136,2,0,0,0,0,0,0,0,32768,5152,32,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,12288,4110,4,4096,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4096,526,4,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,64,0,0,0,0,0,0,0,0,0,0,0,64,24,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,128,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,288,0,0,0,0,0,0,0,0,0,0,0,2048,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16,0,0,0,0,0,0,0,0,0,0,0,48,0,0,0,0,0,0,0,0,0,0,0,8192,1024,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,48,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4096,14,516,152,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1024,32,0,0,0,0,0,0,0,0,0,0,1024,32,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,8160,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4096,14,4,2056,0,0,0,0,0,0,0,0,4096,14,4,8,0,0,0,0,0,0,0,0,4096,14,4,0,0,0,0,0,0,0,0,0,0,0,0,6,8160,0,0,0,0,0,0,0,0,0,0,6,8160,0,0,0,0,0,0,0,0,0,0,6,8160,0,0,0,0,0,0,0,4096,14,516,136,2,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,4096,14,516,136,2,0,0,0,0,0,0,0,0,0,0,64,0,0,0,0,0,0,0,0,4096,14,516,136,2050,0,0,0,0,0,0,0,0,0,0,2048,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4096,14,516,136,2,0,0,0,0,0,0,0,4096,14,4,8,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,64,24,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,32768,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,32768,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4096,14,516,16520,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,14592,14,516,392,2,0,0,0,0,0,0,0,0,0,0,1024,32,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,128,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,256,0,0,0,0,0,0,0,0,0,0,0,32,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4096,14,516,136,2050,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16,0,0,0,0,0,0,0,0,0,8192,0,48,0,0,0,0,0,0,0,0,0,0,0,48,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16128,32782,516,4744,3,0,0,0,0,0,0,0,16128,32782,516,4744,3,0,0,0,0,0,0,0,0,8192,61440,33,0,0,0,0,0,0,0,0,0,0,0,32,0,0,0,0,0,0,0,0,0,0,1024,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8192,1,0,0,0,0,0,0,0,0,0,0,0,2,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8224,0,0,0,0,0,0,0,0,4096,14,516,136,2050,0,0,0,0,0,0,0,0,0,0,2048,1024,0,0,0,0,0,0,0,0,0,0,6,5088,0,0,0,0,0,0,0,4096,14,516,158,8162,0,0,0,0,0,0,0,0,0,0,6,8160,0,0,0,0,0,0,0,4096,14,4,2056,0,0,0,0,0,0,0,0,4096,14,4,8,0,0,0,0,0,0,0,0,0,0,0,6,8160,0,0,0,0,0,0,0,0,0,0,6,8160,0,0,0,0,0,0,0,0,0,0,6,8160,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,0,17344,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,288,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,288,0,0,0,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16,0,0,0,0,0,0,0,0,0,0,0,48,0,0,0,0,0,0,0,0,0,0,0,48,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4096,14,4,256,0,0,0,0,0,0,0,0,0,0,1024,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,32768,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,0,0,0,32768,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8192,0,2048,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,12288,14,4,4096,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,32768,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1024,0,0,0,0,0,0,0,0,0,0,0,1024,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14592,14,644,136,1090,0,0,0,0,0,0,0,4096,14,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4096,14,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,32,0,0,0,0,0,0,0,0,0,0,0,32,0,0,0,0,0,0,0,0,0,0,0,32,0,0,0,0,0,0,0,0,0,0,0,6,8160,0,0,0,0,0,0,0,4096,14,4,2056,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4096,14,4,2056,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,4096,14,4,8,0,0,0,0,0,0,0,0,0,0,0,16,0,0,0,0,0,0,0,0,4096,14,516,136,2,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,0,0,0,2048,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,16128,32782,516,4750,771,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,4096,14,516,136,2,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16128,14,516,4744,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,18432,0,0,0,0,0,0,0,0,16128,14,516,4744,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16128,14,516,4744,2,0,0,0,0,0,0,0,256,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,256,0,4,0,0,0,0,0,0,0,0,0,0,0,0,288,0,0,0,0,0,0,0,0,0,0,0,288,0,0,0,0,0,0,0,0,0,0,0,2048,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,288,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16128,32782,516,4744,771,1,0,0,0,0,0,0,4096,974,516,136,2,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,4096,974,516,136,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,8160,0,0,0,0,0,0,0,0,0,0,0,2048,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16128,32782,772,4744,771,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4096,14,516,136,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1024,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,0,0,0,2048,0,0,0,0,0,0,0,0,0,0,0,32,0,0,0,0,0,0,0,0,0,0,0,32,0,0,0,0,0,0,0,0,0,0,0,32,0,0,0,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,0,6,8160,0,0,0,0,0,0,0,4096,14,4,2056,0,0,0,0,0,0,0,0,4096,14,4,2056,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,4096,14,4,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4096,14,516,136,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4096,14,516,136,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2048,0,0,0,0,0,0,0,0,4096,14,516,136,2,0,0,0,0,0,0,0,4096,14,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,4096,974,516,392,2,1,0,0,0,0,0,0,4096,974,516,136,10,1,0,0,0,0,0,0,4096,991,516,136,16386,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,4096,991,516,136,16386,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,0,0,0,6,8160,0,0,0,0,0,0,0,0,0,0,0,16384,1,0,0,0,0,0,0,4096,991,516,136,16386,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,12288,14,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1024,0,0,0,0,0,0,0,0,0,0,0,4096,14,4,0,0,0,0,0,0,0,0,0,12288,14,4,0,0,0,0,0,0,0,0,0,12288,14,4,4096,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16384,1,0,0,0,0,0,0,4096,991,516,136,16386,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4096,14,4,2056,0,0,0,0,0,0,0,0,4096,14,516,2184,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,12288,14,4,4096,0,0,0,0,0,0,0,0,0,0,0,64,24,0,0,0,0,0,0,0,0,0,0,64,24,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4096,526,4,0,0,0,0,0,0,0,0,0,0,0,0,16,0,0,0,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,64,24,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,4096,974,516,392,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2048,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,4096,14,4,2056,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,4096,14,4,8,0,0,0,0,0,0,0,0,0,0,128,0,1088,0,0,0,0,0,0,0,0,0,0,6,8160,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,0,0,0,0,2048,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4096,14,516,136,2,0,0,0,0,0,0,0,0,0,0,16,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4096,14,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,32,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,32,0,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,0,8192,12288,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,32,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2048,0,0,0,0,0,0,0,0,0,0,8192,8,0,0,0,0,0,0,0,0,0,0,8192,16,0,0,0,0,0,0,0,0,0,0,8192,24,0,0,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,0,0,0,2048,0,0,0,0,0,0,0,0,0,0,0,2048,0,0,0,0,0,0,0,0,0,0,0,2048,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,4096,14,4,2056,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,4096,14,4,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16384,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8192,0,0,0,1,0,0,0,0,0,0,4096,991,516,136,16386,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,128,0,1088,0,0,0,0,0,0,0,0,0,128,0,1088,0,0,0,0,0,0,0,0,0,0,2048,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,0,8192,8,0,0,0,0,0,0,0,0,0,0,8192,16,0,0,0,0,0,0,0,0,0,0,0,16,0,0,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,0,0,16,0,0,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,4096,14,516,136,2,0,0,0,0,0,0,0,4096,14,516,136,2,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2048,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16400,0,0,0,0,0,0,0,0,0,0,0,2048,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,128,0,1088,0,0,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,4096,14,68,0,0,0,0,0,0,0,0,0,0,0,0,0,16384,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16384,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4096,14,516,2184,2,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,4096,14,4,2056,0,0,0,0,0,0,0,0,0,0,0,128,0,0,0,0,0,0,0,0,0,0,0,64,24,0,0,0,0,0,0,0,0,0,0,64,24,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4096,14,4,256,0,0,0,0,0,0,0,0,0,0,0,128,0,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,4096,14,4,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,0,0,0,16384,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,0,0,0,32,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,0,0,16,0,0,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,0,0,0,16384,0,1,0,0,0,0,0,0,4096,991,516,136,16386,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,128,0,1088,0,0,0,0,0,0,0,0,0,0,48,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,288,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4096,14,4,8,0,0,0,0,0,0,0,0,0,0,0,16384,0,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
+	])
+
+{-# NOINLINE happyExpListPerState #-}
+happyExpListPerState st =
+    token_strs_expected
+  where token_strs = ["error","%dummy","%start_vmodule","%start_program","%start_programLayout","%start_expr","%start_decl","%start_decls","%start_declsLayout","%start_letDecl","%start_repl","%start_schema","%start_modName","%start_helpName","vmodule","module_def","vmod_body","import","impName","mbAs","mbImportSpec","name_list","mbHiding","program","program_layout","top_decls","vtop_decls","vtop_decl","top_decl","private_decls","prim_bind","parameter_decls","par_decls","par_decl","doc","mbDoc","propguards","decl","let_decls","let_decl","newtype","newtype_body","vars_comma","var","apats","indices","indices1","apats_indices","opt_apats_indices","decls","vdecls","decls_layout","repl","qop","op","pat_op","other_op","ops","expr","exprNoWhere","whereClause","typedExpr","simpleExpr","longExpr","ifBranches","ifBranch","simpleRHS","longRHS","simpleApp","longApp","aexprs","aexpr","no_sel_aexpr","sel_expr","selector","poly_terms","poly_term","tuple_exprs","rec_expr","field_exprs","field_expr","field_path","field_how","list_expr","list_alts","matches","match","pat","ipat","apat","tuple_pats","field_pat","field_pats","schema","schema_vars","schema_quals","schema_qual","kind","schema_param","schema_params","tysyn_param","tysyn_params","type","infix_type","app_type","atype","atypes","dimensions","tuple_types","field_type","field_types","ident","name","smodName","modName","qname","help_name","tick_ty","field_ty_val","field_ty_vals","NUM","FRAC","STRLIT","CHARLIT","IDENT","QIDENT","SELECTOR","'include'","'import'","'as'","'hiding'","'private'","'parameter'","'property'","'infix'","'infixl'","'infixr'","'type'","'newtype'","'module'","'submodule'","'where'","'let'","'if'","'then'","'else'","'x'","'down'","'by'","'primitive'","'constraint'","'Prop'","'propguards'","'['","']'","'<-'","'..'","'...'","'..<'","'..>'","'|'","'<'","'>'","'('","')'","','","';'","'{'","'}'","'<|'","'|>'","'='","'`'","':'","'->'","'=>'","'\\\\'","'_'","'v{'","'v}'","'v;'","'+'","'*'","'^^'","'-'","'~'","'#'","'@'","OP","QOP","DOC","%eof"]
+        bit_start = st Prelude.* 192
+        bit_end = (st Prelude.+ 1) Prelude.* 192
+        read_bit = readArrayBit happyExpList
+        bits = Prelude.map read_bit [bit_start..bit_end Prelude.- 1]
+        bits_indexed = Prelude.zip bits [0..191]
+        token_strs_expected = Prelude.concatMap f bits_indexed
+        f (Prelude.False, _) = []
+        f (Prelude.True, nr) = [token_strs Prelude.!! nr]
+
+happyActOffsets :: Happy_Data_Array.Array Prelude.Int Prelude.Int
+happyActOffsets = Happy_Data_Array.listArray (0,629) ([-16,484,-49,1103,1388,1388,-45,1190,933,2430,1027,1123,50,1027,0,0,0,0,0,0,0,-53,0,0,0,0,0,0,0,0,1980,0,0,0,0,0,0,0,0,0,0,0,-53,0,1335,-53,2442,2442,0,-20,2050,0,0,2491,2503,0,0,2516,839,439,0,0,15,71,192,0,0,1963,0,0,0,3108,0,1568,0,211,211,0,0,0,0,0,233,243,248,1433,2925,1103,1018,769,1497,4,968,2950,0,1423,1423,214,214,1237,301,189,884,554,-34,630,2137,0,357,376,389,1669,2835,1167,582,0,314,-13,314,606,314,519,358,0,0,457,0,442,0,461,670,520,0,42,0,0,0,0,1308,1924,0,789,536,576,0,1571,0,566,104,0,210,0,263,590,0,602,283,124,0,307,0,2846,0,231,256,0,2067,2154,836,1581,1147,2224,2224,2224,2950,1103,2950,608,1170,617,0,2950,1756,2561,0,0,141,0,3125,0,3142,0,2876,0,0,0,2574,2417,299,0,0,607,0,649,654,652,0,1212,0,678,666,102,885,0,1423,1423,1732,683,701,0,98,38,0,222,1212,143,630,1167,2224,1500,1843,2224,2224,2224,0,0,0,0,0,1103,2574,1190,0,588,0,710,684,3183,709,930,1036,0,1089,725,0,2586,0,2635,0,2635,2635,2635,0,0,711,2635,711,0,745,0,-5,739,1027,0,765,0,0,834,844,0,3035,832,0,0,2635,0,2635,0,866,1147,0,1147,0,0,0,0,0,0,853,853,853,2224,2381,0,2472,0,2635,1843,881,2950,1103,889,2647,1103,1103,1103,0,1103,960,0,1103,1103,2950,1103,0,0,1103,0,1568,0,768,1568,0,1568,952,0,7,813,947,907,0,951,0,923,0,1103,1388,0,1388,0,0,0,2224,917,0,1045,0,2950,0,934,987,963,981,981,981,977,2224,2616,2760,2660,1843,0,2950,0,2950,0,2660,0,984,2950,1147,0,0,1343,1257,734,0,734,0,989,2705,2224,999,734,1075,0,1846,0,1109,1147,1846,1027,0,1058,1067,0,1065,734,0,3041,2895,0,0,114,1027,168,260,0,1451,1100,1119,2705,0,0,401,0,1363,0,0,0,1103,0,0,0,1124,0,0,2718,3100,2718,1843,-19,2224,1103,1127,0,1178,0,2950,1171,0,0,0,0,1147,0,2718,0,0,0,0,0,1180,0,1103,0,0,1180,1205,116,1209,1215,0,1222,610,316,918,1103,1103,1229,1229,0,0,0,1103,1229,1211,1214,1230,0,2718,3103,2718,1843,0,1242,0,1204,0,0,0,0,0,0,2718,0,3035,1243,670,1223,1231,-19,-19,1254,0,2718,0,2718,1103,1103,1285,646,407,1280,1103,1103,1283,1103,2950,2950,1103,0,1292,0,1276,0,0,0,1312,0,74,1284,0,2718,0,2718,1315,0,0,0,-19,1290,1295,1672,1268,0,1268,0,0,0,1306,0,2906,1103,3112,1303,446,515,0,0,0,1113,1303,1345,1103,1930,0,0,1310,2718,2730,2730,1302,0,0,2779,0,1347,1319,0,1349,1103,1349,1349,1103,1103,1357,1350,1350,0,0,2779,1321,670,0,1329,0,1103,1372,1372,1372,0,0,0,0,-19,1051,0,1372,0,965,0,0,0,1930,1340,1374,0,0,0
+	])
+
+happyGotoOffsets :: Happy_Data_Array.Array Prelude.Int Prelude.Int
+happyGotoOffsets = Happy_Data_Array.listArray (0,629) ([1402,269,1403,1575,158,213,1377,1394,340,3179,1042,330,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1019,0,0,0,0,0,0,0,0,0,0,0,0,0,318,0,3331,2704,0,0,563,0,0,891,943,0,0,2443,767,692,0,0,0,0,0,0,0,1291,0,0,0,1371,0,69,0,1370,1391,0,0,0,0,0,0,0,0,110,-1,1438,668,604,3156,1070,727,33,0,415,2946,0,0,326,0,0,249,381,0,1122,0,0,0,0,0,198,447,510,-62,0,0,0,0,129,0,285,0,0,0,0,0,0,0,0,9,0,0,0,0,0,0,0,383,1397,0,16,0,0,0,463,0,0,0,0,1385,0,0,0,0,0,0,0,0,0,0,1213,0,0,0,0,743,0,418,349,1356,1236,1342,1399,85,1591,499,0,20,0,0,24,-26,3202,0,0,0,0,1405,0,1405,0,206,0,0,0,2587,3359,0,0,0,0,0,0,0,0,0,12,0,0,0,0,0,0,2957,2968,0,0,0,0,0,0,0,0,400,0,1129,1046,812,471,503,1627,1715,1744,0,0,0,0,0,2933,2877,1130,0,0,0,0,0,0,0,0,0,0,795,0,0,976,0,3377,0,3391,822,3405,0,0,0,3345,0,0,0,0,0,0,1049,0,0,0,0,0,0,0,0,0,0,0,3419,0,3433,0,3045,368,0,153,0,0,0,0,0,0,0,0,0,1023,542,0,294,0,3447,321,0,428,1607,0,3225,2762,1509,1662,0,1678,1694,0,1749,1765,1445,1781,0,0,1836,0,1351,0,1369,481,0,2702,0,0,1393,0,0,0,0,0,0,0,0,2777,385,0,393,0,0,0,1050,0,0,278,0,58,0,0,0,0,0,0,0,0,1179,788,513,3461,544,0,165,0,242,0,3475,0,0,379,-36,0,0,328,345,196,0,244,0,0,3248,1203,1823,156,1453,0,824,0,0,1086,857,5,0,0,0,0,1856,177,0,830,39,0,0,535,1099,0,0,0,1105,0,0,3271,0,0,0,0,411,0,0,0,1852,0,0,0,0,0,0,3489,579,3503,700,1376,1252,1868,0,0,0,0,660,0,0,0,0,0,413,0,3517,0,0,0,0,0,0,0,1923,0,0,0,0,0,0,0,0,0,0,0,0,1939,1955,0,0,0,0,0,2010,0,0,0,0,0,3531,705,3545,718,0,0,0,0,0,0,0,0,0,0,3559,0,0,0,37,0,0,1382,1383,0,0,3573,0,3587,2026,2042,0,0,0,0,2097,2113,0,2129,148,635,2184,0,0,0,0,0,0,0,0,0,0,0,0,3601,0,3615,0,0,0,0,1387,0,0,1143,986,0,1279,0,0,0,0,0,665,2200,732,1441,0,0,0,0,0,1207,1447,0,2216,-6,0,0,0,3629,3294,3317,0,0,0,3643,0,0,0,0,0,2271,0,0,2287,2303,0,0,0,0,0,3657,0,65,0,0,0,2358,0,0,0,0,0,0,0,1389,0,0,0,0,0,0,0,0,-22,0,0,0,0,0
+	])
+
+happyAdjustOffset :: Prelude.Int -> Prelude.Int
+happyAdjustOffset = Prelude.id
+
+happyDefActions :: Happy_Data_Array.Array Prelude.Int Prelude.Int
+happyDefActions = Happy_Data_Array.listArray (0,629) ([0,0,0,0,0,0,0,0,-131,0,0,0,0,0,-315,-132,-134,-137,-307,-312,-314,0,-302,-313,-305,-306,-304,-303,-143,-144,0,-139,-138,-142,-140,-141,-135,-136,-145,-133,-308,-310,0,-309,0,0,0,0,-261,-254,-276,-278,-281,0,-282,-284,-285,0,0,0,-292,-130,-87,0,-129,-148,-152,0,-173,-159,-151,-174,-170,-171,-175,-177,-178,-179,-180,-181,-182,-183,0,0,0,0,0,0,0,0,0,0,0,0,-184,0,0,0,0,0,0,0,-108,0,0,-238,-110,-86,0,0,0,0,0,0,0,-240,0,0,0,0,0,0,0,-53,-68,0,-51,0,-67,0,0,0,-50,-17,-37,-47,-46,-48,0,0,-40,0,-304,0,-52,0,-35,0,0,-34,0,-252,0,0,-247,0,0,-236,-238,0,-239,0,-241,0,0,-244,0,-307,0,0,0,0,0,0,0,0,0,0,-115,0,-112,0,0,0,-122,-124,0,-128,-174,-169,-174,-168,0,-317,-192,-318,0,0,0,-199,-201,-202,-194,-212,0,-208,-209,-120,-188,-184,0,0,0,-187,-140,-141,-216,-217,0,-190,0,0,-162,0,-108,0,-238,0,0,0,0,0,0,0,-197,-198,-196,-176,-172,0,0,-88,-269,0,-300,0,-267,-258,0,0,0,-288,0,0,-293,-280,-282,0,-279,0,0,0,-262,-260,-256,0,-255,-311,0,-13,0,0,0,-316,-257,-275,-277,0,0,-294,-295,0,-290,-289,0,-287,0,-283,0,0,-291,0,-259,-89,-157,-158,-150,-146,-103,-101,-102,0,0,-273,0,-271,0,0,0,0,0,0,0,0,0,0,-191,0,0,-228,0,0,0,0,-186,-185,0,-193,0,-121,0,0,-189,0,0,-195,0,0,0,-307,-325,0,-320,0,-113,0,0,-127,0,-71,-109,-110,0,-119,-116,0,-118,0,-123,-237,-72,0,-85,-83,-84,0,0,0,0,0,0,-246,0,-245,0,-243,0,-242,-111,0,0,-248,-149,0,0,0,-33,0,-36,0,0,0,-69,0,-23,-21,0,-45,0,0,0,0,-41,-304,0,-14,-69,0,-49,0,0,-42,-20,-30,0,0,0,-61,0,0,0,0,-38,-39,0,-155,0,-153,-253,-251,0,-235,-249,-250,0,-77,-274,0,0,0,0,0,0,0,-114,-74,-75,-70,0,0,-125,-126,-161,-319,0,-321,0,-323,-322,-200,-203,-212,-206,-210,0,-213,-214,-207,-204,-204,-215,-230,-232,0,0,-221,-218,0,0,-205,-164,-163,-160,-94,0,-90,0,-111,0,-95,0,0,0,0,-270,-267,-301,-268,-299,-265,-264,-263,-297,-298,0,-286,-296,0,0,0,0,0,0,0,-98,0,-96,0,0,0,-91,0,-220,0,0,0,0,0,0,0,0,-229,-211,-324,0,-326,-111,-117,-76,-147,0,0,-80,0,-78,0,-73,-154,-156,-56,0,0,0,0,-69,-59,-69,-54,-22,-19,0,-29,0,0,0,0,0,0,-60,-55,-104,0,0,-44,0,-28,-63,-62,0,0,0,0,-58,-79,-81,0,-272,-219,-231,-233,-234,0,-224,-222,0,0,0,-93,-92,-97,-99,0,-266,0,-15,0,-100,0,-223,-225,-227,-82,-57,-64,-66,0,0,-27,-43,-105,0,-106,-107,-24,0,-65,-226,-16,-26
+	])
+
+happyCheck :: Happy_Data_Array.Array Prelude.Int Prelude.Int
+happyCheck = Happy_Data_Array.listArray (0,3774) ([-1,7,1,29,20,1,1,29,1,22,59,2,3,32,59,77,78,22,52,72,4,12,13,29,15,16,17,28,29,20,21,27,23,67,27,97,56,28,29,2,3,77,30,59,63,33,34,52,67,12,13,31,15,16,17,51,32,20,21,72,23,97,47,30,26,28,29,2,3,30,20,97,98,74,75,97,98,12,13,41,15,16,17,74,75,20,21,75,23,47,32,97,98,28,29,75,97,98,97,75,99,100,97,61,99,100,97,98,75,97,98,74,75,97,75,99,100,97,98,45,22,97,98,25,22,11,57,58,59,55,97,98,3,75,97,98,97,98,22,74,75,12,13,72,15,16,17,45,46,20,21,47,23,37,38,97,98,28,29,3,75,47,97,98,60,61,97,98,12,13,101,15,16,17,60,61,20,21,54,23,3,23,97,98,28,29,28,29,47,12,13,67,15,16,17,52,86,20,21,3,23,60,61,74,75,28,29,97,98,13,67,15,16,17,22,47,20,21,7,23,72,73,74,75,28,29,97,98,60,61,74,75,74,75,1,46,23,84,73,74,75,28,29,54,1,97,98,3,35,1,97,74,75,97,98,97,98,13,48,15,16,17,97,98,20,21,35,23,46,59,74,75,28,29,97,98,54,46,9,30,11,75,33,14,86,16,72,74,75,20,21,35,23,97,98,97,98,28,29,14,22,16,46,97,98,20,21,47,23,46,97,98,49,28,29,73,74,75,74,75,60,61,44,45,75,47,48,49,45,46,52,53,54,55,56,57,58,59,22,97,98,97,98,74,75,29,97,98,47,23,51,23,45,46,28,29,28,29,1,74,75,62,36,35,24,25,97,98,23,39,40,41,42,28,29,97,98,1,38,101,86,36,97,98,44,45,72,47,48,49,1,97,52,53,54,55,56,57,58,59,74,75,74,75,23,47,23,86,23,28,29,28,29,28,29,97,23,99,97,74,75,28,29,97,98,97,98,97,98,22,30,101,102,33,23,86,29,97,98,28,29,101,97,98,5,3,97,98,47,10,11,12,73,74,75,74,75,74,75,74,75,60,61,95,49,97,27,74,75,54,55,56,57,58,59,75,97,98,97,98,97,98,97,98,0,74,75,30,49,5,97,98,8,47,10,11,12,97,98,15,16,17,18,75,86,87,60,61,97,98,97,27,97,98,30,97,101,104,34,0,73,74,75,76,5,97,98,8,44,10,11,12,48,72,15,16,17,18,57,58,59,6,58,8,97,98,27,66,67,30,40,41,42,34,0,71,72,86,87,5,97,98,47,44,10,11,12,48,97,15,16,17,18,74,75,60,61,58,97,98,60,27,101,73,74,75,76,5,34,86,71,72,10,11,12,59,97,98,44,86,97,98,48,40,41,42,0,97,98,27,97,5,58,47,8,9,10,11,12,13,14,15,16,17,18,19,72,21,86,87,86,49,22,27,46,59,30,49,28,97,34,97,52,39,40,41,42,45,44,45,44,47,48,49,48,47,52,53,54,55,56,57,58,59,58,86,60,63,22,52,0,64,42,43,28,5,97,71,8,9,10,11,12,13,14,15,16,17,18,19,41,21,62,63,64,65,66,27,46,69,30,97,98,49,34,101,71,72,73,74,75,45,44,45,44,47,48,49,48,41,52,53,54,55,56,57,58,59,58,46,60,63,97,98,0,75,35,69,54,5,75,71,8,9,10,11,12,13,14,15,16,17,18,19,45,21,46,97,98,49,35,27,97,98,30,97,98,56,34,101,1,2,3,4,5,6,84,85,44,10,11,12,48,40,41,42,86,95,96,97,45,86,58,24,5,6,27,97,59,10,11,12,97,34,86,71,39,40,41,42,21,42,43,44,45,97,27,48,86,50,52,56,53,55,97,98,57,58,101,97,103,62,63,64,65,66,67,68,69,70,1,5,53,4,5,6,10,11,12,10,11,12,40,41,42,88,89,90,91,46,93,94,49,27,97,98,27,1,101,35,4,5,6,34,86,87,10,11,12,35,44,42,43,44,45,97,54,48,52,5,95,96,97,27,10,11,12,58,32,46,34,62,63,64,65,66,67,68,69,70,44,27,90,91,48,93,86,87,34,97,98,97,98,101,58,101,45,97,44,63,45,46,48,67,1,2,3,4,5,6,22,52,58,10,11,12,28,29,15,16,17,18,68,1,97,98,23,24,101,52,27,1,2,3,4,5,6,34,45,1,10,11,12,5,6,45,46,44,10,11,12,48,91,50,24,68,53,27,97,98,57,58,101,46,34,27,49,46,65,66,49,67,42,43,44,19,20,21,48,22,50,46,44,53,49,52,48,57,58,1,2,3,4,5,6,65,66,46,10,11,12,54,5,6,91,92,52,10,11,12,97,98,24,54,101,27,1,2,3,4,5,6,34,35,27,10,11,12,39,40,41,42,44,40,41,42,48,91,50,24,71,53,27,97,98,57,58,101,33,34,53,45,46,65,66,10,40,41,42,44,40,41,42,48,5,50,45,46,53,10,11,12,57,58,1,2,3,4,5,6,65,66,3,10,11,12,27,59,5,73,74,75,76,10,11,12,59,24,5,6,27,61,62,10,11,12,71,34,49,97,27,99,100,97,98,45,97,44,99,100,27,48,5,50,24,25,53,10,11,12,57,58,49,41,42,42,43,44,65,66,41,42,5,54,27,5,52,10,11,12,10,11,12,97,98,62,63,64,65,66,67,68,69,70,27,68,97,27,99,100,22,34,97,98,34,15,16,17,18,42,43,44,45,23,44,48,45,5,48,40,41,42,10,11,12,58,46,22,58,62,63,64,65,66,67,68,69,0,68,27,97,98,5,40,41,42,34,10,11,12,41,22,15,16,17,18,44,0,36,55,48,46,5,52,27,22,52,10,11,12,58,34,15,16,17,18,40,41,42,43,68,44,52,60,27,48,73,74,75,76,59,34,40,41,42,58,54,60,19,20,21,44,95,96,97,48,52,22,0,29,97,98,29,5,22,58,8,60,10,11,12,13,14,15,16,17,18,19,52,21,39,40,41,42,22,27,52,22,30,71,5,6,34,0,54,10,11,12,5,54,44,48,44,10,11,12,48,55,15,16,17,18,27,0,54,46,58,22,5,22,27,22,22,10,11,12,55,34,15,16,17,18,40,41,42,43,29,44,0,60,27,48,49,5,22,55,22,34,10,11,12,58,0,15,16,17,18,44,57,58,59,48,49,10,37,27,65,66,67,25,49,58,34,26,1,2,3,4,5,6,60,46,44,10,11,12,48,68,5,40,41,42,43,10,11,12,58,24,97,98,27,60,101,97,49,62,5,34,5,83,27,10,11,12,31,83,83,44,27,18,83,48,83,50,27,-1,53,44,27,-1,57,58,44,45,-1,47,48,49,50,51,52,53,54,55,56,57,58,59,1,2,3,4,5,6,-1,5,-1,10,11,12,10,11,12,-1,-1,70,71,72,73,74,75,-1,-1,-1,27,-1,-1,27,-1,-1,-1,34,-1,-1,-1,97,98,-1,-1,101,-1,44,97,98,44,48,49,50,-1,-1,53,-1,52,44,45,58,47,48,49,-1,51,52,53,54,55,56,57,58,59,1,2,3,4,5,6,-1,5,-1,10,11,12,10,11,12,-1,-1,5,-1,-1,18,-1,10,11,12,-1,27,-1,-1,27,-1,-1,-1,34,-1,-1,-1,97,98,27,-1,101,-1,44,-1,-1,44,48,-1,50,44,45,53,47,48,49,44,58,52,53,54,55,56,57,58,59,44,45,-1,47,48,49,-1,-1,52,53,54,55,56,57,58,59,44,45,-1,47,48,49,-1,-1,52,53,54,55,56,57,58,59,40,41,42,43,-1,97,98,5,-1,101,5,-1,10,11,12,10,11,12,-1,-1,-1,97,98,-1,-1,101,-1,-1,-1,27,-1,-1,27,31,-1,-1,31,97,98,44,45,101,47,48,49,-1,44,52,53,54,55,56,57,58,59,44,45,-1,47,48,49,-1,-1,52,53,54,55,56,57,58,59,44,45,-1,47,48,49,-1,-1,52,53,54,55,56,57,58,59,22,40,41,42,43,97,98,5,-1,101,-1,-1,10,11,12,37,38,39,40,41,-1,97,98,-1,46,101,-1,-1,-1,27,40,41,42,43,-1,-1,-1,97,98,44,45,101,47,48,49,-1,44,52,53,54,55,56,57,58,59,44,45,-1,47,48,49,-1,-1,52,53,54,55,56,57,58,59,44,45,-1,47,48,49,-1,-1,52,53,54,55,56,57,58,59,18,19,20,21,-1,97,98,5,-1,101,5,6,10,11,12,10,11,12,-1,-1,-1,97,98,-1,-1,101,-1,-1,-1,27,-1,-1,27,18,19,20,21,97,98,44,45,101,47,48,49,-1,44,52,53,54,55,56,57,58,59,44,45,-1,47,48,49,-1,-1,52,53,54,55,56,57,58,59,44,45,-1,47,48,49,-1,-1,52,53,54,55,56,57,58,59,-1,-1,-1,-1,8,97,98,5,-1,101,14,-1,10,11,12,19,-1,21,-1,-1,-1,97,98,-1,-1,101,30,-1,-1,27,-1,-1,-1,-1,-1,-1,-1,97,98,44,45,101,47,48,49,-1,44,52,53,54,55,56,57,58,59,44,45,-1,47,48,49,-1,-1,52,53,54,55,56,57,58,59,44,45,-1,47,48,49,42,43,52,53,54,55,56,57,58,59,-1,-1,54,-1,-1,97,98,42,43,101,62,63,64,65,66,67,68,69,70,-1,-1,97,98,-1,-1,101,-1,62,63,64,65,66,67,68,69,70,-1,97,98,44,45,101,47,48,49,-1,-1,52,53,54,55,56,57,58,59,44,45,-1,47,48,49,-1,-1,52,53,54,55,56,57,58,59,44,45,-1,47,48,49,42,43,52,53,54,55,56,57,58,59,-1,-1,-1,55,-1,97,98,42,43,101,62,63,64,65,66,67,68,69,-1,-1,-1,97,98,-1,-1,101,-1,62,63,64,65,66,67,68,69,-1,-1,97,98,44,45,101,47,48,49,-1,-1,52,53,54,55,56,57,58,59,44,45,-1,47,48,49,-1,-1,52,53,54,55,56,57,58,59,44,45,-1,47,48,49,42,43,52,53,54,55,56,57,58,59,52,-1,-1,-1,-1,97,98,42,43,101,62,63,64,65,66,67,-1,69,-1,-1,-1,97,98,-1,-1,101,-1,62,63,64,65,66,67,68,69,-1,-1,97,98,44,45,101,47,48,49,-1,-1,52,53,54,55,56,57,58,59,44,45,-1,47,48,49,-1,-1,52,53,54,55,56,57,58,59,44,45,-1,47,48,49,42,43,52,53,54,55,56,57,58,59,-1,-1,-1,-1,-1,97,98,-1,-1,101,62,63,64,65,66,67,68,69,-1,-1,-1,97,98,-1,-1,101,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,97,98,44,45,101,47,48,49,-1,-1,52,53,54,55,56,57,58,59,44,45,-1,47,48,49,-1,-1,52,53,54,55,56,57,58,59,44,45,-1,47,48,49,-1,-1,52,53,54,55,56,57,58,59,-1,-1,-1,-1,-1,97,98,-1,-1,101,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,97,98,5,-1,101,-1,-1,10,11,12,-1,-1,-1,-1,-1,-1,97,98,44,45,101,47,48,49,27,-1,52,53,54,55,56,57,58,59,1,-1,-1,4,5,6,-1,44,-1,10,11,12,-1,1,-1,52,4,5,6,-1,-1,-1,10,11,12,1,27,-1,4,5,6,-1,-1,34,10,11,12,97,98,27,-1,101,-1,44,-1,-1,34,48,49,-1,-1,27,-1,-1,-1,-1,44,58,34,5,48,-1,-1,-1,10,11,12,-1,44,-1,58,-1,48,-1,1,-1,-1,4,5,6,-1,27,58,10,11,12,1,-1,-1,4,5,6,-1,-1,-1,10,11,12,44,1,27,-1,4,5,6,-1,52,34,10,11,12,-1,27,88,89,90,91,44,93,34,-1,48,97,98,-1,27,101,-1,-1,44,-1,58,34,48,-1,-1,-1,-1,-1,-1,-1,-1,44,58,1,-1,48,4,5,6,-1,-1,-1,10,11,12,58,1,-1,-1,4,5,6,-1,-1,-1,10,11,12,1,27,-1,4,5,6,-1,-1,34,10,11,12,-1,-1,27,-1,-1,-1,44,-1,-1,34,48,-1,-1,-1,27,-1,-1,-1,-1,44,58,34,5,48,-1,-1,-1,10,11,12,-1,44,-1,58,-1,48,-1,1,-1,-1,4,5,6,-1,27,58,10,11,12,1,-1,-1,4,5,6,-1,-1,-1,10,11,12,44,1,27,-1,4,5,6,-1,52,34,10,11,12,-1,27,88,89,90,91,44,93,34,-1,48,97,98,-1,27,101,-1,-1,44,-1,58,34,48,-1,-1,-1,-1,-1,-1,-1,-1,44,58,1,-1,48,4,5,6,-1,-1,-1,10,11,12,58,1,-1,-1,4,5,6,-1,-1,-1,10,11,12,1,27,-1,4,5,6,-1,-1,34,10,11,12,-1,-1,27,-1,-1,-1,44,-1,-1,34,48,-1,-1,-1,27,-1,57,58,59,44,58,34,5,48,65,66,67,10,11,12,-1,44,-1,58,-1,48,-1,1,-1,-1,4,5,6,82,27,58,10,11,12,88,89,90,91,-1,93,-1,97,98,97,98,101,44,101,27,45,-1,47,48,49,52,34,52,53,54,55,56,57,58,59,45,44,47,48,49,48,-1,52,53,54,55,56,57,58,59,58,-1,-1,5,-1,-1,-1,-1,10,11,12,-1,-1,-1,5,-1,-1,-1,-1,10,11,12,97,98,-1,27,101,-1,-1,-1,-1,-1,34,35,-1,-1,27,97,98,-1,-1,101,44,34,5,-1,48,-1,-1,10,11,12,-1,44,45,-1,58,48,-1,-1,-1,-1,-1,5,-1,-1,27,58,10,11,12,-1,-1,34,5,-1,-1,-1,-1,10,11,12,-1,44,-1,27,-1,48,-1,-1,-1,-1,34,5,55,-1,27,58,10,11,12,-1,44,34,-1,-1,48,-1,-1,-1,52,-1,-1,44,-1,27,58,48,5,-1,-1,52,34,10,11,12,-1,58,88,89,90,91,44,93,-1,-1,48,97,98,-1,27,101,-1,-1,-1,49,58,34,52,53,54,55,56,57,58,59,-1,44,49,-1,-1,48,-1,54,55,56,57,58,59,49,-1,58,-1,-1,54,55,56,57,58,59,49,-1,-1,-1,-1,54,55,56,57,58,59,-1,-1,97,98,-1,-1,101,-1,-1,-1,-1,-1,-1,-1,-1,97,98,-1,5,101,-1,-1,-1,10,11,12,97,98,-1,22,101,-1,25,26,-1,28,29,97,98,-1,27,101,35,36,37,38,39,40,41,42,43,-1,45,46,47,-1,49,44,-1,-1,-1,54,55,56,-1,52,-1,60,61,62,63,64,65,66,67,68,69,5,-1,72,5,-1,10,11,12,10,11,12,-1,5,-1,-1,-1,-1,10,11,12,-1,-1,27,83,-1,27,-1,24,88,89,90,91,-1,93,27,-1,-1,97,98,44,-1,101,44,-1,24,42,43,52,-1,-1,52,44,-1,-1,-1,-1,-1,54,-1,52,57,24,42,43,-1,62,63,64,65,66,67,68,69,70,54,-1,-1,57,-1,42,43,-1,62,63,64,65,66,67,68,69,70,54,-1,-1,57,-1,-1,-1,-1,62,63,64,65,66,67,68,69,70,57,58,59,-1,-1,-1,-1,64,65,66,67,-1,42,43,-1,-1,-1,47,-1,-1,-1,-1,-1,-1,54,55,56,-1,-1,-1,60,61,62,63,64,65,66,67,68,69,97,98,72,-1,101,79,80,81,82,-1,-1,-1,-1,-1,88,89,90,91,-1,93,-1,-1,-1,97,98,-1,-1,101,79,80,81,82,-1,-1,-1,-1,-1,88,89,90,91,-1,93,-1,-1,-1,97,98,-1,-1,101,79,80,81,82,-1,-1,-1,-1,-1,88,89,90,91,-1,93,-1,-1,-1,97,98,-1,-1,101,79,80,81,82,-1,-1,-1,-1,-1,88,89,90,91,-1,93,-1,-1,-1,97,98,-1,-1,101,79,80,81,82,-1,-1,-1,-1,-1,88,89,90,91,-1,93,-1,-1,-1,97,98,-1,-1,101,79,80,81,82,-1,-1,-1,-1,-1,88,89,90,91,-1,93,-1,-1,-1,97,98,-1,-1,101,79,80,81,82,-1,-1,-1,-1,-1,88,89,90,91,-1,93,-1,81,82,97,98,-1,-1,101,88,89,90,91,-1,93,-1,-1,82,97,98,-1,-1,101,88,89,90,91,-1,93,-1,-1,-1,97,98,-1,-1,101,88,89,90,91,-1,93,94,-1,-1,97,98,-1,-1,101,-1,-1,104,105,88,89,90,91,-1,93,-1,-1,-1,97,98,-1,-1,101,88,89,90,91,-1,93,-1,-1,-1,97,98,-1,-1,101,88,89,90,91,-1,93,-1,-1,-1,97,98,-1,-1,101,88,89,90,91,-1,93,-1,-1,-1,97,98,-1,-1,101,88,89,90,91,-1,93,-1,-1,-1,97,98,-1,-1,101,88,89,90,91,-1,93,-1,-1,-1,97,98,-1,-1,101,88,89,90,91,-1,93,-1,-1,-1,97,98,-1,-1,101,88,89,90,91,-1,93,-1,-1,-1,97,98,-1,-1,101,88,89,90,91,-1,93,-1,-1,-1,97,98,-1,-1,101,88,89,90,91,-1,93,-1,-1,-1,97,98,-1,-1,101,88,89,90,91,-1,93,-1,-1,-1,97,98,-1,-1,101,88,89,90,91,-1,93,-1,-1,-1,97,98,-1,-1,101,88,89,90,91,-1,93,-1,-1,-1,97,98,-1,-1,101,88,89,90,91,-1,93,-1,-1,-1,97,98,-1,-1,101,88,89,90,91,-1,93,-1,-1,-1,97,98,-1,-1,101,88,89,90,91,-1,93,-1,-1,-1,97,98,-1,-1,101,88,89,90,91,-1,93,-1,-1,-1,97,98,-1,-1,101,88,89,90,91,-1,93,-1,-1,-1,97,98,-1,-1,101,88,89,90,91,-1,93,-1,-1,-1,97,98,-1,-1,101,88,89,90,91,-1,93,-1,-1,-1,97,98,-1,-1,101,88,89,90,91,-1,93,-1,-1,-1,97,98,-1,-1,101,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1
+	])
+
+happyTable :: Happy_Data_Array.Array Prelude.Int Prelude.Int
+happyTable = Happy_Data_Array.listArray (0,3774) ([0,616,269,350,14,201,408,628,201,151,120,131,132,500,100,151,152,272,176,-1,394,133,134,617,135,136,137,223,224,138,139,202,140,177,202,153,263,101,102,509,132,428,178,131,501,329,330,273,502,133,134,356,135,136,137,203,353,138,139,-1,140,153,242,192,314,101,102,605,132,562,14,18,351,225,226,18,351,133,134,315,135,136,137,104,105,138,139,180,140,386,444,18,351,101,102,344,18,106,40,354,41,270,40,388,41,270,18,106,180,18,160,104,105,40,180,41,395,18,160,587,151,18,160,316,151,562,237,75,76,512,18,160,132,354,18,106,18,160,151,104,105,148,134,-1,135,136,137,326,327,138,139,386,140,531,532,18,160,101,102,132,361,-25,18,106,387,388,18,19,415,134,77,135,136,137,-25,-25,138,139,377,140,132,116,18,160,101,102,101,102,347,566,134,177,135,136,137,311,228,138,139,132,140,348,349,104,105,101,102,167,229,423,177,135,136,137,151,386,138,139,236,140,589,473,157,158,101,102,18,106,558,388,104,105,104,105,234,183,100,494,433,157,158,101,102,184,233,18,160,132,103,232,495,104,105,18,106,18,106,422,384,135,136,137,18,160,138,139,374,140,183,385,104,105,101,102,18,106,313,375,120,178,121,344,179,122,166,123,-1,104,105,124,125,372,126,18,106,167,168,101,102,147,445,123,373,18,160,124,125,555,126,381,18,106,382,101,102,432,157,158,104,105,556,557,446,65,180,66,67,68,378,375,69,70,71,72,73,74,75,76,151,18,160,18,106,104,105,526,18,160,185,185,336,100,376,373,101,102,101,102,174,104,105,337,186,426,61,62,18,106,185,14,15,16,17,101,102,18,19,173,63,77,436,424,18,106,64,65,-1,66,67,68,172,305,69,70,71,72,73,74,75,76,104,105,104,105,177,147,402,488,451,101,102,101,102,101,102,40,450,267,305,104,105,101,102,18,106,18,106,18,19,151,178,20,21,311,177,366,596,18,19,101,102,77,18,106,23,145,167,367,347,25,26,27,429,157,158,104,105,104,105,104,105,549,349,496,68,281,28,104,105,190,191,73,74,75,76,180,18,160,18,106,18,106,18,106,108,104,105,146,248,23,18,106,128,386,25,26,27,18,160,109,110,111,112,486,303,368,570,388,18,106,534,28,18,19,-69,305,77,535,113,108,163,157,158,164,23,18,160,128,114,25,26,27,115,-1,109,110,111,112,461,75,76,559,116,560,18,160,28,463,207,-69,155,16,17,113,108,129,-32,303,304,23,18,389,555,114,25,26,27,115,305,109,110,111,112,359,158,569,557,116,18,19,406,28,77,156,157,158,159,23,113,301,129,-31,25,26,27,394,18,160,114,436,167,302,115,260,16,17,108,18,160,28,305,23,116,389,-69,142,25,26,143,144,-69,109,110,111,112,-69,-1,-69,303,491,434,155,151,28,292,393,-69,293,527,305,113,305,380,210,15,16,17,379,211,65,114,66,67,68,115,359,69,70,71,72,73,74,75,76,116,436,150,212,151,356,108,335,29,30,597,23,305,129,-69,142,25,26,143,144,-69,109,110,111,112,-69,334,-69,32,33,34,35,36,28,332,39,-69,18,19,333,113,77,588,472,473,157,158,328,216,65,114,66,67,68,115,329,69,70,71,72,73,74,75,76,116,318,-18,217,18,160,108,537,317,218,289,23,344,129,-69,142,25,26,143,144,-69,109,110,111,112,-69,288,-69,290,18,160,291,281,28,18,160,-69,18,19,263,113,77,79,80,81,82,23,24,242,243,114,25,26,27,115,370,16,17,541,244,245,246,274,436,116,88,23,44,28,305,509,25,26,27,305,89,513,129,248,15,16,17,397,29,30,90,214,305,28,91,436,92,466,263,93,467,18,19,94,95,193,305,194,32,33,34,215,216,37,38,39,40,56,23,45,57,23,24,25,26,27,25,26,27,307,16,17,249,50,51,52,287,53,250,459,28,18,19,28,56,54,507,57,23,24,58,303,438,25,26,27,506,171,29,30,59,252,305,505,253,370,23,244,245,281,28,25,26,27,61,500,443,58,32,33,34,35,36,37,38,39,40,59,28,276,52,253,53,303,564,113,18,19,18,19,54,61,412,488,305,162,501,325,318,115,502,79,80,81,82,23,24,151,485,116,25,26,27,524,525,83,84,85,86,182,461,18,19,87,88,409,457,28,79,80,81,82,23,24,89,454,196,25,26,27,23,24,286,287,90,25,26,27,91,258,92,88,449,93,28,18,19,94,95,256,285,89,28,458,455,96,97,456,177,478,479,90,577,124,418,91,151,92,290,197,93,623,444,198,94,95,79,80,81,82,23,24,96,97,443,25,26,27,442,23,44,254,255,431,25,26,27,18,19,88,422,256,28,79,80,81,82,23,24,89,220,28,25,26,27,268,15,16,17,90,493,16,17,91,279,92,88,129,93,28,18,19,94,95,256,448,89,45,284,285,96,97,415,308,16,17,90,449,16,17,91,23,92,624,625,93,25,26,27,94,95,79,80,81,82,23,24,96,97,412,25,26,27,28,408,23,156,157,158,159,25,26,27,407,88,23,24,28,198,199,25,26,27,129,89,283,40,28,41,42,18,160,552,40,90,41,507,28,91,23,92,293,62,93,25,26,27,94,95,622,174,17,29,30,31,96,97,309,17,23,551,28,23,546,25,26,27,25,26,27,18,410,32,33,34,35,36,37,38,39,40,28,449,40,28,41,558,151,113,18,552,113,83,84,85,86,29,30,162,163,87,162,115,537,23,115,440,16,17,25,26,27,116,332,151,116,32,33,34,35,36,37,38,39,108,358,28,18,578,23,419,16,17,113,25,26,27,530,151,109,110,111,112,162,108,528,512,115,529,23,520,28,511,519,25,26,27,116,113,109,110,111,112,297,16,17,364,182,114,518,605,28,115,156,157,158,159,604,113,539,16,17,116,513,188,576,124,418,114,244,620,281,115,602,151,108,595,18,160,592,23,151,116,-68,426,25,26,404,405,-68,109,110,111,112,-68,457,-68,239,15,16,17,151,28,586,151,-68,129,23,44,113,108,582,25,26,27,23,581,576,572,114,25,26,27,115,512,109,110,111,112,28,108,616,529,116,151,23,151,28,151,151,25,26,27,512,113,109,110,111,112,297,16,17,363,608,114,108,628,28,115,428,23,151,512,151,113,25,26,27,116,129,109,110,111,112,114,461,75,76,115,548,118,98,28,467,206,207,97,238,116,113,397,79,80,81,82,23,24,236,382,114,25,26,27,115,464,23,297,16,17,362,25,26,27,116,88,18,19,28,234,77,365,238,459,23,89,413,540,28,25,26,27,231,602,497,90,570,554,582,91,625,92,619,0,93,171,28,0,94,95,220,65,0,66,67,68,221,222,69,70,71,72,73,74,75,76,79,80,81,82,23,24,0,23,0,25,26,27,25,26,27,0,0,470,471,472,473,157,158,0,0,0,28,0,0,28,0,0,0,89,0,0,0,18,19,0,0,77,0,90,18,160,171,91,209,92,0,0,93,0,307,220,65,210,66,67,68,0,481,69,70,71,72,73,74,75,76,79,80,81,82,23,24,0,23,0,25,26,27,25,26,27,0,0,23,0,0,391,0,25,26,27,0,28,0,0,28,0,0,0,89,0,0,0,18,19,28,0,77,0,90,0,0,392,91,0,92,117,65,93,66,67,68,171,95,69,70,71,72,73,74,75,76,360,65,0,66,67,68,0,0,69,70,71,72,73,74,75,76,485,65,0,66,67,68,0,0,69,70,71,72,73,74,75,76,297,16,17,300,0,18,19,23,0,77,23,0,25,26,27,25,26,27,0,0,0,18,19,0,0,77,0,0,0,28,0,0,28,170,0,0,580,18,19,480,65,77,66,67,68,0,171,69,70,71,72,73,74,75,76,479,65,0,66,67,68,0,0,69,70,71,72,73,74,75,76,476,65,0,66,67,68,0,0,69,70,71,72,73,74,75,76,151,297,16,17,299,18,19,23,0,77,0,0,25,26,27,319,320,321,322,323,0,18,19,0,324,77,0,0,0,28,297,16,17,298,0,0,0,18,19,475,65,77,66,67,68,0,353,69,70,71,72,73,74,75,76,474,65,0,66,67,68,0,0,69,70,71,72,73,74,75,76,469,65,0,66,67,68,0,0,69,70,71,72,73,74,75,76,416,417,124,418,0,18,19,23,0,77,23,24,25,26,27,25,26,27,0,0,0,18,19,0,0,77,0,0,0,28,0,0,28,567,417,124,418,18,19,468,65,77,66,67,68,0,171,69,70,71,72,73,74,75,76,546,65,0,66,67,68,0,0,69,70,71,72,73,74,75,76,538,65,0,66,67,68,0,0,69,70,71,72,73,74,75,76,0,0,0,0,399,18,19,23,0,77,400,0,25,26,27,401,0,402,0,0,0,18,19,0,0,77,146,0,0,28,0,0,0,0,0,0,0,18,19,532,65,77,66,67,68,0,353,69,70,71,72,73,74,75,76,522,65,0,66,67,68,0,0,69,70,71,72,73,74,75,76,521,65,0,66,67,68,29,30,69,70,71,72,73,74,75,76,0,0,241,0,0,18,19,29,30,77,32,33,34,35,36,37,38,39,40,0,0,18,19,0,0,77,0,32,33,34,35,36,37,38,39,40,0,18,19,520,65,77,66,67,68,0,0,69,70,71,72,73,74,75,76,598,65,0,66,67,68,0,0,69,70,71,72,73,74,75,76,597,65,0,66,67,68,29,30,69,70,71,72,73,74,75,76,0,0,0,262,0,18,19,29,30,77,32,33,34,35,36,37,38,39,0,0,0,18,19,0,0,77,0,32,33,34,35,36,37,38,39,0,0,18,19,593,65,77,66,67,68,0,0,69,70,71,72,73,74,75,76,592,65,0,66,67,68,0,0,69,70,71,72,73,74,75,76,590,65,0,66,67,68,-239,-239,69,70,71,72,73,74,75,76,-239,0,0,0,0,18,19,-271,-271,77,-239,-239,-239,-239,-239,-239,0,-239,0,0,0,18,19,0,0,77,0,-271,-271,-271,-271,-271,-271,-271,-271,0,0,18,19,587,65,77,66,67,68,0,0,69,70,71,72,73,74,75,76,573,65,0,66,67,68,0,0,69,70,71,72,73,74,75,76,618,65,0,66,67,68,29,30,69,70,71,72,73,74,75,76,0,0,0,0,0,18,19,0,0,77,32,33,34,35,36,37,38,39,0,0,0,18,19,0,0,77,0,0,0,0,0,0,0,0,0,0,0,18,19,610,65,77,66,67,68,0,0,69,70,71,72,73,74,75,76,609,65,0,66,67,68,0,0,69,70,71,72,73,74,75,76,608,65,0,66,67,68,0,0,69,70,71,72,73,74,75,76,0,0,0,0,0,18,19,0,0,77,0,0,0,0,0,0,0,0,0,0,0,18,19,23,0,77,0,0,25,26,27,0,0,0,0,0,0,18,19,626,65,77,66,67,68,28,0,69,70,71,72,73,74,75,76,56,0,0,57,23,24,0,171,0,25,26,27,0,56,0,493,57,23,24,0,0,0,25,26,27,56,28,0,57,23,24,0,0,58,25,26,27,18,19,28,0,77,0,59,0,0,58,253,343,0,0,28,0,0,0,0,59,61,58,23,60,0,0,0,25,26,27,0,59,0,61,0,253,0,56,0,0,57,23,24,0,28,61,25,26,27,56,0,0,57,23,24,0,0,0,25,26,27,171,56,28,0,57,23,24,0,491,260,25,26,27,0,28,253,50,51,52,59,53,258,0,253,18,19,0,28,54,0,0,59,0,61,58,253,0,0,0,0,0,0,0,0,59,61,56,0,253,57,23,24,0,0,0,25,26,27,61,56,0,0,57,23,24,0,0,0,25,26,27,56,28,0,57,23,24,0,0,58,25,26,27,0,0,28,0,0,0,59,0,0,58,60,0,0,0,28,0,0,0,0,59,61,258,23,253,0,0,0,25,26,27,0,59,0,61,0,253,0,56,0,0,57,23,24,0,28,61,25,26,27,56,0,0,57,23,24,0,0,0,25,26,27,171,56,28,0,57,23,24,0,440,58,25,26,27,0,28,343,50,51,52,59,53,58,0,253,18,19,0,28,54,0,0,59,0,61,58,60,0,0,0,0,0,0,0,0,59,61,56,0,253,57,23,24,0,0,0,25,26,27,61,56,0,0,57,23,24,0,0,0,25,26,27,56,28,0,57,23,24,0,0,58,25,26,27,0,0,28,0,0,0,59,0,0,58,60,0,0,0,28,0,461,75,76,59,61,58,23,253,462,206,207,25,26,27,0,59,0,61,0,60,0,56,0,0,57,23,24,263,28,61,25,26,27,264,50,51,52,0,53,0,18,19,18,19,77,171,54,28,482,0,66,67,68,438,58,69,70,71,72,73,74,75,76,452,59,66,67,68,253,0,69,70,71,72,73,74,75,76,61,0,0,23,0,0,0,0,25,26,27,0,0,0,23,0,0,0,0,25,26,27,18,19,0,28,77,0,0,0,0,0,113,166,0,0,28,18,19,0,0,77,162,113,23,0,115,0,0,25,26,27,0,162,163,0,116,115,0,0,0,0,0,23,0,0,28,116,25,26,27,0,0,113,23,0,0,0,0,25,26,27,0,162,0,28,0,115,0,0,0,0,113,23,346,0,28,116,25,26,27,0,162,113,0,0,115,0,0,0,564,0,0,162,0,28,116,115,23,0,0,575,113,25,26,27,0,116,294,50,51,52,228,53,0,0,115,18,19,0,28,54,0,0,0,68,116,113,295,296,71,72,73,74,75,76,0,162,68,0,0,115,0,188,189,73,74,75,76,68,0,116,0,0,190,191,73,74,75,76,68,0,0,0,0,188,189,73,74,75,76,0,0,18,19,0,0,77,0,0,0,0,0,0,0,0,18,19,0,23,77,0,0,0,25,26,27,18,19,0,-286,77,0,-286,-286,0,-286,-286,18,19,0,28,77,-286,-286,-286,-286,-286,-286,-286,-286,-286,0,-286,-286,-286,0,-286,171,0,0,0,-286,-286,-286,0,566,0,-286,-286,-286,-286,-286,-286,-286,-286,-286,-286,23,0,-286,23,0,25,26,27,25,26,27,0,23,0,0,0,0,25,26,27,0,0,28,497,0,28,0,88,498,50,51,52,0,53,28,0,0,18,19,171,0,54,171,0,88,-167,-167,544,0,0,516,171,0,0,0,0,0,-167,0,573,94,88,-166,-166,0,-167,-167,-167,-167,-167,-167,-167,-167,-167,-166,0,0,94,0,-165,-165,0,-166,-166,-166,-166,-166,-166,-166,-166,-166,-165,0,0,94,0,0,0,0,-165,-165,-165,-165,-165,-165,-165,-165,-165,203,75,76,0,0,0,0,204,205,206,207,0,-290,-290,0,0,0,-290,0,0,0,0,0,0,-290,-290,-290,0,0,0,-290,-290,-290,-290,-290,-290,-290,-290,-290,-290,18,19,-290,0,77,45,46,47,48,0,0,0,0,0,49,50,51,52,0,53,0,0,0,18,19,0,0,54,349,46,47,48,0,0,0,0,0,49,50,51,52,0,53,0,0,0,18,19,0,0,54,483,46,47,48,0,0,0,0,0,49,50,51,52,0,53,0,0,0,18,19,0,0,54,420,46,47,48,0,0,0,0,0,49,50,51,52,0,53,0,0,0,18,19,0,0,54,549,46,47,48,0,0,0,0,0,49,50,51,52,0,53,0,0,0,18,19,0,0,54,613,46,47,48,0,0,0,0,0,49,50,51,52,0,53,0,0,0,18,19,0,0,54,612,46,47,48,0,0,0,0,0,49,50,51,52,0,53,0,265,48,18,19,0,0,54,266,50,51,52,0,53,0,0,263,18,19,0,0,54,274,50,51,52,0,53,0,0,0,18,19,0,0,54,337,50,51,52,0,53,338,0,0,339,19,0,0,54,0,0,340,341,278,50,51,52,0,53,0,0,0,18,19,0,0,54,277,50,51,52,0,53,0,0,0,18,19,0,0,54,275,50,51,52,0,53,0,0,0,18,19,0,0,54,503,50,51,52,0,53,0,0,0,18,19,0,0,54,502,50,51,52,0,53,0,0,0,18,19,0,0,54,489,50,51,52,0,53,0,0,0,18,19,0,0,54,435,50,51,52,0,53,0,0,0,18,19,0,0,54,431,50,51,52,0,53,0,0,0,18,19,0,0,54,544,50,51,52,0,53,0,0,0,18,19,0,0,54,542,50,51,52,0,53,0,0,0,18,19,0,0,54,533,50,51,52,0,53,0,0,0,18,19,0,0,54,516,50,51,52,0,53,0,0,0,18,19,0,0,54,514,50,51,52,0,53,0,0,0,18,19,0,0,54,498,50,51,52,0,53,0,0,0,18,19,0,0,54,600,50,51,52,0,53,0,0,0,18,19,0,0,54,599,50,51,52,0,53,0,0,0,18,19,0,0,54,584,50,51,52,0,53,0,0,0,18,19,0,0,54,583,50,51,52,0,53,0,0,0,18,19,0,0,54,614,50,51,52,0,53,0,0,0,18,19,0,0,54,611,50,51,52,0,53,0,0,0,18,19,0,0,54,606,50,51,52,0,53,0,0,0,18,19,0,0,54,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
+	])
+
+happyReduceArr = Happy_Data_Array.array (12, 325) [
+	(12 , happyReduce_12),
+	(13 , happyReduce_13),
+	(14 , happyReduce_14),
+	(15 , happyReduce_15),
+	(16 , happyReduce_16),
+	(17 , happyReduce_17),
+	(18 , happyReduce_18),
+	(19 , happyReduce_19),
+	(20 , happyReduce_20),
+	(21 , happyReduce_21),
+	(22 , happyReduce_22),
+	(23 , happyReduce_23),
+	(24 , happyReduce_24),
+	(25 , happyReduce_25),
+	(26 , happyReduce_26),
+	(27 , happyReduce_27),
+	(28 , happyReduce_28),
+	(29 , happyReduce_29),
+	(30 , happyReduce_30),
+	(31 , happyReduce_31),
+	(32 , happyReduce_32),
+	(33 , happyReduce_33),
+	(34 , happyReduce_34),
+	(35 , happyReduce_35),
+	(36 , happyReduce_36),
+	(37 , happyReduce_37),
+	(38 , happyReduce_38),
+	(39 , happyReduce_39),
+	(40 , happyReduce_40),
+	(41 , happyReduce_41),
+	(42 , happyReduce_42),
+	(43 , happyReduce_43),
+	(44 , happyReduce_44),
+	(45 , happyReduce_45),
+	(46 , happyReduce_46),
+	(47 , happyReduce_47),
+	(48 , happyReduce_48),
+	(49 , happyReduce_49),
+	(50 , happyReduce_50),
+	(51 , happyReduce_51),
+	(52 , happyReduce_52),
+	(53 , happyReduce_53),
+	(54 , happyReduce_54),
+	(55 , happyReduce_55),
+	(56 , happyReduce_56),
+	(57 , happyReduce_57),
+	(58 , happyReduce_58),
+	(59 , happyReduce_59),
+	(60 , happyReduce_60),
+	(61 , happyReduce_61),
+	(62 , happyReduce_62),
+	(63 , happyReduce_63),
+	(64 , happyReduce_64),
+	(65 , happyReduce_65),
+	(66 , happyReduce_66),
+	(67 , happyReduce_67),
+	(68 , happyReduce_68),
+	(69 , happyReduce_69),
+	(70 , happyReduce_70),
+	(71 , happyReduce_71),
+	(72 , happyReduce_72),
+	(73 , happyReduce_73),
+	(74 , happyReduce_74),
+	(75 , happyReduce_75),
+	(76 , happyReduce_76),
+	(77 , happyReduce_77),
+	(78 , happyReduce_78),
+	(79 , happyReduce_79),
+	(80 , happyReduce_80),
+	(81 , happyReduce_81),
+	(82 , happyReduce_82),
+	(83 , happyReduce_83),
+	(84 , happyReduce_84),
+	(85 , happyReduce_85),
+	(86 , happyReduce_86),
+	(87 , happyReduce_87),
+	(88 , happyReduce_88),
+	(89 , happyReduce_89),
+	(90 , happyReduce_90),
+	(91 , happyReduce_91),
+	(92 , happyReduce_92),
+	(93 , happyReduce_93),
+	(94 , happyReduce_94),
+	(95 , happyReduce_95),
+	(96 , happyReduce_96),
+	(97 , happyReduce_97),
+	(98 , happyReduce_98),
+	(99 , happyReduce_99),
+	(100 , happyReduce_100),
+	(101 , happyReduce_101),
+	(102 , happyReduce_102),
+	(103 , happyReduce_103),
+	(104 , happyReduce_104),
+	(105 , happyReduce_105),
+	(106 , happyReduce_106),
+	(107 , happyReduce_107),
+	(108 , happyReduce_108),
+	(109 , happyReduce_109),
+	(110 , happyReduce_110),
+	(111 , happyReduce_111),
+	(112 , happyReduce_112),
+	(113 , happyReduce_113),
+	(114 , happyReduce_114),
+	(115 , happyReduce_115),
+	(116 , happyReduce_116),
+	(117 , happyReduce_117),
+	(118 , happyReduce_118),
+	(119 , happyReduce_119),
+	(120 , happyReduce_120),
+	(121 , happyReduce_121),
+	(122 , happyReduce_122),
+	(123 , happyReduce_123),
+	(124 , happyReduce_124),
+	(125 , happyReduce_125),
+	(126 , happyReduce_126),
+	(127 , happyReduce_127),
+	(128 , happyReduce_128),
+	(129 , happyReduce_129),
+	(130 , happyReduce_130),
+	(131 , happyReduce_131),
+	(132 , happyReduce_132),
+	(133 , happyReduce_133),
+	(134 , happyReduce_134),
+	(135 , happyReduce_135),
+	(136 , happyReduce_136),
+	(137 , happyReduce_137),
+	(138 , happyReduce_138),
+	(139 , happyReduce_139),
+	(140 , happyReduce_140),
+	(141 , happyReduce_141),
+	(142 , happyReduce_142),
+	(143 , happyReduce_143),
+	(144 , happyReduce_144),
+	(145 , happyReduce_145),
+	(146 , happyReduce_146),
+	(147 , happyReduce_147),
+	(148 , happyReduce_148),
+	(149 , happyReduce_149),
+	(150 , happyReduce_150),
+	(151 , happyReduce_151),
+	(152 , happyReduce_152),
+	(153 , happyReduce_153),
+	(154 , happyReduce_154),
+	(155 , happyReduce_155),
+	(156 , happyReduce_156),
+	(157 , happyReduce_157),
+	(158 , happyReduce_158),
+	(159 , happyReduce_159),
+	(160 , happyReduce_160),
+	(161 , happyReduce_161),
+	(162 , happyReduce_162),
+	(163 , happyReduce_163),
+	(164 , happyReduce_164),
+	(165 , happyReduce_165),
+	(166 , happyReduce_166),
+	(167 , happyReduce_167),
+	(168 , happyReduce_168),
+	(169 , happyReduce_169),
+	(170 , happyReduce_170),
+	(171 , happyReduce_171),
+	(172 , happyReduce_172),
+	(173 , happyReduce_173),
+	(174 , happyReduce_174),
+	(175 , happyReduce_175),
+	(176 , happyReduce_176),
+	(177 , happyReduce_177),
+	(178 , happyReduce_178),
+	(179 , happyReduce_179),
+	(180 , happyReduce_180),
+	(181 , happyReduce_181),
+	(182 , happyReduce_182),
+	(183 , happyReduce_183),
+	(184 , happyReduce_184),
+	(185 , happyReduce_185),
+	(186 , happyReduce_186),
+	(187 , happyReduce_187),
+	(188 , happyReduce_188),
+	(189 , happyReduce_189),
+	(190 , happyReduce_190),
+	(191 , happyReduce_191),
+	(192 , happyReduce_192),
+	(193 , happyReduce_193),
+	(194 , happyReduce_194),
+	(195 , happyReduce_195),
+	(196 , happyReduce_196),
+	(197 , happyReduce_197),
+	(198 , happyReduce_198),
+	(199 , happyReduce_199),
+	(200 , happyReduce_200),
+	(201 , happyReduce_201),
+	(202 , happyReduce_202),
+	(203 , happyReduce_203),
+	(204 , happyReduce_204),
+	(205 , happyReduce_205),
+	(206 , happyReduce_206),
+	(207 , happyReduce_207),
+	(208 , happyReduce_208),
+	(209 , happyReduce_209),
+	(210 , happyReduce_210),
+	(211 , happyReduce_211),
+	(212 , happyReduce_212),
+	(213 , happyReduce_213),
+	(214 , happyReduce_214),
+	(215 , happyReduce_215),
+	(216 , happyReduce_216),
+	(217 , happyReduce_217),
+	(218 , happyReduce_218),
+	(219 , happyReduce_219),
+	(220 , happyReduce_220),
+	(221 , happyReduce_221),
+	(222 , happyReduce_222),
+	(223 , happyReduce_223),
+	(224 , happyReduce_224),
+	(225 , happyReduce_225),
+	(226 , happyReduce_226),
+	(227 , happyReduce_227),
+	(228 , happyReduce_228),
+	(229 , happyReduce_229),
+	(230 , happyReduce_230),
+	(231 , happyReduce_231),
+	(232 , happyReduce_232),
+	(233 , happyReduce_233),
+	(234 , happyReduce_234),
+	(235 , happyReduce_235),
+	(236 , happyReduce_236),
+	(237 , happyReduce_237),
+	(238 , happyReduce_238),
+	(239 , happyReduce_239),
+	(240 , happyReduce_240),
+	(241 , happyReduce_241),
+	(242 , happyReduce_242),
+	(243 , happyReduce_243),
+	(244 , happyReduce_244),
+	(245 , happyReduce_245),
+	(246 , happyReduce_246),
+	(247 , happyReduce_247),
+	(248 , happyReduce_248),
+	(249 , happyReduce_249),
+	(250 , happyReduce_250),
+	(251 , happyReduce_251),
+	(252 , happyReduce_252),
+	(253 , happyReduce_253),
+	(254 , happyReduce_254),
+	(255 , happyReduce_255),
+	(256 , happyReduce_256),
+	(257 , happyReduce_257),
+	(258 , happyReduce_258),
+	(259 , happyReduce_259),
+	(260 , happyReduce_260),
+	(261 , happyReduce_261),
+	(262 , happyReduce_262),
+	(263 , happyReduce_263),
+	(264 , happyReduce_264),
+	(265 , happyReduce_265),
+	(266 , happyReduce_266),
+	(267 , happyReduce_267),
+	(268 , happyReduce_268),
+	(269 , happyReduce_269),
+	(270 , happyReduce_270),
+	(271 , happyReduce_271),
+	(272 , happyReduce_272),
+	(273 , happyReduce_273),
+	(274 , happyReduce_274),
+	(275 , happyReduce_275),
+	(276 , happyReduce_276),
+	(277 , happyReduce_277),
+	(278 , happyReduce_278),
+	(279 , happyReduce_279),
+	(280 , happyReduce_280),
+	(281 , happyReduce_281),
+	(282 , happyReduce_282),
+	(283 , happyReduce_283),
+	(284 , happyReduce_284),
+	(285 , happyReduce_285),
+	(286 , happyReduce_286),
+	(287 , happyReduce_287),
+	(288 , happyReduce_288),
+	(289 , happyReduce_289),
+	(290 , happyReduce_290),
+	(291 , happyReduce_291),
+	(292 , happyReduce_292),
+	(293 , happyReduce_293),
+	(294 , happyReduce_294),
+	(295 , happyReduce_295),
+	(296 , happyReduce_296),
+	(297 , happyReduce_297),
+	(298 , happyReduce_298),
+	(299 , happyReduce_299),
+	(300 , happyReduce_300),
+	(301 , happyReduce_301),
+	(302 , happyReduce_302),
+	(303 , happyReduce_303),
+	(304 , happyReduce_304),
+	(305 , happyReduce_305),
+	(306 , happyReduce_306),
+	(307 , happyReduce_307),
+	(308 , happyReduce_308),
+	(309 , happyReduce_309),
+	(310 , happyReduce_310),
+	(311 , happyReduce_311),
+	(312 , happyReduce_312),
+	(313 , happyReduce_313),
+	(314 , happyReduce_314),
+	(315 , happyReduce_315),
+	(316 , happyReduce_316),
+	(317 , happyReduce_317),
+	(318 , happyReduce_318),
+	(319 , happyReduce_319),
+	(320 , happyReduce_320),
+	(321 , happyReduce_321),
+	(322 , happyReduce_322),
+	(323 , happyReduce_323),
+	(324 , happyReduce_324),
+	(325 , happyReduce_325)
+	]
+
+happy_n_terms = 73 :: Prelude.Int
+happy_n_nonterms = 106 :: Prelude.Int
+
+happyReduce_12 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_12 = happySpecReduce_2  0 happyReduction_12
+happyReduction_12 (HappyAbsSyn15  happy_var_2)
+	_
+	 =  HappyAbsSyn15
+		 (happy_var_2
+	)
+happyReduction_12 _ _  = notHappyAtAll 
+
+happyReduce_13 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_13 = happySpecReduce_3  0 happyReduction_13
+happyReduction_13 _
+	(HappyAbsSyn17  happy_var_2)
+	_
+	 =  HappyAbsSyn15
+		 (mkAnonymousModule happy_var_2
+	)
+happyReduction_13 _ _ _  = notHappyAtAll 
+
+happyReduce_14 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_14 = happyReduce 5 1 happyReduction_14
+happyReduction_14 (_ `HappyStk`
+	(HappyAbsSyn17  happy_var_4) `HappyStk`
+	_ `HappyStk`
+	_ `HappyStk`
+	(HappyAbsSyn114  happy_var_1) `HappyStk`
+	happyRest)
+	 = HappyAbsSyn15
+		 (mkModule happy_var_1 happy_var_4
+	) `HappyStk` happyRest
+
+happyReduce_15 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_15 = happyReduce 7 1 happyReduction_15
+happyReduction_15 (_ `HappyStk`
+	(HappyAbsSyn17  happy_var_6) `HappyStk`
+	_ `HappyStk`
+	_ `HappyStk`
+	(HappyAbsSyn114  happy_var_3) `HappyStk`
+	_ `HappyStk`
+	(HappyAbsSyn114  happy_var_1) `HappyStk`
+	happyRest)
+	 = HappyAbsSyn15
+		 (mkModuleInstance happy_var_1 happy_var_3 happy_var_6
+	) `HappyStk` happyRest
+
+happyReduce_16 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_16 = happySpecReduce_1  2 happyReduction_16
+happyReduction_16 (HappyAbsSyn17  happy_var_1)
+	 =  HappyAbsSyn17
+		 (reverse happy_var_1
+	)
+happyReduction_16 _  = notHappyAtAll 
+
+happyReduce_17 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_17 = happySpecReduce_0  2 happyReduction_17
+happyReduction_17  =  HappyAbsSyn17
+		 ([]
+	)
+
+happyReduce_18 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_18 = happyReduce 4 3 happyReduction_18
+happyReduction_18 ((HappyAbsSyn21  happy_var_4) `HappyStk`
+	(HappyAbsSyn20  happy_var_3) `HappyStk`
+	(HappyAbsSyn19  happy_var_2) `HappyStk`
+	(HappyTerminal (Located happy_var_1 (Token (KW KW_import)    _))) `HappyStk`
+	happyRest)
+	 = HappyAbsSyn18
+		 (Located { srcRange = rComb happy_var_1
+                                                   $ fromMaybe (srcRange happy_var_2)
+                                                   $ msum [ fmap srcRange happy_var_4
+                                                          , fmap srcRange happy_var_3
+                                                          ]
+                                        , thing    = Import
+                                          { iModule    = thing happy_var_2
+                                          , iAs        = fmap thing happy_var_3
+                                          , iSpec      = fmap thing happy_var_4
+                                          }
+                                        }
+	) `HappyStk` happyRest
+
+happyReduce_19 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_19 = happySpecReduce_2  4 happyReduction_19
+happyReduction_19 (HappyAbsSyn116  happy_var_2)
+	_
+	 =  HappyAbsSyn19
+		 (ImpNested `fmap` happy_var_2
+	)
+happyReduction_19 _ _  = notHappyAtAll 
+
+happyReduce_20 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_20 = happySpecReduce_1  4 happyReduction_20
+happyReduction_20 (HappyAbsSyn114  happy_var_1)
+	 =  HappyAbsSyn19
+		 (ImpTop `fmap` happy_var_1
+	)
+happyReduction_20 _  = notHappyAtAll 
+
+happyReduce_21 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_21 = happySpecReduce_2  5 happyReduction_21
+happyReduction_21 (HappyAbsSyn114  happy_var_2)
+	_
+	 =  HappyAbsSyn20
+		 (Just happy_var_2
+	)
+happyReduction_21 _ _  = notHappyAtAll 
+
+happyReduce_22 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_22 = happySpecReduce_0  5 happyReduction_22
+happyReduction_22  =  HappyAbsSyn20
+		 (Nothing
+	)
+
+happyReduce_23 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_23 = happyReduce 4 6 happyReduction_23
+happyReduction_23 (_ `HappyStk`
+	(HappyAbsSyn22  happy_var_3) `HappyStk`
+	_ `HappyStk`
+	(HappyAbsSyn23  happy_var_1) `HappyStk`
+	happyRest)
+	 = HappyAbsSyn21
+		 (Just Located
+                                  { srcRange = case happy_var_3 of
+                                      { [] -> emptyRange
+                                      ; xs -> rCombs (map srcRange xs) }
+                                  , thing    = happy_var_1 (reverse (map thing happy_var_3))
+                                  }
+	) `HappyStk` happyRest
+
+happyReduce_24 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_24 = happySpecReduce_0  6 happyReduction_24
+happyReduction_24  =  HappyAbsSyn21
+		 (Nothing
+	)
+
+happyReduce_25 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_25 = happySpecReduce_3  7 happyReduction_25
+happyReduction_25 (HappyAbsSyn44  happy_var_3)
+	_
+	(HappyAbsSyn22  happy_var_1)
+	 =  HappyAbsSyn22
+		 (fmap getIdent happy_var_3 : happy_var_1
+	)
+happyReduction_25 _ _ _  = notHappyAtAll 
+
+happyReduce_26 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_26 = happySpecReduce_1  7 happyReduction_26
+happyReduction_26 (HappyAbsSyn44  happy_var_1)
+	 =  HappyAbsSyn22
+		 ([fmap getIdent happy_var_1]
+	)
+happyReduction_26 _  = notHappyAtAll 
+
+happyReduce_27 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_27 = happySpecReduce_0  7 happyReduction_27
+happyReduction_27  =  HappyAbsSyn22
+		 ([]
+	)
+
+happyReduce_28 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_28 = happySpecReduce_1  8 happyReduction_28
+happyReduction_28 _
+	 =  HappyAbsSyn23
+		 (Hiding
+	)
+
+happyReduce_29 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_29 = happySpecReduce_0  8 happyReduction_29
+happyReduction_29  =  HappyAbsSyn23
+		 (Only
+	)
+
+happyReduce_30 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_30 = happySpecReduce_1  9 happyReduction_30
+happyReduction_30 (HappyAbsSyn17  happy_var_1)
+	 =  HappyAbsSyn24
+		 (Program (reverse happy_var_1)
+	)
+happyReduction_30 _  = notHappyAtAll 
+
+happyReduce_31 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_31 = happySpecReduce_0  9 happyReduction_31
+happyReduction_31  =  HappyAbsSyn24
+		 (Program []
+	)
+
+happyReduce_32 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_32 = happySpecReduce_3  10 happyReduction_32
+happyReduction_32 _
+	(HappyAbsSyn17  happy_var_2)
+	_
+	 =  HappyAbsSyn24
+		 (Program (reverse happy_var_2)
+	)
+happyReduction_32 _ _ _  = notHappyAtAll 
+
+happyReduce_33 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_33 = happySpecReduce_2  10 happyReduction_33
+happyReduction_33 _
+	_
+	 =  HappyAbsSyn24
+		 (Program []
+	)
+
+happyReduce_34 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_34 = happySpecReduce_2  11 happyReduction_34
+happyReduction_34 _
+	(HappyAbsSyn17  happy_var_1)
+	 =  HappyAbsSyn17
+		 (happy_var_1
+	)
+happyReduction_34 _ _  = notHappyAtAll 
+
+happyReduce_35 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_35 = happySpecReduce_3  11 happyReduction_35
+happyReduction_35 _
+	(HappyAbsSyn17  happy_var_2)
+	(HappyAbsSyn17  happy_var_1)
+	 =  HappyAbsSyn17
+		 (happy_var_2 ++ happy_var_1
+	)
+happyReduction_35 _ _ _  = notHappyAtAll 
+
+happyReduce_36 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_36 = happySpecReduce_1  12 happyReduction_36
+happyReduction_36 (HappyAbsSyn17  happy_var_1)
+	 =  HappyAbsSyn17
+		 (happy_var_1
+	)
+happyReduction_36 _  = notHappyAtAll 
+
+happyReduce_37 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_37 = happySpecReduce_3  12 happyReduction_37
+happyReduction_37 (HappyAbsSyn17  happy_var_3)
+	_
+	(HappyAbsSyn17  happy_var_1)
+	 =  HappyAbsSyn17
+		 (happy_var_3 ++ happy_var_1
+	)
+happyReduction_37 _ _ _  = notHappyAtAll 
+
+happyReduce_38 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_38 = happySpecReduce_3  12 happyReduction_38
+happyReduction_38 (HappyAbsSyn17  happy_var_3)
+	_
+	(HappyAbsSyn17  happy_var_1)
+	 =  HappyAbsSyn17
+		 (happy_var_3 ++ happy_var_1
+	)
+happyReduction_38 _ _ _  = notHappyAtAll 
+
+happyReduce_39 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_39 = happySpecReduce_1  13 happyReduction_39
+happyReduction_39 (HappyAbsSyn38  happy_var_1)
+	 =  HappyAbsSyn17
+		 ([exportDecl Nothing   Public happy_var_1]
+	)
+happyReduction_39 _  = notHappyAtAll 
+
+happyReduce_40 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_40 = happySpecReduce_2  13 happyReduction_40
+happyReduction_40 (HappyAbsSyn38  happy_var_2)
+	(HappyAbsSyn35  happy_var_1)
+	 =  HappyAbsSyn17
+		 ([exportDecl (Just happy_var_1) Public happy_var_2]
+	)
+happyReduction_40 _ _  = notHappyAtAll 
+
+happyReduce_41 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_41 = happyMonadReduce 3 13 happyReduction_41
+happyReduction_41 ((HappyTerminal (happy_var_3@(Located _ (Token (StrLit {}) _)))) `HappyStk`
+	_ `HappyStk`
+	_ `HappyStk`
+	happyRest) tk
+	 = happyThen ((( (return . Include) `fmap` fromStrLit happy_var_3))
+	) (\r -> happyReturn (HappyAbsSyn17 r))
+
+happyReduce_42 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_42 = happyReduce 6 13 happyReduction_42
+happyReduction_42 ((HappyAbsSyn59  happy_var_6) `HappyStk`
+	_ `HappyStk`
+	(HappyAbsSyn45  happy_var_4) `HappyStk`
+	(HappyAbsSyn44  happy_var_3) `HappyStk`
+	_ `HappyStk`
+	(HappyAbsSyn36  happy_var_1) `HappyStk`
+	happyRest)
+	 = HappyAbsSyn17
+		 ([exportDecl happy_var_1 Public (mkProperty happy_var_3 happy_var_4 happy_var_6)]
+	) `HappyStk` happyRest
+
+happyReduce_43 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_43 = happyReduce 5 13 happyReduction_43
+happyReduction_43 ((HappyAbsSyn59  happy_var_5) `HappyStk`
+	_ `HappyStk`
+	(HappyAbsSyn44  happy_var_3) `HappyStk`
+	_ `HappyStk`
+	(HappyAbsSyn36  happy_var_1) `HappyStk`
+	happyRest)
+	 = HappyAbsSyn17
+		 ([exportDecl happy_var_1 Public (mkProperty happy_var_3 [] happy_var_5)]
+	) `HappyStk` happyRest
+
+happyReduce_44 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_44 = happySpecReduce_2  13 happyReduction_44
+happyReduction_44 (HappyAbsSyn41  happy_var_2)
+	(HappyAbsSyn36  happy_var_1)
+	 =  HappyAbsSyn17
+		 ([exportNewtype Public happy_var_1 happy_var_2]
+	)
+happyReduction_44 _ _  = notHappyAtAll 
+
+happyReduce_45 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_45 = happySpecReduce_1  13 happyReduction_45
+happyReduction_45 (HappyAbsSyn17  happy_var_1)
+	 =  HappyAbsSyn17
+		 (happy_var_1
+	)
+happyReduction_45 _  = notHappyAtAll 
+
+happyReduce_46 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_46 = happySpecReduce_1  13 happyReduction_46
+happyReduction_46 (HappyAbsSyn17  happy_var_1)
+	 =  HappyAbsSyn17
+		 (happy_var_1
+	)
+happyReduction_46 _  = notHappyAtAll 
+
+happyReduce_47 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_47 = happySpecReduce_1  13 happyReduction_47
+happyReduction_47 (HappyAbsSyn17  happy_var_1)
+	 =  HappyAbsSyn17
+		 (happy_var_1
+	)
+happyReduction_47 _  = notHappyAtAll 
+
+happyReduce_48 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_48 = happyMonadReduce 3 13 happyReduction_48
+happyReduction_48 ((HappyAbsSyn15  happy_var_3) `HappyStk`
+	_ `HappyStk`
+	(HappyAbsSyn36  happy_var_1) `HappyStk`
+	happyRest) tk
+	 = happyThen ((( ((:[]) . exportModule happy_var_1) `fmap` mkNested happy_var_3))
+	) (\r -> happyReturn (HappyAbsSyn17 r))
+
+happyReduce_49 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_49 = happySpecReduce_1  13 happyReduction_49
+happyReduction_49 (HappyAbsSyn18  happy_var_1)
+	 =  HappyAbsSyn17
+		 ([DImport happy_var_1]
+	)
+happyReduction_49 _  = notHappyAtAll 
+
+happyReduce_50 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_50 = happySpecReduce_1  14 happyReduction_50
+happyReduction_50 (HappyAbsSyn38  happy_var_1)
+	 =  HappyAbsSyn17
+		 ([Decl (TopLevel {tlExport = Public, tlValue = happy_var_1 })]
+	)
+happyReduction_50 _  = notHappyAtAll 
+
+happyReduce_51 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_51 = happyMonadReduce 2 14 happyReduction_51
+happyReduction_51 ((HappyTerminal (happy_var_2@(Located _ (Token (StrLit {}) _)))) `HappyStk`
+	_ `HappyStk`
+	happyRest) tk
+	 = happyThen ((( (return . Include) `fmap` fromStrLit happy_var_2))
+	) (\r -> happyReturn (HappyAbsSyn17 r))
+
+happyReduce_52 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_52 = happySpecReduce_1  14 happyReduction_52
+happyReduction_52 (HappyAbsSyn17  happy_var_1)
+	 =  HappyAbsSyn17
+		 (happy_var_1
+	)
+happyReduction_52 _  = notHappyAtAll 
+
+happyReduce_53 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_53 = happyReduce 4 15 happyReduction_53
+happyReduction_53 (_ `HappyStk`
+	(HappyAbsSyn17  happy_var_3) `HappyStk`
+	_ `HappyStk`
+	_ `HappyStk`
+	happyRest)
+	 = HappyAbsSyn17
+		 (changeExport Private (reverse happy_var_3)
+	) `HappyStk` happyRest
+
+happyReduce_54 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_54 = happyReduce 5 15 happyReduction_54
+happyReduction_54 (_ `HappyStk`
+	(HappyAbsSyn17  happy_var_4) `HappyStk`
+	_ `HappyStk`
+	_ `HappyStk`
+	_ `HappyStk`
+	happyRest)
+	 = HappyAbsSyn17
+		 (changeExport Private (reverse happy_var_4)
+	) `HappyStk` happyRest
+
+happyReduce_55 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_55 = happyReduce 5 16 happyReduction_55
+happyReduction_55 ((HappyAbsSyn94  happy_var_5) `HappyStk`
+	_ `HappyStk`
+	(HappyAbsSyn44  happy_var_3) `HappyStk`
+	_ `HappyStk`
+	(HappyAbsSyn36  happy_var_1) `HappyStk`
+	happyRest)
+	 = HappyAbsSyn17
+		 (mkPrimDecl happy_var_1 happy_var_3 happy_var_5
+	) `HappyStk` happyRest
+
+happyReduce_56 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_56 = happyReduce 7 16 happyReduction_56
+happyReduction_56 ((HappyAbsSyn94  happy_var_7) `HappyStk`
+	_ `HappyStk`
+	_ `HappyStk`
+	(HappyAbsSyn44  happy_var_4) `HappyStk`
+	_ `HappyStk`
+	_ `HappyStk`
+	(HappyAbsSyn36  happy_var_1) `HappyStk`
+	happyRest)
+	 = HappyAbsSyn17
+		 (mkPrimDecl happy_var_1 happy_var_4 happy_var_7
+	) `HappyStk` happyRest
+
+happyReduce_57 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_57 = happyMonadReduce 6 16 happyReduction_57
+happyReduction_57 ((HappyAbsSyn98  happy_var_6) `HappyStk`
+	_ `HappyStk`
+	(HappyAbsSyn94  happy_var_4) `HappyStk`
+	_ `HappyStk`
+	_ `HappyStk`
+	(HappyAbsSyn36  happy_var_1) `HappyStk`
+	happyRest) tk
+	 = happyThen ((( mkPrimTypeDecl happy_var_1 happy_var_4 happy_var_6))
+	) (\r -> happyReturn (HappyAbsSyn17 r))
+
+happyReduce_58 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_58 = happyReduce 4 17 happyReduction_58
+happyReduction_58 (_ `HappyStk`
+	(HappyAbsSyn17  happy_var_3) `HappyStk`
+	_ `HappyStk`
+	_ `HappyStk`
+	happyRest)
+	 = HappyAbsSyn17
+		 (reverse happy_var_3
+	) `HappyStk` happyRest
+
+happyReduce_59 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_59 = happyReduce 5 17 happyReduction_59
+happyReduction_59 (_ `HappyStk`
+	(HappyAbsSyn17  happy_var_4) `HappyStk`
+	_ `HappyStk`
+	_ `HappyStk`
+	_ `HappyStk`
+	happyRest)
+	 = HappyAbsSyn17
+		 (reverse happy_var_4
+	) `HappyStk` happyRest
+
+happyReduce_60 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_60 = happySpecReduce_1  18 happyReduction_60
+happyReduction_60 (HappyAbsSyn34  happy_var_1)
+	 =  HappyAbsSyn17
+		 ([happy_var_1]
+	)
+happyReduction_60 _  = notHappyAtAll 
+
+happyReduce_61 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_61 = happySpecReduce_3  18 happyReduction_61
+happyReduction_61 (HappyAbsSyn34  happy_var_3)
+	_
+	(HappyAbsSyn17  happy_var_1)
+	 =  HappyAbsSyn17
+		 (happy_var_3 : happy_var_1
+	)
+happyReduction_61 _ _ _  = notHappyAtAll 
+
+happyReduce_62 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_62 = happySpecReduce_3  18 happyReduction_62
+happyReduction_62 (HappyAbsSyn34  happy_var_3)
+	_
+	(HappyAbsSyn17  happy_var_1)
+	 =  HappyAbsSyn17
+		 (happy_var_3 : happy_var_1
+	)
+happyReduction_62 _ _ _  = notHappyAtAll 
+
+happyReduce_63 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_63 = happyReduce 4 19 happyReduction_63
+happyReduction_63 ((HappyAbsSyn94  happy_var_4) `HappyStk`
+	_ `HappyStk`
+	(HappyAbsSyn44  happy_var_2) `HappyStk`
+	(HappyAbsSyn36  happy_var_1) `HappyStk`
+	happyRest)
+	 = HappyAbsSyn34
+		 (mkParFun happy_var_1 happy_var_2 happy_var_4
+	) `HappyStk` happyRest
+
+happyReduce_64 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_64 = happyMonadReduce 5 19 happyReduction_64
+happyReduction_64 ((HappyAbsSyn98  happy_var_5) `HappyStk`
+	_ `HappyStk`
+	(HappyAbsSyn44  happy_var_3) `HappyStk`
+	_ `HappyStk`
+	(HappyAbsSyn36  happy_var_1) `HappyStk`
+	happyRest) tk
+	 = happyThen ((( mkParType happy_var_1 happy_var_3 happy_var_5))
+	) (\r -> happyReturn (HappyAbsSyn34 r))
+
+happyReduce_65 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_65 = happyMonadReduce 4 19 happyReduction_65
+happyReduction_65 ((HappyAbsSyn103  happy_var_4) `HappyStk`
+	_ `HappyStk`
+	_ `HappyStk`
+	_ `HappyStk`
+	happyRest) tk
+	 = happyThen ((( fmap (DParameterConstraint . distrLoc)
+                                            (mkProp happy_var_4)))
+	) (\r -> happyReturn (HappyAbsSyn34 r))
+
+happyReduce_66 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_66 = happySpecReduce_1  20 happyReduction_66
+happyReduction_66 (HappyTerminal (happy_var_1@(Located _ (Token (White DocStr) _))))
+	 =  HappyAbsSyn35
+		 (mkDoc (fmap tokenText happy_var_1)
+	)
+happyReduction_66 _  = notHappyAtAll 
+
+happyReduce_67 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_67 = happySpecReduce_1  21 happyReduction_67
+happyReduction_67 (HappyAbsSyn35  happy_var_1)
+	 =  HappyAbsSyn36
+		 (Just happy_var_1
+	)
+happyReduction_67 _  = notHappyAtAll 
+
+happyReduce_68 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_68 = happySpecReduce_0  21 happyReduction_68
+happyReduction_68  =  HappyAbsSyn36
+		 (Nothing
+	)
+
+happyReduce_69 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_69 = happySpecReduce_1  22 happyReduction_69
+happyReduction_69 _
+	 =  HappyAbsSyn37
+		 ([]
+	)
+
+happyReduce_70 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_70 = happySpecReduce_3  23 happyReduction_70
+happyReduction_70 (HappyAbsSyn94  happy_var_3)
+	_
+	(HappyAbsSyn43  happy_var_1)
+	 =  HappyAbsSyn38
+		 (at (head happy_var_1,happy_var_3) $ DSignature (reverse happy_var_1) happy_var_3
+	)
+happyReduction_70 _ _ _  = notHappyAtAll 
+
+happyReduce_71 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_71 = happySpecReduce_3  23 happyReduction_71
+happyReduction_71 (HappyAbsSyn59  happy_var_3)
+	_
+	(HappyAbsSyn88  happy_var_1)
+	 =  HappyAbsSyn38
+		 (at (happy_var_1,happy_var_3) $ DPatBind happy_var_1 happy_var_3
+	)
+happyReduction_71 _ _ _  = notHappyAtAll 
+
+happyReduce_72 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_72 = happyReduce 5 23 happyReduction_72
+happyReduction_72 ((HappyAbsSyn59  happy_var_5) `HappyStk`
+	_ `HappyStk`
+	_ `HappyStk`
+	(HappyAbsSyn44  happy_var_2) `HappyStk`
+	(HappyTerminal (Located happy_var_1 (Token (Sym ParenL  ) _))) `HappyStk`
+	happyRest)
+	 = HappyAbsSyn38
+		 (at (happy_var_1,happy_var_5) $ DPatBind (PVar happy_var_2) happy_var_5
+	) `HappyStk` happyRest
+
+happyReduce_73 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_73 = happyReduce 4 23 happyReduction_73
+happyReduction_73 ((HappyAbsSyn37  happy_var_4) `HappyStk`
+	_ `HappyStk`
+	(HappyAbsSyn48  happy_var_2) `HappyStk`
+	(HappyAbsSyn44  happy_var_1) `HappyStk`
+	happyRest)
+	 = HappyAbsSyn38
+		 (at (happy_var_1,happy_var_4) $ mkIndexedPropGuardsDecl happy_var_1 happy_var_2 happy_var_4
+	) `HappyStk` happyRest
+
+happyReduce_74 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_74 = happyReduce 4 23 happyReduction_74
+happyReduction_74 ((HappyAbsSyn59  happy_var_4) `HappyStk`
+	_ `HappyStk`
+	(HappyAbsSyn48  happy_var_2) `HappyStk`
+	(HappyAbsSyn44  happy_var_1) `HappyStk`
+	happyRest)
+	 = HappyAbsSyn38
+		 (at (happy_var_1,happy_var_4) $ mkIndexedDecl happy_var_1 happy_var_2 happy_var_4
+	) `HappyStk` happyRest
+
+happyReduce_75 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_75 = happyReduce 5 23 happyReduction_75
+happyReduction_75 ((HappyAbsSyn59  happy_var_5) `HappyStk`
+	_ `HappyStk`
+	(HappyAbsSyn88  happy_var_3) `HappyStk`
+	(HappyAbsSyn44  happy_var_2) `HappyStk`
+	(HappyAbsSyn88  happy_var_1) `HappyStk`
+	happyRest)
+	 = HappyAbsSyn38
+		 (at (happy_var_1,happy_var_5) $
+                             DBind $ Bind { bName      = happy_var_2
+                                          , bParams    = [happy_var_1,happy_var_3]
+                                          , bDef       = at happy_var_5 (Located emptyRange (DExpr happy_var_5))
+                                          , bSignature = Nothing
+                                          , bPragmas   = []
+                                          , bMono      = False
+                                          , bInfix     = True
+                                          , bFixity    = Nothing
+                                          , bDoc       = Nothing
+                                          , bExport    = Public
+                                          }
+	) `HappyStk` happyRest
+
+happyReduce_76 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_76 = happyMonadReduce 4 23 happyReduction_76
+happyReduction_76 ((HappyAbsSyn103  happy_var_4) `HappyStk`
+	_ `HappyStk`
+	(HappyAbsSyn44  happy_var_2) `HappyStk`
+	(HappyTerminal (Located happy_var_1 (Token (KW KW_type   ) _))) `HappyStk`
+	happyRest) tk
+	 = happyThen ((( at (happy_var_1,happy_var_4) `fmap` mkTySyn happy_var_2 [] happy_var_4))
+	) (\r -> happyReturn (HappyAbsSyn38 r))
+
+happyReduce_77 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_77 = happyMonadReduce 5 23 happyReduction_77
+happyReduction_77 ((HappyAbsSyn103  happy_var_5) `HappyStk`
+	_ `HappyStk`
+	(HappyAbsSyn100  happy_var_3) `HappyStk`
+	(HappyAbsSyn44  happy_var_2) `HappyStk`
+	(HappyTerminal (Located happy_var_1 (Token (KW KW_type   ) _))) `HappyStk`
+	happyRest) tk
+	 = happyThen ((( at (happy_var_1,happy_var_5) `fmap` mkTySyn happy_var_2 (reverse happy_var_3) happy_var_5))
+	) (\r -> happyReturn (HappyAbsSyn38 r))
+
+happyReduce_78 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_78 = happyMonadReduce 6 23 happyReduction_78
+happyReduction_78 ((HappyAbsSyn103  happy_var_6) `HappyStk`
+	_ `HappyStk`
+	(HappyAbsSyn99  happy_var_4) `HappyStk`
+	(HappyAbsSyn44  happy_var_3) `HappyStk`
+	(HappyAbsSyn99  happy_var_2) `HappyStk`
+	(HappyTerminal (Located happy_var_1 (Token (KW KW_type   ) _))) `HappyStk`
+	happyRest) tk
+	 = happyThen ((( at (happy_var_1,happy_var_6) `fmap` mkTySyn happy_var_3 [happy_var_2, happy_var_4] happy_var_6))
+	) (\r -> happyReturn (HappyAbsSyn38 r))
+
+happyReduce_79 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_79 = happyMonadReduce 5 23 happyReduction_79
+happyReduction_79 ((HappyAbsSyn103  happy_var_5) `HappyStk`
+	_ `HappyStk`
+	(HappyAbsSyn44  happy_var_3) `HappyStk`
+	(HappyTerminal (Located happy_var_2 (Token (KW KW_constraint) _))) `HappyStk`
+	_ `HappyStk`
+	happyRest) tk
+	 = happyThen ((( at (happy_var_2,happy_var_5) `fmap` mkPropSyn happy_var_3 [] happy_var_5))
+	) (\r -> happyReturn (HappyAbsSyn38 r))
+
+happyReduce_80 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_80 = happyMonadReduce 6 23 happyReduction_80
+happyReduction_80 ((HappyAbsSyn103  happy_var_6) `HappyStk`
+	_ `HappyStk`
+	(HappyAbsSyn100  happy_var_4) `HappyStk`
+	(HappyAbsSyn44  happy_var_3) `HappyStk`
+	(HappyTerminal (Located happy_var_2 (Token (KW KW_constraint) _))) `HappyStk`
+	_ `HappyStk`
+	happyRest) tk
+	 = happyThen ((( at (happy_var_2,happy_var_6) `fmap` mkPropSyn happy_var_3 (reverse happy_var_4) happy_var_6))
+	) (\r -> happyReturn (HappyAbsSyn38 r))
+
+happyReduce_81 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_81 = happyMonadReduce 7 23 happyReduction_81
+happyReduction_81 ((HappyAbsSyn103  happy_var_7) `HappyStk`
+	_ `HappyStk`
+	(HappyAbsSyn99  happy_var_5) `HappyStk`
+	(HappyAbsSyn44  happy_var_4) `HappyStk`
+	(HappyAbsSyn99  happy_var_3) `HappyStk`
+	(HappyTerminal (Located happy_var_2 (Token (KW KW_constraint) _))) `HappyStk`
+	_ `HappyStk`
+	happyRest) tk
+	 = happyThen ((( at (happy_var_2,happy_var_7) `fmap` mkPropSyn happy_var_4 [happy_var_3, happy_var_5] happy_var_7))
+	) (\r -> happyReturn (HappyAbsSyn38 r))
+
+happyReduce_82 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_82 = happyMonadReduce 3 23 happyReduction_82
+happyReduction_82 ((HappyAbsSyn58  happy_var_3) `HappyStk`
+	(HappyTerminal (happy_var_2@(Located _ (Token (Num   {}) _)))) `HappyStk`
+	_ `HappyStk`
+	happyRest) tk
+	 = happyThen ((( mkFixity LeftAssoc  happy_var_2 (reverse happy_var_3)))
+	) (\r -> happyReturn (HappyAbsSyn38 r))
+
+happyReduce_83 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_83 = happyMonadReduce 3 23 happyReduction_83
+happyReduction_83 ((HappyAbsSyn58  happy_var_3) `HappyStk`
+	(HappyTerminal (happy_var_2@(Located _ (Token (Num   {}) _)))) `HappyStk`
+	_ `HappyStk`
+	happyRest) tk
+	 = happyThen ((( mkFixity RightAssoc happy_var_2 (reverse happy_var_3)))
+	) (\r -> happyReturn (HappyAbsSyn38 r))
+
+happyReduce_84 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_84 = happyMonadReduce 3 23 happyReduction_84
+happyReduction_84 ((HappyAbsSyn58  happy_var_3) `HappyStk`
+	(HappyTerminal (happy_var_2@(Located _ (Token (Num   {}) _)))) `HappyStk`
+	_ `HappyStk`
+	happyRest) tk
+	 = happyThen ((( mkFixity NonAssoc   happy_var_2 (reverse happy_var_3)))
+	) (\r -> happyReturn (HappyAbsSyn38 r))
+
+happyReduce_85 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_85 = happyMonadReduce 1 23 happyReduction_85
+happyReduction_85 (_ `HappyStk`
+	happyRest) tk
+	 = happyThen ((( expected "a declaration"))
+	) (\r -> happyReturn (HappyAbsSyn38 r))
+
+happyReduce_86 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_86 = happySpecReduce_1  24 happyReduction_86
+happyReduction_86 (HappyAbsSyn38  happy_var_1)
+	 =  HappyAbsSyn39
+		 ([happy_var_1]
+	)
+happyReduction_86 _  = notHappyAtAll 
+
+happyReduce_87 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_87 = happySpecReduce_2  24 happyReduction_87
+happyReduction_87 _
+	(HappyAbsSyn38  happy_var_1)
+	 =  HappyAbsSyn39
+		 ([happy_var_1]
+	)
+happyReduction_87 _ _  = notHappyAtAll 
+
+happyReduce_88 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_88 = happySpecReduce_3  24 happyReduction_88
+happyReduction_88 (HappyAbsSyn39  happy_var_3)
+	_
+	(HappyAbsSyn38  happy_var_1)
+	 =  HappyAbsSyn39
+		 ((happy_var_1:happy_var_3)
+	)
+happyReduction_88 _ _ _  = notHappyAtAll 
+
+happyReduce_89 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_89 = happyReduce 4 25 happyReduction_89
+happyReduction_89 ((HappyAbsSyn59  happy_var_4) `HappyStk`
+	_ `HappyStk`
+	(HappyAbsSyn88  happy_var_2) `HappyStk`
+	_ `HappyStk`
+	happyRest)
+	 = HappyAbsSyn38
+		 (at (happy_var_2,happy_var_4) $ DPatBind happy_var_2 happy_var_4
+	) `HappyStk` happyRest
+
+happyReduce_90 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_90 = happyReduce 5 25 happyReduction_90
+happyReduction_90 ((HappyAbsSyn59  happy_var_5) `HappyStk`
+	_ `HappyStk`
+	(HappyAbsSyn48  happy_var_3) `HappyStk`
+	(HappyAbsSyn44  happy_var_2) `HappyStk`
+	_ `HappyStk`
+	happyRest)
+	 = HappyAbsSyn38
+		 (at (happy_var_2,happy_var_5) $ mkIndexedDecl happy_var_2 happy_var_3 happy_var_5
+	) `HappyStk` happyRest
+
+happyReduce_91 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_91 = happyReduce 6 25 happyReduction_91
+happyReduction_91 ((HappyAbsSyn59  happy_var_6) `HappyStk`
+	_ `HappyStk`
+	_ `HappyStk`
+	(HappyAbsSyn44  happy_var_3) `HappyStk`
+	(HappyTerminal (Located happy_var_2 (Token (Sym ParenL  ) _))) `HappyStk`
+	_ `HappyStk`
+	happyRest)
+	 = HappyAbsSyn38
+		 (at (happy_var_2,happy_var_6) $ DPatBind (PVar happy_var_3) happy_var_6
+	) `HappyStk` happyRest
+
+happyReduce_92 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_92 = happyReduce 6 25 happyReduction_92
+happyReduction_92 ((HappyAbsSyn59  happy_var_6) `HappyStk`
+	_ `HappyStk`
+	(HappyAbsSyn88  happy_var_4) `HappyStk`
+	(HappyAbsSyn44  happy_var_3) `HappyStk`
+	(HappyAbsSyn88  happy_var_2) `HappyStk`
+	_ `HappyStk`
+	happyRest)
+	 = HappyAbsSyn38
+		 (at (happy_var_2,happy_var_6) $
+                             DBind $ Bind { bName      = happy_var_3
+                                          , bParams    = [happy_var_2,happy_var_4]
+                                          , bDef       = at happy_var_6 (Located emptyRange (DExpr happy_var_6))
+                                          , bSignature = Nothing
+                                          , bPragmas   = []
+                                          , bMono      = False
+                                          , bInfix     = True
+                                          , bFixity    = Nothing
+                                          , bDoc       = Nothing
+                                          , bExport    = Public
+                                          }
+	) `HappyStk` happyRest
+
+happyReduce_93 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_93 = happyReduce 4 25 happyReduction_93
+happyReduction_93 ((HappyAbsSyn94  happy_var_4) `HappyStk`
+	_ `HappyStk`
+	(HappyAbsSyn43  happy_var_2) `HappyStk`
+	_ `HappyStk`
+	happyRest)
+	 = HappyAbsSyn38
+		 (at (head happy_var_2,happy_var_4) $ DSignature (reverse happy_var_2) happy_var_4
+	) `HappyStk` happyRest
+
+happyReduce_94 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_94 = happyMonadReduce 4 25 happyReduction_94
+happyReduction_94 ((HappyAbsSyn103  happy_var_4) `HappyStk`
+	_ `HappyStk`
+	(HappyAbsSyn44  happy_var_2) `HappyStk`
+	(HappyTerminal (Located happy_var_1 (Token (KW KW_type   ) _))) `HappyStk`
+	happyRest) tk
+	 = happyThen ((( at (happy_var_1,happy_var_4) `fmap` mkTySyn happy_var_2 [] happy_var_4))
+	) (\r -> happyReturn (HappyAbsSyn38 r))
+
+happyReduce_95 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_95 = happyMonadReduce 5 25 happyReduction_95
+happyReduction_95 ((HappyAbsSyn103  happy_var_5) `HappyStk`
+	_ `HappyStk`
+	(HappyAbsSyn100  happy_var_3) `HappyStk`
+	(HappyAbsSyn44  happy_var_2) `HappyStk`
+	(HappyTerminal (Located happy_var_1 (Token (KW KW_type   ) _))) `HappyStk`
+	happyRest) tk
+	 = happyThen ((( at (happy_var_1,happy_var_5) `fmap` mkTySyn happy_var_2 (reverse happy_var_3) happy_var_5))
+	) (\r -> happyReturn (HappyAbsSyn38 r))
+
+happyReduce_96 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_96 = happyMonadReduce 6 25 happyReduction_96
+happyReduction_96 ((HappyAbsSyn103  happy_var_6) `HappyStk`
+	_ `HappyStk`
+	(HappyAbsSyn99  happy_var_4) `HappyStk`
+	(HappyAbsSyn44  happy_var_3) `HappyStk`
+	(HappyAbsSyn99  happy_var_2) `HappyStk`
+	(HappyTerminal (Located happy_var_1 (Token (KW KW_type   ) _))) `HappyStk`
+	happyRest) tk
+	 = happyThen ((( at (happy_var_1,happy_var_6) `fmap` mkTySyn happy_var_3 [happy_var_2, happy_var_4] happy_var_6))
+	) (\r -> happyReturn (HappyAbsSyn38 r))
+
+happyReduce_97 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_97 = happyMonadReduce 5 25 happyReduction_97
+happyReduction_97 ((HappyAbsSyn103  happy_var_5) `HappyStk`
+	_ `HappyStk`
+	(HappyAbsSyn44  happy_var_3) `HappyStk`
+	(HappyTerminal (Located happy_var_2 (Token (KW KW_constraint) _))) `HappyStk`
+	_ `HappyStk`
+	happyRest) tk
+	 = happyThen ((( at (happy_var_2,happy_var_5) `fmap` mkPropSyn happy_var_3 [] happy_var_5))
+	) (\r -> happyReturn (HappyAbsSyn38 r))
+
+happyReduce_98 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_98 = happyMonadReduce 6 25 happyReduction_98
+happyReduction_98 ((HappyAbsSyn103  happy_var_6) `HappyStk`
+	_ `HappyStk`
+	(HappyAbsSyn100  happy_var_4) `HappyStk`
+	(HappyAbsSyn44  happy_var_3) `HappyStk`
+	(HappyTerminal (Located happy_var_2 (Token (KW KW_constraint) _))) `HappyStk`
+	_ `HappyStk`
+	happyRest) tk
+	 = happyThen ((( at (happy_var_2,happy_var_6) `fmap` mkPropSyn happy_var_3 (reverse happy_var_4) happy_var_6))
+	) (\r -> happyReturn (HappyAbsSyn38 r))
+
+happyReduce_99 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_99 = happyMonadReduce 7 25 happyReduction_99
+happyReduction_99 ((HappyAbsSyn103  happy_var_7) `HappyStk`
+	_ `HappyStk`
+	(HappyAbsSyn99  happy_var_5) `HappyStk`
+	(HappyAbsSyn44  happy_var_4) `HappyStk`
+	(HappyAbsSyn99  happy_var_3) `HappyStk`
+	(HappyTerminal (Located happy_var_2 (Token (KW KW_constraint) _))) `HappyStk`
+	_ `HappyStk`
+	happyRest) tk
+	 = happyThen ((( at (happy_var_2,happy_var_7) `fmap` mkPropSyn happy_var_4 [happy_var_3, happy_var_5] happy_var_7))
+	) (\r -> happyReturn (HappyAbsSyn38 r))
+
+happyReduce_100 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_100 = happyMonadReduce 3 25 happyReduction_100
+happyReduction_100 ((HappyAbsSyn58  happy_var_3) `HappyStk`
+	(HappyTerminal (happy_var_2@(Located _ (Token (Num   {}) _)))) `HappyStk`
+	_ `HappyStk`
+	happyRest) tk
+	 = happyThen ((( mkFixity LeftAssoc  happy_var_2 (reverse happy_var_3)))
+	) (\r -> happyReturn (HappyAbsSyn38 r))
+
+happyReduce_101 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_101 = happyMonadReduce 3 25 happyReduction_101
+happyReduction_101 ((HappyAbsSyn58  happy_var_3) `HappyStk`
+	(HappyTerminal (happy_var_2@(Located _ (Token (Num   {}) _)))) `HappyStk`
+	_ `HappyStk`
+	happyRest) tk
+	 = happyThen ((( mkFixity RightAssoc happy_var_2 (reverse happy_var_3)))
+	) (\r -> happyReturn (HappyAbsSyn38 r))
+
+happyReduce_102 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_102 = happyMonadReduce 3 25 happyReduction_102
+happyReduction_102 ((HappyAbsSyn58  happy_var_3) `HappyStk`
+	(HappyTerminal (happy_var_2@(Located _ (Token (Num   {}) _)))) `HappyStk`
+	_ `HappyStk`
+	happyRest) tk
+	 = happyThen ((( mkFixity NonAssoc   happy_var_2 (reverse happy_var_3)))
+	) (\r -> happyReturn (HappyAbsSyn38 r))
+
+happyReduce_103 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_103 = happyReduce 4 26 happyReduction_103
+happyReduction_103 ((HappyAbsSyn42  happy_var_4) `HappyStk`
+	_ `HappyStk`
+	(HappyAbsSyn116  happy_var_2) `HappyStk`
+	_ `HappyStk`
+	happyRest)
+	 = HappyAbsSyn41
+		 (Newtype happy_var_2 [] (thing happy_var_4)
+	) `HappyStk` happyRest
+
+happyReduce_104 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_104 = happyReduce 5 26 happyReduction_104
+happyReduction_104 ((HappyAbsSyn42  happy_var_5) `HappyStk`
+	_ `HappyStk`
+	(HappyAbsSyn100  happy_var_3) `HappyStk`
+	(HappyAbsSyn116  happy_var_2) `HappyStk`
+	_ `HappyStk`
+	happyRest)
+	 = HappyAbsSyn41
+		 (Newtype happy_var_2 (reverse happy_var_3) (thing happy_var_5)
+	) `HappyStk` happyRest
+
+happyReduce_105 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_105 = happyMonadReduce 2 27 happyReduction_105
+happyReduction_105 ((HappyTerminal (Located happy_var_2 (Token (Sym CurlyR  ) _))) `HappyStk`
+	(HappyTerminal (Located happy_var_1 (Token (Sym CurlyL  ) _))) `HappyStk`
+	happyRest) tk
+	 = happyThen ((( mkRecord (rComb happy_var_1 happy_var_2) (Located emptyRange) []))
+	) (\r -> happyReturn (HappyAbsSyn42 r))
+
+happyReduce_106 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_106 = happyMonadReduce 3 27 happyReduction_106
+happyReduction_106 ((HappyTerminal (Located happy_var_3 (Token (Sym CurlyR  ) _))) `HappyStk`
+	(HappyAbsSyn111  happy_var_2) `HappyStk`
+	(HappyTerminal (Located happy_var_1 (Token (Sym CurlyL  ) _))) `HappyStk`
+	happyRest) tk
+	 = happyThen ((( mkRecord (rComb happy_var_1 happy_var_3) (Located emptyRange) happy_var_2))
+	) (\r -> happyReturn (HappyAbsSyn42 r))
+
+happyReduce_107 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_107 = happySpecReduce_1  28 happyReduction_107
+happyReduction_107 (HappyAbsSyn44  happy_var_1)
+	 =  HappyAbsSyn43
+		 ([ happy_var_1]
+	)
+happyReduction_107 _  = notHappyAtAll 
+
+happyReduce_108 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_108 = happySpecReduce_3  28 happyReduction_108
+happyReduction_108 (HappyAbsSyn44  happy_var_3)
+	_
+	(HappyAbsSyn43  happy_var_1)
+	 =  HappyAbsSyn43
+		 (happy_var_3 : happy_var_1
+	)
+happyReduction_108 _ _ _  = notHappyAtAll 
+
+happyReduce_109 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_109 = happySpecReduce_1  29 happyReduction_109
+happyReduction_109 (HappyAbsSyn44  happy_var_1)
+	 =  HappyAbsSyn44
+		 (happy_var_1
+	)
+happyReduction_109 _  = notHappyAtAll 
+
+happyReduce_110 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_110 = happySpecReduce_3  29 happyReduction_110
+happyReduction_110 _
+	(HappyAbsSyn44  happy_var_2)
+	_
+	 =  HappyAbsSyn44
+		 (happy_var_2
+	)
+happyReduction_110 _ _ _  = notHappyAtAll 
+
+happyReduce_111 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_111 = happySpecReduce_1  30 happyReduction_111
+happyReduction_111 (HappyAbsSyn88  happy_var_1)
+	 =  HappyAbsSyn45
+		 ([happy_var_1]
+	)
+happyReduction_111 _  = notHappyAtAll 
+
+happyReduce_112 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_112 = happySpecReduce_2  30 happyReduction_112
+happyReduction_112 (HappyAbsSyn88  happy_var_2)
+	(HappyAbsSyn45  happy_var_1)
+	 =  HappyAbsSyn45
+		 (happy_var_2 : happy_var_1
+	)
+happyReduction_112 _ _  = notHappyAtAll 
+
+happyReduce_113 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_113 = happySpecReduce_2  31 happyReduction_113
+happyReduction_113 (HappyAbsSyn45  happy_var_2)
+	_
+	 =  HappyAbsSyn45
+		 (happy_var_2
+	)
+happyReduction_113 _ _  = notHappyAtAll 
+
+happyReduce_114 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_114 = happySpecReduce_0  31 happyReduction_114
+happyReduction_114  =  HappyAbsSyn45
+		 ([]
+	)
+
+happyReduce_115 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_115 = happySpecReduce_1  32 happyReduction_115
+happyReduction_115 (HappyAbsSyn88  happy_var_1)
+	 =  HappyAbsSyn45
+		 ([happy_var_1]
+	)
+happyReduction_115 _  = notHappyAtAll 
+
+happyReduce_116 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_116 = happySpecReduce_3  32 happyReduction_116
+happyReduction_116 (HappyAbsSyn88  happy_var_3)
+	_
+	(HappyAbsSyn45  happy_var_1)
+	 =  HappyAbsSyn45
+		 (happy_var_3 : happy_var_1
+	)
+happyReduction_116 _ _ _  = notHappyAtAll 
+
+happyReduce_117 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_117 = happySpecReduce_2  33 happyReduction_117
+happyReduction_117 (HappyAbsSyn45  happy_var_2)
+	(HappyAbsSyn45  happy_var_1)
+	 =  HappyAbsSyn48
+		 ((happy_var_1, happy_var_2)
+	)
+happyReduction_117 _ _  = notHappyAtAll 
+
+happyReduce_118 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_118 = happySpecReduce_2  33 happyReduction_118
+happyReduction_118 (HappyAbsSyn45  happy_var_2)
+	_
+	 =  HappyAbsSyn48
+		 (([], happy_var_2)
+	)
+happyReduction_118 _ _  = notHappyAtAll 
+
+happyReduce_119 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_119 = happySpecReduce_0  34 happyReduction_119
+happyReduction_119  =  HappyAbsSyn48
+		 (([],[])
+	)
+
+happyReduce_120 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_120 = happySpecReduce_1  34 happyReduction_120
+happyReduction_120 (HappyAbsSyn48  happy_var_1)
+	 =  HappyAbsSyn48
+		 (happy_var_1
+	)
+happyReduction_120 _  = notHappyAtAll 
+
+happyReduce_121 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_121 = happySpecReduce_2  35 happyReduction_121
+happyReduction_121 _
+	(HappyAbsSyn38  happy_var_1)
+	 =  HappyAbsSyn39
+		 ([happy_var_1]
+	)
+happyReduction_121 _ _  = notHappyAtAll 
+
+happyReduce_122 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_122 = happySpecReduce_3  35 happyReduction_122
+happyReduction_122 _
+	(HappyAbsSyn38  happy_var_2)
+	(HappyAbsSyn39  happy_var_1)
+	 =  HappyAbsSyn39
+		 (happy_var_2 : happy_var_1
+	)
+happyReduction_122 _ _ _  = notHappyAtAll 
+
+happyReduce_123 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_123 = happySpecReduce_1  36 happyReduction_123
+happyReduction_123 (HappyAbsSyn38  happy_var_1)
+	 =  HappyAbsSyn39
+		 ([happy_var_1]
+	)
+happyReduction_123 _  = notHappyAtAll 
+
+happyReduce_124 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_124 = happySpecReduce_3  36 happyReduction_124
+happyReduction_124 (HappyAbsSyn38  happy_var_3)
+	_
+	(HappyAbsSyn39  happy_var_1)
+	 =  HappyAbsSyn39
+		 (happy_var_3 : happy_var_1
+	)
+happyReduction_124 _ _ _  = notHappyAtAll 
+
+happyReduce_125 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_125 = happySpecReduce_3  36 happyReduction_125
+happyReduction_125 (HappyAbsSyn38  happy_var_3)
+	_
+	(HappyAbsSyn39  happy_var_1)
+	 =  HappyAbsSyn39
+		 (happy_var_3 : happy_var_1
+	)
+happyReduction_125 _ _ _  = notHappyAtAll 
+
+happyReduce_126 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_126 = happySpecReduce_3  37 happyReduction_126
+happyReduction_126 _
+	(HappyAbsSyn39  happy_var_2)
+	_
+	 =  HappyAbsSyn39
+		 (happy_var_2
+	)
+happyReduction_126 _ _ _  = notHappyAtAll 
+
+happyReduce_127 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_127 = happySpecReduce_2  37 happyReduction_127
+happyReduction_127 _
+	_
+	 =  HappyAbsSyn39
+		 ([]
+	)
+
+happyReduce_128 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_128 = happySpecReduce_1  38 happyReduction_128
+happyReduction_128 (HappyAbsSyn59  happy_var_1)
+	 =  HappyAbsSyn53
+		 (ExprInput happy_var_1
+	)
+happyReduction_128 _  = notHappyAtAll 
+
+happyReduce_129 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_129 = happySpecReduce_1  38 happyReduction_129
+happyReduction_129 (HappyAbsSyn39  happy_var_1)
+	 =  HappyAbsSyn53
+		 (LetInput happy_var_1
+	)
+happyReduction_129 _  = notHappyAtAll 
+
+happyReduce_130 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_130 = happySpecReduce_0  38 happyReduction_130
+happyReduction_130  =  HappyAbsSyn53
+		 (EmptyInput
+	)
+
+happyReduce_131 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_131 = happySpecReduce_1  39 happyReduction_131
+happyReduction_131 (HappyAbsSyn44  happy_var_1)
+	 =  HappyAbsSyn44
+		 (happy_var_1
+	)
+happyReduction_131 _  = notHappyAtAll 
+
+happyReduce_132 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_132 = happySpecReduce_1  39 happyReduction_132
+happyReduction_132 (HappyTerminal (happy_var_1@(Located _ (Token (Op  Other{}   )  _))))
+	 =  HappyAbsSyn44
+		 (let Token (Op (Other ns i)) _ = thing happy_var_1
+                                       in mkQual (mkModName ns) (mkInfix i) A.<$ happy_var_1
+	)
+happyReduction_132 _  = notHappyAtAll 
+
+happyReduce_133 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_133 = happySpecReduce_1  40 happyReduction_133
+happyReduction_133 (HappyAbsSyn44  happy_var_1)
+	 =  HappyAbsSyn44
+		 (happy_var_1
+	)
+happyReduction_133 _  = notHappyAtAll 
+
+happyReduce_134 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_134 = happySpecReduce_1  40 happyReduction_134
+happyReduction_134 (HappyTerminal (Located happy_var_1 (Token (Op Hash) _)))
+	 =  HappyAbsSyn44
+		 (Located happy_var_1 $ mkUnqual $ mkInfix "#"
+	)
+happyReduction_134 _  = notHappyAtAll 
+
+happyReduce_135 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_135 = happySpecReduce_1  40 happyReduction_135
+happyReduction_135 (HappyTerminal (Located happy_var_1 (Token (Op At) _)))
+	 =  HappyAbsSyn44
+		 (Located happy_var_1 $ mkUnqual $ mkInfix "@"
+	)
+happyReduction_135 _  = notHappyAtAll 
+
+happyReduce_136 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_136 = happySpecReduce_1  41 happyReduction_136
+happyReduction_136 (HappyAbsSyn44  happy_var_1)
+	 =  HappyAbsSyn44
+		 (happy_var_1
+	)
+happyReduction_136 _  = notHappyAtAll 
+
+happyReduce_137 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_137 = happySpecReduce_1  41 happyReduction_137
+happyReduction_137 (HappyTerminal (Located happy_var_1 (Token (Op Mul)   _)))
+	 =  HappyAbsSyn44
+		 (Located happy_var_1 $ mkUnqual $ mkInfix "*"
+	)
+happyReduction_137 _  = notHappyAtAll 
+
+happyReduce_138 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_138 = happySpecReduce_1  41 happyReduction_138
+happyReduction_138 (HappyTerminal (Located happy_var_1 (Token (Op Plus)  _)))
+	 =  HappyAbsSyn44
+		 (Located happy_var_1 $ mkUnqual $ mkInfix "+"
+	)
+happyReduction_138 _  = notHappyAtAll 
+
+happyReduce_139 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_139 = happySpecReduce_1  41 happyReduction_139
+happyReduction_139 (HappyTerminal (Located happy_var_1 (Token (Op Minus) _)))
+	 =  HappyAbsSyn44
+		 (Located happy_var_1 $ mkUnqual $ mkInfix "-"
+	)
+happyReduction_139 _  = notHappyAtAll 
+
+happyReduce_140 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_140 = happySpecReduce_1  41 happyReduction_140
+happyReduction_140 (HappyTerminal (Located happy_var_1 (Token (Op Complement) _)))
+	 =  HappyAbsSyn44
+		 (Located happy_var_1 $ mkUnqual $ mkInfix "~"
+	)
+happyReduction_140 _  = notHappyAtAll 
+
+happyReduce_141 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_141 = happySpecReduce_1  41 happyReduction_141
+happyReduction_141 (HappyTerminal (Located happy_var_1 (Token (Op Exp)   _)))
+	 =  HappyAbsSyn44
+		 (Located happy_var_1 $ mkUnqual $ mkInfix "^^"
+	)
+happyReduction_141 _  = notHappyAtAll 
+
+happyReduce_142 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_142 = happySpecReduce_1  41 happyReduction_142
+happyReduction_142 (HappyTerminal (Located happy_var_1 (Token (Sym Lt      ) _)))
+	 =  HappyAbsSyn44
+		 (Located happy_var_1 $ mkUnqual $ mkInfix "<"
+	)
+happyReduction_142 _  = notHappyAtAll 
+
+happyReduce_143 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_143 = happySpecReduce_1  41 happyReduction_143
+happyReduction_143 (HappyTerminal (Located happy_var_1 (Token (Sym Gt      ) _)))
+	 =  HappyAbsSyn44
+		 (Located happy_var_1 $ mkUnqual $ mkInfix ">"
+	)
+happyReduction_143 _  = notHappyAtAll 
+
+happyReduce_144 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_144 = happySpecReduce_1  42 happyReduction_144
+happyReduction_144 (HappyTerminal (happy_var_1@(Located _ (Token (Op (Other [] _)) _))))
+	 =  HappyAbsSyn44
+		 (let Token (Op (Other [] str)) _ = thing happy_var_1
+                                       in mkUnqual (mkInfix str) A.<$ happy_var_1
+	)
+happyReduction_144 _  = notHappyAtAll 
+
+happyReduce_145 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_145 = happySpecReduce_1  43 happyReduction_145
+happyReduction_145 (HappyAbsSyn44  happy_var_1)
+	 =  HappyAbsSyn58
+		 ([happy_var_1]
+	)
+happyReduction_145 _  = notHappyAtAll 
+
+happyReduce_146 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_146 = happySpecReduce_3  43 happyReduction_146
+happyReduction_146 (HappyAbsSyn44  happy_var_3)
+	_
+	(HappyAbsSyn58  happy_var_1)
+	 =  HappyAbsSyn58
+		 (happy_var_3 : happy_var_1
+	)
+happyReduction_146 _ _ _  = notHappyAtAll 
+
+happyReduce_147 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_147 = happySpecReduce_1  44 happyReduction_147
+happyReduction_147 (HappyAbsSyn59  happy_var_1)
+	 =  HappyAbsSyn59
+		 (happy_var_1
+	)
+happyReduction_147 _  = notHappyAtAll 
+
+happyReduce_148 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_148 = happySpecReduce_3  44 happyReduction_148
+happyReduction_148 (HappyAbsSyn61  happy_var_3)
+	_
+	(HappyAbsSyn59  happy_var_1)
+	 =  HappyAbsSyn59
+		 (at (happy_var_1,happy_var_3) (EWhere happy_var_1 (thing happy_var_3))
+	)
+happyReduction_148 _ _ _  = notHappyAtAll 
+
+happyReduce_149 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_149 = happySpecReduce_3  45 happyReduction_149
+happyReduction_149 (HappyAbsSyn59  happy_var_3)
+	(HappyAbsSyn44  happy_var_2)
+	(HappyAbsSyn59  happy_var_1)
+	 =  HappyAbsSyn59
+		 (binOp happy_var_1 happy_var_2 happy_var_3
+	)
+happyReduction_149 _ _ _  = notHappyAtAll 
+
+happyReduce_150 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_150 = happySpecReduce_1  45 happyReduction_150
+happyReduction_150 (HappyAbsSyn59  happy_var_1)
+	 =  HappyAbsSyn59
+		 (happy_var_1
+	)
+happyReduction_150 _  = notHappyAtAll 
+
+happyReduce_151 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_151 = happySpecReduce_1  45 happyReduction_151
+happyReduction_151 (HappyAbsSyn59  happy_var_1)
+	 =  HappyAbsSyn59
+		 (happy_var_1
+	)
+happyReduction_151 _  = notHappyAtAll 
+
+happyReduce_152 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_152 = happySpecReduce_2  46 happyReduction_152
+happyReduction_152 (HappyTerminal (Located happy_var_2 (Token (Sym CurlyR  ) _)))
+	(HappyTerminal (Located happy_var_1 (Token (Sym CurlyL  ) _)))
+	 =  HappyAbsSyn61
+		 (Located (rComb happy_var_1 happy_var_2) []
+	)
+happyReduction_152 _ _  = notHappyAtAll 
+
+happyReduce_153 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_153 = happySpecReduce_3  46 happyReduction_153
+happyReduction_153 (HappyTerminal (Located happy_var_3 (Token (Sym CurlyR  ) _)))
+	(HappyAbsSyn39  happy_var_2)
+	(HappyTerminal (Located happy_var_1 (Token (Sym CurlyL  ) _)))
+	 =  HappyAbsSyn61
+		 (Located (rComb happy_var_1 happy_var_3) (reverse happy_var_2)
+	)
+happyReduction_153 _ _ _  = notHappyAtAll 
+
+happyReduce_154 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_154 = happySpecReduce_2  46 happyReduction_154
+happyReduction_154 (HappyTerminal (Located happy_var_2 (Token (Virt VCurlyR)  _)))
+	(HappyTerminal (Located happy_var_1 (Token (Virt VCurlyL)  _)))
+	 =  HappyAbsSyn61
+		 (Located (rComb happy_var_1 happy_var_2) []
+	)
+happyReduction_154 _ _  = notHappyAtAll 
+
+happyReduce_155 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_155 = happySpecReduce_3  46 happyReduction_155
+happyReduction_155 (HappyTerminal (Located happy_var_3 (Token (Virt VCurlyR)  _)))
+	(HappyAbsSyn39  happy_var_2)
+	(HappyTerminal (Located happy_var_1 (Token (Virt VCurlyL)  _)))
+	 =  HappyAbsSyn61
+		 (let l2 = fromMaybe happy_var_3 (getLoc happy_var_2)
+                                    in Located (rComb happy_var_1 l2) (reverse happy_var_2)
+	)
+happyReduction_155 _ _ _  = notHappyAtAll 
+
+happyReduce_156 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_156 = happySpecReduce_3  47 happyReduction_156
+happyReduction_156 (HappyAbsSyn103  happy_var_3)
+	_
+	(HappyAbsSyn59  happy_var_1)
+	 =  HappyAbsSyn59
+		 (at (happy_var_1,happy_var_3) (ETyped happy_var_1 happy_var_3)
+	)
+happyReduction_156 _ _ _  = notHappyAtAll 
+
+happyReduce_157 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_157 = happySpecReduce_3  48 happyReduction_157
+happyReduction_157 (HappyAbsSyn59  happy_var_3)
+	(HappyAbsSyn44  happy_var_2)
+	(HappyAbsSyn59  happy_var_1)
+	 =  HappyAbsSyn59
+		 (binOp happy_var_1 happy_var_2 happy_var_3
+	)
+happyReduction_157 _ _ _  = notHappyAtAll 
+
+happyReduce_158 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_158 = happySpecReduce_1  48 happyReduction_158
+happyReduction_158 (HappyAbsSyn59  happy_var_1)
+	 =  HappyAbsSyn59
+		 (happy_var_1
+	)
+happyReduction_158 _  = notHappyAtAll 
+
+happyReduce_159 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_159 = happyReduce 4 49 happyReduction_159
+happyReduction_159 ((HappyAbsSyn59  happy_var_4) `HappyStk`
+	_ `HappyStk`
+	(HappyAbsSyn65  happy_var_2) `HappyStk`
+	(HappyTerminal (Located happy_var_1 (Token (KW KW_if     ) _))) `HappyStk`
+	happyRest)
+	 = HappyAbsSyn59
+		 (at (happy_var_1,happy_var_4) $ mkIf (reverse happy_var_2) happy_var_4
+	) `HappyStk` happyRest
+
+happyReduce_160 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_160 = happyReduce 4 49 happyReduction_160
+happyReduction_160 ((HappyAbsSyn59  happy_var_4) `HappyStk`
+	_ `HappyStk`
+	(HappyAbsSyn45  happy_var_2) `HappyStk`
+	(HappyTerminal (Located happy_var_1 (Token (Sym Lambda  ) _))) `HappyStk`
+	happyRest)
+	 = HappyAbsSyn59
+		 (at (happy_var_1,happy_var_4) $ EFun emptyFunDesc (reverse happy_var_2) happy_var_4
+	) `HappyStk` happyRest
+
+happyReduce_161 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_161 = happySpecReduce_1  50 happyReduction_161
+happyReduction_161 (HappyAbsSyn66  happy_var_1)
+	 =  HappyAbsSyn65
+		 ([happy_var_1]
+	)
+happyReduction_161 _  = notHappyAtAll 
+
+happyReduce_162 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_162 = happySpecReduce_3  50 happyReduction_162
+happyReduction_162 (HappyAbsSyn66  happy_var_3)
+	_
+	(HappyAbsSyn65  happy_var_1)
+	 =  HappyAbsSyn65
+		 (happy_var_3 : happy_var_1
+	)
+happyReduction_162 _ _ _  = notHappyAtAll 
+
+happyReduce_163 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_163 = happySpecReduce_3  51 happyReduction_163
+happyReduction_163 (HappyAbsSyn59  happy_var_3)
+	_
+	(HappyAbsSyn59  happy_var_1)
+	 =  HappyAbsSyn66
+		 ((happy_var_1, happy_var_3)
+	)
+happyReduction_163 _ _ _  = notHappyAtAll 
+
+happyReduce_164 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_164 = happySpecReduce_2  52 happyReduction_164
+happyReduction_164 (HappyAbsSyn59  happy_var_2)
+	(HappyTerminal (Located happy_var_1 (Token (Op Minus) _)))
+	 =  HappyAbsSyn59
+		 (at (happy_var_1,happy_var_2) (ENeg happy_var_2)
+	)
+happyReduction_164 _ _  = notHappyAtAll 
+
+happyReduce_165 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_165 = happySpecReduce_2  52 happyReduction_165
+happyReduction_165 (HappyAbsSyn59  happy_var_2)
+	(HappyTerminal (Located happy_var_1 (Token (Op Complement) _)))
+	 =  HappyAbsSyn59
+		 (at (happy_var_1,happy_var_2) (EComplement happy_var_2)
+	)
+happyReduction_165 _ _  = notHappyAtAll 
+
+happyReduce_166 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_166 = happySpecReduce_1  52 happyReduction_166
+happyReduction_166 (HappyAbsSyn59  happy_var_1)
+	 =  HappyAbsSyn59
+		 (happy_var_1
+	)
+happyReduction_166 _  = notHappyAtAll 
+
+happyReduce_167 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_167 = happySpecReduce_2  53 happyReduction_167
+happyReduction_167 (HappyAbsSyn59  happy_var_2)
+	(HappyTerminal (Located happy_var_1 (Token (Op Minus) _)))
+	 =  HappyAbsSyn59
+		 (at (happy_var_1,happy_var_2) (ENeg happy_var_2)
+	)
+happyReduction_167 _ _  = notHappyAtAll 
+
+happyReduce_168 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_168 = happySpecReduce_2  53 happyReduction_168
+happyReduction_168 (HappyAbsSyn59  happy_var_2)
+	(HappyTerminal (Located happy_var_1 (Token (Op Complement) _)))
+	 =  HappyAbsSyn59
+		 (at (happy_var_1,happy_var_2) (EComplement happy_var_2)
+	)
+happyReduction_168 _ _  = notHappyAtAll 
+
+happyReduce_169 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_169 = happySpecReduce_1  53 happyReduction_169
+happyReduction_169 (HappyAbsSyn59  happy_var_1)
+	 =  HappyAbsSyn59
+		 (happy_var_1
+	)
+happyReduction_169 _  = notHappyAtAll 
+
+happyReduce_170 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_170 = happyMonadReduce 1 54 happyReduction_170
+happyReduction_170 ((HappyAbsSyn71  happy_var_1) `HappyStk`
+	happyRest) tk
+	 = happyThen ((( mkEApp happy_var_1))
+	) (\r -> happyReturn (HappyAbsSyn59 r))
+
+happyReduce_171 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_171 = happySpecReduce_2  55 happyReduction_171
+happyReduction_171 (HappyAbsSyn59  happy_var_2)
+	(HappyAbsSyn59  happy_var_1)
+	 =  HappyAbsSyn59
+		 (at (happy_var_1,happy_var_2) (EApp happy_var_1 happy_var_2)
+	)
+happyReduction_171 _ _  = notHappyAtAll 
+
+happyReduce_172 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_172 = happySpecReduce_1  55 happyReduction_172
+happyReduction_172 (HappyAbsSyn59  happy_var_1)
+	 =  HappyAbsSyn59
+		 (happy_var_1
+	)
+happyReduction_172 _  = notHappyAtAll 
+
+happyReduce_173 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_173 = happySpecReduce_1  55 happyReduction_173
+happyReduction_173 (HappyAbsSyn59  happy_var_1)
+	 =  HappyAbsSyn59
+		 (happy_var_1
+	)
+happyReduction_173 _  = notHappyAtAll 
+
+happyReduce_174 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_174 = happySpecReduce_1  56 happyReduction_174
+happyReduction_174 (HappyAbsSyn59  happy_var_1)
+	 =  HappyAbsSyn71
+		 (happy_var_1 :| []
+	)
+happyReduction_174 _  = notHappyAtAll 
+
+happyReduce_175 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_175 = happySpecReduce_2  56 happyReduction_175
+happyReduction_175 (HappyAbsSyn59  happy_var_2)
+	(HappyAbsSyn71  happy_var_1)
+	 =  HappyAbsSyn71
+		 (cons happy_var_2 happy_var_1
+	)
+happyReduction_175 _ _  = notHappyAtAll 
+
+happyReduce_176 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_176 = happySpecReduce_1  57 happyReduction_176
+happyReduction_176 (HappyAbsSyn59  happy_var_1)
+	 =  HappyAbsSyn59
+		 (happy_var_1
+	)
+happyReduction_176 _  = notHappyAtAll 
+
+happyReduce_177 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_177 = happySpecReduce_1  57 happyReduction_177
+happyReduction_177 (HappyAbsSyn59  happy_var_1)
+	 =  HappyAbsSyn59
+		 (happy_var_1
+	)
+happyReduction_177 _  = notHappyAtAll 
+
+happyReduce_178 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_178 = happySpecReduce_1  58 happyReduction_178
+happyReduction_178 (HappyAbsSyn116  happy_var_1)
+	 =  HappyAbsSyn59
+		 (at happy_var_1 $ EVar (thing happy_var_1)
+	)
+happyReduction_178 _  = notHappyAtAll 
+
+happyReduce_179 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_179 = happySpecReduce_1  58 happyReduction_179
+happyReduction_179 (HappyTerminal (happy_var_1@(Located _ (Token (Num   {}) _))))
+	 =  HappyAbsSyn59
+		 (at happy_var_1 $ numLit (thing happy_var_1)
+	)
+happyReduction_179 _  = notHappyAtAll 
+
+happyReduce_180 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_180 = happySpecReduce_1  58 happyReduction_180
+happyReduction_180 (HappyTerminal (happy_var_1@(Located _ (Token (Frac  {}) _))))
+	 =  HappyAbsSyn59
+		 (at happy_var_1 $ fracLit (thing happy_var_1)
+	)
+happyReduction_180 _  = notHappyAtAll 
+
+happyReduce_181 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_181 = happySpecReduce_1  58 happyReduction_181
+happyReduction_181 (HappyTerminal (happy_var_1@(Located _ (Token (StrLit {}) _))))
+	 =  HappyAbsSyn59
+		 (at happy_var_1 $ ELit $ ECString $ getStr happy_var_1
+	)
+happyReduction_181 _  = notHappyAtAll 
+
+happyReduce_182 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_182 = happySpecReduce_1  58 happyReduction_182
+happyReduction_182 (HappyTerminal (happy_var_1@(Located _ (Token (ChrLit {}) _))))
+	 =  HappyAbsSyn59
+		 (at happy_var_1 $ ELit $ ECChar $ getChr happy_var_1
+	)
+happyReduction_182 _  = notHappyAtAll 
+
+happyReduce_183 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_183 = happySpecReduce_1  58 happyReduction_183
+happyReduction_183 (HappyTerminal (Located happy_var_1 (Token (Sym Underscore ) _)))
+	 =  HappyAbsSyn59
+		 (at happy_var_1 $ EVar $ mkUnqual $ mkIdent "_"
+	)
+happyReduction_183 _  = notHappyAtAll 
+
+happyReduce_184 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_184 = happySpecReduce_3  58 happyReduction_184
+happyReduction_184 (HappyTerminal (Located happy_var_3 (Token (Sym ParenR  ) _)))
+	(HappyAbsSyn59  happy_var_2)
+	(HappyTerminal (Located happy_var_1 (Token (Sym ParenL  ) _)))
+	 =  HappyAbsSyn59
+		 (at (happy_var_1,happy_var_3) $ EParens happy_var_2
+	)
+happyReduction_184 _ _ _  = notHappyAtAll 
+
+happyReduce_185 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_185 = happySpecReduce_3  58 happyReduction_185
+happyReduction_185 (HappyTerminal (Located happy_var_3 (Token (Sym ParenR  ) _)))
+	(HappyAbsSyn78  happy_var_2)
+	(HappyTerminal (Located happy_var_1 (Token (Sym ParenL  ) _)))
+	 =  HappyAbsSyn59
+		 (at (happy_var_1,happy_var_3) $ ETuple (reverse happy_var_2)
+	)
+happyReduction_185 _ _ _  = notHappyAtAll 
+
+happyReduce_186 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_186 = happySpecReduce_2  58 happyReduction_186
+happyReduction_186 (HappyTerminal (Located happy_var_2 (Token (Sym ParenR  ) _)))
+	(HappyTerminal (Located happy_var_1 (Token (Sym ParenL  ) _)))
+	 =  HappyAbsSyn59
+		 (at (happy_var_1,happy_var_2) $ ETuple []
+	)
+happyReduction_186 _ _  = notHappyAtAll 
+
+happyReduce_187 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_187 = happyMonadReduce 2 58 happyReduction_187
+happyReduction_187 ((HappyTerminal (Located happy_var_2 (Token (Sym CurlyR  ) _))) `HappyStk`
+	(HappyTerminal (Located happy_var_1 (Token (Sym CurlyL  ) _))) `HappyStk`
+	happyRest) tk
+	 = happyThen ((( mkRecord (rComb happy_var_1 happy_var_2) ERecord []))
+	) (\r -> happyReturn (HappyAbsSyn59 r))
+
+happyReduce_188 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_188 = happyMonadReduce 3 58 happyReduction_188
+happyReduction_188 ((HappyTerminal (Located happy_var_3 (Token (Sym CurlyR  ) _))) `HappyStk`
+	(HappyAbsSyn79  happy_var_2) `HappyStk`
+	(HappyTerminal (Located happy_var_1 (Token (Sym CurlyL  ) _))) `HappyStk`
+	happyRest) tk
+	 = happyThen ((( case happy_var_2 of {
+                                       Left upd -> pure $ at (happy_var_1,happy_var_3) upd;
+                                       Right fs -> mkRecord (rComb happy_var_1 happy_var_3) ERecord fs; }))
+	) (\r -> happyReturn (HappyAbsSyn59 r))
+
+happyReduce_189 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_189 = happySpecReduce_2  58 happyReduction_189
+happyReduction_189 (HappyTerminal (Located happy_var_2 (Token (Sym BracketR) _)))
+	(HappyTerminal (Located happy_var_1 (Token (Sym BracketL) _)))
+	 =  HappyAbsSyn59
+		 (at (happy_var_1,happy_var_2) $ EList []
+	)
+happyReduction_189 _ _  = notHappyAtAll 
+
+happyReduce_190 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_190 = happySpecReduce_3  58 happyReduction_190
+happyReduction_190 (HappyTerminal (Located happy_var_3 (Token (Sym BracketR) _)))
+	(HappyAbsSyn59  happy_var_2)
+	(HappyTerminal (Located happy_var_1 (Token (Sym BracketL) _)))
+	 =  HappyAbsSyn59
+		 (at (happy_var_1,happy_var_3) happy_var_2
+	)
+happyReduction_190 _ _ _  = notHappyAtAll 
+
+happyReduce_191 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_191 = happySpecReduce_2  58 happyReduction_191
+happyReduction_191 (HappyAbsSyn103  happy_var_2)
+	(HappyTerminal (Located happy_var_1 (Token (Sym BackTick) _)))
+	 =  HappyAbsSyn59
+		 (at (happy_var_1,happy_var_2) $ ETypeVal happy_var_2
+	)
+happyReduction_191 _ _  = notHappyAtAll 
+
+happyReduce_192 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_192 = happySpecReduce_3  58 happyReduction_192
+happyReduction_192 (HappyTerminal (Located happy_var_3 (Token (Sym ParenR  ) _)))
+	(HappyAbsSyn44  happy_var_2)
+	(HappyTerminal (Located happy_var_1 (Token (Sym ParenL  ) _)))
+	 =  HappyAbsSyn59
+		 (at (happy_var_1,happy_var_3) $ EVar $ thing happy_var_2
+	)
+happyReduction_192 _ _ _  = notHappyAtAll 
+
+happyReduce_193 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_193 = happyMonadReduce 2 58 happyReduction_193
+happyReduction_193 ((HappyTerminal (Located happy_var_2 (Token (Sym TriR    ) _))) `HappyStk`
+	(HappyTerminal (Located happy_var_1 (Token (Sym TriL    ) _))) `HappyStk`
+	happyRest) tk
+	 = happyThen ((( mkPoly (rComb happy_var_1 happy_var_2) []))
+	) (\r -> happyReturn (HappyAbsSyn59 r))
+
+happyReduce_194 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_194 = happyMonadReduce 3 58 happyReduction_194
+happyReduction_194 ((HappyTerminal (Located happy_var_3 (Token (Sym TriR    ) _))) `HappyStk`
+	(HappyAbsSyn76  happy_var_2) `HappyStk`
+	(HappyTerminal (Located happy_var_1 (Token (Sym TriL    ) _))) `HappyStk`
+	happyRest) tk
+	 = happyThen ((( mkPoly (rComb happy_var_1 happy_var_3) happy_var_2))
+	) (\r -> happyReturn (HappyAbsSyn59 r))
+
+happyReduce_195 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_195 = happySpecReduce_2  59 happyReduction_195
+happyReduction_195 (HappyAbsSyn75  happy_var_2)
+	(HappyAbsSyn59  happy_var_1)
+	 =  HappyAbsSyn59
+		 (at (happy_var_1,happy_var_2) $ ESel happy_var_1 (thing happy_var_2)
+	)
+happyReduction_195 _ _  = notHappyAtAll 
+
+happyReduce_196 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_196 = happySpecReduce_2  59 happyReduction_196
+happyReduction_196 (HappyAbsSyn75  happy_var_2)
+	(HappyAbsSyn59  happy_var_1)
+	 =  HappyAbsSyn59
+		 (at (happy_var_1,happy_var_2) $ ESel happy_var_1 (thing happy_var_2)
+	)
+happyReduction_196 _ _  = notHappyAtAll 
+
+happyReduce_197 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_197 = happySpecReduce_1  60 happyReduction_197
+happyReduction_197 (HappyTerminal (happy_var_1@(Located _ (Token  (Selector _) _))))
+	 =  HappyAbsSyn75
+		 (mkSelector `fmap` happy_var_1
+	)
+happyReduction_197 _  = notHappyAtAll 
+
+happyReduce_198 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_198 = happySpecReduce_1  61 happyReduction_198
+happyReduction_198 (HappyAbsSyn77  happy_var_1)
+	 =  HappyAbsSyn76
+		 ([happy_var_1]
+	)
+happyReduction_198 _  = notHappyAtAll 
+
+happyReduce_199 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_199 = happySpecReduce_3  61 happyReduction_199
+happyReduction_199 (HappyAbsSyn77  happy_var_3)
+	_
+	(HappyAbsSyn76  happy_var_1)
+	 =  HappyAbsSyn76
+		 (happy_var_3 : happy_var_1
+	)
+happyReduction_199 _ _ _  = notHappyAtAll 
+
+happyReduce_200 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_200 = happyMonadReduce 1 62 happyReduction_200
+happyReduction_200 ((HappyTerminal (happy_var_1@(Located _ (Token (Num   {}) _)))) `HappyStk`
+	happyRest) tk
+	 = happyThen ((( polyTerm (srcRange happy_var_1) (getNum happy_var_1) 0))
+	) (\r -> happyReturn (HappyAbsSyn77 r))
+
+happyReduce_201 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_201 = happyMonadReduce 1 62 happyReduction_201
+happyReduction_201 ((HappyTerminal (Located happy_var_1 (Token (KW KW_x)       _))) `HappyStk`
+	happyRest) tk
+	 = happyThen ((( polyTerm happy_var_1 1 1))
+	) (\r -> happyReturn (HappyAbsSyn77 r))
+
+happyReduce_202 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_202 = happyMonadReduce 3 62 happyReduction_202
+happyReduction_202 ((HappyTerminal (happy_var_3@(Located _ (Token (Num   {}) _)))) `HappyStk`
+	_ `HappyStk`
+	(HappyTerminal (Located happy_var_1 (Token (KW KW_x)       _))) `HappyStk`
+	happyRest) tk
+	 = happyThen ((( polyTerm (rComb happy_var_1 (srcRange happy_var_3))
+                                                            1 (getNum happy_var_3)))
+	) (\r -> happyReturn (HappyAbsSyn77 r))
+
+happyReduce_203 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_203 = happySpecReduce_3  63 happyReduction_203
+happyReduction_203 (HappyAbsSyn59  happy_var_3)
+	_
+	(HappyAbsSyn59  happy_var_1)
+	 =  HappyAbsSyn78
+		 ([ happy_var_3, happy_var_1]
+	)
+happyReduction_203 _ _ _  = notHappyAtAll 
+
+happyReduce_204 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_204 = happySpecReduce_3  63 happyReduction_204
+happyReduction_204 (HappyAbsSyn59  happy_var_3)
+	_
+	(HappyAbsSyn78  happy_var_1)
+	 =  HappyAbsSyn78
+		 (happy_var_3 : happy_var_1
+	)
+happyReduction_204 _ _ _  = notHappyAtAll 
+
+happyReduce_205 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_205 = happySpecReduce_3  64 happyReduction_205
+happyReduction_205 (HappyAbsSyn80  happy_var_3)
+	_
+	(HappyAbsSyn59  happy_var_1)
+	 =  HappyAbsSyn79
+		 (Left (EUpd (Just happy_var_1) (reverse happy_var_3))
+	)
+happyReduction_205 _ _ _  = notHappyAtAll 
+
+happyReduce_206 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_206 = happySpecReduce_3  64 happyReduction_206
+happyReduction_206 (HappyAbsSyn80  happy_var_3)
+	_
+	_
+	 =  HappyAbsSyn79
+		 (Left (EUpd Nothing   (reverse happy_var_3))
+	)
+happyReduction_206 _ _ _  = notHappyAtAll 
+
+happyReduce_207 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_207 = happyMonadReduce 1 64 happyReduction_207
+happyReduction_207 ((HappyAbsSyn80  happy_var_1) `HappyStk`
+	happyRest) tk
+	 = happyThen ((( Right `fmap` mapM ufToNamed happy_var_1))
+	) (\r -> happyReturn (HappyAbsSyn79 r))
+
+happyReduce_208 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_208 = happySpecReduce_1  65 happyReduction_208
+happyReduction_208 (HappyAbsSyn81  happy_var_1)
+	 =  HappyAbsSyn80
+		 ([happy_var_1]
+	)
+happyReduction_208 _  = notHappyAtAll 
+
+happyReduce_209 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_209 = happySpecReduce_3  65 happyReduction_209
+happyReduction_209 (HappyAbsSyn81  happy_var_3)
+	_
+	(HappyAbsSyn80  happy_var_1)
+	 =  HappyAbsSyn80
+		 (happy_var_3 : happy_var_1
+	)
+happyReduction_209 _ _ _  = notHappyAtAll 
+
+happyReduce_210 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_210 = happyReduce 4 66 happyReduction_210
+happyReduction_210 ((HappyAbsSyn59  happy_var_4) `HappyStk`
+	(HappyAbsSyn83  happy_var_3) `HappyStk`
+	(HappyAbsSyn48  happy_var_2) `HappyStk`
+	(HappyAbsSyn82  happy_var_1) `HappyStk`
+	happyRest)
+	 = HappyAbsSyn81
+		 (UpdField happy_var_3 happy_var_1 (mkIndexedExpr happy_var_2 happy_var_4)
+	) `HappyStk` happyRest
+
+happyReduce_211 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_211 = happyMonadReduce 1 67 happyReduction_211
+happyReduction_211 ((HappyAbsSyn59  happy_var_1) `HappyStk`
+	happyRest) tk
+	 = happyThen ((( exprToFieldPath happy_var_1))
+	) (\r -> happyReturn (HappyAbsSyn82 r))
+
+happyReduce_212 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_212 = happySpecReduce_1  68 happyReduction_212
+happyReduction_212 _
+	 =  HappyAbsSyn83
+		 (UpdSet
+	)
+
+happyReduce_213 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_213 = happySpecReduce_1  68 happyReduction_213
+happyReduction_213 _
+	 =  HappyAbsSyn83
+		 (UpdFun
+	)
+
+happyReduce_214 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_214 = happySpecReduce_3  69 happyReduction_214
+happyReduction_214 (HappyAbsSyn85  happy_var_3)
+	_
+	(HappyAbsSyn59  happy_var_1)
+	 =  HappyAbsSyn59
+		 (EComp happy_var_1 (reverse happy_var_3)
+	)
+happyReduction_214 _ _ _  = notHappyAtAll 
+
+happyReduce_215 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_215 = happySpecReduce_1  69 happyReduction_215
+happyReduction_215 (HappyAbsSyn59  happy_var_1)
+	 =  HappyAbsSyn59
+		 (EList [happy_var_1]
+	)
+happyReduction_215 _  = notHappyAtAll 
+
+happyReduce_216 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_216 = happySpecReduce_1  69 happyReduction_216
+happyReduction_216 (HappyAbsSyn78  happy_var_1)
+	 =  HappyAbsSyn59
+		 (EList (reverse happy_var_1)
+	)
+happyReduction_216 _  = notHappyAtAll 
+
+happyReduce_217 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_217 = happyMonadReduce 3 69 happyReduction_217
+happyReduction_217 ((HappyAbsSyn59  happy_var_3) `HappyStk`
+	(HappyTerminal (Located happy_var_2 (Token (Sym DotDot  ) _))) `HappyStk`
+	(HappyAbsSyn59  happy_var_1) `HappyStk`
+	happyRest) tk
+	 = happyThen ((( eFromTo happy_var_2 happy_var_1 Nothing   happy_var_3))
+	) (\r -> happyReturn (HappyAbsSyn59 r))
+
+happyReduce_218 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_218 = happyMonadReduce 5 69 happyReduction_218
+happyReduction_218 ((HappyAbsSyn59  happy_var_5) `HappyStk`
+	(HappyTerminal (Located happy_var_4 (Token (Sym DotDot  ) _))) `HappyStk`
+	(HappyAbsSyn59  happy_var_3) `HappyStk`
+	_ `HappyStk`
+	(HappyAbsSyn59  happy_var_1) `HappyStk`
+	happyRest) tk
+	 = happyThen ((( eFromTo happy_var_4 happy_var_1 (Just happy_var_3) happy_var_5))
+	) (\r -> happyReturn (HappyAbsSyn59 r))
+
+happyReduce_219 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_219 = happyMonadReduce 4 69 happyReduction_219
+happyReduction_219 ((HappyAbsSyn59  happy_var_4) `HappyStk`
+	_ `HappyStk`
+	(HappyTerminal (Located happy_var_2 (Token (Sym DotDot  ) _))) `HappyStk`
+	(HappyAbsSyn59  happy_var_1) `HappyStk`
+	happyRest) tk
+	 = happyThen ((( eFromToLessThan happy_var_2 happy_var_1 happy_var_4))
+	) (\r -> happyReturn (HappyAbsSyn59 r))
+
+happyReduce_220 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_220 = happyMonadReduce 3 69 happyReduction_220
+happyReduction_220 ((HappyAbsSyn59  happy_var_3) `HappyStk`
+	(HappyTerminal (Located happy_var_2 (Token (Sym DotDotLt) _))) `HappyStk`
+	(HappyAbsSyn59  happy_var_1) `HappyStk`
+	happyRest) tk
+	 = happyThen ((( eFromToLessThan happy_var_2 happy_var_1 happy_var_3))
+	) (\r -> happyReturn (HappyAbsSyn59 r))
+
+happyReduce_221 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_221 = happyMonadReduce 5 69 happyReduction_221
+happyReduction_221 ((HappyAbsSyn59  happy_var_5) `HappyStk`
+	_ `HappyStk`
+	(HappyAbsSyn59  happy_var_3) `HappyStk`
+	(HappyTerminal (Located happy_var_2 (Token (Sym DotDot  ) _))) `HappyStk`
+	(HappyAbsSyn59  happy_var_1) `HappyStk`
+	happyRest) tk
+	 = happyThen ((( eFromToBy happy_var_2 happy_var_1 happy_var_3 happy_var_5 False))
+	) (\r -> happyReturn (HappyAbsSyn59 r))
+
+happyReduce_222 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_222 = happyMonadReduce 6 69 happyReduction_222
+happyReduction_222 ((HappyAbsSyn59  happy_var_6) `HappyStk`
+	_ `HappyStk`
+	(HappyAbsSyn59  happy_var_4) `HappyStk`
+	_ `HappyStk`
+	(HappyTerminal (Located happy_var_2 (Token (Sym DotDot  ) _))) `HappyStk`
+	(HappyAbsSyn59  happy_var_1) `HappyStk`
+	happyRest) tk
+	 = happyThen ((( eFromToBy happy_var_2 happy_var_1 happy_var_4 happy_var_6 True))
+	) (\r -> happyReturn (HappyAbsSyn59 r))
+
+happyReduce_223 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_223 = happyMonadReduce 5 69 happyReduction_223
+happyReduction_223 ((HappyAbsSyn59  happy_var_5) `HappyStk`
+	_ `HappyStk`
+	(HappyAbsSyn59  happy_var_3) `HappyStk`
+	(HappyTerminal (Located happy_var_2 (Token (Sym DotDotLt) _))) `HappyStk`
+	(HappyAbsSyn59  happy_var_1) `HappyStk`
+	happyRest) tk
+	 = happyThen ((( eFromToBy happy_var_2 happy_var_1 happy_var_3 happy_var_5 True))
+	) (\r -> happyReturn (HappyAbsSyn59 r))
+
+happyReduce_224 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_224 = happyMonadReduce 6 69 happyReduction_224
+happyReduction_224 ((HappyAbsSyn59  happy_var_6) `HappyStk`
+	_ `HappyStk`
+	_ `HappyStk`
+	(HappyAbsSyn59  happy_var_3) `HappyStk`
+	(HappyTerminal (Located happy_var_2 (Token (Sym DotDot  ) _))) `HappyStk`
+	(HappyAbsSyn59  happy_var_1) `HappyStk`
+	happyRest) tk
+	 = happyThen ((( eFromToDownBy happy_var_2 happy_var_1 happy_var_3 happy_var_6 False))
+	) (\r -> happyReturn (HappyAbsSyn59 r))
+
+happyReduce_225 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_225 = happyMonadReduce 7 69 happyReduction_225
+happyReduction_225 ((HappyAbsSyn59  happy_var_7) `HappyStk`
+	_ `HappyStk`
+	_ `HappyStk`
+	(HappyAbsSyn59  happy_var_4) `HappyStk`
+	_ `HappyStk`
+	(HappyTerminal (Located happy_var_2 (Token (Sym DotDot  ) _))) `HappyStk`
+	(HappyAbsSyn59  happy_var_1) `HappyStk`
+	happyRest) tk
+	 = happyThen ((( eFromToDownBy happy_var_2 happy_var_1 happy_var_4 happy_var_7 True))
+	) (\r -> happyReturn (HappyAbsSyn59 r))
+
+happyReduce_226 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_226 = happyMonadReduce 6 69 happyReduction_226
+happyReduction_226 ((HappyAbsSyn59  happy_var_6) `HappyStk`
+	_ `HappyStk`
+	_ `HappyStk`
+	(HappyAbsSyn59  happy_var_3) `HappyStk`
+	(HappyTerminal (Located happy_var_2 (Token (Sym DotDotGt) _))) `HappyStk`
+	(HappyAbsSyn59  happy_var_1) `HappyStk`
+	happyRest) tk
+	 = happyThen ((( eFromToDownBy happy_var_2 happy_var_1 happy_var_3 happy_var_6 True))
+	) (\r -> happyReturn (HappyAbsSyn59 r))
+
+happyReduce_227 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_227 = happySpecReduce_2  69 happyReduction_227
+happyReduction_227 _
+	(HappyAbsSyn59  happy_var_1)
+	 =  HappyAbsSyn59
+		 (EInfFrom happy_var_1 Nothing
+	)
+happyReduction_227 _ _  = notHappyAtAll 
+
+happyReduce_228 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_228 = happyReduce 4 69 happyReduction_228
+happyReduction_228 (_ `HappyStk`
+	(HappyAbsSyn59  happy_var_3) `HappyStk`
+	_ `HappyStk`
+	(HappyAbsSyn59  happy_var_1) `HappyStk`
+	happyRest)
+	 = HappyAbsSyn59
+		 (EInfFrom happy_var_1 (Just happy_var_3)
+	) `HappyStk` happyRest
+
+happyReduce_229 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_229 = happySpecReduce_1  70 happyReduction_229
+happyReduction_229 (HappyAbsSyn86  happy_var_1)
+	 =  HappyAbsSyn85
+		 ([ reverse happy_var_1 ]
+	)
+happyReduction_229 _  = notHappyAtAll 
+
+happyReduce_230 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_230 = happySpecReduce_3  70 happyReduction_230
+happyReduction_230 (HappyAbsSyn86  happy_var_3)
+	_
+	(HappyAbsSyn85  happy_var_1)
+	 =  HappyAbsSyn85
+		 (reverse happy_var_3 : happy_var_1
+	)
+happyReduction_230 _ _ _  = notHappyAtAll 
+
+happyReduce_231 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_231 = happySpecReduce_1  71 happyReduction_231
+happyReduction_231 (HappyAbsSyn87  happy_var_1)
+	 =  HappyAbsSyn86
+		 ([happy_var_1]
+	)
+happyReduction_231 _  = notHappyAtAll 
+
+happyReduce_232 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_232 = happySpecReduce_3  71 happyReduction_232
+happyReduction_232 (HappyAbsSyn87  happy_var_3)
+	_
+	(HappyAbsSyn86  happy_var_1)
+	 =  HappyAbsSyn86
+		 (happy_var_3 : happy_var_1
+	)
+happyReduction_232 _ _ _  = notHappyAtAll 
+
+happyReduce_233 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_233 = happySpecReduce_3  72 happyReduction_233
+happyReduction_233 (HappyAbsSyn59  happy_var_3)
+	_
+	(HappyAbsSyn88  happy_var_1)
+	 =  HappyAbsSyn87
+		 (Match happy_var_1 happy_var_3
+	)
+happyReduction_233 _ _ _  = notHappyAtAll 
+
+happyReduce_234 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_234 = happySpecReduce_3  73 happyReduction_234
+happyReduction_234 (HappyAbsSyn103  happy_var_3)
+	_
+	(HappyAbsSyn88  happy_var_1)
+	 =  HappyAbsSyn88
+		 (at (happy_var_1,happy_var_3) $ PTyped happy_var_1 happy_var_3
+	)
+happyReduction_234 _ _ _  = notHappyAtAll 
+
+happyReduce_235 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_235 = happySpecReduce_1  73 happyReduction_235
+happyReduction_235 (HappyAbsSyn88  happy_var_1)
+	 =  HappyAbsSyn88
+		 (happy_var_1
+	)
+happyReduction_235 _  = notHappyAtAll 
+
+happyReduce_236 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_236 = happySpecReduce_3  74 happyReduction_236
+happyReduction_236 (HappyAbsSyn88  happy_var_3)
+	_
+	(HappyAbsSyn88  happy_var_1)
+	 =  HappyAbsSyn88
+		 (at (happy_var_1,happy_var_3) $ PSplit happy_var_1 happy_var_3
+	)
+happyReduction_236 _ _ _  = notHappyAtAll 
+
+happyReduce_237 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_237 = happySpecReduce_1  74 happyReduction_237
+happyReduction_237 (HappyAbsSyn88  happy_var_1)
+	 =  HappyAbsSyn88
+		 (happy_var_1
+	)
+happyReduction_237 _  = notHappyAtAll 
+
+happyReduce_238 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_238 = happySpecReduce_1  75 happyReduction_238
+happyReduction_238 (HappyAbsSyn44  happy_var_1)
+	 =  HappyAbsSyn88
+		 (PVar happy_var_1
+	)
+happyReduction_238 _  = notHappyAtAll 
+
+happyReduce_239 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_239 = happySpecReduce_1  75 happyReduction_239
+happyReduction_239 (HappyTerminal (Located happy_var_1 (Token (Sym Underscore ) _)))
+	 =  HappyAbsSyn88
+		 (at happy_var_1       $ PWild
+	)
+happyReduction_239 _  = notHappyAtAll 
+
+happyReduce_240 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_240 = happySpecReduce_2  75 happyReduction_240
+happyReduction_240 (HappyTerminal (Located happy_var_2 (Token (Sym ParenR  ) _)))
+	(HappyTerminal (Located happy_var_1 (Token (Sym ParenL  ) _)))
+	 =  HappyAbsSyn88
+		 (at (happy_var_1,happy_var_2) $ PTuple []
+	)
+happyReduction_240 _ _  = notHappyAtAll 
+
+happyReduce_241 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_241 = happySpecReduce_3  75 happyReduction_241
+happyReduction_241 (HappyTerminal (Located happy_var_3 (Token (Sym ParenR  ) _)))
+	(HappyAbsSyn88  happy_var_2)
+	(HappyTerminal (Located happy_var_1 (Token (Sym ParenL  ) _)))
+	 =  HappyAbsSyn88
+		 (at (happy_var_1,happy_var_3)   happy_var_2
+	)
+happyReduction_241 _ _ _  = notHappyAtAll 
+
+happyReduce_242 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_242 = happySpecReduce_3  75 happyReduction_242
+happyReduction_242 (HappyTerminal (Located happy_var_3 (Token (Sym ParenR  ) _)))
+	(HappyAbsSyn45  happy_var_2)
+	(HappyTerminal (Located happy_var_1 (Token (Sym ParenL  ) _)))
+	 =  HappyAbsSyn88
+		 (at (happy_var_1,happy_var_3) $ PTuple (reverse happy_var_2)
+	)
+happyReduction_242 _ _ _  = notHappyAtAll 
+
+happyReduce_243 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_243 = happySpecReduce_2  75 happyReduction_243
+happyReduction_243 (HappyTerminal (Located happy_var_2 (Token (Sym BracketR) _)))
+	(HappyTerminal (Located happy_var_1 (Token (Sym BracketL) _)))
+	 =  HappyAbsSyn88
+		 (at (happy_var_1,happy_var_2) $ PList []
+	)
+happyReduction_243 _ _  = notHappyAtAll 
+
+happyReduce_244 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_244 = happySpecReduce_3  75 happyReduction_244
+happyReduction_244 (HappyTerminal (Located happy_var_3 (Token (Sym BracketR) _)))
+	(HappyAbsSyn88  happy_var_2)
+	(HappyTerminal (Located happy_var_1 (Token (Sym BracketL) _)))
+	 =  HappyAbsSyn88
+		 (at (happy_var_1,happy_var_3) $ PList [happy_var_2]
+	)
+happyReduction_244 _ _ _  = notHappyAtAll 
+
+happyReduce_245 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_245 = happySpecReduce_3  75 happyReduction_245
+happyReduction_245 (HappyTerminal (Located happy_var_3 (Token (Sym BracketR) _)))
+	(HappyAbsSyn45  happy_var_2)
+	(HappyTerminal (Located happy_var_1 (Token (Sym BracketL) _)))
+	 =  HappyAbsSyn88
+		 (at (happy_var_1,happy_var_3) $ PList (reverse happy_var_2)
+	)
+happyReduction_245 _ _ _  = notHappyAtAll 
+
+happyReduce_246 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_246 = happyMonadReduce 2 75 happyReduction_246
+happyReduction_246 ((HappyTerminal (Located happy_var_2 (Token (Sym CurlyR  ) _))) `HappyStk`
+	(HappyTerminal (Located happy_var_1 (Token (Sym CurlyL  ) _))) `HappyStk`
+	happyRest) tk
+	 = happyThen ((( mkRecord (rComb happy_var_1 happy_var_2) PRecord []))
+	) (\r -> happyReturn (HappyAbsSyn88 r))
+
+happyReduce_247 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_247 = happyMonadReduce 3 75 happyReduction_247
+happyReduction_247 ((HappyTerminal (Located happy_var_3 (Token (Sym CurlyR  ) _))) `HappyStk`
+	(HappyAbsSyn93  happy_var_2) `HappyStk`
+	(HappyTerminal (Located happy_var_1 (Token (Sym CurlyL  ) _))) `HappyStk`
+	happyRest) tk
+	 = happyThen ((( mkRecord (rComb happy_var_1 happy_var_3) PRecord happy_var_2))
+	) (\r -> happyReturn (HappyAbsSyn88 r))
+
+happyReduce_248 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_248 = happySpecReduce_3  76 happyReduction_248
+happyReduction_248 (HappyAbsSyn88  happy_var_3)
+	_
+	(HappyAbsSyn88  happy_var_1)
+	 =  HappyAbsSyn45
+		 ([happy_var_3, happy_var_1]
+	)
+happyReduction_248 _ _ _  = notHappyAtAll 
+
+happyReduce_249 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_249 = happySpecReduce_3  76 happyReduction_249
+happyReduction_249 (HappyAbsSyn88  happy_var_3)
+	_
+	(HappyAbsSyn45  happy_var_1)
+	 =  HappyAbsSyn45
+		 (happy_var_3 : happy_var_1
+	)
+happyReduction_249 _ _ _  = notHappyAtAll 
+
+happyReduce_250 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_250 = happySpecReduce_3  77 happyReduction_250
+happyReduction_250 (HappyAbsSyn88  happy_var_3)
+	_
+	(HappyAbsSyn112  happy_var_1)
+	 =  HappyAbsSyn92
+		 (Named { name = happy_var_1, value = happy_var_3 }
+	)
+happyReduction_250 _ _ _  = notHappyAtAll 
+
+happyReduce_251 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_251 = happySpecReduce_1  78 happyReduction_251
+happyReduction_251 (HappyAbsSyn92  happy_var_1)
+	 =  HappyAbsSyn93
+		 ([happy_var_1]
+	)
+happyReduction_251 _  = notHappyAtAll 
+
+happyReduce_252 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_252 = happySpecReduce_3  78 happyReduction_252
+happyReduction_252 (HappyAbsSyn92  happy_var_3)
+	_
+	(HappyAbsSyn93  happy_var_1)
+	 =  HappyAbsSyn93
+		 (happy_var_3 : happy_var_1
+	)
+happyReduction_252 _ _ _  = notHappyAtAll 
+
+happyReduce_253 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_253 = happySpecReduce_1  79 happyReduction_253
+happyReduction_253 (HappyAbsSyn103  happy_var_1)
+	 =  HappyAbsSyn94
+		 (at happy_var_1 $ mkSchema [] [] happy_var_1
+	)
+happyReduction_253 _  = notHappyAtAll 
+
+happyReduce_254 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_254 = happySpecReduce_2  79 happyReduction_254
+happyReduction_254 (HappyAbsSyn103  happy_var_2)
+	(HappyAbsSyn95  happy_var_1)
+	 =  HappyAbsSyn94
+		 (at (happy_var_1,happy_var_2) $ mkSchema (thing happy_var_1) [] happy_var_2
+	)
+happyReduction_254 _ _  = notHappyAtAll 
+
+happyReduce_255 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_255 = happySpecReduce_2  79 happyReduction_255
+happyReduction_255 (HappyAbsSyn103  happy_var_2)
+	(HappyAbsSyn96  happy_var_1)
+	 =  HappyAbsSyn94
+		 (at (happy_var_1,happy_var_2) $ mkSchema [] (thing happy_var_1) happy_var_2
+	)
+happyReduction_255 _ _  = notHappyAtAll 
+
+happyReduce_256 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_256 = happySpecReduce_3  79 happyReduction_256
+happyReduction_256 (HappyAbsSyn103  happy_var_3)
+	(HappyAbsSyn96  happy_var_2)
+	(HappyAbsSyn95  happy_var_1)
+	 =  HappyAbsSyn94
+		 (at (happy_var_1,happy_var_3) $ mkSchema (thing happy_var_1)
+                                                          (thing happy_var_2) happy_var_3
+	)
+happyReduction_256 _ _ _  = notHappyAtAll 
+
+happyReduce_257 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_257 = happySpecReduce_2  80 happyReduction_257
+happyReduction_257 (HappyTerminal (Located happy_var_2 (Token (Sym CurlyR  ) _)))
+	(HappyTerminal (Located happy_var_1 (Token (Sym CurlyL  ) _)))
+	 =  HappyAbsSyn95
+		 (Located (rComb happy_var_1 happy_var_2) []
+	)
+happyReduction_257 _ _  = notHappyAtAll 
+
+happyReduce_258 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_258 = happySpecReduce_3  80 happyReduction_258
+happyReduction_258 (HappyTerminal (Located happy_var_3 (Token (Sym CurlyR  ) _)))
+	(HappyAbsSyn100  happy_var_2)
+	(HappyTerminal (Located happy_var_1 (Token (Sym CurlyL  ) _)))
+	 =  HappyAbsSyn95
+		 (Located (rComb happy_var_1 happy_var_3) (reverse happy_var_2)
+	)
+happyReduction_258 _ _ _  = notHappyAtAll 
+
+happyReduce_259 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_259 = happySpecReduce_2  81 happyReduction_259
+happyReduction_259 (HappyAbsSyn96  happy_var_2)
+	(HappyAbsSyn96  happy_var_1)
+	 =  HappyAbsSyn96
+		 (at (happy_var_1,happy_var_2) $ fmap (++ thing happy_var_2) happy_var_1
+	)
+happyReduction_259 _ _  = notHappyAtAll 
+
+happyReduce_260 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_260 = happySpecReduce_1  81 happyReduction_260
+happyReduction_260 (HappyAbsSyn96  happy_var_1)
+	 =  HappyAbsSyn96
+		 (happy_var_1
+	)
+happyReduction_260 _  = notHappyAtAll 
+
+happyReduce_261 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_261 = happyMonadReduce 2 82 happyReduction_261
+happyReduction_261 ((HappyTerminal (Located happy_var_2 (Token (Sym FatArrR ) _))) `HappyStk`
+	(HappyAbsSyn103  happy_var_1) `HappyStk`
+	happyRest) tk
+	 = happyThen ((( fmap (\x -> at (x,happy_var_2) x) (mkProp happy_var_1)))
+	) (\r -> happyReturn (HappyAbsSyn96 r))
+
+happyReduce_262 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_262 = happySpecReduce_1  83 happyReduction_262
+happyReduction_262 (HappyTerminal (Located happy_var_1 (Token (Op Hash) _)))
+	 =  HappyAbsSyn98
+		 (Located happy_var_1 KNum
+	)
+happyReduction_262 _  = notHappyAtAll 
+
+happyReduce_263 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_263 = happySpecReduce_1  83 happyReduction_263
+happyReduction_263 (HappyTerminal (Located happy_var_1 (Token (Op Mul)   _)))
+	 =  HappyAbsSyn98
+		 (Located happy_var_1 KType
+	)
+happyReduction_263 _  = notHappyAtAll 
+
+happyReduce_264 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_264 = happySpecReduce_1  83 happyReduction_264
+happyReduction_264 (HappyTerminal (Located happy_var_1 (Token (KW KW_Prop) _)))
+	 =  HappyAbsSyn98
+		 (Located happy_var_1 KProp
+	)
+happyReduction_264 _  = notHappyAtAll 
+
+happyReduce_265 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_265 = happySpecReduce_3  83 happyReduction_265
+happyReduction_265 (HappyAbsSyn98  happy_var_3)
+	_
+	(HappyAbsSyn98  happy_var_1)
+	 =  HappyAbsSyn98
+		 (combLoc KFun happy_var_1 happy_var_3
+	)
+happyReduction_265 _ _ _  = notHappyAtAll 
+
+happyReduce_266 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_266 = happyMonadReduce 1 84 happyReduction_266
+happyReduction_266 ((HappyAbsSyn112  happy_var_1) `HappyStk`
+	happyRest) tk
+	 = happyThen ((( mkTParam happy_var_1 Nothing))
+	) (\r -> happyReturn (HappyAbsSyn99 r))
+
+happyReduce_267 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_267 = happyMonadReduce 3 84 happyReduction_267
+happyReduction_267 ((HappyAbsSyn98  happy_var_3) `HappyStk`
+	_ `HappyStk`
+	(HappyAbsSyn112  happy_var_1) `HappyStk`
+	happyRest) tk
+	 = happyThen ((( mkTParam (at (happy_var_1,happy_var_3) happy_var_1) (Just (thing happy_var_3))))
+	) (\r -> happyReturn (HappyAbsSyn99 r))
+
+happyReduce_268 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_268 = happySpecReduce_1  85 happyReduction_268
+happyReduction_268 (HappyAbsSyn99  happy_var_1)
+	 =  HappyAbsSyn100
+		 ([happy_var_1]
+	)
+happyReduction_268 _  = notHappyAtAll 
+
+happyReduce_269 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_269 = happySpecReduce_3  85 happyReduction_269
+happyReduction_269 (HappyAbsSyn99  happy_var_3)
+	_
+	(HappyAbsSyn100  happy_var_1)
+	 =  HappyAbsSyn100
+		 (happy_var_3 : happy_var_1
+	)
+happyReduction_269 _ _ _  = notHappyAtAll 
+
+happyReduce_270 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_270 = happyMonadReduce 1 86 happyReduction_270
+happyReduction_270 ((HappyAbsSyn112  happy_var_1) `HappyStk`
+	happyRest) tk
+	 = happyThen ((( mkTParam happy_var_1 Nothing))
+	) (\r -> happyReturn (HappyAbsSyn99 r))
+
+happyReduce_271 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_271 = happyMonadReduce 5 86 happyReduction_271
+happyReduction_271 ((HappyTerminal (Located happy_var_5 (Token (Sym ParenR  ) _))) `HappyStk`
+	(HappyAbsSyn98  happy_var_4) `HappyStk`
+	_ `HappyStk`
+	(HappyAbsSyn112  happy_var_2) `HappyStk`
+	(HappyTerminal (Located happy_var_1 (Token (Sym ParenL  ) _))) `HappyStk`
+	happyRest) tk
+	 = happyThen ((( mkTParam (at (happy_var_1,happy_var_5) happy_var_2) (Just (thing happy_var_4))))
+	) (\r -> happyReturn (HappyAbsSyn99 r))
+
+happyReduce_272 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_272 = happySpecReduce_1  87 happyReduction_272
+happyReduction_272 (HappyAbsSyn99  happy_var_1)
+	 =  HappyAbsSyn100
+		 ([happy_var_1]
+	)
+happyReduction_272 _  = notHappyAtAll 
+
+happyReduce_273 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_273 = happySpecReduce_2  87 happyReduction_273
+happyReduction_273 (HappyAbsSyn99  happy_var_2)
+	(HappyAbsSyn100  happy_var_1)
+	 =  HappyAbsSyn100
+		 (happy_var_2 : happy_var_1
+	)
+happyReduction_273 _ _  = notHappyAtAll 
+
+happyReduce_274 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_274 = happySpecReduce_3  88 happyReduction_274
+happyReduction_274 (HappyAbsSyn103  happy_var_3)
+	_
+	(HappyAbsSyn103  happy_var_1)
+	 =  HappyAbsSyn103
+		 (at (happy_var_1,happy_var_3) $ TFun happy_var_1 happy_var_3
+	)
+happyReduction_274 _ _ _  = notHappyAtAll 
+
+happyReduce_275 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_275 = happySpecReduce_1  88 happyReduction_275
+happyReduction_275 (HappyAbsSyn103  happy_var_1)
+	 =  HappyAbsSyn103
+		 (happy_var_1
+	)
+happyReduction_275 _  = notHappyAtAll 
+
+happyReduce_276 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_276 = happySpecReduce_3  89 happyReduction_276
+happyReduction_276 (HappyAbsSyn103  happy_var_3)
+	(HappyAbsSyn44  happy_var_2)
+	(HappyAbsSyn103  happy_var_1)
+	 =  HappyAbsSyn103
+		 (at (happy_var_1,happy_var_3) $ TInfix happy_var_1 happy_var_2 defaultFixity happy_var_3
+	)
+happyReduction_276 _ _ _  = notHappyAtAll 
+
+happyReduce_277 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_277 = happySpecReduce_1  89 happyReduction_277
+happyReduction_277 (HappyAbsSyn103  happy_var_1)
+	 =  HappyAbsSyn103
+		 (happy_var_1
+	)
+happyReduction_277 _  = notHappyAtAll 
+
+happyReduce_278 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_278 = happySpecReduce_2  90 happyReduction_278
+happyReduction_278 (HappyAbsSyn103  happy_var_2)
+	(HappyAbsSyn108  happy_var_1)
+	 =  HappyAbsSyn103
+		 (at (happy_var_1,happy_var_2) $ foldr TSeq happy_var_2 (reverse (thing happy_var_1))
+	)
+happyReduction_278 _ _  = notHappyAtAll 
+
+happyReduce_279 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_279 = happySpecReduce_2  90 happyReduction_279
+happyReduction_279 (HappyAbsSyn107  happy_var_2)
+	(HappyAbsSyn116  happy_var_1)
+	 =  HappyAbsSyn103
+		 (at (happy_var_1,head happy_var_2)
+                                     $ TUser (thing happy_var_1) (reverse happy_var_2)
+	)
+happyReduction_279 _ _  = notHappyAtAll 
+
+happyReduce_280 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_280 = happySpecReduce_1  90 happyReduction_280
+happyReduction_280 (HappyAbsSyn103  happy_var_1)
+	 =  HappyAbsSyn103
+		 (happy_var_1
+	)
+happyReduction_280 _  = notHappyAtAll 
+
+happyReduce_281 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_281 = happySpecReduce_1  91 happyReduction_281
+happyReduction_281 (HappyAbsSyn116  happy_var_1)
+	 =  HappyAbsSyn103
+		 (at happy_var_1 $ TUser (thing happy_var_1) []
+	)
+happyReduction_281 _  = notHappyAtAll 
+
+happyReduce_282 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_282 = happySpecReduce_3  91 happyReduction_282
+happyReduction_282 _
+	(HappyAbsSyn44  happy_var_2)
+	(HappyTerminal (Located happy_var_1 (Token (Sym ParenL  ) _)))
+	 =  HappyAbsSyn103
+		 (at happy_var_1 $ TUser (thing happy_var_2) []
+	)
+happyReduction_282 _ _ _  = notHappyAtAll 
+
+happyReduce_283 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_283 = happySpecReduce_1  91 happyReduction_283
+happyReduction_283 (HappyTerminal (happy_var_1@(Located _ (Token (Num   {}) _))))
+	 =  HappyAbsSyn103
+		 (at happy_var_1 $ TNum  (getNum happy_var_1)
+	)
+happyReduction_283 _  = notHappyAtAll 
+
+happyReduce_284 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_284 = happySpecReduce_1  91 happyReduction_284
+happyReduction_284 (HappyTerminal (happy_var_1@(Located _ (Token (ChrLit {}) _))))
+	 =  HappyAbsSyn103
+		 (at happy_var_1 $ TChar (getChr happy_var_1)
+	)
+happyReduction_284 _  = notHappyAtAll 
+
+happyReduce_285 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_285 = happySpecReduce_3  91 happyReduction_285
+happyReduction_285 (HappyTerminal (Located happy_var_3 (Token (Sym BracketR) _)))
+	(HappyAbsSyn103  happy_var_2)
+	(HappyTerminal (Located happy_var_1 (Token (Sym BracketL) _)))
+	 =  HappyAbsSyn103
+		 (at (happy_var_1,happy_var_3) $ TSeq happy_var_2 TBit
+	)
+happyReduction_285 _ _ _  = notHappyAtAll 
+
+happyReduce_286 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_286 = happySpecReduce_3  91 happyReduction_286
+happyReduction_286 (HappyTerminal (Located happy_var_3 (Token (Sym ParenR  ) _)))
+	(HappyAbsSyn103  happy_var_2)
+	(HappyTerminal (Located happy_var_1 (Token (Sym ParenL  ) _)))
+	 =  HappyAbsSyn103
+		 (at (happy_var_1,happy_var_3) $ TParens happy_var_2
+	)
+happyReduction_286 _ _ _  = notHappyAtAll 
+
+happyReduce_287 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_287 = happySpecReduce_2  91 happyReduction_287
+happyReduction_287 (HappyTerminal (Located happy_var_2 (Token (Sym ParenR  ) _)))
+	(HappyTerminal (Located happy_var_1 (Token (Sym ParenL  ) _)))
+	 =  HappyAbsSyn103
+		 (at (happy_var_1,happy_var_2) $ TTuple []
+	)
+happyReduction_287 _ _  = notHappyAtAll 
+
+happyReduce_288 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_288 = happySpecReduce_3  91 happyReduction_288
+happyReduction_288 (HappyTerminal (Located happy_var_3 (Token (Sym ParenR  ) _)))
+	(HappyAbsSyn109  happy_var_2)
+	(HappyTerminal (Located happy_var_1 (Token (Sym ParenL  ) _)))
+	 =  HappyAbsSyn103
+		 (at (happy_var_1,happy_var_3) $ TTuple  (reverse happy_var_2)
+	)
+happyReduction_288 _ _ _  = notHappyAtAll 
+
+happyReduce_289 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_289 = happyMonadReduce 2 91 happyReduction_289
+happyReduction_289 ((HappyTerminal (Located happy_var_2 (Token (Sym CurlyR  ) _))) `HappyStk`
+	(HappyTerminal (Located happy_var_1 (Token (Sym CurlyL  ) _))) `HappyStk`
+	happyRest) tk
+	 = happyThen ((( mkRecord (rComb happy_var_1 happy_var_2) TRecord []))
+	) (\r -> happyReturn (HappyAbsSyn103 r))
+
+happyReduce_290 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_290 = happyMonadReduce 3 91 happyReduction_290
+happyReduction_290 ((HappyTerminal (Located happy_var_3 (Token (Sym CurlyR  ) _))) `HappyStk`
+	(HappyAbsSyn111  happy_var_2) `HappyStk`
+	(HappyTerminal (Located happy_var_1 (Token (Sym CurlyL  ) _))) `HappyStk`
+	happyRest) tk
+	 = happyThen ((( mkRecord (rComb happy_var_1 happy_var_3) TRecord happy_var_2))
+	) (\r -> happyReturn (HappyAbsSyn103 r))
+
+happyReduce_291 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_291 = happySpecReduce_1  91 happyReduction_291
+happyReduction_291 (HappyTerminal (Located happy_var_1 (Token (Sym Underscore ) _)))
+	 =  HappyAbsSyn103
+		 (at happy_var_1 TWild
+	)
+happyReduction_291 _  = notHappyAtAll 
+
+happyReduce_292 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_292 = happySpecReduce_1  92 happyReduction_292
+happyReduction_292 (HappyAbsSyn103  happy_var_1)
+	 =  HappyAbsSyn107
+		 ([ happy_var_1 ]
+	)
+happyReduction_292 _  = notHappyAtAll 
+
+happyReduce_293 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_293 = happySpecReduce_2  92 happyReduction_293
+happyReduction_293 (HappyAbsSyn103  happy_var_2)
+	(HappyAbsSyn107  happy_var_1)
+	 =  HappyAbsSyn107
+		 (happy_var_2 : happy_var_1
+	)
+happyReduction_293 _ _  = notHappyAtAll 
+
+happyReduce_294 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_294 = happySpecReduce_3  93 happyReduction_294
+happyReduction_294 (HappyTerminal (Located happy_var_3 (Token (Sym BracketR) _)))
+	(HappyAbsSyn103  happy_var_2)
+	(HappyTerminal (Located happy_var_1 (Token (Sym BracketL) _)))
+	 =  HappyAbsSyn108
+		 (Located (rComb happy_var_1 happy_var_3) [ happy_var_2 ]
+	)
+happyReduction_294 _ _ _  = notHappyAtAll 
+
+happyReduce_295 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_295 = happyReduce 4 93 happyReduction_295
+happyReduction_295 ((HappyTerminal (Located happy_var_4 (Token (Sym BracketR) _))) `HappyStk`
+	(HappyAbsSyn103  happy_var_3) `HappyStk`
+	_ `HappyStk`
+	(HappyAbsSyn108  happy_var_1) `HappyStk`
+	happyRest)
+	 = HappyAbsSyn108
+		 (at (happy_var_1,happy_var_4) (fmap (happy_var_3 :) happy_var_1)
+	) `HappyStk` happyRest
+
+happyReduce_296 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_296 = happySpecReduce_3  94 happyReduction_296
+happyReduction_296 (HappyAbsSyn103  happy_var_3)
+	_
+	(HappyAbsSyn103  happy_var_1)
+	 =  HappyAbsSyn109
+		 ([ happy_var_3, happy_var_1]
+	)
+happyReduction_296 _ _ _  = notHappyAtAll 
+
+happyReduce_297 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_297 = happySpecReduce_3  94 happyReduction_297
+happyReduction_297 (HappyAbsSyn103  happy_var_3)
+	_
+	(HappyAbsSyn109  happy_var_1)
+	 =  HappyAbsSyn109
+		 (happy_var_3 : happy_var_1
+	)
+happyReduction_297 _ _ _  = notHappyAtAll 
+
+happyReduce_298 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_298 = happySpecReduce_3  95 happyReduction_298
+happyReduction_298 (HappyAbsSyn103  happy_var_3)
+	_
+	(HappyAbsSyn112  happy_var_1)
+	 =  HappyAbsSyn110
+		 (Named { name = happy_var_1, value = happy_var_3 }
+	)
+happyReduction_298 _ _ _  = notHappyAtAll 
+
+happyReduce_299 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_299 = happySpecReduce_1  96 happyReduction_299
+happyReduction_299 (HappyAbsSyn110  happy_var_1)
+	 =  HappyAbsSyn111
+		 ([happy_var_1]
+	)
+happyReduction_299 _  = notHappyAtAll 
+
+happyReduce_300 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_300 = happySpecReduce_3  96 happyReduction_300
+happyReduction_300 (HappyAbsSyn110  happy_var_3)
+	_
+	(HappyAbsSyn111  happy_var_1)
+	 =  HappyAbsSyn111
+		 (happy_var_3 : happy_var_1
+	)
+happyReduction_300 _ _ _  = notHappyAtAll 
+
+happyReduce_301 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_301 = happySpecReduce_1  97 happyReduction_301
+happyReduction_301 (HappyTerminal (happy_var_1@(Located _ (Token (Ident [] _) _))))
+	 =  HappyAbsSyn112
+		 (let Token (Ident _ str) _ = thing happy_var_1
+                         in happy_var_1 { thing = mkIdent str }
+	)
+happyReduction_301 _  = notHappyAtAll 
+
+happyReduce_302 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_302 = happySpecReduce_1  97 happyReduction_302
+happyReduction_302 (HappyTerminal (Located happy_var_1 (Token (KW KW_x)       _)))
+	 =  HappyAbsSyn112
+		 (Located { srcRange = happy_var_1, thing = mkIdent "x" }
+	)
+happyReduction_302 _  = notHappyAtAll 
+
+happyReduce_303 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_303 = happySpecReduce_1  97 happyReduction_303
+happyReduction_303 (HappyTerminal (Located happy_var_1 (Token (KW KW_private)   _)))
+	 =  HappyAbsSyn112
+		 (Located { srcRange = happy_var_1, thing = mkIdent "private" }
+	)
+happyReduction_303 _  = notHappyAtAll 
+
+happyReduce_304 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_304 = happySpecReduce_1  97 happyReduction_304
+happyReduction_304 (HappyTerminal (Located happy_var_1 (Token (KW KW_as)        _)))
+	 =  HappyAbsSyn112
+		 (Located { srcRange = happy_var_1, thing = mkIdent "as" }
+	)
+happyReduction_304 _  = notHappyAtAll 
+
+happyReduce_305 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_305 = happySpecReduce_1  97 happyReduction_305
+happyReduction_305 (HappyTerminal (Located happy_var_1 (Token (KW KW_hiding)    _)))
+	 =  HappyAbsSyn112
+		 (Located { srcRange = happy_var_1, thing = mkIdent "hiding" }
+	)
+happyReduction_305 _  = notHappyAtAll 
+
+happyReduce_306 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_306 = happySpecReduce_1  98 happyReduction_306
+happyReduction_306 (HappyAbsSyn112  happy_var_1)
+	 =  HappyAbsSyn44
+		 (fmap mkUnqual happy_var_1
+	)
+happyReduction_306 _  = notHappyAtAll 
+
+happyReduce_307 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_307 = happySpecReduce_1  99 happyReduction_307
+happyReduction_307 (HappyAbsSyn112  happy_var_1)
+	 =  HappyAbsSyn114
+		 (fmap (mkModName . (:[]) . identText) happy_var_1
+	)
+happyReduction_307 _  = notHappyAtAll 
+
+happyReduce_308 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_308 = happySpecReduce_1  99 happyReduction_308
+happyReduction_308 (HappyTerminal (happy_var_1@(Located _ (Token  Ident{}     _))))
+	 =  HappyAbsSyn114
+		 (let Token (Ident ns i) _ = thing happy_var_1
+                                     in mkModName (ns ++ [i]) A.<$ happy_var_1
+	)
+happyReduction_308 _  = notHappyAtAll 
+
+happyReduce_309 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_309 = happySpecReduce_1  100 happyReduction_309
+happyReduction_309 (HappyAbsSyn114  happy_var_1)
+	 =  HappyAbsSyn114
+		 (happy_var_1
+	)
+happyReduction_309 _  = notHappyAtAll 
+
+happyReduce_310 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_310 = happySpecReduce_2  100 happyReduction_310
+happyReduction_310 (HappyAbsSyn114  happy_var_2)
+	_
+	 =  HappyAbsSyn114
+		 (fmap paramInstModName happy_var_2
+	)
+happyReduction_310 _ _  = notHappyAtAll 
+
+happyReduce_311 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_311 = happySpecReduce_1  101 happyReduction_311
+happyReduction_311 (HappyAbsSyn44  happy_var_1)
+	 =  HappyAbsSyn116
+		 (happy_var_1
+	)
+happyReduction_311 _  = notHappyAtAll 
+
+happyReduce_312 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_312 = happySpecReduce_1  101 happyReduction_312
+happyReduction_312 (HappyTerminal (happy_var_1@(Located _ (Token  Ident{}     _))))
+	 =  HappyAbsSyn116
+		 (let Token (Ident ns i) _ = thing happy_var_1
+                                     in mkQual (mkModName ns) (mkIdent i) A.<$ happy_var_1
+	)
+happyReduction_312 _  = notHappyAtAll 
+
+happyReduce_313 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_313 = happySpecReduce_1  102 happyReduction_313
+happyReduction_313 (HappyAbsSyn116  happy_var_1)
+	 =  HappyAbsSyn116
+		 (happy_var_1
+	)
+happyReduction_313 _  = notHappyAtAll 
+
+happyReduce_314 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_314 = happySpecReduce_1  102 happyReduction_314
+happyReduction_314 (HappyAbsSyn44  happy_var_1)
+	 =  HappyAbsSyn116
+		 (happy_var_1
+	)
+happyReduction_314 _  = notHappyAtAll 
+
+happyReduce_315 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_315 = happySpecReduce_3  102 happyReduction_315
+happyReduction_315 _
+	(HappyAbsSyn44  happy_var_2)
+	_
+	 =  HappyAbsSyn116
+		 (happy_var_2
+	)
+happyReduction_315 _ _ _  = notHappyAtAll 
+
+happyReduce_316 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_316 = happySpecReduce_1  103 happyReduction_316
+happyReduction_316 (HappyAbsSyn116  happy_var_1)
+	 =  HappyAbsSyn103
+		 (at happy_var_1 $ TUser (thing happy_var_1) []
+	)
+happyReduction_316 _  = notHappyAtAll 
+
+happyReduce_317 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_317 = happySpecReduce_1  103 happyReduction_317
+happyReduction_317 (HappyTerminal (happy_var_1@(Located _ (Token (Num   {}) _))))
+	 =  HappyAbsSyn103
+		 (at happy_var_1 $ TNum  (getNum happy_var_1)
+	)
+happyReduction_317 _  = notHappyAtAll 
+
+happyReduce_318 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_318 = happyMonadReduce 3 103 happyReduction_318
+happyReduction_318 ((HappyTerminal (Located happy_var_3 (Token (Sym ParenR  ) _))) `HappyStk`
+	(HappyAbsSyn103  happy_var_2) `HappyStk`
+	(HappyTerminal (Located happy_var_1 (Token (Sym ParenL  ) _))) `HappyStk`
+	happyRest) tk
+	 = happyThen ((( validDemotedType (rComb happy_var_1 happy_var_3) happy_var_2))
+	) (\r -> happyReturn (HappyAbsSyn103 r))
+
+happyReduce_319 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_319 = happySpecReduce_2  103 happyReduction_319
+happyReduction_319 (HappyTerminal (Located happy_var_2 (Token (Sym CurlyR  ) _)))
+	(HappyTerminal (Located happy_var_1 (Token (Sym CurlyL  ) _)))
+	 =  HappyAbsSyn103
+		 (at (happy_var_1,happy_var_2) (TTyApp [])
+	)
+happyReduction_319 _ _  = notHappyAtAll 
+
+happyReduce_320 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_320 = happySpecReduce_3  103 happyReduction_320
+happyReduction_320 (HappyTerminal (Located happy_var_3 (Token (Sym CurlyR  ) _)))
+	(HappyAbsSyn111  happy_var_2)
+	(HappyTerminal (Located happy_var_1 (Token (Sym CurlyL  ) _)))
+	 =  HappyAbsSyn103
+		 (at (happy_var_1,happy_var_3) (TTyApp (reverse happy_var_2))
+	)
+happyReduction_320 _ _ _  = notHappyAtAll 
+
+happyReduce_321 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_321 = happySpecReduce_3  103 happyReduction_321
+happyReduction_321 (HappyTerminal (Located happy_var_3 (Token (Sym CurlyR  ) _)))
+	(HappyAbsSyn103  happy_var_2)
+	(HappyTerminal (Located happy_var_1 (Token (Sym CurlyL  ) _)))
+	 =  HappyAbsSyn103
+		 (anonTyApp (getLoc (happy_var_1,happy_var_3)) [happy_var_2]
+	)
+happyReduction_321 _ _ _  = notHappyAtAll 
+
+happyReduce_322 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_322 = happySpecReduce_3  103 happyReduction_322
+happyReduction_322 (HappyTerminal (Located happy_var_3 (Token (Sym CurlyR  ) _)))
+	(HappyAbsSyn109  happy_var_2)
+	(HappyTerminal (Located happy_var_1 (Token (Sym CurlyL  ) _)))
+	 =  HappyAbsSyn103
+		 (anonTyApp (getLoc (happy_var_1,happy_var_3)) (reverse happy_var_2)
+	)
+happyReduction_322 _ _ _  = notHappyAtAll 
+
+happyReduce_323 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_323 = happySpecReduce_3  104 happyReduction_323
+happyReduction_323 (HappyAbsSyn103  happy_var_3)
+	_
+	(HappyAbsSyn112  happy_var_1)
+	 =  HappyAbsSyn110
+		 (Named { name = happy_var_1, value = happy_var_3 }
+	)
+happyReduction_323 _ _ _  = notHappyAtAll 
+
+happyReduce_324 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_324 = happySpecReduce_1  105 happyReduction_324
+happyReduction_324 (HappyAbsSyn110  happy_var_1)
+	 =  HappyAbsSyn111
+		 ([happy_var_1]
+	)
+happyReduction_324 _  = notHappyAtAll 
+
+happyReduce_325 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_325 = happySpecReduce_3  105 happyReduction_325
+happyReduction_325 (HappyAbsSyn110  happy_var_3)
+	_
+	(HappyAbsSyn111  happy_var_1)
+	 =  HappyAbsSyn111
+		 (happy_var_3 : happy_var_1
+	)
+happyReduction_325 _ _ _  = notHappyAtAll 
+
+happyNewToken action sts stk
+	= lexerP(\tk -> 
+	let cont i = happyDoAction i tk action sts stk in
+	case tk of {
+	Located _ (Token EOF _) -> happyDoAction 72 tk action sts stk;
+	happy_dollar_dollar@(Located _ (Token (Num   {}) _)) -> cont 1;
+	happy_dollar_dollar@(Located _ (Token (Frac  {}) _)) -> cont 2;
+	happy_dollar_dollar@(Located _ (Token (StrLit {}) _)) -> cont 3;
+	happy_dollar_dollar@(Located _ (Token (ChrLit {}) _)) -> cont 4;
+	happy_dollar_dollar@(Located _ (Token (Ident [] _) _)) -> cont 5;
+	happy_dollar_dollar@(Located _ (Token  Ident{}     _)) -> cont 6;
+	happy_dollar_dollar@(Located _ (Token  (Selector _) _)) -> cont 7;
+	Located happy_dollar_dollar (Token (KW KW_include)   _) -> cont 8;
+	Located happy_dollar_dollar (Token (KW KW_import)    _) -> cont 9;
+	Located happy_dollar_dollar (Token (KW KW_as)        _) -> cont 10;
+	Located happy_dollar_dollar (Token (KW KW_hiding)    _) -> cont 11;
+	Located happy_dollar_dollar (Token (KW KW_private)   _) -> cont 12;
+	Located happy_dollar_dollar (Token (KW KW_parameter) _) -> cont 13;
+	Located happy_dollar_dollar (Token (KW KW_property)  _) -> cont 14;
+	Located happy_dollar_dollar (Token (KW KW_infix)     _) -> cont 15;
+	Located happy_dollar_dollar (Token (KW KW_infixl)    _) -> cont 16;
+	Located happy_dollar_dollar (Token (KW KW_infixr)    _) -> cont 17;
+	Located happy_dollar_dollar (Token (KW KW_type   ) _) -> cont 18;
+	Located happy_dollar_dollar (Token (KW KW_newtype) _) -> cont 19;
+	Located happy_dollar_dollar (Token (KW KW_module ) _) -> cont 20;
+	Located happy_dollar_dollar (Token (KW KW_submodule ) _) -> cont 21;
+	Located happy_dollar_dollar (Token (KW KW_where  ) _) -> cont 22;
+	Located happy_dollar_dollar (Token (KW KW_let    ) _) -> cont 23;
+	Located happy_dollar_dollar (Token (KW KW_if     ) _) -> cont 24;
+	Located happy_dollar_dollar (Token (KW KW_then   ) _) -> cont 25;
+	Located happy_dollar_dollar (Token (KW KW_else   ) _) -> cont 26;
+	Located happy_dollar_dollar (Token (KW KW_x)       _) -> cont 27;
+	Located happy_dollar_dollar (Token (KW KW_down)    _) -> cont 28;
+	Located happy_dollar_dollar (Token (KW KW_by)      _) -> cont 29;
+	Located happy_dollar_dollar (Token (KW KW_primitive) _) -> cont 30;
+	Located happy_dollar_dollar (Token (KW KW_constraint) _) -> cont 31;
+	Located happy_dollar_dollar (Token (KW KW_Prop) _) -> cont 32;
+	Located happy_dollar_dollar (Token (KW KW_propguards)) -> cont 33;
+	Located happy_dollar_dollar (Token (Sym BracketL) _) -> cont 34;
+	Located happy_dollar_dollar (Token (Sym BracketR) _) -> cont 35;
+	Located happy_dollar_dollar (Token (Sym ArrL    ) _) -> cont 36;
+	Located happy_dollar_dollar (Token (Sym DotDot  ) _) -> cont 37;
+	Located happy_dollar_dollar (Token (Sym DotDotDot) _) -> cont 38;
+	Located happy_dollar_dollar (Token (Sym DotDotLt) _) -> cont 39;
+	Located happy_dollar_dollar (Token (Sym DotDotGt) _) -> cont 40;
+	Located happy_dollar_dollar (Token (Sym Bar     ) _) -> cont 41;
+	Located happy_dollar_dollar (Token (Sym Lt      ) _) -> cont 42;
+	Located happy_dollar_dollar (Token (Sym Gt      ) _) -> cont 43;
+	Located happy_dollar_dollar (Token (Sym ParenL  ) _) -> cont 44;
+	Located happy_dollar_dollar (Token (Sym ParenR  ) _) -> cont 45;
+	Located happy_dollar_dollar (Token (Sym Comma   ) _) -> cont 46;
+	Located happy_dollar_dollar (Token (Sym Semi    ) _) -> cont 47;
+	Located happy_dollar_dollar (Token (Sym CurlyL  ) _) -> cont 48;
+	Located happy_dollar_dollar (Token (Sym CurlyR  ) _) -> cont 49;
+	Located happy_dollar_dollar (Token (Sym TriL    ) _) -> cont 50;
+	Located happy_dollar_dollar (Token (Sym TriR    ) _) -> cont 51;
+	Located happy_dollar_dollar (Token (Sym EqDef   ) _) -> cont 52;
+	Located happy_dollar_dollar (Token (Sym BackTick) _) -> cont 53;
+	Located happy_dollar_dollar (Token (Sym Colon   ) _) -> cont 54;
+	Located happy_dollar_dollar (Token (Sym ArrR    ) _) -> cont 55;
+	Located happy_dollar_dollar (Token (Sym FatArrR ) _) -> cont 56;
+	Located happy_dollar_dollar (Token (Sym Lambda  ) _) -> cont 57;
+	Located happy_dollar_dollar (Token (Sym Underscore ) _) -> cont 58;
+	Located happy_dollar_dollar (Token (Virt VCurlyL)  _) -> cont 59;
+	Located happy_dollar_dollar (Token (Virt VCurlyR)  _) -> cont 60;
+	Located happy_dollar_dollar (Token (Virt VSemi)    _) -> cont 61;
+	Located happy_dollar_dollar (Token (Op Plus)  _) -> cont 62;
+	Located happy_dollar_dollar (Token (Op Mul)   _) -> cont 63;
+	Located happy_dollar_dollar (Token (Op Exp)   _) -> cont 64;
+	Located happy_dollar_dollar (Token (Op Minus) _) -> cont 65;
+	Located happy_dollar_dollar (Token (Op Complement) _) -> cont 66;
+	Located happy_dollar_dollar (Token (Op Hash) _) -> cont 67;
+	Located happy_dollar_dollar (Token (Op At) _) -> cont 68;
+	happy_dollar_dollar@(Located _ (Token (Op (Other [] _)) _)) -> cont 69;
+	happy_dollar_dollar@(Located _ (Token (Op  Other{}   )  _)) -> cont 70;
+	happy_dollar_dollar@(Located _ (Token (White DocStr) _)) -> cont 71;
+	_ -> happyError' (tk, [])
+	})
+
+happyError_ explist 72 tk = happyError' (tk, explist)
+happyError_ explist _ tk = happyError' (tk, explist)
+
+happyThen :: () => ParseM a -> (a -> ParseM b) -> ParseM b
+happyThen = (Prelude.>>=)
+happyReturn :: () => a -> ParseM a
+happyReturn = (Prelude.return)
+happyParse :: () => Prelude.Int -> ParseM (HappyAbsSyn )
+
+happyNewToken :: () => Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+
+happyDoAction :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+
+happyReduceArr :: () => Happy_Data_Array.Array Prelude.Int (Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn ))
+
+happyThen1 :: () => ParseM a -> (a -> ParseM b) -> ParseM b
+happyThen1 = happyThen
+happyReturn1 :: () => a -> ParseM a
+happyReturn1 = happyReturn
+happyError' :: () => ((Located Token), [Prelude.String]) -> ParseM a
+happyError' tk = (\(tokens, explist) -> happyError) tk
+vmodule = happySomeParser where
+ happySomeParser = happyThen (happyParse 0) (\x -> case x of {HappyAbsSyn15 z -> happyReturn z; _other -> notHappyAtAll })
+
+program = happySomeParser where
+ happySomeParser = happyThen (happyParse 1) (\x -> case x of {HappyAbsSyn24 z -> happyReturn z; _other -> notHappyAtAll })
+
+programLayout = happySomeParser where
+ happySomeParser = happyThen (happyParse 2) (\x -> case x of {HappyAbsSyn24 z -> happyReturn z; _other -> notHappyAtAll })
+
+expr = happySomeParser where
+ happySomeParser = happyThen (happyParse 3) (\x -> case x of {HappyAbsSyn59 z -> happyReturn z; _other -> notHappyAtAll })
+
+decl = happySomeParser where
+ happySomeParser = happyThen (happyParse 4) (\x -> case x of {HappyAbsSyn38 z -> happyReturn z; _other -> notHappyAtAll })
+
+decls = happySomeParser where
+ happySomeParser = happyThen (happyParse 5) (\x -> case x of {HappyAbsSyn39 z -> happyReturn z; _other -> notHappyAtAll })
+
+declsLayout = happySomeParser where
+ happySomeParser = happyThen (happyParse 6) (\x -> case x of {HappyAbsSyn39 z -> happyReturn z; _other -> notHappyAtAll })
+
+letDecl = happySomeParser where
+ happySomeParser = happyThen (happyParse 7) (\x -> case x of {HappyAbsSyn38 z -> happyReturn z; _other -> notHappyAtAll })
+
+repl = happySomeParser where
+ happySomeParser = happyThen (happyParse 8) (\x -> case x of {HappyAbsSyn53 z -> happyReturn z; _other -> notHappyAtAll })
+
+schema = happySomeParser where
+ happySomeParser = happyThen (happyParse 9) (\x -> case x of {HappyAbsSyn94 z -> happyReturn z; _other -> notHappyAtAll })
+
+modName = happySomeParser where
+ happySomeParser = happyThen (happyParse 10) (\x -> case x of {HappyAbsSyn114 z -> happyReturn z; _other -> notHappyAtAll })
+
+helpName = happySomeParser where
+ happySomeParser = happyThen (happyParse 11) (\x -> case x of {HappyAbsSyn116 z -> happyReturn z; _other -> notHappyAtAll })
+
+happySeq = happyDontSeq
+
+
+parseModName :: String -> Maybe ModName
+parseModName txt =
+  case parseString defaultConfig { cfgModuleScope = False } modName txt of
+    Right a -> Just (thing a)
+    Left _  -> Nothing
+
+parseHelpName :: String -> Maybe PName
+parseHelpName txt =
+  case parseString defaultConfig { cfgModuleScope = False } helpName txt of
+    Right a -> Just (thing a)
+    Left _  -> Nothing
+
+addImplicitIncludes :: Config -> Program PName -> Program PName
+addImplicitIncludes cfg (Program ds) =
+  Program $ map path (cfgAutoInclude cfg) ++ ds
+  where path p = Include Located { srcRange = rng, thing = p }
+        rng    = Range { source = cfgSource cfg, from = start, to = start }
+
+
+parseProgramWith :: Config -> Text -> Either ParseError (Program PName)
+parseProgramWith cfg s = case res s of
+                          Left err -> Left err
+                          Right a  -> Right (addImplicitIncludes cfg a)
+  where
+  res = parse cfg $ case cfgLayout cfg of
+                      Layout   -> programLayout
+                      NoLayout -> program
+
+parseModule :: Config -> Text -> Either ParseError (Module PName)
+parseModule cfg = parse cfg { cfgModuleScope = True } vmodule
+
+parseProgram :: Layout -> Text -> Either ParseError (Program PName)
+parseProgram l = parseProgramWith defaultConfig { cfgLayout = l }
+
+parseExprWith :: Config -> Text -> Either ParseError (Expr PName)
+parseExprWith cfg = parse cfg { cfgModuleScope = False } expr
+
+parseExpr :: Text -> Either ParseError (Expr PName)
+parseExpr = parseExprWith defaultConfig
+
+parseDeclWith :: Config -> Text -> Either ParseError (Decl PName)
+parseDeclWith cfg = parse cfg { cfgModuleScope = False } decl
+
+parseDecl :: Text -> Either ParseError (Decl PName)
+parseDecl = parseDeclWith defaultConfig
+
+parseDeclsWith :: Config -> Text -> Either ParseError [Decl PName]
+parseDeclsWith cfg = parse cfg { cfgModuleScope = ms } decls'
+  where (ms, decls') = case cfgLayout cfg of
+                         Layout   -> (True, declsLayout)
+                         NoLayout -> (False, decls)
+
+parseDecls :: Text -> Either ParseError [Decl PName]
+parseDecls = parseDeclsWith defaultConfig
+
+parseLetDeclWith :: Config -> Text -> Either ParseError (Decl PName)
+parseLetDeclWith cfg = parse cfg { cfgModuleScope = False } letDecl
+
+parseLetDecl :: Text -> Either ParseError (Decl PName)
+parseLetDecl = parseLetDeclWith defaultConfig
+
+parseReplWith :: Config -> Text -> Either ParseError (ReplInput PName)
+parseReplWith cfg = parse cfg { cfgModuleScope = False } repl
+
+parseRepl :: Text -> Either ParseError (ReplInput PName)
+parseRepl = parseReplWith defaultConfig
+
+parseSchemaWith :: Config -> Text -> Either ParseError (Schema PName)
+parseSchemaWith cfg = parse cfg { cfgModuleScope = False } schema
+
+parseSchema :: Text -> Either ParseError (Schema PName)
+parseSchema = parseSchemaWith defaultConfig
+
+-- vim: ft=haskell
+{-# LINE 1 "templates/GenericTemplate.hs" #-}
+-- $Id: GenericTemplate.hs,v 1.26 2005/01/14 14:47:22 simonmar Exp $
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+data Happy_IntList = HappyCons Prelude.Int Happy_IntList
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+happyTrace string expr = Happy_System_IO_Unsafe.unsafePerformIO $ do
+    Happy_System_IO.hPutStr Happy_System_IO.stderr string
+    return expr
+
+
+
+
+infixr 9 `HappyStk`
+data HappyStk a = HappyStk a (HappyStk a)
+
+-----------------------------------------------------------------------------
+-- starting the parse
+
+happyParse start_state = happyNewToken start_state notHappyAtAll notHappyAtAll
+
+-----------------------------------------------------------------------------
+-- Accepting the parse
+
+-- If the current token is ERROR_TOK, it means we've just accepted a partial
+-- parse (a %partial parser).  We must ignore the saved token on the top of
+-- the stack in this case.
+happyAccept (0) tk st sts (_ `HappyStk` ans `HappyStk` _) =
+        happyReturn1 ans
+happyAccept j tk st sts (HappyStk ans _) = 
+         (happyReturn1 ans)
+
+-----------------------------------------------------------------------------
+-- Arrays only: do the next action
+
+
+
+happyDoAction i tk st
+        = (happyTrace ("state: " ++ show (st) ++ 
+                      ",\ttoken: " ++ show (i) ++
+                      ",\taction: ")) $
+          case action of
+                (0)           -> (happyTrace ("fail.\n")) $
+                                     happyFail (happyExpListPerState ((st) :: Prelude.Int)) i tk st
+                (-1)          -> (happyTrace ("accept.\n")) $
+                                     happyAccept i tk st
+                n | (n Prelude.< ((0) :: Prelude.Int)) -> (happyTrace ("reduce (rule " ++ show rule
+                                                               ++ ")")) $
+                                                   (happyReduceArr Happy_Data_Array.! rule) i tk st
+                                                   where rule = ((Prelude.negate ((n Prelude.+ ((1) :: Prelude.Int)))))
+                n                 -> (happyTrace ("shift, enter state "
+                                                 ++ show (new_state)
+                                                 ++ "\n")) $
+                                     happyShift new_state i tk st
+                                     where new_state = (n Prelude.- ((1) :: Prelude.Int))
+   where off    = happyAdjustOffset (indexShortOffAddr happyActOffsets st)
+         off_i  = (off Prelude.+ i)
+         check  = if (off_i Prelude.>= ((0) :: Prelude.Int))
+                  then (indexShortOffAddr happyCheck off_i Prelude.== i)
+                  else Prelude.False
+         action
+          | check     = indexShortOffAddr happyTable off_i
+          | Prelude.otherwise = indexShortOffAddr happyDefActions st
+
+
+
+
+
+
+
+
+
+
+
+
+indexShortOffAddr arr off = arr Happy_Data_Array.! off
+
+
+{-# INLINE happyLt #-}
+happyLt x y = (x Prelude.< y)
+
+
+
+
+
+
+readArrayBit arr bit =
+    Bits.testBit (indexShortOffAddr arr (bit `Prelude.div` 16)) (bit `Prelude.mod` 16)
+
+
+
+
+
+
+-----------------------------------------------------------------------------
+-- HappyState data type (not arrays)
+
+
+
+
+
+
+
+
+
+
+
+
+
+-----------------------------------------------------------------------------
+-- Shifting a token
+
+happyShift new_state (0) tk st sts stk@(x `HappyStk` _) =
+     let i = (case x of { HappyErrorToken (i) -> i }) in
+--     trace "shifting the error token" $
+     happyDoAction i tk new_state (HappyCons (st) (sts)) (stk)
+
+happyShift new_state i tk st sts stk =
+     happyNewToken new_state (HappyCons (st) (sts)) ((HappyTerminal (tk))`HappyStk`stk)
+
+-- happyReduce is specialised for the common cases.
+
+happySpecReduce_0 i fn (0) tk st sts stk
+     = happyFail [] (0) tk st sts stk
+happySpecReduce_0 nt fn j tk st@((action)) sts stk
+     = happyGoto nt j tk st (HappyCons (st) (sts)) (fn `HappyStk` stk)
+
+happySpecReduce_1 i fn (0) tk st sts stk
+     = happyFail [] (0) tk st sts stk
+happySpecReduce_1 nt fn j tk _ sts@((HappyCons (st@(action)) (_))) (v1`HappyStk`stk')
+     = let r = fn v1 in
+       happySeq r (happyGoto nt j tk st sts (r `HappyStk` stk'))
+
+happySpecReduce_2 i fn (0) tk st sts stk
+     = happyFail [] (0) tk st sts stk
+happySpecReduce_2 nt fn j tk _ (HappyCons (_) (sts@((HappyCons (st@(action)) (_))))) (v1`HappyStk`v2`HappyStk`stk')
+     = let r = fn v1 v2 in
+       happySeq r (happyGoto nt j tk st sts (r `HappyStk` stk'))
+
+happySpecReduce_3 i fn (0) tk st sts stk
+     = happyFail [] (0) tk st sts stk
+happySpecReduce_3 nt fn j tk _ (HappyCons (_) ((HappyCons (_) (sts@((HappyCons (st@(action)) (_))))))) (v1`HappyStk`v2`HappyStk`v3`HappyStk`stk')
+     = let r = fn v1 v2 v3 in
+       happySeq r (happyGoto nt j tk st sts (r `HappyStk` stk'))
+
+happyReduce k i fn (0) tk st sts stk
+     = happyFail [] (0) tk st sts stk
+happyReduce k nt fn j tk st sts stk
+     = case happyDrop (k Prelude.- ((1) :: Prelude.Int)) sts of
+         sts1@((HappyCons (st1@(action)) (_))) ->
+                let r = fn stk in  -- it doesn't hurt to always seq here...
+                happyDoSeq r (happyGoto nt j tk st1 sts1 r)
+
+happyMonadReduce k nt fn (0) tk st sts stk
+     = happyFail [] (0) tk st sts stk
+happyMonadReduce k nt fn j tk st sts stk =
+      case happyDrop k (HappyCons (st) (sts)) of
+        sts1@((HappyCons (st1@(action)) (_))) ->
+          let drop_stk = happyDropStk k stk in
+          happyThen1 (fn stk tk) (\r -> happyGoto nt j tk st1 sts1 (r `HappyStk` drop_stk))
+
+happyMonad2Reduce k nt fn (0) tk st sts stk
+     = happyFail [] (0) tk st sts stk
+happyMonad2Reduce k nt fn j tk st sts stk =
+      case happyDrop k (HappyCons (st) (sts)) of
+        sts1@((HappyCons (st1@(action)) (_))) ->
+         let drop_stk = happyDropStk k stk
+
+             off = happyAdjustOffset (indexShortOffAddr happyGotoOffsets st1)
+             off_i = (off Prelude.+ nt)
+             new_state = indexShortOffAddr happyTable off_i
+
+
+
+
+          in
+          happyThen1 (fn stk tk) (\r -> happyNewToken new_state sts1 (r `HappyStk` drop_stk))
+
+happyDrop (0) l = l
+happyDrop n (HappyCons (_) (t)) = happyDrop (n Prelude.- ((1) :: Prelude.Int)) t
+
+happyDropStk (0) l = l
+happyDropStk n (x `HappyStk` xs) = happyDropStk (n Prelude.- ((1)::Prelude.Int)) xs
+
+-----------------------------------------------------------------------------
+-- Moving to a new state after a reduction
+
+
+happyGoto nt j tk st = 
+   (happyTrace (", goto state " ++ show (new_state) ++ "\n")) $
+   happyDoAction j tk new_state
+   where off = happyAdjustOffset (indexShortOffAddr happyGotoOffsets st)
+         off_i = (off Prelude.+ nt)
+         new_state = indexShortOffAddr happyTable off_i
+
+
+
+
+-----------------------------------------------------------------------------
+-- Error recovery (ERROR_TOK is the error token)
+
+-- parse error if we are in recovery and we fail again
+happyFail explist (0) tk old_st _ stk@(x `HappyStk` _) =
+     let i = (case x of { HappyErrorToken (i) -> i }) in
+--      trace "failing" $ 
+        happyError_ explist i tk
+
+{-  We don't need state discarding for our restricted implementation of
+    "error".  In fact, it can cause some bogus parses, so I've disabled it
+    for now --SDM
+
+-- discard a state
+happyFail  ERROR_TOK tk old_st CONS(HAPPYSTATE(action),sts) 
+                                                (saved_tok `HappyStk` _ `HappyStk` stk) =
+--      trace ("discarding state, depth " ++ show (length stk))  $
+        DO_ACTION(action,ERROR_TOK,tk,sts,(saved_tok`HappyStk`stk))
+-}
+
+-- Enter error recovery: generate an error token,
+--                       save the old token and carry on.
+happyFail explist i tk (action) sts stk =
+--      trace "entering error recovery" $
+        happyDoAction (0) tk action sts ((HappyErrorToken (i)) `HappyStk` stk)
+
+-- Internal happy errors:
+
+notHappyAtAll :: a
+notHappyAtAll = Prelude.error "Internal Happy error\n"
+
+-----------------------------------------------------------------------------
+-- Hack to get the typechecker to accept our action functions
+
+
+
+
+
+
+
+-----------------------------------------------------------------------------
+-- Seq-ing.  If the --strict flag is given, then Happy emits 
+--      happySeq = happyDoSeq
+-- otherwise it emits
+--      happySeq = happyDontSeq
+
+happyDoSeq, happyDontSeq :: a -> b -> b
+happyDoSeq   a b = a `Prelude.seq` b
+happyDontSeq a b = b
+
+-----------------------------------------------------------------------------
+-- Don't inline any functions from the template.  GHC has a nasty habit
+-- of deciding to inline happyGoto everywhere, which increases the size of
+-- the generated parser quite a bit.
+
+
+{-# NOINLINE happyDoAction #-}
+{-# NOINLINE happyTable #-}
+{-# NOINLINE happyCheck #-}
+{-# NOINLINE happyActOffsets #-}
+{-# NOINLINE happyGotoOffsets #-}
+{-# NOINLINE happyDefActions #-}
+
+{-# NOINLINE happyShift #-}
+{-# NOINLINE happySpecReduce_0 #-}
+{-# NOINLINE happySpecReduce_1 #-}
+{-# NOINLINE happySpecReduce_2 #-}
+{-# NOINLINE happySpecReduce_3 #-}
+{-# NOINLINE happyReduce #-}
+{-# NOINLINE happyMonadReduce #-}
+{-# NOINLINE happyGoto #-}
+{-# NOINLINE happyFail #-}
+
+-- end of Happy Template.
diff --git a/src/Cryptol/Parser.y b/src/Cryptol/Parser.y
index 00a184547..bae21027f 100644
--- a/src/Cryptol/Parser.y
+++ b/src/Cryptol/Parser.y
@@ -91,6 +91,8 @@ import Paths_cryptol
   'primitive' { Located $$ (Token (KW KW_primitive) _)}
   'constraint'{ Located $$ (Token (KW KW_constraint) _)}
   'Prop'      { Located $$ (Token (KW KW_Prop) _)}
+  
+  'propguards' { Located $$ (Token (KW KW_propguards) _) }
 
   '['         { Located $$ (Token (Sym BracketL) _)}
   ']'         { Located $$ (Token (Sym BracketR) _)}
@@ -298,11 +300,30 @@ mbDoc                   :: { Maybe (Located Text) }
   : doc                    { Just $1 }
   | {- empty -}            { Nothing }
 
+propguards :: { [([Prop PName], Expr PName)] }
+  : 'propguards' propguards_cases { $2 }
+
+propguards_cases :: { [([Prop PName], Expr PName)] }
+  -- : propguards_case '|' propguards_cases { $1 ++ $3 }
+  -- | propguards_case { $1 }
+  : '|' propguards_case { $2 }
+  
+propguards_case :: { [([Prop PName], Expr PName)] }
+  : propguards_quals '=>' expr { [($1, $3)] }
+
+-- support multiple
+propguards_quals :: { [Prop PName] }
+  -- : type { [_ $1] }
+  : type {% fmap thing (mkProp $1) }
+
+-- propguards_qual : { [Prop PName] } -- TODO
 
 decl                    :: { Decl PName }
   : vars_comma ':' schema  { at (head $1,$3) $ DSignature (reverse $1) $3   }
   | ipat '=' expr          { at ($1,$3) $ DPatBind $1 $3                    }
   | '(' op ')' '=' expr    { at ($1,$5) $ DPatBind (PVar $2) $5             }
+  | var apats_indices '=' propguards
+                           { mkIndexedPropGuardsDecl $1 $2 $4 }
   | var apats_indices '=' expr
                            { at ($1,$4) $ mkIndexedDecl $1 $2 $4 }
 
diff --git a/src/Cryptol/Parser/AST.hs b/src/Cryptol/Parser/AST.hs
index 70db2d48b..2af6a56d5 100644
--- a/src/Cryptol/Parser/AST.hs
+++ b/src/Cryptol/Parser/AST.hs
@@ -715,6 +715,7 @@ instance (Show name, PPName name) => PP (Bind name) where
 instance (Show name, PPName name) => PP (BindDef name) where
   ppPrec _ DPrim     = text "<primitive>"
   ppPrec p (DExpr e) = ppPrec p e
+  ppPrec _p (DPropGuards _guards) = text "propguards"
 
 
 instance PPName name => PP (TySyn name) where
diff --git a/src/Cryptol/Parser/ExpandPropGuards.hs b/src/Cryptol/Parser/ExpandPropGuards.hs
index f2aa43ac7..84fef4c8d 100644
--- a/src/Cryptol/Parser/ExpandPropGuards.hs
+++ b/src/Cryptol/Parser/ExpandPropGuards.hs
@@ -44,9 +44,13 @@ runExpandPropGuardsM m = m
 class ExpandPropGuards a where
   expandPropGuards :: a -> ExpandPropGuardsM a
 
+-- | Error
 data Error = NoSignature (Located PName)
   deriving (Show,Generic, NFData)
 
+instance PP Error where
+  ppPrec = undefined -- TODO
+
 -- | Instances
 
 instance ExpandPropGuards (Program PName) where
diff --git a/src/Cryptol/Parser/Lexer.x b/src/Cryptol/Parser/Lexer.x
index 0f76c62ae..10c550568 100644
--- a/src/Cryptol/Parser/Lexer.x
+++ b/src/Cryptol/Parser/Lexer.x
@@ -129,6 +129,8 @@ $white+                   { emit $ White Space }
 
 "Prop"                    { emit $ KW KW_Prop }
 
+"propguards"              { emit $ KW KW_propguards }
+
 @num                      { emitS numToken }
 @fnum                     { emitFancy fnumTokens }
 
diff --git a/src/Cryptol/Parser/Names.hs b/src/Cryptol/Parser/Names.hs
index 06027391b..43bb898dc 100644
--- a/src/Cryptol/Parser/Names.hs
+++ b/src/Cryptol/Parser/Names.hs
@@ -64,6 +64,7 @@ namesB b =
 namesDef :: Ord name => BindDef name -> Set name
 namesDef DPrim     = Set.empty
 namesDef (DExpr e) = namesE e
+namesDef (DPropGuards guards) = mconcat . fmap (\(_props, e) -> namesE e) $ guards
 
 
 -- | The names used by an expression.
@@ -185,6 +186,7 @@ tnamesB b = Set.unions [setS, setP, setE]
 tnamesDef :: Ord name => BindDef name -> Set name
 tnamesDef DPrim     = Set.empty
 tnamesDef (DExpr e) = tnamesE e
+tnamesDef (DPropGuards guards) = mconcat . fmap (\(_props, e) -> tnamesE e) $ guards
 
 -- | The type names used by an expression.
 tnamesE :: Ord name => Expr name -> Set name
diff --git a/src/Cryptol/Parser/NoPat.hs b/src/Cryptol/Parser/NoPat.hs
index 5d04ddd46..1978bcb19 100644
--- a/src/Cryptol/Parser/NoPat.hs
+++ b/src/Cryptol/Parser/NoPat.hs
@@ -224,6 +224,10 @@ noMatchB b =
       do e' <- noPatFun (Just (thing (bName b))) 0 (bParams b) e
          return b { bParams = [], bDef = DExpr e' <$ bDef b }
 
+    DPropGuards guards -> do
+      guards' <- (\(props, e) -> (,) <$> pure props <*> noPatFun (Just (thing (bName b))) 0 (bParams b) e) `traverse` guards
+      pure b { bParams = [], bDef = DPropGuards guards' <$ bDef b }
+
 noMatchD :: Decl PName -> NoPatM [Decl PName]
 noMatchD decl =
   case decl of
diff --git a/src/Cryptol/Parser/ParserUtils.hs b/src/Cryptol/Parser/ParserUtils.hs
index 5c910f8b8..0548f3b07 100644
--- a/src/Cryptol/Parser/ParserUtils.hs
+++ b/src/Cryptol/Parser/ParserUtils.hs
@@ -609,6 +609,27 @@ mkIndexedDecl f (ps, ixs) e =
     rhs :: Expr PName
     rhs = mkGenerate (reverse ixs) e
 
+-- NOTE: The lists of patterns are reversed!
+mkIndexedPropGuardsDecl ::
+  LPName -> ([Pattern PName], [Pattern PName]) -> [([Prop PName], Expr PName)] -> Decl PName
+mkIndexedPropGuardsDecl f (ps, ixs) guards =
+  DBind Bind { bName       = f
+             , bParams     = reverse ps
+               -- TODO: add range properly
+             , bDef        = Located emptyRange (DPropGuards guards')
+             , bSignature  = Nothing
+             , bPragmas    = []
+             , bMono       = False
+             , bInfix      = False
+             , bFixity     = Nothing
+             , bDoc        = Nothing
+             , bExport     = Public
+             }
+  where
+    -- TODO: need to do anything to `props`?
+    -- guards' :: [([Prop name], Expr name)]
+    guards' = (\(props, e) -> (props, mkGenerate (reverse ixs) e)) <$> guards
+
 -- NOTE: The lists of patterns are reversed!
 mkIndexedExpr :: ([Pattern PName], [Pattern PName]) -> Expr PName -> Expr PName
 mkIndexedExpr (ps, ixs) body
diff --git a/src/Cryptol/Parser/Token.hs b/src/Cryptol/Parser/Token.hs
index c1ec16903..fb1506f5b 100644
--- a/src/Cryptol/Parser/Token.hs
+++ b/src/Cryptol/Parser/Token.hs
@@ -53,6 +53,7 @@ data TokenKW  = KW_else
               | KW_Prop
               | KW_by
               | KW_down
+              | KW_propguards
                 deriving (Eq, Show, Generic, NFData)
 
 -- | The named operators are a special case for parsing types, and 'Other' is
diff --git a/src/Cryptol/Transform/AddModParams.hs b/src/Cryptol/Transform/AddModParams.hs
index 22575c6d3..caf2ae6cf 100644
--- a/src/Cryptol/Transform/AddModParams.hs
+++ b/src/Cryptol/Transform/AddModParams.hs
@@ -257,6 +257,7 @@ instance Inst Expr where
          _ -> EProofApp (inst ps e1)
 
      EWhere e dgs  -> EWhere (inst ps e) (inst ps dgs)
+     EPropGuards _guards -> error "undefined: inst ps (EPropGuards _guards)"
 
 
 instance Inst Match where
diff --git a/src/Cryptol/Transform/MonoValues.hs b/src/Cryptol/Transform/MonoValues.hs
index baf4e80e1..75c6029a1 100644
--- a/src/Cryptol/Transform/MonoValues.hs
+++ b/src/Cryptol/Transform/MonoValues.hs
@@ -201,6 +201,8 @@ rewE rews = go
       EWhere e dgs    -> EWhere      <$> go e <*> inLocal
                                                   (mapM (rewDeclGroup rews) dgs)
 
+      EPropGuards guards -> EPropGuards <$> (\(props, e) -> (,) <$> pure props <*> go e) `traverse` guards
+
 
 rewM :: RewMap -> Match -> M Match
 rewM rews ma =
diff --git a/src/Cryptol/Transform/Specialize.hs b/src/Cryptol/Transform/Specialize.hs
index f71fb2f60..9c678bc29 100644
--- a/src/Cryptol/Transform/Specialize.hs
+++ b/src/Cryptol/Transform/Specialize.hs
@@ -102,6 +102,7 @@ specializeExpr expr =
     EProofAbs p e -> EProofAbs p <$> specializeExpr e
     EProofApp {}  -> specializeConst expr
     EWhere e dgs  -> specializeEWhere e dgs
+    EPropGuards guards -> EPropGuards <$> (\(props, e) -> (,) <$> pure props <*> specializeExpr e) `traverse` guards
 
 specializeMatch :: Match -> SpecM Match
 specializeMatch (From qn l t e) = From qn l t <$> specializeExpr e
diff --git a/src/Cryptol/TypeCheck/AST.hs b/src/Cryptol/TypeCheck/AST.hs
index eda6f75b9..0ba1498ba 100644
--- a/src/Cryptol/TypeCheck/AST.hs
+++ b/src/Cryptol/TypeCheck/AST.hs
@@ -267,6 +267,8 @@ instance PP (WithNames Expr) where
                          [ ppW e
                          , hang "where" 2 (vcat (map ppW ds))
                          ]
+      
+      EPropGuards _guards -> undefined -- TODO
 
     where
     ppW x   = ppWithNames nm x
diff --git a/src/Cryptol/TypeCheck/Kind.hs b/src/Cryptol/TypeCheck/Kind.hs
index 7aaa9c897..75d268dcd 100644
--- a/src/Cryptol/TypeCheck/Kind.hs
+++ b/src/Cryptol/TypeCheck/Kind.hs
@@ -417,5 +417,7 @@ checkKind t _ _ = return t
 checkPropGuard :: P.Prop Name -> InferM (Prop, [Goal])
 checkPropGuard p =
   collectGoals $
-  (undefined :: KindM Type -> InferM Type) $ -- TODO
-  checkProp p
+  undefined
+  -- withTParams _ _ _ 
+  -- (undefined :: KindM Type -> InferM Type) $ -- TODO
+  -- checkProp p
diff --git a/src/Cryptol/TypeCheck/Parseable.hs b/src/Cryptol/TypeCheck/Parseable.hs
index 86f72f06b..4237df017 100644
--- a/src/Cryptol/TypeCheck/Parseable.hs
+++ b/src/Cryptol/TypeCheck/Parseable.hs
@@ -63,6 +63,7 @@ instance ShowParseable Expr where
   --NOTE: erase all "proofs" for now (change the following two lines to change that)
   showParseable (EProofAbs {-p-}_ e) = showParseable e --"(EProofAbs " ++ show p ++ showParseable e ++ ")"
   showParseable (EProofApp e) = showParseable e --"(EProofApp " ++ showParseable e ++ ")"
+  showParseable (EPropGuards _guards) = error "undefined: showParseable (EPropGuards _guards)"
 
 instance (ShowParseable a, ShowParseable b) => ShowParseable (a,b) where
   showParseable (x,y) = parens (showParseable x <> comma <> showParseable y)
diff --git a/src/Cryptol/TypeCheck/Sanity.hs b/src/Cryptol/TypeCheck/Sanity.hs
index fc995288d..c93131e95 100644
--- a/src/Cryptol/TypeCheck/Sanity.hs
+++ b/src/Cryptol/TypeCheck/Sanity.hs
@@ -269,6 +269,9 @@ exprSchema expr =
                            withVars xs (go ds)
       in go dgs
 
+    
+    EPropGuards _guards -> error "undefined: exprSchema (EPropGuards _guards)"
+
 
 checkHas :: Type -> Selector -> TcM Type
 checkHas t sel =
diff --git a/src/Cryptol/TypeCheck/Subst.hs b/src/Cryptol/TypeCheck/Subst.hs
index 474c537a8..8d81560e9 100644
--- a/src/Cryptol/TypeCheck/Subst.hs
+++ b/src/Cryptol/TypeCheck/Subst.hs
@@ -391,6 +391,8 @@ instance TVars Expr where
 
         EWhere e ds   -> EWhere !$ (go e) !$ (apSubst su ds)
 
+        EPropGuards guards -> EPropGuards !$ (\(props, e) -> (apSubst su `fmap'` props, apSubst su e)) `fmap'` guards
+
 instance TVars Match where
   apSubst su (From x len t e) = From x !$ (apSubst su len) !$ (apSubst su t) !$ (apSubst su e)
   apSubst su (Let b)      = Let !$ (apSubst su b)
diff --git a/src/Cryptol/TypeCheck/TypeOf.hs b/src/Cryptol/TypeCheck/TypeOf.hs
index b20748ebc..acb53f66f 100644
--- a/src/Cryptol/TypeCheck/TypeOf.hs
+++ b/src/Cryptol/TypeCheck/TypeOf.hs
@@ -43,6 +43,9 @@ fastTypeOf tyenv expr =
                         Just (_, t) -> t
                         Nothing     -> panic "Cryptol.TypeCheck.TypeOf.fastTypeOf"
                                          [ "EApp with non-function operator" ]
+    EPropGuards guards -> case guards of 
+      ((_props, e):_) -> fastTypeOf tyenv e
+      [] -> error "fastTypOf empty EPropGuards"
     -- Polymorphic fragment
     EVar      {}  -> polymorphic
     ETAbs     {}  -> polymorphic
@@ -111,6 +114,9 @@ fastSchemaOf tyenv expr =
     EComp  {}      -> monomorphic
     EApp   {}      -> monomorphic
     EAbs   {}      -> monomorphic
+    
+    -- PropGuards
+    EPropGuards _guards -> undefined -- TODO
   where
     monomorphic = Forall [] [] (fastTypeOf tyenv expr)
 

From 72cccb10ad07727a17ecc59db862e86a02ed440a Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Thu, 7 Jul 2022 15:48:02 -0700
Subject: [PATCH 010/125] parsing

---
 src/Cryptol/Parser.hs     | 2972 +++++++++++++++++++------------------
 src/Cryptol/Parser.y      |   15 +-
 src/Cryptol/Parser/AST.hs |    3 +
 3 files changed, 1516 insertions(+), 1474 deletions(-)

diff --git a/src/Cryptol/Parser.hs b/src/Cryptol/Parser.hs
index 307460339..d64d83a15 100644
--- a/src/Cryptol/Parser.hs
+++ b/src/Cryptol/Parser.hs
@@ -69,93 +69,94 @@ data HappyAbsSyn
 	| HappyAbsSyn35 (Located Text)
 	| HappyAbsSyn36 (Maybe (Located Text))
 	| HappyAbsSyn37 ([([Prop PName], Expr PName)])
-	| HappyAbsSyn38 (Decl PName)
-	| HappyAbsSyn39 ([Decl PName])
-	| HappyAbsSyn41 (Newtype PName)
-	| HappyAbsSyn42 (Located (RecordMap Ident (Range, Type PName)))
-	| HappyAbsSyn43 ([ LPName ])
-	| HappyAbsSyn44 (LPName)
-	| HappyAbsSyn45 ([Pattern PName])
-	| HappyAbsSyn48 (([Pattern PName], [Pattern PName]))
-	| HappyAbsSyn53 (ReplInput PName)
-	| HappyAbsSyn58 ([LPName])
-	| HappyAbsSyn59 (Expr PName)
-	| HappyAbsSyn61 (Located [Decl PName])
-	| HappyAbsSyn65 ([(Expr PName, Expr PName)])
-	| HappyAbsSyn66 ((Expr PName, Expr PName))
-	| HappyAbsSyn71 (NonEmpty (Expr PName))
-	| HappyAbsSyn75 (Located Selector)
-	| HappyAbsSyn76 ([(Bool, Integer)])
-	| HappyAbsSyn77 ((Bool, Integer))
-	| HappyAbsSyn78 ([Expr PName])
-	| HappyAbsSyn79 (Either (Expr PName) [Named (Expr PName)])
-	| HappyAbsSyn80 ([UpdField PName])
-	| HappyAbsSyn81 (UpdField PName)
-	| HappyAbsSyn82 ([Located Selector])
-	| HappyAbsSyn83 (UpdHow)
-	| HappyAbsSyn85 ([[Match PName]])
-	| HappyAbsSyn86 ([Match PName])
-	| HappyAbsSyn87 (Match PName)
-	| HappyAbsSyn88 (Pattern PName)
-	| HappyAbsSyn92 (Named (Pattern PName))
-	| HappyAbsSyn93 ([Named (Pattern PName)])
-	| HappyAbsSyn94 (Schema PName)
-	| HappyAbsSyn95 (Located [TParam PName])
-	| HappyAbsSyn96 (Located [Prop PName])
-	| HappyAbsSyn98 (Located Kind)
-	| HappyAbsSyn99 (TParam PName)
-	| HappyAbsSyn100 ([TParam PName])
-	| HappyAbsSyn103 (Type PName)
-	| HappyAbsSyn107 ([ Type PName ])
-	| HappyAbsSyn108 (Located [Type PName])
-	| HappyAbsSyn109 ([Type PName])
-	| HappyAbsSyn110 (Named (Type PName))
-	| HappyAbsSyn111 ([Named (Type PName)])
-	| HappyAbsSyn112 (Located Ident)
-	| HappyAbsSyn114 (Located ModName)
-	| HappyAbsSyn116 (Located PName)
+	| HappyAbsSyn40 ([Prop PName])
+	| HappyAbsSyn41 (Decl PName)
+	| HappyAbsSyn42 ([Decl PName])
+	| HappyAbsSyn44 (Newtype PName)
+	| HappyAbsSyn45 (Located (RecordMap Ident (Range, Type PName)))
+	| HappyAbsSyn46 ([ LPName ])
+	| HappyAbsSyn47 (LPName)
+	| HappyAbsSyn48 ([Pattern PName])
+	| HappyAbsSyn51 (([Pattern PName], [Pattern PName]))
+	| HappyAbsSyn56 (ReplInput PName)
+	| HappyAbsSyn61 ([LPName])
+	| HappyAbsSyn62 (Expr PName)
+	| HappyAbsSyn64 (Located [Decl PName])
+	| HappyAbsSyn68 ([(Expr PName, Expr PName)])
+	| HappyAbsSyn69 ((Expr PName, Expr PName))
+	| HappyAbsSyn74 (NonEmpty (Expr PName))
+	| HappyAbsSyn78 (Located Selector)
+	| HappyAbsSyn79 ([(Bool, Integer)])
+	| HappyAbsSyn80 ((Bool, Integer))
+	| HappyAbsSyn81 ([Expr PName])
+	| HappyAbsSyn82 (Either (Expr PName) [Named (Expr PName)])
+	| HappyAbsSyn83 ([UpdField PName])
+	| HappyAbsSyn84 (UpdField PName)
+	| HappyAbsSyn85 ([Located Selector])
+	| HappyAbsSyn86 (UpdHow)
+	| HappyAbsSyn88 ([[Match PName]])
+	| HappyAbsSyn89 ([Match PName])
+	| HappyAbsSyn90 (Match PName)
+	| HappyAbsSyn91 (Pattern PName)
+	| HappyAbsSyn95 (Named (Pattern PName))
+	| HappyAbsSyn96 ([Named (Pattern PName)])
+	| HappyAbsSyn97 (Schema PName)
+	| HappyAbsSyn98 (Located [TParam PName])
+	| HappyAbsSyn99 (Located [Prop PName])
+	| HappyAbsSyn101 (Located Kind)
+	| HappyAbsSyn102 (TParam PName)
+	| HappyAbsSyn103 ([TParam PName])
+	| HappyAbsSyn106 (Type PName)
+	| HappyAbsSyn110 ([ Type PName ])
+	| HappyAbsSyn111 (Located [Type PName])
+	| HappyAbsSyn112 ([Type PName])
+	| HappyAbsSyn113 (Named (Type PName))
+	| HappyAbsSyn114 ([Named (Type PName)])
+	| HappyAbsSyn115 (Located Ident)
+	| HappyAbsSyn117 (Located ModName)
+	| HappyAbsSyn119 (Located PName)
 
 happyExpList :: Happy_Data_Array.Array Prelude.Int Prelude.Int
-happyExpList = Happy_Data_Array.listArray (0,3774) ([0,0,0,0,0,0,0,0,2048,0,0,4,1,0,0,0,0,0,0,36864,974,516,136,16386,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,16128,32782,516,4744,771,1,0,0,0,0,0,0,4096,974,516,136,2,1,0,0,0,0,0,0,4096,974,516,136,2,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,17344,0,0,0,0,0,0,0,0,0,0,16128,50126,516,4744,771,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,12288,14,4,4096,0,0,0,0,0,0,0,0,12288,14,4,14,16352,0,0,0,0,0,0,0,0,2048,0,0,0,0,0,0,0,0,0,0,12288,14,4,4096,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,16352,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,12288,14,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,32768,0,0,0,0,0,0,0,0,0,0,0,16390,8160,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,14592,14,516,158,16354,0,0,0,0,0,0,0,4096,14,4,256,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,64,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8198,16352,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,32768,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16128,14,516,4744,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16384,0,0,0,0,0,0,0,0,0,0,0,16384,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,256,0,0,0,0,0,0,0,0,0,0,0,256,0,0,0,0,0,0,0,0,0,0,0,256,0,0,0,0,0,0,0,0,0,0,0,4096,14,68,8,0,0,0,0,0,0,0,0,4096,14,516,136,2,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,16128,32782,1540,4744,771,0,0,0,0,0,0,0,16128,32782,516,4766,16355,0,0,0,0,0,0,0,16128,14,516,5000,2,0,0,0,0,0,0,0,256,0,4,1024,0,0,0,0,0,0,0,0,12544,14,4,136,0,0,0,0,0,0,0,0,4096,14,516,136,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16128,32782,516,4744,3,0,0,0,0,0,0,0,16128,32782,516,4744,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,4096,974,516,136,10,0,0,0,0,0,0,0,0,0,0,64,0,0,0,0,0,0,0,0,0,0,0,8224,0,0,0,0,0,0,0,0,4096,14,516,136,2050,1,0,0,0,0,0,0,4096,974,516,136,2,0,0,0,0,0,0,0,0,0,0,2048,1024,0,0,0,0,0,0,0,0,0,0,6,5088,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,256,0,0,0,0,0,0,0,0,0,0,0,256,0,0,0,0,0,0,0,0,0,0,0,256,0,0,0,0,0,0,0,0,0,0,0,4096,14,68,8,0,0,0,0,0,0,0,0,4096,14,1540,136,2,0,0,0,0,0,0,0,4096,14,516,158,8162,0,0,0,0,0,0,0,4096,14,4,256,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,4096,991,516,136,16394,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,36864,974,516,136,16386,0,0,0,0,0,0,0,0,0,0,64,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,32,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1024,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,4096,991,516,136,16386,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,64,16,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,4096,990,516,136,2,0,0,0,0,0,0,0,32768,5152,32,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,12288,4110,4,4096,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4096,526,4,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,64,0,0,0,0,0,0,0,0,0,0,0,64,24,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,128,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,288,0,0,0,0,0,0,0,0,0,0,0,2048,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16,0,0,0,0,0,0,0,0,0,0,0,48,0,0,0,0,0,0,0,0,0,0,0,8192,1024,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,48,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4096,14,516,152,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1024,32,0,0,0,0,0,0,0,0,0,0,1024,32,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,8160,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4096,14,4,2056,0,0,0,0,0,0,0,0,4096,14,4,8,0,0,0,0,0,0,0,0,4096,14,4,0,0,0,0,0,0,0,0,0,0,0,0,6,8160,0,0,0,0,0,0,0,0,0,0,6,8160,0,0,0,0,0,0,0,0,0,0,6,8160,0,0,0,0,0,0,0,4096,14,516,136,2,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,4096,14,516,136,2,0,0,0,0,0,0,0,0,0,0,64,0,0,0,0,0,0,0,0,4096,14,516,136,2050,0,0,0,0,0,0,0,0,0,0,2048,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4096,14,516,136,2,0,0,0,0,0,0,0,4096,14,4,8,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,64,24,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,32768,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,32768,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4096,14,516,16520,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,14592,14,516,392,2,0,0,0,0,0,0,0,0,0,0,1024,32,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,128,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,256,0,0,0,0,0,0,0,0,0,0,0,32,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4096,14,516,136,2050,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16,0,0,0,0,0,0,0,0,0,8192,0,48,0,0,0,0,0,0,0,0,0,0,0,48,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16128,32782,516,4744,3,0,0,0,0,0,0,0,16128,32782,516,4744,3,0,0,0,0,0,0,0,0,8192,61440,33,0,0,0,0,0,0,0,0,0,0,0,32,0,0,0,0,0,0,0,0,0,0,1024,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8192,1,0,0,0,0,0,0,0,0,0,0,0,2,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8224,0,0,0,0,0,0,0,0,4096,14,516,136,2050,0,0,0,0,0,0,0,0,0,0,2048,1024,0,0,0,0,0,0,0,0,0,0,6,5088,0,0,0,0,0,0,0,4096,14,516,158,8162,0,0,0,0,0,0,0,0,0,0,6,8160,0,0,0,0,0,0,0,4096,14,4,2056,0,0,0,0,0,0,0,0,4096,14,4,8,0,0,0,0,0,0,0,0,0,0,0,6,8160,0,0,0,0,0,0,0,0,0,0,6,8160,0,0,0,0,0,0,0,0,0,0,6,8160,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,0,17344,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,288,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,288,0,0,0,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16,0,0,0,0,0,0,0,0,0,0,0,48,0,0,0,0,0,0,0,0,0,0,0,48,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4096,14,4,256,0,0,0,0,0,0,0,0,0,0,1024,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,32768,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,0,0,0,32768,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8192,0,2048,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,12288,14,4,4096,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,32768,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1024,0,0,0,0,0,0,0,0,0,0,0,1024,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14592,14,644,136,1090,0,0,0,0,0,0,0,4096,14,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4096,14,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,32,0,0,0,0,0,0,0,0,0,0,0,32,0,0,0,0,0,0,0,0,0,0,0,32,0,0,0,0,0,0,0,0,0,0,0,6,8160,0,0,0,0,0,0,0,4096,14,4,2056,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4096,14,4,2056,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,4096,14,4,8,0,0,0,0,0,0,0,0,0,0,0,16,0,0,0,0,0,0,0,0,4096,14,516,136,2,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,0,0,0,2048,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,16128,32782,516,4750,771,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,4096,14,516,136,2,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16128,14,516,4744,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,18432,0,0,0,0,0,0,0,0,16128,14,516,4744,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16128,14,516,4744,2,0,0,0,0,0,0,0,256,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,256,0,4,0,0,0,0,0,0,0,0,0,0,0,0,288,0,0,0,0,0,0,0,0,0,0,0,288,0,0,0,0,0,0,0,0,0,0,0,2048,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,288,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16128,32782,516,4744,771,1,0,0,0,0,0,0,4096,974,516,136,2,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,4096,974,516,136,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,8160,0,0,0,0,0,0,0,0,0,0,0,2048,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16128,32782,772,4744,771,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4096,14,516,136,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1024,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,0,0,0,2048,0,0,0,0,0,0,0,0,0,0,0,32,0,0,0,0,0,0,0,0,0,0,0,32,0,0,0,0,0,0,0,0,0,0,0,32,0,0,0,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,0,6,8160,0,0,0,0,0,0,0,4096,14,4,2056,0,0,0,0,0,0,0,0,4096,14,4,2056,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,4096,14,4,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4096,14,516,136,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4096,14,516,136,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2048,0,0,0,0,0,0,0,0,4096,14,516,136,2,0,0,0,0,0,0,0,4096,14,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,4096,974,516,392,2,1,0,0,0,0,0,0,4096,974,516,136,10,1,0,0,0,0,0,0,4096,991,516,136,16386,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,4096,991,516,136,16386,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,0,0,0,6,8160,0,0,0,0,0,0,0,0,0,0,0,16384,1,0,0,0,0,0,0,4096,991,516,136,16386,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,12288,14,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1024,0,0,0,0,0,0,0,0,0,0,0,4096,14,4,0,0,0,0,0,0,0,0,0,12288,14,4,0,0,0,0,0,0,0,0,0,12288,14,4,4096,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16384,1,0,0,0,0,0,0,4096,991,516,136,16386,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4096,14,4,2056,0,0,0,0,0,0,0,0,4096,14,516,2184,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,12288,14,4,4096,0,0,0,0,0,0,0,0,0,0,0,64,24,0,0,0,0,0,0,0,0,0,0,64,24,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4096,526,4,0,0,0,0,0,0,0,0,0,0,0,0,16,0,0,0,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,64,24,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,4096,974,516,392,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2048,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,4096,14,4,2056,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,4096,14,4,8,0,0,0,0,0,0,0,0,0,0,128,0,1088,0,0,0,0,0,0,0,0,0,0,6,8160,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,0,0,0,0,2048,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4096,14,516,136,2,0,0,0,0,0,0,0,0,0,0,16,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4096,14,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,32,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,32,0,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,0,8192,12288,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,32,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2048,0,0,0,0,0,0,0,0,0,0,8192,8,0,0,0,0,0,0,0,0,0,0,8192,16,0,0,0,0,0,0,0,0,0,0,8192,24,0,0,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,0,0,0,2048,0,0,0,0,0,0,0,0,0,0,0,2048,0,0,0,0,0,0,0,0,0,0,0,2048,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,4096,14,4,2056,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,4096,14,4,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16384,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8192,0,0,0,1,0,0,0,0,0,0,4096,991,516,136,16386,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,128,0,1088,0,0,0,0,0,0,0,0,0,128,0,1088,0,0,0,0,0,0,0,0,0,0,2048,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,0,8192,8,0,0,0,0,0,0,0,0,0,0,8192,16,0,0,0,0,0,0,0,0,0,0,0,16,0,0,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,0,0,16,0,0,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,4096,14,516,136,2,0,0,0,0,0,0,0,4096,14,516,136,2,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2048,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16400,0,0,0,0,0,0,0,0,0,0,0,2048,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,128,0,1088,0,0,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,4096,14,68,0,0,0,0,0,0,0,0,0,0,0,0,0,16384,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16384,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4096,14,516,2184,2,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,4096,14,4,2056,0,0,0,0,0,0,0,0,0,0,0,128,0,0,0,0,0,0,0,0,0,0,0,64,24,0,0,0,0,0,0,0,0,0,0,64,24,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4096,14,4,256,0,0,0,0,0,0,0,0,0,0,0,128,0,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,4096,14,4,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,0,0,0,16384,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,0,0,0,32,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,0,0,16,0,0,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,0,0,0,16384,0,1,0,0,0,0,0,0,4096,991,516,136,16386,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,128,0,1088,0,0,0,0,0,0,0,0,0,0,48,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,288,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4096,14,4,8,0,0,0,0,0,0,0,0,0,0,0,16384,0,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
+happyExpList = Happy_Data_Array.listArray (0,3796) ([0,0,0,0,0,0,0,0,16384,0,0,32,8,0,0,0,0,0,0,0,62372,33024,8704,128,16,0,0,0,0,0,0,0,0,0,0,2048,0,0,0,0,0,0,0,0,58352,18432,32800,12584,4144,0,0,0,0,0,0,0,2048,487,258,68,32769,0,0,0,0,0,0,0,16384,3896,2064,544,8,0,0,0,0,0,0,0,0,0,0,0,128,0,0,0,0,0,0,0,0,49152,67,0,0,0,0,0,0,0,0,0,0,29176,9758,16400,6292,24,0,0,0,0,0,0,0,36416,3,129,32802,0,0,0,0,0,0,0,0,24576,28,8,8192,0,0,0,0,0,0,0,0,0,227,64,224,65024,3,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,14528,4096,0,64,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,49152,0,2044,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1816,512,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,50976,32769,64,16401,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,32,0,0,0,0,0,0,0,0,0,0,3072,49280,63,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,58368,56,2064,544,8,0,0,0,0,0,0,0,8192,455,16512,4352,64,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,36416,3,129,32802,0,0,0,0,0,0,0,0,29184,28,1032,316,32708,0,0,0,0,0,0,0,0,225,64,4096,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,24576,512,1022,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,128,0,256,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,36800,3,129,33954,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,32,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,16,0,0,0,0,0,0,0,0,0,0,0,128,0,0,0,0,0,0,0,0,0,0,0,16384,56,272,32,0,0,0,0,0,0,0,0,0,450,16512,4352,64,0,0,0,0,0,0,0,0,3647,1152,34818,786,3,0,0,0,0,0,0,0,29176,9216,16432,6292,24,0,0,0,0,0,0,0,36800,8195,32897,50343,4088,0,0,0,0,0,0,0,32256,28,1032,10000,4,0,0,0,0,0,0,0,4096,0,64,16384,0,0,0,0,0,0,0,0,32768,1816,512,17408,0,0,0,0,0,0,0,0,0,14400,4096,8200,2050,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16128,32782,516,4744,3,0,0,0,0,0,0,0,63488,113,4132,37952,24,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,512,0,0,0,0,0,0,0,57600,16444,32800,40968,0,0,0,0,0,0,0,0,0,0,0,32,0,0,0,0,0,0,0,0,0,0,0,32896,0,0,0,0,0,0,0,0,0,450,16512,4352,64,33,0,0,0,0,0,0,0,52752,1027,34818,512,0,0,0,0,0,0,0,0,0,0,0,64,32,0,0,0,0,0,0,0,0,0,32768,1,1272,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,32768,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,32,0,0,0,0,0,0,0,0,0,0,0,4096,14,68,8,0,0,0,0,0,0,0,0,32768,112,12320,1088,16,0,0,0,0,0,0,0,0,900,33024,10112,63616,7,0,0,0,0,0,0,0,7200,2048,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,32768,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,32,0,0,0,0,0,0,0,57104,1027,34818,2560,64,0,0,0,0,0,0,0,0,0,0,0,2048,0,0,0,0,0,0,0,41984,243,129,32802,4096,0,0,0,0,0,0,0,0,0,0,128,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,32768,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1024,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,64,0,0,0,0,0,0,0,48672,2055,4100,1025,128,0,0,0,0,0,0,0,0,0,0,32768,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,256,64,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16384,0,0,0,0,0,0,0,8192,1980,1032,272,4,0,0,0,0,0,0,0,0,16904,513,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14528,4160,0,64,0,0,0,0,0,0,0,0,0,0,0,32768,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,33668,256,512,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,32,12,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4096,128,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,0,0,0,0,0,0,0,0,0,0,0,512,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,256,0,0,0,0,0,0,0,0,0,0,0,6144,0,0,0,0,0,0,0,0,0,0,0,0,128,16,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,48,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,900,33024,9728,128,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,64,2,0,0,0,0,0,0,0,0,0,0,512,16,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,192,64512,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,28800,8192,16384,64,0,0,0,0,0,0,0,0,33792,3,1,2,0,0,0,0,0,0,0,0,8192,28,8,0,0,0,0,0,0,0,0,0,0,0,0,96,65024,1,0,0,0,0,0,0,0,0,0,768,61440,15,0,0,0,0,0,0,0,0,0,6144,32768,127,0,0,0,0,0,0,0,49664,32769,64,16401,0,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,32768,112,4128,1088,16,0,0,0,0,0,0,0,0,0,0,4096,0,0,0,0,0,0,0,0,0,7200,2048,4100,1025,16,0,0,0,0,0,0,0,0,0,0,128,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16384,56,2064,544,8,0,0,0,0,0,0,0,0,450,128,256,0,0,0,0,0,0,0,0,0,3641,1024,34818,512,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,128,48,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,64,0,128,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4096,0,8192,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,32768,112,4128,1088,18,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7296,7,258,68,1,0,0,0,0,0,0,0,58368,56,2064,1568,8,0,0,0,0,0,0,0,0,0,0,32768,1024,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,32,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16,0,0,0,0,0,0,0,0,0,0,0,32768,0,0,0,0,0,0,0,0,0,0,0,32768,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4096,14,516,136,2050,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,512,0,3,0,0,0,0,0,0,0,0,0,0,0,24,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,57344,455,16528,20736,98,0,0,0,0,0,0,0,0,3647,1152,34818,786,0,0,0,0,0,0,0,0,0,256,3968,1,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,2048,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,144,0,0,0,0,0,0,0,0,0,0,0,2048,1024,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8224,0,0,0,0,0,0,0,0,32768,112,4128,1088,16400,0,0,0,0,0,0,0,0,0,0,0,2,1,0,0,0,0,0,0,0,0,0,3072,49152,39,0,0,0,0,0,0,0,57600,16384,57376,8201,510,0,0,0,0,0,0,0,0,0,0,3,4080,0,0,0,0,0,0,0,16384,56,16,8224,0,0,0,0,0,0,0,0,0,450,128,256,0,0,0,0,0,0,0,0,0,0,0,1536,57344,31,0,0,0,0,0,0,0,0,0,12288,0,255,0,0,0,0,0,0,0,0,0,32768,1,2040,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,51200,113,4128,1088,16,0,0,0,0,0,0,0,0,61440,16,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,18,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1152,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,32768,0,0,0,0,0,0,0,0,0,0,0,0,12,0,0,0,0,0,0,0,0,0,0,0,96,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1800,512,32768,0,0,0,0,0,0,0,0,0,0,0,16,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16384,910,33024,8704,128,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,58256,16384,32800,8200,0,0,0,0,0,0,0,0,7296,7,258,68,1,0,0,0,0,0,0,0,58368,56,2064,544,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1024,0,0,0,0,0,0,0,0,36416,3,129,32802,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2048,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1024,0,256,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,32768,113,32,32768,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,256,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4096,0,0,0,0,0,0,0,0,0,0,0,32768,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2048,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,32768,1820,512,17409,256,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,50976,32769,64,16401,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,51200,113,5152,1088,8720,0,0,0,0,0,0,0,0,900,256,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,57600,16384,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,64,0,0,0,0,0,0,0,0,0,0,0,512,0,0,0,0,0,0,0,0,0,0,0,4096,0,0,0,0,0,0,0,0,0,0,0,6144,32768,127,0,0,0,0,0,0,0,49664,32769,0,257,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,32768,112,32,16448,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7282,2048,4100,1025,0,0,0,0,0,0,0,0,57600,16384,32768,0,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,0,0,16384,56,2064,544,8,0,0,0,0,0,0,0,57344,455,16528,20736,24674,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,0,0,29128,8192,16400,4100,0,0,0,0,0,0,0,0,36800,8195,129,50338,192,0,0,0,0,0,0,0,32256,28,1033,9488,1542,0,0,0,0,0,0,0,61440,227,8264,10368,12337,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14588,4608,8200,3146,12,0,0,0,0,0,0,0,51168,36865,49216,25169,96,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,63488,113,4132,37952,6168,0,0,0,0,0,0,0,49152,911,33056,41472,49348,0,0,0,0,0,0,0,0,7200,2048,4100,1025,0,0,0,0,0,0,0,0,58352,18432,32800,12584,48,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,57344,455,16528,20736,24674,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,29176,8192,16400,4244,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,36864,0,0,0,0,0,0,0,0,61440,227,8256,10368,33,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14588,4096,8200,2122,0,0,0,0,0,0,0,0,32,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2048,0,32,0,0,0,0,0,0,0,0,0,0,0,0,18432,0,0,0,0,0,0,0,0,0,0,0,16384,2,0,0,0,0,0,0,0,0,0,0,0,128,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1152,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4096,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,36800,8195,129,50338,16576,0,0,0,0,0,0,0,8192,1948,1032,272,4,0,0,0,0,0,0,0,0,0,0,0,0,16,0,0,0,0,0,0,0,59144,513,17409,256,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,48,65280,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,58352,18432,32816,12584,48,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16384,56,2064,544,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,256,0,0,0,0,0,0,0,0,0,0,0,0,0,512,0,0,0,0,0,0,0,0,0,0,0,64,0,0,0,0,0,0,0,0,0,0,0,512,0,0,0,0,0,0,0,0,0,0,0,4096,0,0,0,0,0,0,0,0,0,0,0,0,128,0,0,0,0,0,0,0,0,0,0,49152,0,1020,0,0,0,0,0,0,0,4096,14,4,2056,0,0,0,0,0,0,0,0,32768,112,32,16448,0,0,0,0,0,0,0,0,16384,910,33024,8704,128,0,0,0,0,0,0,0,0,7200,2048,4096,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2048,7,258,68,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,450,16512,4352,64,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,29128,8192,16400,4100,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4096,0,0,0,0,0,0,0,0,0,225,8256,2176,32,0,0,0,0,0,0,0,0,1800,512,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,4096,974,516,392,2,1,0,0,0,0,0,0,32768,7792,4128,1088,80,8,0,0,0,0,0,0,0,63428,33024,8704,128,16,0,0,0,0,0,0,0,0,0,0,0,512,0,0,0,0,0,0,0,61696,16445,32800,8200,1024,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,32768,0,0,0,0,0,0,0,0,8192,455,16512,4352,64,0,0,0,0,0,0,0,0,0,0,1536,57344,31,0,0,0,0,0,0,0,0,0,0,0,2560,0,0,0,0,0,0,0,50176,247,129,32802,4096,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1816,512,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,128,0,0,0,0,0,0,0,0,0,0,0,4096,14,4,0,0,0,0,0,0,0,0,0,32768,113,32,0,0,0,0,0,0,0,0,0,0,908,256,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16384,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,40,0,0,0,0,0,0,0,57104,1027,34818,512,64,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,33792,3,1,514,0,0,0,0,0,0,0,0,8192,28,1032,4368,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4096,0,0,0,0,0,0,0,0,0,0,0,50688,32769,0,512,0,0,0,0,0,0,0,0,0,0,0,64,24,0,0,0,0,0,0,0,0,0,0,512,192,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7200,2052,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,4096,0,0,0,0,0,0,0,0,58368,56,2064,544,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,49154,0,0,0,0,0,0,0,0,0,0,0,0,16384,0,0,0,0,0,0,0,8192,1948,1032,784,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,51168,36865,64,25169,96,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,58368,56,2064,544,8,0,0,0,0,0,0,0,0,450,128,256,1,0,0,0,0,0,0,0,0,3641,1024,34818,512,0,0,0,0,0,0,0,0,28800,8192,16384,0,0,0,0,0,0,0,0,0,0,0,32,0,272,0,0,0,0,0,0,0,0,0,0,12,16320,0,0,0,0,0,0,0,61440,227,8264,10368,12337,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1024,0,0,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,32768,112,4128,1088,16,0,0,0,0,0,0,0,0,0,0,1024,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,450,128,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,29128,8192,16400,4100,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,63488,113,4132,37952,6168,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,4096,0,0,0,0,0,0,0,0,0,0,0,32768,49152,0,0,0,0,0,0,0,0,0,0,0,0,32,0,0,0,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,512,0,0,0,0,0,0,0,0,0,0,16384,16,0,0,0,0,0,0,0,0,0,0,0,258,0,0,0,0,0,0,0,0,0,0,0,3088,0,0,0,0,0,0,0,0,0,0,14588,4608,8200,3146,12,0,0,0,0,0,0,0,51168,36865,64,25169,96,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8064,16391,258,35140,385,0,0,0,0,0,0,0,0,32768,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,0,64,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,29184,28,1032,272,4,0,0,0,0,0,0,0,0,225,64,32896,0,0,0,0,0,0,0,0,32768,1820,512,17409,256,0,0,0,0,0,0,0,0,14400,4096,8192,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,29128,8192,16400,4100,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,16,0,0,0,0,0,0,0,61320,513,17409,256,32,0,0,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,0,32768,0,0,0,0,0,0,0,0,0,0,128,0,1088,0,0,0,0,0,0,0,0,0,1024,0,8704,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,58256,16384,32800,8200,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,58368,56,2064,544,8,0,0,0,0,0,0,0,57344,455,16528,20736,24674,0,0,0,0,0,0,0,0,3647,1152,34818,786,3,0,0,0,0,0,0,0,0,256,0,0,0,0,0,0,0,0,0,0,0,2048,2,0,0,0,0,0,0,0,0,0,0,16384,32,0,0,0,0,0,0,0,0,0,0,0,256,0,0,0,0,0,0,0,0,0,32768,1823,576,17409,33161,1,0,0,0,0,0,0,0,14588,4608,8200,3146,12,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,32768,112,4128,1088,16,0,0,0,0,0,0,0,0,900,33024,8704,128,0,0,0,0,0,0,0,0,7294,2304,4100,1573,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4096,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16,0,0,0,0,0,0,0,0,0,0,0,0,64,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1024,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,128,2,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,58256,16384,32800,8200,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,58368,56,2064,544,8,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,256,0,2176,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,16,0,0,0,0,0,0,0,0,14400,4096,1,0,0,0,0,0,0,0,0,0,0,0,0,0,2048,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,450,16512,4352,65,0,0,0,0,0,0,0,0,3647,1152,34818,786,3,0,0,0,0,0,0,0,28800,8192,16384,64,0,0,0,0,0,0,0,0,0,0,0,32,0,0,0,0,0,0,0,0,0,0,0,128,48,0,0,0,0,0,0,0,0,0,0,1024,384,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4096,14,4,256,0,0,0,0,0,0,0,0,0,0,0,1024,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,7294,2304,4100,1573,6,0,0,0,0,0,0,0,57600,16384,32768,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,3641,1024,34818,512,0,0,0,0,0,0,0,0,29128,8192,16400,4100,0,0,0,0,0,0,0,0,36416,3,129,32802,0,0,0,0,0,0,0,0,0,0,0,32768,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14564,4096,8200,2050,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,51200,113,4128,1088,16,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,0,0,16384,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4096,0,0,0,0,0,0,0,0,0,0,64512,56,2066,18976,3084,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,32,0,0,0,0,0,0,0,0,0,0,29176,9216,16400,6292,24,0,0,0,0,0,0,0,36800,8195,129,50338,192,0,0,0,0,0,0,0,0,0,32,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,16,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,0,0,0,0,2,8,0,0,0,0,0,0,0,63428,33024,8704,128,16,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,32768,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,64512,56,2066,18976,3084,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,32,0,0,0,0,0,0,0,0,0,0,0,256,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16384,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,128,0,1088,0,0,0,0,0,0,0,0,0,0,384,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,64,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,144,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,28800,8192,16384,0,0,0,0,0,0,0,0,0,0,0,0,4096,0,0,0,0,0,0,0,0,0,16384,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
 	])
 
 {-# NOINLINE happyExpListPerState #-}
 happyExpListPerState st =
     token_strs_expected
-  where token_strs = ["error","%dummy","%start_vmodule","%start_program","%start_programLayout","%start_expr","%start_decl","%start_decls","%start_declsLayout","%start_letDecl","%start_repl","%start_schema","%start_modName","%start_helpName","vmodule","module_def","vmod_body","import","impName","mbAs","mbImportSpec","name_list","mbHiding","program","program_layout","top_decls","vtop_decls","vtop_decl","top_decl","private_decls","prim_bind","parameter_decls","par_decls","par_decl","doc","mbDoc","propguards","decl","let_decls","let_decl","newtype","newtype_body","vars_comma","var","apats","indices","indices1","apats_indices","opt_apats_indices","decls","vdecls","decls_layout","repl","qop","op","pat_op","other_op","ops","expr","exprNoWhere","whereClause","typedExpr","simpleExpr","longExpr","ifBranches","ifBranch","simpleRHS","longRHS","simpleApp","longApp","aexprs","aexpr","no_sel_aexpr","sel_expr","selector","poly_terms","poly_term","tuple_exprs","rec_expr","field_exprs","field_expr","field_path","field_how","list_expr","list_alts","matches","match","pat","ipat","apat","tuple_pats","field_pat","field_pats","schema","schema_vars","schema_quals","schema_qual","kind","schema_param","schema_params","tysyn_param","tysyn_params","type","infix_type","app_type","atype","atypes","dimensions","tuple_types","field_type","field_types","ident","name","smodName","modName","qname","help_name","tick_ty","field_ty_val","field_ty_vals","NUM","FRAC","STRLIT","CHARLIT","IDENT","QIDENT","SELECTOR","'include'","'import'","'as'","'hiding'","'private'","'parameter'","'property'","'infix'","'infixl'","'infixr'","'type'","'newtype'","'module'","'submodule'","'where'","'let'","'if'","'then'","'else'","'x'","'down'","'by'","'primitive'","'constraint'","'Prop'","'propguards'","'['","']'","'<-'","'..'","'...'","'..<'","'..>'","'|'","'<'","'>'","'('","')'","','","';'","'{'","'}'","'<|'","'|>'","'='","'`'","':'","'->'","'=>'","'\\\\'","'_'","'v{'","'v}'","'v;'","'+'","'*'","'^^'","'-'","'~'","'#'","'@'","OP","QOP","DOC","%eof"]
-        bit_start = st Prelude.* 192
-        bit_end = (st Prelude.+ 1) Prelude.* 192
+  where token_strs = ["error","%dummy","%start_vmodule","%start_program","%start_programLayout","%start_expr","%start_decl","%start_decls","%start_declsLayout","%start_letDecl","%start_repl","%start_schema","%start_modName","%start_helpName","vmodule","module_def","vmod_body","import","impName","mbAs","mbImportSpec","name_list","mbHiding","program","program_layout","top_decls","vtop_decls","vtop_decl","top_decl","private_decls","prim_bind","parameter_decls","par_decls","par_decl","doc","mbDoc","propguards","propguards_cases","propguards_case","propguards_quals","decl","let_decls","let_decl","newtype","newtype_body","vars_comma","var","apats","indices","indices1","apats_indices","opt_apats_indices","decls","vdecls","decls_layout","repl","qop","op","pat_op","other_op","ops","expr","exprNoWhere","whereClause","typedExpr","simpleExpr","longExpr","ifBranches","ifBranch","simpleRHS","longRHS","simpleApp","longApp","aexprs","aexpr","no_sel_aexpr","sel_expr","selector","poly_terms","poly_term","tuple_exprs","rec_expr","field_exprs","field_expr","field_path","field_how","list_expr","list_alts","matches","match","pat","ipat","apat","tuple_pats","field_pat","field_pats","schema","schema_vars","schema_quals","schema_qual","kind","schema_param","schema_params","tysyn_param","tysyn_params","type","infix_type","app_type","atype","atypes","dimensions","tuple_types","field_type","field_types","ident","name","smodName","modName","qname","help_name","tick_ty","field_ty_val","field_ty_vals","NUM","FRAC","STRLIT","CHARLIT","IDENT","QIDENT","SELECTOR","'include'","'import'","'as'","'hiding'","'private'","'parameter'","'property'","'infix'","'infixl'","'infixr'","'type'","'newtype'","'module'","'submodule'","'where'","'let'","'if'","'then'","'else'","'x'","'down'","'by'","'primitive'","'constraint'","'Prop'","'propguards'","'['","']'","'<-'","'..'","'...'","'..<'","'..>'","'|'","'<'","'>'","'('","')'","','","';'","'{'","'}'","'<|'","'|>'","'='","'`'","':'","'->'","'=>'","'\\\\'","'_'","'v{'","'v}'","'v;'","'+'","'*'","'^^'","'-'","'~'","'#'","'@'","OP","QOP","DOC","%eof"]
+        bit_start = st Prelude.* 195
+        bit_end = (st Prelude.+ 1) Prelude.* 195
         read_bit = readArrayBit happyExpList
         bits = Prelude.map read_bit [bit_start..bit_end Prelude.- 1]
-        bits_indexed = Prelude.zip bits [0..191]
+        bits_indexed = Prelude.zip bits [0..194]
         token_strs_expected = Prelude.concatMap f bits_indexed
         f (Prelude.False, _) = []
         f (Prelude.True, nr) = [token_strs Prelude.!! nr]
 
 happyActOffsets :: Happy_Data_Array.Array Prelude.Int Prelude.Int
-happyActOffsets = Happy_Data_Array.listArray (0,629) ([-16,484,-49,1103,1388,1388,-45,1190,933,2430,1027,1123,50,1027,0,0,0,0,0,0,0,-53,0,0,0,0,0,0,0,0,1980,0,0,0,0,0,0,0,0,0,0,0,-53,0,1335,-53,2442,2442,0,-20,2050,0,0,2491,2503,0,0,2516,839,439,0,0,15,71,192,0,0,1963,0,0,0,3108,0,1568,0,211,211,0,0,0,0,0,233,243,248,1433,2925,1103,1018,769,1497,4,968,2950,0,1423,1423,214,214,1237,301,189,884,554,-34,630,2137,0,357,376,389,1669,2835,1167,582,0,314,-13,314,606,314,519,358,0,0,457,0,442,0,461,670,520,0,42,0,0,0,0,1308,1924,0,789,536,576,0,1571,0,566,104,0,210,0,263,590,0,602,283,124,0,307,0,2846,0,231,256,0,2067,2154,836,1581,1147,2224,2224,2224,2950,1103,2950,608,1170,617,0,2950,1756,2561,0,0,141,0,3125,0,3142,0,2876,0,0,0,2574,2417,299,0,0,607,0,649,654,652,0,1212,0,678,666,102,885,0,1423,1423,1732,683,701,0,98,38,0,222,1212,143,630,1167,2224,1500,1843,2224,2224,2224,0,0,0,0,0,1103,2574,1190,0,588,0,710,684,3183,709,930,1036,0,1089,725,0,2586,0,2635,0,2635,2635,2635,0,0,711,2635,711,0,745,0,-5,739,1027,0,765,0,0,834,844,0,3035,832,0,0,2635,0,2635,0,866,1147,0,1147,0,0,0,0,0,0,853,853,853,2224,2381,0,2472,0,2635,1843,881,2950,1103,889,2647,1103,1103,1103,0,1103,960,0,1103,1103,2950,1103,0,0,1103,0,1568,0,768,1568,0,1568,952,0,7,813,947,907,0,951,0,923,0,1103,1388,0,1388,0,0,0,2224,917,0,1045,0,2950,0,934,987,963,981,981,981,977,2224,2616,2760,2660,1843,0,2950,0,2950,0,2660,0,984,2950,1147,0,0,1343,1257,734,0,734,0,989,2705,2224,999,734,1075,0,1846,0,1109,1147,1846,1027,0,1058,1067,0,1065,734,0,3041,2895,0,0,114,1027,168,260,0,1451,1100,1119,2705,0,0,401,0,1363,0,0,0,1103,0,0,0,1124,0,0,2718,3100,2718,1843,-19,2224,1103,1127,0,1178,0,2950,1171,0,0,0,0,1147,0,2718,0,0,0,0,0,1180,0,1103,0,0,1180,1205,116,1209,1215,0,1222,610,316,918,1103,1103,1229,1229,0,0,0,1103,1229,1211,1214,1230,0,2718,3103,2718,1843,0,1242,0,1204,0,0,0,0,0,0,2718,0,3035,1243,670,1223,1231,-19,-19,1254,0,2718,0,2718,1103,1103,1285,646,407,1280,1103,1103,1283,1103,2950,2950,1103,0,1292,0,1276,0,0,0,1312,0,74,1284,0,2718,0,2718,1315,0,0,0,-19,1290,1295,1672,1268,0,1268,0,0,0,1306,0,2906,1103,3112,1303,446,515,0,0,0,1113,1303,1345,1103,1930,0,0,1310,2718,2730,2730,1302,0,0,2779,0,1347,1319,0,1349,1103,1349,1349,1103,1103,1357,1350,1350,0,0,2779,1321,670,0,1329,0,1103,1372,1372,1372,0,0,0,0,-19,1051,0,1372,0,965,0,0,0,1930,1340,1374,0,0,0
+happyActOffsets = Happy_Data_Array.listArray (0,637) ([-17,511,-49,1130,1415,1415,47,1217,960,2509,560,1150,39,560,0,0,0,0,0,0,0,50,0,0,0,0,0,0,0,0,1833,0,0,0,0,0,0,0,0,0,0,0,50,0,2147,50,2521,2521,0,99,1104,0,0,2534,2579,0,0,2592,866,1174,0,0,79,92,220,0,0,1816,0,0,0,3190,0,1595,0,254,254,0,0,0,0,0,179,310,329,1460,2992,1130,1045,796,1524,6,995,3017,0,1450,1450,283,283,1264,317,77,911,581,124,657,1903,0,372,413,422,1696,2902,1194,1309,0,367,-14,367,633,367,546,402,0,0,429,0,464,0,400,697,416,0,-42,0,0,0,0,1335,1296,0,816,448,465,0,1598,0,490,255,0,150,0,570,508,0,522,38,35,0,233,0,2913,0,110,182,0,1920,1990,863,442,2322,2007,2007,2007,3017,1130,3017,553,1197,555,0,3017,1080,2604,0,0,395,0,3207,0,3224,0,2943,0,0,0,2653,2460,185,0,0,568,0,583,591,671,0,1239,0,684,629,181,345,0,1450,1450,1759,700,695,0,676,166,0,212,1239,158,657,1194,2007,1138,1608,2007,2007,2007,0,0,0,0,0,1130,2653,1217,0,716,0,766,709,3265,693,439,566,0,1362,782,0,2665,0,2678,0,2678,2678,2678,0,0,801,2678,801,0,802,0,-18,837,560,0,870,0,0,878,909,0,3117,894,0,0,2678,0,2678,0,893,2322,0,2322,0,0,0,0,0,0,907,907,907,2007,1527,0,2485,0,2678,1608,941,3017,1130,943,2723,1130,1130,1130,0,1130,987,0,1130,1130,3017,1130,0,0,1130,0,1595,0,800,1595,0,1595,1011,0,17,840,903,972,0,936,0,996,0,1130,1415,0,1415,0,0,0,2007,990,0,1072,0,3017,0,975,1032,1018,1025,1025,1025,1027,2007,2634,2778,2736,1608,0,3017,0,3017,0,2736,0,1036,3017,2322,0,0,1370,1284,761,0,761,0,1043,2748,2007,1041,761,1103,0,2234,0,1118,2322,2234,560,0,1064,1085,0,1068,761,0,3164,2962,0,0,161,560,492,567,0,1478,1100,1109,2748,0,0,608,0,1390,0,0,0,1130,0,0,0,1106,0,0,2797,3182,2797,1608,-15,2007,1130,1107,0,1154,2797,3017,1136,0,0,0,0,2322,0,2797,0,0,0,0,0,1143,0,1130,0,0,1143,1169,129,1156,1152,0,1164,598,235,393,1130,1130,1181,1181,0,0,0,1130,1181,1158,1159,1170,0,2797,3185,2797,1608,0,1171,0,1188,0,0,0,0,0,0,2797,0,3117,1204,697,1193,1195,-15,-15,1215,0,2797,0,2797,1130,1130,1250,759,503,1248,1130,1130,1249,1130,3017,3017,1130,0,1263,0,1234,0,0,0,0,1247,1236,0,1268,0,342,1241,0,2797,0,2797,1281,0,0,0,-15,1251,1252,1699,1238,0,1238,0,0,0,1269,0,2973,1130,3194,1275,635,743,0,0,0,1537,1275,1303,1130,1783,0,0,1262,2797,2809,2809,1272,0,0,2822,0,1130,2822,1311,1288,0,1319,1130,1319,1319,1130,1130,1326,1341,1341,0,0,2822,1302,697,0,1304,0,1130,1344,1344,1344,0,1344,0,0,0,0,-15,611,0,1344,0,974,0,0,0,1783,1313,1349,0,0,0
 	])
 
 happyGotoOffsets :: Happy_Data_Array.Array Prelude.Int Prelude.Int
-happyGotoOffsets = Happy_Data_Array.listArray (0,629) ([1402,269,1403,1575,158,213,1377,1394,340,3179,1042,330,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1019,0,0,0,0,0,0,0,0,0,0,0,0,0,318,0,3331,2704,0,0,563,0,0,891,943,0,0,2443,767,692,0,0,0,0,0,0,0,1291,0,0,0,1371,0,69,0,1370,1391,0,0,0,0,0,0,0,0,110,-1,1438,668,604,3156,1070,727,33,0,415,2946,0,0,326,0,0,249,381,0,1122,0,0,0,0,0,198,447,510,-62,0,0,0,0,129,0,285,0,0,0,0,0,0,0,0,9,0,0,0,0,0,0,0,383,1397,0,16,0,0,0,463,0,0,0,0,1385,0,0,0,0,0,0,0,0,0,0,1213,0,0,0,0,743,0,418,349,1356,1236,1342,1399,85,1591,499,0,20,0,0,24,-26,3202,0,0,0,0,1405,0,1405,0,206,0,0,0,2587,3359,0,0,0,0,0,0,0,0,0,12,0,0,0,0,0,0,2957,2968,0,0,0,0,0,0,0,0,400,0,1129,1046,812,471,503,1627,1715,1744,0,0,0,0,0,2933,2877,1130,0,0,0,0,0,0,0,0,0,0,795,0,0,976,0,3377,0,3391,822,3405,0,0,0,3345,0,0,0,0,0,0,1049,0,0,0,0,0,0,0,0,0,0,0,3419,0,3433,0,3045,368,0,153,0,0,0,0,0,0,0,0,0,1023,542,0,294,0,3447,321,0,428,1607,0,3225,2762,1509,1662,0,1678,1694,0,1749,1765,1445,1781,0,0,1836,0,1351,0,1369,481,0,2702,0,0,1393,0,0,0,0,0,0,0,0,2777,385,0,393,0,0,0,1050,0,0,278,0,58,0,0,0,0,0,0,0,0,1179,788,513,3461,544,0,165,0,242,0,3475,0,0,379,-36,0,0,328,345,196,0,244,0,0,3248,1203,1823,156,1453,0,824,0,0,1086,857,5,0,0,0,0,1856,177,0,830,39,0,0,535,1099,0,0,0,1105,0,0,3271,0,0,0,0,411,0,0,0,1852,0,0,0,0,0,0,3489,579,3503,700,1376,1252,1868,0,0,0,0,660,0,0,0,0,0,413,0,3517,0,0,0,0,0,0,0,1923,0,0,0,0,0,0,0,0,0,0,0,0,1939,1955,0,0,0,0,0,2010,0,0,0,0,0,3531,705,3545,718,0,0,0,0,0,0,0,0,0,0,3559,0,0,0,37,0,0,1382,1383,0,0,3573,0,3587,2026,2042,0,0,0,0,2097,2113,0,2129,148,635,2184,0,0,0,0,0,0,0,0,0,0,0,0,3601,0,3615,0,0,0,0,1387,0,0,1143,986,0,1279,0,0,0,0,0,665,2200,732,1441,0,0,0,0,0,1207,1447,0,2216,-6,0,0,0,3629,3294,3317,0,0,0,3643,0,0,0,0,0,2271,0,0,2287,2303,0,0,0,0,0,3657,0,65,0,0,0,2358,0,0,0,0,0,0,0,1389,0,0,0,0,0,0,0,0,-22,0,0,0,0,0
+happyGotoOffsets = Happy_Data_Array.listArray (0,637) ([1384,256,1381,1599,155,173,1352,1366,324,2222,748,505,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1023,0,0,0,0,0,0,0,0,0,0,0,0,0,564,0,2384,3364,0,0,836,0,0,915,1014,0,0,2458,791,1457,0,0,0,0,0,0,0,1424,0,0,0,1346,0,288,0,1336,1340,0,0,0,0,0,0,0,0,207,300,1462,692,628,3235,136,710,61,0,3010,3021,0,0,260,0,0,20,401,0,874,0,0,0,0,0,253,2063,417,-12,0,0,0,0,112,0,269,0,0,0,0,0,0,0,0,9,0,0,0,0,0,0,0,403,1367,0,-3,0,0,0,857,0,0,0,0,1360,0,0,0,0,0,0,0,0,0,0,2150,0,0,0,0,989,0,368,488,1310,1651,1739,1768,193,1615,258,0,168,0,0,-8,-23,2309,0,0,0,0,1361,0,1361,0,197,0,0,0,2602,3392,0,0,0,0,0,0,0,0,0,-5,0,0,0,0,0,0,3032,3047,0,0,0,0,0,0,0,0,430,0,923,558,1083,420,724,1913,1999,2086,0,0,0,0,0,2997,2746,946,0,0,0,0,0,0,0,0,0,0,1053,0,0,1000,0,2941,0,3410,846,3424,0,0,0,3378,0,0,0,0,0,0,1127,0,0,0,0,0,0,0,0,0,0,0,3438,0,3452,0,2768,938,0,97,0,0,0,0,0,0,0,0,0,1203,495,0,341,0,3466,479,0,370,1631,0,3258,2826,1533,1686,0,1702,1718,0,1773,1789,986,1805,0,0,1860,0,474,0,1345,561,0,1375,0,0,1347,0,0,0,0,0,0,0,0,2841,405,0,412,0,0,0,1286,0,0,262,0,95,0,0,0,0,0,0,0,0,1294,694,603,3480,667,0,-62,0,70,0,3494,0,0,267,-57,0,0,373,387,203,0,228,0,0,3281,1316,2125,137,1435,0,-37,0,0,880,685,5,0,0,0,0,2198,162,0,812,152,0,0,1111,1168,0,0,0,902,0,0,3304,0,0,0,0,414,0,0,0,1876,0,0,0,0,0,0,3508,729,3522,742,1343,1333,1892,0,0,0,302,397,0,0,0,0,0,433,0,3536,0,0,0,0,0,0,0,1947,0,0,0,0,0,0,0,0,0,0,0,0,1963,1979,0,0,0,0,0,2034,0,0,0,0,0,3550,756,3564,817,0,0,0,0,0,0,0,0,0,0,3578,0,0,0,34,0,0,1355,1364,0,0,3592,0,3606,2050,2066,0,0,0,0,2121,2137,0,2153,41,659,2208,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3620,0,3634,0,0,0,0,1371,0,0,927,1402,0,1461,0,0,0,0,0,399,2224,854,1416,0,0,0,0,0,1528,1417,0,2240,13,0,0,0,3648,3327,3350,0,0,0,3662,0,2295,316,0,0,0,0,2311,0,0,2327,2382,0,0,0,0,0,3676,0,59,0,0,0,2398,0,0,0,0,0,0,0,0,0,1372,0,0,0,0,0,0,0,0,-19,0,0,0,0,0
 	])
 
 happyAdjustOffset :: Prelude.Int -> Prelude.Int
 happyAdjustOffset = Prelude.id
 
 happyDefActions :: Happy_Data_Array.Array Prelude.Int Prelude.Int
-happyDefActions = Happy_Data_Array.listArray (0,629) ([0,0,0,0,0,0,0,0,-131,0,0,0,0,0,-315,-132,-134,-137,-307,-312,-314,0,-302,-313,-305,-306,-304,-303,-143,-144,0,-139,-138,-142,-140,-141,-135,-136,-145,-133,-308,-310,0,-309,0,0,0,0,-261,-254,-276,-278,-281,0,-282,-284,-285,0,0,0,-292,-130,-87,0,-129,-148,-152,0,-173,-159,-151,-174,-170,-171,-175,-177,-178,-179,-180,-181,-182,-183,0,0,0,0,0,0,0,0,0,0,0,0,-184,0,0,0,0,0,0,0,-108,0,0,-238,-110,-86,0,0,0,0,0,0,0,-240,0,0,0,0,0,0,0,-53,-68,0,-51,0,-67,0,0,0,-50,-17,-37,-47,-46,-48,0,0,-40,0,-304,0,-52,0,-35,0,0,-34,0,-252,0,0,-247,0,0,-236,-238,0,-239,0,-241,0,0,-244,0,-307,0,0,0,0,0,0,0,0,0,0,-115,0,-112,0,0,0,-122,-124,0,-128,-174,-169,-174,-168,0,-317,-192,-318,0,0,0,-199,-201,-202,-194,-212,0,-208,-209,-120,-188,-184,0,0,0,-187,-140,-141,-216,-217,0,-190,0,0,-162,0,-108,0,-238,0,0,0,0,0,0,0,-197,-198,-196,-176,-172,0,0,-88,-269,0,-300,0,-267,-258,0,0,0,-288,0,0,-293,-280,-282,0,-279,0,0,0,-262,-260,-256,0,-255,-311,0,-13,0,0,0,-316,-257,-275,-277,0,0,-294,-295,0,-290,-289,0,-287,0,-283,0,0,-291,0,-259,-89,-157,-158,-150,-146,-103,-101,-102,0,0,-273,0,-271,0,0,0,0,0,0,0,0,0,0,-191,0,0,-228,0,0,0,0,-186,-185,0,-193,0,-121,0,0,-189,0,0,-195,0,0,0,-307,-325,0,-320,0,-113,0,0,-127,0,-71,-109,-110,0,-119,-116,0,-118,0,-123,-237,-72,0,-85,-83,-84,0,0,0,0,0,0,-246,0,-245,0,-243,0,-242,-111,0,0,-248,-149,0,0,0,-33,0,-36,0,0,0,-69,0,-23,-21,0,-45,0,0,0,0,-41,-304,0,-14,-69,0,-49,0,0,-42,-20,-30,0,0,0,-61,0,0,0,0,-38,-39,0,-155,0,-153,-253,-251,0,-235,-249,-250,0,-77,-274,0,0,0,0,0,0,0,-114,-74,-75,-70,0,0,-125,-126,-161,-319,0,-321,0,-323,-322,-200,-203,-212,-206,-210,0,-213,-214,-207,-204,-204,-215,-230,-232,0,0,-221,-218,0,0,-205,-164,-163,-160,-94,0,-90,0,-111,0,-95,0,0,0,0,-270,-267,-301,-268,-299,-265,-264,-263,-297,-298,0,-286,-296,0,0,0,0,0,0,0,-98,0,-96,0,0,0,-91,0,-220,0,0,0,0,0,0,0,0,-229,-211,-324,0,-326,-111,-117,-76,-147,0,0,-80,0,-78,0,-73,-154,-156,-56,0,0,0,0,-69,-59,-69,-54,-22,-19,0,-29,0,0,0,0,0,0,-60,-55,-104,0,0,-44,0,-28,-63,-62,0,0,0,0,-58,-79,-81,0,-272,-219,-231,-233,-234,0,-224,-222,0,0,0,-93,-92,-97,-99,0,-266,0,-15,0,-100,0,-223,-225,-227,-82,-57,-64,-66,0,0,-27,-43,-105,0,-106,-107,-24,0,-65,-226,-16,-26
+happyDefActions = Happy_Data_Array.listArray (0,637) ([0,0,0,0,0,0,0,0,-135,0,0,0,0,0,-319,-136,-138,-141,-311,-316,-318,0,-306,-317,-309,-310,-308,-307,-147,-148,0,-143,-142,-146,-144,-145,-139,-140,-149,-137,-312,-314,0,-313,0,0,0,0,-265,-258,-280,-282,-285,0,-286,-288,-289,0,0,0,-296,-134,-91,0,-133,-152,-156,0,-177,-163,-155,-178,-174,-175,-179,-181,-182,-183,-184,-185,-186,-187,0,0,0,0,0,0,0,0,0,0,0,0,-188,0,0,0,0,0,0,0,-112,0,0,-242,-114,-90,0,0,0,0,0,0,0,-244,0,0,0,0,0,0,0,-53,-68,0,-51,0,-67,0,0,0,-50,-17,-37,-47,-46,-48,0,0,-40,0,-308,0,-52,0,-35,0,0,-34,0,-256,0,0,-251,0,0,-240,-242,0,-243,0,-245,0,0,-248,0,-311,0,0,0,0,0,0,0,0,0,0,-119,0,-116,0,0,0,-126,-128,0,-132,-178,-173,-178,-172,0,-321,-196,-322,0,0,0,-203,-205,-206,-198,-216,0,-212,-213,-124,-192,-188,0,0,0,-191,-144,-145,-220,-221,0,-194,0,0,-166,0,-112,0,-242,0,0,0,0,0,0,0,-201,-202,-200,-180,-176,0,0,-92,-273,0,-304,0,-271,-262,0,0,0,-292,0,0,-297,-284,-286,0,-283,0,0,0,-266,-264,-260,0,-259,-315,0,-13,0,0,0,-320,-261,-279,-281,0,0,-298,-299,0,-294,-293,0,-291,0,-287,0,0,-295,0,-263,-93,-161,-162,-154,-150,-107,-105,-106,0,0,-277,0,-275,0,0,0,0,0,0,0,0,0,0,-195,0,0,-232,0,0,0,0,-190,-189,0,-197,0,-125,0,0,-193,0,0,-199,0,0,0,-311,-329,0,-324,0,-117,0,0,-131,0,-75,-113,-114,0,-123,-120,0,-122,0,-127,-241,-76,0,-89,-87,-88,0,0,0,0,0,0,-250,0,-249,0,-247,0,-246,-115,0,0,-252,-153,0,0,0,-33,0,-36,0,0,0,-69,0,-23,-21,0,-45,0,0,0,0,-41,-308,0,-14,-69,0,-49,0,0,-42,-20,-30,0,0,0,-61,0,0,0,0,-38,-39,0,-159,0,-157,-257,-255,0,-239,-253,-254,0,-81,-278,0,0,0,0,0,0,0,-118,-78,-79,0,0,0,-129,-130,-165,-323,0,-325,0,-327,-326,-204,-207,-216,-210,-214,0,-217,-218,-211,-208,-208,-219,-234,-236,0,0,-225,-222,0,0,-209,-168,-167,-164,-98,0,-94,0,-115,0,-99,0,0,0,0,-274,-271,-305,-272,-303,-269,-268,-267,-301,-302,0,-290,-300,0,0,0,0,0,0,0,-102,0,-100,0,0,0,-95,0,-224,0,0,0,0,0,0,0,0,-233,-215,-328,0,-330,-115,-121,-70,-72,0,-74,-80,-151,0,0,-84,0,-82,0,-77,-158,-160,-56,0,0,0,0,-69,-59,-69,-54,-22,-19,0,-29,0,0,0,0,0,0,-60,-55,-108,0,0,-44,0,-28,-63,-62,0,0,0,0,-58,-83,-85,0,-276,0,0,-223,-235,-237,-238,0,-228,-226,0,0,0,-97,-96,-101,-103,0,-270,0,-15,0,-104,0,-227,-229,-231,-71,-73,-86,-57,-64,-66,0,0,-27,-43,-109,0,-110,-111,-24,0,-65,-230,-16,-26
 	])
 
 happyCheck :: Happy_Data_Array.Array Prelude.Int Prelude.Int
-happyCheck = Happy_Data_Array.listArray (0,3774) ([-1,7,1,29,20,1,1,29,1,22,59,2,3,32,59,77,78,22,52,72,4,12,13,29,15,16,17,28,29,20,21,27,23,67,27,97,56,28,29,2,3,77,30,59,63,33,34,52,67,12,13,31,15,16,17,51,32,20,21,72,23,97,47,30,26,28,29,2,3,30,20,97,98,74,75,97,98,12,13,41,15,16,17,74,75,20,21,75,23,47,32,97,98,28,29,75,97,98,97,75,99,100,97,61,99,100,97,98,75,97,98,74,75,97,75,99,100,97,98,45,22,97,98,25,22,11,57,58,59,55,97,98,3,75,97,98,97,98,22,74,75,12,13,72,15,16,17,45,46,20,21,47,23,37,38,97,98,28,29,3,75,47,97,98,60,61,97,98,12,13,101,15,16,17,60,61,20,21,54,23,3,23,97,98,28,29,28,29,47,12,13,67,15,16,17,52,86,20,21,3,23,60,61,74,75,28,29,97,98,13,67,15,16,17,22,47,20,21,7,23,72,73,74,75,28,29,97,98,60,61,74,75,74,75,1,46,23,84,73,74,75,28,29,54,1,97,98,3,35,1,97,74,75,97,98,97,98,13,48,15,16,17,97,98,20,21,35,23,46,59,74,75,28,29,97,98,54,46,9,30,11,75,33,14,86,16,72,74,75,20,21,35,23,97,98,97,98,28,29,14,22,16,46,97,98,20,21,47,23,46,97,98,49,28,29,73,74,75,74,75,60,61,44,45,75,47,48,49,45,46,52,53,54,55,56,57,58,59,22,97,98,97,98,74,75,29,97,98,47,23,51,23,45,46,28,29,28,29,1,74,75,62,36,35,24,25,97,98,23,39,40,41,42,28,29,97,98,1,38,101,86,36,97,98,44,45,72,47,48,49,1,97,52,53,54,55,56,57,58,59,74,75,74,75,23,47,23,86,23,28,29,28,29,28,29,97,23,99,97,74,75,28,29,97,98,97,98,97,98,22,30,101,102,33,23,86,29,97,98,28,29,101,97,98,5,3,97,98,47,10,11,12,73,74,75,74,75,74,75,74,75,60,61,95,49,97,27,74,75,54,55,56,57,58,59,75,97,98,97,98,97,98,97,98,0,74,75,30,49,5,97,98,8,47,10,11,12,97,98,15,16,17,18,75,86,87,60,61,97,98,97,27,97,98,30,97,101,104,34,0,73,74,75,76,5,97,98,8,44,10,11,12,48,72,15,16,17,18,57,58,59,6,58,8,97,98,27,66,67,30,40,41,42,34,0,71,72,86,87,5,97,98,47,44,10,11,12,48,97,15,16,17,18,74,75,60,61,58,97,98,60,27,101,73,74,75,76,5,34,86,71,72,10,11,12,59,97,98,44,86,97,98,48,40,41,42,0,97,98,27,97,5,58,47,8,9,10,11,12,13,14,15,16,17,18,19,72,21,86,87,86,49,22,27,46,59,30,49,28,97,34,97,52,39,40,41,42,45,44,45,44,47,48,49,48,47,52,53,54,55,56,57,58,59,58,86,60,63,22,52,0,64,42,43,28,5,97,71,8,9,10,11,12,13,14,15,16,17,18,19,41,21,62,63,64,65,66,27,46,69,30,97,98,49,34,101,71,72,73,74,75,45,44,45,44,47,48,49,48,41,52,53,54,55,56,57,58,59,58,46,60,63,97,98,0,75,35,69,54,5,75,71,8,9,10,11,12,13,14,15,16,17,18,19,45,21,46,97,98,49,35,27,97,98,30,97,98,56,34,101,1,2,3,4,5,6,84,85,44,10,11,12,48,40,41,42,86,95,96,97,45,86,58,24,5,6,27,97,59,10,11,12,97,34,86,71,39,40,41,42,21,42,43,44,45,97,27,48,86,50,52,56,53,55,97,98,57,58,101,97,103,62,63,64,65,66,67,68,69,70,1,5,53,4,5,6,10,11,12,10,11,12,40,41,42,88,89,90,91,46,93,94,49,27,97,98,27,1,101,35,4,5,6,34,86,87,10,11,12,35,44,42,43,44,45,97,54,48,52,5,95,96,97,27,10,11,12,58,32,46,34,62,63,64,65,66,67,68,69,70,44,27,90,91,48,93,86,87,34,97,98,97,98,101,58,101,45,97,44,63,45,46,48,67,1,2,3,4,5,6,22,52,58,10,11,12,28,29,15,16,17,18,68,1,97,98,23,24,101,52,27,1,2,3,4,5,6,34,45,1,10,11,12,5,6,45,46,44,10,11,12,48,91,50,24,68,53,27,97,98,57,58,101,46,34,27,49,46,65,66,49,67,42,43,44,19,20,21,48,22,50,46,44,53,49,52,48,57,58,1,2,3,4,5,6,65,66,46,10,11,12,54,5,6,91,92,52,10,11,12,97,98,24,54,101,27,1,2,3,4,5,6,34,35,27,10,11,12,39,40,41,42,44,40,41,42,48,91,50,24,71,53,27,97,98,57,58,101,33,34,53,45,46,65,66,10,40,41,42,44,40,41,42,48,5,50,45,46,53,10,11,12,57,58,1,2,3,4,5,6,65,66,3,10,11,12,27,59,5,73,74,75,76,10,11,12,59,24,5,6,27,61,62,10,11,12,71,34,49,97,27,99,100,97,98,45,97,44,99,100,27,48,5,50,24,25,53,10,11,12,57,58,49,41,42,42,43,44,65,66,41,42,5,54,27,5,52,10,11,12,10,11,12,97,98,62,63,64,65,66,67,68,69,70,27,68,97,27,99,100,22,34,97,98,34,15,16,17,18,42,43,44,45,23,44,48,45,5,48,40,41,42,10,11,12,58,46,22,58,62,63,64,65,66,67,68,69,0,68,27,97,98,5,40,41,42,34,10,11,12,41,22,15,16,17,18,44,0,36,55,48,46,5,52,27,22,52,10,11,12,58,34,15,16,17,18,40,41,42,43,68,44,52,60,27,48,73,74,75,76,59,34,40,41,42,58,54,60,19,20,21,44,95,96,97,48,52,22,0,29,97,98,29,5,22,58,8,60,10,11,12,13,14,15,16,17,18,19,52,21,39,40,41,42,22,27,52,22,30,71,5,6,34,0,54,10,11,12,5,54,44,48,44,10,11,12,48,55,15,16,17,18,27,0,54,46,58,22,5,22,27,22,22,10,11,12,55,34,15,16,17,18,40,41,42,43,29,44,0,60,27,48,49,5,22,55,22,34,10,11,12,58,0,15,16,17,18,44,57,58,59,48,49,10,37,27,65,66,67,25,49,58,34,26,1,2,3,4,5,6,60,46,44,10,11,12,48,68,5,40,41,42,43,10,11,12,58,24,97,98,27,60,101,97,49,62,5,34,5,83,27,10,11,12,31,83,83,44,27,18,83,48,83,50,27,-1,53,44,27,-1,57,58,44,45,-1,47,48,49,50,51,52,53,54,55,56,57,58,59,1,2,3,4,5,6,-1,5,-1,10,11,12,10,11,12,-1,-1,70,71,72,73,74,75,-1,-1,-1,27,-1,-1,27,-1,-1,-1,34,-1,-1,-1,97,98,-1,-1,101,-1,44,97,98,44,48,49,50,-1,-1,53,-1,52,44,45,58,47,48,49,-1,51,52,53,54,55,56,57,58,59,1,2,3,4,5,6,-1,5,-1,10,11,12,10,11,12,-1,-1,5,-1,-1,18,-1,10,11,12,-1,27,-1,-1,27,-1,-1,-1,34,-1,-1,-1,97,98,27,-1,101,-1,44,-1,-1,44,48,-1,50,44,45,53,47,48,49,44,58,52,53,54,55,56,57,58,59,44,45,-1,47,48,49,-1,-1,52,53,54,55,56,57,58,59,44,45,-1,47,48,49,-1,-1,52,53,54,55,56,57,58,59,40,41,42,43,-1,97,98,5,-1,101,5,-1,10,11,12,10,11,12,-1,-1,-1,97,98,-1,-1,101,-1,-1,-1,27,-1,-1,27,31,-1,-1,31,97,98,44,45,101,47,48,49,-1,44,52,53,54,55,56,57,58,59,44,45,-1,47,48,49,-1,-1,52,53,54,55,56,57,58,59,44,45,-1,47,48,49,-1,-1,52,53,54,55,56,57,58,59,22,40,41,42,43,97,98,5,-1,101,-1,-1,10,11,12,37,38,39,40,41,-1,97,98,-1,46,101,-1,-1,-1,27,40,41,42,43,-1,-1,-1,97,98,44,45,101,47,48,49,-1,44,52,53,54,55,56,57,58,59,44,45,-1,47,48,49,-1,-1,52,53,54,55,56,57,58,59,44,45,-1,47,48,49,-1,-1,52,53,54,55,56,57,58,59,18,19,20,21,-1,97,98,5,-1,101,5,6,10,11,12,10,11,12,-1,-1,-1,97,98,-1,-1,101,-1,-1,-1,27,-1,-1,27,18,19,20,21,97,98,44,45,101,47,48,49,-1,44,52,53,54,55,56,57,58,59,44,45,-1,47,48,49,-1,-1,52,53,54,55,56,57,58,59,44,45,-1,47,48,49,-1,-1,52,53,54,55,56,57,58,59,-1,-1,-1,-1,8,97,98,5,-1,101,14,-1,10,11,12,19,-1,21,-1,-1,-1,97,98,-1,-1,101,30,-1,-1,27,-1,-1,-1,-1,-1,-1,-1,97,98,44,45,101,47,48,49,-1,44,52,53,54,55,56,57,58,59,44,45,-1,47,48,49,-1,-1,52,53,54,55,56,57,58,59,44,45,-1,47,48,49,42,43,52,53,54,55,56,57,58,59,-1,-1,54,-1,-1,97,98,42,43,101,62,63,64,65,66,67,68,69,70,-1,-1,97,98,-1,-1,101,-1,62,63,64,65,66,67,68,69,70,-1,97,98,44,45,101,47,48,49,-1,-1,52,53,54,55,56,57,58,59,44,45,-1,47,48,49,-1,-1,52,53,54,55,56,57,58,59,44,45,-1,47,48,49,42,43,52,53,54,55,56,57,58,59,-1,-1,-1,55,-1,97,98,42,43,101,62,63,64,65,66,67,68,69,-1,-1,-1,97,98,-1,-1,101,-1,62,63,64,65,66,67,68,69,-1,-1,97,98,44,45,101,47,48,49,-1,-1,52,53,54,55,56,57,58,59,44,45,-1,47,48,49,-1,-1,52,53,54,55,56,57,58,59,44,45,-1,47,48,49,42,43,52,53,54,55,56,57,58,59,52,-1,-1,-1,-1,97,98,42,43,101,62,63,64,65,66,67,-1,69,-1,-1,-1,97,98,-1,-1,101,-1,62,63,64,65,66,67,68,69,-1,-1,97,98,44,45,101,47,48,49,-1,-1,52,53,54,55,56,57,58,59,44,45,-1,47,48,49,-1,-1,52,53,54,55,56,57,58,59,44,45,-1,47,48,49,42,43,52,53,54,55,56,57,58,59,-1,-1,-1,-1,-1,97,98,-1,-1,101,62,63,64,65,66,67,68,69,-1,-1,-1,97,98,-1,-1,101,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,97,98,44,45,101,47,48,49,-1,-1,52,53,54,55,56,57,58,59,44,45,-1,47,48,49,-1,-1,52,53,54,55,56,57,58,59,44,45,-1,47,48,49,-1,-1,52,53,54,55,56,57,58,59,-1,-1,-1,-1,-1,97,98,-1,-1,101,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,97,98,5,-1,101,-1,-1,10,11,12,-1,-1,-1,-1,-1,-1,97,98,44,45,101,47,48,49,27,-1,52,53,54,55,56,57,58,59,1,-1,-1,4,5,6,-1,44,-1,10,11,12,-1,1,-1,52,4,5,6,-1,-1,-1,10,11,12,1,27,-1,4,5,6,-1,-1,34,10,11,12,97,98,27,-1,101,-1,44,-1,-1,34,48,49,-1,-1,27,-1,-1,-1,-1,44,58,34,5,48,-1,-1,-1,10,11,12,-1,44,-1,58,-1,48,-1,1,-1,-1,4,5,6,-1,27,58,10,11,12,1,-1,-1,4,5,6,-1,-1,-1,10,11,12,44,1,27,-1,4,5,6,-1,52,34,10,11,12,-1,27,88,89,90,91,44,93,34,-1,48,97,98,-1,27,101,-1,-1,44,-1,58,34,48,-1,-1,-1,-1,-1,-1,-1,-1,44,58,1,-1,48,4,5,6,-1,-1,-1,10,11,12,58,1,-1,-1,4,5,6,-1,-1,-1,10,11,12,1,27,-1,4,5,6,-1,-1,34,10,11,12,-1,-1,27,-1,-1,-1,44,-1,-1,34,48,-1,-1,-1,27,-1,-1,-1,-1,44,58,34,5,48,-1,-1,-1,10,11,12,-1,44,-1,58,-1,48,-1,1,-1,-1,4,5,6,-1,27,58,10,11,12,1,-1,-1,4,5,6,-1,-1,-1,10,11,12,44,1,27,-1,4,5,6,-1,52,34,10,11,12,-1,27,88,89,90,91,44,93,34,-1,48,97,98,-1,27,101,-1,-1,44,-1,58,34,48,-1,-1,-1,-1,-1,-1,-1,-1,44,58,1,-1,48,4,5,6,-1,-1,-1,10,11,12,58,1,-1,-1,4,5,6,-1,-1,-1,10,11,12,1,27,-1,4,5,6,-1,-1,34,10,11,12,-1,-1,27,-1,-1,-1,44,-1,-1,34,48,-1,-1,-1,27,-1,57,58,59,44,58,34,5,48,65,66,67,10,11,12,-1,44,-1,58,-1,48,-1,1,-1,-1,4,5,6,82,27,58,10,11,12,88,89,90,91,-1,93,-1,97,98,97,98,101,44,101,27,45,-1,47,48,49,52,34,52,53,54,55,56,57,58,59,45,44,47,48,49,48,-1,52,53,54,55,56,57,58,59,58,-1,-1,5,-1,-1,-1,-1,10,11,12,-1,-1,-1,5,-1,-1,-1,-1,10,11,12,97,98,-1,27,101,-1,-1,-1,-1,-1,34,35,-1,-1,27,97,98,-1,-1,101,44,34,5,-1,48,-1,-1,10,11,12,-1,44,45,-1,58,48,-1,-1,-1,-1,-1,5,-1,-1,27,58,10,11,12,-1,-1,34,5,-1,-1,-1,-1,10,11,12,-1,44,-1,27,-1,48,-1,-1,-1,-1,34,5,55,-1,27,58,10,11,12,-1,44,34,-1,-1,48,-1,-1,-1,52,-1,-1,44,-1,27,58,48,5,-1,-1,52,34,10,11,12,-1,58,88,89,90,91,44,93,-1,-1,48,97,98,-1,27,101,-1,-1,-1,49,58,34,52,53,54,55,56,57,58,59,-1,44,49,-1,-1,48,-1,54,55,56,57,58,59,49,-1,58,-1,-1,54,55,56,57,58,59,49,-1,-1,-1,-1,54,55,56,57,58,59,-1,-1,97,98,-1,-1,101,-1,-1,-1,-1,-1,-1,-1,-1,97,98,-1,5,101,-1,-1,-1,10,11,12,97,98,-1,22,101,-1,25,26,-1,28,29,97,98,-1,27,101,35,36,37,38,39,40,41,42,43,-1,45,46,47,-1,49,44,-1,-1,-1,54,55,56,-1,52,-1,60,61,62,63,64,65,66,67,68,69,5,-1,72,5,-1,10,11,12,10,11,12,-1,5,-1,-1,-1,-1,10,11,12,-1,-1,27,83,-1,27,-1,24,88,89,90,91,-1,93,27,-1,-1,97,98,44,-1,101,44,-1,24,42,43,52,-1,-1,52,44,-1,-1,-1,-1,-1,54,-1,52,57,24,42,43,-1,62,63,64,65,66,67,68,69,70,54,-1,-1,57,-1,42,43,-1,62,63,64,65,66,67,68,69,70,54,-1,-1,57,-1,-1,-1,-1,62,63,64,65,66,67,68,69,70,57,58,59,-1,-1,-1,-1,64,65,66,67,-1,42,43,-1,-1,-1,47,-1,-1,-1,-1,-1,-1,54,55,56,-1,-1,-1,60,61,62,63,64,65,66,67,68,69,97,98,72,-1,101,79,80,81,82,-1,-1,-1,-1,-1,88,89,90,91,-1,93,-1,-1,-1,97,98,-1,-1,101,79,80,81,82,-1,-1,-1,-1,-1,88,89,90,91,-1,93,-1,-1,-1,97,98,-1,-1,101,79,80,81,82,-1,-1,-1,-1,-1,88,89,90,91,-1,93,-1,-1,-1,97,98,-1,-1,101,79,80,81,82,-1,-1,-1,-1,-1,88,89,90,91,-1,93,-1,-1,-1,97,98,-1,-1,101,79,80,81,82,-1,-1,-1,-1,-1,88,89,90,91,-1,93,-1,-1,-1,97,98,-1,-1,101,79,80,81,82,-1,-1,-1,-1,-1,88,89,90,91,-1,93,-1,-1,-1,97,98,-1,-1,101,79,80,81,82,-1,-1,-1,-1,-1,88,89,90,91,-1,93,-1,81,82,97,98,-1,-1,101,88,89,90,91,-1,93,-1,-1,82,97,98,-1,-1,101,88,89,90,91,-1,93,-1,-1,-1,97,98,-1,-1,101,88,89,90,91,-1,93,94,-1,-1,97,98,-1,-1,101,-1,-1,104,105,88,89,90,91,-1,93,-1,-1,-1,97,98,-1,-1,101,88,89,90,91,-1,93,-1,-1,-1,97,98,-1,-1,101,88,89,90,91,-1,93,-1,-1,-1,97,98,-1,-1,101,88,89,90,91,-1,93,-1,-1,-1,97,98,-1,-1,101,88,89,90,91,-1,93,-1,-1,-1,97,98,-1,-1,101,88,89,90,91,-1,93,-1,-1,-1,97,98,-1,-1,101,88,89,90,91,-1,93,-1,-1,-1,97,98,-1,-1,101,88,89,90,91,-1,93,-1,-1,-1,97,98,-1,-1,101,88,89,90,91,-1,93,-1,-1,-1,97,98,-1,-1,101,88,89,90,91,-1,93,-1,-1,-1,97,98,-1,-1,101,88,89,90,91,-1,93,-1,-1,-1,97,98,-1,-1,101,88,89,90,91,-1,93,-1,-1,-1,97,98,-1,-1,101,88,89,90,91,-1,93,-1,-1,-1,97,98,-1,-1,101,88,89,90,91,-1,93,-1,-1,-1,97,98,-1,-1,101,88,89,90,91,-1,93,-1,-1,-1,97,98,-1,-1,101,88,89,90,91,-1,93,-1,-1,-1,97,98,-1,-1,101,88,89,90,91,-1,93,-1,-1,-1,97,98,-1,-1,101,88,89,90,91,-1,93,-1,-1,-1,97,98,-1,-1,101,88,89,90,91,-1,93,-1,-1,-1,97,98,-1,-1,101,88,89,90,91,-1,93,-1,-1,-1,97,98,-1,-1,101,88,89,90,91,-1,93,-1,-1,-1,97,98,-1,-1,101,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1
+happyCheck = Happy_Data_Array.listArray (0,3796) ([-1,4,1,20,22,47,1,1,22,32,59,2,3,32,76,77,78,32,1,61,7,12,13,80,15,16,17,35,33,20,21,36,37,27,52,26,2,3,100,101,31,32,59,100,27,32,12,13,63,15,16,17,67,33,20,21,36,51,72,20,26,2,3,100,101,31,32,104,80,81,78,12,13,78,15,16,17,100,101,20,21,100,101,45,46,26,77,78,100,54,31,32,100,101,33,100,101,100,78,102,103,100,67,102,103,100,59,102,103,100,101,77,78,100,101,3,75,76,77,78,100,101,72,46,12,13,47,15,16,17,35,54,20,21,100,101,77,78,26,78,3,100,101,31,32,35,76,77,78,12,13,22,15,16,17,56,46,20,21,100,101,100,101,26,72,3,37,38,31,32,100,101,11,78,12,13,52,15,16,17,1,26,20,21,87,33,31,32,26,77,78,67,26,31,32,100,101,100,48,26,64,65,34,22,31,32,3,41,47,59,52,38,100,101,77,78,13,35,15,16,17,60,61,20,21,67,45,46,46,26,78,3,77,78,31,32,51,100,101,77,78,13,22,15,16,17,78,62,20,21,77,78,100,101,26,100,101,22,46,31,32,7,100,101,29,9,54,11,100,101,14,78,16,100,101,78,20,21,45,46,77,78,26,14,22,16,26,31,32,20,21,31,32,100,101,26,89,100,101,39,31,32,47,100,101,77,78,100,101,47,48,1,50,51,52,60,61,55,56,57,58,59,60,61,62,23,24,25,100,101,1,31,32,77,78,77,78,77,78,23,24,25,89,76,77,78,77,78,60,61,62,27,28,100,101,72,100,101,100,101,100,101,100,101,47,41,104,100,101,100,101,47,48,1,50,51,52,77,78,55,56,57,58,59,60,61,62,45,100,101,45,46,104,91,92,93,94,55,96,26,100,101,100,101,31,32,104,91,92,93,94,38,96,26,1,22,100,101,31,32,104,28,29,1,100,101,39,26,104,26,89,26,31,32,31,32,31,32,26,72,26,100,47,31,32,31,32,5,78,47,77,78,10,11,12,60,61,89,90,30,43,44,45,33,77,78,36,3,100,27,100,101,72,100,101,78,60,78,77,78,77,78,77,78,45,46,44,100,101,77,78,77,78,76,77,78,79,100,101,100,101,100,101,100,101,100,101,59,78,89,90,0,100,101,100,101,5,100,101,8,100,10,11,12,59,22,15,16,17,18,100,101,29,100,60,61,62,47,27,47,107,30,68,69,70,34,0,42,43,44,45,5,60,61,8,44,10,11,12,48,52,15,16,17,18,5,6,45,89,58,10,11,12,27,100,101,30,89,104,100,34,0,71,72,89,90,5,27,100,101,44,10,11,12,48,100,15,16,17,18,47,43,44,45,58,100,101,52,27,104,105,45,46,53,47,34,46,71,72,49,22,60,61,62,41,44,28,60,61,48,69,70,64,0,76,77,78,79,5,58,49,8,9,10,11,12,13,14,15,16,17,18,19,72,21,47,45,46,100,101,27,100,101,30,100,104,102,34,60,61,42,43,44,45,45,47,48,44,50,51,52,48,47,55,56,57,58,59,60,61,62,58,89,60,66,60,61,0,22,42,43,25,5,100,71,8,9,10,11,12,13,14,15,16,17,18,19,46,21,62,63,64,65,66,27,41,69,30,100,101,35,34,104,74,75,76,77,78,45,47,48,44,50,51,52,48,46,55,56,57,58,59,60,61,62,58,89,60,66,100,101,0,46,54,72,49,5,100,71,8,9,10,11,12,13,14,15,16,17,18,19,22,21,89,90,100,101,28,27,104,47,30,100,101,100,34,104,1,2,3,4,5,6,60,61,44,10,11,12,48,100,101,46,89,104,49,106,35,89,58,24,5,6,27,100,101,10,11,12,100,34,89,71,42,43,44,45,21,42,43,44,45,100,27,48,89,50,45,100,53,102,103,52,57,58,55,100,56,62,63,64,65,66,67,68,69,70,1,5,53,4,5,6,10,11,12,10,11,12,43,44,45,91,92,93,94,46,96,97,49,27,100,101,27,1,104,59,4,5,6,34,89,90,10,11,12,89,44,42,43,44,45,100,35,48,52,5,100,44,45,27,10,11,12,58,32,56,34,62,63,64,65,66,67,68,69,70,44,27,93,94,48,96,89,35,34,100,101,54,46,104,58,49,46,100,44,63,100,101,48,67,1,2,3,4,5,6,44,45,58,10,11,12,27,28,15,16,17,18,68,100,101,46,23,24,49,45,27,1,2,3,4,5,6,34,52,1,10,11,12,5,6,100,101,44,10,11,12,48,94,50,24,1,53,27,100,101,57,58,104,46,34,27,49,52,65,66,100,101,42,43,44,43,44,45,48,98,50,100,44,53,45,67,48,57,58,1,2,3,4,5,6,65,66,22,10,11,12,68,73,74,75,76,77,78,42,43,44,45,24,52,46,27,1,2,3,4,5,6,34,35,54,10,11,12,5,100,101,52,44,10,11,12,48,94,50,24,54,53,27,100,101,57,58,104,33,34,27,94,95,65,66,71,10,100,101,44,6,104,8,48,3,50,59,44,53,43,44,45,57,58,1,2,3,4,5,6,65,66,71,10,11,12,5,59,45,42,43,10,11,12,98,99,100,24,5,6,27,52,55,10,11,12,54,34,27,62,63,64,65,66,67,68,69,44,68,22,27,48,5,50,45,44,53,10,11,12,57,58,46,52,22,42,43,44,65,66,41,46,5,36,27,5,22,10,11,12,10,11,12,52,52,62,63,64,65,66,67,68,69,70,27,52,49,27,54,22,100,34,102,103,34,15,16,17,18,42,43,44,45,23,44,48,55,5,48,43,44,45,10,11,12,58,60,59,58,62,63,64,65,66,67,68,69,0,68,27,52,100,5,102,103,22,34,10,11,12,29,29,15,16,17,18,44,0,22,52,48,41,5,22,27,56,52,10,11,12,58,34,15,16,17,18,22,8,54,54,68,44,71,14,27,48,44,5,19,54,21,34,10,11,12,58,48,60,22,30,55,44,43,44,45,48,22,46,0,27,43,44,45,5,22,58,8,60,10,11,12,13,14,15,16,17,18,19,29,21,55,49,43,44,45,27,22,60,30,22,5,55,34,0,22,10,11,12,5,43,44,45,44,10,11,12,48,0,15,16,17,18,27,0,10,40,58,28,5,29,27,52,63,10,11,12,63,34,15,16,17,18,49,100,49,65,52,44,0,71,27,48,49,5,19,20,21,34,10,11,12,58,86,15,16,17,18,44,60,61,62,48,49,5,86,27,68,69,70,30,30,58,34,86,1,2,3,4,5,6,86,86,44,10,11,12,48,-1,5,42,43,44,45,10,11,12,58,24,100,101,27,-1,104,19,20,21,5,34,-1,-1,27,10,11,12,31,-1,-1,44,-1,18,-1,48,-1,50,-1,-1,53,44,27,-1,57,58,47,48,-1,50,51,52,53,54,55,56,57,58,59,60,61,62,1,2,3,4,5,6,-1,5,-1,10,11,12,10,11,12,-1,-1,5,-1,87,88,-1,10,11,12,-1,27,-1,-1,27,98,99,100,34,-1,-1,-1,100,101,27,-1,104,-1,44,-1,-1,44,48,49,50,-1,-1,53,-1,52,47,48,58,50,51,52,49,54,55,56,57,58,59,60,61,62,1,2,3,4,5,6,-1,5,-1,10,11,12,10,11,12,-1,-1,5,-1,-1,18,-1,10,11,12,-1,27,-1,-1,27,98,99,100,34,-1,-1,-1,100,101,27,-1,104,-1,44,-1,-1,44,48,-1,50,47,48,53,50,51,52,44,58,55,56,57,58,59,60,61,62,47,48,-1,50,51,52,-1,-1,55,56,57,58,59,60,61,62,47,48,-1,50,51,52,-1,-1,55,56,57,58,59,60,61,62,43,44,45,46,-1,100,101,5,-1,104,5,-1,10,11,12,10,11,12,-1,-1,-1,100,101,-1,-1,104,-1,-1,-1,27,-1,-1,27,31,-1,-1,31,100,101,47,48,104,50,51,52,-1,44,55,56,57,58,59,60,61,62,47,48,-1,50,51,52,-1,-1,55,56,57,58,59,60,61,62,47,48,-1,50,51,52,-1,-1,55,56,57,58,59,60,61,62,22,43,44,45,46,100,101,5,-1,104,-1,-1,10,11,12,37,38,39,40,41,-1,100,101,-1,46,104,-1,-1,-1,27,43,44,45,46,-1,-1,-1,100,101,47,48,104,50,51,52,-1,44,55,56,57,58,59,60,61,62,47,48,-1,50,51,52,-1,-1,55,56,57,58,59,60,61,62,47,48,-1,50,51,52,42,43,55,56,57,58,59,60,61,62,-1,-1,54,-1,-1,100,101,42,43,104,62,63,64,65,66,67,68,69,70,-1,-1,100,101,-1,-1,104,-1,62,63,64,65,66,67,68,69,70,-1,100,101,47,48,104,50,51,52,-1,-1,55,56,57,58,59,60,61,62,47,48,-1,50,51,52,-1,-1,55,56,57,58,59,60,61,62,47,48,-1,50,51,52,42,43,55,56,57,58,59,60,61,62,52,43,44,45,46,100,101,42,43,104,62,63,64,65,66,67,-1,69,-1,-1,-1,100,101,-1,-1,104,-1,62,63,64,65,66,67,68,69,-1,-1,100,101,47,48,104,50,51,52,-1,-1,55,56,57,58,59,60,61,62,47,48,-1,50,51,52,-1,-1,55,56,57,58,59,60,61,62,47,48,-1,50,51,52,42,43,55,56,57,58,59,60,61,62,43,44,45,46,-1,100,101,42,43,104,62,63,64,65,66,67,68,69,-1,-1,-1,100,101,-1,-1,104,-1,62,63,64,65,66,67,68,69,-1,-1,100,101,47,48,104,50,51,52,-1,-1,55,56,57,58,59,60,61,62,47,48,-1,50,51,52,-1,-1,55,56,57,58,59,60,61,62,47,48,-1,50,51,52,-1,-1,55,56,57,58,59,60,61,62,43,44,45,46,-1,100,101,-1,-1,104,76,77,78,79,18,19,20,21,-1,-1,-1,100,101,5,6,104,-1,-1,10,11,12,-1,-1,-1,100,101,-1,100,101,47,48,104,50,51,52,27,-1,55,56,57,58,59,60,61,62,47,48,-1,50,51,52,-1,-1,55,56,57,58,59,60,61,62,47,48,-1,50,51,52,-1,-1,55,56,57,58,59,60,61,62,18,19,20,21,-1,100,101,-1,-1,104,76,77,78,79,-1,-1,-1,-1,-1,-1,-1,100,101,5,6,104,-1,-1,10,11,12,-1,-1,-1,100,101,-1,100,101,47,48,104,50,51,52,27,-1,55,56,57,58,59,60,61,62,47,48,-1,50,51,52,-1,-1,55,56,57,58,59,60,61,62,47,48,-1,50,51,52,-1,-1,55,56,57,58,59,60,61,62,-1,82,83,84,85,100,101,-1,-1,104,91,92,93,94,-1,96,-1,-1,-1,100,101,100,101,104,5,104,-1,-1,-1,10,11,12,-1,-1,-1,-1,-1,100,101,47,48,104,50,51,52,-1,27,55,56,57,58,59,60,61,62,47,48,-1,50,51,52,-1,-1,55,56,57,58,59,60,61,62,47,48,-1,50,51,52,-1,-1,55,56,57,58,59,60,61,62,-1,82,83,84,85,100,101,-1,-1,104,91,92,93,94,-1,96,-1,-1,-1,100,101,100,101,104,-1,104,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,100,101,47,48,104,50,51,52,-1,-1,55,56,57,58,59,60,61,62,47,48,-1,50,51,52,-1,-1,55,56,57,58,59,60,61,62,1,-1,-1,4,5,6,-1,84,85,10,11,12,-1,-1,91,92,93,94,-1,96,-1,100,101,100,101,104,27,104,-1,5,-1,-1,-1,34,10,11,12,100,101,-1,-1,104,-1,44,-1,-1,-1,48,49,1,-1,27,4,5,6,-1,-1,58,10,11,12,1,-1,-1,4,5,6,-1,44,-1,10,11,12,-1,1,27,52,4,5,6,-1,-1,34,10,11,12,-1,27,91,92,93,94,44,96,34,-1,48,100,101,-1,27,104,-1,-1,44,-1,58,34,48,-1,-1,-1,-1,-1,-1,-1,-1,44,58,1,-1,48,4,5,6,-1,-1,-1,10,11,12,58,1,-1,-1,4,5,6,-1,-1,-1,10,11,12,1,27,-1,4,5,6,-1,-1,34,10,11,12,-1,-1,27,-1,-1,-1,44,-1,-1,34,48,-1,-1,-1,27,-1,-1,-1,-1,44,58,34,5,48,-1,-1,-1,10,11,12,-1,44,-1,58,-1,48,-1,1,-1,-1,4,5,6,-1,27,58,10,11,12,1,-1,-1,4,5,6,-1,-1,-1,10,11,12,44,1,27,-1,4,5,6,-1,52,34,10,11,12,-1,27,91,92,93,94,44,96,34,-1,48,100,101,-1,27,104,-1,-1,44,-1,58,34,48,-1,-1,-1,-1,-1,-1,-1,-1,44,58,1,-1,48,4,5,6,-1,-1,-1,10,11,12,58,1,-1,-1,4,5,6,-1,-1,-1,10,11,12,1,27,-1,4,5,6,-1,-1,34,10,11,12,-1,-1,27,-1,-1,-1,44,-1,-1,34,48,-1,-1,-1,27,-1,-1,-1,-1,44,58,34,5,48,-1,-1,-1,10,11,12,-1,44,-1,58,-1,48,-1,1,-1,-1,4,5,6,-1,27,58,10,11,12,1,-1,-1,4,5,6,-1,-1,-1,10,11,12,44,1,27,-1,4,5,6,-1,52,34,10,11,12,-1,27,91,92,93,94,44,96,34,-1,48,100,101,-1,27,104,-1,-1,44,86,58,34,48,-1,91,92,93,94,-1,96,-1,44,58,100,101,48,-1,104,-1,48,-1,50,51,52,-1,58,55,56,57,58,59,60,61,62,48,-1,50,51,52,-1,-1,55,56,57,58,59,60,61,62,-1,-1,-1,5,-1,-1,-1,-1,10,11,12,-1,-1,-1,5,-1,-1,-1,-1,10,11,12,100,101,-1,27,104,-1,-1,-1,-1,-1,34,35,-1,-1,27,100,101,-1,-1,104,44,34,5,-1,48,-1,-1,10,11,12,-1,44,45,-1,58,48,-1,-1,-1,-1,-1,5,-1,-1,27,58,10,11,12,-1,-1,34,5,-1,-1,-1,-1,10,11,12,-1,44,-1,27,-1,48,-1,-1,-1,-1,34,5,55,-1,27,58,10,11,12,-1,44,34,-1,-1,48,-1,-1,-1,52,-1,-1,44,-1,27,58,48,5,-1,-1,52,34,10,11,12,-1,58,91,92,93,94,44,96,-1,-1,48,100,101,-1,27,104,-1,-1,-1,52,58,34,55,56,57,58,59,60,61,62,-1,44,52,-1,-1,48,-1,57,58,59,60,61,62,52,-1,58,-1,-1,57,58,59,60,61,62,52,-1,-1,-1,-1,57,58,59,60,61,62,-1,-1,100,101,52,-1,104,-1,-1,57,58,59,60,61,62,100,101,-1,-1,104,-1,-1,-1,-1,-1,-1,100,101,-1,-1,104,-1,-1,-1,-1,-1,-1,100,101,-1,-1,104,-1,-1,22,-1,-1,25,26,-1,28,29,100,101,-1,-1,104,35,36,37,38,39,40,41,42,43,-1,45,46,47,-1,49,-1,-1,5,-1,54,55,56,10,11,12,60,61,62,63,64,65,66,67,68,69,5,-1,72,5,27,10,11,12,10,11,12,-1,5,-1,-1,-1,-1,10,11,12,-1,44,27,-1,-1,27,-1,24,-1,52,-1,-1,-1,-1,27,-1,-1,-1,-1,44,-1,-1,44,-1,24,42,43,52,-1,-1,52,44,-1,-1,-1,-1,-1,54,-1,52,57,24,42,43,-1,62,63,64,65,66,67,68,69,70,54,-1,-1,57,-1,42,43,-1,62,63,64,65,66,67,68,69,70,54,-1,-1,57,-1,-1,-1,-1,62,63,64,65,66,67,68,69,70,60,61,62,-1,-1,-1,-1,67,68,69,70,-1,42,43,-1,-1,-1,47,-1,-1,-1,-1,-1,-1,54,55,56,-1,-1,-1,60,61,62,63,64,65,66,67,68,69,100,101,72,-1,104,82,83,84,85,-1,-1,-1,-1,-1,91,92,93,94,-1,96,-1,-1,-1,100,101,-1,-1,104,82,83,84,85,-1,-1,-1,-1,-1,91,92,93,94,-1,96,-1,-1,-1,100,101,-1,-1,104,82,83,84,85,-1,-1,-1,-1,-1,91,92,93,94,-1,96,-1,-1,-1,100,101,-1,-1,104,82,83,84,85,-1,-1,-1,-1,-1,91,92,93,94,-1,96,-1,-1,-1,100,101,-1,-1,104,82,83,84,85,-1,-1,-1,-1,-1,91,92,93,94,-1,96,-1,-1,85,100,101,-1,-1,104,91,92,93,94,-1,96,-1,-1,85,100,101,-1,-1,104,91,92,93,94,-1,96,-1,-1,-1,100,101,-1,-1,104,91,92,93,94,-1,96,97,-1,-1,100,101,-1,-1,104,-1,-1,107,108,91,92,93,94,-1,96,-1,-1,-1,100,101,-1,-1,104,91,92,93,94,-1,96,-1,-1,-1,100,101,-1,-1,104,91,92,93,94,-1,96,-1,-1,-1,100,101,-1,-1,104,91,92,93,94,-1,96,-1,-1,-1,100,101,-1,-1,104,91,92,93,94,-1,96,-1,-1,-1,100,101,-1,-1,104,91,92,93,94,-1,96,-1,-1,-1,100,101,-1,-1,104,91,92,93,94,-1,96,-1,-1,-1,100,101,-1,-1,104,91,92,93,94,-1,96,-1,-1,-1,100,101,-1,-1,104,91,92,93,94,-1,96,-1,-1,-1,100,101,-1,-1,104,91,92,93,94,-1,96,-1,-1,-1,100,101,-1,-1,104,91,92,93,94,-1,96,-1,-1,-1,100,101,-1,-1,104,91,92,93,94,-1,96,-1,-1,-1,100,101,-1,-1,104,91,92,93,94,-1,96,-1,-1,-1,100,101,-1,-1,104,91,92,93,94,-1,96,-1,-1,-1,100,101,-1,-1,104,91,92,93,94,-1,96,-1,-1,-1,100,101,-1,-1,104,91,92,93,94,-1,96,-1,-1,-1,100,101,-1,-1,104,91,92,93,94,-1,96,-1,-1,-1,100,101,-1,-1,104,91,92,93,94,-1,96,-1,-1,-1,100,101,-1,-1,104,91,92,93,94,-1,96,-1,-1,-1,100,101,-1,-1,104,91,92,93,94,-1,96,-1,-1,-1,100,101,-1,-1,104,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1
 	])
 
 happyTable :: Happy_Data_Array.Array Prelude.Int Prelude.Int
-happyTable = Happy_Data_Array.listArray (0,3774) ([0,616,269,350,14,201,408,628,201,151,120,131,132,500,100,151,152,272,176,-1,394,133,134,617,135,136,137,223,224,138,139,202,140,177,202,153,263,101,102,509,132,428,178,131,501,329,330,273,502,133,134,356,135,136,137,203,353,138,139,-1,140,153,242,192,314,101,102,605,132,562,14,18,351,225,226,18,351,133,134,315,135,136,137,104,105,138,139,180,140,386,444,18,351,101,102,344,18,106,40,354,41,270,40,388,41,270,18,106,180,18,160,104,105,40,180,41,395,18,160,587,151,18,160,316,151,562,237,75,76,512,18,160,132,354,18,106,18,160,151,104,105,148,134,-1,135,136,137,326,327,138,139,386,140,531,532,18,160,101,102,132,361,-25,18,106,387,388,18,19,415,134,77,135,136,137,-25,-25,138,139,377,140,132,116,18,160,101,102,101,102,347,566,134,177,135,136,137,311,228,138,139,132,140,348,349,104,105,101,102,167,229,423,177,135,136,137,151,386,138,139,236,140,589,473,157,158,101,102,18,106,558,388,104,105,104,105,234,183,100,494,433,157,158,101,102,184,233,18,160,132,103,232,495,104,105,18,106,18,106,422,384,135,136,137,18,160,138,139,374,140,183,385,104,105,101,102,18,106,313,375,120,178,121,344,179,122,166,123,-1,104,105,124,125,372,126,18,106,167,168,101,102,147,445,123,373,18,160,124,125,555,126,381,18,106,382,101,102,432,157,158,104,105,556,557,446,65,180,66,67,68,378,375,69,70,71,72,73,74,75,76,151,18,160,18,106,104,105,526,18,160,185,185,336,100,376,373,101,102,101,102,174,104,105,337,186,426,61,62,18,106,185,14,15,16,17,101,102,18,19,173,63,77,436,424,18,106,64,65,-1,66,67,68,172,305,69,70,71,72,73,74,75,76,104,105,104,105,177,147,402,488,451,101,102,101,102,101,102,40,450,267,305,104,105,101,102,18,106,18,106,18,19,151,178,20,21,311,177,366,596,18,19,101,102,77,18,106,23,145,167,367,347,25,26,27,429,157,158,104,105,104,105,104,105,549,349,496,68,281,28,104,105,190,191,73,74,75,76,180,18,160,18,106,18,106,18,106,108,104,105,146,248,23,18,106,128,386,25,26,27,18,160,109,110,111,112,486,303,368,570,388,18,106,534,28,18,19,-69,305,77,535,113,108,163,157,158,164,23,18,160,128,114,25,26,27,115,-1,109,110,111,112,461,75,76,559,116,560,18,160,28,463,207,-69,155,16,17,113,108,129,-32,303,304,23,18,389,555,114,25,26,27,115,305,109,110,111,112,359,158,569,557,116,18,19,406,28,77,156,157,158,159,23,113,301,129,-31,25,26,27,394,18,160,114,436,167,302,115,260,16,17,108,18,160,28,305,23,116,389,-69,142,25,26,143,144,-69,109,110,111,112,-69,-1,-69,303,491,434,155,151,28,292,393,-69,293,527,305,113,305,380,210,15,16,17,379,211,65,114,66,67,68,115,359,69,70,71,72,73,74,75,76,116,436,150,212,151,356,108,335,29,30,597,23,305,129,-69,142,25,26,143,144,-69,109,110,111,112,-69,334,-69,32,33,34,35,36,28,332,39,-69,18,19,333,113,77,588,472,473,157,158,328,216,65,114,66,67,68,115,329,69,70,71,72,73,74,75,76,116,318,-18,217,18,160,108,537,317,218,289,23,344,129,-69,142,25,26,143,144,-69,109,110,111,112,-69,288,-69,290,18,160,291,281,28,18,160,-69,18,19,263,113,77,79,80,81,82,23,24,242,243,114,25,26,27,115,370,16,17,541,244,245,246,274,436,116,88,23,44,28,305,509,25,26,27,305,89,513,129,248,15,16,17,397,29,30,90,214,305,28,91,436,92,466,263,93,467,18,19,94,95,193,305,194,32,33,34,215,216,37,38,39,40,56,23,45,57,23,24,25,26,27,25,26,27,307,16,17,249,50,51,52,287,53,250,459,28,18,19,28,56,54,507,57,23,24,58,303,438,25,26,27,506,171,29,30,59,252,305,505,253,370,23,244,245,281,28,25,26,27,61,500,443,58,32,33,34,35,36,37,38,39,40,59,28,276,52,253,53,303,564,113,18,19,18,19,54,61,412,488,305,162,501,325,318,115,502,79,80,81,82,23,24,151,485,116,25,26,27,524,525,83,84,85,86,182,461,18,19,87,88,409,457,28,79,80,81,82,23,24,89,454,196,25,26,27,23,24,286,287,90,25,26,27,91,258,92,88,449,93,28,18,19,94,95,256,285,89,28,458,455,96,97,456,177,478,479,90,577,124,418,91,151,92,290,197,93,623,444,198,94,95,79,80,81,82,23,24,96,97,443,25,26,27,442,23,44,254,255,431,25,26,27,18,19,88,422,256,28,79,80,81,82,23,24,89,220,28,25,26,27,268,15,16,17,90,493,16,17,91,279,92,88,129,93,28,18,19,94,95,256,448,89,45,284,285,96,97,415,308,16,17,90,449,16,17,91,23,92,624,625,93,25,26,27,94,95,79,80,81,82,23,24,96,97,412,25,26,27,28,408,23,156,157,158,159,25,26,27,407,88,23,24,28,198,199,25,26,27,129,89,283,40,28,41,42,18,160,552,40,90,41,507,28,91,23,92,293,62,93,25,26,27,94,95,622,174,17,29,30,31,96,97,309,17,23,551,28,23,546,25,26,27,25,26,27,18,410,32,33,34,35,36,37,38,39,40,28,449,40,28,41,558,151,113,18,552,113,83,84,85,86,29,30,162,163,87,162,115,537,23,115,440,16,17,25,26,27,116,332,151,116,32,33,34,35,36,37,38,39,108,358,28,18,578,23,419,16,17,113,25,26,27,530,151,109,110,111,112,162,108,528,512,115,529,23,520,28,511,519,25,26,27,116,113,109,110,111,112,297,16,17,364,182,114,518,605,28,115,156,157,158,159,604,113,539,16,17,116,513,188,576,124,418,114,244,620,281,115,602,151,108,595,18,160,592,23,151,116,-68,426,25,26,404,405,-68,109,110,111,112,-68,457,-68,239,15,16,17,151,28,586,151,-68,129,23,44,113,108,582,25,26,27,23,581,576,572,114,25,26,27,115,512,109,110,111,112,28,108,616,529,116,151,23,151,28,151,151,25,26,27,512,113,109,110,111,112,297,16,17,363,608,114,108,628,28,115,428,23,151,512,151,113,25,26,27,116,129,109,110,111,112,114,461,75,76,115,548,118,98,28,467,206,207,97,238,116,113,397,79,80,81,82,23,24,236,382,114,25,26,27,115,464,23,297,16,17,362,25,26,27,116,88,18,19,28,234,77,365,238,459,23,89,413,540,28,25,26,27,231,602,497,90,570,554,582,91,625,92,619,0,93,171,28,0,94,95,220,65,0,66,67,68,221,222,69,70,71,72,73,74,75,76,79,80,81,82,23,24,0,23,0,25,26,27,25,26,27,0,0,470,471,472,473,157,158,0,0,0,28,0,0,28,0,0,0,89,0,0,0,18,19,0,0,77,0,90,18,160,171,91,209,92,0,0,93,0,307,220,65,210,66,67,68,0,481,69,70,71,72,73,74,75,76,79,80,81,82,23,24,0,23,0,25,26,27,25,26,27,0,0,23,0,0,391,0,25,26,27,0,28,0,0,28,0,0,0,89,0,0,0,18,19,28,0,77,0,90,0,0,392,91,0,92,117,65,93,66,67,68,171,95,69,70,71,72,73,74,75,76,360,65,0,66,67,68,0,0,69,70,71,72,73,74,75,76,485,65,0,66,67,68,0,0,69,70,71,72,73,74,75,76,297,16,17,300,0,18,19,23,0,77,23,0,25,26,27,25,26,27,0,0,0,18,19,0,0,77,0,0,0,28,0,0,28,170,0,0,580,18,19,480,65,77,66,67,68,0,171,69,70,71,72,73,74,75,76,479,65,0,66,67,68,0,0,69,70,71,72,73,74,75,76,476,65,0,66,67,68,0,0,69,70,71,72,73,74,75,76,151,297,16,17,299,18,19,23,0,77,0,0,25,26,27,319,320,321,322,323,0,18,19,0,324,77,0,0,0,28,297,16,17,298,0,0,0,18,19,475,65,77,66,67,68,0,353,69,70,71,72,73,74,75,76,474,65,0,66,67,68,0,0,69,70,71,72,73,74,75,76,469,65,0,66,67,68,0,0,69,70,71,72,73,74,75,76,416,417,124,418,0,18,19,23,0,77,23,24,25,26,27,25,26,27,0,0,0,18,19,0,0,77,0,0,0,28,0,0,28,567,417,124,418,18,19,468,65,77,66,67,68,0,171,69,70,71,72,73,74,75,76,546,65,0,66,67,68,0,0,69,70,71,72,73,74,75,76,538,65,0,66,67,68,0,0,69,70,71,72,73,74,75,76,0,0,0,0,399,18,19,23,0,77,400,0,25,26,27,401,0,402,0,0,0,18,19,0,0,77,146,0,0,28,0,0,0,0,0,0,0,18,19,532,65,77,66,67,68,0,353,69,70,71,72,73,74,75,76,522,65,0,66,67,68,0,0,69,70,71,72,73,74,75,76,521,65,0,66,67,68,29,30,69,70,71,72,73,74,75,76,0,0,241,0,0,18,19,29,30,77,32,33,34,35,36,37,38,39,40,0,0,18,19,0,0,77,0,32,33,34,35,36,37,38,39,40,0,18,19,520,65,77,66,67,68,0,0,69,70,71,72,73,74,75,76,598,65,0,66,67,68,0,0,69,70,71,72,73,74,75,76,597,65,0,66,67,68,29,30,69,70,71,72,73,74,75,76,0,0,0,262,0,18,19,29,30,77,32,33,34,35,36,37,38,39,0,0,0,18,19,0,0,77,0,32,33,34,35,36,37,38,39,0,0,18,19,593,65,77,66,67,68,0,0,69,70,71,72,73,74,75,76,592,65,0,66,67,68,0,0,69,70,71,72,73,74,75,76,590,65,0,66,67,68,-239,-239,69,70,71,72,73,74,75,76,-239,0,0,0,0,18,19,-271,-271,77,-239,-239,-239,-239,-239,-239,0,-239,0,0,0,18,19,0,0,77,0,-271,-271,-271,-271,-271,-271,-271,-271,0,0,18,19,587,65,77,66,67,68,0,0,69,70,71,72,73,74,75,76,573,65,0,66,67,68,0,0,69,70,71,72,73,74,75,76,618,65,0,66,67,68,29,30,69,70,71,72,73,74,75,76,0,0,0,0,0,18,19,0,0,77,32,33,34,35,36,37,38,39,0,0,0,18,19,0,0,77,0,0,0,0,0,0,0,0,0,0,0,18,19,610,65,77,66,67,68,0,0,69,70,71,72,73,74,75,76,609,65,0,66,67,68,0,0,69,70,71,72,73,74,75,76,608,65,0,66,67,68,0,0,69,70,71,72,73,74,75,76,0,0,0,0,0,18,19,0,0,77,0,0,0,0,0,0,0,0,0,0,0,18,19,23,0,77,0,0,25,26,27,0,0,0,0,0,0,18,19,626,65,77,66,67,68,28,0,69,70,71,72,73,74,75,76,56,0,0,57,23,24,0,171,0,25,26,27,0,56,0,493,57,23,24,0,0,0,25,26,27,56,28,0,57,23,24,0,0,58,25,26,27,18,19,28,0,77,0,59,0,0,58,253,343,0,0,28,0,0,0,0,59,61,58,23,60,0,0,0,25,26,27,0,59,0,61,0,253,0,56,0,0,57,23,24,0,28,61,25,26,27,56,0,0,57,23,24,0,0,0,25,26,27,171,56,28,0,57,23,24,0,491,260,25,26,27,0,28,253,50,51,52,59,53,258,0,253,18,19,0,28,54,0,0,59,0,61,58,253,0,0,0,0,0,0,0,0,59,61,56,0,253,57,23,24,0,0,0,25,26,27,61,56,0,0,57,23,24,0,0,0,25,26,27,56,28,0,57,23,24,0,0,58,25,26,27,0,0,28,0,0,0,59,0,0,58,60,0,0,0,28,0,0,0,0,59,61,258,23,253,0,0,0,25,26,27,0,59,0,61,0,253,0,56,0,0,57,23,24,0,28,61,25,26,27,56,0,0,57,23,24,0,0,0,25,26,27,171,56,28,0,57,23,24,0,440,58,25,26,27,0,28,343,50,51,52,59,53,58,0,253,18,19,0,28,54,0,0,59,0,61,58,60,0,0,0,0,0,0,0,0,59,61,56,0,253,57,23,24,0,0,0,25,26,27,61,56,0,0,57,23,24,0,0,0,25,26,27,56,28,0,57,23,24,0,0,58,25,26,27,0,0,28,0,0,0,59,0,0,58,60,0,0,0,28,0,461,75,76,59,61,58,23,253,462,206,207,25,26,27,0,59,0,61,0,60,0,56,0,0,57,23,24,263,28,61,25,26,27,264,50,51,52,0,53,0,18,19,18,19,77,171,54,28,482,0,66,67,68,438,58,69,70,71,72,73,74,75,76,452,59,66,67,68,253,0,69,70,71,72,73,74,75,76,61,0,0,23,0,0,0,0,25,26,27,0,0,0,23,0,0,0,0,25,26,27,18,19,0,28,77,0,0,0,0,0,113,166,0,0,28,18,19,0,0,77,162,113,23,0,115,0,0,25,26,27,0,162,163,0,116,115,0,0,0,0,0,23,0,0,28,116,25,26,27,0,0,113,23,0,0,0,0,25,26,27,0,162,0,28,0,115,0,0,0,0,113,23,346,0,28,116,25,26,27,0,162,113,0,0,115,0,0,0,564,0,0,162,0,28,116,115,23,0,0,575,113,25,26,27,0,116,294,50,51,52,228,53,0,0,115,18,19,0,28,54,0,0,0,68,116,113,295,296,71,72,73,74,75,76,0,162,68,0,0,115,0,188,189,73,74,75,76,68,0,116,0,0,190,191,73,74,75,76,68,0,0,0,0,188,189,73,74,75,76,0,0,18,19,0,0,77,0,0,0,0,0,0,0,0,18,19,0,23,77,0,0,0,25,26,27,18,19,0,-286,77,0,-286,-286,0,-286,-286,18,19,0,28,77,-286,-286,-286,-286,-286,-286,-286,-286,-286,0,-286,-286,-286,0,-286,171,0,0,0,-286,-286,-286,0,566,0,-286,-286,-286,-286,-286,-286,-286,-286,-286,-286,23,0,-286,23,0,25,26,27,25,26,27,0,23,0,0,0,0,25,26,27,0,0,28,497,0,28,0,88,498,50,51,52,0,53,28,0,0,18,19,171,0,54,171,0,88,-167,-167,544,0,0,516,171,0,0,0,0,0,-167,0,573,94,88,-166,-166,0,-167,-167,-167,-167,-167,-167,-167,-167,-167,-166,0,0,94,0,-165,-165,0,-166,-166,-166,-166,-166,-166,-166,-166,-166,-165,0,0,94,0,0,0,0,-165,-165,-165,-165,-165,-165,-165,-165,-165,203,75,76,0,0,0,0,204,205,206,207,0,-290,-290,0,0,0,-290,0,0,0,0,0,0,-290,-290,-290,0,0,0,-290,-290,-290,-290,-290,-290,-290,-290,-290,-290,18,19,-290,0,77,45,46,47,48,0,0,0,0,0,49,50,51,52,0,53,0,0,0,18,19,0,0,54,349,46,47,48,0,0,0,0,0,49,50,51,52,0,53,0,0,0,18,19,0,0,54,483,46,47,48,0,0,0,0,0,49,50,51,52,0,53,0,0,0,18,19,0,0,54,420,46,47,48,0,0,0,0,0,49,50,51,52,0,53,0,0,0,18,19,0,0,54,549,46,47,48,0,0,0,0,0,49,50,51,52,0,53,0,0,0,18,19,0,0,54,613,46,47,48,0,0,0,0,0,49,50,51,52,0,53,0,0,0,18,19,0,0,54,612,46,47,48,0,0,0,0,0,49,50,51,52,0,53,0,265,48,18,19,0,0,54,266,50,51,52,0,53,0,0,263,18,19,0,0,54,274,50,51,52,0,53,0,0,0,18,19,0,0,54,337,50,51,52,0,53,338,0,0,339,19,0,0,54,0,0,340,341,278,50,51,52,0,53,0,0,0,18,19,0,0,54,277,50,51,52,0,53,0,0,0,18,19,0,0,54,275,50,51,52,0,53,0,0,0,18,19,0,0,54,503,50,51,52,0,53,0,0,0,18,19,0,0,54,502,50,51,52,0,53,0,0,0,18,19,0,0,54,489,50,51,52,0,53,0,0,0,18,19,0,0,54,435,50,51,52,0,53,0,0,0,18,19,0,0,54,431,50,51,52,0,53,0,0,0,18,19,0,0,54,544,50,51,52,0,53,0,0,0,18,19,0,0,54,542,50,51,52,0,53,0,0,0,18,19,0,0,54,533,50,51,52,0,53,0,0,0,18,19,0,0,54,516,50,51,52,0,53,0,0,0,18,19,0,0,54,514,50,51,52,0,53,0,0,0,18,19,0,0,54,498,50,51,52,0,53,0,0,0,18,19,0,0,54,600,50,51,52,0,53,0,0,0,18,19,0,0,54,599,50,51,52,0,53,0,0,0,18,19,0,0,54,584,50,51,52,0,53,0,0,0,18,19,0,0,54,583,50,51,52,0,53,0,0,0,18,19,0,0,54,614,50,51,52,0,53,0,0,0,18,19,0,0,54,611,50,51,52,0,53,0,0,0,18,19,0,0,54,606,50,51,52,0,53,0,0,0,18,19,0,0,54,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
+happyTable = Happy_Data_Array.listArray (0,3796) ([0,394,269,14,272,386,408,201,151,350,120,131,132,636,433,157,158,500,201,388,624,133,134,428,135,136,137,353,178,138,139,329,330,202,273,140,509,132,18,160,101,102,131,153,202,625,133,134,501,135,136,137,502,178,138,139,179,203,-1,14,140,611,132,18,19,101,102,412,151,152,354,133,134,180,135,136,137,18,351,138,139,18,351,378,375,140,104,105,153,377,101,102,18,160,192,18,160,40,180,41,395,40,177,41,270,40,100,41,270,18,106,104,105,18,351,132,595,473,157,158,18,160,-1,183,148,134,242,135,136,137,444,184,138,139,18,106,104,105,140,180,132,18,160,101,102,374,432,157,158,415,134,151,135,136,137,263,375,138,139,18,106,18,160,140,-1,132,531,532,101,102,18,160,566,354,570,134,176,135,136,137,234,116,138,139,494,566,101,102,140,104,105,177,314,101,102,18,160,495,384,100,198,199,356,151,101,102,132,315,-25,385,311,103,18,106,104,105,423,372,135,136,137,-25,-25,138,139,177,326,327,373,140,180,132,104,105,101,102,336,18,106,104,105,422,151,135,136,137,344,337,138,139,104,105,18,160,140,18,106,151,183,101,102,236,18,106,526,120,313,121,18,160,122,361,123,18,106,344,124,125,376,373,104,105,126,147,445,123,185,101,102,124,125,101,102,18,160,126,228,18,160,186,101,102,386,18,106,104,105,167,229,446,65,233,66,67,68,387,388,69,70,71,72,73,74,75,76,538,539,540,18,106,232,223,224,104,105,359,158,104,105,617,539,540,166,429,157,158,104,105,237,75,76,61,62,167,168,-1,18,106,18,160,18,106,18,19,185,63,77,18,160,18,106,64,65,174,66,67,68,225,226,69,70,71,72,73,74,75,76,591,18,19,325,318,77,541,50,51,52,512,53,100,18,106,18,19,101,102,54,541,50,51,52,426,53,185,173,151,18,19,101,102,54,524,525,172,18,19,424,177,77,402,436,451,101,102,101,102,101,102,450,-1,177,305,347,101,102,101,102,23,486,147,104,105,25,26,27,348,349,303,368,146,155,16,17,178,104,105,311,145,305,28,18,160,-1,18,106,537,406,344,104,105,104,105,104,105,286,287,171,18,106,104,105,104,105,156,157,158,159,18,160,18,160,18,106,18,106,18,106,394,180,303,304,108,18,106,18,106,23,18,160,128,305,25,26,27,393,151,109,110,111,112,18,160,602,534,461,75,76,389,28,386,535,-69,467,206,207,113,108,14,15,16,17,23,562,388,128,114,25,26,27,115,380,109,110,111,112,23,44,379,488,116,25,26,27,28,18,19,-69,366,77,305,113,108,129,-32,303,491,23,28,167,367,114,25,26,27,115,305,109,110,111,112,359,308,16,17,116,18,19,356,28,20,21,284,285,45,559,113,381,129,-31,382,151,461,75,76,334,114,527,560,561,115,463,207,335,108,156,157,158,159,23,116,333,-69,142,25,26,143,144,-69,109,110,111,112,-69,-1,-69,347,632,633,18,160,28,18,19,-69,40,77,267,113,553,349,210,15,16,17,328,211,65,114,66,67,68,115,386,69,70,71,72,73,74,75,76,116,436,150,212,574,388,108,151,29,30,316,23,305,129,-69,142,25,26,143,144,-69,109,110,111,112,-69,332,-69,32,33,34,35,36,28,329,39,-69,18,19,317,113,77,594,472,473,157,158,288,216,65,114,66,67,68,115,318,69,70,71,72,73,74,75,76,116,434,-18,217,18,160,108,292,289,218,293,23,305,129,-69,142,25,26,143,144,-69,109,110,111,112,-69,151,-69,303,438,18,19,603,28,409,559,-69,18,19,305,113,77,79,80,81,82,23,24,573,561,114,25,26,27,115,18,19,290,301,193,291,194,281,436,116,88,23,44,28,167,302,25,26,27,305,89,545,129,248,15,16,17,397,29,30,90,214,305,28,91,436,92,274,40,93,41,42,466,94,95,467,305,263,32,33,34,215,216,37,38,39,40,56,23,45,57,23,24,25,26,27,25,26,27,260,16,17,249,50,51,52,287,53,250,459,28,18,19,28,56,54,509,57,23,24,58,303,568,25,26,27,513,171,29,30,59,252,305,507,253,370,23,305,174,17,28,25,26,27,61,500,263,58,32,33,34,35,36,37,38,39,40,59,28,276,52,253,53,436,506,113,18,19,505,285,54,61,458,443,305,162,501,18,389,115,502,79,80,81,82,23,24,309,17,116,25,26,27,293,62,83,84,85,86,182,18,410,455,87,88,456,488,28,79,80,81,82,23,24,89,485,196,25,26,27,23,24,18,556,90,25,26,27,91,258,92,88,461,93,28,18,19,94,95,256,290,89,28,631,457,96,97,18,582,478,479,90,370,16,17,91,496,92,281,197,93,454,177,198,94,95,79,80,81,82,23,24,96,97,151,25,26,27,449,470,471,472,473,157,158,268,15,16,17,88,444,443,28,79,80,81,82,23,24,89,220,442,25,26,27,23,18,160,431,90,25,26,27,91,279,92,88,422,93,28,18,19,94,95,256,448,89,28,254,255,96,97,129,415,18,19,90,563,256,564,91,412,92,408,353,93,307,16,17,94,95,79,80,81,82,23,24,96,97,129,25,26,27,23,407,556,29,30,25,26,27,244,245,281,88,23,24,28,550,262,25,26,27,555,89,28,32,33,34,35,36,37,38,39,90,449,151,28,91,23,92,537,171,93,25,26,27,94,95,332,307,151,29,30,31,96,97,530,529,23,528,28,23,151,25,26,27,25,26,27,520,519,32,33,34,35,36,37,38,39,40,28,518,248,28,513,511,40,113,41,507,113,83,84,85,86,29,30,162,163,87,162,115,512,23,115,493,16,17,25,26,27,116,611,610,116,32,33,34,35,36,37,38,39,108,358,28,608,40,23,41,562,151,113,25,26,27,601,598,109,110,111,112,162,108,151,457,115,593,23,151,28,592,590,25,26,27,116,113,109,110,111,112,151,399,586,585,182,114,129,400,28,115,580,23,401,624,402,113,25,26,27,116,576,188,151,146,512,114,449,16,17,115,151,529,108,28,440,16,17,23,151,116,-68,426,25,26,404,405,-68,109,110,111,112,-68,614,-68,512,155,419,16,17,28,151,636,-68,151,23,512,113,108,151,25,26,27,23,543,16,17,114,25,26,27,115,129,109,110,111,112,28,108,118,98,116,97,23,397,28,238,236,25,26,27,234,113,109,110,111,112,382,365,283,459,238,114,108,464,28,115,428,23,581,124,418,113,25,26,27,116,544,109,110,111,112,114,461,75,76,115,552,413,608,28,462,206,207,574,627,116,113,497,79,80,81,82,23,24,586,633,114,25,26,27,115,0,23,239,15,16,17,25,26,27,116,88,18,19,28,0,77,580,124,418,23,89,0,0,28,25,26,27,231,0,0,90,0,558,0,91,0,92,0,0,93,171,28,0,94,95,220,65,0,66,67,68,221,222,69,70,71,72,73,74,75,76,79,80,81,82,23,24,0,23,0,25,26,27,25,26,27,0,0,23,0,242,243,0,25,26,27,0,28,0,0,28,244,245,246,89,0,0,0,18,19,28,0,77,0,90,0,0,171,91,209,92,0,0,93,0,493,220,65,210,66,67,68,630,481,69,70,71,72,73,74,75,76,79,80,81,82,23,24,0,23,0,25,26,27,25,26,27,0,0,23,0,0,391,0,25,26,27,0,28,0,0,28,244,628,281,89,0,0,0,18,19,28,0,77,0,90,0,0,392,91,0,92,117,65,93,66,67,68,171,95,69,70,71,72,73,74,75,76,360,65,0,66,67,68,0,0,69,70,71,72,73,74,75,76,485,65,0,66,67,68,0,0,69,70,71,72,73,74,75,76,297,16,17,364,0,18,19,23,0,77,23,0,25,26,27,25,26,27,0,0,0,18,19,0,0,77,0,0,0,28,0,0,28,170,0,0,584,18,19,480,65,77,66,67,68,0,171,69,70,71,72,73,74,75,76,479,65,0,66,67,68,0,0,69,70,71,72,73,74,75,76,476,65,0,66,67,68,0,0,69,70,71,72,73,74,75,76,151,297,16,17,363,18,19,23,0,77,0,0,25,26,27,319,320,321,322,323,0,18,19,0,324,77,0,0,0,28,297,16,17,362,0,0,0,18,19,475,65,77,66,67,68,0,353,69,70,71,72,73,74,75,76,474,65,0,66,67,68,0,0,69,70,71,72,73,74,75,76,469,65,0,66,67,68,29,30,69,70,71,72,73,74,75,76,0,0,241,0,0,18,19,29,30,77,32,33,34,35,36,37,38,39,40,0,0,18,19,0,0,77,0,32,33,34,35,36,37,38,39,40,0,18,19,468,65,77,66,67,68,0,0,69,70,71,72,73,74,75,76,550,65,0,66,67,68,0,0,69,70,71,72,73,74,75,76,542,65,0,66,67,68,-243,-243,69,70,71,72,73,74,75,76,-243,297,16,17,300,18,19,29,30,77,-243,-243,-243,-243,-243,-243,0,-243,0,0,0,18,19,0,0,77,0,32,33,34,35,36,37,38,39,0,0,18,19,532,65,77,66,67,68,0,0,69,70,71,72,73,74,75,76,522,65,0,66,67,68,0,0,69,70,71,72,73,74,75,76,521,65,0,66,67,68,-275,-275,69,70,71,72,73,74,75,76,297,16,17,299,0,18,19,29,30,77,-275,-275,-275,-275,-275,-275,-275,-275,0,0,0,18,19,0,0,77,0,32,33,34,35,36,37,38,39,0,0,18,19,520,65,77,66,67,68,0,0,69,70,71,72,73,74,75,76,604,65,0,66,67,68,0,0,69,70,71,72,73,74,75,76,603,65,0,66,67,68,0,0,69,70,71,72,73,74,75,76,297,16,17,298,0,18,19,0,0,77,163,157,158,164,416,417,124,418,0,0,0,18,19,23,44,77,0,0,25,26,27,0,0,0,18,160,0,18,19,599,65,77,66,67,68,28,0,69,70,71,72,73,74,75,76,598,65,0,66,67,68,0,0,69,70,71,72,73,74,75,76,596,65,0,66,67,68,0,0,69,70,71,72,73,74,75,76,571,417,124,418,0,18,19,0,0,77,156,157,158,159,0,0,0,0,0,0,0,18,19,23,24,77,0,0,25,26,27,0,0,0,18,160,0,18,19,593,65,77,66,67,68,28,0,69,70,71,72,73,74,75,76,577,65,0,66,67,68,0,0,69,70,71,72,73,74,75,76,626,65,0,66,67,68,0,0,69,70,71,72,73,74,75,76,0,45,46,47,48,18,19,0,0,77,49,50,51,52,0,53,0,0,0,18,19,18,19,54,23,77,0,0,0,25,26,27,0,0,0,0,0,18,19,618,65,77,66,67,68,0,28,69,70,71,72,73,74,75,76,616,65,0,66,67,68,0,0,69,70,71,72,73,74,75,76,615,65,0,66,67,68,0,0,69,70,71,72,73,74,75,76,0,349,46,47,48,18,19,0,0,77,49,50,51,52,0,53,0,0,0,18,19,18,19,54,0,77,0,0,0,0,0,0,0,0,0,0,0,18,19,614,65,77,66,67,68,0,0,69,70,71,72,73,74,75,76,634,65,0,66,67,68,0,0,69,70,71,72,73,74,75,76,56,0,0,57,23,24,0,265,48,25,26,27,0,0,266,50,51,52,0,53,0,18,19,18,19,77,28,54,0,23,0,0,0,58,25,26,27,18,19,0,0,77,0,59,0,0,0,253,343,56,0,28,57,23,24,0,0,61,25,26,27,56,0,0,57,23,24,0,171,0,25,26,27,0,56,28,491,57,23,24,0,0,58,25,26,27,0,28,253,50,51,52,59,53,58,0,60,18,19,0,28,54,0,0,59,0,61,260,253,0,0,0,0,0,0,0,0,59,61,56,0,253,57,23,24,0,0,0,25,26,27,61,56,0,0,57,23,24,0,0,0,25,26,27,56,28,0,57,23,24,0,0,258,25,26,27,0,0,28,0,0,0,59,0,0,58,253,0,0,0,28,0,0,0,0,59,61,58,23,253,0,0,0,25,26,27,0,59,0,61,0,60,0,56,0,0,57,23,24,0,28,61,25,26,27,56,0,0,57,23,24,0,0,0,25,26,27,171,56,28,0,57,23,24,0,440,58,25,26,27,0,28,343,50,51,52,59,53,258,0,253,18,19,0,28,54,0,0,59,0,61,58,253,0,0,0,0,0,0,0,0,59,61,56,0,253,57,23,24,0,0,0,25,26,27,61,56,0,0,57,23,24,0,0,0,25,26,27,56,28,0,57,23,24,0,0,58,25,26,27,0,0,28,0,0,0,59,0,0,58,60,0,0,0,28,0,0,0,0,59,61,58,23,253,0,0,0,25,26,27,0,59,0,61,0,60,0,56,0,0,57,23,24,0,28,61,25,26,27,56,0,0,57,23,24,0,0,0,25,26,27,171,56,28,0,57,23,24,0,438,58,25,26,27,0,28,294,50,51,52,59,53,58,0,253,18,19,0,28,54,0,0,59,497,61,58,60,0,498,50,51,52,0,53,0,59,61,18,19,253,0,54,0,482,0,66,67,68,0,61,69,70,71,72,73,74,75,76,452,0,66,67,68,0,0,69,70,71,72,73,74,75,76,0,0,0,23,0,0,0,0,25,26,27,0,0,0,23,0,0,0,0,25,26,27,18,19,0,28,77,0,0,0,0,0,113,166,0,0,28,18,19,0,0,77,162,113,23,0,115,0,0,25,26,27,0,162,163,0,116,115,0,0,0,0,0,23,0,0,28,116,25,26,27,0,0,113,23,0,0,0,0,25,26,27,0,162,0,28,0,115,0,0,0,0,113,23,346,0,28,116,25,26,27,0,162,113,0,0,115,0,0,0,568,0,0,162,0,28,116,115,23,0,0,579,113,25,26,27,0,116,278,50,51,52,228,53,0,0,115,18,19,0,28,54,0,0,0,68,116,113,295,296,71,72,73,74,75,76,0,162,68,0,0,115,0,190,191,73,74,75,76,68,0,116,0,0,188,189,73,74,75,76,68,0,0,0,0,190,191,73,74,75,76,0,0,18,19,68,0,77,0,0,188,189,73,74,75,76,18,19,0,0,77,0,0,0,0,0,0,18,19,0,0,77,0,0,0,0,0,0,18,19,0,0,77,0,0,-290,0,0,-290,-290,0,-290,-290,18,19,0,0,77,-290,-290,-290,-290,-290,-290,-290,-290,-290,0,-290,-290,-290,0,-290,0,0,23,0,-290,-290,-290,25,26,27,-290,-290,-290,-290,-290,-290,-290,-290,-290,-290,23,0,-290,23,28,25,26,27,25,26,27,0,23,0,0,0,0,25,26,27,0,171,28,0,0,28,0,88,0,570,0,0,0,0,28,0,0,0,0,171,0,0,171,0,88,-171,-171,548,0,0,516,171,0,0,0,0,0,-171,0,577,94,88,-170,-170,0,-171,-171,-171,-171,-171,-171,-171,-171,-171,-170,0,0,94,0,-169,-169,0,-170,-170,-170,-170,-170,-170,-170,-170,-170,-169,0,0,94,0,0,0,0,-169,-169,-169,-169,-169,-169,-169,-169,-169,203,75,76,0,0,0,0,204,205,206,207,0,-294,-294,0,0,0,-294,0,0,0,0,0,0,-294,-294,-294,0,0,0,-294,-294,-294,-294,-294,-294,-294,-294,-294,-294,18,19,-294,0,77,483,46,47,48,0,0,0,0,0,49,50,51,52,0,53,0,0,0,18,19,0,0,54,420,46,47,48,0,0,0,0,0,49,50,51,52,0,53,0,0,0,18,19,0,0,54,553,46,47,48,0,0,0,0,0,49,50,51,52,0,53,0,0,0,18,19,0,0,54,621,46,47,48,0,0,0,0,0,49,50,51,52,0,53,0,0,0,18,19,0,0,54,620,46,47,48,0,0,0,0,0,49,50,51,52,0,53,0,0,263,18,19,0,0,54,264,50,51,52,0,53,0,0,263,18,19,0,0,54,274,50,51,52,0,53,0,0,0,18,19,0,0,54,337,50,51,52,0,53,338,0,0,339,19,0,0,54,0,0,340,341,277,50,51,52,0,53,0,0,0,18,19,0,0,54,275,50,51,52,0,53,0,0,0,18,19,0,0,54,503,50,51,52,0,53,0,0,0,18,19,0,0,54,502,50,51,52,0,53,0,0,0,18,19,0,0,54,489,50,51,52,0,53,0,0,0,18,19,0,0,54,435,50,51,52,0,53,0,0,0,18,19,0,0,54,431,50,51,52,0,53,0,0,0,18,19,0,0,54,548,50,51,52,0,53,0,0,0,18,19,0,0,54,546,50,51,52,0,53,0,0,0,18,19,0,0,54,533,50,51,52,0,53,0,0,0,18,19,0,0,54,516,50,51,52,0,53,0,0,0,18,19,0,0,54,514,50,51,52,0,53,0,0,0,18,19,0,0,54,498,50,51,52,0,53,0,0,0,18,19,0,0,54,606,50,51,52,0,53,0,0,0,18,19,0,0,54,605,50,51,52,0,53,0,0,0,18,19,0,0,54,588,50,51,52,0,53,0,0,0,18,19,0,0,54,587,50,51,52,0,53,0,0,0,18,19,0,0,54,622,50,51,52,0,53,0,0,0,18,19,0,0,54,619,50,51,52,0,53,0,0,0,18,19,0,0,54,612,50,51,52,0,53,0,0,0,18,19,0,0,54,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
 	])
 
-happyReduceArr = Happy_Data_Array.array (12, 325) [
+happyReduceArr = Happy_Data_Array.array (12, 329) [
 	(12 , happyReduce_12),
 	(13 , happyReduce_13),
 	(14 , happyReduce_14),
@@ -469,11 +470,15 @@ happyReduceArr = Happy_Data_Array.array (12, 325) [
 	(322 , happyReduce_322),
 	(323 , happyReduce_323),
 	(324 , happyReduce_324),
-	(325 , happyReduce_325)
+	(325 , happyReduce_325),
+	(326 , happyReduce_326),
+	(327 , happyReduce_327),
+	(328 , happyReduce_328),
+	(329 , happyReduce_329)
 	]
 
 happy_n_terms = 73 :: Prelude.Int
-happy_n_nonterms = 106 :: Prelude.Int
+happy_n_nonterms = 109 :: Prelude.Int
 
 happyReduce_12 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
 happyReduce_12 = happySpecReduce_2  0 happyReduction_12
@@ -500,7 +505,7 @@ happyReduction_14 (_ `HappyStk`
 	(HappyAbsSyn17  happy_var_4) `HappyStk`
 	_ `HappyStk`
 	_ `HappyStk`
-	(HappyAbsSyn114  happy_var_1) `HappyStk`
+	(HappyAbsSyn117  happy_var_1) `HappyStk`
 	happyRest)
 	 = HappyAbsSyn15
 		 (mkModule happy_var_1 happy_var_4
@@ -512,9 +517,9 @@ happyReduction_15 (_ `HappyStk`
 	(HappyAbsSyn17  happy_var_6) `HappyStk`
 	_ `HappyStk`
 	_ `HappyStk`
-	(HappyAbsSyn114  happy_var_3) `HappyStk`
+	(HappyAbsSyn117  happy_var_3) `HappyStk`
 	_ `HappyStk`
-	(HappyAbsSyn114  happy_var_1) `HappyStk`
+	(HappyAbsSyn117  happy_var_1) `HappyStk`
 	happyRest)
 	 = HappyAbsSyn15
 		 (mkModuleInstance happy_var_1 happy_var_3 happy_var_6
@@ -557,7 +562,7 @@ happyReduction_18 ((HappyAbsSyn21  happy_var_4) `HappyStk`
 
 happyReduce_19 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
 happyReduce_19 = happySpecReduce_2  4 happyReduction_19
-happyReduction_19 (HappyAbsSyn116  happy_var_2)
+happyReduction_19 (HappyAbsSyn119  happy_var_2)
 	_
 	 =  HappyAbsSyn19
 		 (ImpNested `fmap` happy_var_2
@@ -566,7 +571,7 @@ happyReduction_19 _ _  = notHappyAtAll
 
 happyReduce_20 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
 happyReduce_20 = happySpecReduce_1  4 happyReduction_20
-happyReduction_20 (HappyAbsSyn114  happy_var_1)
+happyReduction_20 (HappyAbsSyn117  happy_var_1)
 	 =  HappyAbsSyn19
 		 (ImpTop `fmap` happy_var_1
 	)
@@ -574,7 +579,7 @@ happyReduction_20 _  = notHappyAtAll
 
 happyReduce_21 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
 happyReduce_21 = happySpecReduce_2  5 happyReduction_21
-happyReduction_21 (HappyAbsSyn114  happy_var_2)
+happyReduction_21 (HappyAbsSyn117  happy_var_2)
 	_
 	 =  HappyAbsSyn20
 		 (Just happy_var_2
@@ -611,7 +616,7 @@ happyReduction_24  =  HappyAbsSyn21
 
 happyReduce_25 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
 happyReduce_25 = happySpecReduce_3  7 happyReduction_25
-happyReduction_25 (HappyAbsSyn44  happy_var_3)
+happyReduction_25 (HappyAbsSyn47  happy_var_3)
 	_
 	(HappyAbsSyn22  happy_var_1)
 	 =  HappyAbsSyn22
@@ -621,7 +626,7 @@ happyReduction_25 _ _ _  = notHappyAtAll
 
 happyReduce_26 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
 happyReduce_26 = happySpecReduce_1  7 happyReduction_26
-happyReduction_26 (HappyAbsSyn44  happy_var_1)
+happyReduction_26 (HappyAbsSyn47  happy_var_1)
 	 =  HappyAbsSyn22
 		 ([fmap getIdent happy_var_1]
 	)
@@ -727,7 +732,7 @@ happyReduction_38 _ _ _  = notHappyAtAll
 
 happyReduce_39 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
 happyReduce_39 = happySpecReduce_1  13 happyReduction_39
-happyReduction_39 (HappyAbsSyn38  happy_var_1)
+happyReduction_39 (HappyAbsSyn41  happy_var_1)
 	 =  HappyAbsSyn17
 		 ([exportDecl Nothing   Public happy_var_1]
 	)
@@ -735,7 +740,7 @@ happyReduction_39 _  = notHappyAtAll
 
 happyReduce_40 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
 happyReduce_40 = happySpecReduce_2  13 happyReduction_40
-happyReduction_40 (HappyAbsSyn38  happy_var_2)
+happyReduction_40 (HappyAbsSyn41  happy_var_2)
 	(HappyAbsSyn35  happy_var_1)
 	 =  HappyAbsSyn17
 		 ([exportDecl (Just happy_var_1) Public happy_var_2]
@@ -753,10 +758,10 @@ happyReduction_41 ((HappyTerminal (happy_var_3@(Located _ (Token (StrLit {}) _))
 
 happyReduce_42 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
 happyReduce_42 = happyReduce 6 13 happyReduction_42
-happyReduction_42 ((HappyAbsSyn59  happy_var_6) `HappyStk`
+happyReduction_42 ((HappyAbsSyn62  happy_var_6) `HappyStk`
 	_ `HappyStk`
-	(HappyAbsSyn45  happy_var_4) `HappyStk`
-	(HappyAbsSyn44  happy_var_3) `HappyStk`
+	(HappyAbsSyn48  happy_var_4) `HappyStk`
+	(HappyAbsSyn47  happy_var_3) `HappyStk`
 	_ `HappyStk`
 	(HappyAbsSyn36  happy_var_1) `HappyStk`
 	happyRest)
@@ -766,9 +771,9 @@ happyReduction_42 ((HappyAbsSyn59  happy_var_6) `HappyStk`
 
 happyReduce_43 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
 happyReduce_43 = happyReduce 5 13 happyReduction_43
-happyReduction_43 ((HappyAbsSyn59  happy_var_5) `HappyStk`
+happyReduction_43 ((HappyAbsSyn62  happy_var_5) `HappyStk`
 	_ `HappyStk`
-	(HappyAbsSyn44  happy_var_3) `HappyStk`
+	(HappyAbsSyn47  happy_var_3) `HappyStk`
 	_ `HappyStk`
 	(HappyAbsSyn36  happy_var_1) `HappyStk`
 	happyRest)
@@ -778,7 +783,7 @@ happyReduction_43 ((HappyAbsSyn59  happy_var_5) `HappyStk`
 
 happyReduce_44 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
 happyReduce_44 = happySpecReduce_2  13 happyReduction_44
-happyReduction_44 (HappyAbsSyn41  happy_var_2)
+happyReduction_44 (HappyAbsSyn44  happy_var_2)
 	(HappyAbsSyn36  happy_var_1)
 	 =  HappyAbsSyn17
 		 ([exportNewtype Public happy_var_1 happy_var_2]
@@ -828,7 +833,7 @@ happyReduction_49 _  = notHappyAtAll
 
 happyReduce_50 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
 happyReduce_50 = happySpecReduce_1  14 happyReduction_50
-happyReduction_50 (HappyAbsSyn38  happy_var_1)
+happyReduction_50 (HappyAbsSyn41  happy_var_1)
 	 =  HappyAbsSyn17
 		 ([Decl (TopLevel {tlExport = Public, tlValue = happy_var_1 })]
 	)
@@ -875,9 +880,9 @@ happyReduction_54 (_ `HappyStk`
 
 happyReduce_55 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
 happyReduce_55 = happyReduce 5 16 happyReduction_55
-happyReduction_55 ((HappyAbsSyn94  happy_var_5) `HappyStk`
+happyReduction_55 ((HappyAbsSyn97  happy_var_5) `HappyStk`
 	_ `HappyStk`
-	(HappyAbsSyn44  happy_var_3) `HappyStk`
+	(HappyAbsSyn47  happy_var_3) `HappyStk`
 	_ `HappyStk`
 	(HappyAbsSyn36  happy_var_1) `HappyStk`
 	happyRest)
@@ -887,10 +892,10 @@ happyReduction_55 ((HappyAbsSyn94  happy_var_5) `HappyStk`
 
 happyReduce_56 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
 happyReduce_56 = happyReduce 7 16 happyReduction_56
-happyReduction_56 ((HappyAbsSyn94  happy_var_7) `HappyStk`
+happyReduction_56 ((HappyAbsSyn97  happy_var_7) `HappyStk`
 	_ `HappyStk`
 	_ `HappyStk`
-	(HappyAbsSyn44  happy_var_4) `HappyStk`
+	(HappyAbsSyn47  happy_var_4) `HappyStk`
 	_ `HappyStk`
 	_ `HappyStk`
 	(HappyAbsSyn36  happy_var_1) `HappyStk`
@@ -901,9 +906,9 @@ happyReduction_56 ((HappyAbsSyn94  happy_var_7) `HappyStk`
 
 happyReduce_57 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
 happyReduce_57 = happyMonadReduce 6 16 happyReduction_57
-happyReduction_57 ((HappyAbsSyn98  happy_var_6) `HappyStk`
+happyReduction_57 ((HappyAbsSyn101  happy_var_6) `HappyStk`
 	_ `HappyStk`
-	(HappyAbsSyn94  happy_var_4) `HappyStk`
+	(HappyAbsSyn97  happy_var_4) `HappyStk`
 	_ `HappyStk`
 	_ `HappyStk`
 	(HappyAbsSyn36  happy_var_1) `HappyStk`
@@ -964,9 +969,9 @@ happyReduction_62 _ _ _  = notHappyAtAll
 
 happyReduce_63 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
 happyReduce_63 = happyReduce 4 19 happyReduction_63
-happyReduction_63 ((HappyAbsSyn94  happy_var_4) `HappyStk`
+happyReduction_63 ((HappyAbsSyn97  happy_var_4) `HappyStk`
 	_ `HappyStk`
-	(HappyAbsSyn44  happy_var_2) `HappyStk`
+	(HappyAbsSyn47  happy_var_2) `HappyStk`
 	(HappyAbsSyn36  happy_var_1) `HappyStk`
 	happyRest)
 	 = HappyAbsSyn34
@@ -975,9 +980,9 @@ happyReduction_63 ((HappyAbsSyn94  happy_var_4) `HappyStk`
 
 happyReduce_64 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
 happyReduce_64 = happyMonadReduce 5 19 happyReduction_64
-happyReduction_64 ((HappyAbsSyn98  happy_var_5) `HappyStk`
+happyReduction_64 ((HappyAbsSyn101  happy_var_5) `HappyStk`
 	_ `HappyStk`
-	(HappyAbsSyn44  happy_var_3) `HappyStk`
+	(HappyAbsSyn47  happy_var_3) `HappyStk`
 	_ `HappyStk`
 	(HappyAbsSyn36  happy_var_1) `HappyStk`
 	happyRest) tk
@@ -986,7 +991,7 @@ happyReduction_64 ((HappyAbsSyn98  happy_var_5) `HappyStk`
 
 happyReduce_65 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
 happyReduce_65 = happyMonadReduce 4 19 happyReduction_65
-happyReduction_65 ((HappyAbsSyn103  happy_var_4) `HappyStk`
+happyReduction_65 ((HappyAbsSyn106  happy_var_4) `HappyStk`
 	_ `HappyStk`
 	_ `HappyStk`
 	_ `HappyStk`
@@ -1018,75 +1023,112 @@ happyReduction_68  =  HappyAbsSyn36
 	)
 
 happyReduce_69 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_69 = happySpecReduce_1  22 happyReduction_69
-happyReduction_69 _
+happyReduce_69 = happySpecReduce_2  22 happyReduction_69
+happyReduction_69 (HappyAbsSyn37  happy_var_2)
+	_
 	 =  HappyAbsSyn37
-		 ([]
+		 (happy_var_2
 	)
+happyReduction_69 _ _  = notHappyAtAll 
 
 happyReduce_70 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
 happyReduce_70 = happySpecReduce_3  23 happyReduction_70
-happyReduction_70 (HappyAbsSyn94  happy_var_3)
+happyReduction_70 (HappyAbsSyn37  happy_var_3)
+	(HappyTerminal (Located happy_var_2 (Token (Sym Bar     ) _)))
 	_
-	(HappyAbsSyn43  happy_var_1)
-	 =  HappyAbsSyn38
-		 (at (head happy_var_1,happy_var_3) $ DSignature (reverse happy_var_1) happy_var_3
+	 =  HappyAbsSyn37
+		 (happy_var_2 ++ happy_var_3
 	)
 happyReduction_70 _ _ _  = notHappyAtAll 
 
 happyReduce_71 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_71 = happySpecReduce_3  23 happyReduction_71
-happyReduction_71 (HappyAbsSyn59  happy_var_3)
+happyReduce_71 = happySpecReduce_1  23 happyReduction_71
+happyReduction_71 (HappyAbsSyn37  happy_var_1)
+	 =  HappyAbsSyn37
+		 (happy_var_1
+	)
+happyReduction_71 _  = notHappyAtAll 
+
+happyReduce_72 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_72 = happySpecReduce_3  24 happyReduction_72
+happyReduction_72 (HappyAbsSyn62  happy_var_3)
 	_
-	(HappyAbsSyn88  happy_var_1)
-	 =  HappyAbsSyn38
+	(HappyAbsSyn40  happy_var_1)
+	 =  HappyAbsSyn37
+		 ([(happy_var_1, happy_var_3)]
+	)
+happyReduction_72 _ _ _  = notHappyAtAll 
+
+happyReduce_73 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_73 = happyMonadReduce 1 25 happyReduction_73
+happyReduction_73 ((HappyAbsSyn106  happy_var_1) `HappyStk`
+	happyRest) tk
+	 = happyThen ((( fmap thing (mkProp happy_var_1)))
+	) (\r -> happyReturn (HappyAbsSyn40 r))
+
+happyReduce_74 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_74 = happySpecReduce_3  26 happyReduction_74
+happyReduction_74 (HappyAbsSyn97  happy_var_3)
+	_
+	(HappyAbsSyn46  happy_var_1)
+	 =  HappyAbsSyn41
+		 (at (head happy_var_1,happy_var_3) $ DSignature (reverse happy_var_1) happy_var_3
+	)
+happyReduction_74 _ _ _  = notHappyAtAll 
+
+happyReduce_75 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_75 = happySpecReduce_3  26 happyReduction_75
+happyReduction_75 (HappyAbsSyn62  happy_var_3)
+	_
+	(HappyAbsSyn91  happy_var_1)
+	 =  HappyAbsSyn41
 		 (at (happy_var_1,happy_var_3) $ DPatBind happy_var_1 happy_var_3
 	)
-happyReduction_71 _ _ _  = notHappyAtAll 
+happyReduction_75 _ _ _  = notHappyAtAll 
 
-happyReduce_72 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_72 = happyReduce 5 23 happyReduction_72
-happyReduction_72 ((HappyAbsSyn59  happy_var_5) `HappyStk`
+happyReduce_76 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_76 = happyReduce 5 26 happyReduction_76
+happyReduction_76 ((HappyAbsSyn62  happy_var_5) `HappyStk`
 	_ `HappyStk`
 	_ `HappyStk`
-	(HappyAbsSyn44  happy_var_2) `HappyStk`
+	(HappyAbsSyn47  happy_var_2) `HappyStk`
 	(HappyTerminal (Located happy_var_1 (Token (Sym ParenL  ) _))) `HappyStk`
 	happyRest)
-	 = HappyAbsSyn38
+	 = HappyAbsSyn41
 		 (at (happy_var_1,happy_var_5) $ DPatBind (PVar happy_var_2) happy_var_5
 	) `HappyStk` happyRest
 
-happyReduce_73 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_73 = happyReduce 4 23 happyReduction_73
-happyReduction_73 ((HappyAbsSyn37  happy_var_4) `HappyStk`
+happyReduce_77 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_77 = happyReduce 4 26 happyReduction_77
+happyReduction_77 ((HappyAbsSyn37  happy_var_4) `HappyStk`
 	_ `HappyStk`
-	(HappyAbsSyn48  happy_var_2) `HappyStk`
-	(HappyAbsSyn44  happy_var_1) `HappyStk`
+	(HappyAbsSyn51  happy_var_2) `HappyStk`
+	(HappyAbsSyn47  happy_var_1) `HappyStk`
 	happyRest)
-	 = HappyAbsSyn38
-		 (at (happy_var_1,happy_var_4) $ mkIndexedPropGuardsDecl happy_var_1 happy_var_2 happy_var_4
+	 = HappyAbsSyn41
+		 (mkIndexedPropGuardsDecl happy_var_1 happy_var_2 happy_var_4
 	) `HappyStk` happyRest
 
-happyReduce_74 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_74 = happyReduce 4 23 happyReduction_74
-happyReduction_74 ((HappyAbsSyn59  happy_var_4) `HappyStk`
+happyReduce_78 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_78 = happyReduce 4 26 happyReduction_78
+happyReduction_78 ((HappyAbsSyn62  happy_var_4) `HappyStk`
 	_ `HappyStk`
-	(HappyAbsSyn48  happy_var_2) `HappyStk`
-	(HappyAbsSyn44  happy_var_1) `HappyStk`
+	(HappyAbsSyn51  happy_var_2) `HappyStk`
+	(HappyAbsSyn47  happy_var_1) `HappyStk`
 	happyRest)
-	 = HappyAbsSyn38
+	 = HappyAbsSyn41
 		 (at (happy_var_1,happy_var_4) $ mkIndexedDecl happy_var_1 happy_var_2 happy_var_4
 	) `HappyStk` happyRest
 
-happyReduce_75 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_75 = happyReduce 5 23 happyReduction_75
-happyReduction_75 ((HappyAbsSyn59  happy_var_5) `HappyStk`
+happyReduce_79 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_79 = happyReduce 5 26 happyReduction_79
+happyReduction_79 ((HappyAbsSyn62  happy_var_5) `HappyStk`
 	_ `HappyStk`
-	(HappyAbsSyn88  happy_var_3) `HappyStk`
-	(HappyAbsSyn44  happy_var_2) `HappyStk`
-	(HappyAbsSyn88  happy_var_1) `HappyStk`
+	(HappyAbsSyn91  happy_var_3) `HappyStk`
+	(HappyAbsSyn47  happy_var_2) `HappyStk`
+	(HappyAbsSyn91  happy_var_1) `HappyStk`
 	happyRest)
-	 = HappyAbsSyn38
+	 = HappyAbsSyn41
 		 (at (happy_var_1,happy_var_5) $
                              DBind $ Bind { bName      = happy_var_2
                                           , bParams    = [happy_var_1,happy_var_3]
@@ -1101,182 +1143,182 @@ happyReduction_75 ((HappyAbsSyn59  happy_var_5) `HappyStk`
                                           }
 	) `HappyStk` happyRest
 
-happyReduce_76 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_76 = happyMonadReduce 4 23 happyReduction_76
-happyReduction_76 ((HappyAbsSyn103  happy_var_4) `HappyStk`
+happyReduce_80 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_80 = happyMonadReduce 4 26 happyReduction_80
+happyReduction_80 ((HappyAbsSyn106  happy_var_4) `HappyStk`
 	_ `HappyStk`
-	(HappyAbsSyn44  happy_var_2) `HappyStk`
+	(HappyAbsSyn47  happy_var_2) `HappyStk`
 	(HappyTerminal (Located happy_var_1 (Token (KW KW_type   ) _))) `HappyStk`
 	happyRest) tk
 	 = happyThen ((( at (happy_var_1,happy_var_4) `fmap` mkTySyn happy_var_2 [] happy_var_4))
-	) (\r -> happyReturn (HappyAbsSyn38 r))
+	) (\r -> happyReturn (HappyAbsSyn41 r))
 
-happyReduce_77 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_77 = happyMonadReduce 5 23 happyReduction_77
-happyReduction_77 ((HappyAbsSyn103  happy_var_5) `HappyStk`
+happyReduce_81 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_81 = happyMonadReduce 5 26 happyReduction_81
+happyReduction_81 ((HappyAbsSyn106  happy_var_5) `HappyStk`
 	_ `HappyStk`
-	(HappyAbsSyn100  happy_var_3) `HappyStk`
-	(HappyAbsSyn44  happy_var_2) `HappyStk`
+	(HappyAbsSyn103  happy_var_3) `HappyStk`
+	(HappyAbsSyn47  happy_var_2) `HappyStk`
 	(HappyTerminal (Located happy_var_1 (Token (KW KW_type   ) _))) `HappyStk`
 	happyRest) tk
 	 = happyThen ((( at (happy_var_1,happy_var_5) `fmap` mkTySyn happy_var_2 (reverse happy_var_3) happy_var_5))
-	) (\r -> happyReturn (HappyAbsSyn38 r))
+	) (\r -> happyReturn (HappyAbsSyn41 r))
 
-happyReduce_78 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_78 = happyMonadReduce 6 23 happyReduction_78
-happyReduction_78 ((HappyAbsSyn103  happy_var_6) `HappyStk`
+happyReduce_82 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_82 = happyMonadReduce 6 26 happyReduction_82
+happyReduction_82 ((HappyAbsSyn106  happy_var_6) `HappyStk`
 	_ `HappyStk`
-	(HappyAbsSyn99  happy_var_4) `HappyStk`
-	(HappyAbsSyn44  happy_var_3) `HappyStk`
-	(HappyAbsSyn99  happy_var_2) `HappyStk`
+	(HappyAbsSyn102  happy_var_4) `HappyStk`
+	(HappyAbsSyn47  happy_var_3) `HappyStk`
+	(HappyAbsSyn102  happy_var_2) `HappyStk`
 	(HappyTerminal (Located happy_var_1 (Token (KW KW_type   ) _))) `HappyStk`
 	happyRest) tk
 	 = happyThen ((( at (happy_var_1,happy_var_6) `fmap` mkTySyn happy_var_3 [happy_var_2, happy_var_4] happy_var_6))
-	) (\r -> happyReturn (HappyAbsSyn38 r))
+	) (\r -> happyReturn (HappyAbsSyn41 r))
 
-happyReduce_79 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_79 = happyMonadReduce 5 23 happyReduction_79
-happyReduction_79 ((HappyAbsSyn103  happy_var_5) `HappyStk`
+happyReduce_83 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_83 = happyMonadReduce 5 26 happyReduction_83
+happyReduction_83 ((HappyAbsSyn106  happy_var_5) `HappyStk`
 	_ `HappyStk`
-	(HappyAbsSyn44  happy_var_3) `HappyStk`
+	(HappyAbsSyn47  happy_var_3) `HappyStk`
 	(HappyTerminal (Located happy_var_2 (Token (KW KW_constraint) _))) `HappyStk`
 	_ `HappyStk`
 	happyRest) tk
 	 = happyThen ((( at (happy_var_2,happy_var_5) `fmap` mkPropSyn happy_var_3 [] happy_var_5))
-	) (\r -> happyReturn (HappyAbsSyn38 r))
+	) (\r -> happyReturn (HappyAbsSyn41 r))
 
-happyReduce_80 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_80 = happyMonadReduce 6 23 happyReduction_80
-happyReduction_80 ((HappyAbsSyn103  happy_var_6) `HappyStk`
+happyReduce_84 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_84 = happyMonadReduce 6 26 happyReduction_84
+happyReduction_84 ((HappyAbsSyn106  happy_var_6) `HappyStk`
 	_ `HappyStk`
-	(HappyAbsSyn100  happy_var_4) `HappyStk`
-	(HappyAbsSyn44  happy_var_3) `HappyStk`
+	(HappyAbsSyn103  happy_var_4) `HappyStk`
+	(HappyAbsSyn47  happy_var_3) `HappyStk`
 	(HappyTerminal (Located happy_var_2 (Token (KW KW_constraint) _))) `HappyStk`
 	_ `HappyStk`
 	happyRest) tk
 	 = happyThen ((( at (happy_var_2,happy_var_6) `fmap` mkPropSyn happy_var_3 (reverse happy_var_4) happy_var_6))
-	) (\r -> happyReturn (HappyAbsSyn38 r))
+	) (\r -> happyReturn (HappyAbsSyn41 r))
 
-happyReduce_81 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_81 = happyMonadReduce 7 23 happyReduction_81
-happyReduction_81 ((HappyAbsSyn103  happy_var_7) `HappyStk`
+happyReduce_85 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_85 = happyMonadReduce 7 26 happyReduction_85
+happyReduction_85 ((HappyAbsSyn106  happy_var_7) `HappyStk`
 	_ `HappyStk`
-	(HappyAbsSyn99  happy_var_5) `HappyStk`
-	(HappyAbsSyn44  happy_var_4) `HappyStk`
-	(HappyAbsSyn99  happy_var_3) `HappyStk`
+	(HappyAbsSyn102  happy_var_5) `HappyStk`
+	(HappyAbsSyn47  happy_var_4) `HappyStk`
+	(HappyAbsSyn102  happy_var_3) `HappyStk`
 	(HappyTerminal (Located happy_var_2 (Token (KW KW_constraint) _))) `HappyStk`
 	_ `HappyStk`
 	happyRest) tk
 	 = happyThen ((( at (happy_var_2,happy_var_7) `fmap` mkPropSyn happy_var_4 [happy_var_3, happy_var_5] happy_var_7))
-	) (\r -> happyReturn (HappyAbsSyn38 r))
+	) (\r -> happyReturn (HappyAbsSyn41 r))
 
-happyReduce_82 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_82 = happyMonadReduce 3 23 happyReduction_82
-happyReduction_82 ((HappyAbsSyn58  happy_var_3) `HappyStk`
+happyReduce_86 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_86 = happyMonadReduce 3 26 happyReduction_86
+happyReduction_86 ((HappyAbsSyn61  happy_var_3) `HappyStk`
 	(HappyTerminal (happy_var_2@(Located _ (Token (Num   {}) _)))) `HappyStk`
 	_ `HappyStk`
 	happyRest) tk
 	 = happyThen ((( mkFixity LeftAssoc  happy_var_2 (reverse happy_var_3)))
-	) (\r -> happyReturn (HappyAbsSyn38 r))
+	) (\r -> happyReturn (HappyAbsSyn41 r))
 
-happyReduce_83 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_83 = happyMonadReduce 3 23 happyReduction_83
-happyReduction_83 ((HappyAbsSyn58  happy_var_3) `HappyStk`
+happyReduce_87 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_87 = happyMonadReduce 3 26 happyReduction_87
+happyReduction_87 ((HappyAbsSyn61  happy_var_3) `HappyStk`
 	(HappyTerminal (happy_var_2@(Located _ (Token (Num   {}) _)))) `HappyStk`
 	_ `HappyStk`
 	happyRest) tk
 	 = happyThen ((( mkFixity RightAssoc happy_var_2 (reverse happy_var_3)))
-	) (\r -> happyReturn (HappyAbsSyn38 r))
+	) (\r -> happyReturn (HappyAbsSyn41 r))
 
-happyReduce_84 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_84 = happyMonadReduce 3 23 happyReduction_84
-happyReduction_84 ((HappyAbsSyn58  happy_var_3) `HappyStk`
+happyReduce_88 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_88 = happyMonadReduce 3 26 happyReduction_88
+happyReduction_88 ((HappyAbsSyn61  happy_var_3) `HappyStk`
 	(HappyTerminal (happy_var_2@(Located _ (Token (Num   {}) _)))) `HappyStk`
 	_ `HappyStk`
 	happyRest) tk
 	 = happyThen ((( mkFixity NonAssoc   happy_var_2 (reverse happy_var_3)))
-	) (\r -> happyReturn (HappyAbsSyn38 r))
+	) (\r -> happyReturn (HappyAbsSyn41 r))
 
-happyReduce_85 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_85 = happyMonadReduce 1 23 happyReduction_85
-happyReduction_85 (_ `HappyStk`
+happyReduce_89 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_89 = happyMonadReduce 1 26 happyReduction_89
+happyReduction_89 (_ `HappyStk`
 	happyRest) tk
 	 = happyThen ((( expected "a declaration"))
-	) (\r -> happyReturn (HappyAbsSyn38 r))
+	) (\r -> happyReturn (HappyAbsSyn41 r))
 
-happyReduce_86 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_86 = happySpecReduce_1  24 happyReduction_86
-happyReduction_86 (HappyAbsSyn38  happy_var_1)
-	 =  HappyAbsSyn39
+happyReduce_90 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_90 = happySpecReduce_1  27 happyReduction_90
+happyReduction_90 (HappyAbsSyn41  happy_var_1)
+	 =  HappyAbsSyn42
 		 ([happy_var_1]
 	)
-happyReduction_86 _  = notHappyAtAll 
+happyReduction_90 _  = notHappyAtAll 
 
-happyReduce_87 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_87 = happySpecReduce_2  24 happyReduction_87
-happyReduction_87 _
-	(HappyAbsSyn38  happy_var_1)
-	 =  HappyAbsSyn39
+happyReduce_91 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_91 = happySpecReduce_2  27 happyReduction_91
+happyReduction_91 _
+	(HappyAbsSyn41  happy_var_1)
+	 =  HappyAbsSyn42
 		 ([happy_var_1]
 	)
-happyReduction_87 _ _  = notHappyAtAll 
+happyReduction_91 _ _  = notHappyAtAll 
 
-happyReduce_88 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_88 = happySpecReduce_3  24 happyReduction_88
-happyReduction_88 (HappyAbsSyn39  happy_var_3)
+happyReduce_92 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_92 = happySpecReduce_3  27 happyReduction_92
+happyReduction_92 (HappyAbsSyn42  happy_var_3)
 	_
-	(HappyAbsSyn38  happy_var_1)
-	 =  HappyAbsSyn39
+	(HappyAbsSyn41  happy_var_1)
+	 =  HappyAbsSyn42
 		 ((happy_var_1:happy_var_3)
 	)
-happyReduction_88 _ _ _  = notHappyAtAll 
+happyReduction_92 _ _ _  = notHappyAtAll 
 
-happyReduce_89 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_89 = happyReduce 4 25 happyReduction_89
-happyReduction_89 ((HappyAbsSyn59  happy_var_4) `HappyStk`
+happyReduce_93 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_93 = happyReduce 4 28 happyReduction_93
+happyReduction_93 ((HappyAbsSyn62  happy_var_4) `HappyStk`
 	_ `HappyStk`
-	(HappyAbsSyn88  happy_var_2) `HappyStk`
+	(HappyAbsSyn91  happy_var_2) `HappyStk`
 	_ `HappyStk`
 	happyRest)
-	 = HappyAbsSyn38
+	 = HappyAbsSyn41
 		 (at (happy_var_2,happy_var_4) $ DPatBind happy_var_2 happy_var_4
 	) `HappyStk` happyRest
 
-happyReduce_90 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_90 = happyReduce 5 25 happyReduction_90
-happyReduction_90 ((HappyAbsSyn59  happy_var_5) `HappyStk`
+happyReduce_94 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_94 = happyReduce 5 28 happyReduction_94
+happyReduction_94 ((HappyAbsSyn62  happy_var_5) `HappyStk`
 	_ `HappyStk`
-	(HappyAbsSyn48  happy_var_3) `HappyStk`
-	(HappyAbsSyn44  happy_var_2) `HappyStk`
+	(HappyAbsSyn51  happy_var_3) `HappyStk`
+	(HappyAbsSyn47  happy_var_2) `HappyStk`
 	_ `HappyStk`
 	happyRest)
-	 = HappyAbsSyn38
+	 = HappyAbsSyn41
 		 (at (happy_var_2,happy_var_5) $ mkIndexedDecl happy_var_2 happy_var_3 happy_var_5
 	) `HappyStk` happyRest
 
-happyReduce_91 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_91 = happyReduce 6 25 happyReduction_91
-happyReduction_91 ((HappyAbsSyn59  happy_var_6) `HappyStk`
+happyReduce_95 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_95 = happyReduce 6 28 happyReduction_95
+happyReduction_95 ((HappyAbsSyn62  happy_var_6) `HappyStk`
 	_ `HappyStk`
 	_ `HappyStk`
-	(HappyAbsSyn44  happy_var_3) `HappyStk`
+	(HappyAbsSyn47  happy_var_3) `HappyStk`
 	(HappyTerminal (Located happy_var_2 (Token (Sym ParenL  ) _))) `HappyStk`
 	_ `HappyStk`
 	happyRest)
-	 = HappyAbsSyn38
+	 = HappyAbsSyn41
 		 (at (happy_var_2,happy_var_6) $ DPatBind (PVar happy_var_3) happy_var_6
 	) `HappyStk` happyRest
 
-happyReduce_92 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_92 = happyReduce 6 25 happyReduction_92
-happyReduction_92 ((HappyAbsSyn59  happy_var_6) `HappyStk`
+happyReduce_96 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_96 = happyReduce 6 28 happyReduction_96
+happyReduction_96 ((HappyAbsSyn62  happy_var_6) `HappyStk`
 	_ `HappyStk`
-	(HappyAbsSyn88  happy_var_4) `HappyStk`
-	(HappyAbsSyn44  happy_var_3) `HappyStk`
-	(HappyAbsSyn88  happy_var_2) `HappyStk`
+	(HappyAbsSyn91  happy_var_4) `HappyStk`
+	(HappyAbsSyn47  happy_var_3) `HappyStk`
+	(HappyAbsSyn91  happy_var_2) `HappyStk`
 	_ `HappyStk`
 	happyRest)
-	 = HappyAbsSyn38
+	 = HappyAbsSyn41
 		 (at (happy_var_2,happy_var_6) $
                              DBind $ Bind { bName      = happy_var_3
                                           , bParams    = [happy_var_2,happy_var_4]
@@ -1291,2109 +1333,2109 @@ happyReduction_92 ((HappyAbsSyn59  happy_var_6) `HappyStk`
                                           }
 	) `HappyStk` happyRest
 
-happyReduce_93 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_93 = happyReduce 4 25 happyReduction_93
-happyReduction_93 ((HappyAbsSyn94  happy_var_4) `HappyStk`
+happyReduce_97 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_97 = happyReduce 4 28 happyReduction_97
+happyReduction_97 ((HappyAbsSyn97  happy_var_4) `HappyStk`
 	_ `HappyStk`
-	(HappyAbsSyn43  happy_var_2) `HappyStk`
+	(HappyAbsSyn46  happy_var_2) `HappyStk`
 	_ `HappyStk`
 	happyRest)
-	 = HappyAbsSyn38
+	 = HappyAbsSyn41
 		 (at (head happy_var_2,happy_var_4) $ DSignature (reverse happy_var_2) happy_var_4
 	) `HappyStk` happyRest
 
-happyReduce_94 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_94 = happyMonadReduce 4 25 happyReduction_94
-happyReduction_94 ((HappyAbsSyn103  happy_var_4) `HappyStk`
+happyReduce_98 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_98 = happyMonadReduce 4 28 happyReduction_98
+happyReduction_98 ((HappyAbsSyn106  happy_var_4) `HappyStk`
 	_ `HappyStk`
-	(HappyAbsSyn44  happy_var_2) `HappyStk`
+	(HappyAbsSyn47  happy_var_2) `HappyStk`
 	(HappyTerminal (Located happy_var_1 (Token (KW KW_type   ) _))) `HappyStk`
 	happyRest) tk
 	 = happyThen ((( at (happy_var_1,happy_var_4) `fmap` mkTySyn happy_var_2 [] happy_var_4))
-	) (\r -> happyReturn (HappyAbsSyn38 r))
+	) (\r -> happyReturn (HappyAbsSyn41 r))
 
-happyReduce_95 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_95 = happyMonadReduce 5 25 happyReduction_95
-happyReduction_95 ((HappyAbsSyn103  happy_var_5) `HappyStk`
+happyReduce_99 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_99 = happyMonadReduce 5 28 happyReduction_99
+happyReduction_99 ((HappyAbsSyn106  happy_var_5) `HappyStk`
 	_ `HappyStk`
-	(HappyAbsSyn100  happy_var_3) `HappyStk`
-	(HappyAbsSyn44  happy_var_2) `HappyStk`
+	(HappyAbsSyn103  happy_var_3) `HappyStk`
+	(HappyAbsSyn47  happy_var_2) `HappyStk`
 	(HappyTerminal (Located happy_var_1 (Token (KW KW_type   ) _))) `HappyStk`
 	happyRest) tk
 	 = happyThen ((( at (happy_var_1,happy_var_5) `fmap` mkTySyn happy_var_2 (reverse happy_var_3) happy_var_5))
-	) (\r -> happyReturn (HappyAbsSyn38 r))
+	) (\r -> happyReturn (HappyAbsSyn41 r))
 
-happyReduce_96 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_96 = happyMonadReduce 6 25 happyReduction_96
-happyReduction_96 ((HappyAbsSyn103  happy_var_6) `HappyStk`
+happyReduce_100 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_100 = happyMonadReduce 6 28 happyReduction_100
+happyReduction_100 ((HappyAbsSyn106  happy_var_6) `HappyStk`
 	_ `HappyStk`
-	(HappyAbsSyn99  happy_var_4) `HappyStk`
-	(HappyAbsSyn44  happy_var_3) `HappyStk`
-	(HappyAbsSyn99  happy_var_2) `HappyStk`
+	(HappyAbsSyn102  happy_var_4) `HappyStk`
+	(HappyAbsSyn47  happy_var_3) `HappyStk`
+	(HappyAbsSyn102  happy_var_2) `HappyStk`
 	(HappyTerminal (Located happy_var_1 (Token (KW KW_type   ) _))) `HappyStk`
 	happyRest) tk
 	 = happyThen ((( at (happy_var_1,happy_var_6) `fmap` mkTySyn happy_var_3 [happy_var_2, happy_var_4] happy_var_6))
-	) (\r -> happyReturn (HappyAbsSyn38 r))
+	) (\r -> happyReturn (HappyAbsSyn41 r))
 
-happyReduce_97 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_97 = happyMonadReduce 5 25 happyReduction_97
-happyReduction_97 ((HappyAbsSyn103  happy_var_5) `HappyStk`
+happyReduce_101 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_101 = happyMonadReduce 5 28 happyReduction_101
+happyReduction_101 ((HappyAbsSyn106  happy_var_5) `HappyStk`
 	_ `HappyStk`
-	(HappyAbsSyn44  happy_var_3) `HappyStk`
+	(HappyAbsSyn47  happy_var_3) `HappyStk`
 	(HappyTerminal (Located happy_var_2 (Token (KW KW_constraint) _))) `HappyStk`
 	_ `HappyStk`
 	happyRest) tk
 	 = happyThen ((( at (happy_var_2,happy_var_5) `fmap` mkPropSyn happy_var_3 [] happy_var_5))
-	) (\r -> happyReturn (HappyAbsSyn38 r))
+	) (\r -> happyReturn (HappyAbsSyn41 r))
 
-happyReduce_98 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_98 = happyMonadReduce 6 25 happyReduction_98
-happyReduction_98 ((HappyAbsSyn103  happy_var_6) `HappyStk`
+happyReduce_102 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_102 = happyMonadReduce 6 28 happyReduction_102
+happyReduction_102 ((HappyAbsSyn106  happy_var_6) `HappyStk`
 	_ `HappyStk`
-	(HappyAbsSyn100  happy_var_4) `HappyStk`
-	(HappyAbsSyn44  happy_var_3) `HappyStk`
+	(HappyAbsSyn103  happy_var_4) `HappyStk`
+	(HappyAbsSyn47  happy_var_3) `HappyStk`
 	(HappyTerminal (Located happy_var_2 (Token (KW KW_constraint) _))) `HappyStk`
 	_ `HappyStk`
 	happyRest) tk
 	 = happyThen ((( at (happy_var_2,happy_var_6) `fmap` mkPropSyn happy_var_3 (reverse happy_var_4) happy_var_6))
-	) (\r -> happyReturn (HappyAbsSyn38 r))
+	) (\r -> happyReturn (HappyAbsSyn41 r))
 
-happyReduce_99 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_99 = happyMonadReduce 7 25 happyReduction_99
-happyReduction_99 ((HappyAbsSyn103  happy_var_7) `HappyStk`
+happyReduce_103 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_103 = happyMonadReduce 7 28 happyReduction_103
+happyReduction_103 ((HappyAbsSyn106  happy_var_7) `HappyStk`
 	_ `HappyStk`
-	(HappyAbsSyn99  happy_var_5) `HappyStk`
-	(HappyAbsSyn44  happy_var_4) `HappyStk`
-	(HappyAbsSyn99  happy_var_3) `HappyStk`
+	(HappyAbsSyn102  happy_var_5) `HappyStk`
+	(HappyAbsSyn47  happy_var_4) `HappyStk`
+	(HappyAbsSyn102  happy_var_3) `HappyStk`
 	(HappyTerminal (Located happy_var_2 (Token (KW KW_constraint) _))) `HappyStk`
 	_ `HappyStk`
 	happyRest) tk
 	 = happyThen ((( at (happy_var_2,happy_var_7) `fmap` mkPropSyn happy_var_4 [happy_var_3, happy_var_5] happy_var_7))
-	) (\r -> happyReturn (HappyAbsSyn38 r))
+	) (\r -> happyReturn (HappyAbsSyn41 r))
 
-happyReduce_100 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_100 = happyMonadReduce 3 25 happyReduction_100
-happyReduction_100 ((HappyAbsSyn58  happy_var_3) `HappyStk`
+happyReduce_104 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_104 = happyMonadReduce 3 28 happyReduction_104
+happyReduction_104 ((HappyAbsSyn61  happy_var_3) `HappyStk`
 	(HappyTerminal (happy_var_2@(Located _ (Token (Num   {}) _)))) `HappyStk`
 	_ `HappyStk`
 	happyRest) tk
 	 = happyThen ((( mkFixity LeftAssoc  happy_var_2 (reverse happy_var_3)))
-	) (\r -> happyReturn (HappyAbsSyn38 r))
+	) (\r -> happyReturn (HappyAbsSyn41 r))
 
-happyReduce_101 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_101 = happyMonadReduce 3 25 happyReduction_101
-happyReduction_101 ((HappyAbsSyn58  happy_var_3) `HappyStk`
+happyReduce_105 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_105 = happyMonadReduce 3 28 happyReduction_105
+happyReduction_105 ((HappyAbsSyn61  happy_var_3) `HappyStk`
 	(HappyTerminal (happy_var_2@(Located _ (Token (Num   {}) _)))) `HappyStk`
 	_ `HappyStk`
 	happyRest) tk
 	 = happyThen ((( mkFixity RightAssoc happy_var_2 (reverse happy_var_3)))
-	) (\r -> happyReturn (HappyAbsSyn38 r))
+	) (\r -> happyReturn (HappyAbsSyn41 r))
 
-happyReduce_102 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_102 = happyMonadReduce 3 25 happyReduction_102
-happyReduction_102 ((HappyAbsSyn58  happy_var_3) `HappyStk`
+happyReduce_106 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_106 = happyMonadReduce 3 28 happyReduction_106
+happyReduction_106 ((HappyAbsSyn61  happy_var_3) `HappyStk`
 	(HappyTerminal (happy_var_2@(Located _ (Token (Num   {}) _)))) `HappyStk`
 	_ `HappyStk`
 	happyRest) tk
 	 = happyThen ((( mkFixity NonAssoc   happy_var_2 (reverse happy_var_3)))
-	) (\r -> happyReturn (HappyAbsSyn38 r))
+	) (\r -> happyReturn (HappyAbsSyn41 r))
 
-happyReduce_103 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_103 = happyReduce 4 26 happyReduction_103
-happyReduction_103 ((HappyAbsSyn42  happy_var_4) `HappyStk`
+happyReduce_107 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_107 = happyReduce 4 29 happyReduction_107
+happyReduction_107 ((HappyAbsSyn45  happy_var_4) `HappyStk`
 	_ `HappyStk`
-	(HappyAbsSyn116  happy_var_2) `HappyStk`
+	(HappyAbsSyn119  happy_var_2) `HappyStk`
 	_ `HappyStk`
 	happyRest)
-	 = HappyAbsSyn41
+	 = HappyAbsSyn44
 		 (Newtype happy_var_2 [] (thing happy_var_4)
 	) `HappyStk` happyRest
 
-happyReduce_104 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_104 = happyReduce 5 26 happyReduction_104
-happyReduction_104 ((HappyAbsSyn42  happy_var_5) `HappyStk`
+happyReduce_108 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_108 = happyReduce 5 29 happyReduction_108
+happyReduction_108 ((HappyAbsSyn45  happy_var_5) `HappyStk`
 	_ `HappyStk`
-	(HappyAbsSyn100  happy_var_3) `HappyStk`
-	(HappyAbsSyn116  happy_var_2) `HappyStk`
+	(HappyAbsSyn103  happy_var_3) `HappyStk`
+	(HappyAbsSyn119  happy_var_2) `HappyStk`
 	_ `HappyStk`
 	happyRest)
-	 = HappyAbsSyn41
+	 = HappyAbsSyn44
 		 (Newtype happy_var_2 (reverse happy_var_3) (thing happy_var_5)
 	) `HappyStk` happyRest
 
-happyReduce_105 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_105 = happyMonadReduce 2 27 happyReduction_105
-happyReduction_105 ((HappyTerminal (Located happy_var_2 (Token (Sym CurlyR  ) _))) `HappyStk`
+happyReduce_109 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_109 = happyMonadReduce 2 30 happyReduction_109
+happyReduction_109 ((HappyTerminal (Located happy_var_2 (Token (Sym CurlyR  ) _))) `HappyStk`
 	(HappyTerminal (Located happy_var_1 (Token (Sym CurlyL  ) _))) `HappyStk`
 	happyRest) tk
 	 = happyThen ((( mkRecord (rComb happy_var_1 happy_var_2) (Located emptyRange) []))
-	) (\r -> happyReturn (HappyAbsSyn42 r))
+	) (\r -> happyReturn (HappyAbsSyn45 r))
 
-happyReduce_106 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_106 = happyMonadReduce 3 27 happyReduction_106
-happyReduction_106 ((HappyTerminal (Located happy_var_3 (Token (Sym CurlyR  ) _))) `HappyStk`
-	(HappyAbsSyn111  happy_var_2) `HappyStk`
+happyReduce_110 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_110 = happyMonadReduce 3 30 happyReduction_110
+happyReduction_110 ((HappyTerminal (Located happy_var_3 (Token (Sym CurlyR  ) _))) `HappyStk`
+	(HappyAbsSyn114  happy_var_2) `HappyStk`
 	(HappyTerminal (Located happy_var_1 (Token (Sym CurlyL  ) _))) `HappyStk`
 	happyRest) tk
 	 = happyThen ((( mkRecord (rComb happy_var_1 happy_var_3) (Located emptyRange) happy_var_2))
-	) (\r -> happyReturn (HappyAbsSyn42 r))
+	) (\r -> happyReturn (HappyAbsSyn45 r))
 
-happyReduce_107 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_107 = happySpecReduce_1  28 happyReduction_107
-happyReduction_107 (HappyAbsSyn44  happy_var_1)
-	 =  HappyAbsSyn43
+happyReduce_111 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_111 = happySpecReduce_1  31 happyReduction_111
+happyReduction_111 (HappyAbsSyn47  happy_var_1)
+	 =  HappyAbsSyn46
 		 ([ happy_var_1]
 	)
-happyReduction_107 _  = notHappyAtAll 
+happyReduction_111 _  = notHappyAtAll 
 
-happyReduce_108 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_108 = happySpecReduce_3  28 happyReduction_108
-happyReduction_108 (HappyAbsSyn44  happy_var_3)
+happyReduce_112 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_112 = happySpecReduce_3  31 happyReduction_112
+happyReduction_112 (HappyAbsSyn47  happy_var_3)
 	_
-	(HappyAbsSyn43  happy_var_1)
-	 =  HappyAbsSyn43
+	(HappyAbsSyn46  happy_var_1)
+	 =  HappyAbsSyn46
 		 (happy_var_3 : happy_var_1
 	)
-happyReduction_108 _ _ _  = notHappyAtAll 
+happyReduction_112 _ _ _  = notHappyAtAll 
 
-happyReduce_109 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_109 = happySpecReduce_1  29 happyReduction_109
-happyReduction_109 (HappyAbsSyn44  happy_var_1)
-	 =  HappyAbsSyn44
+happyReduce_113 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_113 = happySpecReduce_1  32 happyReduction_113
+happyReduction_113 (HappyAbsSyn47  happy_var_1)
+	 =  HappyAbsSyn47
 		 (happy_var_1
 	)
-happyReduction_109 _  = notHappyAtAll 
-
-happyReduce_110 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_110 = happySpecReduce_3  29 happyReduction_110
-happyReduction_110 _
-	(HappyAbsSyn44  happy_var_2)
-	_
-	 =  HappyAbsSyn44
-		 (happy_var_2
-	)
-happyReduction_110 _ _ _  = notHappyAtAll 
-
-happyReduce_111 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_111 = happySpecReduce_1  30 happyReduction_111
-happyReduction_111 (HappyAbsSyn88  happy_var_1)
-	 =  HappyAbsSyn45
-		 ([happy_var_1]
-	)
-happyReduction_111 _  = notHappyAtAll 
-
-happyReduce_112 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_112 = happySpecReduce_2  30 happyReduction_112
-happyReduction_112 (HappyAbsSyn88  happy_var_2)
-	(HappyAbsSyn45  happy_var_1)
-	 =  HappyAbsSyn45
-		 (happy_var_2 : happy_var_1
-	)
-happyReduction_112 _ _  = notHappyAtAll 
+happyReduction_113 _  = notHappyAtAll 
 
-happyReduce_113 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_113 = happySpecReduce_2  31 happyReduction_113
-happyReduction_113 (HappyAbsSyn45  happy_var_2)
+happyReduce_114 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_114 = happySpecReduce_3  32 happyReduction_114
+happyReduction_114 _
+	(HappyAbsSyn47  happy_var_2)
 	_
-	 =  HappyAbsSyn45
+	 =  HappyAbsSyn47
 		 (happy_var_2
 	)
-happyReduction_113 _ _  = notHappyAtAll 
-
-happyReduce_114 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_114 = happySpecReduce_0  31 happyReduction_114
-happyReduction_114  =  HappyAbsSyn45
-		 ([]
-	)
+happyReduction_114 _ _ _  = notHappyAtAll 
 
 happyReduce_115 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_115 = happySpecReduce_1  32 happyReduction_115
-happyReduction_115 (HappyAbsSyn88  happy_var_1)
-	 =  HappyAbsSyn45
+happyReduce_115 = happySpecReduce_1  33 happyReduction_115
+happyReduction_115 (HappyAbsSyn91  happy_var_1)
+	 =  HappyAbsSyn48
 		 ([happy_var_1]
 	)
 happyReduction_115 _  = notHappyAtAll 
 
 happyReduce_116 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_116 = happySpecReduce_3  32 happyReduction_116
-happyReduction_116 (HappyAbsSyn88  happy_var_3)
-	_
-	(HappyAbsSyn45  happy_var_1)
-	 =  HappyAbsSyn45
-		 (happy_var_3 : happy_var_1
+happyReduce_116 = happySpecReduce_2  33 happyReduction_116
+happyReduction_116 (HappyAbsSyn91  happy_var_2)
+	(HappyAbsSyn48  happy_var_1)
+	 =  HappyAbsSyn48
+		 (happy_var_2 : happy_var_1
 	)
-happyReduction_116 _ _ _  = notHappyAtAll 
+happyReduction_116 _ _  = notHappyAtAll 
 
 happyReduce_117 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_117 = happySpecReduce_2  33 happyReduction_117
-happyReduction_117 (HappyAbsSyn45  happy_var_2)
-	(HappyAbsSyn45  happy_var_1)
+happyReduce_117 = happySpecReduce_2  34 happyReduction_117
+happyReduction_117 (HappyAbsSyn48  happy_var_2)
+	_
 	 =  HappyAbsSyn48
-		 ((happy_var_1, happy_var_2)
+		 (happy_var_2
 	)
 happyReduction_117 _ _  = notHappyAtAll 
 
 happyReduce_118 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_118 = happySpecReduce_2  33 happyReduction_118
-happyReduction_118 (HappyAbsSyn45  happy_var_2)
-	_
-	 =  HappyAbsSyn48
-		 (([], happy_var_2)
+happyReduce_118 = happySpecReduce_0  34 happyReduction_118
+happyReduction_118  =  HappyAbsSyn48
+		 ([]
 	)
-happyReduction_118 _ _  = notHappyAtAll 
 
 happyReduce_119 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_119 = happySpecReduce_0  34 happyReduction_119
-happyReduction_119  =  HappyAbsSyn48
-		 (([],[])
+happyReduce_119 = happySpecReduce_1  35 happyReduction_119
+happyReduction_119 (HappyAbsSyn91  happy_var_1)
+	 =  HappyAbsSyn48
+		 ([happy_var_1]
 	)
+happyReduction_119 _  = notHappyAtAll 
 
 happyReduce_120 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_120 = happySpecReduce_1  34 happyReduction_120
-happyReduction_120 (HappyAbsSyn48  happy_var_1)
+happyReduce_120 = happySpecReduce_3  35 happyReduction_120
+happyReduction_120 (HappyAbsSyn91  happy_var_3)
+	_
+	(HappyAbsSyn48  happy_var_1)
 	 =  HappyAbsSyn48
-		 (happy_var_1
+		 (happy_var_3 : happy_var_1
 	)
-happyReduction_120 _  = notHappyAtAll 
+happyReduction_120 _ _ _  = notHappyAtAll 
 
 happyReduce_121 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_121 = happySpecReduce_2  35 happyReduction_121
-happyReduction_121 _
-	(HappyAbsSyn38  happy_var_1)
-	 =  HappyAbsSyn39
-		 ([happy_var_1]
+happyReduce_121 = happySpecReduce_2  36 happyReduction_121
+happyReduction_121 (HappyAbsSyn48  happy_var_2)
+	(HappyAbsSyn48  happy_var_1)
+	 =  HappyAbsSyn51
+		 ((happy_var_1, happy_var_2)
 	)
 happyReduction_121 _ _  = notHappyAtAll 
 
 happyReduce_122 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_122 = happySpecReduce_3  35 happyReduction_122
-happyReduction_122 _
-	(HappyAbsSyn38  happy_var_2)
-	(HappyAbsSyn39  happy_var_1)
-	 =  HappyAbsSyn39
-		 (happy_var_2 : happy_var_1
+happyReduce_122 = happySpecReduce_2  36 happyReduction_122
+happyReduction_122 (HappyAbsSyn48  happy_var_2)
+	_
+	 =  HappyAbsSyn51
+		 (([], happy_var_2)
 	)
-happyReduction_122 _ _ _  = notHappyAtAll 
+happyReduction_122 _ _  = notHappyAtAll 
 
 happyReduce_123 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_123 = happySpecReduce_1  36 happyReduction_123
-happyReduction_123 (HappyAbsSyn38  happy_var_1)
-	 =  HappyAbsSyn39
-		 ([happy_var_1]
+happyReduce_123 = happySpecReduce_0  37 happyReduction_123
+happyReduction_123  =  HappyAbsSyn51
+		 (([],[])
 	)
-happyReduction_123 _  = notHappyAtAll 
 
 happyReduce_124 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_124 = happySpecReduce_3  36 happyReduction_124
-happyReduction_124 (HappyAbsSyn38  happy_var_3)
-	_
-	(HappyAbsSyn39  happy_var_1)
-	 =  HappyAbsSyn39
-		 (happy_var_3 : happy_var_1
+happyReduce_124 = happySpecReduce_1  37 happyReduction_124
+happyReduction_124 (HappyAbsSyn51  happy_var_1)
+	 =  HappyAbsSyn51
+		 (happy_var_1
 	)
-happyReduction_124 _ _ _  = notHappyAtAll 
+happyReduction_124 _  = notHappyAtAll 
 
 happyReduce_125 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_125 = happySpecReduce_3  36 happyReduction_125
-happyReduction_125 (HappyAbsSyn38  happy_var_3)
-	_
-	(HappyAbsSyn39  happy_var_1)
-	 =  HappyAbsSyn39
-		 (happy_var_3 : happy_var_1
+happyReduce_125 = happySpecReduce_2  38 happyReduction_125
+happyReduction_125 _
+	(HappyAbsSyn41  happy_var_1)
+	 =  HappyAbsSyn42
+		 ([happy_var_1]
 	)
-happyReduction_125 _ _ _  = notHappyAtAll 
+happyReduction_125 _ _  = notHappyAtAll 
 
 happyReduce_126 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_126 = happySpecReduce_3  37 happyReduction_126
+happyReduce_126 = happySpecReduce_3  38 happyReduction_126
 happyReduction_126 _
-	(HappyAbsSyn39  happy_var_2)
-	_
-	 =  HappyAbsSyn39
-		 (happy_var_2
+	(HappyAbsSyn41  happy_var_2)
+	(HappyAbsSyn42  happy_var_1)
+	 =  HappyAbsSyn42
+		 (happy_var_2 : happy_var_1
 	)
 happyReduction_126 _ _ _  = notHappyAtAll 
 
 happyReduce_127 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_127 = happySpecReduce_2  37 happyReduction_127
-happyReduction_127 _
-	_
-	 =  HappyAbsSyn39
-		 ([]
+happyReduce_127 = happySpecReduce_1  39 happyReduction_127
+happyReduction_127 (HappyAbsSyn41  happy_var_1)
+	 =  HappyAbsSyn42
+		 ([happy_var_1]
 	)
+happyReduction_127 _  = notHappyAtAll 
 
 happyReduce_128 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_128 = happySpecReduce_1  38 happyReduction_128
-happyReduction_128 (HappyAbsSyn59  happy_var_1)
-	 =  HappyAbsSyn53
-		 (ExprInput happy_var_1
+happyReduce_128 = happySpecReduce_3  39 happyReduction_128
+happyReduction_128 (HappyAbsSyn41  happy_var_3)
+	_
+	(HappyAbsSyn42  happy_var_1)
+	 =  HappyAbsSyn42
+		 (happy_var_3 : happy_var_1
 	)
-happyReduction_128 _  = notHappyAtAll 
+happyReduction_128 _ _ _  = notHappyAtAll 
 
 happyReduce_129 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_129 = happySpecReduce_1  38 happyReduction_129
-happyReduction_129 (HappyAbsSyn39  happy_var_1)
-	 =  HappyAbsSyn53
-		 (LetInput happy_var_1
+happyReduce_129 = happySpecReduce_3  39 happyReduction_129
+happyReduction_129 (HappyAbsSyn41  happy_var_3)
+	_
+	(HappyAbsSyn42  happy_var_1)
+	 =  HappyAbsSyn42
+		 (happy_var_3 : happy_var_1
 	)
-happyReduction_129 _  = notHappyAtAll 
+happyReduction_129 _ _ _  = notHappyAtAll 
 
 happyReduce_130 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_130 = happySpecReduce_0  38 happyReduction_130
-happyReduction_130  =  HappyAbsSyn53
-		 (EmptyInput
+happyReduce_130 = happySpecReduce_3  40 happyReduction_130
+happyReduction_130 _
+	(HappyAbsSyn42  happy_var_2)
+	_
+	 =  HappyAbsSyn42
+		 (happy_var_2
 	)
+happyReduction_130 _ _ _  = notHappyAtAll 
 
 happyReduce_131 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_131 = happySpecReduce_1  39 happyReduction_131
-happyReduction_131 (HappyAbsSyn44  happy_var_1)
-	 =  HappyAbsSyn44
-		 (happy_var_1
+happyReduce_131 = happySpecReduce_2  40 happyReduction_131
+happyReduction_131 _
+	_
+	 =  HappyAbsSyn42
+		 ([]
 	)
-happyReduction_131 _  = notHappyAtAll 
 
 happyReduce_132 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_132 = happySpecReduce_1  39 happyReduction_132
-happyReduction_132 (HappyTerminal (happy_var_1@(Located _ (Token (Op  Other{}   )  _))))
-	 =  HappyAbsSyn44
-		 (let Token (Op (Other ns i)) _ = thing happy_var_1
-                                       in mkQual (mkModName ns) (mkInfix i) A.<$ happy_var_1
+happyReduce_132 = happySpecReduce_1  41 happyReduction_132
+happyReduction_132 (HappyAbsSyn62  happy_var_1)
+	 =  HappyAbsSyn56
+		 (ExprInput happy_var_1
 	)
 happyReduction_132 _  = notHappyAtAll 
 
 happyReduce_133 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_133 = happySpecReduce_1  40 happyReduction_133
-happyReduction_133 (HappyAbsSyn44  happy_var_1)
-	 =  HappyAbsSyn44
-		 (happy_var_1
+happyReduce_133 = happySpecReduce_1  41 happyReduction_133
+happyReduction_133 (HappyAbsSyn42  happy_var_1)
+	 =  HappyAbsSyn56
+		 (LetInput happy_var_1
 	)
 happyReduction_133 _  = notHappyAtAll 
 
 happyReduce_134 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_134 = happySpecReduce_1  40 happyReduction_134
-happyReduction_134 (HappyTerminal (Located happy_var_1 (Token (Op Hash) _)))
-	 =  HappyAbsSyn44
-		 (Located happy_var_1 $ mkUnqual $ mkInfix "#"
+happyReduce_134 = happySpecReduce_0  41 happyReduction_134
+happyReduction_134  =  HappyAbsSyn56
+		 (EmptyInput
 	)
-happyReduction_134 _  = notHappyAtAll 
 
 happyReduce_135 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_135 = happySpecReduce_1  40 happyReduction_135
-happyReduction_135 (HappyTerminal (Located happy_var_1 (Token (Op At) _)))
-	 =  HappyAbsSyn44
-		 (Located happy_var_1 $ mkUnqual $ mkInfix "@"
+happyReduce_135 = happySpecReduce_1  42 happyReduction_135
+happyReduction_135 (HappyAbsSyn47  happy_var_1)
+	 =  HappyAbsSyn47
+		 (happy_var_1
 	)
 happyReduction_135 _  = notHappyAtAll 
 
 happyReduce_136 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_136 = happySpecReduce_1  41 happyReduction_136
-happyReduction_136 (HappyAbsSyn44  happy_var_1)
-	 =  HappyAbsSyn44
-		 (happy_var_1
+happyReduce_136 = happySpecReduce_1  42 happyReduction_136
+happyReduction_136 (HappyTerminal (happy_var_1@(Located _ (Token (Op  Other{}   )  _))))
+	 =  HappyAbsSyn47
+		 (let Token (Op (Other ns i)) _ = thing happy_var_1
+                                       in mkQual (mkModName ns) (mkInfix i) A.<$ happy_var_1
 	)
 happyReduction_136 _  = notHappyAtAll 
 
 happyReduce_137 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_137 = happySpecReduce_1  41 happyReduction_137
-happyReduction_137 (HappyTerminal (Located happy_var_1 (Token (Op Mul)   _)))
-	 =  HappyAbsSyn44
-		 (Located happy_var_1 $ mkUnqual $ mkInfix "*"
+happyReduce_137 = happySpecReduce_1  43 happyReduction_137
+happyReduction_137 (HappyAbsSyn47  happy_var_1)
+	 =  HappyAbsSyn47
+		 (happy_var_1
 	)
 happyReduction_137 _  = notHappyAtAll 
 
 happyReduce_138 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_138 = happySpecReduce_1  41 happyReduction_138
-happyReduction_138 (HappyTerminal (Located happy_var_1 (Token (Op Plus)  _)))
-	 =  HappyAbsSyn44
-		 (Located happy_var_1 $ mkUnqual $ mkInfix "+"
+happyReduce_138 = happySpecReduce_1  43 happyReduction_138
+happyReduction_138 (HappyTerminal (Located happy_var_1 (Token (Op Hash) _)))
+	 =  HappyAbsSyn47
+		 (Located happy_var_1 $ mkUnqual $ mkInfix "#"
 	)
 happyReduction_138 _  = notHappyAtAll 
 
 happyReduce_139 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_139 = happySpecReduce_1  41 happyReduction_139
-happyReduction_139 (HappyTerminal (Located happy_var_1 (Token (Op Minus) _)))
-	 =  HappyAbsSyn44
-		 (Located happy_var_1 $ mkUnqual $ mkInfix "-"
+happyReduce_139 = happySpecReduce_1  43 happyReduction_139
+happyReduction_139 (HappyTerminal (Located happy_var_1 (Token (Op At) _)))
+	 =  HappyAbsSyn47
+		 (Located happy_var_1 $ mkUnqual $ mkInfix "@"
 	)
 happyReduction_139 _  = notHappyAtAll 
 
 happyReduce_140 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_140 = happySpecReduce_1  41 happyReduction_140
-happyReduction_140 (HappyTerminal (Located happy_var_1 (Token (Op Complement) _)))
-	 =  HappyAbsSyn44
-		 (Located happy_var_1 $ mkUnqual $ mkInfix "~"
+happyReduce_140 = happySpecReduce_1  44 happyReduction_140
+happyReduction_140 (HappyAbsSyn47  happy_var_1)
+	 =  HappyAbsSyn47
+		 (happy_var_1
 	)
 happyReduction_140 _  = notHappyAtAll 
 
 happyReduce_141 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_141 = happySpecReduce_1  41 happyReduction_141
-happyReduction_141 (HappyTerminal (Located happy_var_1 (Token (Op Exp)   _)))
-	 =  HappyAbsSyn44
-		 (Located happy_var_1 $ mkUnqual $ mkInfix "^^"
+happyReduce_141 = happySpecReduce_1  44 happyReduction_141
+happyReduction_141 (HappyTerminal (Located happy_var_1 (Token (Op Mul)   _)))
+	 =  HappyAbsSyn47
+		 (Located happy_var_1 $ mkUnqual $ mkInfix "*"
 	)
 happyReduction_141 _  = notHappyAtAll 
 
 happyReduce_142 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_142 = happySpecReduce_1  41 happyReduction_142
-happyReduction_142 (HappyTerminal (Located happy_var_1 (Token (Sym Lt      ) _)))
-	 =  HappyAbsSyn44
-		 (Located happy_var_1 $ mkUnqual $ mkInfix "<"
+happyReduce_142 = happySpecReduce_1  44 happyReduction_142
+happyReduction_142 (HappyTerminal (Located happy_var_1 (Token (Op Plus)  _)))
+	 =  HappyAbsSyn47
+		 (Located happy_var_1 $ mkUnqual $ mkInfix "+"
 	)
 happyReduction_142 _  = notHappyAtAll 
 
 happyReduce_143 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_143 = happySpecReduce_1  41 happyReduction_143
-happyReduction_143 (HappyTerminal (Located happy_var_1 (Token (Sym Gt      ) _)))
-	 =  HappyAbsSyn44
-		 (Located happy_var_1 $ mkUnqual $ mkInfix ">"
+happyReduce_143 = happySpecReduce_1  44 happyReduction_143
+happyReduction_143 (HappyTerminal (Located happy_var_1 (Token (Op Minus) _)))
+	 =  HappyAbsSyn47
+		 (Located happy_var_1 $ mkUnqual $ mkInfix "-"
 	)
 happyReduction_143 _  = notHappyAtAll 
 
 happyReduce_144 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_144 = happySpecReduce_1  42 happyReduction_144
-happyReduction_144 (HappyTerminal (happy_var_1@(Located _ (Token (Op (Other [] _)) _))))
-	 =  HappyAbsSyn44
-		 (let Token (Op (Other [] str)) _ = thing happy_var_1
-                                       in mkUnqual (mkInfix str) A.<$ happy_var_1
+happyReduce_144 = happySpecReduce_1  44 happyReduction_144
+happyReduction_144 (HappyTerminal (Located happy_var_1 (Token (Op Complement) _)))
+	 =  HappyAbsSyn47
+		 (Located happy_var_1 $ mkUnqual $ mkInfix "~"
 	)
 happyReduction_144 _  = notHappyAtAll 
 
 happyReduce_145 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_145 = happySpecReduce_1  43 happyReduction_145
-happyReduction_145 (HappyAbsSyn44  happy_var_1)
-	 =  HappyAbsSyn58
-		 ([happy_var_1]
+happyReduce_145 = happySpecReduce_1  44 happyReduction_145
+happyReduction_145 (HappyTerminal (Located happy_var_1 (Token (Op Exp)   _)))
+	 =  HappyAbsSyn47
+		 (Located happy_var_1 $ mkUnqual $ mkInfix "^^"
 	)
 happyReduction_145 _  = notHappyAtAll 
 
 happyReduce_146 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_146 = happySpecReduce_3  43 happyReduction_146
-happyReduction_146 (HappyAbsSyn44  happy_var_3)
-	_
-	(HappyAbsSyn58  happy_var_1)
-	 =  HappyAbsSyn58
-		 (happy_var_3 : happy_var_1
+happyReduce_146 = happySpecReduce_1  44 happyReduction_146
+happyReduction_146 (HappyTerminal (Located happy_var_1 (Token (Sym Lt      ) _)))
+	 =  HappyAbsSyn47
+		 (Located happy_var_1 $ mkUnqual $ mkInfix "<"
 	)
-happyReduction_146 _ _ _  = notHappyAtAll 
+happyReduction_146 _  = notHappyAtAll 
 
 happyReduce_147 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
 happyReduce_147 = happySpecReduce_1  44 happyReduction_147
-happyReduction_147 (HappyAbsSyn59  happy_var_1)
-	 =  HappyAbsSyn59
-		 (happy_var_1
+happyReduction_147 (HappyTerminal (Located happy_var_1 (Token (Sym Gt      ) _)))
+	 =  HappyAbsSyn47
+		 (Located happy_var_1 $ mkUnqual $ mkInfix ">"
 	)
 happyReduction_147 _  = notHappyAtAll 
 
 happyReduce_148 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_148 = happySpecReduce_3  44 happyReduction_148
-happyReduction_148 (HappyAbsSyn61  happy_var_3)
-	_
-	(HappyAbsSyn59  happy_var_1)
-	 =  HappyAbsSyn59
-		 (at (happy_var_1,happy_var_3) (EWhere happy_var_1 (thing happy_var_3))
+happyReduce_148 = happySpecReduce_1  45 happyReduction_148
+happyReduction_148 (HappyTerminal (happy_var_1@(Located _ (Token (Op (Other [] _)) _))))
+	 =  HappyAbsSyn47
+		 (let Token (Op (Other [] str)) _ = thing happy_var_1
+                                       in mkUnqual (mkInfix str) A.<$ happy_var_1
 	)
-happyReduction_148 _ _ _  = notHappyAtAll 
+happyReduction_148 _  = notHappyAtAll 
 
 happyReduce_149 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_149 = happySpecReduce_3  45 happyReduction_149
-happyReduction_149 (HappyAbsSyn59  happy_var_3)
-	(HappyAbsSyn44  happy_var_2)
-	(HappyAbsSyn59  happy_var_1)
-	 =  HappyAbsSyn59
-		 (binOp happy_var_1 happy_var_2 happy_var_3
+happyReduce_149 = happySpecReduce_1  46 happyReduction_149
+happyReduction_149 (HappyAbsSyn47  happy_var_1)
+	 =  HappyAbsSyn61
+		 ([happy_var_1]
 	)
-happyReduction_149 _ _ _  = notHappyAtAll 
+happyReduction_149 _  = notHappyAtAll 
 
 happyReduce_150 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_150 = happySpecReduce_1  45 happyReduction_150
-happyReduction_150 (HappyAbsSyn59  happy_var_1)
-	 =  HappyAbsSyn59
-		 (happy_var_1
+happyReduce_150 = happySpecReduce_3  46 happyReduction_150
+happyReduction_150 (HappyAbsSyn47  happy_var_3)
+	_
+	(HappyAbsSyn61  happy_var_1)
+	 =  HappyAbsSyn61
+		 (happy_var_3 : happy_var_1
 	)
-happyReduction_150 _  = notHappyAtAll 
+happyReduction_150 _ _ _  = notHappyAtAll 
 
 happyReduce_151 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_151 = happySpecReduce_1  45 happyReduction_151
-happyReduction_151 (HappyAbsSyn59  happy_var_1)
-	 =  HappyAbsSyn59
+happyReduce_151 = happySpecReduce_1  47 happyReduction_151
+happyReduction_151 (HappyAbsSyn62  happy_var_1)
+	 =  HappyAbsSyn62
 		 (happy_var_1
 	)
 happyReduction_151 _  = notHappyAtAll 
 
 happyReduce_152 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_152 = happySpecReduce_2  46 happyReduction_152
-happyReduction_152 (HappyTerminal (Located happy_var_2 (Token (Sym CurlyR  ) _)))
-	(HappyTerminal (Located happy_var_1 (Token (Sym CurlyL  ) _)))
-	 =  HappyAbsSyn61
-		 (Located (rComb happy_var_1 happy_var_2) []
+happyReduce_152 = happySpecReduce_3  47 happyReduction_152
+happyReduction_152 (HappyAbsSyn64  happy_var_3)
+	_
+	(HappyAbsSyn62  happy_var_1)
+	 =  HappyAbsSyn62
+		 (at (happy_var_1,happy_var_3) (EWhere happy_var_1 (thing happy_var_3))
 	)
-happyReduction_152 _ _  = notHappyAtAll 
+happyReduction_152 _ _ _  = notHappyAtAll 
 
 happyReduce_153 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_153 = happySpecReduce_3  46 happyReduction_153
-happyReduction_153 (HappyTerminal (Located happy_var_3 (Token (Sym CurlyR  ) _)))
-	(HappyAbsSyn39  happy_var_2)
-	(HappyTerminal (Located happy_var_1 (Token (Sym CurlyL  ) _)))
-	 =  HappyAbsSyn61
-		 (Located (rComb happy_var_1 happy_var_3) (reverse happy_var_2)
+happyReduce_153 = happySpecReduce_3  48 happyReduction_153
+happyReduction_153 (HappyAbsSyn62  happy_var_3)
+	(HappyAbsSyn47  happy_var_2)
+	(HappyAbsSyn62  happy_var_1)
+	 =  HappyAbsSyn62
+		 (binOp happy_var_1 happy_var_2 happy_var_3
 	)
 happyReduction_153 _ _ _  = notHappyAtAll 
 
 happyReduce_154 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_154 = happySpecReduce_2  46 happyReduction_154
-happyReduction_154 (HappyTerminal (Located happy_var_2 (Token (Virt VCurlyR)  _)))
-	(HappyTerminal (Located happy_var_1 (Token (Virt VCurlyL)  _)))
-	 =  HappyAbsSyn61
-		 (Located (rComb happy_var_1 happy_var_2) []
+happyReduce_154 = happySpecReduce_1  48 happyReduction_154
+happyReduction_154 (HappyAbsSyn62  happy_var_1)
+	 =  HappyAbsSyn62
+		 (happy_var_1
 	)
-happyReduction_154 _ _  = notHappyAtAll 
+happyReduction_154 _  = notHappyAtAll 
 
 happyReduce_155 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_155 = happySpecReduce_3  46 happyReduction_155
-happyReduction_155 (HappyTerminal (Located happy_var_3 (Token (Virt VCurlyR)  _)))
-	(HappyAbsSyn39  happy_var_2)
-	(HappyTerminal (Located happy_var_1 (Token (Virt VCurlyL)  _)))
-	 =  HappyAbsSyn61
-		 (let l2 = fromMaybe happy_var_3 (getLoc happy_var_2)
-                                    in Located (rComb happy_var_1 l2) (reverse happy_var_2)
+happyReduce_155 = happySpecReduce_1  48 happyReduction_155
+happyReduction_155 (HappyAbsSyn62  happy_var_1)
+	 =  HappyAbsSyn62
+		 (happy_var_1
 	)
-happyReduction_155 _ _ _  = notHappyAtAll 
+happyReduction_155 _  = notHappyAtAll 
 
 happyReduce_156 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_156 = happySpecReduce_3  47 happyReduction_156
-happyReduction_156 (HappyAbsSyn103  happy_var_3)
-	_
-	(HappyAbsSyn59  happy_var_1)
-	 =  HappyAbsSyn59
-		 (at (happy_var_1,happy_var_3) (ETyped happy_var_1 happy_var_3)
+happyReduce_156 = happySpecReduce_2  49 happyReduction_156
+happyReduction_156 (HappyTerminal (Located happy_var_2 (Token (Sym CurlyR  ) _)))
+	(HappyTerminal (Located happy_var_1 (Token (Sym CurlyL  ) _)))
+	 =  HappyAbsSyn64
+		 (Located (rComb happy_var_1 happy_var_2) []
 	)
-happyReduction_156 _ _ _  = notHappyAtAll 
+happyReduction_156 _ _  = notHappyAtAll 
 
 happyReduce_157 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_157 = happySpecReduce_3  48 happyReduction_157
-happyReduction_157 (HappyAbsSyn59  happy_var_3)
-	(HappyAbsSyn44  happy_var_2)
-	(HappyAbsSyn59  happy_var_1)
-	 =  HappyAbsSyn59
-		 (binOp happy_var_1 happy_var_2 happy_var_3
+happyReduce_157 = happySpecReduce_3  49 happyReduction_157
+happyReduction_157 (HappyTerminal (Located happy_var_3 (Token (Sym CurlyR  ) _)))
+	(HappyAbsSyn42  happy_var_2)
+	(HappyTerminal (Located happy_var_1 (Token (Sym CurlyL  ) _)))
+	 =  HappyAbsSyn64
+		 (Located (rComb happy_var_1 happy_var_3) (reverse happy_var_2)
 	)
 happyReduction_157 _ _ _  = notHappyAtAll 
 
 happyReduce_158 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_158 = happySpecReduce_1  48 happyReduction_158
-happyReduction_158 (HappyAbsSyn59  happy_var_1)
-	 =  HappyAbsSyn59
-		 (happy_var_1
+happyReduce_158 = happySpecReduce_2  49 happyReduction_158
+happyReduction_158 (HappyTerminal (Located happy_var_2 (Token (Virt VCurlyR)  _)))
+	(HappyTerminal (Located happy_var_1 (Token (Virt VCurlyL)  _)))
+	 =  HappyAbsSyn64
+		 (Located (rComb happy_var_1 happy_var_2) []
 	)
-happyReduction_158 _  = notHappyAtAll 
+happyReduction_158 _ _  = notHappyAtAll 
 
 happyReduce_159 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_159 = happyReduce 4 49 happyReduction_159
-happyReduction_159 ((HappyAbsSyn59  happy_var_4) `HappyStk`
+happyReduce_159 = happySpecReduce_3  49 happyReduction_159
+happyReduction_159 (HappyTerminal (Located happy_var_3 (Token (Virt VCurlyR)  _)))
+	(HappyAbsSyn42  happy_var_2)
+	(HappyTerminal (Located happy_var_1 (Token (Virt VCurlyL)  _)))
+	 =  HappyAbsSyn64
+		 (let l2 = fromMaybe happy_var_3 (getLoc happy_var_2)
+                                    in Located (rComb happy_var_1 l2) (reverse happy_var_2)
+	)
+happyReduction_159 _ _ _  = notHappyAtAll 
+
+happyReduce_160 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_160 = happySpecReduce_3  50 happyReduction_160
+happyReduction_160 (HappyAbsSyn106  happy_var_3)
+	_
+	(HappyAbsSyn62  happy_var_1)
+	 =  HappyAbsSyn62
+		 (at (happy_var_1,happy_var_3) (ETyped happy_var_1 happy_var_3)
+	)
+happyReduction_160 _ _ _  = notHappyAtAll 
+
+happyReduce_161 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_161 = happySpecReduce_3  51 happyReduction_161
+happyReduction_161 (HappyAbsSyn62  happy_var_3)
+	(HappyAbsSyn47  happy_var_2)
+	(HappyAbsSyn62  happy_var_1)
+	 =  HappyAbsSyn62
+		 (binOp happy_var_1 happy_var_2 happy_var_3
+	)
+happyReduction_161 _ _ _  = notHappyAtAll 
+
+happyReduce_162 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_162 = happySpecReduce_1  51 happyReduction_162
+happyReduction_162 (HappyAbsSyn62  happy_var_1)
+	 =  HappyAbsSyn62
+		 (happy_var_1
+	)
+happyReduction_162 _  = notHappyAtAll 
+
+happyReduce_163 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_163 = happyReduce 4 52 happyReduction_163
+happyReduction_163 ((HappyAbsSyn62  happy_var_4) `HappyStk`
 	_ `HappyStk`
-	(HappyAbsSyn65  happy_var_2) `HappyStk`
+	(HappyAbsSyn68  happy_var_2) `HappyStk`
 	(HappyTerminal (Located happy_var_1 (Token (KW KW_if     ) _))) `HappyStk`
 	happyRest)
-	 = HappyAbsSyn59
+	 = HappyAbsSyn62
 		 (at (happy_var_1,happy_var_4) $ mkIf (reverse happy_var_2) happy_var_4
 	) `HappyStk` happyRest
 
-happyReduce_160 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_160 = happyReduce 4 49 happyReduction_160
-happyReduction_160 ((HappyAbsSyn59  happy_var_4) `HappyStk`
+happyReduce_164 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_164 = happyReduce 4 52 happyReduction_164
+happyReduction_164 ((HappyAbsSyn62  happy_var_4) `HappyStk`
 	_ `HappyStk`
-	(HappyAbsSyn45  happy_var_2) `HappyStk`
+	(HappyAbsSyn48  happy_var_2) `HappyStk`
 	(HappyTerminal (Located happy_var_1 (Token (Sym Lambda  ) _))) `HappyStk`
 	happyRest)
-	 = HappyAbsSyn59
+	 = HappyAbsSyn62
 		 (at (happy_var_1,happy_var_4) $ EFun emptyFunDesc (reverse happy_var_2) happy_var_4
 	) `HappyStk` happyRest
 
-happyReduce_161 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_161 = happySpecReduce_1  50 happyReduction_161
-happyReduction_161 (HappyAbsSyn66  happy_var_1)
-	 =  HappyAbsSyn65
+happyReduce_165 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_165 = happySpecReduce_1  53 happyReduction_165
+happyReduction_165 (HappyAbsSyn69  happy_var_1)
+	 =  HappyAbsSyn68
 		 ([happy_var_1]
 	)
-happyReduction_161 _  = notHappyAtAll 
+happyReduction_165 _  = notHappyAtAll 
 
-happyReduce_162 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_162 = happySpecReduce_3  50 happyReduction_162
-happyReduction_162 (HappyAbsSyn66  happy_var_3)
+happyReduce_166 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_166 = happySpecReduce_3  53 happyReduction_166
+happyReduction_166 (HappyAbsSyn69  happy_var_3)
 	_
-	(HappyAbsSyn65  happy_var_1)
-	 =  HappyAbsSyn65
+	(HappyAbsSyn68  happy_var_1)
+	 =  HappyAbsSyn68
 		 (happy_var_3 : happy_var_1
 	)
-happyReduction_162 _ _ _  = notHappyAtAll 
+happyReduction_166 _ _ _  = notHappyAtAll 
 
-happyReduce_163 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_163 = happySpecReduce_3  51 happyReduction_163
-happyReduction_163 (HappyAbsSyn59  happy_var_3)
+happyReduce_167 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_167 = happySpecReduce_3  54 happyReduction_167
+happyReduction_167 (HappyAbsSyn62  happy_var_3)
 	_
-	(HappyAbsSyn59  happy_var_1)
-	 =  HappyAbsSyn66
+	(HappyAbsSyn62  happy_var_1)
+	 =  HappyAbsSyn69
 		 ((happy_var_1, happy_var_3)
 	)
-happyReduction_163 _ _ _  = notHappyAtAll 
+happyReduction_167 _ _ _  = notHappyAtAll 
 
-happyReduce_164 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_164 = happySpecReduce_2  52 happyReduction_164
-happyReduction_164 (HappyAbsSyn59  happy_var_2)
+happyReduce_168 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_168 = happySpecReduce_2  55 happyReduction_168
+happyReduction_168 (HappyAbsSyn62  happy_var_2)
 	(HappyTerminal (Located happy_var_1 (Token (Op Minus) _)))
-	 =  HappyAbsSyn59
+	 =  HappyAbsSyn62
 		 (at (happy_var_1,happy_var_2) (ENeg happy_var_2)
 	)
-happyReduction_164 _ _  = notHappyAtAll 
+happyReduction_168 _ _  = notHappyAtAll 
 
-happyReduce_165 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_165 = happySpecReduce_2  52 happyReduction_165
-happyReduction_165 (HappyAbsSyn59  happy_var_2)
+happyReduce_169 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_169 = happySpecReduce_2  55 happyReduction_169
+happyReduction_169 (HappyAbsSyn62  happy_var_2)
 	(HappyTerminal (Located happy_var_1 (Token (Op Complement) _)))
-	 =  HappyAbsSyn59
+	 =  HappyAbsSyn62
 		 (at (happy_var_1,happy_var_2) (EComplement happy_var_2)
 	)
-happyReduction_165 _ _  = notHappyAtAll 
+happyReduction_169 _ _  = notHappyAtAll 
 
-happyReduce_166 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_166 = happySpecReduce_1  52 happyReduction_166
-happyReduction_166 (HappyAbsSyn59  happy_var_1)
-	 =  HappyAbsSyn59
+happyReduce_170 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_170 = happySpecReduce_1  55 happyReduction_170
+happyReduction_170 (HappyAbsSyn62  happy_var_1)
+	 =  HappyAbsSyn62
 		 (happy_var_1
 	)
-happyReduction_166 _  = notHappyAtAll 
+happyReduction_170 _  = notHappyAtAll 
 
-happyReduce_167 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_167 = happySpecReduce_2  53 happyReduction_167
-happyReduction_167 (HappyAbsSyn59  happy_var_2)
+happyReduce_171 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_171 = happySpecReduce_2  56 happyReduction_171
+happyReduction_171 (HappyAbsSyn62  happy_var_2)
 	(HappyTerminal (Located happy_var_1 (Token (Op Minus) _)))
-	 =  HappyAbsSyn59
+	 =  HappyAbsSyn62
 		 (at (happy_var_1,happy_var_2) (ENeg happy_var_2)
 	)
-happyReduction_167 _ _  = notHappyAtAll 
-
-happyReduce_168 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_168 = happySpecReduce_2  53 happyReduction_168
-happyReduction_168 (HappyAbsSyn59  happy_var_2)
-	(HappyTerminal (Located happy_var_1 (Token (Op Complement) _)))
-	 =  HappyAbsSyn59
-		 (at (happy_var_1,happy_var_2) (EComplement happy_var_2)
-	)
-happyReduction_168 _ _  = notHappyAtAll 
-
-happyReduce_169 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_169 = happySpecReduce_1  53 happyReduction_169
-happyReduction_169 (HappyAbsSyn59  happy_var_1)
-	 =  HappyAbsSyn59
-		 (happy_var_1
-	)
-happyReduction_169 _  = notHappyAtAll 
-
-happyReduce_170 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_170 = happyMonadReduce 1 54 happyReduction_170
-happyReduction_170 ((HappyAbsSyn71  happy_var_1) `HappyStk`
-	happyRest) tk
-	 = happyThen ((( mkEApp happy_var_1))
-	) (\r -> happyReturn (HappyAbsSyn59 r))
-
-happyReduce_171 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_171 = happySpecReduce_2  55 happyReduction_171
-happyReduction_171 (HappyAbsSyn59  happy_var_2)
-	(HappyAbsSyn59  happy_var_1)
-	 =  HappyAbsSyn59
-		 (at (happy_var_1,happy_var_2) (EApp happy_var_1 happy_var_2)
-	)
 happyReduction_171 _ _  = notHappyAtAll 
 
 happyReduce_172 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_172 = happySpecReduce_1  55 happyReduction_172
-happyReduction_172 (HappyAbsSyn59  happy_var_1)
-	 =  HappyAbsSyn59
-		 (happy_var_1
+happyReduce_172 = happySpecReduce_2  56 happyReduction_172
+happyReduction_172 (HappyAbsSyn62  happy_var_2)
+	(HappyTerminal (Located happy_var_1 (Token (Op Complement) _)))
+	 =  HappyAbsSyn62
+		 (at (happy_var_1,happy_var_2) (EComplement happy_var_2)
 	)
-happyReduction_172 _  = notHappyAtAll 
+happyReduction_172 _ _  = notHappyAtAll 
 
 happyReduce_173 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_173 = happySpecReduce_1  55 happyReduction_173
-happyReduction_173 (HappyAbsSyn59  happy_var_1)
-	 =  HappyAbsSyn59
+happyReduce_173 = happySpecReduce_1  56 happyReduction_173
+happyReduction_173 (HappyAbsSyn62  happy_var_1)
+	 =  HappyAbsSyn62
 		 (happy_var_1
 	)
 happyReduction_173 _  = notHappyAtAll 
 
 happyReduce_174 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_174 = happySpecReduce_1  56 happyReduction_174
-happyReduction_174 (HappyAbsSyn59  happy_var_1)
-	 =  HappyAbsSyn71
-		 (happy_var_1 :| []
-	)
-happyReduction_174 _  = notHappyAtAll 
+happyReduce_174 = happyMonadReduce 1 57 happyReduction_174
+happyReduction_174 ((HappyAbsSyn74  happy_var_1) `HappyStk`
+	happyRest) tk
+	 = happyThen ((( mkEApp happy_var_1))
+	) (\r -> happyReturn (HappyAbsSyn62 r))
 
 happyReduce_175 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_175 = happySpecReduce_2  56 happyReduction_175
-happyReduction_175 (HappyAbsSyn59  happy_var_2)
-	(HappyAbsSyn71  happy_var_1)
-	 =  HappyAbsSyn71
-		 (cons happy_var_2 happy_var_1
+happyReduce_175 = happySpecReduce_2  58 happyReduction_175
+happyReduction_175 (HappyAbsSyn62  happy_var_2)
+	(HappyAbsSyn62  happy_var_1)
+	 =  HappyAbsSyn62
+		 (at (happy_var_1,happy_var_2) (EApp happy_var_1 happy_var_2)
 	)
 happyReduction_175 _ _  = notHappyAtAll 
 
 happyReduce_176 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_176 = happySpecReduce_1  57 happyReduction_176
-happyReduction_176 (HappyAbsSyn59  happy_var_1)
-	 =  HappyAbsSyn59
+happyReduce_176 = happySpecReduce_1  58 happyReduction_176
+happyReduction_176 (HappyAbsSyn62  happy_var_1)
+	 =  HappyAbsSyn62
 		 (happy_var_1
 	)
 happyReduction_176 _  = notHappyAtAll 
 
 happyReduce_177 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_177 = happySpecReduce_1  57 happyReduction_177
-happyReduction_177 (HappyAbsSyn59  happy_var_1)
-	 =  HappyAbsSyn59
+happyReduce_177 = happySpecReduce_1  58 happyReduction_177
+happyReduction_177 (HappyAbsSyn62  happy_var_1)
+	 =  HappyAbsSyn62
 		 (happy_var_1
 	)
 happyReduction_177 _  = notHappyAtAll 
 
 happyReduce_178 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_178 = happySpecReduce_1  58 happyReduction_178
-happyReduction_178 (HappyAbsSyn116  happy_var_1)
-	 =  HappyAbsSyn59
-		 (at happy_var_1 $ EVar (thing happy_var_1)
+happyReduce_178 = happySpecReduce_1  59 happyReduction_178
+happyReduction_178 (HappyAbsSyn62  happy_var_1)
+	 =  HappyAbsSyn74
+		 (happy_var_1 :| []
 	)
 happyReduction_178 _  = notHappyAtAll 
 
 happyReduce_179 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_179 = happySpecReduce_1  58 happyReduction_179
-happyReduction_179 (HappyTerminal (happy_var_1@(Located _ (Token (Num   {}) _))))
-	 =  HappyAbsSyn59
-		 (at happy_var_1 $ numLit (thing happy_var_1)
+happyReduce_179 = happySpecReduce_2  59 happyReduction_179
+happyReduction_179 (HappyAbsSyn62  happy_var_2)
+	(HappyAbsSyn74  happy_var_1)
+	 =  HappyAbsSyn74
+		 (cons happy_var_2 happy_var_1
 	)
-happyReduction_179 _  = notHappyAtAll 
+happyReduction_179 _ _  = notHappyAtAll 
 
 happyReduce_180 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_180 = happySpecReduce_1  58 happyReduction_180
-happyReduction_180 (HappyTerminal (happy_var_1@(Located _ (Token (Frac  {}) _))))
-	 =  HappyAbsSyn59
-		 (at happy_var_1 $ fracLit (thing happy_var_1)
+happyReduce_180 = happySpecReduce_1  60 happyReduction_180
+happyReduction_180 (HappyAbsSyn62  happy_var_1)
+	 =  HappyAbsSyn62
+		 (happy_var_1
 	)
 happyReduction_180 _  = notHappyAtAll 
 
 happyReduce_181 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_181 = happySpecReduce_1  58 happyReduction_181
-happyReduction_181 (HappyTerminal (happy_var_1@(Located _ (Token (StrLit {}) _))))
-	 =  HappyAbsSyn59
-		 (at happy_var_1 $ ELit $ ECString $ getStr happy_var_1
+happyReduce_181 = happySpecReduce_1  60 happyReduction_181
+happyReduction_181 (HappyAbsSyn62  happy_var_1)
+	 =  HappyAbsSyn62
+		 (happy_var_1
 	)
 happyReduction_181 _  = notHappyAtAll 
 
 happyReduce_182 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_182 = happySpecReduce_1  58 happyReduction_182
-happyReduction_182 (HappyTerminal (happy_var_1@(Located _ (Token (ChrLit {}) _))))
-	 =  HappyAbsSyn59
-		 (at happy_var_1 $ ELit $ ECChar $ getChr happy_var_1
+happyReduce_182 = happySpecReduce_1  61 happyReduction_182
+happyReduction_182 (HappyAbsSyn119  happy_var_1)
+	 =  HappyAbsSyn62
+		 (at happy_var_1 $ EVar (thing happy_var_1)
 	)
 happyReduction_182 _  = notHappyAtAll 
 
 happyReduce_183 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_183 = happySpecReduce_1  58 happyReduction_183
-happyReduction_183 (HappyTerminal (Located happy_var_1 (Token (Sym Underscore ) _)))
-	 =  HappyAbsSyn59
-		 (at happy_var_1 $ EVar $ mkUnqual $ mkIdent "_"
+happyReduce_183 = happySpecReduce_1  61 happyReduction_183
+happyReduction_183 (HappyTerminal (happy_var_1@(Located _ (Token (Num   {}) _))))
+	 =  HappyAbsSyn62
+		 (at happy_var_1 $ numLit (thing happy_var_1)
 	)
 happyReduction_183 _  = notHappyAtAll 
 
 happyReduce_184 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_184 = happySpecReduce_3  58 happyReduction_184
-happyReduction_184 (HappyTerminal (Located happy_var_3 (Token (Sym ParenR  ) _)))
-	(HappyAbsSyn59  happy_var_2)
+happyReduce_184 = happySpecReduce_1  61 happyReduction_184
+happyReduction_184 (HappyTerminal (happy_var_1@(Located _ (Token (Frac  {}) _))))
+	 =  HappyAbsSyn62
+		 (at happy_var_1 $ fracLit (thing happy_var_1)
+	)
+happyReduction_184 _  = notHappyAtAll 
+
+happyReduce_185 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_185 = happySpecReduce_1  61 happyReduction_185
+happyReduction_185 (HappyTerminal (happy_var_1@(Located _ (Token (StrLit {}) _))))
+	 =  HappyAbsSyn62
+		 (at happy_var_1 $ ELit $ ECString $ getStr happy_var_1
+	)
+happyReduction_185 _  = notHappyAtAll 
+
+happyReduce_186 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_186 = happySpecReduce_1  61 happyReduction_186
+happyReduction_186 (HappyTerminal (happy_var_1@(Located _ (Token (ChrLit {}) _))))
+	 =  HappyAbsSyn62
+		 (at happy_var_1 $ ELit $ ECChar $ getChr happy_var_1
+	)
+happyReduction_186 _  = notHappyAtAll 
+
+happyReduce_187 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_187 = happySpecReduce_1  61 happyReduction_187
+happyReduction_187 (HappyTerminal (Located happy_var_1 (Token (Sym Underscore ) _)))
+	 =  HappyAbsSyn62
+		 (at happy_var_1 $ EVar $ mkUnqual $ mkIdent "_"
+	)
+happyReduction_187 _  = notHappyAtAll 
+
+happyReduce_188 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_188 = happySpecReduce_3  61 happyReduction_188
+happyReduction_188 (HappyTerminal (Located happy_var_3 (Token (Sym ParenR  ) _)))
+	(HappyAbsSyn62  happy_var_2)
 	(HappyTerminal (Located happy_var_1 (Token (Sym ParenL  ) _)))
-	 =  HappyAbsSyn59
+	 =  HappyAbsSyn62
 		 (at (happy_var_1,happy_var_3) $ EParens happy_var_2
 	)
-happyReduction_184 _ _ _  = notHappyAtAll 
+happyReduction_188 _ _ _  = notHappyAtAll 
 
-happyReduce_185 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_185 = happySpecReduce_3  58 happyReduction_185
-happyReduction_185 (HappyTerminal (Located happy_var_3 (Token (Sym ParenR  ) _)))
-	(HappyAbsSyn78  happy_var_2)
+happyReduce_189 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_189 = happySpecReduce_3  61 happyReduction_189
+happyReduction_189 (HappyTerminal (Located happy_var_3 (Token (Sym ParenR  ) _)))
+	(HappyAbsSyn81  happy_var_2)
 	(HappyTerminal (Located happy_var_1 (Token (Sym ParenL  ) _)))
-	 =  HappyAbsSyn59
+	 =  HappyAbsSyn62
 		 (at (happy_var_1,happy_var_3) $ ETuple (reverse happy_var_2)
 	)
-happyReduction_185 _ _ _  = notHappyAtAll 
+happyReduction_189 _ _ _  = notHappyAtAll 
 
-happyReduce_186 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_186 = happySpecReduce_2  58 happyReduction_186
-happyReduction_186 (HappyTerminal (Located happy_var_2 (Token (Sym ParenR  ) _)))
+happyReduce_190 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_190 = happySpecReduce_2  61 happyReduction_190
+happyReduction_190 (HappyTerminal (Located happy_var_2 (Token (Sym ParenR  ) _)))
 	(HappyTerminal (Located happy_var_1 (Token (Sym ParenL  ) _)))
-	 =  HappyAbsSyn59
+	 =  HappyAbsSyn62
 		 (at (happy_var_1,happy_var_2) $ ETuple []
 	)
-happyReduction_186 _ _  = notHappyAtAll 
+happyReduction_190 _ _  = notHappyAtAll 
 
-happyReduce_187 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_187 = happyMonadReduce 2 58 happyReduction_187
-happyReduction_187 ((HappyTerminal (Located happy_var_2 (Token (Sym CurlyR  ) _))) `HappyStk`
+happyReduce_191 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_191 = happyMonadReduce 2 61 happyReduction_191
+happyReduction_191 ((HappyTerminal (Located happy_var_2 (Token (Sym CurlyR  ) _))) `HappyStk`
 	(HappyTerminal (Located happy_var_1 (Token (Sym CurlyL  ) _))) `HappyStk`
 	happyRest) tk
 	 = happyThen ((( mkRecord (rComb happy_var_1 happy_var_2) ERecord []))
-	) (\r -> happyReturn (HappyAbsSyn59 r))
+	) (\r -> happyReturn (HappyAbsSyn62 r))
 
-happyReduce_188 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_188 = happyMonadReduce 3 58 happyReduction_188
-happyReduction_188 ((HappyTerminal (Located happy_var_3 (Token (Sym CurlyR  ) _))) `HappyStk`
-	(HappyAbsSyn79  happy_var_2) `HappyStk`
+happyReduce_192 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_192 = happyMonadReduce 3 61 happyReduction_192
+happyReduction_192 ((HappyTerminal (Located happy_var_3 (Token (Sym CurlyR  ) _))) `HappyStk`
+	(HappyAbsSyn82  happy_var_2) `HappyStk`
 	(HappyTerminal (Located happy_var_1 (Token (Sym CurlyL  ) _))) `HappyStk`
 	happyRest) tk
 	 = happyThen ((( case happy_var_2 of {
                                        Left upd -> pure $ at (happy_var_1,happy_var_3) upd;
                                        Right fs -> mkRecord (rComb happy_var_1 happy_var_3) ERecord fs; }))
-	) (\r -> happyReturn (HappyAbsSyn59 r))
+	) (\r -> happyReturn (HappyAbsSyn62 r))
 
-happyReduce_189 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_189 = happySpecReduce_2  58 happyReduction_189
-happyReduction_189 (HappyTerminal (Located happy_var_2 (Token (Sym BracketR) _)))
+happyReduce_193 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_193 = happySpecReduce_2  61 happyReduction_193
+happyReduction_193 (HappyTerminal (Located happy_var_2 (Token (Sym BracketR) _)))
 	(HappyTerminal (Located happy_var_1 (Token (Sym BracketL) _)))
-	 =  HappyAbsSyn59
+	 =  HappyAbsSyn62
 		 (at (happy_var_1,happy_var_2) $ EList []
 	)
-happyReduction_189 _ _  = notHappyAtAll 
+happyReduction_193 _ _  = notHappyAtAll 
 
-happyReduce_190 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_190 = happySpecReduce_3  58 happyReduction_190
-happyReduction_190 (HappyTerminal (Located happy_var_3 (Token (Sym BracketR) _)))
-	(HappyAbsSyn59  happy_var_2)
+happyReduce_194 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_194 = happySpecReduce_3  61 happyReduction_194
+happyReduction_194 (HappyTerminal (Located happy_var_3 (Token (Sym BracketR) _)))
+	(HappyAbsSyn62  happy_var_2)
 	(HappyTerminal (Located happy_var_1 (Token (Sym BracketL) _)))
-	 =  HappyAbsSyn59
+	 =  HappyAbsSyn62
 		 (at (happy_var_1,happy_var_3) happy_var_2
 	)
-happyReduction_190 _ _ _  = notHappyAtAll 
+happyReduction_194 _ _ _  = notHappyAtAll 
 
-happyReduce_191 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_191 = happySpecReduce_2  58 happyReduction_191
-happyReduction_191 (HappyAbsSyn103  happy_var_2)
+happyReduce_195 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_195 = happySpecReduce_2  61 happyReduction_195
+happyReduction_195 (HappyAbsSyn106  happy_var_2)
 	(HappyTerminal (Located happy_var_1 (Token (Sym BackTick) _)))
-	 =  HappyAbsSyn59
+	 =  HappyAbsSyn62
 		 (at (happy_var_1,happy_var_2) $ ETypeVal happy_var_2
 	)
-happyReduction_191 _ _  = notHappyAtAll 
+happyReduction_195 _ _  = notHappyAtAll 
 
-happyReduce_192 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_192 = happySpecReduce_3  58 happyReduction_192
-happyReduction_192 (HappyTerminal (Located happy_var_3 (Token (Sym ParenR  ) _)))
-	(HappyAbsSyn44  happy_var_2)
+happyReduce_196 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_196 = happySpecReduce_3  61 happyReduction_196
+happyReduction_196 (HappyTerminal (Located happy_var_3 (Token (Sym ParenR  ) _)))
+	(HappyAbsSyn47  happy_var_2)
 	(HappyTerminal (Located happy_var_1 (Token (Sym ParenL  ) _)))
-	 =  HappyAbsSyn59
+	 =  HappyAbsSyn62
 		 (at (happy_var_1,happy_var_3) $ EVar $ thing happy_var_2
 	)
-happyReduction_192 _ _ _  = notHappyAtAll 
+happyReduction_196 _ _ _  = notHappyAtAll 
 
-happyReduce_193 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_193 = happyMonadReduce 2 58 happyReduction_193
-happyReduction_193 ((HappyTerminal (Located happy_var_2 (Token (Sym TriR    ) _))) `HappyStk`
+happyReduce_197 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_197 = happyMonadReduce 2 61 happyReduction_197
+happyReduction_197 ((HappyTerminal (Located happy_var_2 (Token (Sym TriR    ) _))) `HappyStk`
 	(HappyTerminal (Located happy_var_1 (Token (Sym TriL    ) _))) `HappyStk`
 	happyRest) tk
 	 = happyThen ((( mkPoly (rComb happy_var_1 happy_var_2) []))
-	) (\r -> happyReturn (HappyAbsSyn59 r))
+	) (\r -> happyReturn (HappyAbsSyn62 r))
 
-happyReduce_194 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_194 = happyMonadReduce 3 58 happyReduction_194
-happyReduction_194 ((HappyTerminal (Located happy_var_3 (Token (Sym TriR    ) _))) `HappyStk`
-	(HappyAbsSyn76  happy_var_2) `HappyStk`
+happyReduce_198 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_198 = happyMonadReduce 3 61 happyReduction_198
+happyReduction_198 ((HappyTerminal (Located happy_var_3 (Token (Sym TriR    ) _))) `HappyStk`
+	(HappyAbsSyn79  happy_var_2) `HappyStk`
 	(HappyTerminal (Located happy_var_1 (Token (Sym TriL    ) _))) `HappyStk`
 	happyRest) tk
 	 = happyThen ((( mkPoly (rComb happy_var_1 happy_var_3) happy_var_2))
-	) (\r -> happyReturn (HappyAbsSyn59 r))
+	) (\r -> happyReturn (HappyAbsSyn62 r))
 
-happyReduce_195 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_195 = happySpecReduce_2  59 happyReduction_195
-happyReduction_195 (HappyAbsSyn75  happy_var_2)
-	(HappyAbsSyn59  happy_var_1)
-	 =  HappyAbsSyn59
+happyReduce_199 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_199 = happySpecReduce_2  62 happyReduction_199
+happyReduction_199 (HappyAbsSyn78  happy_var_2)
+	(HappyAbsSyn62  happy_var_1)
+	 =  HappyAbsSyn62
 		 (at (happy_var_1,happy_var_2) $ ESel happy_var_1 (thing happy_var_2)
 	)
-happyReduction_195 _ _  = notHappyAtAll 
+happyReduction_199 _ _  = notHappyAtAll 
 
-happyReduce_196 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_196 = happySpecReduce_2  59 happyReduction_196
-happyReduction_196 (HappyAbsSyn75  happy_var_2)
-	(HappyAbsSyn59  happy_var_1)
-	 =  HappyAbsSyn59
+happyReduce_200 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_200 = happySpecReduce_2  62 happyReduction_200
+happyReduction_200 (HappyAbsSyn78  happy_var_2)
+	(HappyAbsSyn62  happy_var_1)
+	 =  HappyAbsSyn62
 		 (at (happy_var_1,happy_var_2) $ ESel happy_var_1 (thing happy_var_2)
 	)
-happyReduction_196 _ _  = notHappyAtAll 
+happyReduction_200 _ _  = notHappyAtAll 
 
-happyReduce_197 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_197 = happySpecReduce_1  60 happyReduction_197
-happyReduction_197 (HappyTerminal (happy_var_1@(Located _ (Token  (Selector _) _))))
-	 =  HappyAbsSyn75
+happyReduce_201 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_201 = happySpecReduce_1  63 happyReduction_201
+happyReduction_201 (HappyTerminal (happy_var_1@(Located _ (Token  (Selector _) _))))
+	 =  HappyAbsSyn78
 		 (mkSelector `fmap` happy_var_1
 	)
-happyReduction_197 _  = notHappyAtAll 
+happyReduction_201 _  = notHappyAtAll 
 
-happyReduce_198 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_198 = happySpecReduce_1  61 happyReduction_198
-happyReduction_198 (HappyAbsSyn77  happy_var_1)
-	 =  HappyAbsSyn76
+happyReduce_202 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_202 = happySpecReduce_1  64 happyReduction_202
+happyReduction_202 (HappyAbsSyn80  happy_var_1)
+	 =  HappyAbsSyn79
 		 ([happy_var_1]
 	)
-happyReduction_198 _  = notHappyAtAll 
+happyReduction_202 _  = notHappyAtAll 
 
-happyReduce_199 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_199 = happySpecReduce_3  61 happyReduction_199
-happyReduction_199 (HappyAbsSyn77  happy_var_3)
+happyReduce_203 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_203 = happySpecReduce_3  64 happyReduction_203
+happyReduction_203 (HappyAbsSyn80  happy_var_3)
 	_
-	(HappyAbsSyn76  happy_var_1)
-	 =  HappyAbsSyn76
+	(HappyAbsSyn79  happy_var_1)
+	 =  HappyAbsSyn79
 		 (happy_var_3 : happy_var_1
 	)
-happyReduction_199 _ _ _  = notHappyAtAll 
+happyReduction_203 _ _ _  = notHappyAtAll 
 
-happyReduce_200 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_200 = happyMonadReduce 1 62 happyReduction_200
-happyReduction_200 ((HappyTerminal (happy_var_1@(Located _ (Token (Num   {}) _)))) `HappyStk`
+happyReduce_204 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_204 = happyMonadReduce 1 65 happyReduction_204
+happyReduction_204 ((HappyTerminal (happy_var_1@(Located _ (Token (Num   {}) _)))) `HappyStk`
 	happyRest) tk
 	 = happyThen ((( polyTerm (srcRange happy_var_1) (getNum happy_var_1) 0))
-	) (\r -> happyReturn (HappyAbsSyn77 r))
+	) (\r -> happyReturn (HappyAbsSyn80 r))
 
-happyReduce_201 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_201 = happyMonadReduce 1 62 happyReduction_201
-happyReduction_201 ((HappyTerminal (Located happy_var_1 (Token (KW KW_x)       _))) `HappyStk`
+happyReduce_205 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_205 = happyMonadReduce 1 65 happyReduction_205
+happyReduction_205 ((HappyTerminal (Located happy_var_1 (Token (KW KW_x)       _))) `HappyStk`
 	happyRest) tk
 	 = happyThen ((( polyTerm happy_var_1 1 1))
-	) (\r -> happyReturn (HappyAbsSyn77 r))
+	) (\r -> happyReturn (HappyAbsSyn80 r))
 
-happyReduce_202 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_202 = happyMonadReduce 3 62 happyReduction_202
-happyReduction_202 ((HappyTerminal (happy_var_3@(Located _ (Token (Num   {}) _)))) `HappyStk`
+happyReduce_206 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_206 = happyMonadReduce 3 65 happyReduction_206
+happyReduction_206 ((HappyTerminal (happy_var_3@(Located _ (Token (Num   {}) _)))) `HappyStk`
 	_ `HappyStk`
 	(HappyTerminal (Located happy_var_1 (Token (KW KW_x)       _))) `HappyStk`
 	happyRest) tk
 	 = happyThen ((( polyTerm (rComb happy_var_1 (srcRange happy_var_3))
                                                             1 (getNum happy_var_3)))
-	) (\r -> happyReturn (HappyAbsSyn77 r))
+	) (\r -> happyReturn (HappyAbsSyn80 r))
 
-happyReduce_203 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_203 = happySpecReduce_3  63 happyReduction_203
-happyReduction_203 (HappyAbsSyn59  happy_var_3)
+happyReduce_207 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_207 = happySpecReduce_3  66 happyReduction_207
+happyReduction_207 (HappyAbsSyn62  happy_var_3)
 	_
-	(HappyAbsSyn59  happy_var_1)
-	 =  HappyAbsSyn78
+	(HappyAbsSyn62  happy_var_1)
+	 =  HappyAbsSyn81
 		 ([ happy_var_3, happy_var_1]
 	)
-happyReduction_203 _ _ _  = notHappyAtAll 
+happyReduction_207 _ _ _  = notHappyAtAll 
 
-happyReduce_204 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_204 = happySpecReduce_3  63 happyReduction_204
-happyReduction_204 (HappyAbsSyn59  happy_var_3)
+happyReduce_208 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_208 = happySpecReduce_3  66 happyReduction_208
+happyReduction_208 (HappyAbsSyn62  happy_var_3)
 	_
-	(HappyAbsSyn78  happy_var_1)
-	 =  HappyAbsSyn78
+	(HappyAbsSyn81  happy_var_1)
+	 =  HappyAbsSyn81
 		 (happy_var_3 : happy_var_1
 	)
-happyReduction_204 _ _ _  = notHappyAtAll 
+happyReduction_208 _ _ _  = notHappyAtAll 
 
-happyReduce_205 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_205 = happySpecReduce_3  64 happyReduction_205
-happyReduction_205 (HappyAbsSyn80  happy_var_3)
+happyReduce_209 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_209 = happySpecReduce_3  67 happyReduction_209
+happyReduction_209 (HappyAbsSyn83  happy_var_3)
 	_
-	(HappyAbsSyn59  happy_var_1)
-	 =  HappyAbsSyn79
+	(HappyAbsSyn62  happy_var_1)
+	 =  HappyAbsSyn82
 		 (Left (EUpd (Just happy_var_1) (reverse happy_var_3))
 	)
-happyReduction_205 _ _ _  = notHappyAtAll 
+happyReduction_209 _ _ _  = notHappyAtAll 
 
-happyReduce_206 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_206 = happySpecReduce_3  64 happyReduction_206
-happyReduction_206 (HappyAbsSyn80  happy_var_3)
+happyReduce_210 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_210 = happySpecReduce_3  67 happyReduction_210
+happyReduction_210 (HappyAbsSyn83  happy_var_3)
 	_
 	_
-	 =  HappyAbsSyn79
+	 =  HappyAbsSyn82
 		 (Left (EUpd Nothing   (reverse happy_var_3))
 	)
-happyReduction_206 _ _ _  = notHappyAtAll 
+happyReduction_210 _ _ _  = notHappyAtAll 
 
-happyReduce_207 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_207 = happyMonadReduce 1 64 happyReduction_207
-happyReduction_207 ((HappyAbsSyn80  happy_var_1) `HappyStk`
+happyReduce_211 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_211 = happyMonadReduce 1 67 happyReduction_211
+happyReduction_211 ((HappyAbsSyn83  happy_var_1) `HappyStk`
 	happyRest) tk
 	 = happyThen ((( Right `fmap` mapM ufToNamed happy_var_1))
-	) (\r -> happyReturn (HappyAbsSyn79 r))
+	) (\r -> happyReturn (HappyAbsSyn82 r))
 
-happyReduce_208 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_208 = happySpecReduce_1  65 happyReduction_208
-happyReduction_208 (HappyAbsSyn81  happy_var_1)
-	 =  HappyAbsSyn80
+happyReduce_212 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_212 = happySpecReduce_1  68 happyReduction_212
+happyReduction_212 (HappyAbsSyn84  happy_var_1)
+	 =  HappyAbsSyn83
 		 ([happy_var_1]
 	)
-happyReduction_208 _  = notHappyAtAll 
+happyReduction_212 _  = notHappyAtAll 
 
-happyReduce_209 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_209 = happySpecReduce_3  65 happyReduction_209
-happyReduction_209 (HappyAbsSyn81  happy_var_3)
+happyReduce_213 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_213 = happySpecReduce_3  68 happyReduction_213
+happyReduction_213 (HappyAbsSyn84  happy_var_3)
 	_
-	(HappyAbsSyn80  happy_var_1)
-	 =  HappyAbsSyn80
+	(HappyAbsSyn83  happy_var_1)
+	 =  HappyAbsSyn83
 		 (happy_var_3 : happy_var_1
 	)
-happyReduction_209 _ _ _  = notHappyAtAll 
+happyReduction_213 _ _ _  = notHappyAtAll 
 
-happyReduce_210 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_210 = happyReduce 4 66 happyReduction_210
-happyReduction_210 ((HappyAbsSyn59  happy_var_4) `HappyStk`
-	(HappyAbsSyn83  happy_var_3) `HappyStk`
-	(HappyAbsSyn48  happy_var_2) `HappyStk`
-	(HappyAbsSyn82  happy_var_1) `HappyStk`
+happyReduce_214 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_214 = happyReduce 4 69 happyReduction_214
+happyReduction_214 ((HappyAbsSyn62  happy_var_4) `HappyStk`
+	(HappyAbsSyn86  happy_var_3) `HappyStk`
+	(HappyAbsSyn51  happy_var_2) `HappyStk`
+	(HappyAbsSyn85  happy_var_1) `HappyStk`
 	happyRest)
-	 = HappyAbsSyn81
+	 = HappyAbsSyn84
 		 (UpdField happy_var_3 happy_var_1 (mkIndexedExpr happy_var_2 happy_var_4)
 	) `HappyStk` happyRest
 
-happyReduce_211 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_211 = happyMonadReduce 1 67 happyReduction_211
-happyReduction_211 ((HappyAbsSyn59  happy_var_1) `HappyStk`
+happyReduce_215 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_215 = happyMonadReduce 1 70 happyReduction_215
+happyReduction_215 ((HappyAbsSyn62  happy_var_1) `HappyStk`
 	happyRest) tk
 	 = happyThen ((( exprToFieldPath happy_var_1))
-	) (\r -> happyReturn (HappyAbsSyn82 r))
+	) (\r -> happyReturn (HappyAbsSyn85 r))
 
-happyReduce_212 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_212 = happySpecReduce_1  68 happyReduction_212
-happyReduction_212 _
-	 =  HappyAbsSyn83
+happyReduce_216 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_216 = happySpecReduce_1  71 happyReduction_216
+happyReduction_216 _
+	 =  HappyAbsSyn86
 		 (UpdSet
 	)
 
-happyReduce_213 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_213 = happySpecReduce_1  68 happyReduction_213
-happyReduction_213 _
-	 =  HappyAbsSyn83
+happyReduce_217 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_217 = happySpecReduce_1  71 happyReduction_217
+happyReduction_217 _
+	 =  HappyAbsSyn86
 		 (UpdFun
 	)
 
-happyReduce_214 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_214 = happySpecReduce_3  69 happyReduction_214
-happyReduction_214 (HappyAbsSyn85  happy_var_3)
+happyReduce_218 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_218 = happySpecReduce_3  72 happyReduction_218
+happyReduction_218 (HappyAbsSyn88  happy_var_3)
 	_
-	(HappyAbsSyn59  happy_var_1)
-	 =  HappyAbsSyn59
+	(HappyAbsSyn62  happy_var_1)
+	 =  HappyAbsSyn62
 		 (EComp happy_var_1 (reverse happy_var_3)
 	)
-happyReduction_214 _ _ _  = notHappyAtAll 
+happyReduction_218 _ _ _  = notHappyAtAll 
 
-happyReduce_215 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_215 = happySpecReduce_1  69 happyReduction_215
-happyReduction_215 (HappyAbsSyn59  happy_var_1)
-	 =  HappyAbsSyn59
+happyReduce_219 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_219 = happySpecReduce_1  72 happyReduction_219
+happyReduction_219 (HappyAbsSyn62  happy_var_1)
+	 =  HappyAbsSyn62
 		 (EList [happy_var_1]
 	)
-happyReduction_215 _  = notHappyAtAll 
+happyReduction_219 _  = notHappyAtAll 
 
-happyReduce_216 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_216 = happySpecReduce_1  69 happyReduction_216
-happyReduction_216 (HappyAbsSyn78  happy_var_1)
-	 =  HappyAbsSyn59
+happyReduce_220 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_220 = happySpecReduce_1  72 happyReduction_220
+happyReduction_220 (HappyAbsSyn81  happy_var_1)
+	 =  HappyAbsSyn62
 		 (EList (reverse happy_var_1)
 	)
-happyReduction_216 _  = notHappyAtAll 
+happyReduction_220 _  = notHappyAtAll 
 
-happyReduce_217 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_217 = happyMonadReduce 3 69 happyReduction_217
-happyReduction_217 ((HappyAbsSyn59  happy_var_3) `HappyStk`
+happyReduce_221 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_221 = happyMonadReduce 3 72 happyReduction_221
+happyReduction_221 ((HappyAbsSyn62  happy_var_3) `HappyStk`
 	(HappyTerminal (Located happy_var_2 (Token (Sym DotDot  ) _))) `HappyStk`
-	(HappyAbsSyn59  happy_var_1) `HappyStk`
+	(HappyAbsSyn62  happy_var_1) `HappyStk`
 	happyRest) tk
 	 = happyThen ((( eFromTo happy_var_2 happy_var_1 Nothing   happy_var_3))
-	) (\r -> happyReturn (HappyAbsSyn59 r))
+	) (\r -> happyReturn (HappyAbsSyn62 r))
 
-happyReduce_218 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_218 = happyMonadReduce 5 69 happyReduction_218
-happyReduction_218 ((HappyAbsSyn59  happy_var_5) `HappyStk`
+happyReduce_222 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_222 = happyMonadReduce 5 72 happyReduction_222
+happyReduction_222 ((HappyAbsSyn62  happy_var_5) `HappyStk`
 	(HappyTerminal (Located happy_var_4 (Token (Sym DotDot  ) _))) `HappyStk`
-	(HappyAbsSyn59  happy_var_3) `HappyStk`
+	(HappyAbsSyn62  happy_var_3) `HappyStk`
 	_ `HappyStk`
-	(HappyAbsSyn59  happy_var_1) `HappyStk`
+	(HappyAbsSyn62  happy_var_1) `HappyStk`
 	happyRest) tk
 	 = happyThen ((( eFromTo happy_var_4 happy_var_1 (Just happy_var_3) happy_var_5))
-	) (\r -> happyReturn (HappyAbsSyn59 r))
+	) (\r -> happyReturn (HappyAbsSyn62 r))
 
-happyReduce_219 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_219 = happyMonadReduce 4 69 happyReduction_219
-happyReduction_219 ((HappyAbsSyn59  happy_var_4) `HappyStk`
+happyReduce_223 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_223 = happyMonadReduce 4 72 happyReduction_223
+happyReduction_223 ((HappyAbsSyn62  happy_var_4) `HappyStk`
 	_ `HappyStk`
 	(HappyTerminal (Located happy_var_2 (Token (Sym DotDot  ) _))) `HappyStk`
-	(HappyAbsSyn59  happy_var_1) `HappyStk`
+	(HappyAbsSyn62  happy_var_1) `HappyStk`
 	happyRest) tk
 	 = happyThen ((( eFromToLessThan happy_var_2 happy_var_1 happy_var_4))
-	) (\r -> happyReturn (HappyAbsSyn59 r))
+	) (\r -> happyReturn (HappyAbsSyn62 r))
 
-happyReduce_220 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_220 = happyMonadReduce 3 69 happyReduction_220
-happyReduction_220 ((HappyAbsSyn59  happy_var_3) `HappyStk`
+happyReduce_224 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_224 = happyMonadReduce 3 72 happyReduction_224
+happyReduction_224 ((HappyAbsSyn62  happy_var_3) `HappyStk`
 	(HappyTerminal (Located happy_var_2 (Token (Sym DotDotLt) _))) `HappyStk`
-	(HappyAbsSyn59  happy_var_1) `HappyStk`
+	(HappyAbsSyn62  happy_var_1) `HappyStk`
 	happyRest) tk
 	 = happyThen ((( eFromToLessThan happy_var_2 happy_var_1 happy_var_3))
-	) (\r -> happyReturn (HappyAbsSyn59 r))
+	) (\r -> happyReturn (HappyAbsSyn62 r))
 
-happyReduce_221 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_221 = happyMonadReduce 5 69 happyReduction_221
-happyReduction_221 ((HappyAbsSyn59  happy_var_5) `HappyStk`
+happyReduce_225 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_225 = happyMonadReduce 5 72 happyReduction_225
+happyReduction_225 ((HappyAbsSyn62  happy_var_5) `HappyStk`
 	_ `HappyStk`
-	(HappyAbsSyn59  happy_var_3) `HappyStk`
+	(HappyAbsSyn62  happy_var_3) `HappyStk`
 	(HappyTerminal (Located happy_var_2 (Token (Sym DotDot  ) _))) `HappyStk`
-	(HappyAbsSyn59  happy_var_1) `HappyStk`
+	(HappyAbsSyn62  happy_var_1) `HappyStk`
 	happyRest) tk
 	 = happyThen ((( eFromToBy happy_var_2 happy_var_1 happy_var_3 happy_var_5 False))
-	) (\r -> happyReturn (HappyAbsSyn59 r))
+	) (\r -> happyReturn (HappyAbsSyn62 r))
 
-happyReduce_222 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_222 = happyMonadReduce 6 69 happyReduction_222
-happyReduction_222 ((HappyAbsSyn59  happy_var_6) `HappyStk`
+happyReduce_226 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_226 = happyMonadReduce 6 72 happyReduction_226
+happyReduction_226 ((HappyAbsSyn62  happy_var_6) `HappyStk`
 	_ `HappyStk`
-	(HappyAbsSyn59  happy_var_4) `HappyStk`
+	(HappyAbsSyn62  happy_var_4) `HappyStk`
 	_ `HappyStk`
 	(HappyTerminal (Located happy_var_2 (Token (Sym DotDot  ) _))) `HappyStk`
-	(HappyAbsSyn59  happy_var_1) `HappyStk`
+	(HappyAbsSyn62  happy_var_1) `HappyStk`
 	happyRest) tk
 	 = happyThen ((( eFromToBy happy_var_2 happy_var_1 happy_var_4 happy_var_6 True))
-	) (\r -> happyReturn (HappyAbsSyn59 r))
+	) (\r -> happyReturn (HappyAbsSyn62 r))
 
-happyReduce_223 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_223 = happyMonadReduce 5 69 happyReduction_223
-happyReduction_223 ((HappyAbsSyn59  happy_var_5) `HappyStk`
+happyReduce_227 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_227 = happyMonadReduce 5 72 happyReduction_227
+happyReduction_227 ((HappyAbsSyn62  happy_var_5) `HappyStk`
 	_ `HappyStk`
-	(HappyAbsSyn59  happy_var_3) `HappyStk`
+	(HappyAbsSyn62  happy_var_3) `HappyStk`
 	(HappyTerminal (Located happy_var_2 (Token (Sym DotDotLt) _))) `HappyStk`
-	(HappyAbsSyn59  happy_var_1) `HappyStk`
+	(HappyAbsSyn62  happy_var_1) `HappyStk`
 	happyRest) tk
 	 = happyThen ((( eFromToBy happy_var_2 happy_var_1 happy_var_3 happy_var_5 True))
-	) (\r -> happyReturn (HappyAbsSyn59 r))
+	) (\r -> happyReturn (HappyAbsSyn62 r))
 
-happyReduce_224 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_224 = happyMonadReduce 6 69 happyReduction_224
-happyReduction_224 ((HappyAbsSyn59  happy_var_6) `HappyStk`
+happyReduce_228 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_228 = happyMonadReduce 6 72 happyReduction_228
+happyReduction_228 ((HappyAbsSyn62  happy_var_6) `HappyStk`
 	_ `HappyStk`
 	_ `HappyStk`
-	(HappyAbsSyn59  happy_var_3) `HappyStk`
+	(HappyAbsSyn62  happy_var_3) `HappyStk`
 	(HappyTerminal (Located happy_var_2 (Token (Sym DotDot  ) _))) `HappyStk`
-	(HappyAbsSyn59  happy_var_1) `HappyStk`
+	(HappyAbsSyn62  happy_var_1) `HappyStk`
 	happyRest) tk
 	 = happyThen ((( eFromToDownBy happy_var_2 happy_var_1 happy_var_3 happy_var_6 False))
-	) (\r -> happyReturn (HappyAbsSyn59 r))
+	) (\r -> happyReturn (HappyAbsSyn62 r))
 
-happyReduce_225 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_225 = happyMonadReduce 7 69 happyReduction_225
-happyReduction_225 ((HappyAbsSyn59  happy_var_7) `HappyStk`
+happyReduce_229 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_229 = happyMonadReduce 7 72 happyReduction_229
+happyReduction_229 ((HappyAbsSyn62  happy_var_7) `HappyStk`
 	_ `HappyStk`
 	_ `HappyStk`
-	(HappyAbsSyn59  happy_var_4) `HappyStk`
+	(HappyAbsSyn62  happy_var_4) `HappyStk`
 	_ `HappyStk`
 	(HappyTerminal (Located happy_var_2 (Token (Sym DotDot  ) _))) `HappyStk`
-	(HappyAbsSyn59  happy_var_1) `HappyStk`
+	(HappyAbsSyn62  happy_var_1) `HappyStk`
 	happyRest) tk
 	 = happyThen ((( eFromToDownBy happy_var_2 happy_var_1 happy_var_4 happy_var_7 True))
-	) (\r -> happyReturn (HappyAbsSyn59 r))
+	) (\r -> happyReturn (HappyAbsSyn62 r))
 
-happyReduce_226 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_226 = happyMonadReduce 6 69 happyReduction_226
-happyReduction_226 ((HappyAbsSyn59  happy_var_6) `HappyStk`
+happyReduce_230 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_230 = happyMonadReduce 6 72 happyReduction_230
+happyReduction_230 ((HappyAbsSyn62  happy_var_6) `HappyStk`
 	_ `HappyStk`
 	_ `HappyStk`
-	(HappyAbsSyn59  happy_var_3) `HappyStk`
+	(HappyAbsSyn62  happy_var_3) `HappyStk`
 	(HappyTerminal (Located happy_var_2 (Token (Sym DotDotGt) _))) `HappyStk`
-	(HappyAbsSyn59  happy_var_1) `HappyStk`
+	(HappyAbsSyn62  happy_var_1) `HappyStk`
 	happyRest) tk
 	 = happyThen ((( eFromToDownBy happy_var_2 happy_var_1 happy_var_3 happy_var_6 True))
-	) (\r -> happyReturn (HappyAbsSyn59 r))
+	) (\r -> happyReturn (HappyAbsSyn62 r))
 
-happyReduce_227 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_227 = happySpecReduce_2  69 happyReduction_227
-happyReduction_227 _
-	(HappyAbsSyn59  happy_var_1)
-	 =  HappyAbsSyn59
+happyReduce_231 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_231 = happySpecReduce_2  72 happyReduction_231
+happyReduction_231 _
+	(HappyAbsSyn62  happy_var_1)
+	 =  HappyAbsSyn62
 		 (EInfFrom happy_var_1 Nothing
 	)
-happyReduction_227 _ _  = notHappyAtAll 
+happyReduction_231 _ _  = notHappyAtAll 
 
-happyReduce_228 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_228 = happyReduce 4 69 happyReduction_228
-happyReduction_228 (_ `HappyStk`
-	(HappyAbsSyn59  happy_var_3) `HappyStk`
+happyReduce_232 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_232 = happyReduce 4 72 happyReduction_232
+happyReduction_232 (_ `HappyStk`
+	(HappyAbsSyn62  happy_var_3) `HappyStk`
 	_ `HappyStk`
-	(HappyAbsSyn59  happy_var_1) `HappyStk`
+	(HappyAbsSyn62  happy_var_1) `HappyStk`
 	happyRest)
-	 = HappyAbsSyn59
+	 = HappyAbsSyn62
 		 (EInfFrom happy_var_1 (Just happy_var_3)
 	) `HappyStk` happyRest
 
-happyReduce_229 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_229 = happySpecReduce_1  70 happyReduction_229
-happyReduction_229 (HappyAbsSyn86  happy_var_1)
-	 =  HappyAbsSyn85
+happyReduce_233 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_233 = happySpecReduce_1  73 happyReduction_233
+happyReduction_233 (HappyAbsSyn89  happy_var_1)
+	 =  HappyAbsSyn88
 		 ([ reverse happy_var_1 ]
 	)
-happyReduction_229 _  = notHappyAtAll 
+happyReduction_233 _  = notHappyAtAll 
 
-happyReduce_230 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_230 = happySpecReduce_3  70 happyReduction_230
-happyReduction_230 (HappyAbsSyn86  happy_var_3)
+happyReduce_234 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_234 = happySpecReduce_3  73 happyReduction_234
+happyReduction_234 (HappyAbsSyn89  happy_var_3)
 	_
-	(HappyAbsSyn85  happy_var_1)
-	 =  HappyAbsSyn85
+	(HappyAbsSyn88  happy_var_1)
+	 =  HappyAbsSyn88
 		 (reverse happy_var_3 : happy_var_1
 	)
-happyReduction_230 _ _ _  = notHappyAtAll 
+happyReduction_234 _ _ _  = notHappyAtAll 
 
-happyReduce_231 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_231 = happySpecReduce_1  71 happyReduction_231
-happyReduction_231 (HappyAbsSyn87  happy_var_1)
-	 =  HappyAbsSyn86
+happyReduce_235 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_235 = happySpecReduce_1  74 happyReduction_235
+happyReduction_235 (HappyAbsSyn90  happy_var_1)
+	 =  HappyAbsSyn89
 		 ([happy_var_1]
 	)
-happyReduction_231 _  = notHappyAtAll 
+happyReduction_235 _  = notHappyAtAll 
 
-happyReduce_232 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_232 = happySpecReduce_3  71 happyReduction_232
-happyReduction_232 (HappyAbsSyn87  happy_var_3)
+happyReduce_236 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_236 = happySpecReduce_3  74 happyReduction_236
+happyReduction_236 (HappyAbsSyn90  happy_var_3)
 	_
-	(HappyAbsSyn86  happy_var_1)
-	 =  HappyAbsSyn86
+	(HappyAbsSyn89  happy_var_1)
+	 =  HappyAbsSyn89
 		 (happy_var_3 : happy_var_1
 	)
-happyReduction_232 _ _ _  = notHappyAtAll 
+happyReduction_236 _ _ _  = notHappyAtAll 
 
-happyReduce_233 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_233 = happySpecReduce_3  72 happyReduction_233
-happyReduction_233 (HappyAbsSyn59  happy_var_3)
+happyReduce_237 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_237 = happySpecReduce_3  75 happyReduction_237
+happyReduction_237 (HappyAbsSyn62  happy_var_3)
 	_
-	(HappyAbsSyn88  happy_var_1)
-	 =  HappyAbsSyn87
+	(HappyAbsSyn91  happy_var_1)
+	 =  HappyAbsSyn90
 		 (Match happy_var_1 happy_var_3
 	)
-happyReduction_233 _ _ _  = notHappyAtAll 
+happyReduction_237 _ _ _  = notHappyAtAll 
 
-happyReduce_234 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_234 = happySpecReduce_3  73 happyReduction_234
-happyReduction_234 (HappyAbsSyn103  happy_var_3)
+happyReduce_238 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_238 = happySpecReduce_3  76 happyReduction_238
+happyReduction_238 (HappyAbsSyn106  happy_var_3)
 	_
-	(HappyAbsSyn88  happy_var_1)
-	 =  HappyAbsSyn88
+	(HappyAbsSyn91  happy_var_1)
+	 =  HappyAbsSyn91
 		 (at (happy_var_1,happy_var_3) $ PTyped happy_var_1 happy_var_3
 	)
-happyReduction_234 _ _ _  = notHappyAtAll 
+happyReduction_238 _ _ _  = notHappyAtAll 
 
-happyReduce_235 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_235 = happySpecReduce_1  73 happyReduction_235
-happyReduction_235 (HappyAbsSyn88  happy_var_1)
-	 =  HappyAbsSyn88
+happyReduce_239 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_239 = happySpecReduce_1  76 happyReduction_239
+happyReduction_239 (HappyAbsSyn91  happy_var_1)
+	 =  HappyAbsSyn91
 		 (happy_var_1
 	)
-happyReduction_235 _  = notHappyAtAll 
+happyReduction_239 _  = notHappyAtAll 
 
-happyReduce_236 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_236 = happySpecReduce_3  74 happyReduction_236
-happyReduction_236 (HappyAbsSyn88  happy_var_3)
+happyReduce_240 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_240 = happySpecReduce_3  77 happyReduction_240
+happyReduction_240 (HappyAbsSyn91  happy_var_3)
 	_
-	(HappyAbsSyn88  happy_var_1)
-	 =  HappyAbsSyn88
+	(HappyAbsSyn91  happy_var_1)
+	 =  HappyAbsSyn91
 		 (at (happy_var_1,happy_var_3) $ PSplit happy_var_1 happy_var_3
 	)
-happyReduction_236 _ _ _  = notHappyAtAll 
+happyReduction_240 _ _ _  = notHappyAtAll 
 
-happyReduce_237 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_237 = happySpecReduce_1  74 happyReduction_237
-happyReduction_237 (HappyAbsSyn88  happy_var_1)
-	 =  HappyAbsSyn88
+happyReduce_241 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_241 = happySpecReduce_1  77 happyReduction_241
+happyReduction_241 (HappyAbsSyn91  happy_var_1)
+	 =  HappyAbsSyn91
 		 (happy_var_1
 	)
-happyReduction_237 _  = notHappyAtAll 
+happyReduction_241 _  = notHappyAtAll 
 
-happyReduce_238 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_238 = happySpecReduce_1  75 happyReduction_238
-happyReduction_238 (HappyAbsSyn44  happy_var_1)
-	 =  HappyAbsSyn88
+happyReduce_242 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_242 = happySpecReduce_1  78 happyReduction_242
+happyReduction_242 (HappyAbsSyn47  happy_var_1)
+	 =  HappyAbsSyn91
 		 (PVar happy_var_1
 	)
-happyReduction_238 _  = notHappyAtAll 
+happyReduction_242 _  = notHappyAtAll 
 
-happyReduce_239 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_239 = happySpecReduce_1  75 happyReduction_239
-happyReduction_239 (HappyTerminal (Located happy_var_1 (Token (Sym Underscore ) _)))
-	 =  HappyAbsSyn88
+happyReduce_243 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_243 = happySpecReduce_1  78 happyReduction_243
+happyReduction_243 (HappyTerminal (Located happy_var_1 (Token (Sym Underscore ) _)))
+	 =  HappyAbsSyn91
 		 (at happy_var_1       $ PWild
 	)
-happyReduction_239 _  = notHappyAtAll 
+happyReduction_243 _  = notHappyAtAll 
 
-happyReduce_240 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_240 = happySpecReduce_2  75 happyReduction_240
-happyReduction_240 (HappyTerminal (Located happy_var_2 (Token (Sym ParenR  ) _)))
+happyReduce_244 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_244 = happySpecReduce_2  78 happyReduction_244
+happyReduction_244 (HappyTerminal (Located happy_var_2 (Token (Sym ParenR  ) _)))
 	(HappyTerminal (Located happy_var_1 (Token (Sym ParenL  ) _)))
-	 =  HappyAbsSyn88
+	 =  HappyAbsSyn91
 		 (at (happy_var_1,happy_var_2) $ PTuple []
 	)
-happyReduction_240 _ _  = notHappyAtAll 
+happyReduction_244 _ _  = notHappyAtAll 
 
-happyReduce_241 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_241 = happySpecReduce_3  75 happyReduction_241
-happyReduction_241 (HappyTerminal (Located happy_var_3 (Token (Sym ParenR  ) _)))
-	(HappyAbsSyn88  happy_var_2)
+happyReduce_245 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_245 = happySpecReduce_3  78 happyReduction_245
+happyReduction_245 (HappyTerminal (Located happy_var_3 (Token (Sym ParenR  ) _)))
+	(HappyAbsSyn91  happy_var_2)
 	(HappyTerminal (Located happy_var_1 (Token (Sym ParenL  ) _)))
-	 =  HappyAbsSyn88
+	 =  HappyAbsSyn91
 		 (at (happy_var_1,happy_var_3)   happy_var_2
 	)
-happyReduction_241 _ _ _  = notHappyAtAll 
+happyReduction_245 _ _ _  = notHappyAtAll 
 
-happyReduce_242 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_242 = happySpecReduce_3  75 happyReduction_242
-happyReduction_242 (HappyTerminal (Located happy_var_3 (Token (Sym ParenR  ) _)))
-	(HappyAbsSyn45  happy_var_2)
+happyReduce_246 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_246 = happySpecReduce_3  78 happyReduction_246
+happyReduction_246 (HappyTerminal (Located happy_var_3 (Token (Sym ParenR  ) _)))
+	(HappyAbsSyn48  happy_var_2)
 	(HappyTerminal (Located happy_var_1 (Token (Sym ParenL  ) _)))
-	 =  HappyAbsSyn88
+	 =  HappyAbsSyn91
 		 (at (happy_var_1,happy_var_3) $ PTuple (reverse happy_var_2)
 	)
-happyReduction_242 _ _ _  = notHappyAtAll 
+happyReduction_246 _ _ _  = notHappyAtAll 
 
-happyReduce_243 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_243 = happySpecReduce_2  75 happyReduction_243
-happyReduction_243 (HappyTerminal (Located happy_var_2 (Token (Sym BracketR) _)))
+happyReduce_247 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_247 = happySpecReduce_2  78 happyReduction_247
+happyReduction_247 (HappyTerminal (Located happy_var_2 (Token (Sym BracketR) _)))
 	(HappyTerminal (Located happy_var_1 (Token (Sym BracketL) _)))
-	 =  HappyAbsSyn88
+	 =  HappyAbsSyn91
 		 (at (happy_var_1,happy_var_2) $ PList []
 	)
-happyReduction_243 _ _  = notHappyAtAll 
+happyReduction_247 _ _  = notHappyAtAll 
 
-happyReduce_244 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_244 = happySpecReduce_3  75 happyReduction_244
-happyReduction_244 (HappyTerminal (Located happy_var_3 (Token (Sym BracketR) _)))
-	(HappyAbsSyn88  happy_var_2)
+happyReduce_248 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_248 = happySpecReduce_3  78 happyReduction_248
+happyReduction_248 (HappyTerminal (Located happy_var_3 (Token (Sym BracketR) _)))
+	(HappyAbsSyn91  happy_var_2)
 	(HappyTerminal (Located happy_var_1 (Token (Sym BracketL) _)))
-	 =  HappyAbsSyn88
+	 =  HappyAbsSyn91
 		 (at (happy_var_1,happy_var_3) $ PList [happy_var_2]
 	)
-happyReduction_244 _ _ _  = notHappyAtAll 
+happyReduction_248 _ _ _  = notHappyAtAll 
 
-happyReduce_245 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_245 = happySpecReduce_3  75 happyReduction_245
-happyReduction_245 (HappyTerminal (Located happy_var_3 (Token (Sym BracketR) _)))
-	(HappyAbsSyn45  happy_var_2)
+happyReduce_249 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_249 = happySpecReduce_3  78 happyReduction_249
+happyReduction_249 (HappyTerminal (Located happy_var_3 (Token (Sym BracketR) _)))
+	(HappyAbsSyn48  happy_var_2)
 	(HappyTerminal (Located happy_var_1 (Token (Sym BracketL) _)))
-	 =  HappyAbsSyn88
+	 =  HappyAbsSyn91
 		 (at (happy_var_1,happy_var_3) $ PList (reverse happy_var_2)
 	)
-happyReduction_245 _ _ _  = notHappyAtAll 
+happyReduction_249 _ _ _  = notHappyAtAll 
 
-happyReduce_246 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_246 = happyMonadReduce 2 75 happyReduction_246
-happyReduction_246 ((HappyTerminal (Located happy_var_2 (Token (Sym CurlyR  ) _))) `HappyStk`
+happyReduce_250 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_250 = happyMonadReduce 2 78 happyReduction_250
+happyReduction_250 ((HappyTerminal (Located happy_var_2 (Token (Sym CurlyR  ) _))) `HappyStk`
 	(HappyTerminal (Located happy_var_1 (Token (Sym CurlyL  ) _))) `HappyStk`
 	happyRest) tk
 	 = happyThen ((( mkRecord (rComb happy_var_1 happy_var_2) PRecord []))
-	) (\r -> happyReturn (HappyAbsSyn88 r))
+	) (\r -> happyReturn (HappyAbsSyn91 r))
 
-happyReduce_247 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_247 = happyMonadReduce 3 75 happyReduction_247
-happyReduction_247 ((HappyTerminal (Located happy_var_3 (Token (Sym CurlyR  ) _))) `HappyStk`
-	(HappyAbsSyn93  happy_var_2) `HappyStk`
+happyReduce_251 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_251 = happyMonadReduce 3 78 happyReduction_251
+happyReduction_251 ((HappyTerminal (Located happy_var_3 (Token (Sym CurlyR  ) _))) `HappyStk`
+	(HappyAbsSyn96  happy_var_2) `HappyStk`
 	(HappyTerminal (Located happy_var_1 (Token (Sym CurlyL  ) _))) `HappyStk`
 	happyRest) tk
 	 = happyThen ((( mkRecord (rComb happy_var_1 happy_var_3) PRecord happy_var_2))
-	) (\r -> happyReturn (HappyAbsSyn88 r))
+	) (\r -> happyReturn (HappyAbsSyn91 r))
 
-happyReduce_248 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_248 = happySpecReduce_3  76 happyReduction_248
-happyReduction_248 (HappyAbsSyn88  happy_var_3)
+happyReduce_252 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_252 = happySpecReduce_3  79 happyReduction_252
+happyReduction_252 (HappyAbsSyn91  happy_var_3)
 	_
-	(HappyAbsSyn88  happy_var_1)
-	 =  HappyAbsSyn45
+	(HappyAbsSyn91  happy_var_1)
+	 =  HappyAbsSyn48
 		 ([happy_var_3, happy_var_1]
 	)
-happyReduction_248 _ _ _  = notHappyAtAll 
+happyReduction_252 _ _ _  = notHappyAtAll 
 
-happyReduce_249 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_249 = happySpecReduce_3  76 happyReduction_249
-happyReduction_249 (HappyAbsSyn88  happy_var_3)
+happyReduce_253 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_253 = happySpecReduce_3  79 happyReduction_253
+happyReduction_253 (HappyAbsSyn91  happy_var_3)
 	_
-	(HappyAbsSyn45  happy_var_1)
-	 =  HappyAbsSyn45
+	(HappyAbsSyn48  happy_var_1)
+	 =  HappyAbsSyn48
 		 (happy_var_3 : happy_var_1
 	)
-happyReduction_249 _ _ _  = notHappyAtAll 
+happyReduction_253 _ _ _  = notHappyAtAll 
 
-happyReduce_250 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_250 = happySpecReduce_3  77 happyReduction_250
-happyReduction_250 (HappyAbsSyn88  happy_var_3)
+happyReduce_254 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_254 = happySpecReduce_3  80 happyReduction_254
+happyReduction_254 (HappyAbsSyn91  happy_var_3)
 	_
-	(HappyAbsSyn112  happy_var_1)
-	 =  HappyAbsSyn92
+	(HappyAbsSyn115  happy_var_1)
+	 =  HappyAbsSyn95
 		 (Named { name = happy_var_1, value = happy_var_3 }
 	)
-happyReduction_250 _ _ _  = notHappyAtAll 
+happyReduction_254 _ _ _  = notHappyAtAll 
 
-happyReduce_251 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_251 = happySpecReduce_1  78 happyReduction_251
-happyReduction_251 (HappyAbsSyn92  happy_var_1)
-	 =  HappyAbsSyn93
+happyReduce_255 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_255 = happySpecReduce_1  81 happyReduction_255
+happyReduction_255 (HappyAbsSyn95  happy_var_1)
+	 =  HappyAbsSyn96
 		 ([happy_var_1]
 	)
-happyReduction_251 _  = notHappyAtAll 
+happyReduction_255 _  = notHappyAtAll 
 
-happyReduce_252 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_252 = happySpecReduce_3  78 happyReduction_252
-happyReduction_252 (HappyAbsSyn92  happy_var_3)
+happyReduce_256 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_256 = happySpecReduce_3  81 happyReduction_256
+happyReduction_256 (HappyAbsSyn95  happy_var_3)
 	_
-	(HappyAbsSyn93  happy_var_1)
-	 =  HappyAbsSyn93
+	(HappyAbsSyn96  happy_var_1)
+	 =  HappyAbsSyn96
 		 (happy_var_3 : happy_var_1
 	)
-happyReduction_252 _ _ _  = notHappyAtAll 
+happyReduction_256 _ _ _  = notHappyAtAll 
 
-happyReduce_253 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_253 = happySpecReduce_1  79 happyReduction_253
-happyReduction_253 (HappyAbsSyn103  happy_var_1)
-	 =  HappyAbsSyn94
+happyReduce_257 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_257 = happySpecReduce_1  82 happyReduction_257
+happyReduction_257 (HappyAbsSyn106  happy_var_1)
+	 =  HappyAbsSyn97
 		 (at happy_var_1 $ mkSchema [] [] happy_var_1
 	)
-happyReduction_253 _  = notHappyAtAll 
+happyReduction_257 _  = notHappyAtAll 
 
-happyReduce_254 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_254 = happySpecReduce_2  79 happyReduction_254
-happyReduction_254 (HappyAbsSyn103  happy_var_2)
-	(HappyAbsSyn95  happy_var_1)
-	 =  HappyAbsSyn94
+happyReduce_258 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_258 = happySpecReduce_2  82 happyReduction_258
+happyReduction_258 (HappyAbsSyn106  happy_var_2)
+	(HappyAbsSyn98  happy_var_1)
+	 =  HappyAbsSyn97
 		 (at (happy_var_1,happy_var_2) $ mkSchema (thing happy_var_1) [] happy_var_2
 	)
-happyReduction_254 _ _  = notHappyAtAll 
+happyReduction_258 _ _  = notHappyAtAll 
 
-happyReduce_255 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_255 = happySpecReduce_2  79 happyReduction_255
-happyReduction_255 (HappyAbsSyn103  happy_var_2)
-	(HappyAbsSyn96  happy_var_1)
-	 =  HappyAbsSyn94
+happyReduce_259 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_259 = happySpecReduce_2  82 happyReduction_259
+happyReduction_259 (HappyAbsSyn106  happy_var_2)
+	(HappyAbsSyn99  happy_var_1)
+	 =  HappyAbsSyn97
 		 (at (happy_var_1,happy_var_2) $ mkSchema [] (thing happy_var_1) happy_var_2
 	)
-happyReduction_255 _ _  = notHappyAtAll 
+happyReduction_259 _ _  = notHappyAtAll 
 
-happyReduce_256 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_256 = happySpecReduce_3  79 happyReduction_256
-happyReduction_256 (HappyAbsSyn103  happy_var_3)
-	(HappyAbsSyn96  happy_var_2)
-	(HappyAbsSyn95  happy_var_1)
-	 =  HappyAbsSyn94
+happyReduce_260 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_260 = happySpecReduce_3  82 happyReduction_260
+happyReduction_260 (HappyAbsSyn106  happy_var_3)
+	(HappyAbsSyn99  happy_var_2)
+	(HappyAbsSyn98  happy_var_1)
+	 =  HappyAbsSyn97
 		 (at (happy_var_1,happy_var_3) $ mkSchema (thing happy_var_1)
                                                           (thing happy_var_2) happy_var_3
 	)
-happyReduction_256 _ _ _  = notHappyAtAll 
+happyReduction_260 _ _ _  = notHappyAtAll 
 
-happyReduce_257 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_257 = happySpecReduce_2  80 happyReduction_257
-happyReduction_257 (HappyTerminal (Located happy_var_2 (Token (Sym CurlyR  ) _)))
+happyReduce_261 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_261 = happySpecReduce_2  83 happyReduction_261
+happyReduction_261 (HappyTerminal (Located happy_var_2 (Token (Sym CurlyR  ) _)))
 	(HappyTerminal (Located happy_var_1 (Token (Sym CurlyL  ) _)))
-	 =  HappyAbsSyn95
+	 =  HappyAbsSyn98
 		 (Located (rComb happy_var_1 happy_var_2) []
 	)
-happyReduction_257 _ _  = notHappyAtAll 
+happyReduction_261 _ _  = notHappyAtAll 
 
-happyReduce_258 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_258 = happySpecReduce_3  80 happyReduction_258
-happyReduction_258 (HappyTerminal (Located happy_var_3 (Token (Sym CurlyR  ) _)))
-	(HappyAbsSyn100  happy_var_2)
+happyReduce_262 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_262 = happySpecReduce_3  83 happyReduction_262
+happyReduction_262 (HappyTerminal (Located happy_var_3 (Token (Sym CurlyR  ) _)))
+	(HappyAbsSyn103  happy_var_2)
 	(HappyTerminal (Located happy_var_1 (Token (Sym CurlyL  ) _)))
-	 =  HappyAbsSyn95
+	 =  HappyAbsSyn98
 		 (Located (rComb happy_var_1 happy_var_3) (reverse happy_var_2)
 	)
-happyReduction_258 _ _ _  = notHappyAtAll 
+happyReduction_262 _ _ _  = notHappyAtAll 
 
-happyReduce_259 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_259 = happySpecReduce_2  81 happyReduction_259
-happyReduction_259 (HappyAbsSyn96  happy_var_2)
-	(HappyAbsSyn96  happy_var_1)
-	 =  HappyAbsSyn96
+happyReduce_263 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_263 = happySpecReduce_2  84 happyReduction_263
+happyReduction_263 (HappyAbsSyn99  happy_var_2)
+	(HappyAbsSyn99  happy_var_1)
+	 =  HappyAbsSyn99
 		 (at (happy_var_1,happy_var_2) $ fmap (++ thing happy_var_2) happy_var_1
 	)
-happyReduction_259 _ _  = notHappyAtAll 
+happyReduction_263 _ _  = notHappyAtAll 
 
-happyReduce_260 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_260 = happySpecReduce_1  81 happyReduction_260
-happyReduction_260 (HappyAbsSyn96  happy_var_1)
-	 =  HappyAbsSyn96
+happyReduce_264 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_264 = happySpecReduce_1  84 happyReduction_264
+happyReduction_264 (HappyAbsSyn99  happy_var_1)
+	 =  HappyAbsSyn99
 		 (happy_var_1
 	)
-happyReduction_260 _  = notHappyAtAll 
+happyReduction_264 _  = notHappyAtAll 
 
-happyReduce_261 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_261 = happyMonadReduce 2 82 happyReduction_261
-happyReduction_261 ((HappyTerminal (Located happy_var_2 (Token (Sym FatArrR ) _))) `HappyStk`
-	(HappyAbsSyn103  happy_var_1) `HappyStk`
+happyReduce_265 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_265 = happyMonadReduce 2 85 happyReduction_265
+happyReduction_265 ((HappyTerminal (Located happy_var_2 (Token (Sym FatArrR ) _))) `HappyStk`
+	(HappyAbsSyn106  happy_var_1) `HappyStk`
 	happyRest) tk
 	 = happyThen ((( fmap (\x -> at (x,happy_var_2) x) (mkProp happy_var_1)))
-	) (\r -> happyReturn (HappyAbsSyn96 r))
+	) (\r -> happyReturn (HappyAbsSyn99 r))
 
-happyReduce_262 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_262 = happySpecReduce_1  83 happyReduction_262
-happyReduction_262 (HappyTerminal (Located happy_var_1 (Token (Op Hash) _)))
-	 =  HappyAbsSyn98
+happyReduce_266 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_266 = happySpecReduce_1  86 happyReduction_266
+happyReduction_266 (HappyTerminal (Located happy_var_1 (Token (Op Hash) _)))
+	 =  HappyAbsSyn101
 		 (Located happy_var_1 KNum
 	)
-happyReduction_262 _  = notHappyAtAll 
+happyReduction_266 _  = notHappyAtAll 
 
-happyReduce_263 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_263 = happySpecReduce_1  83 happyReduction_263
-happyReduction_263 (HappyTerminal (Located happy_var_1 (Token (Op Mul)   _)))
-	 =  HappyAbsSyn98
+happyReduce_267 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_267 = happySpecReduce_1  86 happyReduction_267
+happyReduction_267 (HappyTerminal (Located happy_var_1 (Token (Op Mul)   _)))
+	 =  HappyAbsSyn101
 		 (Located happy_var_1 KType
 	)
-happyReduction_263 _  = notHappyAtAll 
+happyReduction_267 _  = notHappyAtAll 
 
-happyReduce_264 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_264 = happySpecReduce_1  83 happyReduction_264
-happyReduction_264 (HappyTerminal (Located happy_var_1 (Token (KW KW_Prop) _)))
-	 =  HappyAbsSyn98
+happyReduce_268 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_268 = happySpecReduce_1  86 happyReduction_268
+happyReduction_268 (HappyTerminal (Located happy_var_1 (Token (KW KW_Prop) _)))
+	 =  HappyAbsSyn101
 		 (Located happy_var_1 KProp
 	)
-happyReduction_264 _  = notHappyAtAll 
+happyReduction_268 _  = notHappyAtAll 
 
-happyReduce_265 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_265 = happySpecReduce_3  83 happyReduction_265
-happyReduction_265 (HappyAbsSyn98  happy_var_3)
+happyReduce_269 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_269 = happySpecReduce_3  86 happyReduction_269
+happyReduction_269 (HappyAbsSyn101  happy_var_3)
 	_
-	(HappyAbsSyn98  happy_var_1)
-	 =  HappyAbsSyn98
+	(HappyAbsSyn101  happy_var_1)
+	 =  HappyAbsSyn101
 		 (combLoc KFun happy_var_1 happy_var_3
 	)
-happyReduction_265 _ _ _  = notHappyAtAll 
+happyReduction_269 _ _ _  = notHappyAtAll 
 
-happyReduce_266 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_266 = happyMonadReduce 1 84 happyReduction_266
-happyReduction_266 ((HappyAbsSyn112  happy_var_1) `HappyStk`
+happyReduce_270 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_270 = happyMonadReduce 1 87 happyReduction_270
+happyReduction_270 ((HappyAbsSyn115  happy_var_1) `HappyStk`
 	happyRest) tk
 	 = happyThen ((( mkTParam happy_var_1 Nothing))
-	) (\r -> happyReturn (HappyAbsSyn99 r))
+	) (\r -> happyReturn (HappyAbsSyn102 r))
 
-happyReduce_267 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_267 = happyMonadReduce 3 84 happyReduction_267
-happyReduction_267 ((HappyAbsSyn98  happy_var_3) `HappyStk`
+happyReduce_271 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_271 = happyMonadReduce 3 87 happyReduction_271
+happyReduction_271 ((HappyAbsSyn101  happy_var_3) `HappyStk`
 	_ `HappyStk`
-	(HappyAbsSyn112  happy_var_1) `HappyStk`
+	(HappyAbsSyn115  happy_var_1) `HappyStk`
 	happyRest) tk
 	 = happyThen ((( mkTParam (at (happy_var_1,happy_var_3) happy_var_1) (Just (thing happy_var_3))))
-	) (\r -> happyReturn (HappyAbsSyn99 r))
+	) (\r -> happyReturn (HappyAbsSyn102 r))
 
-happyReduce_268 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_268 = happySpecReduce_1  85 happyReduction_268
-happyReduction_268 (HappyAbsSyn99  happy_var_1)
-	 =  HappyAbsSyn100
+happyReduce_272 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_272 = happySpecReduce_1  88 happyReduction_272
+happyReduction_272 (HappyAbsSyn102  happy_var_1)
+	 =  HappyAbsSyn103
 		 ([happy_var_1]
 	)
-happyReduction_268 _  = notHappyAtAll 
+happyReduction_272 _  = notHappyAtAll 
 
-happyReduce_269 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_269 = happySpecReduce_3  85 happyReduction_269
-happyReduction_269 (HappyAbsSyn99  happy_var_3)
+happyReduce_273 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_273 = happySpecReduce_3  88 happyReduction_273
+happyReduction_273 (HappyAbsSyn102  happy_var_3)
 	_
-	(HappyAbsSyn100  happy_var_1)
-	 =  HappyAbsSyn100
+	(HappyAbsSyn103  happy_var_1)
+	 =  HappyAbsSyn103
 		 (happy_var_3 : happy_var_1
 	)
-happyReduction_269 _ _ _  = notHappyAtAll 
+happyReduction_273 _ _ _  = notHappyAtAll 
 
-happyReduce_270 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_270 = happyMonadReduce 1 86 happyReduction_270
-happyReduction_270 ((HappyAbsSyn112  happy_var_1) `HappyStk`
+happyReduce_274 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_274 = happyMonadReduce 1 89 happyReduction_274
+happyReduction_274 ((HappyAbsSyn115  happy_var_1) `HappyStk`
 	happyRest) tk
 	 = happyThen ((( mkTParam happy_var_1 Nothing))
-	) (\r -> happyReturn (HappyAbsSyn99 r))
+	) (\r -> happyReturn (HappyAbsSyn102 r))
 
-happyReduce_271 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_271 = happyMonadReduce 5 86 happyReduction_271
-happyReduction_271 ((HappyTerminal (Located happy_var_5 (Token (Sym ParenR  ) _))) `HappyStk`
-	(HappyAbsSyn98  happy_var_4) `HappyStk`
+happyReduce_275 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_275 = happyMonadReduce 5 89 happyReduction_275
+happyReduction_275 ((HappyTerminal (Located happy_var_5 (Token (Sym ParenR  ) _))) `HappyStk`
+	(HappyAbsSyn101  happy_var_4) `HappyStk`
 	_ `HappyStk`
-	(HappyAbsSyn112  happy_var_2) `HappyStk`
+	(HappyAbsSyn115  happy_var_2) `HappyStk`
 	(HappyTerminal (Located happy_var_1 (Token (Sym ParenL  ) _))) `HappyStk`
 	happyRest) tk
 	 = happyThen ((( mkTParam (at (happy_var_1,happy_var_5) happy_var_2) (Just (thing happy_var_4))))
-	) (\r -> happyReturn (HappyAbsSyn99 r))
+	) (\r -> happyReturn (HappyAbsSyn102 r))
 
-happyReduce_272 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_272 = happySpecReduce_1  87 happyReduction_272
-happyReduction_272 (HappyAbsSyn99  happy_var_1)
-	 =  HappyAbsSyn100
+happyReduce_276 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_276 = happySpecReduce_1  90 happyReduction_276
+happyReduction_276 (HappyAbsSyn102  happy_var_1)
+	 =  HappyAbsSyn103
 		 ([happy_var_1]
 	)
-happyReduction_272 _  = notHappyAtAll 
+happyReduction_276 _  = notHappyAtAll 
 
-happyReduce_273 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_273 = happySpecReduce_2  87 happyReduction_273
-happyReduction_273 (HappyAbsSyn99  happy_var_2)
-	(HappyAbsSyn100  happy_var_1)
-	 =  HappyAbsSyn100
+happyReduce_277 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_277 = happySpecReduce_2  90 happyReduction_277
+happyReduction_277 (HappyAbsSyn102  happy_var_2)
+	(HappyAbsSyn103  happy_var_1)
+	 =  HappyAbsSyn103
 		 (happy_var_2 : happy_var_1
 	)
-happyReduction_273 _ _  = notHappyAtAll 
+happyReduction_277 _ _  = notHappyAtAll 
 
-happyReduce_274 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_274 = happySpecReduce_3  88 happyReduction_274
-happyReduction_274 (HappyAbsSyn103  happy_var_3)
+happyReduce_278 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_278 = happySpecReduce_3  91 happyReduction_278
+happyReduction_278 (HappyAbsSyn106  happy_var_3)
 	_
-	(HappyAbsSyn103  happy_var_1)
-	 =  HappyAbsSyn103
+	(HappyAbsSyn106  happy_var_1)
+	 =  HappyAbsSyn106
 		 (at (happy_var_1,happy_var_3) $ TFun happy_var_1 happy_var_3
 	)
-happyReduction_274 _ _ _  = notHappyAtAll 
+happyReduction_278 _ _ _  = notHappyAtAll 
 
-happyReduce_275 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_275 = happySpecReduce_1  88 happyReduction_275
-happyReduction_275 (HappyAbsSyn103  happy_var_1)
-	 =  HappyAbsSyn103
+happyReduce_279 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_279 = happySpecReduce_1  91 happyReduction_279
+happyReduction_279 (HappyAbsSyn106  happy_var_1)
+	 =  HappyAbsSyn106
 		 (happy_var_1
 	)
-happyReduction_275 _  = notHappyAtAll 
+happyReduction_279 _  = notHappyAtAll 
 
-happyReduce_276 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_276 = happySpecReduce_3  89 happyReduction_276
-happyReduction_276 (HappyAbsSyn103  happy_var_3)
-	(HappyAbsSyn44  happy_var_2)
-	(HappyAbsSyn103  happy_var_1)
-	 =  HappyAbsSyn103
+happyReduce_280 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_280 = happySpecReduce_3  92 happyReduction_280
+happyReduction_280 (HappyAbsSyn106  happy_var_3)
+	(HappyAbsSyn47  happy_var_2)
+	(HappyAbsSyn106  happy_var_1)
+	 =  HappyAbsSyn106
 		 (at (happy_var_1,happy_var_3) $ TInfix happy_var_1 happy_var_2 defaultFixity happy_var_3
 	)
-happyReduction_276 _ _ _  = notHappyAtAll 
+happyReduction_280 _ _ _  = notHappyAtAll 
 
-happyReduce_277 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_277 = happySpecReduce_1  89 happyReduction_277
-happyReduction_277 (HappyAbsSyn103  happy_var_1)
-	 =  HappyAbsSyn103
+happyReduce_281 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_281 = happySpecReduce_1  92 happyReduction_281
+happyReduction_281 (HappyAbsSyn106  happy_var_1)
+	 =  HappyAbsSyn106
 		 (happy_var_1
 	)
-happyReduction_277 _  = notHappyAtAll 
+happyReduction_281 _  = notHappyAtAll 
 
-happyReduce_278 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_278 = happySpecReduce_2  90 happyReduction_278
-happyReduction_278 (HappyAbsSyn103  happy_var_2)
-	(HappyAbsSyn108  happy_var_1)
-	 =  HappyAbsSyn103
+happyReduce_282 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_282 = happySpecReduce_2  93 happyReduction_282
+happyReduction_282 (HappyAbsSyn106  happy_var_2)
+	(HappyAbsSyn111  happy_var_1)
+	 =  HappyAbsSyn106
 		 (at (happy_var_1,happy_var_2) $ foldr TSeq happy_var_2 (reverse (thing happy_var_1))
 	)
-happyReduction_278 _ _  = notHappyAtAll 
+happyReduction_282 _ _  = notHappyAtAll 
 
-happyReduce_279 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_279 = happySpecReduce_2  90 happyReduction_279
-happyReduction_279 (HappyAbsSyn107  happy_var_2)
-	(HappyAbsSyn116  happy_var_1)
-	 =  HappyAbsSyn103
+happyReduce_283 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_283 = happySpecReduce_2  93 happyReduction_283
+happyReduction_283 (HappyAbsSyn110  happy_var_2)
+	(HappyAbsSyn119  happy_var_1)
+	 =  HappyAbsSyn106
 		 (at (happy_var_1,head happy_var_2)
                                      $ TUser (thing happy_var_1) (reverse happy_var_2)
 	)
-happyReduction_279 _ _  = notHappyAtAll 
+happyReduction_283 _ _  = notHappyAtAll 
 
-happyReduce_280 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_280 = happySpecReduce_1  90 happyReduction_280
-happyReduction_280 (HappyAbsSyn103  happy_var_1)
-	 =  HappyAbsSyn103
+happyReduce_284 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_284 = happySpecReduce_1  93 happyReduction_284
+happyReduction_284 (HappyAbsSyn106  happy_var_1)
+	 =  HappyAbsSyn106
 		 (happy_var_1
 	)
-happyReduction_280 _  = notHappyAtAll 
+happyReduction_284 _  = notHappyAtAll 
 
-happyReduce_281 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_281 = happySpecReduce_1  91 happyReduction_281
-happyReduction_281 (HappyAbsSyn116  happy_var_1)
-	 =  HappyAbsSyn103
+happyReduce_285 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_285 = happySpecReduce_1  94 happyReduction_285
+happyReduction_285 (HappyAbsSyn119  happy_var_1)
+	 =  HappyAbsSyn106
 		 (at happy_var_1 $ TUser (thing happy_var_1) []
 	)
-happyReduction_281 _  = notHappyAtAll 
+happyReduction_285 _  = notHappyAtAll 
 
-happyReduce_282 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_282 = happySpecReduce_3  91 happyReduction_282
-happyReduction_282 _
-	(HappyAbsSyn44  happy_var_2)
+happyReduce_286 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_286 = happySpecReduce_3  94 happyReduction_286
+happyReduction_286 _
+	(HappyAbsSyn47  happy_var_2)
 	(HappyTerminal (Located happy_var_1 (Token (Sym ParenL  ) _)))
-	 =  HappyAbsSyn103
+	 =  HappyAbsSyn106
 		 (at happy_var_1 $ TUser (thing happy_var_2) []
 	)
-happyReduction_282 _ _ _  = notHappyAtAll 
+happyReduction_286 _ _ _  = notHappyAtAll 
 
-happyReduce_283 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_283 = happySpecReduce_1  91 happyReduction_283
-happyReduction_283 (HappyTerminal (happy_var_1@(Located _ (Token (Num   {}) _))))
-	 =  HappyAbsSyn103
+happyReduce_287 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_287 = happySpecReduce_1  94 happyReduction_287
+happyReduction_287 (HappyTerminal (happy_var_1@(Located _ (Token (Num   {}) _))))
+	 =  HappyAbsSyn106
 		 (at happy_var_1 $ TNum  (getNum happy_var_1)
 	)
-happyReduction_283 _  = notHappyAtAll 
+happyReduction_287 _  = notHappyAtAll 
 
-happyReduce_284 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_284 = happySpecReduce_1  91 happyReduction_284
-happyReduction_284 (HappyTerminal (happy_var_1@(Located _ (Token (ChrLit {}) _))))
-	 =  HappyAbsSyn103
+happyReduce_288 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_288 = happySpecReduce_1  94 happyReduction_288
+happyReduction_288 (HappyTerminal (happy_var_1@(Located _ (Token (ChrLit {}) _))))
+	 =  HappyAbsSyn106
 		 (at happy_var_1 $ TChar (getChr happy_var_1)
 	)
-happyReduction_284 _  = notHappyAtAll 
+happyReduction_288 _  = notHappyAtAll 
 
-happyReduce_285 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_285 = happySpecReduce_3  91 happyReduction_285
-happyReduction_285 (HappyTerminal (Located happy_var_3 (Token (Sym BracketR) _)))
-	(HappyAbsSyn103  happy_var_2)
+happyReduce_289 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_289 = happySpecReduce_3  94 happyReduction_289
+happyReduction_289 (HappyTerminal (Located happy_var_3 (Token (Sym BracketR) _)))
+	(HappyAbsSyn106  happy_var_2)
 	(HappyTerminal (Located happy_var_1 (Token (Sym BracketL) _)))
-	 =  HappyAbsSyn103
+	 =  HappyAbsSyn106
 		 (at (happy_var_1,happy_var_3) $ TSeq happy_var_2 TBit
 	)
-happyReduction_285 _ _ _  = notHappyAtAll 
+happyReduction_289 _ _ _  = notHappyAtAll 
 
-happyReduce_286 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_286 = happySpecReduce_3  91 happyReduction_286
-happyReduction_286 (HappyTerminal (Located happy_var_3 (Token (Sym ParenR  ) _)))
-	(HappyAbsSyn103  happy_var_2)
+happyReduce_290 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_290 = happySpecReduce_3  94 happyReduction_290
+happyReduction_290 (HappyTerminal (Located happy_var_3 (Token (Sym ParenR  ) _)))
+	(HappyAbsSyn106  happy_var_2)
 	(HappyTerminal (Located happy_var_1 (Token (Sym ParenL  ) _)))
-	 =  HappyAbsSyn103
+	 =  HappyAbsSyn106
 		 (at (happy_var_1,happy_var_3) $ TParens happy_var_2
 	)
-happyReduction_286 _ _ _  = notHappyAtAll 
+happyReduction_290 _ _ _  = notHappyAtAll 
 
-happyReduce_287 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_287 = happySpecReduce_2  91 happyReduction_287
-happyReduction_287 (HappyTerminal (Located happy_var_2 (Token (Sym ParenR  ) _)))
+happyReduce_291 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_291 = happySpecReduce_2  94 happyReduction_291
+happyReduction_291 (HappyTerminal (Located happy_var_2 (Token (Sym ParenR  ) _)))
 	(HappyTerminal (Located happy_var_1 (Token (Sym ParenL  ) _)))
-	 =  HappyAbsSyn103
+	 =  HappyAbsSyn106
 		 (at (happy_var_1,happy_var_2) $ TTuple []
 	)
-happyReduction_287 _ _  = notHappyAtAll 
+happyReduction_291 _ _  = notHappyAtAll 
 
-happyReduce_288 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_288 = happySpecReduce_3  91 happyReduction_288
-happyReduction_288 (HappyTerminal (Located happy_var_3 (Token (Sym ParenR  ) _)))
-	(HappyAbsSyn109  happy_var_2)
+happyReduce_292 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_292 = happySpecReduce_3  94 happyReduction_292
+happyReduction_292 (HappyTerminal (Located happy_var_3 (Token (Sym ParenR  ) _)))
+	(HappyAbsSyn112  happy_var_2)
 	(HappyTerminal (Located happy_var_1 (Token (Sym ParenL  ) _)))
-	 =  HappyAbsSyn103
+	 =  HappyAbsSyn106
 		 (at (happy_var_1,happy_var_3) $ TTuple  (reverse happy_var_2)
 	)
-happyReduction_288 _ _ _  = notHappyAtAll 
+happyReduction_292 _ _ _  = notHappyAtAll 
 
-happyReduce_289 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_289 = happyMonadReduce 2 91 happyReduction_289
-happyReduction_289 ((HappyTerminal (Located happy_var_2 (Token (Sym CurlyR  ) _))) `HappyStk`
+happyReduce_293 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_293 = happyMonadReduce 2 94 happyReduction_293
+happyReduction_293 ((HappyTerminal (Located happy_var_2 (Token (Sym CurlyR  ) _))) `HappyStk`
 	(HappyTerminal (Located happy_var_1 (Token (Sym CurlyL  ) _))) `HappyStk`
 	happyRest) tk
 	 = happyThen ((( mkRecord (rComb happy_var_1 happy_var_2) TRecord []))
-	) (\r -> happyReturn (HappyAbsSyn103 r))
+	) (\r -> happyReturn (HappyAbsSyn106 r))
 
-happyReduce_290 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_290 = happyMonadReduce 3 91 happyReduction_290
-happyReduction_290 ((HappyTerminal (Located happy_var_3 (Token (Sym CurlyR  ) _))) `HappyStk`
-	(HappyAbsSyn111  happy_var_2) `HappyStk`
+happyReduce_294 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_294 = happyMonadReduce 3 94 happyReduction_294
+happyReduction_294 ((HappyTerminal (Located happy_var_3 (Token (Sym CurlyR  ) _))) `HappyStk`
+	(HappyAbsSyn114  happy_var_2) `HappyStk`
 	(HappyTerminal (Located happy_var_1 (Token (Sym CurlyL  ) _))) `HappyStk`
 	happyRest) tk
 	 = happyThen ((( mkRecord (rComb happy_var_1 happy_var_3) TRecord happy_var_2))
-	) (\r -> happyReturn (HappyAbsSyn103 r))
+	) (\r -> happyReturn (HappyAbsSyn106 r))
 
-happyReduce_291 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_291 = happySpecReduce_1  91 happyReduction_291
-happyReduction_291 (HappyTerminal (Located happy_var_1 (Token (Sym Underscore ) _)))
-	 =  HappyAbsSyn103
+happyReduce_295 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_295 = happySpecReduce_1  94 happyReduction_295
+happyReduction_295 (HappyTerminal (Located happy_var_1 (Token (Sym Underscore ) _)))
+	 =  HappyAbsSyn106
 		 (at happy_var_1 TWild
 	)
-happyReduction_291 _  = notHappyAtAll 
+happyReduction_295 _  = notHappyAtAll 
 
-happyReduce_292 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_292 = happySpecReduce_1  92 happyReduction_292
-happyReduction_292 (HappyAbsSyn103  happy_var_1)
-	 =  HappyAbsSyn107
+happyReduce_296 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_296 = happySpecReduce_1  95 happyReduction_296
+happyReduction_296 (HappyAbsSyn106  happy_var_1)
+	 =  HappyAbsSyn110
 		 ([ happy_var_1 ]
 	)
-happyReduction_292 _  = notHappyAtAll 
+happyReduction_296 _  = notHappyAtAll 
 
-happyReduce_293 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_293 = happySpecReduce_2  92 happyReduction_293
-happyReduction_293 (HappyAbsSyn103  happy_var_2)
-	(HappyAbsSyn107  happy_var_1)
-	 =  HappyAbsSyn107
+happyReduce_297 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_297 = happySpecReduce_2  95 happyReduction_297
+happyReduction_297 (HappyAbsSyn106  happy_var_2)
+	(HappyAbsSyn110  happy_var_1)
+	 =  HappyAbsSyn110
 		 (happy_var_2 : happy_var_1
 	)
-happyReduction_293 _ _  = notHappyAtAll 
+happyReduction_297 _ _  = notHappyAtAll 
 
-happyReduce_294 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_294 = happySpecReduce_3  93 happyReduction_294
-happyReduction_294 (HappyTerminal (Located happy_var_3 (Token (Sym BracketR) _)))
-	(HappyAbsSyn103  happy_var_2)
+happyReduce_298 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_298 = happySpecReduce_3  96 happyReduction_298
+happyReduction_298 (HappyTerminal (Located happy_var_3 (Token (Sym BracketR) _)))
+	(HappyAbsSyn106  happy_var_2)
 	(HappyTerminal (Located happy_var_1 (Token (Sym BracketL) _)))
-	 =  HappyAbsSyn108
+	 =  HappyAbsSyn111
 		 (Located (rComb happy_var_1 happy_var_3) [ happy_var_2 ]
 	)
-happyReduction_294 _ _ _  = notHappyAtAll 
+happyReduction_298 _ _ _  = notHappyAtAll 
 
-happyReduce_295 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_295 = happyReduce 4 93 happyReduction_295
-happyReduction_295 ((HappyTerminal (Located happy_var_4 (Token (Sym BracketR) _))) `HappyStk`
-	(HappyAbsSyn103  happy_var_3) `HappyStk`
+happyReduce_299 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_299 = happyReduce 4 96 happyReduction_299
+happyReduction_299 ((HappyTerminal (Located happy_var_4 (Token (Sym BracketR) _))) `HappyStk`
+	(HappyAbsSyn106  happy_var_3) `HappyStk`
 	_ `HappyStk`
-	(HappyAbsSyn108  happy_var_1) `HappyStk`
+	(HappyAbsSyn111  happy_var_1) `HappyStk`
 	happyRest)
-	 = HappyAbsSyn108
+	 = HappyAbsSyn111
 		 (at (happy_var_1,happy_var_4) (fmap (happy_var_3 :) happy_var_1)
 	) `HappyStk` happyRest
 
-happyReduce_296 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_296 = happySpecReduce_3  94 happyReduction_296
-happyReduction_296 (HappyAbsSyn103  happy_var_3)
+happyReduce_300 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_300 = happySpecReduce_3  97 happyReduction_300
+happyReduction_300 (HappyAbsSyn106  happy_var_3)
 	_
-	(HappyAbsSyn103  happy_var_1)
-	 =  HappyAbsSyn109
+	(HappyAbsSyn106  happy_var_1)
+	 =  HappyAbsSyn112
 		 ([ happy_var_3, happy_var_1]
 	)
-happyReduction_296 _ _ _  = notHappyAtAll 
+happyReduction_300 _ _ _  = notHappyAtAll 
 
-happyReduce_297 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_297 = happySpecReduce_3  94 happyReduction_297
-happyReduction_297 (HappyAbsSyn103  happy_var_3)
+happyReduce_301 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_301 = happySpecReduce_3  97 happyReduction_301
+happyReduction_301 (HappyAbsSyn106  happy_var_3)
 	_
-	(HappyAbsSyn109  happy_var_1)
-	 =  HappyAbsSyn109
+	(HappyAbsSyn112  happy_var_1)
+	 =  HappyAbsSyn112
 		 (happy_var_3 : happy_var_1
 	)
-happyReduction_297 _ _ _  = notHappyAtAll 
+happyReduction_301 _ _ _  = notHappyAtAll 
 
-happyReduce_298 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_298 = happySpecReduce_3  95 happyReduction_298
-happyReduction_298 (HappyAbsSyn103  happy_var_3)
+happyReduce_302 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_302 = happySpecReduce_3  98 happyReduction_302
+happyReduction_302 (HappyAbsSyn106  happy_var_3)
 	_
-	(HappyAbsSyn112  happy_var_1)
-	 =  HappyAbsSyn110
+	(HappyAbsSyn115  happy_var_1)
+	 =  HappyAbsSyn113
 		 (Named { name = happy_var_1, value = happy_var_3 }
 	)
-happyReduction_298 _ _ _  = notHappyAtAll 
+happyReduction_302 _ _ _  = notHappyAtAll 
 
-happyReduce_299 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_299 = happySpecReduce_1  96 happyReduction_299
-happyReduction_299 (HappyAbsSyn110  happy_var_1)
-	 =  HappyAbsSyn111
+happyReduce_303 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_303 = happySpecReduce_1  99 happyReduction_303
+happyReduction_303 (HappyAbsSyn113  happy_var_1)
+	 =  HappyAbsSyn114
 		 ([happy_var_1]
 	)
-happyReduction_299 _  = notHappyAtAll 
+happyReduction_303 _  = notHappyAtAll 
 
-happyReduce_300 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_300 = happySpecReduce_3  96 happyReduction_300
-happyReduction_300 (HappyAbsSyn110  happy_var_3)
+happyReduce_304 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_304 = happySpecReduce_3  99 happyReduction_304
+happyReduction_304 (HappyAbsSyn113  happy_var_3)
 	_
-	(HappyAbsSyn111  happy_var_1)
-	 =  HappyAbsSyn111
+	(HappyAbsSyn114  happy_var_1)
+	 =  HappyAbsSyn114
 		 (happy_var_3 : happy_var_1
 	)
-happyReduction_300 _ _ _  = notHappyAtAll 
+happyReduction_304 _ _ _  = notHappyAtAll 
 
-happyReduce_301 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_301 = happySpecReduce_1  97 happyReduction_301
-happyReduction_301 (HappyTerminal (happy_var_1@(Located _ (Token (Ident [] _) _))))
-	 =  HappyAbsSyn112
+happyReduce_305 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_305 = happySpecReduce_1  100 happyReduction_305
+happyReduction_305 (HappyTerminal (happy_var_1@(Located _ (Token (Ident [] _) _))))
+	 =  HappyAbsSyn115
 		 (let Token (Ident _ str) _ = thing happy_var_1
                          in happy_var_1 { thing = mkIdent str }
 	)
-happyReduction_301 _  = notHappyAtAll 
+happyReduction_305 _  = notHappyAtAll 
 
-happyReduce_302 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_302 = happySpecReduce_1  97 happyReduction_302
-happyReduction_302 (HappyTerminal (Located happy_var_1 (Token (KW KW_x)       _)))
-	 =  HappyAbsSyn112
+happyReduce_306 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_306 = happySpecReduce_1  100 happyReduction_306
+happyReduction_306 (HappyTerminal (Located happy_var_1 (Token (KW KW_x)       _)))
+	 =  HappyAbsSyn115
 		 (Located { srcRange = happy_var_1, thing = mkIdent "x" }
 	)
-happyReduction_302 _  = notHappyAtAll 
+happyReduction_306 _  = notHappyAtAll 
 
-happyReduce_303 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_303 = happySpecReduce_1  97 happyReduction_303
-happyReduction_303 (HappyTerminal (Located happy_var_1 (Token (KW KW_private)   _)))
-	 =  HappyAbsSyn112
+happyReduce_307 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_307 = happySpecReduce_1  100 happyReduction_307
+happyReduction_307 (HappyTerminal (Located happy_var_1 (Token (KW KW_private)   _)))
+	 =  HappyAbsSyn115
 		 (Located { srcRange = happy_var_1, thing = mkIdent "private" }
 	)
-happyReduction_303 _  = notHappyAtAll 
+happyReduction_307 _  = notHappyAtAll 
 
-happyReduce_304 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_304 = happySpecReduce_1  97 happyReduction_304
-happyReduction_304 (HappyTerminal (Located happy_var_1 (Token (KW KW_as)        _)))
-	 =  HappyAbsSyn112
+happyReduce_308 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_308 = happySpecReduce_1  100 happyReduction_308
+happyReduction_308 (HappyTerminal (Located happy_var_1 (Token (KW KW_as)        _)))
+	 =  HappyAbsSyn115
 		 (Located { srcRange = happy_var_1, thing = mkIdent "as" }
 	)
-happyReduction_304 _  = notHappyAtAll 
+happyReduction_308 _  = notHappyAtAll 
 
-happyReduce_305 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_305 = happySpecReduce_1  97 happyReduction_305
-happyReduction_305 (HappyTerminal (Located happy_var_1 (Token (KW KW_hiding)    _)))
-	 =  HappyAbsSyn112
+happyReduce_309 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_309 = happySpecReduce_1  100 happyReduction_309
+happyReduction_309 (HappyTerminal (Located happy_var_1 (Token (KW KW_hiding)    _)))
+	 =  HappyAbsSyn115
 		 (Located { srcRange = happy_var_1, thing = mkIdent "hiding" }
 	)
-happyReduction_305 _  = notHappyAtAll 
+happyReduction_309 _  = notHappyAtAll 
 
-happyReduce_306 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_306 = happySpecReduce_1  98 happyReduction_306
-happyReduction_306 (HappyAbsSyn112  happy_var_1)
-	 =  HappyAbsSyn44
+happyReduce_310 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_310 = happySpecReduce_1  101 happyReduction_310
+happyReduction_310 (HappyAbsSyn115  happy_var_1)
+	 =  HappyAbsSyn47
 		 (fmap mkUnqual happy_var_1
 	)
-happyReduction_306 _  = notHappyAtAll 
+happyReduction_310 _  = notHappyAtAll 
 
-happyReduce_307 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_307 = happySpecReduce_1  99 happyReduction_307
-happyReduction_307 (HappyAbsSyn112  happy_var_1)
-	 =  HappyAbsSyn114
+happyReduce_311 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_311 = happySpecReduce_1  102 happyReduction_311
+happyReduction_311 (HappyAbsSyn115  happy_var_1)
+	 =  HappyAbsSyn117
 		 (fmap (mkModName . (:[]) . identText) happy_var_1
 	)
-happyReduction_307 _  = notHappyAtAll 
+happyReduction_311 _  = notHappyAtAll 
 
-happyReduce_308 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_308 = happySpecReduce_1  99 happyReduction_308
-happyReduction_308 (HappyTerminal (happy_var_1@(Located _ (Token  Ident{}     _))))
-	 =  HappyAbsSyn114
+happyReduce_312 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_312 = happySpecReduce_1  102 happyReduction_312
+happyReduction_312 (HappyTerminal (happy_var_1@(Located _ (Token  Ident{}     _))))
+	 =  HappyAbsSyn117
 		 (let Token (Ident ns i) _ = thing happy_var_1
                                      in mkModName (ns ++ [i]) A.<$ happy_var_1
 	)
-happyReduction_308 _  = notHappyAtAll 
+happyReduction_312 _  = notHappyAtAll 
 
-happyReduce_309 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_309 = happySpecReduce_1  100 happyReduction_309
-happyReduction_309 (HappyAbsSyn114  happy_var_1)
-	 =  HappyAbsSyn114
+happyReduce_313 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_313 = happySpecReduce_1  103 happyReduction_313
+happyReduction_313 (HappyAbsSyn117  happy_var_1)
+	 =  HappyAbsSyn117
 		 (happy_var_1
 	)
-happyReduction_309 _  = notHappyAtAll 
+happyReduction_313 _  = notHappyAtAll 
 
-happyReduce_310 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_310 = happySpecReduce_2  100 happyReduction_310
-happyReduction_310 (HappyAbsSyn114  happy_var_2)
+happyReduce_314 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_314 = happySpecReduce_2  103 happyReduction_314
+happyReduction_314 (HappyAbsSyn117  happy_var_2)
 	_
-	 =  HappyAbsSyn114
+	 =  HappyAbsSyn117
 		 (fmap paramInstModName happy_var_2
 	)
-happyReduction_310 _ _  = notHappyAtAll 
+happyReduction_314 _ _  = notHappyAtAll 
 
-happyReduce_311 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_311 = happySpecReduce_1  101 happyReduction_311
-happyReduction_311 (HappyAbsSyn44  happy_var_1)
-	 =  HappyAbsSyn116
+happyReduce_315 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_315 = happySpecReduce_1  104 happyReduction_315
+happyReduction_315 (HappyAbsSyn47  happy_var_1)
+	 =  HappyAbsSyn119
 		 (happy_var_1
 	)
-happyReduction_311 _  = notHappyAtAll 
+happyReduction_315 _  = notHappyAtAll 
 
-happyReduce_312 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_312 = happySpecReduce_1  101 happyReduction_312
-happyReduction_312 (HappyTerminal (happy_var_1@(Located _ (Token  Ident{}     _))))
-	 =  HappyAbsSyn116
+happyReduce_316 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_316 = happySpecReduce_1  104 happyReduction_316
+happyReduction_316 (HappyTerminal (happy_var_1@(Located _ (Token  Ident{}     _))))
+	 =  HappyAbsSyn119
 		 (let Token (Ident ns i) _ = thing happy_var_1
                                      in mkQual (mkModName ns) (mkIdent i) A.<$ happy_var_1
 	)
-happyReduction_312 _  = notHappyAtAll 
+happyReduction_316 _  = notHappyAtAll 
 
-happyReduce_313 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_313 = happySpecReduce_1  102 happyReduction_313
-happyReduction_313 (HappyAbsSyn116  happy_var_1)
-	 =  HappyAbsSyn116
+happyReduce_317 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_317 = happySpecReduce_1  105 happyReduction_317
+happyReduction_317 (HappyAbsSyn119  happy_var_1)
+	 =  HappyAbsSyn119
 		 (happy_var_1
 	)
-happyReduction_313 _  = notHappyAtAll 
+happyReduction_317 _  = notHappyAtAll 
 
-happyReduce_314 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_314 = happySpecReduce_1  102 happyReduction_314
-happyReduction_314 (HappyAbsSyn44  happy_var_1)
-	 =  HappyAbsSyn116
+happyReduce_318 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_318 = happySpecReduce_1  105 happyReduction_318
+happyReduction_318 (HappyAbsSyn47  happy_var_1)
+	 =  HappyAbsSyn119
 		 (happy_var_1
 	)
-happyReduction_314 _  = notHappyAtAll 
+happyReduction_318 _  = notHappyAtAll 
 
-happyReduce_315 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_315 = happySpecReduce_3  102 happyReduction_315
-happyReduction_315 _
-	(HappyAbsSyn44  happy_var_2)
+happyReduce_319 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_319 = happySpecReduce_3  105 happyReduction_319
+happyReduction_319 _
+	(HappyAbsSyn47  happy_var_2)
 	_
-	 =  HappyAbsSyn116
+	 =  HappyAbsSyn119
 		 (happy_var_2
 	)
-happyReduction_315 _ _ _  = notHappyAtAll 
+happyReduction_319 _ _ _  = notHappyAtAll 
 
-happyReduce_316 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_316 = happySpecReduce_1  103 happyReduction_316
-happyReduction_316 (HappyAbsSyn116  happy_var_1)
-	 =  HappyAbsSyn103
+happyReduce_320 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_320 = happySpecReduce_1  106 happyReduction_320
+happyReduction_320 (HappyAbsSyn119  happy_var_1)
+	 =  HappyAbsSyn106
 		 (at happy_var_1 $ TUser (thing happy_var_1) []
 	)
-happyReduction_316 _  = notHappyAtAll 
+happyReduction_320 _  = notHappyAtAll 
 
-happyReduce_317 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_317 = happySpecReduce_1  103 happyReduction_317
-happyReduction_317 (HappyTerminal (happy_var_1@(Located _ (Token (Num   {}) _))))
-	 =  HappyAbsSyn103
+happyReduce_321 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_321 = happySpecReduce_1  106 happyReduction_321
+happyReduction_321 (HappyTerminal (happy_var_1@(Located _ (Token (Num   {}) _))))
+	 =  HappyAbsSyn106
 		 (at happy_var_1 $ TNum  (getNum happy_var_1)
 	)
-happyReduction_317 _  = notHappyAtAll 
+happyReduction_321 _  = notHappyAtAll 
 
-happyReduce_318 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_318 = happyMonadReduce 3 103 happyReduction_318
-happyReduction_318 ((HappyTerminal (Located happy_var_3 (Token (Sym ParenR  ) _))) `HappyStk`
-	(HappyAbsSyn103  happy_var_2) `HappyStk`
+happyReduce_322 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_322 = happyMonadReduce 3 106 happyReduction_322
+happyReduction_322 ((HappyTerminal (Located happy_var_3 (Token (Sym ParenR  ) _))) `HappyStk`
+	(HappyAbsSyn106  happy_var_2) `HappyStk`
 	(HappyTerminal (Located happy_var_1 (Token (Sym ParenL  ) _))) `HappyStk`
 	happyRest) tk
 	 = happyThen ((( validDemotedType (rComb happy_var_1 happy_var_3) happy_var_2))
-	) (\r -> happyReturn (HappyAbsSyn103 r))
+	) (\r -> happyReturn (HappyAbsSyn106 r))
 
-happyReduce_319 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_319 = happySpecReduce_2  103 happyReduction_319
-happyReduction_319 (HappyTerminal (Located happy_var_2 (Token (Sym CurlyR  ) _)))
+happyReduce_323 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_323 = happySpecReduce_2  106 happyReduction_323
+happyReduction_323 (HappyTerminal (Located happy_var_2 (Token (Sym CurlyR  ) _)))
 	(HappyTerminal (Located happy_var_1 (Token (Sym CurlyL  ) _)))
-	 =  HappyAbsSyn103
+	 =  HappyAbsSyn106
 		 (at (happy_var_1,happy_var_2) (TTyApp [])
 	)
-happyReduction_319 _ _  = notHappyAtAll 
+happyReduction_323 _ _  = notHappyAtAll 
 
-happyReduce_320 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_320 = happySpecReduce_3  103 happyReduction_320
-happyReduction_320 (HappyTerminal (Located happy_var_3 (Token (Sym CurlyR  ) _)))
-	(HappyAbsSyn111  happy_var_2)
+happyReduce_324 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_324 = happySpecReduce_3  106 happyReduction_324
+happyReduction_324 (HappyTerminal (Located happy_var_3 (Token (Sym CurlyR  ) _)))
+	(HappyAbsSyn114  happy_var_2)
 	(HappyTerminal (Located happy_var_1 (Token (Sym CurlyL  ) _)))
-	 =  HappyAbsSyn103
+	 =  HappyAbsSyn106
 		 (at (happy_var_1,happy_var_3) (TTyApp (reverse happy_var_2))
 	)
-happyReduction_320 _ _ _  = notHappyAtAll 
+happyReduction_324 _ _ _  = notHappyAtAll 
 
-happyReduce_321 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_321 = happySpecReduce_3  103 happyReduction_321
-happyReduction_321 (HappyTerminal (Located happy_var_3 (Token (Sym CurlyR  ) _)))
-	(HappyAbsSyn103  happy_var_2)
+happyReduce_325 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_325 = happySpecReduce_3  106 happyReduction_325
+happyReduction_325 (HappyTerminal (Located happy_var_3 (Token (Sym CurlyR  ) _)))
+	(HappyAbsSyn106  happy_var_2)
 	(HappyTerminal (Located happy_var_1 (Token (Sym CurlyL  ) _)))
-	 =  HappyAbsSyn103
+	 =  HappyAbsSyn106
 		 (anonTyApp (getLoc (happy_var_1,happy_var_3)) [happy_var_2]
 	)
-happyReduction_321 _ _ _  = notHappyAtAll 
+happyReduction_325 _ _ _  = notHappyAtAll 
 
-happyReduce_322 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_322 = happySpecReduce_3  103 happyReduction_322
-happyReduction_322 (HappyTerminal (Located happy_var_3 (Token (Sym CurlyR  ) _)))
-	(HappyAbsSyn109  happy_var_2)
+happyReduce_326 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_326 = happySpecReduce_3  106 happyReduction_326
+happyReduction_326 (HappyTerminal (Located happy_var_3 (Token (Sym CurlyR  ) _)))
+	(HappyAbsSyn112  happy_var_2)
 	(HappyTerminal (Located happy_var_1 (Token (Sym CurlyL  ) _)))
-	 =  HappyAbsSyn103
+	 =  HappyAbsSyn106
 		 (anonTyApp (getLoc (happy_var_1,happy_var_3)) (reverse happy_var_2)
 	)
-happyReduction_322 _ _ _  = notHappyAtAll 
+happyReduction_326 _ _ _  = notHappyAtAll 
 
-happyReduce_323 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_323 = happySpecReduce_3  104 happyReduction_323
-happyReduction_323 (HappyAbsSyn103  happy_var_3)
+happyReduce_327 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_327 = happySpecReduce_3  107 happyReduction_327
+happyReduction_327 (HappyAbsSyn106  happy_var_3)
 	_
-	(HappyAbsSyn112  happy_var_1)
-	 =  HappyAbsSyn110
+	(HappyAbsSyn115  happy_var_1)
+	 =  HappyAbsSyn113
 		 (Named { name = happy_var_1, value = happy_var_3 }
 	)
-happyReduction_323 _ _ _  = notHappyAtAll 
+happyReduction_327 _ _ _  = notHappyAtAll 
 
-happyReduce_324 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_324 = happySpecReduce_1  105 happyReduction_324
-happyReduction_324 (HappyAbsSyn110  happy_var_1)
-	 =  HappyAbsSyn111
+happyReduce_328 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_328 = happySpecReduce_1  108 happyReduction_328
+happyReduction_328 (HappyAbsSyn113  happy_var_1)
+	 =  HappyAbsSyn114
 		 ([happy_var_1]
 	)
-happyReduction_324 _  = notHappyAtAll 
+happyReduction_328 _  = notHappyAtAll 
 
-happyReduce_325 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_325 = happySpecReduce_3  105 happyReduction_325
-happyReduction_325 (HappyAbsSyn110  happy_var_3)
+happyReduce_329 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
+happyReduce_329 = happySpecReduce_3  108 happyReduction_329
+happyReduction_329 (HappyAbsSyn113  happy_var_3)
 	_
-	(HappyAbsSyn111  happy_var_1)
-	 =  HappyAbsSyn111
+	(HappyAbsSyn114  happy_var_1)
+	 =  HappyAbsSyn114
 		 (happy_var_3 : happy_var_1
 	)
-happyReduction_325 _ _ _  = notHappyAtAll 
+happyReduction_329 _ _ _  = notHappyAtAll 
 
 happyNewToken action sts stk
 	= lexerP(\tk -> 
@@ -3432,7 +3474,7 @@ happyNewToken action sts stk
 	Located happy_dollar_dollar (Token (KW KW_primitive) _) -> cont 30;
 	Located happy_dollar_dollar (Token (KW KW_constraint) _) -> cont 31;
 	Located happy_dollar_dollar (Token (KW KW_Prop) _) -> cont 32;
-	Located happy_dollar_dollar (Token (KW KW_propguards)) -> cont 33;
+	Located happy_dollar_dollar (Token (KW KW_propguards) _) -> cont 33;
 	Located happy_dollar_dollar (Token (Sym BracketL) _) -> cont 34;
 	Located happy_dollar_dollar (Token (Sym BracketR) _) -> cont 35;
 	Located happy_dollar_dollar (Token (Sym ArrL    ) _) -> cont 36;
@@ -3505,31 +3547,31 @@ programLayout = happySomeParser where
  happySomeParser = happyThen (happyParse 2) (\x -> case x of {HappyAbsSyn24 z -> happyReturn z; _other -> notHappyAtAll })
 
 expr = happySomeParser where
- happySomeParser = happyThen (happyParse 3) (\x -> case x of {HappyAbsSyn59 z -> happyReturn z; _other -> notHappyAtAll })
+ happySomeParser = happyThen (happyParse 3) (\x -> case x of {HappyAbsSyn62 z -> happyReturn z; _other -> notHappyAtAll })
 
 decl = happySomeParser where
- happySomeParser = happyThen (happyParse 4) (\x -> case x of {HappyAbsSyn38 z -> happyReturn z; _other -> notHappyAtAll })
+ happySomeParser = happyThen (happyParse 4) (\x -> case x of {HappyAbsSyn41 z -> happyReturn z; _other -> notHappyAtAll })
 
 decls = happySomeParser where
- happySomeParser = happyThen (happyParse 5) (\x -> case x of {HappyAbsSyn39 z -> happyReturn z; _other -> notHappyAtAll })
+ happySomeParser = happyThen (happyParse 5) (\x -> case x of {HappyAbsSyn42 z -> happyReturn z; _other -> notHappyAtAll })
 
 declsLayout = happySomeParser where
- happySomeParser = happyThen (happyParse 6) (\x -> case x of {HappyAbsSyn39 z -> happyReturn z; _other -> notHappyAtAll })
+ happySomeParser = happyThen (happyParse 6) (\x -> case x of {HappyAbsSyn42 z -> happyReturn z; _other -> notHappyAtAll })
 
 letDecl = happySomeParser where
- happySomeParser = happyThen (happyParse 7) (\x -> case x of {HappyAbsSyn38 z -> happyReturn z; _other -> notHappyAtAll })
+ happySomeParser = happyThen (happyParse 7) (\x -> case x of {HappyAbsSyn41 z -> happyReturn z; _other -> notHappyAtAll })
 
 repl = happySomeParser where
- happySomeParser = happyThen (happyParse 8) (\x -> case x of {HappyAbsSyn53 z -> happyReturn z; _other -> notHappyAtAll })
+ happySomeParser = happyThen (happyParse 8) (\x -> case x of {HappyAbsSyn56 z -> happyReturn z; _other -> notHappyAtAll })
 
 schema = happySomeParser where
- happySomeParser = happyThen (happyParse 9) (\x -> case x of {HappyAbsSyn94 z -> happyReturn z; _other -> notHappyAtAll })
+ happySomeParser = happyThen (happyParse 9) (\x -> case x of {HappyAbsSyn97 z -> happyReturn z; _other -> notHappyAtAll })
 
 modName = happySomeParser where
- happySomeParser = happyThen (happyParse 10) (\x -> case x of {HappyAbsSyn114 z -> happyReturn z; _other -> notHappyAtAll })
+ happySomeParser = happyThen (happyParse 10) (\x -> case x of {HappyAbsSyn117 z -> happyReturn z; _other -> notHappyAtAll })
 
 helpName = happySomeParser where
- happySomeParser = happyThen (happyParse 11) (\x -> case x of {HappyAbsSyn116 z -> happyReturn z; _other -> notHappyAtAll })
+ happySomeParser = happyThen (happyParse 11) (\x -> case x of {HappyAbsSyn119 z -> happyReturn z; _other -> notHappyAtAll })
 
 happySeq = happyDontSeq
 
diff --git a/src/Cryptol/Parser.y b/src/Cryptol/Parser.y
index bae21027f..d2683e709 100644
--- a/src/Cryptol/Parser.y
+++ b/src/Cryptol/Parser.y
@@ -301,23 +301,20 @@ mbDoc                   :: { Maybe (Located Text) }
   | {- empty -}            { Nothing }
 
 propguards :: { [([Prop PName], Expr PName)] }
-  : 'propguards' propguards_cases { $2 }
+  : 'propguards' '|' propguards_cases { $3 }
 
 propguards_cases :: { [([Prop PName], Expr PName)] }
-  -- : propguards_case '|' propguards_cases { $1 ++ $3 }
-  -- | propguards_case { $1 }
-  : '|' propguards_case { $2 }
-  
+  : propguards_case '|' propguards_cases { $1 ++ $3 }
+  | propguards_case { $1 }
+
 propguards_case :: { [([Prop PName], Expr PName)] }
   : propguards_quals '=>' expr { [($1, $3)] }
 
--- support multiple
+-- TODO: support multiple, or is that handles just as pairs or something?
+-- I think that mkProp handles parsing pairs
 propguards_quals :: { [Prop PName] }
-  -- : type { [_ $1] }
   : type {% fmap thing (mkProp $1) }
 
--- propguards_qual : { [Prop PName] } -- TODO
-
 decl                    :: { Decl PName }
   : vars_comma ':' schema  { at (head $1,$3) $ DSignature (reverse $1) $3   }
   | ipat '=' expr          { at ($1,$3) $ DPatBind $1 $3                    }
diff --git a/src/Cryptol/Parser/AST.hs b/src/Cryptol/Parser/AST.hs
index 2af6a56d5..ecb977d24 100644
--- a/src/Cryptol/Parser/AST.hs
+++ b/src/Cryptol/Parser/AST.hs
@@ -16,6 +16,7 @@
 {-# LANGUAGE PatternGuards #-}
 {-# LANGUAGE RecordWildCards #-}
 {-# LANGUAGE OverloadedStrings #-}
+{-# LANGUAGE FlexibleInstances #-}
 module Cryptol.Parser.AST
   ( -- * Names
     Ident, mkIdent, mkInfix, isInfixIdent, nullIdent, identText
@@ -974,6 +975,8 @@ instance PPName name => PP (Type name) where
 instance PPName name => PP (Prop name) where
   ppPrec n (CType t) = ppPrec n t
 
+instance PPName name => PP [Prop name] where
+  ppPrec n props = parens . commaSep . fmap (ppPrec n) $ props
 
 --------------------------------------------------------------------------------
 -- Drop all position information, so equality reflects program structure

From b4b956b00dbcaa7fdebe628e9334a2d1bba372cc Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Thu, 7 Jul 2022 15:48:22 -0700
Subject: [PATCH 011/125] no more ExpandPropGuards Name Pass

---
 src/Cryptol/Parser/Name.hs | 6 ++++--
 1 file changed, 4 insertions(+), 2 deletions(-)

diff --git a/src/Cryptol/Parser/Name.hs b/src/Cryptol/Parser/Name.hs
index 3c322dca0..8d4bf706d 100644
--- a/src/Cryptol/Parser/Name.hs
+++ b/src/Cryptol/Parser/Name.hs
@@ -33,6 +33,7 @@ data PName = UnQual !Ident
 -- | Passes that can generate fresh names.
 data Pass = NoPat
           | MonoValues
+          | ExpandPropGuards String
             deriving (Eq,Ord,Show,Generic)
 
 instance NFData PName
@@ -54,8 +55,9 @@ getIdent (Qual _ n)    = n
 getIdent (NewName p i) = packIdent ("__" ++ pass ++ show i)
   where
   pass = case p of
-           NoPat      -> "p"
-           MonoValues -> "mv"
+           NoPat              -> "p"
+           MonoValues         -> "mv"
+           ExpandPropGuards _ -> "epg"
 
 isGeneratedName :: PName -> Bool
 isGeneratedName x =

From 568ab61b5ecda7ee1defbcb1adc0bcf9ac5117bc Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Thu, 7 Jul 2022 15:48:58 -0700
Subject: [PATCH 012/125] ExpandPropGuards pass

---
 src/Cryptol/Parser/ExpandPropGuards.hs | 72 +++++++++++++++++++-------
 1 file changed, 53 insertions(+), 19 deletions(-)

diff --git a/src/Cryptol/Parser/ExpandPropGuards.hs b/src/Cryptol/Parser/ExpandPropGuards.hs
index 84fef4c8d..5eef8ae35 100644
--- a/src/Cryptol/Parser/ExpandPropGuards.hs
+++ b/src/Cryptol/Parser/ExpandPropGuards.hs
@@ -19,16 +19,14 @@
 module Cryptol.Parser.ExpandPropGuards where
 
 import Cryptol.Parser.AST
-import Cryptol.Parser.Position (Range(..), emptyRange, start, at)
-import Cryptol.Parser.Names (namesP)
+-- import Cryptol.Parser.Position (Range(..), emptyRange, start, at)
+-- import Cryptol.Parser.Names (namesP)
 import Cryptol.Utils.PP
+-- import Cryptol.Utils.Ident (mkIdent)
 import Cryptol.Utils.Panic (panic)
-import Cryptol.Utils.RecordMap
+-- import Cryptol.Utils.RecordMap
 
-import           MonadLib hiding (mapM)
-import           Data.Maybe (maybeToList)
-import qualified Data.Map as Map
-import           Data.Text (Text)
+import           Data.Text (pack)
 
 import GHC.Generics (Generic)
 import Control.DeepSeq
@@ -49,19 +47,27 @@ data Error = NoSignature (Located PName)
   deriving (Show,Generic, NFData)
 
 instance PP Error where
-  ppPrec = undefined -- TODO
+  ppPrec _ err = case err of
+    NoSignature x -> 
+      text "At" <+> pp (srcRange x) <.> colon <+>
+      text "No signature provided for declaration that uses PROPGUARDS."
 
 -- | Instances
 
 instance ExpandPropGuards (Program PName) where
   expandPropGuards (Program decls) = Program <$> expandPropGuards decls
 
+instance ExpandPropGuards (Module PName) where
+  expandPropGuards m = do
+    mDecls' <- expandPropGuards (mDecls m)
+    pure m { mDecls = mDecls' }
+
 instance ExpandPropGuards [TopDecl PName] where
   expandPropGuards topDecls = concat <$> traverse f topDecls 
     where 
       f :: TopDecl PName -> ExpandPropGuardsM [TopDecl PName]
-      f (Decl topLevelDecl) = fmap lift <$> expandPropGuards [tlValue topLevelDecl]
-        where lift decl = Decl $ topLevelDecl { tlValue = decl }
+      f (Decl topLevelDecl) = fmap mu <$> expandPropGuards [tlValue topLevelDecl]
+        where mu decl = Decl $ topLevelDecl { tlValue = decl }
       f topDecl = pure [topDecl]
 
 instance ExpandPropGuards [Decl PName] where 
@@ -80,13 +86,41 @@ instance ExpandPropGuards [Bind PName] where
               Just schema -> pure schema 
               Nothing -> Left . NoSignature $ bName bind
           let
-            g :: ([Prop PName], Expr PName) -> ExpandPropGuardsM (Bind PName)
-            g (props', e) = pure bind
-              { -- include guarded props in signature
-                bSignature = Just $ Forall params (props <> props') t rng
-                -- keeps same location at original bind 
-                -- i.e. "on top of" original bind
-              , bDef = (bDef bind) {thing = DExpr e}
-              }
-          mapM g guards
+            g :: ([Prop PName], Expr PName) -> ExpandPropGuardsM (([Prop PName], Expr PName), Bind PName)
+            g (props', e) = do
+              bName' <- newName (bName bind) props'
+              -- call to generated function
+              let e' = foldr EApp (EVar $ thing bName') (patternToExpr <$> bParams bind)
+              pure 
+                ( (props', e') 
+                , bind
+                    { bName = bName'
+                      -- include guarded props in signature
+                    , bSignature = Just $ Forall params (props <> props') t rng
+                      -- keeps same location at original bind 
+                      -- i.e. "on top of" original bind
+                    , bDef = (bDef bind) {thing = DExpr e}
+                    }
+                )
+          (guards', binds') <- unzip <$> mapM g guards
+          pure $ 
+            bind { bDef = const (DPropGuards guards') <$> bDef bind } :
+            binds'
         _ -> pure [bind]
+
+patternToExpr :: Pattern PName -> Expr PName
+patternToExpr (PVar locName) = EVar (thing locName)
+patternToExpr _ = panic "patternToExpr" ["Unimplemented: patternToExpr of anything other than PVar"]
+
+newName :: Located PName -> [Prop PName] -> ExpandPropGuardsM (Located PName)
+newName locName props =
+  case thing locName of 
+    Qual modName ident -> do
+      let txt  = identText ident
+          txt' = pack $ renderOneLine $ pp props
+      pure $ const (Qual modName (mkIdent $ txt <> txt')) <$> locName
+    UnQual ident -> do
+      let txt  = identText ident
+          txt' = pack $ renderOneLine $ pp props
+      pure $ const (UnQual (mkIdent $ txt <> txt')) <$> locName 
+    NewName _ _ -> panic "mkName" ["During expanding prop guards, tried to make new name from NewName case of PName"]

From 9b613273ad7720d0ee1d55d3b16068d2b5f16c80 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Thu, 7 Jul 2022 15:49:08 -0700
Subject: [PATCH 013/125] do ExpandPropGuards pass

---
 src/Cryptol/ModuleSystem/Base.hs | 5 ++++-
 1 file changed, 4 insertions(+), 1 deletion(-)

diff --git a/src/Cryptol/ModuleSystem/Base.hs b/src/Cryptol/ModuleSystem/Base.hs
index 6221f7304..580548778 100644
--- a/src/Cryptol/ModuleSystem/Base.hs
+++ b/src/Cryptol/ModuleSystem/Base.hs
@@ -453,8 +453,11 @@ checkSingleModule how isrc m = do
   -- remove pattern bindings
   npm <- noPat m
 
+  -- run expandPropGuards
+  epgm <- expandPropGuards npm
+
   -- rename everything
-  renMod <- renameModule npm
+  renMod <- renameModule epgm
 
   -- when generating the prim map for the typechecker, if we're checking the
   -- prelude, we have to generate the map from the renaming environment, as we

From 3c1f25baf7dddc87e7a33ef03d2c0b84a909aa48 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Thu, 7 Jul 2022 15:49:40 -0700
Subject: [PATCH 014/125] typechecking for PropGuards; factored out
 checkBindDefExpr

---
 src/Cryptol/TypeCheck/Infer.hs | 178 +++++++++++++++++----------------
 src/Cryptol/TypeCheck/Kind.hs  |   7 +-
 2 files changed, 97 insertions(+), 88 deletions(-)

diff --git a/src/Cryptol/TypeCheck/Infer.hs b/src/Cryptol/TypeCheck/Infer.hs
index 98e1cf76c..671fca38f 100644
--- a/src/Cryptol/TypeCheck/Infer.hs
+++ b/src/Cryptol/TypeCheck/Infer.hs
@@ -976,97 +976,107 @@ checkMonoB b t =
 
 -- XXX: Do we really need to do the defaulting business in two different places?
 checkSigB :: P.Bind Name -> (Schema,[Goal]) -> InferM Decl
-checkSigB b (Forall as asmps0 t0, validSchema) = case thing (P.bDef b) of
-
- -- XXX what should we do with validSchema in this case?
- P.DPrim ->
-   do return Decl { dName       = thing (P.bName b)
-                  , dSignature  = Forall as asmps0 t0
-                  , dDefinition = DPrim
-                  , dPragmas    = P.bPragmas b
-                  , dInfix      = P.bInfix b
-                  , dFixity     = P.bFixity b
-                  , dDoc        = P.bDoc b
-                  }
-
- P.DExpr e0 ->
-  inRangeMb (getLoc b) $
-  withTParams as $
-  do (e1,cs0) <- collectGoals $
-                do let nm = thing (P.bName b)
-                       tGoal = WithSource t0 (DefinitionOf nm) (getLoc b)
-                   e1 <- checkFun (P.FunDesc (Just nm) 0) (P.bParams b) e0 tGoal
-                   addGoals validSchema
-                   () <- simplifyAllConstraints  -- XXX: using `asmps` also?
-                   return e1
-
-     asmps1 <- applySubstPreds asmps0
-     cs     <- applySubstGoals cs0
-
-     let findKeep vs keep todo =
-          let stays (_,cvs)    = not $ Set.null $ Set.intersection vs cvs
-              (yes,perhaps)    = partition stays todo
-              (stayPs,newVars) = unzip yes
-          in case stayPs of
-               [] -> (keep,map fst todo)
-               _  -> findKeep (Set.unions (vs:newVars)) (stayPs ++ keep) perhaps
-
-     let -- if a goal mentions any of these variables, we'll commit to
-         -- solving it now.
-         stickyVars = Set.fromList (map tpVar as) `Set.union` fvs asmps1
-         (stay,leave) = findKeep stickyVars []
-                            [ (c, fvs c) | c <- cs ]
-
-     addGoals leave
-
-
-     su <- proveImplication (Just (thing (P.bName b))) as asmps1 stay
-     extendSubst su
-
-     let asmps  = concatMap pSplitAnd (apSubst su asmps1)
-     t      <- applySubst t0
-     e2     <- applySubst e1
-
-     return Decl
+checkSigB b (Forall as asmps0 t0, validSchema) = 
+  let checkBindDefExpr :: [Prop] -> P.Expr Name -> InferM (Type, [Prop], Expr)
+      checkBindDefExpr asmps1 e0 = do
+        
+        (e1,cs0) <- collectGoals $ do
+          let nm = thing (P.bName b)
+              tGoal = WithSource t0 (DefinitionOf nm) (getLoc b)
+          e1 <- checkFun (P.FunDesc (Just nm) 0) (P.bParams b) e0 tGoal
+          addGoals validSchema
+          () <- simplifyAllConstraints  -- XXX: using `asmps` also?
+          return e1
+
+        asmps2 <- applySubstPreds asmps1
+        cs     <- applySubstGoals cs0
+
+        let findKeep vs keep todo =
+              let stays (_,cvs)    = not $ Set.null $ Set.intersection vs cvs
+                  (yes,perhaps)    = partition stays todo
+                  (stayPs,newVars) = unzip yes
+              in case stayPs of
+                  [] -> (keep,map fst todo)
+                  _  -> findKeep (Set.unions (vs:newVars)) (stayPs ++ keep) perhaps
+
+        let -- if a goal mentions any of these variables, we'll commit to
+            -- solving it now.
+            stickyVars = Set.fromList (map tpVar as) `Set.union` fvs asmps2
+            (stay,leave) = findKeep stickyVars []
+                                [ (c, fvs c) | c <- cs ]
+
+        addGoals leave
+
+
+        su <- proveImplication (Just (thing (P.bName b))) as asmps2 stay
+        extendSubst su
+
+        let asmps  = concatMap pSplitAnd (apSubst su asmps2)
+        t      <- applySubst t0
+        e2     <- applySubst e1
+
+        pure (t, asmps, e2)
+  
+  in case thing (P.bDef b) of
+
+    -- XXX what should we do with validSchema in this case?
+    P.DPrim -> do
+      return Decl 
         { dName       = thing (P.bName b)
-        , dSignature  = Forall as asmps t
-        , dDefinition = DExpr (foldr ETAbs (foldr EProofAbs e2 asmps) as)
+        , dSignature  = Forall as asmps0 t0
+        , dDefinition = DPrim
         , dPragmas    = P.bPragmas b
         , dInfix      = P.bInfix b
         , dFixity     = P.bFixity b
         , dDoc        = P.bDoc b
         }
 
- P.DPropGuards propGuards -> 
-  inRangeMb (getLoc b) $
-  withTParams as $ do
-    asmps1 <- applySubstPreds asmps0
-    t      <- applySubst t0
-    -- handle cases
-    let f :: ([P.Prop Name], P.Expr Name) -> InferM ([Prop], Expr)
-        f (ps0, e0) = do
-            -- validate props
-            (ps1, gss) <- unzip <$> mapM checkPropGuard ps0
-            let gs = concat gss
-                ps2 = asmps1 <> (goal <$> gs) <> ps1
-            -- typecheck expr
-            let tGoal = WithSource t0 (DefinitionOf nm) (getLoc b)
-                nm = thing $ P.bName b
-            e1 <- checkFun (P.FunDesc (Just nm) 0) (P.bParams b) e0 tGoal
-            e2 <- applySubst e1
-            pure (ps2, e2)
-            -- undefined :: InferM ([Prop], Expr)
-    cases <- mapM f propGuards
-   
-    return Decl
-      { dName       = thing (P.bName b)
-      , dSignature  = Forall as asmps1 t
-      , dDefinition = DExpr (EPropGuards cases)
-      , dPragmas    = P.bPragmas b
-      , dInfix      = P.bInfix b
-      , dFixity     = P.bFixity b
-      , dDoc        = P.bDoc b
-      }
+    P.DExpr e0 ->
+      inRangeMb (getLoc b) $
+      withTParams as $ do
+        (t, asmps, e2) <- checkBindDefExpr asmps0 e0
+
+        return Decl
+          { dName       = thing (P.bName b)
+          , dSignature  = Forall as asmps t
+          , dDefinition = DExpr (foldr ETAbs (foldr EProofAbs e2 asmps) as)
+          , dPragmas    = P.bPragmas b
+          , dInfix      = P.bInfix b
+          , dFixity     = P.bFixity b
+          , dDoc        = P.bDoc b
+          }
+
+    P.DPropGuards propGuards -> 
+      inRangeMb (getLoc b) $
+      withTParams as $ do
+        -- Checking each guarded case is the same as checking a DExpr, except 
+        -- that the guarding assumptions are added first.
+        let checkPropGuard :: ([P.Prop Name], P.Expr Name) -> InferM ([Prop], Expr)
+            checkPropGuard (asmpsGuard0, e0) = do
+              asmps0' <- do
+                -- validate props
+                (asmpsGuard1', goalss) <- unzip <$> mapM checkPropGuard asmpsGuard0
+                let asmpsGoals = goal <$> concat goalss
+                    asmpsGuard2 = asmpsGoals <> asmpsGuard1'
+                pure $ asmps0 <> asmpsGuard2
+
+              (_t', props', e') <- checkBindDefExpr asmps0' e0
+              pure (props', e')
+
+        cases <- mapM checkPropGuard propGuards
+
+        asmps1 <- applySubstPreds asmps0
+        t      <- applySubst t0
+        
+        return Decl
+          { dName       = thing (P.bName b)
+          , dSignature  = Forall as asmps1 t
+          , dDefinition = DExpr (EPropGuards cases)
+          , dPragmas    = P.bPragmas b
+          , dInfix      = P.bInfix b
+          , dFixity     = P.bFixity b
+          , dDoc        = P.bDoc b
+          }
 
 --------------------------------------------------------------------------------
 --------------------------------------------------------------------------------
diff --git a/src/Cryptol/TypeCheck/Kind.hs b/src/Cryptol/TypeCheck/Kind.hs
index 75d268dcd..b896e1ff0 100644
--- a/src/Cryptol/TypeCheck/Kind.hs
+++ b/src/Cryptol/TypeCheck/Kind.hs
@@ -417,7 +417,6 @@ checkKind t _ _ = return t
 checkPropGuard :: P.Prop Name -> InferM (Prop, [Goal])
 checkPropGuard p =
   collectGoals $
-  undefined
-  -- withTParams _ _ _ 
-  -- (undefined :: KindM Type -> InferM Type) $ -- TODO
-  -- checkProp p
+  fmap (\(t, _, _) -> t) $
+  runKindM NoWildCards [] $
+  checkProp p

From d1d903d6070b99411e3b562aa1515f76f60d25d9 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Thu, 7 Jul 2022 15:57:48 -0700
Subject: [PATCH 015/125] fixed shadowing of checkPropGuard

---
 src/Cryptol/TypeCheck/Infer.hs | 10 +++++-----
 1 file changed, 5 insertions(+), 5 deletions(-)

diff --git a/src/Cryptol/TypeCheck/Infer.hs b/src/Cryptol/TypeCheck/Infer.hs
index 671fca38f..1587ff17d 100644
--- a/src/Cryptol/TypeCheck/Infer.hs
+++ b/src/Cryptol/TypeCheck/Infer.hs
@@ -1046,13 +1046,13 @@ checkSigB b (Forall as asmps0 t0, validSchema) =
           , dDoc        = P.bDoc b
           }
 
-    P.DPropGuards propGuards -> 
+    P.DPropGuards cases0 -> 
       inRangeMb (getLoc b) $
       withTParams as $ do
         -- Checking each guarded case is the same as checking a DExpr, except 
         -- that the guarding assumptions are added first.
-        let checkPropGuard :: ([P.Prop Name], P.Expr Name) -> InferM ([Prop], Expr)
-            checkPropGuard (asmpsGuard0, e0) = do
+        let checkPropGuardCase :: ([P.Prop Name], P.Expr Name) -> InferM ([Prop], Expr)
+            checkPropGuardCase (asmpsGuard0, e0) = do
               asmps0' <- do
                 -- validate props
                 (asmpsGuard1', goalss) <- unzip <$> mapM checkPropGuard asmpsGuard0
@@ -1063,7 +1063,7 @@ checkSigB b (Forall as asmps0 t0, validSchema) =
               (_t', props', e') <- checkBindDefExpr asmps0' e0
               pure (props', e')
 
-        cases <- mapM checkPropGuard propGuards
+        cases1 <- mapM checkPropGuardCase cases0
 
         asmps1 <- applySubstPreds asmps0
         t      <- applySubst t0
@@ -1071,7 +1071,7 @@ checkSigB b (Forall as asmps0 t0, validSchema) =
         return Decl
           { dName       = thing (P.bName b)
           , dSignature  = Forall as asmps1 t
-          , dDefinition = DExpr (EPropGuards cases)
+          , dDefinition = DExpr (EPropGuards cases1)
           , dPragmas    = P.bPragmas b
           , dInfix      = P.bInfix b
           , dFixity     = P.bFixity b

From 1bdde418f4cd0a68c12dcbf0940dffae443f7131 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Thu, 7 Jul 2022 16:25:05 -0700
Subject: [PATCH 016/125] make things Safe

---
 src/Cryptol/ModuleSystem/Exports.hs              | 1 +
 src/Cryptol/ModuleSystem/Interface.hs            | 1 +
 src/Cryptol/Parser/Name.hs                       | 1 +
 src/Cryptol/Parser/Names.hs                      | 2 ++
 src/Cryptol/Parser/Token.hs                      | 1 +
 src/Cryptol/Parser/Utils.hs                      | 1 +
 src/Cryptol/TypeCheck/Default.hs                 | 2 ++
 src/Cryptol/TypeCheck/Interface.hs               | 2 ++
 src/Cryptol/TypeCheck/SimpType.hs                | 1 +
 src/Cryptol/TypeCheck/Solver/Improve.hs          | 2 ++
 src/Cryptol/TypeCheck/Solver/Numeric/Interval.hs | 1 +
 src/Cryptol/TypeCheck/Solver/Types.hs            | 1 +
 src/Cryptol/TypeCheck/TypePat.hs                 | 1 +
 src/Cryptol/Utils/Ident.hs                       | 1 +
 src/Cryptol/Utils/RecordMap.hs                   | 1 +
 src/Cryptol/Version.hs                           | 2 +-
 16 files changed, 20 insertions(+), 1 deletion(-)

diff --git a/src/Cryptol/ModuleSystem/Exports.hs b/src/Cryptol/ModuleSystem/Exports.hs
index a85d478a4..d6a251232 100644
--- a/src/Cryptol/ModuleSystem/Exports.hs
+++ b/src/Cryptol/ModuleSystem/Exports.hs
@@ -1,4 +1,5 @@
 {-# LANGUAGE DeriveGeneric #-}
+{-# LANGUAGE Safe #-}
 module Cryptol.ModuleSystem.Exports where
 
 import Data.Set(Set)
diff --git a/src/Cryptol/ModuleSystem/Interface.hs b/src/Cryptol/ModuleSystem/Interface.hs
index 88f53a30f..b49ba62ba 100644
--- a/src/Cryptol/ModuleSystem/Interface.hs
+++ b/src/Cryptol/ModuleSystem/Interface.hs
@@ -11,6 +11,7 @@
 {-# LANGUAGE DeriveGeneric #-}
 {-# LANGUAGE PatternGuards #-}
 {-# LANGUAGE RecordWildCards #-}
+{-# LANGUAGE Safe #-}
 module Cryptol.ModuleSystem.Interface (
     Iface
   , IfaceG(..)
diff --git a/src/Cryptol/Parser/Name.hs b/src/Cryptol/Parser/Name.hs
index 8d4bf706d..dc74f3a54 100644
--- a/src/Cryptol/Parser/Name.hs
+++ b/src/Cryptol/Parser/Name.hs
@@ -7,6 +7,7 @@
 -- Portability :  portable
 
 {-# LANGUAGE DeriveGeneric #-}
+{-# LANGUAGE Safe #-}
 
 module Cryptol.Parser.Name where
 
diff --git a/src/Cryptol/Parser/Names.hs b/src/Cryptol/Parser/Names.hs
index 43bb898dc..d488497dc 100644
--- a/src/Cryptol/Parser/Names.hs
+++ b/src/Cryptol/Parser/Names.hs
@@ -9,6 +9,8 @@
 -- This module defines the scoping rules for value- and type-level
 -- names in Cryptol.
 
+{-# LANGUAGE Safe #-}
+
 module Cryptol.Parser.Names
   ( tnamesNT
   , tnamesT
diff --git a/src/Cryptol/Parser/Token.hs b/src/Cryptol/Parser/Token.hs
index fb1506f5b..feac45d20 100644
--- a/src/Cryptol/Parser/Token.hs
+++ b/src/Cryptol/Parser/Token.hs
@@ -1,5 +1,6 @@
 {-# LANGUAGE DeriveAnyClass #-}
 {-# LANGUAGE DeriveGeneric #-}
+{-# LANGUAGE Safe #-}
 module Cryptol.Parser.Token where
 
 import Data.Text(Text)
diff --git a/src/Cryptol/Parser/Utils.hs b/src/Cryptol/Parser/Utils.hs
index 5acb2d81c..1ac0444b2 100644
--- a/src/Cryptol/Parser/Utils.hs
+++ b/src/Cryptol/Parser/Utils.hs
@@ -10,6 +10,7 @@
 -- from previous Cryptol versions.
 
 {-# LANGUAGE OverloadedStrings #-}
+{-# LANGUAGE Safe #-}
 
 module Cryptol.Parser.Utils
   ( translateExprToNumT
diff --git a/src/Cryptol/TypeCheck/Default.hs b/src/Cryptol/TypeCheck/Default.hs
index 30eade366..11c973889 100644
--- a/src/Cryptol/TypeCheck/Default.hs
+++ b/src/Cryptol/TypeCheck/Default.hs
@@ -1,3 +1,5 @@
+{-# LANGUAGE Safe #-}
+
 module Cryptol.TypeCheck.Default where
 
 import qualified Data.Set as Set
diff --git a/src/Cryptol/TypeCheck/Interface.hs b/src/Cryptol/TypeCheck/Interface.hs
index 372e936fa..f784580c1 100644
--- a/src/Cryptol/TypeCheck/Interface.hs
+++ b/src/Cryptol/TypeCheck/Interface.hs
@@ -1,3 +1,5 @@
+{-# LANGUAGE Safe #-}
+
 module Cryptol.TypeCheck.Interface where
 
 import qualified Data.Map as Map
diff --git a/src/Cryptol/TypeCheck/SimpType.hs b/src/Cryptol/TypeCheck/SimpType.hs
index cea736fb5..9fcf0796c 100644
--- a/src/Cryptol/TypeCheck/SimpType.hs
+++ b/src/Cryptol/TypeCheck/SimpType.hs
@@ -1,4 +1,5 @@
 {-# LANGUAGE PatternGuards #-}
+{-# LANGUAGE Safe #-}
 -- See Note [-Wincomplete-uni-patterns and irrefutable patterns] in Cryptol.TypeCheck.TypePat
 {-# OPTIONS_GHC -Wno-incomplete-uni-patterns #-}
 module Cryptol.TypeCheck.SimpType where
diff --git a/src/Cryptol/TypeCheck/Solver/Improve.hs b/src/Cryptol/TypeCheck/Solver/Improve.hs
index df12b900e..877497321 100644
--- a/src/Cryptol/TypeCheck/Solver/Improve.hs
+++ b/src/Cryptol/TypeCheck/Solver/Improve.hs
@@ -1,3 +1,5 @@
+{-# LANGUAGE Safe #-}
+
 -- | Look for opportunity to solve goals by instantiating variables.
 module Cryptol.TypeCheck.Solver.Improve where
 
diff --git a/src/Cryptol/TypeCheck/Solver/Numeric/Interval.hs b/src/Cryptol/TypeCheck/Solver/Numeric/Interval.hs
index b7e48d112..7c5553f9f 100644
--- a/src/Cryptol/TypeCheck/Solver/Numeric/Interval.hs
+++ b/src/Cryptol/TypeCheck/Solver/Numeric/Interval.hs
@@ -10,6 +10,7 @@
 
 {-# LANGUAGE PatternGuards #-}
 {-# LANGUAGE BangPatterns #-}
+{-# LANGUAGE Safe #-}
 
 module Cryptol.TypeCheck.Solver.Numeric.Interval where
 
diff --git a/src/Cryptol/TypeCheck/Solver/Types.hs b/src/Cryptol/TypeCheck/Solver/Types.hs
index 235488253..1fdf4d8b9 100644
--- a/src/Cryptol/TypeCheck/Solver/Types.hs
+++ b/src/Cryptol/TypeCheck/Solver/Types.hs
@@ -1,4 +1,5 @@
 {-# Language OverloadedStrings, DeriveGeneric, DeriveAnyClass #-}
+{-# LANGUAGE Safe #-}
 module Cryptol.TypeCheck.Solver.Types where
 
 import Data.Map(Map)
diff --git a/src/Cryptol/TypeCheck/TypePat.hs b/src/Cryptol/TypeCheck/TypePat.hs
index 2a474c930..53023830c 100644
--- a/src/Cryptol/TypeCheck/TypePat.hs
+++ b/src/Cryptol/TypeCheck/TypePat.hs
@@ -1,5 +1,6 @@
 -- See Note [-Wincomplete-uni-patterns and irrefutable patterns]
 {-# OPTIONS_GHC -Wno-incomplete-uni-patterns #-}
+{-# LANGUAGE Safe #-}
 module Cryptol.TypeCheck.TypePat
   ( aInf, aNat, aNat'
 
diff --git a/src/Cryptol/Utils/Ident.hs b/src/Cryptol/Utils/Ident.hs
index aff524250..ef212db70 100644
--- a/src/Cryptol/Utils/Ident.hs
+++ b/src/Cryptol/Utils/Ident.hs
@@ -8,6 +8,7 @@
 
 {-# LANGUAGE DeriveGeneric, OverloadedStrings #-}
 {-# LANGUAGE DeriveAnyClass #-}
+{-# LANGUAGE Safe #-}
 
 module Cryptol.Utils.Ident
   ( -- * Module names
diff --git a/src/Cryptol/Utils/RecordMap.hs b/src/Cryptol/Utils/RecordMap.hs
index f8599702f..2eef28af0 100644
--- a/src/Cryptol/Utils/RecordMap.hs
+++ b/src/Cryptol/Utils/RecordMap.hs
@@ -14,6 +14,7 @@
 
 {-# LANGUAGE RankNTypes #-}
 {-# LANGUAGE ScopedTypeVariables #-}
+{-# LANGUAGE Safe #-}
 
 module Cryptol.Utils.RecordMap
   ( RecordMap
diff --git a/src/Cryptol/Version.hs b/src/Cryptol/Version.hs
index 58135e217..cbd3ceece 100644
--- a/src/Cryptol/Version.hs
+++ b/src/Cryptol/Version.hs
@@ -6,7 +6,7 @@
 -- Stability   :  provisional
 -- Portability :  portable
 
-{-# LANGUAGE Safe #-}
+-- {-# LANGUAGE Safe #-}
 
 module Cryptol.Version (
     commitHash

From 6078a3f09755a36f8c38620cb382266f64bda3a7 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Thu, 7 Jul 2022 16:25:41 -0700
Subject: [PATCH 017/125] ignore .vscode

---
 .gitignore | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/.gitignore b/.gitignore
index 06b7518e8..25a837e86 100644
--- a/.gitignore
+++ b/.gitignore
@@ -38,3 +38,5 @@ allfiles.wxs
 cryptol.msi
 cryptol.wixobj
 cryptol.wixpdb
+
+.vscode/

From 6b59c65afd36d35751136cb2ba0bef1597848831 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Thu, 7 Jul 2022 16:25:58 -0700
Subject: [PATCH 018/125] organize

---
 .gitignore | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/.gitignore b/.gitignore
index 25a837e86..cd7737b8c 100644
--- a/.gitignore
+++ b/.gitignore
@@ -10,6 +10,7 @@ dist-newstyle
 .ghc.environment.*
 cabal.project.freeze
 cabal.project.local*
+.vscode/
 
 # don't check in generated documentation
 #docs/CryptolPrims.pdf
@@ -39,4 +40,3 @@ cryptol.msi
 cryptol.wixobj
 cryptol.wixpdb
 
-.vscode/

From 1f2c82c479436eb6e3b823a57a0116baedb9a6eb Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Thu, 7 Jul 2022 16:26:42 -0700
Subject: [PATCH 019/125] test: parsing

---
 tests/constraint-guards/Parsing.cry | 61 +++++++++++++++++++++++++++++
 1 file changed, 61 insertions(+)
 create mode 100644 tests/constraint-guards/Parsing.cry

diff --git a/tests/constraint-guards/Parsing.cry b/tests/constraint-guards/Parsing.cry
new file mode 100644
index 000000000..52e09193b
--- /dev/null
+++ b/tests/constraint-guards/Parsing.cry
@@ -0,0 +1,61 @@
+module Parsing where
+
+// Constraints are parsed the same as types
+
+foo : {n} [n] -> [n]
+foo x = x
+
+// f : {n} [n] -> [n]
+// f .. x = x
+
+// f : {n} [n] -> [n]
+// f .. (fin n) .. x = x
+
+// f : {n} [n] -> [n]
+// f <| (fin n, n == 1) => |> x = x
+
+// f : {n} fin n
+// f = undefined
+
+// f : {n} ([n], [n], [n])
+// f = undefined
+
+// f : {n} (n == 1) => [n] -> [n]
+// f x = x
+
+// f : {n} fin n => fin n => [1] -> [1]
+// f x = x
+
+// Tests
+
+// f : {n} [n] -> [n]
+// f <| (n == 1) => |> x = x
+
+// f : {n} [n] -> [n]
+// f x = x
+
+// g : {n} (fin n) => [n] -> [n]
+// g <| (n == 0) |> _ = []
+
+// g' : {n} [n] -> [n]
+// g' <| (n == 1) |> x = x
+
+f : {n} [n] -> [n]
+f x = propguards
+  | n == 1 => g1 x // passes
+  | n == 2 => g2 x // passes
+  | n == 3 => g3 x // passes
+  // | n == n => g4 x // fails
+
+g1 : {n} (n == 1) => [n] -> [n]
+g1 x = x
+
+g2 : {n} (n == 2) => [n] -> [n]
+g2 x = x
+
+g3 : {n} (n == 3) => [n] -> [n]
+g3 x = x
+
+g4 : {n} (n == 4) => [n] -> [n]
+g4 x = x
+

From 5ae355efe3107a9cf20a335d9824a7ebaa78090e Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Thu, 7 Jul 2022 16:45:57 -0700
Subject: [PATCH 020/125] formatting

---
 src/Cryptol/TypeCheck/Infer.hs | 84 +++++++++++++++++-----------------
 1 file changed, 43 insertions(+), 41 deletions(-)

diff --git a/src/Cryptol/TypeCheck/Infer.hs b/src/Cryptol/TypeCheck/Infer.hs
index 1587ff17d..65ea5ff9a 100644
--- a/src/Cryptol/TypeCheck/Infer.hs
+++ b/src/Cryptol/TypeCheck/Infer.hs
@@ -977,47 +977,7 @@ checkMonoB b t =
 -- XXX: Do we really need to do the defaulting business in two different places?
 checkSigB :: P.Bind Name -> (Schema,[Goal]) -> InferM Decl
 checkSigB b (Forall as asmps0 t0, validSchema) = 
-  let checkBindDefExpr :: [Prop] -> P.Expr Name -> InferM (Type, [Prop], Expr)
-      checkBindDefExpr asmps1 e0 = do
-        
-        (e1,cs0) <- collectGoals $ do
-          let nm = thing (P.bName b)
-              tGoal = WithSource t0 (DefinitionOf nm) (getLoc b)
-          e1 <- checkFun (P.FunDesc (Just nm) 0) (P.bParams b) e0 tGoal
-          addGoals validSchema
-          () <- simplifyAllConstraints  -- XXX: using `asmps` also?
-          return e1
-
-        asmps2 <- applySubstPreds asmps1
-        cs     <- applySubstGoals cs0
-
-        let findKeep vs keep todo =
-              let stays (_,cvs)    = not $ Set.null $ Set.intersection vs cvs
-                  (yes,perhaps)    = partition stays todo
-                  (stayPs,newVars) = unzip yes
-              in case stayPs of
-                  [] -> (keep,map fst todo)
-                  _  -> findKeep (Set.unions (vs:newVars)) (stayPs ++ keep) perhaps
-
-        let -- if a goal mentions any of these variables, we'll commit to
-            -- solving it now.
-            stickyVars = Set.fromList (map tpVar as) `Set.union` fvs asmps2
-            (stay,leave) = findKeep stickyVars []
-                                [ (c, fvs c) | c <- cs ]
-
-        addGoals leave
-
-
-        su <- proveImplication (Just (thing (P.bName b))) as asmps2 stay
-        extendSubst su
-
-        let asmps  = concatMap pSplitAnd (apSubst su asmps2)
-        t      <- applySubst t0
-        e2     <- applySubst e1
-
-        pure (t, asmps, e2)
-  
-  in case thing (P.bDef b) of
+  case thing (P.bDef b) of
 
     -- XXX what should we do with validSchema in this case?
     P.DPrim -> do
@@ -1077,6 +1037,48 @@ checkSigB b (Forall as asmps0 t0, validSchema) =
           , dFixity     = P.bFixity b
           , dDoc        = P.bDoc b
           }
+  
+  where
+
+    checkBindDefExpr :: [Prop] -> P.Expr Name -> InferM (Type, [Prop], Expr)
+    checkBindDefExpr asmps1 e0 = do
+      
+      (e1,cs0) <- collectGoals $ do
+        let nm = thing (P.bName b)
+            tGoal = WithSource t0 (DefinitionOf nm) (getLoc b)
+        e1 <- checkFun (P.FunDesc (Just nm) 0) (P.bParams b) e0 tGoal
+        addGoals validSchema
+        () <- simplifyAllConstraints  -- XXX: using `asmps` also?
+        return e1
+
+      asmps2 <- applySubstPreds asmps1
+      cs     <- applySubstGoals cs0
+
+      let findKeep vs keep todo =
+            let stays (_,cvs)    = not $ Set.null $ Set.intersection vs cvs
+                (yes,perhaps)    = partition stays todo
+                (stayPs,newVars) = unzip yes
+            in case stayPs of
+                [] -> (keep,map fst todo)
+                _  -> findKeep (Set.unions (vs:newVars)) (stayPs ++ keep) perhaps
+
+      let -- if a goal mentions any of these variables, we'll commit to
+          -- solving it now.
+          stickyVars = Set.fromList (map tpVar as) `Set.union` fvs asmps2
+          (stay,leave) = findKeep stickyVars []
+                              [ (c, fvs c) | c <- cs ]
+
+      addGoals leave
+
+
+      su <- proveImplication (Just (thing (P.bName b))) as asmps2 stay
+      extendSubst su
+
+      let asmps  = concatMap pSplitAnd (apSubst su asmps2)
+      t      <- applySubst t0
+      e2     <- applySubst e1
+
+      pure (t, asmps, e2)
 
 --------------------------------------------------------------------------------
 --------------------------------------------------------------------------------

From fe300626ca654d56488947b5b796e640d2bc66db Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Thu, 7 Jul 2022 16:46:01 -0700
Subject: [PATCH 021/125] Safe

---
 src/Cryptol/TypeCheck/Instantiate.hs | 1 +
 1 file changed, 1 insertion(+)

diff --git a/src/Cryptol/TypeCheck/Instantiate.hs b/src/Cryptol/TypeCheck/Instantiate.hs
index 0a8b17bff..1acb477e1 100644
--- a/src/Cryptol/TypeCheck/Instantiate.hs
+++ b/src/Cryptol/TypeCheck/Instantiate.hs
@@ -6,6 +6,7 @@
 -- Stability   :  provisional
 -- Portability :  portable
 {-# Language OverloadedStrings #-}
+{-# Language Safe #-}
 module Cryptol.TypeCheck.Instantiate
   ( instantiateWith
   , TypeArg(..)

From fba4f146984ddfa7f84b5b2e392a6a2206a9cb98 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Fri, 8 Jul 2022 11:12:21 -0700
Subject: [PATCH 022/125] first impl of evaluation

---
 src/Cryptol/Eval.hs                    | 51 +++++++++++++++++++++-----
 src/Cryptol/Parser/ExpandPropGuards.hs |  4 +-
 src/Cryptol/TypeCheck/AST.hs           |  5 ++-
 src/Cryptol/TypeCheck/Infer.hs         |  2 +-
 src/Cryptol/Utils/PP.hs                |  2 +
 tests/constraint-guards/Parsing.cry    | 22 ++++++-----
 6 files changed, 64 insertions(+), 22 deletions(-)

diff --git a/src/Cryptol/Eval.hs b/src/Cryptol/Eval.hs
index 4fcd17083..f58b8fb1e 100644
--- a/src/Cryptol/Eval.hs
+++ b/src/Cryptol/Eval.hs
@@ -15,6 +15,7 @@
 {-# LANGUAGE ScopedTypeVariables #-}
 {-# LANGUAGE PatternGuards #-}
 {-# LANGUAGE ViewPatterns #-}
+{-# LANGUAGE NamedFieldPuns #-}
 
 module Cryptol.Eval (
     moduleEnv
@@ -63,9 +64,12 @@ import           Data.Maybe
 import qualified Data.IntMap.Strict as IntMap
 import qualified Data.Map.Strict as Map
 import           Data.Semigroup
+import           Control.Applicative
 
 import Prelude ()
 import Prelude.Compat
+import Math.NumberTheory.Primes (UniqueFactorisation(isPrime))
+import System.IO.Unsafe (unsafePerformIO)
 
 type EvalEnv = GenEvalEnv Concrete
 
@@ -215,13 +219,17 @@ evalExpr sym env expr = case expr of
      env' <- evalDecls sym ds env
      evalExpr sym env' e
 
-  EPropGuards _guards -> do
-    -- -- -- TODO: modify this to work for propguards
-    -- b <- fromVBit <$> eval c
-    -- iteValue sym b (eval t) (eval f)
-    -- -- -- error "should not evaluate EPropGuards"
-    -- -- evalPanic "evalExpr" ["cannot evalute EPropGuards"]
-    pure $ VBit $ bitLit sym True
+  EPropGuards guards -> {-# SCC "evalExpr->EPropGuards" #-} do
+    -- TODO: says that type var not bound.. which is true because we haven't called the function yet...
+    let
+      -- evalPropGuard :: ([Prop], Expr) -> SEval sym (Maybe (GenValue sym))
+      evalPropGuard (props, e) = do
+        if and $ evalProp env <$> props
+          then Just <$> evalExpr sym env e
+          else pure Nothing
+    evalPropGuard `traverse` guards >>= (\case
+      Just val -> pure val
+      Nothing -> evalPanic "evalExpr" ["no guard case was satisfied"]) . foldr (<|>) Nothing
 
   where
 
@@ -229,6 +237,22 @@ evalExpr sym env expr = case expr of
   eval = evalExpr sym env
   ppV = ppValue sym defaultPPOpts
 
+evalProp :: GenEvalEnv sym -> Prop -> Bool
+evalProp EvalEnv { envTypes } prop = case prop of 
+  TCon tcon ts
+    -- | Just ns <- sequence $ toTypeNat' . evalType envTypes <$> ts
+    | ns <- evalNumType envTypes <$> ts
+    -> case (tcon, ns) of
+      (PC PEqual, [n1, n2]) -> n1 == n2
+      (PC PNeq, [n1, n2]) -> n1 /= n2
+      (PC PGeq, [n1, n2]) -> n1 <= n2
+      (PC PFin, [n]) -> n /= Inf
+      (PC PPrime, [Nat n]) -> isJust $ isPrime n
+      _ -> evalPanic "evalProp" ["invalid use of constraints: ", show . pp $ prop ]
+  _ -> evalPanic "evalProp" ["cannot use this as a guarding constraint: ", show . pp $ prop ]
+  -- where 
+  --   toTypeNat' (Left a) = Just a
+  --   toTypeNat' (Right _) = Nothing
 
 -- | Capure the current call stack from the evaluation monad and
 --   annotate function values.  When arguments are later applied
@@ -415,8 +439,17 @@ evalDecl ::
   GenEvalEnv sym  {- ^ An evaluation environment to extend with the given declaration -} ->
   Decl            {- ^ The declaration to evaluate -} ->
   SEval sym (GenEvalEnv sym)
-evalDecl sym renv env d =
-  let ?range = nameLoc (dName d) in
+-- evalDecl sym renv env d =
+--   let ?range = nameLoc (dName d) in
+evalDecl sym renv env d = do
+  let ?range = nameLoc (dName d)
+  -- case show $ pp d of
+  --   'P' : 'a' : 'r' : 's' : 'i' : 'n' : 'g' : ':' : ':' : 'x' : 'x' : 'x' : _ -> pure $! unsafePerformIO $ do
+  --     putStrLn "===[ pp ]====================="
+  --     print $ pp d
+  --     putStrLn "===[ show ]====================="
+  --     print d
+  --   _ -> pure ()
   case dDefinition d of
     DPrim ->
       case ?evalPrim =<< asPrim (dName d) of
diff --git a/src/Cryptol/Parser/ExpandPropGuards.hs b/src/Cryptol/Parser/ExpandPropGuards.hs
index 5eef8ae35..ceba6ede5 100644
--- a/src/Cryptol/Parser/ExpandPropGuards.hs
+++ b/src/Cryptol/Parser/ExpandPropGuards.hs
@@ -117,10 +117,10 @@ newName locName props =
   case thing locName of 
     Qual modName ident -> do
       let txt  = identText ident
-          txt' = pack $ renderOneLine $ pp props
+          txt' = pack $ show $ pp props
       pure $ const (Qual modName (mkIdent $ txt <> txt')) <$> locName
     UnQual ident -> do
       let txt  = identText ident
-          txt' = pack $ renderOneLine $ pp props
+          txt' = pack $ show $ pp props
       pure $ const (UnQual (mkIdent $ txt <> txt')) <$> locName 
     NewName _ _ -> panic "mkName" ["During expanding prop guards, tried to make new name from NewName case of PName"]
diff --git a/src/Cryptol/TypeCheck/AST.hs b/src/Cryptol/TypeCheck/AST.hs
index 0ba1498ba..6f80c0804 100644
--- a/src/Cryptol/TypeCheck/AST.hs
+++ b/src/Cryptol/TypeCheck/AST.hs
@@ -268,7 +268,10 @@ instance PP (WithNames Expr) where
                          , hang "where" 2 (vcat (map ppW ds))
                          ]
       
-      EPropGuards _guards -> undefined -- TODO
+      EPropGuards guards -> 
+        parens (text "propguard" <+> hsep (ppGuard <$> guards))
+        where ppGuard (props, e) = 
+                pipe <+> commaSep (pp <$> props) <+> text "=>" <+> pp e
 
     where
     ppW x   = ppWithNames nm x
diff --git a/src/Cryptol/TypeCheck/Infer.hs b/src/Cryptol/TypeCheck/Infer.hs
index 65ea5ff9a..a66890b24 100644
--- a/src/Cryptol/TypeCheck/Infer.hs
+++ b/src/Cryptol/TypeCheck/Infer.hs
@@ -1031,7 +1031,7 @@ checkSigB b (Forall as asmps0 t0, validSchema) =
         return Decl
           { dName       = thing (P.bName b)
           , dSignature  = Forall as asmps1 t
-          , dDefinition = DExpr (EPropGuards cases1)
+          , dDefinition = DExpr (foldr ETAbs (foldr EProofAbs (EPropGuards cases1) asmps0) as)
           , dPragmas    = P.bPragmas b
           , dInfix      = P.bInfix b
           , dFixity     = P.bFixity b
diff --git a/src/Cryptol/Utils/PP.hs b/src/Cryptol/Utils/PP.hs
index 7c14a3075..1af1c9fd2 100644
--- a/src/Cryptol/Utils/PP.hs
+++ b/src/Cryptol/Utils/PP.hs
@@ -337,6 +337,8 @@ comma  = liftPP PP.comma
 colon :: Doc
 colon  = liftPP PP.colon
 
+pipe :: Doc
+pipe = liftPP PP.pipe
 instance PP T.Text where
   ppPrec _ str = text (T.unpack str)
 
diff --git a/tests/constraint-guards/Parsing.cry b/tests/constraint-guards/Parsing.cry
index 52e09193b..4d374ad85 100644
--- a/tests/constraint-guards/Parsing.cry
+++ b/tests/constraint-guards/Parsing.cry
@@ -5,6 +5,9 @@ module Parsing where
 foo : {n} [n] -> [n]
 foo x = x
 
+l : {n} fin n => [n] -> [n]
+l _ = `n
+
 // f : {n} [n] -> [n]
 // f .. x = x
 
@@ -40,22 +43,23 @@ foo x = x
 // g' : {n} [n] -> [n]
 // g' <| (n == 1) |> x = x
 
-f : {n} [n] -> [n]
+f : {n} [n] -> [8]
 f x = propguards
   | n == 1 => g1 x // passes
   | n == 2 => g2 x // passes
   | n == 3 => g3 x // passes
   // | n == n => g4 x // fails
 
-g1 : {n} (n == 1) => [n] -> [n]
-g1 x = x
+g1 : {n} (n == 1) => [n] -> [8]
+g1 x = 1
+
+g2 : {n} (n == 2) => [n] -> [8]
+g2 x = 2
 
-g2 : {n} (n == 2) => [n] -> [n]
-g2 x = x
+g3 : {n} (n == 3) => [n] -> [8]
+g3 x = 3
 
-g3 : {n} (n == 3) => [n] -> [n]
-g3 x = x
+g4 : {n} (n == 4) => [n] -> [8]
+g4 x = 4
 
-g4 : {n} (n == 4) => [n] -> [n]
-g4 x = x
 

From d9c9a56a1efd484ce401f5e713838bf27885ca95 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Fri, 8 Jul 2022 12:51:28 -0700
Subject: [PATCH 023/125] removed unsafePeroformIO debugging

---
 src/Cryptol/Eval.hs | 8 --------
 1 file changed, 8 deletions(-)

diff --git a/src/Cryptol/Eval.hs b/src/Cryptol/Eval.hs
index f58b8fb1e..bb95ad380 100644
--- a/src/Cryptol/Eval.hs
+++ b/src/Cryptol/Eval.hs
@@ -69,7 +69,6 @@ import           Control.Applicative
 import Prelude ()
 import Prelude.Compat
 import Math.NumberTheory.Primes (UniqueFactorisation(isPrime))
-import System.IO.Unsafe (unsafePerformIO)
 
 type EvalEnv = GenEvalEnv Concrete
 
@@ -443,13 +442,6 @@ evalDecl ::
 --   let ?range = nameLoc (dName d) in
 evalDecl sym renv env d = do
   let ?range = nameLoc (dName d)
-  -- case show $ pp d of
-  --   'P' : 'a' : 'r' : 's' : 'i' : 'n' : 'g' : ':' : ':' : 'x' : 'x' : 'x' : _ -> pure $! unsafePerformIO $ do
-  --     putStrLn "===[ pp ]====================="
-  --     print $ pp d
-  --     putStrLn "===[ show ]====================="
-  --     print d
-  --   _ -> pure ()
   case dDefinition d of
     DPrim ->
       case ?evalPrim =<< asPrim (dName d) of

From f578222001be4d8f22eae67398dd2ae06ca340f4 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Mon, 18 Jul 2022 15:16:21 -0700
Subject: [PATCH 024/125] implemented simple evaluation over Props for checking
 prop guards

---
 src/Cryptol/Eval.hs                    | 20 +++++++-------------
 src/Cryptol/Eval/Type.hs               |  1 +
 src/Cryptol/Parser/ExpandPropGuards.hs |  1 +
 src/Cryptol/TypeCheck/Infer.hs         |  4 +++-
 4 files changed, 12 insertions(+), 14 deletions(-)

diff --git a/src/Cryptol/Eval.hs b/src/Cryptol/Eval.hs
index bb95ad380..c21340195 100644
--- a/src/Cryptol/Eval.hs
+++ b/src/Cryptol/Eval.hs
@@ -68,7 +68,6 @@ import           Control.Applicative
 
 import Prelude ()
 import Prelude.Compat
-import Math.NumberTheory.Primes (UniqueFactorisation(isPrime))
 
 type EvalEnv = GenEvalEnv Concrete
 
@@ -221,7 +220,6 @@ evalExpr sym env expr = case expr of
   EPropGuards guards -> {-# SCC "evalExpr->EPropGuards" #-} do
     -- TODO: says that type var not bound.. which is true because we haven't called the function yet...
     let
-      -- evalPropGuard :: ([Prop], Expr) -> SEval sym (Maybe (GenValue sym))
       evalPropGuard (props, e) = do
         if and $ evalProp env <$> props
           then Just <$> evalExpr sym env e
@@ -239,19 +237,15 @@ evalExpr sym env expr = case expr of
 evalProp :: GenEvalEnv sym -> Prop -> Bool
 evalProp EvalEnv { envTypes } prop = case prop of 
   TCon tcon ts
-    -- | Just ns <- sequence $ toTypeNat' . evalType envTypes <$> ts
     | ns <- evalNumType envTypes <$> ts
-    -> case (tcon, ns) of
-      (PC PEqual, [n1, n2]) -> n1 == n2
-      (PC PNeq, [n1, n2]) -> n1 /= n2
-      (PC PGeq, [n1, n2]) -> n1 <= n2
-      (PC PFin, [n]) -> n /= Inf
-      (PC PPrime, [Nat n]) -> isJust $ isPrime n
-      _ -> evalPanic "evalProp" ["invalid use of constraints: ", show . pp $ prop ]
+      -> case tcon of
+          PC PEqual | [n1, n2] <- ns -> n1 == n2
+          PC PNeq | [n1, n2] <- ns -> n1 /= n2
+          PC PGeq | [n1, n2] <- ns -> n1 >= n2
+          PC PFin | [n] <- ns -> n /= Inf
+          -- PC PPrime | [n] <- ns -> isJust (isPrime n) -- TODO: instantiate UniqueFactorization for Nat'?
+          _ -> evalPanic "evalProp" ["cannot use this as a guarding constraint: ", show . pp $ prop ]
   _ -> evalPanic "evalProp" ["cannot use this as a guarding constraint: ", show . pp $ prop ]
-  -- where 
-  --   toTypeNat' (Left a) = Just a
-  --   toTypeNat' (Right _) = Nothing
 
 -- | Capure the current call stack from the evaluation monad and
 --   annotate function values.  When arguments are later applied
diff --git a/src/Cryptol/Eval/Type.hs b/src/Cryptol/Eval/Type.hs
index ced6e1c9d..e757b9e80 100644
--- a/src/Cryptol/Eval/Type.hs
+++ b/src/Cryptol/Eval/Type.hs
@@ -100,6 +100,7 @@ finNat' n' =
 newtype TypeEnv =
   TypeEnv
   { envTypeMap  :: IntMap.IntMap (Either Nat' TValue) }
+  deriving (Show)
 
 instance Monoid TypeEnv where
   mempty = TypeEnv mempty
diff --git a/src/Cryptol/Parser/ExpandPropGuards.hs b/src/Cryptol/Parser/ExpandPropGuards.hs
index ceba6ede5..a27df0bd9 100644
--- a/src/Cryptol/Parser/ExpandPropGuards.hs
+++ b/src/Cryptol/Parser/ExpandPropGuards.hs
@@ -79,6 +79,7 @@ instance ExpandPropGuards [Decl PName] where
 instance ExpandPropGuards [Bind PName] where
   expandPropGuards binds = concat <$> traverse f binds
     where 
+      f :: Bind PName -> Either Error [Bind PName]
       f bind = case thing $ bDef bind of 
         DPropGuards guards -> do
           Forall params props t rng <-
diff --git a/src/Cryptol/TypeCheck/Infer.hs b/src/Cryptol/TypeCheck/Infer.hs
index a66890b24..72dbf2eea 100644
--- a/src/Cryptol/TypeCheck/Infer.hs
+++ b/src/Cryptol/TypeCheck/Infer.hs
@@ -14,7 +14,7 @@
 {-# LANGUAGE RecursiveDo #-}
 {-# LANGUAGE OverloadedStrings #-}
 {-# LANGUAGE BlockArguments #-}
-{-# LANGUAGE Safe #-}
+{-# LANGUAGE Trustworthy #-}
 -- See Note [-Wincomplete-uni-patterns and irrefutable patterns] in Cryptol.TypeCheck.TypePat
 {-# OPTIONS_GHC -Wno-incomplete-uni-patterns #-}
 module Cryptol.TypeCheck.Infer
@@ -1006,6 +1006,8 @@ checkSigB b (Forall as asmps0 t0, validSchema) =
           , dDoc        = P.bDoc b
           }
 
+    -- TODO: somewhere in here, the signature's props are being added into the
+    -- propguard's props, but they shound't be
     P.DPropGuards cases0 -> 
       inRangeMb (getLoc b) $
       withTParams as $ do

From 764442aaa32270d71ecaa53222f6509004df53bd Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Mon, 18 Jul 2022 15:19:04 -0700
Subject: [PATCH 025/125] removed old coment

---
 src/Cryptol/TypeCheck/Infer.hs | 2 --
 1 file changed, 2 deletions(-)

diff --git a/src/Cryptol/TypeCheck/Infer.hs b/src/Cryptol/TypeCheck/Infer.hs
index 72dbf2eea..bc03218fe 100644
--- a/src/Cryptol/TypeCheck/Infer.hs
+++ b/src/Cryptol/TypeCheck/Infer.hs
@@ -1006,8 +1006,6 @@ checkSigB b (Forall as asmps0 t0, validSchema) =
           , dDoc        = P.bDoc b
           }
 
-    -- TODO: somewhere in here, the signature's props are being added into the
-    -- propguard's props, but they shound't be
     P.DPropGuards cases0 -> 
       inRangeMb (getLoc b) $
       withTParams as $ do

From 4fc59a3e1a93d43fb8005b3d410d3ebfd1bd8979 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Fri, 22 Jul 2022 14:51:35 -0700
Subject: [PATCH 026/125] builds: before removing old code (in comments)

---
 src/Cryptol/TypeCheck/Infer.hs | 167 ++++++++++++++++++++++++++++-----
 src/Cryptol/TypeCheck/Kind.hs  |  35 +++++--
 src/Cryptol/TypeCheck/Solve.hs |  17 ++++
 3 files changed, 185 insertions(+), 34 deletions(-)

diff --git a/src/Cryptol/TypeCheck/Infer.hs b/src/Cryptol/TypeCheck/Infer.hs
index bc03218fe..a664063e2 100644
--- a/src/Cryptol/TypeCheck/Infer.hs
+++ b/src/Cryptol/TypeCheck/Infer.hs
@@ -17,6 +17,7 @@
 {-# LANGUAGE Trustworthy #-}
 -- See Note [-Wincomplete-uni-patterns and irrefutable patterns] in Cryptol.TypeCheck.TypePat
 {-# OPTIONS_GHC -Wno-incomplete-uni-patterns #-}
+{-# LANGUAGE LambdaCase #-}
 module Cryptol.TypeCheck.Infer
   ( checkE
   , checkSigB
@@ -57,13 +58,15 @@ import qualified Data.Map as Map
 import           Data.Map (Map)
 import qualified Data.Set as Set
 import           Data.List(foldl',sortBy,groupBy)
-import           Data.Either(partitionEithers)
+import           Data.Either(partitionEithers, isRight, isLeft)
 import           Data.Maybe(isJust, fromMaybe, mapMaybe)
 import           Data.List(partition)
 import           Data.Ratio(numerator,denominator)
 import           Data.Traversable(forM)
 import           Data.Function(on)
-import           Control.Monad(zipWithM,unless,foldM,forM_,mplus)
+import           Control.Monad(zipWithM,unless,foldM,forM_,mplus,filterM)
+import System.IO.Unsafe (unsafePerformIO)
+import Data.Bifunctor (Bifunctor(first, second, bimap))
 
 
 
@@ -968,7 +971,7 @@ checkMonoB b t =
                      , dFixity = P.bFixity b
                      , dDoc = P.bDoc b
                      }
-    
+
     P.DPropGuards _ ->
       tcPanic "checkMonoB"
         [ "Used constraint guards without a signature, dumbwit, at "
@@ -976,12 +979,12 @@ checkMonoB b t =
 
 -- XXX: Do we really need to do the defaulting business in two different places?
 checkSigB :: P.Bind Name -> (Schema,[Goal]) -> InferM Decl
-checkSigB b (Forall as asmps0 t0, validSchema) = 
+checkSigB b (Forall as asmps0 t0, validSchema) =
   case thing (P.bDef b) of
 
     -- XXX what should we do with validSchema in this case?
     P.DPrim -> do
-      return Decl 
+      return Decl
         { dName       = thing (P.bName b)
         , dSignature  = Forall as asmps0 t0
         , dDefinition = DPrim
@@ -994,7 +997,7 @@ checkSigB b (Forall as asmps0 t0, validSchema) =
     P.DExpr e0 ->
       inRangeMb (getLoc b) $
       withTParams as $ do
-        (t, asmps, e2) <- checkBindDefExpr asmps0 e0
+        (t, asmps, e2) <- checkBindDefExpr [] asmps0 e0
 
         return Decl
           { dName       = thing (P.bName b)
@@ -1006,43 +1009,149 @@ checkSigB b (Forall as asmps0 t0, validSchema) =
           , dDoc        = P.bDoc b
           }
 
-    P.DPropGuards cases0 -> 
+    -- TODO: If the guarding prop is `n == 0` then here the constraint `fin n`
+    -- will be inferred. But, if the signature already constrains `fin n`,
+    -- then it should not be redundantly included in the validated guard again,
+    -- since then it will be checked unecessarily.
+
+    -- TODO: In general, if a goal is inferred by a guarding constraint and also
+    -- implied the declaration's constraints, then that goal should not be
+    -- prepended to the local assumptions of the guard. 
+
+    -- TODO: can i check the implication considered above using an SMT solver
+    -- call?
+
+    P.DPropGuards cases0 ->
       inRangeMb (getLoc b) $
       withTParams as $ do
+        asmps1 <- applySubstPreds asmps0
+        t1     <- applySubst t0
+
         -- Checking each guarded case is the same as checking a DExpr, except 
         -- that the guarding assumptions are added first.
         let checkPropGuardCase :: ([P.Prop Name], P.Expr Name) -> InferM ([Prop], Expr)
-            checkPropGuardCase (asmpsGuard0, e0) = do
-              asmps0' <- do
+            checkPropGuardCase (guards0, e0) = do
+              let pSchema = case P.bSignature b of
+                    Just schema -> schema
+                    _ -> undefined -- TODO: handle error
+              -- TODO: use new impl of `checkPropGuard`
+              -- check guards
+              (guards1, goals) <-  
+                second concat . unzip <$> 
+                checkPropGuard pSchema `traverse` guards0
+              -- try to prove all goals
+              su <- proveImplication (Just . thing $ P.bName b) as (asmps1 <> guards1) goals
+              extendSubst su
+              let guards2 = concatMap pSplitAnd (apSubst su guards1)
+              (_t, guards3, e1) <- checkBindDefExpr asmps1 guards2 e0
+              e2 <- applySubst e1
+              pure (guards3, e2)
+
+        {-
+        -- OLD
+        -- Checking each guarded case is the same as checking a DExpr, except 
+        -- that the guarding assumptions are added first.
+        let checkPropGuardCase' :: ([P.Prop Name], P.Expr Name) -> InferM ([Prop], Expr)
+            checkPropGuardCase' (asmpsGuard0, e0) = do
+              pure $! unsafePerformIO $ putStrLn "====================================" -- DEBUG
+              asmpsGuard0' <- do
                 -- validate props
-                (asmpsGuard1', goalss) <- unzip <$> mapM checkPropGuard asmpsGuard0
-                let asmpsGoals = goal <$> concat goalss
-                    asmpsGuard2 = asmpsGoals <> asmpsGuard1'
-                pure $ asmps0 <> asmpsGuard2
+                -- - asmpsGuard1': validated props in the guard
+                -- - goals: goals that are yielded by validating the props (i.e.
+                --   additional assumptions needed to make sense of props)
+                -- - goals': goals that are not already implied by the
+                --   declaration's constraints
+                let bTParams = case P.bSignature b of
+                      Just (P.Forall params _ _ _) -> params
+                      _ -> undefined -- TODO: error handle
+                ((asmpsGuard1', propsInferred), goals) <-
+                  first (second concat . unzip) . -- concats propsInferred
+                  fmap concat .
+                  unzip <$>
+                  mapM (checkPropGuard (zip3 (P.tpName <$> bTParams) (Just . tpKind <$> as) as)) asmpsGuard0
+
+                pure $! unsafePerformIO $ putStrLn $ "propsInferred = " ++ show (pp <$> propsInferred)
+                pure $! unsafePerformIO $ putStrLn $ "goals = " ++ show (pp . goal <$> goals)
+
+                -- filter out propsInferred that are implied by asmps1, which
+                -- are the assumptions introduced by declaration
+
+                let makeGoal :: Prop -> Goal
+                    makeGoal prop = Goal
+                      { goalSource = CtImprovement
+                      , goalRange  = emptyRange -- TODO: better range
+                      , goal       = prop
+                      }
+
+                propsInferred' <-
+                  concat <$>
+                  mapM
+                    (\prop -> do
+                      tryProveImplication Nothing as asmps1 [makeGoal prop] >>= \case
+                        -- if can be proven, then DON'T need to include it among
+                        -- the guarding constraints
+                        Right _su -> pure []
+                        -- if can't be proven, then DO need to include it among
+                        -- the guarding constraints
+                        Left _errs -> pure [prop]
+                    )
+                    propsInferred
+
+                pure $! unsafePerformIO $ putStrLn $ "propsInferred' = " ++ show (pp <$> propsInferred')
+
+                -- filter out collected goals that are implied by asmps1, which
+                -- are the assumptions introduced by declaration
+                goals' <-
+                  concat <$>
+                  mapM
+                    (\goal -> do
+                      tryProveImplication Nothing as asmps1 [goal] >>= \case
+                        -- if can be proven, then DON'T need to include it among
+                        -- the guarding constraints
+                        Right _su -> pure []
+                        -- if can't be proven, then DO need to include it among
+                        -- the guarding constraints
+                        Left _errs -> pure [goal]
+                    )
+                    goals
+
+                pure $! unsafePerformIO $ putStrLn $ "goals' = " ++ show (pp . goal <$> goals')
+
+                let asmpsGoals = goal <$> goals'
+
+                -- note that the goals are checked first, to prevent checking a
+                -- prop that is undefined if the goal is not satisfied
+                let asmpsGuard2 = asmpsGoals <> propsInferred' <> asmpsGuard1'
+
+                pure $! unsafePerformIO $ putStrLn $ "asmpsGuard2 = " ++ show (pp <$> asmpsGuard2)
+
+                pure asmpsGuard2
+
+              (_t', props', e') <- checkBindDefExpr asmps1 asmpsGuard0' e0
+
+              pure $! unsafePerformIO $ putStrLn $ "props' = " ++ show (pp <$> props') ++ "\n===================================="
+              pure $! unsafePerformIO $ putStrLn "===================================="
 
-              (_t', props', e') <- checkBindDefExpr asmps0' e0
               pure (props', e')
+        -}
 
         cases1 <- mapM checkPropGuardCase cases0
 
-        asmps1 <- applySubstPreds asmps0
-        t      <- applySubst t0
-        
         return Decl
           { dName       = thing (P.bName b)
-          , dSignature  = Forall as asmps1 t
-          , dDefinition = DExpr (foldr ETAbs (foldr EProofAbs (EPropGuards cases1) asmps0) as)
+          , dSignature  = Forall as asmps1 t1
+          , dDefinition = DExpr (foldr ETAbs (foldr EProofAbs (EPropGuards cases1) asmps1) as)
           , dPragmas    = P.bPragmas b
           , dInfix      = P.bInfix b
           , dFixity     = P.bFixity b
           , dDoc        = P.bDoc b
           }
-  
+
   where
 
-    checkBindDefExpr :: [Prop] -> P.Expr Name -> InferM (Type, [Prop], Expr)
-    checkBindDefExpr asmps1 e0 = do
-      
+    checkBindDefExpr :: [Prop] -> [Prop] -> P.Expr Name -> InferM (Type, [Prop], Expr)
+    checkBindDefExpr asmpsSign asmps1 e0 = do
+
       (e1,cs0) <- collectGoals $ do
         let nm = thing (P.bName b)
             tGoal = WithSource t0 (DefinitionOf nm) (getLoc b)
@@ -1051,9 +1160,14 @@ checkSigB b (Forall as asmps0 t0, validSchema) =
         () <- simplifyAllConstraints  -- XXX: using `asmps` also?
         return e1
 
+      -- pure $! unsafePerformIO $ putStrLn $ "[*] asmpsSign = " ++ show (pp <$> asmpsSign) -- DEBUG
+      -- pure $! unsafePerformIO $ putStrLn $ "[*] asmps1    = " ++ show (pp <$> asmps1) -- DEBUG
+
       asmps2 <- applySubstPreds asmps1
       cs     <- applySubstGoals cs0
 
+      -- pure $! unsafePerformIO $ putStrLn $ "[*] asmps2    = " ++ show (pp <$> asmps2) -- DEBUG
+
       let findKeep vs keep todo =
             let stays (_,cvs)    = not $ Set.null $ Set.intersection vs cvs
                 (yes,perhaps)    = partition stays todo
@@ -1070,14 +1184,17 @@ checkSigB b (Forall as asmps0 t0, validSchema) =
 
       addGoals leave
 
-
-      su <- proveImplication (Just (thing (P.bName b))) as asmps2 stay
+      -- includes asmpsSign for the sake of implication, but doesn't actually
+      -- include them in the resulting asmps
+      su <- proveImplication (Just (thing (P.bName b))) as (asmpsSign <> asmps2) stay
       extendSubst su
 
       let asmps  = concatMap pSplitAnd (apSubst su asmps2)
       t      <- applySubst t0
       e2     <- applySubst e1
 
+      -- pure $! unsafePerformIO $ putStrLn $ "[*] asmps     = " ++ show (pp <$> asmps) -- DEBUG
+
       pure (t, asmps, e2)
 
 --------------------------------------------------------------------------------
diff --git a/src/Cryptol/TypeCheck/Kind.hs b/src/Cryptol/TypeCheck/Kind.hs
index b896e1ff0..ab5e897d0 100644
--- a/src/Cryptol/TypeCheck/Kind.hs
+++ b/src/Cryptol/TypeCheck/Kind.hs
@@ -7,7 +7,7 @@
 -- Portability :  portable
 
 {-# LANGUAGE RecursiveDo #-}
-{-# LANGUAGE Safe #-}
+{-# LANGUAGE Trustworthy #-}
 -- See Note [-Wincomplete-uni-patterns and irrefutable patterns] in Cryptol.TypeCheck.TypePat
 {-# OPTIONS_GHC -Wno-incomplete-uni-patterns #-}
 module Cryptol.TypeCheck.Kind
@@ -40,6 +40,8 @@ import           Data.Maybe(fromMaybe)
 import           Data.Function(on)
 import           Data.Text (Text)
 import           Control.Monad(unless,when)
+import System.IO.Unsafe (unsafePerformIO)
+import Cryptol.TypeCheck.PP (pp)
 
 -- | Check a type signature.  Returns validated schema, and any implicit
 -- constraints that we inferred.
@@ -65,6 +67,17 @@ checkSchema withWild (P.Forall xs ps t mb) =
           Nothing -> id
           Just r  -> inRange r
 
+checkPropGuard :: P.Schema Name -> P.Prop Name -> InferM (Type, [Goal])
+checkPropGuard (P.Forall xs _ _ mb_rng) prop = do
+  ((_, t), goals) <-
+    collectGoals $
+    rng $
+    withTParams NoWildCards schemaParam xs $
+    checkProp prop
+  pure (t, goals)
+  where
+    rng = maybe id inRange mb_rng
+
 -- | Check a module parameter declarations.  Nothing much to check,
 -- we just translate from one syntax to another.
 checkParameterType :: P.ParameterType Name -> Maybe Text -> InferM ModTParam
@@ -412,11 +425,15 @@ checkKind _ (Just k1) k2
 checkKind t _ _ = return t
 
 
--- | Validate a parsed proposition that appears on the LHS of a PropGuard.
--- Returns the validated proposition as well as any inferred goal propisitions.
-checkPropGuard :: P.Prop Name -> InferM (Prop, [Goal])
-checkPropGuard p =
-  collectGoals $
-  fmap (\(t, _, _) -> t) $
-  runKindM NoWildCards [] $
-  checkProp p
+-- -- | Validate a parsed proposition that appears on the LHS of a PropGuard.
+-- -- Returns the validated proposition as well as any inferred goal propisitions.
+-- checkPropGuard :: [(Name, Maybe Kind, TParam)] -> P.Prop Name -> InferM ((Prop, [Prop]), [Goal])
+-- checkPropGuard params p =
+--   collectGoals $
+--   fmap (\(t, _, res) -> unsafePerformIO $ do
+--     -- print (fmap pp . snd <$> res) -- DEBUG
+--     pure (t, concat $ snd <$> res)
+--   ) $
+--   runKindM NoWildCards params $
+--   checkProp p
+
diff --git a/src/Cryptol/TypeCheck/Solve.hs b/src/Cryptol/TypeCheck/Solve.hs
index b0bc432dc..2e9657836 100644
--- a/src/Cryptol/TypeCheck/Solve.hs
+++ b/src/Cryptol/TypeCheck/Solve.hs
@@ -285,6 +285,23 @@ proveImplication lnam as ps gs =
        Left errs -> mapM_ recordError errs
      return su
 
+-- FIX: don't need this anymore
+-- -- | Tries to prove an implication, and return any improvements that we computed
+-- -- if it can be prove. If can't be proven, then returns errors.
+-- tryProveImplication :: Maybe Name -> [TParam] -> [Prop] -> [Goal] -> InferM (Either [Error] Subst)
+-- tryProveImplication lnam as ps gs =
+--   do evars <- varsWithAsmps
+--      solver <- getSolver
+
+--      extraAs <- map mtpParam . Map.elems <$> getParamTypes
+--      extra   <- map thing <$> getParamConstraints
+
+--      (mbErr,su) <- io (proveImplicationIO solver lnam evars
+--                             (extraAs ++ as) (extra ++ ps) gs)
+--      case mbErr of
+--        Right ws  -> mapM_ recordWarning ws >> pure (Right su)
+--        Left errs -> mapM_ recordError errs >> pure (Left errs)
+
 
 proveImplicationIO :: Solver
                    -> Maybe Name     -- ^ Checking this function

From e640aa287ac55dac02598bd52b2f6e6a31200ed9 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Fri, 22 Jul 2022 14:54:48 -0700
Subject: [PATCH 027/125] [builds] after removing old code (in comments)

---
 src/Cryptol/TypeCheck/Infer.hs | 107 +--------------------------------
 src/Cryptol/TypeCheck/Kind.hs  |  18 +-----
 src/Cryptol/TypeCheck/Solve.hs |  18 ------
 3 files changed, 5 insertions(+), 138 deletions(-)

diff --git a/src/Cryptol/TypeCheck/Infer.hs b/src/Cryptol/TypeCheck/Infer.hs
index a664063e2..e931f1933 100644
--- a/src/Cryptol/TypeCheck/Infer.hs
+++ b/src/Cryptol/TypeCheck/Infer.hs
@@ -58,15 +58,14 @@ import qualified Data.Map as Map
 import           Data.Map (Map)
 import qualified Data.Set as Set
 import           Data.List(foldl',sortBy,groupBy)
-import           Data.Either(partitionEithers, isRight, isLeft)
+import           Data.Either(partitionEithers)
 import           Data.Maybe(isJust, fromMaybe, mapMaybe)
 import           Data.List(partition)
 import           Data.Ratio(numerator,denominator)
 import           Data.Traversable(forM)
 import           Data.Function(on)
-import           Control.Monad(zipWithM,unless,foldM,forM_,mplus,filterM)
-import System.IO.Unsafe (unsafePerformIO)
-import Data.Bifunctor (Bifunctor(first, second, bimap))
+import           Control.Monad(zipWithM,unless,foldM,forM_,mplus)
+import Data.Bifunctor (Bifunctor(second))
 
 
 
@@ -1009,18 +1008,6 @@ checkSigB b (Forall as asmps0 t0, validSchema) =
           , dDoc        = P.bDoc b
           }
 
-    -- TODO: If the guarding prop is `n == 0` then here the constraint `fin n`
-    -- will be inferred. But, if the signature already constrains `fin n`,
-    -- then it should not be redundantly included in the validated guard again,
-    -- since then it will be checked unecessarily.
-
-    -- TODO: In general, if a goal is inferred by a guarding constraint and also
-    -- implied the declaration's constraints, then that goal should not be
-    -- prepended to the local assumptions of the guard. 
-
-    -- TODO: can i check the implication considered above using an SMT solver
-    -- call?
-
     P.DPropGuards cases0 ->
       inRangeMb (getLoc b) $
       withTParams as $ do
@@ -1047,94 +1034,6 @@ checkSigB b (Forall as asmps0 t0, validSchema) =
               e2 <- applySubst e1
               pure (guards3, e2)
 
-        {-
-        -- OLD
-        -- Checking each guarded case is the same as checking a DExpr, except 
-        -- that the guarding assumptions are added first.
-        let checkPropGuardCase' :: ([P.Prop Name], P.Expr Name) -> InferM ([Prop], Expr)
-            checkPropGuardCase' (asmpsGuard0, e0) = do
-              pure $! unsafePerformIO $ putStrLn "====================================" -- DEBUG
-              asmpsGuard0' <- do
-                -- validate props
-                -- - asmpsGuard1': validated props in the guard
-                -- - goals: goals that are yielded by validating the props (i.e.
-                --   additional assumptions needed to make sense of props)
-                -- - goals': goals that are not already implied by the
-                --   declaration's constraints
-                let bTParams = case P.bSignature b of
-                      Just (P.Forall params _ _ _) -> params
-                      _ -> undefined -- TODO: error handle
-                ((asmpsGuard1', propsInferred), goals) <-
-                  first (second concat . unzip) . -- concats propsInferred
-                  fmap concat .
-                  unzip <$>
-                  mapM (checkPropGuard (zip3 (P.tpName <$> bTParams) (Just . tpKind <$> as) as)) asmpsGuard0
-
-                pure $! unsafePerformIO $ putStrLn $ "propsInferred = " ++ show (pp <$> propsInferred)
-                pure $! unsafePerformIO $ putStrLn $ "goals = " ++ show (pp . goal <$> goals)
-
-                -- filter out propsInferred that are implied by asmps1, which
-                -- are the assumptions introduced by declaration
-
-                let makeGoal :: Prop -> Goal
-                    makeGoal prop = Goal
-                      { goalSource = CtImprovement
-                      , goalRange  = emptyRange -- TODO: better range
-                      , goal       = prop
-                      }
-
-                propsInferred' <-
-                  concat <$>
-                  mapM
-                    (\prop -> do
-                      tryProveImplication Nothing as asmps1 [makeGoal prop] >>= \case
-                        -- if can be proven, then DON'T need to include it among
-                        -- the guarding constraints
-                        Right _su -> pure []
-                        -- if can't be proven, then DO need to include it among
-                        -- the guarding constraints
-                        Left _errs -> pure [prop]
-                    )
-                    propsInferred
-
-                pure $! unsafePerformIO $ putStrLn $ "propsInferred' = " ++ show (pp <$> propsInferred')
-
-                -- filter out collected goals that are implied by asmps1, which
-                -- are the assumptions introduced by declaration
-                goals' <-
-                  concat <$>
-                  mapM
-                    (\goal -> do
-                      tryProveImplication Nothing as asmps1 [goal] >>= \case
-                        -- if can be proven, then DON'T need to include it among
-                        -- the guarding constraints
-                        Right _su -> pure []
-                        -- if can't be proven, then DO need to include it among
-                        -- the guarding constraints
-                        Left _errs -> pure [goal]
-                    )
-                    goals
-
-                pure $! unsafePerformIO $ putStrLn $ "goals' = " ++ show (pp . goal <$> goals')
-
-                let asmpsGoals = goal <$> goals'
-
-                -- note that the goals are checked first, to prevent checking a
-                -- prop that is undefined if the goal is not satisfied
-                let asmpsGuard2 = asmpsGoals <> propsInferred' <> asmpsGuard1'
-
-                pure $! unsafePerformIO $ putStrLn $ "asmpsGuard2 = " ++ show (pp <$> asmpsGuard2)
-
-                pure asmpsGuard2
-
-              (_t', props', e') <- checkBindDefExpr asmps1 asmpsGuard0' e0
-
-              pure $! unsafePerformIO $ putStrLn $ "props' = " ++ show (pp <$> props') ++ "\n===================================="
-              pure $! unsafePerformIO $ putStrLn "===================================="
-
-              pure (props', e')
-        -}
-
         cases1 <- mapM checkPropGuardCase cases0
 
         return Decl
diff --git a/src/Cryptol/TypeCheck/Kind.hs b/src/Cryptol/TypeCheck/Kind.hs
index ab5e897d0..b665366d6 100644
--- a/src/Cryptol/TypeCheck/Kind.hs
+++ b/src/Cryptol/TypeCheck/Kind.hs
@@ -40,8 +40,6 @@ import           Data.Maybe(fromMaybe)
 import           Data.Function(on)
 import           Data.Text (Text)
 import           Control.Monad(unless,when)
-import System.IO.Unsafe (unsafePerformIO)
-import Cryptol.TypeCheck.PP (pp)
 
 -- | Check a type signature.  Returns validated schema, and any implicit
 -- constraints that we inferred.
@@ -67,6 +65,8 @@ checkSchema withWild (P.Forall xs ps t mb) =
           Nothing -> id
           Just r  -> inRange r
 
+-- | Validate a parsed proposition that appears in the guard of a PropGuard.
+-- Returns the validated proposition as well as any inferred goal propisitions.
 checkPropGuard :: P.Schema Name -> P.Prop Name -> InferM (Type, [Goal])
 checkPropGuard (P.Forall xs _ _ mb_rng) prop = do
   ((_, t), goals) <-
@@ -423,17 +423,3 @@ checkKind _ (Just k1) k2
   | k1 /= k2    = do kRecordError (KindMismatch Nothing k1 k2)
                      kNewType TypeErrorPlaceHolder k1
 checkKind t _ _ = return t
-
-
--- -- | Validate a parsed proposition that appears on the LHS of a PropGuard.
--- -- Returns the validated proposition as well as any inferred goal propisitions.
--- checkPropGuard :: [(Name, Maybe Kind, TParam)] -> P.Prop Name -> InferM ((Prop, [Prop]), [Goal])
--- checkPropGuard params p =
---   collectGoals $
---   fmap (\(t, _, res) -> unsafePerformIO $ do
---     -- print (fmap pp . snd <$> res) -- DEBUG
---     pure (t, concat $ snd <$> res)
---   ) $
---   runKindM NoWildCards params $
---   checkProp p
-
diff --git a/src/Cryptol/TypeCheck/Solve.hs b/src/Cryptol/TypeCheck/Solve.hs
index 2e9657836..d79764546 100644
--- a/src/Cryptol/TypeCheck/Solve.hs
+++ b/src/Cryptol/TypeCheck/Solve.hs
@@ -285,24 +285,6 @@ proveImplication lnam as ps gs =
        Left errs -> mapM_ recordError errs
      return su
 
--- FIX: don't need this anymore
--- -- | Tries to prove an implication, and return any improvements that we computed
--- -- if it can be prove. If can't be proven, then returns errors.
--- tryProveImplication :: Maybe Name -> [TParam] -> [Prop] -> [Goal] -> InferM (Either [Error] Subst)
--- tryProveImplication lnam as ps gs =
---   do evars <- varsWithAsmps
---      solver <- getSolver
-
---      extraAs <- map mtpParam . Map.elems <$> getParamTypes
---      extra   <- map thing <$> getParamConstraints
-
---      (mbErr,su) <- io (proveImplicationIO solver lnam evars
---                             (extraAs ++ as) (extra ++ ps) gs)
---      case mbErr of
---        Right ws  -> mapM_ recordWarning ws >> pure (Right su)
---        Left errs -> mapM_ recordError errs >> pure (Left errs)
-
-
 proveImplicationIO :: Solver
                    -> Maybe Name     -- ^ Checking this function
                    -> Set TVar -- ^ These appear in the env., and we should

From 005c7da191132cd6ed2ff144b1720d640d812b19 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Fri, 22 Jul 2022 15:16:09 -0700
Subject: [PATCH 028/125] some tests

---
 tests/constraint-guards/Test1.cry | 12 ++++++++++++
 tests/constraint-guards/Test2.cry |  5 +++++
 tests/constraint-guards/Test3.cry |  4 ++++
 3 files changed, 21 insertions(+)
 create mode 100644 tests/constraint-guards/Test1.cry
 create mode 100644 tests/constraint-guards/Test2.cry
 create mode 100644 tests/constraint-guards/Test3.cry

diff --git a/tests/constraint-guards/Test1.cry b/tests/constraint-guards/Test1.cry
new file mode 100644
index 000000000..7b3bb18ba
--- /dev/null
+++ b/tests/constraint-guards/Test1.cry
@@ -0,0 +1,12 @@
+// PASSES
+// testA : {n} (fin n) => [n] -> [n]
+// testA x = propguards
+//   | n - n == 0 => x
+
+// FAILS
+// testB : {m, n, l} [n] -> [n]
+// testB x = propguards
+//   | (m - n == l) => x
+
+test : {m, n, l} (m - n == l) => [n] -> [n]
+test x = x
\ No newline at end of file
diff --git a/tests/constraint-guards/Test2.cry b/tests/constraint-guards/Test2.cry
new file mode 100644
index 000000000..21c80c478
--- /dev/null
+++ b/tests/constraint-guards/Test2.cry
@@ -0,0 +1,5 @@
+// WHY isn't n in scope during evaluation? it typechecks just fine
+len : {n, a} (fin n) => [n]a -> Integer
+len x = propguards
+  | (n == 0) => 0
+  | (n >= 1) => 1 + len (drop`{1} x)
diff --git a/tests/constraint-guards/Test3.cry b/tests/constraint-guards/Test3.cry
new file mode 100644
index 000000000..47535ab98
--- /dev/null
+++ b/tests/constraint-guards/Test3.cry
@@ -0,0 +1,4 @@
+test : {n, a} [n]a -> Integer
+test x = propguards
+  | (n - 1 >= 0, n >= 1) => 0
+  | n == n => 1
\ No newline at end of file

From 09f6087f95a2f0b6ff872ad21c66eb8c64f52c07 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Fri, 22 Jul 2022 15:16:19 -0700
Subject: [PATCH 029/125] cleanup, better errors

---
 src/Cryptol/Eval.hs            |  5 +++--
 src/Cryptol/TypeCheck/Infer.hs | 15 +++++++++------
 src/Cryptol/TypeCheck/Kind.hs  |  9 ++++++---
 3 files changed, 18 insertions(+), 11 deletions(-)

diff --git a/src/Cryptol/Eval.hs b/src/Cryptol/Eval.hs
index c21340195..940c100b2 100644
--- a/src/Cryptol/Eval.hs
+++ b/src/Cryptol/Eval.hs
@@ -218,7 +218,6 @@ evalExpr sym env expr = case expr of
      evalExpr sym env' e
 
   EPropGuards guards -> {-# SCC "evalExpr->EPropGuards" #-} do
-    -- TODO: says that type var not bound.. which is true because we haven't called the function yet...
     let
       evalPropGuard (props, e) = do
         if and $ evalProp env <$> props
@@ -243,7 +242,9 @@ evalProp EvalEnv { envTypes } prop = case prop of
           PC PNeq | [n1, n2] <- ns -> n1 /= n2
           PC PGeq | [n1, n2] <- ns -> n1 >= n2
           PC PFin | [n] <- ns -> n /= Inf
-          -- PC PPrime | [n] <- ns -> isJust (isPrime n) -- TODO: instantiate UniqueFactorization for Nat'?
+          -- TODO: instantiate UniqueFactorization for Nat'?
+          -- PC PPrime | [n] <- ns -> isJust (isPrime n) 
+          PC PTrue -> True
           _ -> evalPanic "evalProp" ["cannot use this as a guarding constraint: ", show . pp $ prop ]
   _ -> evalPanic "evalProp" ["cannot use this as a guarding constraint: ", show . pp $ prop ]
 
diff --git a/src/Cryptol/TypeCheck/Infer.hs b/src/Cryptol/TypeCheck/Infer.hs
index e931f1933..19a6a5aad 100644
--- a/src/Cryptol/TypeCheck/Infer.hs
+++ b/src/Cryptol/TypeCheck/Infer.hs
@@ -1018,14 +1018,15 @@ checkSigB b (Forall as asmps0 t0, validSchema) =
         -- that the guarding assumptions are added first.
         let checkPropGuardCase :: ([P.Prop Name], P.Expr Name) -> InferM ([Prop], Expr)
             checkPropGuardCase (guards0, e0) = do
-              let pSchema = case P.bSignature b of
-                    Just schema -> schema
-                    _ -> undefined -- TODO: handle error
-              -- TODO: use new impl of `checkPropGuard`
+              mb_rng <- case P.bSignature b of
+                Just (P.Forall _ _ _ mb_rng) -> pure mb_rng
+                _ -> panic "checkSigB" 
+                  [ "Used constraint guards without a signature, dumbwit, at " 
+                  , show . pp $ P.bName b ]
               -- check guards
               (guards1, goals) <-  
                 second concat . unzip <$> 
-                checkPropGuard pSchema `traverse` guards0
+                checkPropGuard mb_rng `traverse` guards0
               -- try to prove all goals
               su <- proveImplication (Just . thing $ P.bName b) as (asmps1 <> guards1) goals
               extendSubst su
@@ -1039,7 +1040,9 @@ checkSigB b (Forall as asmps0 t0, validSchema) =
         return Decl
           { dName       = thing (P.bName b)
           , dSignature  = Forall as asmps1 t1
-          , dDefinition = DExpr (foldr ETAbs (foldr EProofAbs (EPropGuards cases1) asmps1) as)
+          , dDefinition = DExpr
+                            (foldr ETAbs 
+                            (foldr EProofAbs (EPropGuards cases1) asmps1) as)
           , dPragmas    = P.bPragmas b
           , dInfix      = P.bInfix b
           , dFixity     = P.bFixity b
diff --git a/src/Cryptol/TypeCheck/Kind.hs b/src/Cryptol/TypeCheck/Kind.hs
index b665366d6..6f2b70b6e 100644
--- a/src/Cryptol/TypeCheck/Kind.hs
+++ b/src/Cryptol/TypeCheck/Kind.hs
@@ -67,12 +67,15 @@ checkSchema withWild (P.Forall xs ps t mb) =
 
 -- | Validate a parsed proposition that appears in the guard of a PropGuard.
 -- Returns the validated proposition as well as any inferred goal propisitions.
-checkPropGuard :: P.Schema Name -> P.Prop Name -> InferM (Type, [Goal])
-checkPropGuard (P.Forall xs _ _ mb_rng) prop = do
+-- IDEA [WORKS]: is using `xs` making it use the old names rather than the new names? so, try just giving `[]` instead of `xs` to `withTParams`
+checkPropGuard :: Maybe Range -> P.Prop Name -> InferM (Type, [Goal])
+checkPropGuard mb_rng prop = do
   ((_, t), goals) <-
     collectGoals $
     rng $
-    withTParams NoWildCards schemaParam xs $
+    -- not really doing anything here, since we don't want to introduce any new
+    -- type vars into scope
+    withTParams NoWildCards schemaParam [] $
     checkProp prop
   pure (t, goals)
   where

From fc1a42a0a28f85bada820c236aa2bac0f0786043 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Fri, 22 Jul 2022 16:48:42 -0700
Subject: [PATCH 030/125] cleaned; Trustworthy->Safe

---
 src/Cryptol/TypeCheck/Infer.hs | 2 +-
 src/Cryptol/TypeCheck/Kind.hs  | 3 +--
 2 files changed, 2 insertions(+), 3 deletions(-)

diff --git a/src/Cryptol/TypeCheck/Infer.hs b/src/Cryptol/TypeCheck/Infer.hs
index c548c1ae6..eba103fb7 100644
--- a/src/Cryptol/TypeCheck/Infer.hs
+++ b/src/Cryptol/TypeCheck/Infer.hs
@@ -14,7 +14,7 @@
 {-# LANGUAGE RecursiveDo #-}
 {-# LANGUAGE OverloadedStrings #-}
 {-# LANGUAGE BlockArguments #-}
-{-# LANGUAGE Trustworthy #-}
+{-# LANGUAGE Safe #-}
 -- See Note [-Wincomplete-uni-patterns and irrefutable patterns] in Cryptol.TypeCheck.TypePat
 {-# OPTIONS_GHC -Wno-incomplete-uni-patterns #-}
 {-# LANGUAGE LambdaCase #-}
diff --git a/src/Cryptol/TypeCheck/Kind.hs b/src/Cryptol/TypeCheck/Kind.hs
index 6f2b70b6e..45a926012 100644
--- a/src/Cryptol/TypeCheck/Kind.hs
+++ b/src/Cryptol/TypeCheck/Kind.hs
@@ -7,7 +7,7 @@
 -- Portability :  portable
 
 {-# LANGUAGE RecursiveDo #-}
-{-# LANGUAGE Trustworthy #-}
+{-# LANGUAGE Safe #-}
 -- See Note [-Wincomplete-uni-patterns and irrefutable patterns] in Cryptol.TypeCheck.TypePat
 {-# OPTIONS_GHC -Wno-incomplete-uni-patterns #-}
 module Cryptol.TypeCheck.Kind
@@ -67,7 +67,6 @@ checkSchema withWild (P.Forall xs ps t mb) =
 
 -- | Validate a parsed proposition that appears in the guard of a PropGuard.
 -- Returns the validated proposition as well as any inferred goal propisitions.
--- IDEA [WORKS]: is using `xs` making it use the old names rather than the new names? so, try just giving `[]` instead of `xs` to `withTParams`
 checkPropGuard :: Maybe Range -> P.Prop Name -> InferM (Type, [Goal])
 checkPropGuard mb_rng prop = do
   ((_, t), goals) <-

From 1cb8ef2f3b3c1a093da2426ed16a38a98890c748 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Fri, 22 Jul 2022 16:51:54 -0700
Subject: [PATCH 031/125] note about prepending inferred well-formedness goals
 to guarding constraints

---
 src/Cryptol/TypeCheck/Infer.hs | 6 +++++-
 1 file changed, 5 insertions(+), 1 deletion(-)

diff --git a/src/Cryptol/TypeCheck/Infer.hs b/src/Cryptol/TypeCheck/Infer.hs
index eba103fb7..f54f0797c 100644
--- a/src/Cryptol/TypeCheck/Infer.hs
+++ b/src/Cryptol/TypeCheck/Infer.hs
@@ -1027,7 +1027,11 @@ checkSigB b (Forall as asmps0 t0, validSchema) =
               -- try to prove all goals
               su <- proveImplication (Just . thing $ P.bName b) as (asmps1 <> guards1) goals
               extendSubst su
-              let guards2 = concatMap pSplitAnd (apSubst su guards1)
+              -- preprends the goals to the constraints, because these must be
+              -- checked first before the rest of the constraints (during
+              -- evaluation) to ensure well-definedness, since some constraints
+              -- make use of partial functions e.g. `a - b` requires `a >= b`.
+              let guards2 = (goal <$> goals) <> concatMap pSplitAnd (apSubst su guards1)
               (_t, guards3, e1) <- checkBindDefExpr asmps1 guards2 e0
               e2 <- applySubst e1
               pure (guards3, e2)

From fefcf5681286b0a261b4834065ed67f5a2cfbc79 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Fri, 22 Jul 2022 17:02:48 -0700
Subject: [PATCH 032/125] proper handling of evaluating with inferred
 well-formedness constraints

---
 tests/constraint-guards/Test4.cry | 16 ++++++++++++++++
 1 file changed, 16 insertions(+)
 create mode 100644 tests/constraint-guards/Test4.cry

diff --git a/tests/constraint-guards/Test4.cry b/tests/constraint-guards/Test4.cry
new file mode 100644
index 000000000..346f21281
--- /dev/null
+++ b/tests/constraint-guards/Test4.cry
@@ -0,0 +1,16 @@
+test : {n, a} [n]a -> Bit
+test x = propguards
+  | (n - 5 >= 0, n >= 5) => True
+  | 0 == 0 => False
+
+property test_True = 
+  (test [1..5] == True) &&
+  (test [1..6] == True) &&
+  (test [1..7] == True) &&
+  (test [1..8] == True)
+
+property test_False = 
+  (test [1..1] == False) &&
+  (test [1..2] == False) &&
+  (test [1..3] == False) &&
+  (test [1..4] == False)

From a3bfb1c445fef424c4f868ed11bcffb6c3c672a2 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Mon, 1 Aug 2022 10:29:42 -0700
Subject: [PATCH 033/125] updated syntax to not use 'propguards' keyword

---
 src/Cryptol/Parser.hs               | 1 -
 src/Cryptol/Parser.y                | 8 +++-----
 src/Cryptol/Parser/Lexer.x          | 2 --
 src/Cryptol/Parser/Token.hs         | 1 -
 tests/constraint-guards/Parsing.cry | 3 ++-
 tests/constraint-guards/Test1.cry   | 2 +-
 tests/constraint-guards/Test2.cry   | 2 +-
 tests/constraint-guards/Test3.cry   | 2 +-
 tests/constraint-guards/Test4.cry   | 2 +-
 9 files changed, 9 insertions(+), 14 deletions(-)

diff --git a/src/Cryptol/Parser.hs b/src/Cryptol/Parser.hs
index d64d83a15..d11510b90 100644
--- a/src/Cryptol/Parser.hs
+++ b/src/Cryptol/Parser.hs
@@ -3474,7 +3474,6 @@ happyNewToken action sts stk
 	Located happy_dollar_dollar (Token (KW KW_primitive) _) -> cont 30;
 	Located happy_dollar_dollar (Token (KW KW_constraint) _) -> cont 31;
 	Located happy_dollar_dollar (Token (KW KW_Prop) _) -> cont 32;
-	Located happy_dollar_dollar (Token (KW KW_propguards) _) -> cont 33;
 	Located happy_dollar_dollar (Token (Sym BracketL) _) -> cont 34;
 	Located happy_dollar_dollar (Token (Sym BracketR) _) -> cont 35;
 	Located happy_dollar_dollar (Token (Sym ArrL    ) _) -> cont 36;
diff --git a/src/Cryptol/Parser.y b/src/Cryptol/Parser.y
index 79fad8f46..32990981e 100644
--- a/src/Cryptol/Parser.y
+++ b/src/Cryptol/Parser.y
@@ -91,8 +91,6 @@ import Paths_cryptol
   'primitive' { Located $$ (Token (KW KW_primitive) _)}
   'constraint'{ Located $$ (Token (KW KW_constraint) _)}
   'Prop'      { Located $$ (Token (KW KW_Prop) _)}
-  
-  'propguards' { Located $$ (Token (KW KW_propguards) _) }
 
   '['         { Located $$ (Token (Sym BracketL) _)}
   ']'         { Located $$ (Token (Sym BracketR) _)}
@@ -300,8 +298,8 @@ mbDoc                   :: { Maybe (Located Text) }
   : doc                    { Just $1 }
   | {- empty -}            { Nothing }
 
-propguards :: { [([Prop PName], Expr PName)] }
-  : 'propguards' '|' propguards_cases { $3 }
+-- propguards :: { [([Prop PName], Expr PName)] }
+--   : 'propguards' '|' propguards_cases { $3 }
 
 propguards_cases :: { [([Prop PName], Expr PName)] }
   : propguards_case '|' propguards_cases { $1 ++ $3 }
@@ -319,7 +317,7 @@ decl                    :: { Decl PName }
   : vars_comma ':' schema  { at (head $1,$3) $ DSignature (reverse $1) $3   }
   | ipat '=' expr          { at ($1,$3) $ DPatBind $1 $3                    }
   | '(' op ')' '=' expr    { at ($1,$5) $ DPatBind (PVar $2) $5             }
-  | var apats_indices '=' propguards
+  | var apats_indices '|' propguards_cases
                            { mkIndexedPropGuardsDecl $1 $2 $4 }
   | var apats_indices '=' expr
                            { at ($1,$4) $ mkIndexedDecl $1 $2 $4 }
diff --git a/src/Cryptol/Parser/Lexer.x b/src/Cryptol/Parser/Lexer.x
index 10c550568..0f76c62ae 100644
--- a/src/Cryptol/Parser/Lexer.x
+++ b/src/Cryptol/Parser/Lexer.x
@@ -129,8 +129,6 @@ $white+                   { emit $ White Space }
 
 "Prop"                    { emit $ KW KW_Prop }
 
-"propguards"              { emit $ KW KW_propguards }
-
 @num                      { emitS numToken }
 @fnum                     { emitFancy fnumTokens }
 
diff --git a/src/Cryptol/Parser/Token.hs b/src/Cryptol/Parser/Token.hs
index feac45d20..b706ec4f6 100644
--- a/src/Cryptol/Parser/Token.hs
+++ b/src/Cryptol/Parser/Token.hs
@@ -54,7 +54,6 @@ data TokenKW  = KW_else
               | KW_Prop
               | KW_by
               | KW_down
-              | KW_propguards
                 deriving (Eq, Show, Generic, NFData)
 
 -- | The named operators are a special case for parsing types, and 'Other' is
diff --git a/tests/constraint-guards/Parsing.cry b/tests/constraint-guards/Parsing.cry
index 4d374ad85..b597b3be0 100644
--- a/tests/constraint-guards/Parsing.cry
+++ b/tests/constraint-guards/Parsing.cry
@@ -43,8 +43,9 @@ l _ = `n
 // g' : {n} [n] -> [n]
 // g' <| (n == 1) |> x = x
 
+// FAILS when evaluated on [1,2]
 f : {n} [n] -> [8]
-f x = propguards
+f x
   | n == 1 => g1 x // passes
   | n == 2 => g2 x // passes
   | n == 3 => g3 x // passes
diff --git a/tests/constraint-guards/Test1.cry b/tests/constraint-guards/Test1.cry
index 7b3bb18ba..2199b2858 100644
--- a/tests/constraint-guards/Test1.cry
+++ b/tests/constraint-guards/Test1.cry
@@ -8,5 +8,5 @@
 // testB x = propguards
 //   | (m - n == l) => x
 
-test : {m, n, l} (m - n == l) => [n] -> [n]
+test : {m, n, l} (fin n, m >= n, m - n == l) => [n] -> [n]
 test x = x
\ No newline at end of file
diff --git a/tests/constraint-guards/Test2.cry b/tests/constraint-guards/Test2.cry
index 21c80c478..7b49a1536 100644
--- a/tests/constraint-guards/Test2.cry
+++ b/tests/constraint-guards/Test2.cry
@@ -1,5 +1,5 @@
 // WHY isn't n in scope during evaluation? it typechecks just fine
 len : {n, a} (fin n) => [n]a -> Integer
-len x = propguards
+len x
   | (n == 0) => 0
   | (n >= 1) => 1 + len (drop`{1} x)
diff --git a/tests/constraint-guards/Test3.cry b/tests/constraint-guards/Test3.cry
index 47535ab98..a71a23288 100644
--- a/tests/constraint-guards/Test3.cry
+++ b/tests/constraint-guards/Test3.cry
@@ -1,4 +1,4 @@
 test : {n, a} [n]a -> Integer
-test x = propguards
+test x
   | (n - 1 >= 0, n >= 1) => 0
   | n == n => 1
\ No newline at end of file
diff --git a/tests/constraint-guards/Test4.cry b/tests/constraint-guards/Test4.cry
index 346f21281..3bc1cf3a2 100644
--- a/tests/constraint-guards/Test4.cry
+++ b/tests/constraint-guards/Test4.cry
@@ -1,5 +1,5 @@
 test : {n, a} [n]a -> Bit
-test x = propguards
+test x
   | (n - 5 >= 0, n >= 5) => True
   | 0 == 0 => False
 

From 22fb6d8648c4c5bd3821eb1f3a964f645bde5361 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Mon, 1 Aug 2022 14:56:27 -0700
Subject: [PATCH 034/125] test [ci skip]

---
 tests/constraint-guards/Test2.cry | 1 +
 1 file changed, 1 insertion(+)

diff --git a/tests/constraint-guards/Test2.cry b/tests/constraint-guards/Test2.cry
index 7b49a1536..fe758868b 100644
--- a/tests/constraint-guards/Test2.cry
+++ b/tests/constraint-guards/Test2.cry
@@ -3,3 +3,4 @@ len : {n, a} (fin n) => [n]a -> Integer
 len x
   | (n == 0) => 0
   | (n >= 1) => 1 + len (drop`{1} x)
+

From 9f0d72a766d4c99412073b88e69bec6d48cd0019 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Tue, 9 Aug 2022 17:01:29 -0700
Subject: [PATCH 035/125] formatting

---
 src/Cryptol/TypeCheck/Type.hs | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/src/Cryptol/TypeCheck/Type.hs b/src/Cryptol/TypeCheck/Type.hs
index 754d88dd6..a0a79bdb5 100644
--- a/src/Cryptol/TypeCheck/Type.hs
+++ b/src/Cryptol/TypeCheck/Type.hs
@@ -696,7 +696,7 @@ tFun     :: Type -> Type -> Type
 tFun a b  = TCon (TC TCFun) [a,b]
 
 -- | Eliminate outermost type synonyms.
-tNoUser  :: Type -> Type
+tNoUser :: Type -> Type
 tNoUser t = case t of
               TUser _ _ a -> tNoUser a
               _           -> t

From ed6ade690de90873554d376d806d6a301db350d3 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Tue, 9 Aug 2022 17:50:38 -0700
Subject: [PATCH 036/125] supports type aliases in prop guards

---
 src/Cryptol/Backend/Monad.hs      |  2 +
 src/Cryptol/Eval.hs               | 74 ++++++++++++++++++++++---------
 src/Cryptol/Eval/Type.hs          |  2 +-
 src/Cryptol/TypeCheck/TCon.hs     |  1 +
 tests/constraint-guards/Len.cry   | 16 +++++++
 tests/constraint-guards/Test2.cry |  6 ---
 6 files changed, 72 insertions(+), 29 deletions(-)
 create mode 100644 tests/constraint-guards/Len.cry
 delete mode 100644 tests/constraint-guards/Test2.cry

diff --git a/src/Cryptol/Backend/Monad.hs b/src/Cryptol/Backend/Monad.hs
index ef138188a..23a703e7a 100644
--- a/src/Cryptol/Backend/Monad.hs
+++ b/src/Cryptol/Backend/Monad.hs
@@ -421,6 +421,7 @@ data EvalError
   | NoPrim Name                   -- ^ Primitive with no implementation
   | BadRoundingMode Integer       -- ^ Invalid rounding mode
   | BadValue String               -- ^ Value outside the domain of a partial function.
+  | NoMatchingPropGuardCase String    -- ^ No prop guard holds for the given type variables.
     deriving Typeable
 
 instance PP EvalError where
@@ -440,6 +441,7 @@ instance PP EvalError where
     BadRoundingMode r -> "invalid rounding mode" <+> integer r
     BadValue x -> "invalid input for" <+> backticks (text x)
     NoPrim x -> text "unimplemented primitive:" <+> pp x
+    NoMatchingPropGuardCase msg -> text $ "No matching prop guard case; " ++ msg
 
 instance Show EvalError where
   show = show . pp
diff --git a/src/Cryptol/Eval.hs b/src/Cryptol/Eval.hs
index 940c100b2..a28e123c6 100644
--- a/src/Cryptol/Eval.hs
+++ b/src/Cryptol/Eval.hs
@@ -68,6 +68,7 @@ import           Control.Applicative
 
 import Prelude ()
 import Prelude.Compat
+import Data.Bifunctor (Bifunctor(first))
 
 type EvalEnv = GenEvalEnv Concrete
 
@@ -218,14 +219,22 @@ evalExpr sym env expr = case expr of
      evalExpr sym env' e
 
   EPropGuards guards -> {-# SCC "evalExpr->EPropGuards" #-} do
-    let
-      evalPropGuard (props, e) = do
-        if and $ evalProp env <$> props
-          then Just <$> evalExpr sym env e
-          else pure Nothing
-    evalPropGuard `traverse` guards >>= (\case
-      Just val -> pure val
-      Nothing -> evalPanic "evalExpr" ["no guard case was satisfied"]) . foldr (<|>) Nothing
+    -- let
+    --   evalPropGuard (props, e) = do
+    --     if and $ checkProp . evalProp env <$> props
+    --       then Just <$> evalExpr sym env e
+    --       else pure Nothing
+    let checkedGuards =
+          first (and . (checkProp . evalProp env <$>))
+          <$> guards
+    case find fst checkedGuards of 
+      Nothing -> raiseError sym (NoMatchingPropGuardCase $ "Available prop guards: `" ++ show (fmap pp . fst <$> guards) ++ "`")
+      Just (_, e) -> eval e
+      
+      -- (\case
+      -- Just val -> pure val
+      -- Nothing -> evalPanic "evalExpr" ["no guard case was satisfied"]) . 
+      -- -- raiseError
 
   where
 
@@ -233,20 +242,41 @@ evalExpr sym env expr = case expr of
   eval = evalExpr sym env
   ppV = ppValue sym defaultPPOpts
 
-evalProp :: GenEvalEnv sym -> Prop -> Bool
-evalProp EvalEnv { envTypes } prop = case prop of 
-  TCon tcon ts
-    | ns <- evalNumType envTypes <$> ts
-      -> case tcon of
-          PC PEqual | [n1, n2] <- ns -> n1 == n2
-          PC PNeq | [n1, n2] <- ns -> n1 /= n2
-          PC PGeq | [n1, n2] <- ns -> n1 >= n2
-          PC PFin | [n] <- ns -> n /= Inf
-          -- TODO: instantiate UniqueFactorization for Nat'?
-          -- PC PPrime | [n] <- ns -> isJust (isPrime n) 
-          PC PTrue -> True
-          _ -> evalPanic "evalProp" ["cannot use this as a guarding constraint: ", show . pp $ prop ]
-  _ -> evalPanic "evalProp" ["cannot use this as a guarding constraint: ", show . pp $ prop ]
+-- | Checks whether an evaluated `Prop` holds
+checkProp :: Prop -> Bool
+checkProp = \case
+  TCon tcon ts ->
+    let ns = toNat' <$> ts in
+    case tcon of
+      PC PEqual | [n1, n2] <- ns -> n1 == n2
+      PC PNeq | [n1, n2] <- ns -> n1 /= n2
+      PC PGeq | [n1, n2] <- ns -> n1 >= n2
+      PC PFin | [n] <- ns -> n /= Inf
+      -- TODO: instantiate UniqueFactorization for Nat'?
+      -- PC PPrime | [n] <- ns -> isJust (isPrime n) 
+      PC PTrue -> True
+      pc -> evalPanic "evalProp" ["cannot use this as a guarding constraint: ", show . pp $ TCon tcon ts ]
+  prop -> evalPanic "evalProp" ["cannot use this as a guarding constraint: ", show . pp $ prop ]
+  where
+    toNat' :: Prop -> Nat'
+    toNat' = \case
+      TCon (TC (TCNum n)) [] -> Nat n
+      TCon (TC TCInf) [] -> Inf
+      prop -> panic "checkProp" ["Expected `" ++ pretty prop ++ "` to be an evaluated numeric type"]
+
+
+-- | Evaluates a `Prop` in an `EvalEnv` by substituting all variables according
+-- to `envTypes` and expanding all type synonyms via `tNoUser`.
+evalProp :: GenEvalEnv sym -> Prop -> Prop
+evalProp env@EvalEnv { envTypes } = \case
+  TCon tc tys -> TCon tc (toType . evalType envTypes <$> tys)
+  TVar tv -> case lookupTypeVar tv envTypes of
+    Nothing -> panic "evalProp" ["Could not find type variable `" ++ pretty tv ++ "` in the type evaluation environment"]
+    Just either_nat'_tval -> toType either_nat'_tval
+  prop@TUser {} -> evalProp env (tNoUser prop)
+  prop -> panic "evalProp" ["Cannot use the following as a type constraint: `" ++ pretty prop ++ "`"]
+  where
+    toType = either tNumTy tValTy
 
 -- | Capure the current call stack from the evaluation monad and
 --   annotate function values.  When arguments are later applied
diff --git a/src/Cryptol/Eval/Type.hs b/src/Cryptol/Eval/Type.hs
index e757b9e80..428689445 100644
--- a/src/Cryptol/Eval/Type.hs
+++ b/src/Cryptol/Eval/Type.hs
@@ -27,7 +27,7 @@ import Control.DeepSeq
 -- | An evaluated type of kind *.
 -- These types do not contain type variables, type synonyms, or type functions.
 data TValue
-  = TVBit                     -- ^ @ Bit @
+  = TVBit                     -- ^ @ Bit @  
   | TVInteger                 -- ^ @ Integer @
   | TVFloat Integer Integer   -- ^ @ Float e p @
   | TVIntMod Integer          -- ^ @ Z n @
diff --git a/src/Cryptol/TypeCheck/TCon.hs b/src/Cryptol/TypeCheck/TCon.hs
index f4a8df4e9..ab3b5ee91 100644
--- a/src/Cryptol/TypeCheck/TCon.hs
+++ b/src/Cryptol/TypeCheck/TCon.hs
@@ -1,4 +1,5 @@
 {-# Language OverloadedStrings, DeriveGeneric, DeriveAnyClass, Safe #-}
+{-# LANGUAGE LambdaCase #-}
 module Cryptol.TypeCheck.TCon where
 
 import qualified Data.Map as Map
diff --git a/tests/constraint-guards/Len.cry b/tests/constraint-guards/Len.cry
new file mode 100644
index 000000000..fcb655d0c
--- /dev/null
+++ b/tests/constraint-guards/Len.cry
@@ -0,0 +1,16 @@
+len : {n,a} (fin n) => [n] a -> Integer
+len x
+  | (n == 0) => 0
+  | (n >  0) => 1 + len (drop`{1} x)
+
+property 
+  len_correct = and
+    [ len l == length l where l = []
+    , len l == length l where l = [1]
+    , len l == length l where l = [1,2]
+    , len l == length l where l = [1,2,3]
+    , len l == length l where l = [1,2,3,4,5]
+    , len l == length l where l = [1,2,3,4,5,6]
+    , len l == length l where l = [1,2,3,4,5,6,7]
+    , len l == length l where l = [1,2,3,4,5,6,7,8]
+    ]
\ No newline at end of file
diff --git a/tests/constraint-guards/Test2.cry b/tests/constraint-guards/Test2.cry
deleted file mode 100644
index fe758868b..000000000
--- a/tests/constraint-guards/Test2.cry
+++ /dev/null
@@ -1,6 +0,0 @@
-// WHY isn't n in scope during evaluation? it typechecks just fine
-len : {n, a} (fin n) => [n]a -> Integer
-len x
-  | (n == 0) => 0
-  | (n >= 1) => 1 + len (drop`{1} x)
-

From b5b92c01b6d5b753ba5dd13fb2c6e6bfd940db2d Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Tue, 9 Aug 2022 17:54:17 -0700
Subject: [PATCH 037/125] comment about anticipated change in new module system

---
 src/Cryptol/ModuleSystem/InstantiateModule.hs | 4 +++-
 1 file changed, 3 insertions(+), 1 deletion(-)

diff --git a/src/Cryptol/ModuleSystem/InstantiateModule.hs b/src/Cryptol/ModuleSystem/InstantiateModule.hs
index 8e1aa3318..abd479fbe 100644
--- a/src/Cryptol/ModuleSystem/InstantiateModule.hs
+++ b/src/Cryptol/ModuleSystem/InstantiateModule.hs
@@ -217,7 +217,9 @@ instance Inst Expr where
         EProofApp e               -> EProofApp (go e)
         EWhere e ds               -> EWhere (go e) (inst env ds)
 
-        EPropGuards _guards       -> EPropGuards undefined -- TODO
+        -- this doesn't exist in the new module system, so it will have to be
+        -- implemented differently there anyway
+        EPropGuards _guards       -> EPropGuards undefined 
 
 
 instance Inst DeclGroup where

From c1812dfa61b198218b7e9c0f7f71967a13157aa7 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Tue, 9 Aug 2022 17:54:50 -0700
Subject: [PATCH 038/125] shouldn't commit this

---
 src/Cryptol/Parser.hs | 3995 -----------------------------------------
 1 file changed, 3995 deletions(-)
 delete mode 100644 src/Cryptol/Parser.hs

diff --git a/src/Cryptol/Parser.hs b/src/Cryptol/Parser.hs
deleted file mode 100644
index d11510b90..000000000
--- a/src/Cryptol/Parser.hs
+++ /dev/null
@@ -1,3995 +0,0 @@
-{-# OPTIONS_GHC -w #-}
-{-# OPTIONS -cpp #-}
--- |
--- Module      :  Cryptol.Parser
--- Copyright   :  (c) 2013-2016 Galois, Inc.
--- License     :  BSD3
--- Maintainer  :  cryptol@galois.com
--- Stability   :  provisional
--- Portability :  portable
-
-{-# LANGUAGE OverloadedStrings #-}
-{-# LANGUAGE Trustworthy #-}
-module Cryptol.Parser
-  ( parseModule
-  , parseProgram, parseProgramWith
-  , parseExpr, parseExprWith
-  , parseDecl, parseDeclWith
-  , parseDecls, parseDeclsWith
-  , parseLetDecl, parseLetDeclWith
-  , parseRepl, parseReplWith
-  , parseSchema, parseSchemaWith
-  , parseModName, parseHelpName
-  , ParseError(..), ppError
-  , Layout(..)
-  , Config(..), defaultConfig
-  , guessPreProc, PreProc(..)
-  ) where
-
-import           Control.Applicative as A
-import           Data.Maybe(fromMaybe)
-import           Data.List.NonEmpty ( NonEmpty(..), cons )
-import           Data.Text(Text)
-import qualified Data.Text as T
-import           Control.Monad(liftM2,msum)
-
-import Cryptol.Parser.AST
-import Cryptol.Parser.Position
-import Cryptol.Parser.LexerUtils hiding (mkIdent)
-import Cryptol.Parser.Token
-import Cryptol.Parser.ParserUtils
-import Cryptol.Parser.Unlit(PreProc(..), guessPreProc)
-import Cryptol.Utils.Ident(paramInstModName)
-import Cryptol.Utils.RecordMap(RecordMap)
-
-import Paths_cryptol
-import qualified Data.Array as Happy_Data_Array
-import qualified Data.Bits as Bits
-import qualified System.IO as Happy_System_IO
-import qualified System.IO.Unsafe as Happy_System_IO_Unsafe
-import qualified Debug.Trace as Happy_Debug_Trace
-import Control.Applicative(Applicative(..))
-import Control.Monad (ap)
-
--- parser produced by Happy Version 1.20.0
-
-data HappyAbsSyn 
-	= HappyTerminal (Located Token)
-	| HappyErrorToken Prelude.Int
-	| HappyAbsSyn15 (Module PName)
-	| HappyAbsSyn17 ([TopDecl PName])
-	| HappyAbsSyn18 (Located (ImportG (ImpName PName)))
-	| HappyAbsSyn19 (Located (ImpName PName))
-	| HappyAbsSyn20 (Maybe (Located ModName))
-	| HappyAbsSyn21 (Maybe (Located ImportSpec))
-	| HappyAbsSyn22 ([LIdent])
-	| HappyAbsSyn23 ([Ident] -> ImportSpec)
-	| HappyAbsSyn24 (Program PName)
-	| HappyAbsSyn34 (TopDecl PName)
-	| HappyAbsSyn35 (Located Text)
-	| HappyAbsSyn36 (Maybe (Located Text))
-	| HappyAbsSyn37 ([([Prop PName], Expr PName)])
-	| HappyAbsSyn40 ([Prop PName])
-	| HappyAbsSyn41 (Decl PName)
-	| HappyAbsSyn42 ([Decl PName])
-	| HappyAbsSyn44 (Newtype PName)
-	| HappyAbsSyn45 (Located (RecordMap Ident (Range, Type PName)))
-	| HappyAbsSyn46 ([ LPName ])
-	| HappyAbsSyn47 (LPName)
-	| HappyAbsSyn48 ([Pattern PName])
-	| HappyAbsSyn51 (([Pattern PName], [Pattern PName]))
-	| HappyAbsSyn56 (ReplInput PName)
-	| HappyAbsSyn61 ([LPName])
-	| HappyAbsSyn62 (Expr PName)
-	| HappyAbsSyn64 (Located [Decl PName])
-	| HappyAbsSyn68 ([(Expr PName, Expr PName)])
-	| HappyAbsSyn69 ((Expr PName, Expr PName))
-	| HappyAbsSyn74 (NonEmpty (Expr PName))
-	| HappyAbsSyn78 (Located Selector)
-	| HappyAbsSyn79 ([(Bool, Integer)])
-	| HappyAbsSyn80 ((Bool, Integer))
-	| HappyAbsSyn81 ([Expr PName])
-	| HappyAbsSyn82 (Either (Expr PName) [Named (Expr PName)])
-	| HappyAbsSyn83 ([UpdField PName])
-	| HappyAbsSyn84 (UpdField PName)
-	| HappyAbsSyn85 ([Located Selector])
-	| HappyAbsSyn86 (UpdHow)
-	| HappyAbsSyn88 ([[Match PName]])
-	| HappyAbsSyn89 ([Match PName])
-	| HappyAbsSyn90 (Match PName)
-	| HappyAbsSyn91 (Pattern PName)
-	| HappyAbsSyn95 (Named (Pattern PName))
-	| HappyAbsSyn96 ([Named (Pattern PName)])
-	| HappyAbsSyn97 (Schema PName)
-	| HappyAbsSyn98 (Located [TParam PName])
-	| HappyAbsSyn99 (Located [Prop PName])
-	| HappyAbsSyn101 (Located Kind)
-	| HappyAbsSyn102 (TParam PName)
-	| HappyAbsSyn103 ([TParam PName])
-	| HappyAbsSyn106 (Type PName)
-	| HappyAbsSyn110 ([ Type PName ])
-	| HappyAbsSyn111 (Located [Type PName])
-	| HappyAbsSyn112 ([Type PName])
-	| HappyAbsSyn113 (Named (Type PName))
-	| HappyAbsSyn114 ([Named (Type PName)])
-	| HappyAbsSyn115 (Located Ident)
-	| HappyAbsSyn117 (Located ModName)
-	| HappyAbsSyn119 (Located PName)
-
-happyExpList :: Happy_Data_Array.Array Prelude.Int Prelude.Int
-happyExpList = Happy_Data_Array.listArray (0,3796) ([0,0,0,0,0,0,0,0,16384,0,0,32,8,0,0,0,0,0,0,0,62372,33024,8704,128,16,0,0,0,0,0,0,0,0,0,0,2048,0,0,0,0,0,0,0,0,58352,18432,32800,12584,4144,0,0,0,0,0,0,0,2048,487,258,68,32769,0,0,0,0,0,0,0,16384,3896,2064,544,8,0,0,0,0,0,0,0,0,0,0,0,128,0,0,0,0,0,0,0,0,49152,67,0,0,0,0,0,0,0,0,0,0,29176,9758,16400,6292,24,0,0,0,0,0,0,0,36416,3,129,32802,0,0,0,0,0,0,0,0,24576,28,8,8192,0,0,0,0,0,0,0,0,0,227,64,224,65024,3,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,14528,4096,0,64,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,49152,0,2044,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1816,512,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,50976,32769,64,16401,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,32,0,0,0,0,0,0,0,0,0,0,3072,49280,63,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,58368,56,2064,544,8,0,0,0,0,0,0,0,8192,455,16512,4352,64,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,36416,3,129,32802,0,0,0,0,0,0,0,0,29184,28,1032,316,32708,0,0,0,0,0,0,0,0,225,64,4096,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,24576,512,1022,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,128,0,256,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,36800,3,129,33954,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,32,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,16,0,0,0,0,0,0,0,0,0,0,0,128,0,0,0,0,0,0,0,0,0,0,0,16384,56,272,32,0,0,0,0,0,0,0,0,0,450,16512,4352,64,0,0,0,0,0,0,0,0,3647,1152,34818,786,3,0,0,0,0,0,0,0,29176,9216,16432,6292,24,0,0,0,0,0,0,0,36800,8195,32897,50343,4088,0,0,0,0,0,0,0,32256,28,1032,10000,4,0,0,0,0,0,0,0,4096,0,64,16384,0,0,0,0,0,0,0,0,32768,1816,512,17408,0,0,0,0,0,0,0,0,0,14400,4096,8200,2050,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16128,32782,516,4744,3,0,0,0,0,0,0,0,63488,113,4132,37952,24,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,512,0,0,0,0,0,0,0,57600,16444,32800,40968,0,0,0,0,0,0,0,0,0,0,0,32,0,0,0,0,0,0,0,0,0,0,0,32896,0,0,0,0,0,0,0,0,0,450,16512,4352,64,33,0,0,0,0,0,0,0,52752,1027,34818,512,0,0,0,0,0,0,0,0,0,0,0,64,32,0,0,0,0,0,0,0,0,0,32768,1,1272,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,32768,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,32,0,0,0,0,0,0,0,0,0,0,0,4096,14,68,8,0,0,0,0,0,0,0,0,32768,112,12320,1088,16,0,0,0,0,0,0,0,0,900,33024,10112,63616,7,0,0,0,0,0,0,0,7200,2048,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,32768,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,32,0,0,0,0,0,0,0,57104,1027,34818,2560,64,0,0,0,0,0,0,0,0,0,0,0,2048,0,0,0,0,0,0,0,41984,243,129,32802,4096,0,0,0,0,0,0,0,0,0,0,128,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,32768,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1024,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,64,0,0,0,0,0,0,0,48672,2055,4100,1025,128,0,0,0,0,0,0,0,0,0,0,32768,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,256,64,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16384,0,0,0,0,0,0,0,8192,1980,1032,272,4,0,0,0,0,0,0,0,0,16904,513,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14528,4160,0,64,0,0,0,0,0,0,0,0,0,0,0,32768,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,33668,256,512,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,32,12,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4096,128,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,0,0,0,0,0,0,0,0,0,0,0,512,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,256,0,0,0,0,0,0,0,0,0,0,0,6144,0,0,0,0,0,0,0,0,0,0,0,0,128,16,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,48,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,900,33024,9728,128,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,64,2,0,0,0,0,0,0,0,0,0,0,512,16,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,192,64512,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,28800,8192,16384,64,0,0,0,0,0,0,0,0,33792,3,1,2,0,0,0,0,0,0,0,0,8192,28,8,0,0,0,0,0,0,0,0,0,0,0,0,96,65024,1,0,0,0,0,0,0,0,0,0,768,61440,15,0,0,0,0,0,0,0,0,0,6144,32768,127,0,0,0,0,0,0,0,49664,32769,64,16401,0,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,32768,112,4128,1088,16,0,0,0,0,0,0,0,0,0,0,4096,0,0,0,0,0,0,0,0,0,7200,2048,4100,1025,16,0,0,0,0,0,0,0,0,0,0,128,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16384,56,2064,544,8,0,0,0,0,0,0,0,0,450,128,256,0,0,0,0,0,0,0,0,0,3641,1024,34818,512,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,128,48,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,64,0,128,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4096,0,8192,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,32768,112,4128,1088,18,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7296,7,258,68,1,0,0,0,0,0,0,0,58368,56,2064,1568,8,0,0,0,0,0,0,0,0,0,0,32768,1024,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,32,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16,0,0,0,0,0,0,0,0,0,0,0,32768,0,0,0,0,0,0,0,0,0,0,0,32768,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4096,14,516,136,2050,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,512,0,3,0,0,0,0,0,0,0,0,0,0,0,24,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,57344,455,16528,20736,98,0,0,0,0,0,0,0,0,3647,1152,34818,786,0,0,0,0,0,0,0,0,0,256,3968,1,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,2048,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,144,0,0,0,0,0,0,0,0,0,0,0,2048,1024,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8224,0,0,0,0,0,0,0,0,32768,112,4128,1088,16400,0,0,0,0,0,0,0,0,0,0,0,2,1,0,0,0,0,0,0,0,0,0,3072,49152,39,0,0,0,0,0,0,0,57600,16384,57376,8201,510,0,0,0,0,0,0,0,0,0,0,3,4080,0,0,0,0,0,0,0,16384,56,16,8224,0,0,0,0,0,0,0,0,0,450,128,256,0,0,0,0,0,0,0,0,0,0,0,1536,57344,31,0,0,0,0,0,0,0,0,0,12288,0,255,0,0,0,0,0,0,0,0,0,32768,1,2040,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,51200,113,4128,1088,16,0,0,0,0,0,0,0,0,61440,16,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,18,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1152,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,32768,0,0,0,0,0,0,0,0,0,0,0,0,12,0,0,0,0,0,0,0,0,0,0,0,96,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1800,512,32768,0,0,0,0,0,0,0,0,0,0,0,16,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16384,910,33024,8704,128,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,58256,16384,32800,8200,0,0,0,0,0,0,0,0,7296,7,258,68,1,0,0,0,0,0,0,0,58368,56,2064,544,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1024,0,0,0,0,0,0,0,0,36416,3,129,32802,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2048,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1024,0,256,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,32768,113,32,32768,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,256,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4096,0,0,0,0,0,0,0,0,0,0,0,32768,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2048,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,32768,1820,512,17409,256,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,50976,32769,64,16401,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,51200,113,5152,1088,8720,0,0,0,0,0,0,0,0,900,256,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,57600,16384,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,64,0,0,0,0,0,0,0,0,0,0,0,512,0,0,0,0,0,0,0,0,0,0,0,4096,0,0,0,0,0,0,0,0,0,0,0,6144,32768,127,0,0,0,0,0,0,0,49664,32769,0,257,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,32768,112,32,16448,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7282,2048,4100,1025,0,0,0,0,0,0,0,0,57600,16384,32768,0,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,0,0,16384,56,2064,544,8,0,0,0,0,0,0,0,57344,455,16528,20736,24674,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,0,0,29128,8192,16400,4100,0,0,0,0,0,0,0,0,36800,8195,129,50338,192,0,0,0,0,0,0,0,32256,28,1033,9488,1542,0,0,0,0,0,0,0,61440,227,8264,10368,12337,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14588,4608,8200,3146,12,0,0,0,0,0,0,0,51168,36865,49216,25169,96,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,63488,113,4132,37952,6168,0,0,0,0,0,0,0,49152,911,33056,41472,49348,0,0,0,0,0,0,0,0,7200,2048,4100,1025,0,0,0,0,0,0,0,0,58352,18432,32800,12584,48,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,57344,455,16528,20736,24674,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,29176,8192,16400,4244,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,36864,0,0,0,0,0,0,0,0,61440,227,8256,10368,33,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14588,4096,8200,2122,0,0,0,0,0,0,0,0,32,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2048,0,32,0,0,0,0,0,0,0,0,0,0,0,0,18432,0,0,0,0,0,0,0,0,0,0,0,16384,2,0,0,0,0,0,0,0,0,0,0,0,128,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1152,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4096,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,36800,8195,129,50338,16576,0,0,0,0,0,0,0,8192,1948,1032,272,4,0,0,0,0,0,0,0,0,0,0,0,0,16,0,0,0,0,0,0,0,59144,513,17409,256,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,48,65280,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,58352,18432,32816,12584,48,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16384,56,2064,544,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,256,0,0,0,0,0,0,0,0,0,0,0,0,0,512,0,0,0,0,0,0,0,0,0,0,0,64,0,0,0,0,0,0,0,0,0,0,0,512,0,0,0,0,0,0,0,0,0,0,0,4096,0,0,0,0,0,0,0,0,0,0,0,0,128,0,0,0,0,0,0,0,0,0,0,49152,0,1020,0,0,0,0,0,0,0,4096,14,4,2056,0,0,0,0,0,0,0,0,32768,112,32,16448,0,0,0,0,0,0,0,0,16384,910,33024,8704,128,0,0,0,0,0,0,0,0,7200,2048,4096,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2048,7,258,68,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,450,16512,4352,64,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,29128,8192,16400,4100,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4096,0,0,0,0,0,0,0,0,0,225,8256,2176,32,0,0,0,0,0,0,0,0,1800,512,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,4096,974,516,392,2,1,0,0,0,0,0,0,32768,7792,4128,1088,80,8,0,0,0,0,0,0,0,63428,33024,8704,128,16,0,0,0,0,0,0,0,0,0,0,0,512,0,0,0,0,0,0,0,61696,16445,32800,8200,1024,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,32768,0,0,0,0,0,0,0,0,8192,455,16512,4352,64,0,0,0,0,0,0,0,0,0,0,1536,57344,31,0,0,0,0,0,0,0,0,0,0,0,2560,0,0,0,0,0,0,0,50176,247,129,32802,4096,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1816,512,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,128,0,0,0,0,0,0,0,0,0,0,0,4096,14,4,0,0,0,0,0,0,0,0,0,32768,113,32,0,0,0,0,0,0,0,0,0,0,908,256,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16384,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,40,0,0,0,0,0,0,0,57104,1027,34818,512,64,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,33792,3,1,514,0,0,0,0,0,0,0,0,8192,28,1032,4368,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4096,0,0,0,0,0,0,0,0,0,0,0,50688,32769,0,512,0,0,0,0,0,0,0,0,0,0,0,64,24,0,0,0,0,0,0,0,0,0,0,512,192,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7200,2052,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,4096,0,0,0,0,0,0,0,0,58368,56,2064,544,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,49154,0,0,0,0,0,0,0,0,0,0,0,0,16384,0,0,0,0,0,0,0,8192,1948,1032,784,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,51168,36865,64,25169,96,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,58368,56,2064,544,8,0,0,0,0,0,0,0,0,450,128,256,1,0,0,0,0,0,0,0,0,3641,1024,34818,512,0,0,0,0,0,0,0,0,28800,8192,16384,0,0,0,0,0,0,0,0,0,0,0,32,0,272,0,0,0,0,0,0,0,0,0,0,12,16320,0,0,0,0,0,0,0,61440,227,8264,10368,12337,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1024,0,0,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,32768,112,4128,1088,16,0,0,0,0,0,0,0,0,0,0,1024,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,450,128,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,29128,8192,16400,4100,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,63488,113,4132,37952,6168,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,4096,0,0,0,0,0,0,0,0,0,0,0,32768,49152,0,0,0,0,0,0,0,0,0,0,0,0,32,0,0,0,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,512,0,0,0,0,0,0,0,0,0,0,16384,16,0,0,0,0,0,0,0,0,0,0,0,258,0,0,0,0,0,0,0,0,0,0,0,3088,0,0,0,0,0,0,0,0,0,0,14588,4608,8200,3146,12,0,0,0,0,0,0,0,51168,36865,64,25169,96,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8064,16391,258,35140,385,0,0,0,0,0,0,0,0,32768,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,0,64,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,29184,28,1032,272,4,0,0,0,0,0,0,0,0,225,64,32896,0,0,0,0,0,0,0,0,32768,1820,512,17409,256,0,0,0,0,0,0,0,0,14400,4096,8192,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,29128,8192,16400,4100,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,16,0,0,0,0,0,0,0,61320,513,17409,256,32,0,0,0,0,0,0,0,0,0,0,8192,0,0,0,0,0,0,0,0,0,0,0,32768,0,0,0,0,0,0,0,0,0,0,128,0,1088,0,0,0,0,0,0,0,0,0,1024,0,8704,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,58256,16384,32800,8200,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,58368,56,2064,544,8,0,0,0,0,0,0,0,57344,455,16528,20736,24674,0,0,0,0,0,0,0,0,3647,1152,34818,786,3,0,0,0,0,0,0,0,0,256,0,0,0,0,0,0,0,0,0,0,0,2048,2,0,0,0,0,0,0,0,0,0,0,16384,32,0,0,0,0,0,0,0,0,0,0,0,256,0,0,0,0,0,0,0,0,0,32768,1823,576,17409,33161,1,0,0,0,0,0,0,0,14588,4608,8200,3146,12,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,32768,112,4128,1088,16,0,0,0,0,0,0,0,0,900,33024,8704,128,0,0,0,0,0,0,0,0,7294,2304,4100,1573,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4096,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16,0,0,0,0,0,0,0,0,0,0,0,0,64,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1024,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,128,2,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,58256,16384,32800,8200,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,58368,56,2064,544,8,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,256,0,2176,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,16,0,0,0,0,0,0,0,0,14400,4096,1,0,0,0,0,0,0,0,0,0,0,0,0,0,2048,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,450,16512,4352,65,0,0,0,0,0,0,0,0,3647,1152,34818,786,3,0,0,0,0,0,0,0,28800,8192,16384,64,0,0,0,0,0,0,0,0,0,0,0,32,0,0,0,0,0,0,0,0,0,0,0,128,48,0,0,0,0,0,0,0,0,0,0,1024,384,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4096,14,4,256,0,0,0,0,0,0,0,0,0,0,0,1024,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,7294,2304,4100,1573,6,0,0,0,0,0,0,0,57600,16384,32768,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,3641,1024,34818,512,0,0,0,0,0,0,0,0,29128,8192,16400,4100,0,0,0,0,0,0,0,0,36416,3,129,32802,0,0,0,0,0,0,0,0,0,0,0,32768,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14564,4096,8200,2050,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16128,32782,516,4744,771,0,0,0,0,0,0,0,51200,113,4128,1088,16,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,0,0,16384,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4096,0,0,0,0,0,0,0,0,0,0,64512,56,2066,18976,3084,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,32,0,0,0,0,0,0,0,0,0,0,29176,9216,16400,6292,24,0,0,0,0,0,0,0,36800,8195,129,50338,192,0,0,0,0,0,0,0,0,0,32,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,16,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14592,14,516,136,2,0,0,0,0,0,0,0,0,0,0,0,2,8,0,0,0,0,0,0,0,63428,33024,8704,128,16,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,32768,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,64512,56,2066,18976,3084,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,32,0,0,0,0,0,0,0,0,0,0,0,256,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16384,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,128,0,1088,0,0,0,0,0,0,0,0,0,0,384,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,64,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,144,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,28800,8192,16384,0,0,0,0,0,0,0,0,0,0,0,0,4096,0,0,0,0,0,0,0,0,0,16384,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
-	])
-
-{-# NOINLINE happyExpListPerState #-}
-happyExpListPerState st =
-    token_strs_expected
-  where token_strs = ["error","%dummy","%start_vmodule","%start_program","%start_programLayout","%start_expr","%start_decl","%start_decls","%start_declsLayout","%start_letDecl","%start_repl","%start_schema","%start_modName","%start_helpName","vmodule","module_def","vmod_body","import","impName","mbAs","mbImportSpec","name_list","mbHiding","program","program_layout","top_decls","vtop_decls","vtop_decl","top_decl","private_decls","prim_bind","parameter_decls","par_decls","par_decl","doc","mbDoc","propguards","propguards_cases","propguards_case","propguards_quals","decl","let_decls","let_decl","newtype","newtype_body","vars_comma","var","apats","indices","indices1","apats_indices","opt_apats_indices","decls","vdecls","decls_layout","repl","qop","op","pat_op","other_op","ops","expr","exprNoWhere","whereClause","typedExpr","simpleExpr","longExpr","ifBranches","ifBranch","simpleRHS","longRHS","simpleApp","longApp","aexprs","aexpr","no_sel_aexpr","sel_expr","selector","poly_terms","poly_term","tuple_exprs","rec_expr","field_exprs","field_expr","field_path","field_how","list_expr","list_alts","matches","match","pat","ipat","apat","tuple_pats","field_pat","field_pats","schema","schema_vars","schema_quals","schema_qual","kind","schema_param","schema_params","tysyn_param","tysyn_params","type","infix_type","app_type","atype","atypes","dimensions","tuple_types","field_type","field_types","ident","name","smodName","modName","qname","help_name","tick_ty","field_ty_val","field_ty_vals","NUM","FRAC","STRLIT","CHARLIT","IDENT","QIDENT","SELECTOR","'include'","'import'","'as'","'hiding'","'private'","'parameter'","'property'","'infix'","'infixl'","'infixr'","'type'","'newtype'","'module'","'submodule'","'where'","'let'","'if'","'then'","'else'","'x'","'down'","'by'","'primitive'","'constraint'","'Prop'","'propguards'","'['","']'","'<-'","'..'","'...'","'..<'","'..>'","'|'","'<'","'>'","'('","')'","','","';'","'{'","'}'","'<|'","'|>'","'='","'`'","':'","'->'","'=>'","'\\\\'","'_'","'v{'","'v}'","'v;'","'+'","'*'","'^^'","'-'","'~'","'#'","'@'","OP","QOP","DOC","%eof"]
-        bit_start = st Prelude.* 195
-        bit_end = (st Prelude.+ 1) Prelude.* 195
-        read_bit = readArrayBit happyExpList
-        bits = Prelude.map read_bit [bit_start..bit_end Prelude.- 1]
-        bits_indexed = Prelude.zip bits [0..194]
-        token_strs_expected = Prelude.concatMap f bits_indexed
-        f (Prelude.False, _) = []
-        f (Prelude.True, nr) = [token_strs Prelude.!! nr]
-
-happyActOffsets :: Happy_Data_Array.Array Prelude.Int Prelude.Int
-happyActOffsets = Happy_Data_Array.listArray (0,637) ([-17,511,-49,1130,1415,1415,47,1217,960,2509,560,1150,39,560,0,0,0,0,0,0,0,50,0,0,0,0,0,0,0,0,1833,0,0,0,0,0,0,0,0,0,0,0,50,0,2147,50,2521,2521,0,99,1104,0,0,2534,2579,0,0,2592,866,1174,0,0,79,92,220,0,0,1816,0,0,0,3190,0,1595,0,254,254,0,0,0,0,0,179,310,329,1460,2992,1130,1045,796,1524,6,995,3017,0,1450,1450,283,283,1264,317,77,911,581,124,657,1903,0,372,413,422,1696,2902,1194,1309,0,367,-14,367,633,367,546,402,0,0,429,0,464,0,400,697,416,0,-42,0,0,0,0,1335,1296,0,816,448,465,0,1598,0,490,255,0,150,0,570,508,0,522,38,35,0,233,0,2913,0,110,182,0,1920,1990,863,442,2322,2007,2007,2007,3017,1130,3017,553,1197,555,0,3017,1080,2604,0,0,395,0,3207,0,3224,0,2943,0,0,0,2653,2460,185,0,0,568,0,583,591,671,0,1239,0,684,629,181,345,0,1450,1450,1759,700,695,0,676,166,0,212,1239,158,657,1194,2007,1138,1608,2007,2007,2007,0,0,0,0,0,1130,2653,1217,0,716,0,766,709,3265,693,439,566,0,1362,782,0,2665,0,2678,0,2678,2678,2678,0,0,801,2678,801,0,802,0,-18,837,560,0,870,0,0,878,909,0,3117,894,0,0,2678,0,2678,0,893,2322,0,2322,0,0,0,0,0,0,907,907,907,2007,1527,0,2485,0,2678,1608,941,3017,1130,943,2723,1130,1130,1130,0,1130,987,0,1130,1130,3017,1130,0,0,1130,0,1595,0,800,1595,0,1595,1011,0,17,840,903,972,0,936,0,996,0,1130,1415,0,1415,0,0,0,2007,990,0,1072,0,3017,0,975,1032,1018,1025,1025,1025,1027,2007,2634,2778,2736,1608,0,3017,0,3017,0,2736,0,1036,3017,2322,0,0,1370,1284,761,0,761,0,1043,2748,2007,1041,761,1103,0,2234,0,1118,2322,2234,560,0,1064,1085,0,1068,761,0,3164,2962,0,0,161,560,492,567,0,1478,1100,1109,2748,0,0,608,0,1390,0,0,0,1130,0,0,0,1106,0,0,2797,3182,2797,1608,-15,2007,1130,1107,0,1154,2797,3017,1136,0,0,0,0,2322,0,2797,0,0,0,0,0,1143,0,1130,0,0,1143,1169,129,1156,1152,0,1164,598,235,393,1130,1130,1181,1181,0,0,0,1130,1181,1158,1159,1170,0,2797,3185,2797,1608,0,1171,0,1188,0,0,0,0,0,0,2797,0,3117,1204,697,1193,1195,-15,-15,1215,0,2797,0,2797,1130,1130,1250,759,503,1248,1130,1130,1249,1130,3017,3017,1130,0,1263,0,1234,0,0,0,0,1247,1236,0,1268,0,342,1241,0,2797,0,2797,1281,0,0,0,-15,1251,1252,1699,1238,0,1238,0,0,0,1269,0,2973,1130,3194,1275,635,743,0,0,0,1537,1275,1303,1130,1783,0,0,1262,2797,2809,2809,1272,0,0,2822,0,1130,2822,1311,1288,0,1319,1130,1319,1319,1130,1130,1326,1341,1341,0,0,2822,1302,697,0,1304,0,1130,1344,1344,1344,0,1344,0,0,0,0,-15,611,0,1344,0,974,0,0,0,1783,1313,1349,0,0,0
-	])
-
-happyGotoOffsets :: Happy_Data_Array.Array Prelude.Int Prelude.Int
-happyGotoOffsets = Happy_Data_Array.listArray (0,637) ([1384,256,1381,1599,155,173,1352,1366,324,2222,748,505,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1023,0,0,0,0,0,0,0,0,0,0,0,0,0,564,0,2384,3364,0,0,836,0,0,915,1014,0,0,2458,791,1457,0,0,0,0,0,0,0,1424,0,0,0,1346,0,288,0,1336,1340,0,0,0,0,0,0,0,0,207,300,1462,692,628,3235,136,710,61,0,3010,3021,0,0,260,0,0,20,401,0,874,0,0,0,0,0,253,2063,417,-12,0,0,0,0,112,0,269,0,0,0,0,0,0,0,0,9,0,0,0,0,0,0,0,403,1367,0,-3,0,0,0,857,0,0,0,0,1360,0,0,0,0,0,0,0,0,0,0,2150,0,0,0,0,989,0,368,488,1310,1651,1739,1768,193,1615,258,0,168,0,0,-8,-23,2309,0,0,0,0,1361,0,1361,0,197,0,0,0,2602,3392,0,0,0,0,0,0,0,0,0,-5,0,0,0,0,0,0,3032,3047,0,0,0,0,0,0,0,0,430,0,923,558,1083,420,724,1913,1999,2086,0,0,0,0,0,2997,2746,946,0,0,0,0,0,0,0,0,0,0,1053,0,0,1000,0,2941,0,3410,846,3424,0,0,0,3378,0,0,0,0,0,0,1127,0,0,0,0,0,0,0,0,0,0,0,3438,0,3452,0,2768,938,0,97,0,0,0,0,0,0,0,0,0,1203,495,0,341,0,3466,479,0,370,1631,0,3258,2826,1533,1686,0,1702,1718,0,1773,1789,986,1805,0,0,1860,0,474,0,1345,561,0,1375,0,0,1347,0,0,0,0,0,0,0,0,2841,405,0,412,0,0,0,1286,0,0,262,0,95,0,0,0,0,0,0,0,0,1294,694,603,3480,667,0,-62,0,70,0,3494,0,0,267,-57,0,0,373,387,203,0,228,0,0,3281,1316,2125,137,1435,0,-37,0,0,880,685,5,0,0,0,0,2198,162,0,812,152,0,0,1111,1168,0,0,0,902,0,0,3304,0,0,0,0,414,0,0,0,1876,0,0,0,0,0,0,3508,729,3522,742,1343,1333,1892,0,0,0,302,397,0,0,0,0,0,433,0,3536,0,0,0,0,0,0,0,1947,0,0,0,0,0,0,0,0,0,0,0,0,1963,1979,0,0,0,0,0,2034,0,0,0,0,0,3550,756,3564,817,0,0,0,0,0,0,0,0,0,0,3578,0,0,0,34,0,0,1355,1364,0,0,3592,0,3606,2050,2066,0,0,0,0,2121,2137,0,2153,41,659,2208,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3620,0,3634,0,0,0,0,1371,0,0,927,1402,0,1461,0,0,0,0,0,399,2224,854,1416,0,0,0,0,0,1528,1417,0,2240,13,0,0,0,3648,3327,3350,0,0,0,3662,0,2295,316,0,0,0,0,2311,0,0,2327,2382,0,0,0,0,0,3676,0,59,0,0,0,2398,0,0,0,0,0,0,0,0,0,1372,0,0,0,0,0,0,0,0,-19,0,0,0,0,0
-	])
-
-happyAdjustOffset :: Prelude.Int -> Prelude.Int
-happyAdjustOffset = Prelude.id
-
-happyDefActions :: Happy_Data_Array.Array Prelude.Int Prelude.Int
-happyDefActions = Happy_Data_Array.listArray (0,637) ([0,0,0,0,0,0,0,0,-135,0,0,0,0,0,-319,-136,-138,-141,-311,-316,-318,0,-306,-317,-309,-310,-308,-307,-147,-148,0,-143,-142,-146,-144,-145,-139,-140,-149,-137,-312,-314,0,-313,0,0,0,0,-265,-258,-280,-282,-285,0,-286,-288,-289,0,0,0,-296,-134,-91,0,-133,-152,-156,0,-177,-163,-155,-178,-174,-175,-179,-181,-182,-183,-184,-185,-186,-187,0,0,0,0,0,0,0,0,0,0,0,0,-188,0,0,0,0,0,0,0,-112,0,0,-242,-114,-90,0,0,0,0,0,0,0,-244,0,0,0,0,0,0,0,-53,-68,0,-51,0,-67,0,0,0,-50,-17,-37,-47,-46,-48,0,0,-40,0,-308,0,-52,0,-35,0,0,-34,0,-256,0,0,-251,0,0,-240,-242,0,-243,0,-245,0,0,-248,0,-311,0,0,0,0,0,0,0,0,0,0,-119,0,-116,0,0,0,-126,-128,0,-132,-178,-173,-178,-172,0,-321,-196,-322,0,0,0,-203,-205,-206,-198,-216,0,-212,-213,-124,-192,-188,0,0,0,-191,-144,-145,-220,-221,0,-194,0,0,-166,0,-112,0,-242,0,0,0,0,0,0,0,-201,-202,-200,-180,-176,0,0,-92,-273,0,-304,0,-271,-262,0,0,0,-292,0,0,-297,-284,-286,0,-283,0,0,0,-266,-264,-260,0,-259,-315,0,-13,0,0,0,-320,-261,-279,-281,0,0,-298,-299,0,-294,-293,0,-291,0,-287,0,0,-295,0,-263,-93,-161,-162,-154,-150,-107,-105,-106,0,0,-277,0,-275,0,0,0,0,0,0,0,0,0,0,-195,0,0,-232,0,0,0,0,-190,-189,0,-197,0,-125,0,0,-193,0,0,-199,0,0,0,-311,-329,0,-324,0,-117,0,0,-131,0,-75,-113,-114,0,-123,-120,0,-122,0,-127,-241,-76,0,-89,-87,-88,0,0,0,0,0,0,-250,0,-249,0,-247,0,-246,-115,0,0,-252,-153,0,0,0,-33,0,-36,0,0,0,-69,0,-23,-21,0,-45,0,0,0,0,-41,-308,0,-14,-69,0,-49,0,0,-42,-20,-30,0,0,0,-61,0,0,0,0,-38,-39,0,-159,0,-157,-257,-255,0,-239,-253,-254,0,-81,-278,0,0,0,0,0,0,0,-118,-78,-79,0,0,0,-129,-130,-165,-323,0,-325,0,-327,-326,-204,-207,-216,-210,-214,0,-217,-218,-211,-208,-208,-219,-234,-236,0,0,-225,-222,0,0,-209,-168,-167,-164,-98,0,-94,0,-115,0,-99,0,0,0,0,-274,-271,-305,-272,-303,-269,-268,-267,-301,-302,0,-290,-300,0,0,0,0,0,0,0,-102,0,-100,0,0,0,-95,0,-224,0,0,0,0,0,0,0,0,-233,-215,-328,0,-330,-115,-121,-70,-72,0,-74,-80,-151,0,0,-84,0,-82,0,-77,-158,-160,-56,0,0,0,0,-69,-59,-69,-54,-22,-19,0,-29,0,0,0,0,0,0,-60,-55,-108,0,0,-44,0,-28,-63,-62,0,0,0,0,-58,-83,-85,0,-276,0,0,-223,-235,-237,-238,0,-228,-226,0,0,0,-97,-96,-101,-103,0,-270,0,-15,0,-104,0,-227,-229,-231,-71,-73,-86,-57,-64,-66,0,0,-27,-43,-109,0,-110,-111,-24,0,-65,-230,-16,-26
-	])
-
-happyCheck :: Happy_Data_Array.Array Prelude.Int Prelude.Int
-happyCheck = Happy_Data_Array.listArray (0,3796) ([-1,4,1,20,22,47,1,1,22,32,59,2,3,32,76,77,78,32,1,61,7,12,13,80,15,16,17,35,33,20,21,36,37,27,52,26,2,3,100,101,31,32,59,100,27,32,12,13,63,15,16,17,67,33,20,21,36,51,72,20,26,2,3,100,101,31,32,104,80,81,78,12,13,78,15,16,17,100,101,20,21,100,101,45,46,26,77,78,100,54,31,32,100,101,33,100,101,100,78,102,103,100,67,102,103,100,59,102,103,100,101,77,78,100,101,3,75,76,77,78,100,101,72,46,12,13,47,15,16,17,35,54,20,21,100,101,77,78,26,78,3,100,101,31,32,35,76,77,78,12,13,22,15,16,17,56,46,20,21,100,101,100,101,26,72,3,37,38,31,32,100,101,11,78,12,13,52,15,16,17,1,26,20,21,87,33,31,32,26,77,78,67,26,31,32,100,101,100,48,26,64,65,34,22,31,32,3,41,47,59,52,38,100,101,77,78,13,35,15,16,17,60,61,20,21,67,45,46,46,26,78,3,77,78,31,32,51,100,101,77,78,13,22,15,16,17,78,62,20,21,77,78,100,101,26,100,101,22,46,31,32,7,100,101,29,9,54,11,100,101,14,78,16,100,101,78,20,21,45,46,77,78,26,14,22,16,26,31,32,20,21,31,32,100,101,26,89,100,101,39,31,32,47,100,101,77,78,100,101,47,48,1,50,51,52,60,61,55,56,57,58,59,60,61,62,23,24,25,100,101,1,31,32,77,78,77,78,77,78,23,24,25,89,76,77,78,77,78,60,61,62,27,28,100,101,72,100,101,100,101,100,101,100,101,47,41,104,100,101,100,101,47,48,1,50,51,52,77,78,55,56,57,58,59,60,61,62,45,100,101,45,46,104,91,92,93,94,55,96,26,100,101,100,101,31,32,104,91,92,93,94,38,96,26,1,22,100,101,31,32,104,28,29,1,100,101,39,26,104,26,89,26,31,32,31,32,31,32,26,72,26,100,47,31,32,31,32,5,78,47,77,78,10,11,12,60,61,89,90,30,43,44,45,33,77,78,36,3,100,27,100,101,72,100,101,78,60,78,77,78,77,78,77,78,45,46,44,100,101,77,78,77,78,76,77,78,79,100,101,100,101,100,101,100,101,100,101,59,78,89,90,0,100,101,100,101,5,100,101,8,100,10,11,12,59,22,15,16,17,18,100,101,29,100,60,61,62,47,27,47,107,30,68,69,70,34,0,42,43,44,45,5,60,61,8,44,10,11,12,48,52,15,16,17,18,5,6,45,89,58,10,11,12,27,100,101,30,89,104,100,34,0,71,72,89,90,5,27,100,101,44,10,11,12,48,100,15,16,17,18,47,43,44,45,58,100,101,52,27,104,105,45,46,53,47,34,46,71,72,49,22,60,61,62,41,44,28,60,61,48,69,70,64,0,76,77,78,79,5,58,49,8,9,10,11,12,13,14,15,16,17,18,19,72,21,47,45,46,100,101,27,100,101,30,100,104,102,34,60,61,42,43,44,45,45,47,48,44,50,51,52,48,47,55,56,57,58,59,60,61,62,58,89,60,66,60,61,0,22,42,43,25,5,100,71,8,9,10,11,12,13,14,15,16,17,18,19,46,21,62,63,64,65,66,27,41,69,30,100,101,35,34,104,74,75,76,77,78,45,47,48,44,50,51,52,48,46,55,56,57,58,59,60,61,62,58,89,60,66,100,101,0,46,54,72,49,5,100,71,8,9,10,11,12,13,14,15,16,17,18,19,22,21,89,90,100,101,28,27,104,47,30,100,101,100,34,104,1,2,3,4,5,6,60,61,44,10,11,12,48,100,101,46,89,104,49,106,35,89,58,24,5,6,27,100,101,10,11,12,100,34,89,71,42,43,44,45,21,42,43,44,45,100,27,48,89,50,45,100,53,102,103,52,57,58,55,100,56,62,63,64,65,66,67,68,69,70,1,5,53,4,5,6,10,11,12,10,11,12,43,44,45,91,92,93,94,46,96,97,49,27,100,101,27,1,104,59,4,5,6,34,89,90,10,11,12,89,44,42,43,44,45,100,35,48,52,5,100,44,45,27,10,11,12,58,32,56,34,62,63,64,65,66,67,68,69,70,44,27,93,94,48,96,89,35,34,100,101,54,46,104,58,49,46,100,44,63,100,101,48,67,1,2,3,4,5,6,44,45,58,10,11,12,27,28,15,16,17,18,68,100,101,46,23,24,49,45,27,1,2,3,4,5,6,34,52,1,10,11,12,5,6,100,101,44,10,11,12,48,94,50,24,1,53,27,100,101,57,58,104,46,34,27,49,52,65,66,100,101,42,43,44,43,44,45,48,98,50,100,44,53,45,67,48,57,58,1,2,3,4,5,6,65,66,22,10,11,12,68,73,74,75,76,77,78,42,43,44,45,24,52,46,27,1,2,3,4,5,6,34,35,54,10,11,12,5,100,101,52,44,10,11,12,48,94,50,24,54,53,27,100,101,57,58,104,33,34,27,94,95,65,66,71,10,100,101,44,6,104,8,48,3,50,59,44,53,43,44,45,57,58,1,2,3,4,5,6,65,66,71,10,11,12,5,59,45,42,43,10,11,12,98,99,100,24,5,6,27,52,55,10,11,12,54,34,27,62,63,64,65,66,67,68,69,44,68,22,27,48,5,50,45,44,53,10,11,12,57,58,46,52,22,42,43,44,65,66,41,46,5,36,27,5,22,10,11,12,10,11,12,52,52,62,63,64,65,66,67,68,69,70,27,52,49,27,54,22,100,34,102,103,34,15,16,17,18,42,43,44,45,23,44,48,55,5,48,43,44,45,10,11,12,58,60,59,58,62,63,64,65,66,67,68,69,0,68,27,52,100,5,102,103,22,34,10,11,12,29,29,15,16,17,18,44,0,22,52,48,41,5,22,27,56,52,10,11,12,58,34,15,16,17,18,22,8,54,54,68,44,71,14,27,48,44,5,19,54,21,34,10,11,12,58,48,60,22,30,55,44,43,44,45,48,22,46,0,27,43,44,45,5,22,58,8,60,10,11,12,13,14,15,16,17,18,19,29,21,55,49,43,44,45,27,22,60,30,22,5,55,34,0,22,10,11,12,5,43,44,45,44,10,11,12,48,0,15,16,17,18,27,0,10,40,58,28,5,29,27,52,63,10,11,12,63,34,15,16,17,18,49,100,49,65,52,44,0,71,27,48,49,5,19,20,21,34,10,11,12,58,86,15,16,17,18,44,60,61,62,48,49,5,86,27,68,69,70,30,30,58,34,86,1,2,3,4,5,6,86,86,44,10,11,12,48,-1,5,42,43,44,45,10,11,12,58,24,100,101,27,-1,104,19,20,21,5,34,-1,-1,27,10,11,12,31,-1,-1,44,-1,18,-1,48,-1,50,-1,-1,53,44,27,-1,57,58,47,48,-1,50,51,52,53,54,55,56,57,58,59,60,61,62,1,2,3,4,5,6,-1,5,-1,10,11,12,10,11,12,-1,-1,5,-1,87,88,-1,10,11,12,-1,27,-1,-1,27,98,99,100,34,-1,-1,-1,100,101,27,-1,104,-1,44,-1,-1,44,48,49,50,-1,-1,53,-1,52,47,48,58,50,51,52,49,54,55,56,57,58,59,60,61,62,1,2,3,4,5,6,-1,5,-1,10,11,12,10,11,12,-1,-1,5,-1,-1,18,-1,10,11,12,-1,27,-1,-1,27,98,99,100,34,-1,-1,-1,100,101,27,-1,104,-1,44,-1,-1,44,48,-1,50,47,48,53,50,51,52,44,58,55,56,57,58,59,60,61,62,47,48,-1,50,51,52,-1,-1,55,56,57,58,59,60,61,62,47,48,-1,50,51,52,-1,-1,55,56,57,58,59,60,61,62,43,44,45,46,-1,100,101,5,-1,104,5,-1,10,11,12,10,11,12,-1,-1,-1,100,101,-1,-1,104,-1,-1,-1,27,-1,-1,27,31,-1,-1,31,100,101,47,48,104,50,51,52,-1,44,55,56,57,58,59,60,61,62,47,48,-1,50,51,52,-1,-1,55,56,57,58,59,60,61,62,47,48,-1,50,51,52,-1,-1,55,56,57,58,59,60,61,62,22,43,44,45,46,100,101,5,-1,104,-1,-1,10,11,12,37,38,39,40,41,-1,100,101,-1,46,104,-1,-1,-1,27,43,44,45,46,-1,-1,-1,100,101,47,48,104,50,51,52,-1,44,55,56,57,58,59,60,61,62,47,48,-1,50,51,52,-1,-1,55,56,57,58,59,60,61,62,47,48,-1,50,51,52,42,43,55,56,57,58,59,60,61,62,-1,-1,54,-1,-1,100,101,42,43,104,62,63,64,65,66,67,68,69,70,-1,-1,100,101,-1,-1,104,-1,62,63,64,65,66,67,68,69,70,-1,100,101,47,48,104,50,51,52,-1,-1,55,56,57,58,59,60,61,62,47,48,-1,50,51,52,-1,-1,55,56,57,58,59,60,61,62,47,48,-1,50,51,52,42,43,55,56,57,58,59,60,61,62,52,43,44,45,46,100,101,42,43,104,62,63,64,65,66,67,-1,69,-1,-1,-1,100,101,-1,-1,104,-1,62,63,64,65,66,67,68,69,-1,-1,100,101,47,48,104,50,51,52,-1,-1,55,56,57,58,59,60,61,62,47,48,-1,50,51,52,-1,-1,55,56,57,58,59,60,61,62,47,48,-1,50,51,52,42,43,55,56,57,58,59,60,61,62,43,44,45,46,-1,100,101,42,43,104,62,63,64,65,66,67,68,69,-1,-1,-1,100,101,-1,-1,104,-1,62,63,64,65,66,67,68,69,-1,-1,100,101,47,48,104,50,51,52,-1,-1,55,56,57,58,59,60,61,62,47,48,-1,50,51,52,-1,-1,55,56,57,58,59,60,61,62,47,48,-1,50,51,52,-1,-1,55,56,57,58,59,60,61,62,43,44,45,46,-1,100,101,-1,-1,104,76,77,78,79,18,19,20,21,-1,-1,-1,100,101,5,6,104,-1,-1,10,11,12,-1,-1,-1,100,101,-1,100,101,47,48,104,50,51,52,27,-1,55,56,57,58,59,60,61,62,47,48,-1,50,51,52,-1,-1,55,56,57,58,59,60,61,62,47,48,-1,50,51,52,-1,-1,55,56,57,58,59,60,61,62,18,19,20,21,-1,100,101,-1,-1,104,76,77,78,79,-1,-1,-1,-1,-1,-1,-1,100,101,5,6,104,-1,-1,10,11,12,-1,-1,-1,100,101,-1,100,101,47,48,104,50,51,52,27,-1,55,56,57,58,59,60,61,62,47,48,-1,50,51,52,-1,-1,55,56,57,58,59,60,61,62,47,48,-1,50,51,52,-1,-1,55,56,57,58,59,60,61,62,-1,82,83,84,85,100,101,-1,-1,104,91,92,93,94,-1,96,-1,-1,-1,100,101,100,101,104,5,104,-1,-1,-1,10,11,12,-1,-1,-1,-1,-1,100,101,47,48,104,50,51,52,-1,27,55,56,57,58,59,60,61,62,47,48,-1,50,51,52,-1,-1,55,56,57,58,59,60,61,62,47,48,-1,50,51,52,-1,-1,55,56,57,58,59,60,61,62,-1,82,83,84,85,100,101,-1,-1,104,91,92,93,94,-1,96,-1,-1,-1,100,101,100,101,104,-1,104,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,100,101,47,48,104,50,51,52,-1,-1,55,56,57,58,59,60,61,62,47,48,-1,50,51,52,-1,-1,55,56,57,58,59,60,61,62,1,-1,-1,4,5,6,-1,84,85,10,11,12,-1,-1,91,92,93,94,-1,96,-1,100,101,100,101,104,27,104,-1,5,-1,-1,-1,34,10,11,12,100,101,-1,-1,104,-1,44,-1,-1,-1,48,49,1,-1,27,4,5,6,-1,-1,58,10,11,12,1,-1,-1,4,5,6,-1,44,-1,10,11,12,-1,1,27,52,4,5,6,-1,-1,34,10,11,12,-1,27,91,92,93,94,44,96,34,-1,48,100,101,-1,27,104,-1,-1,44,-1,58,34,48,-1,-1,-1,-1,-1,-1,-1,-1,44,58,1,-1,48,4,5,6,-1,-1,-1,10,11,12,58,1,-1,-1,4,5,6,-1,-1,-1,10,11,12,1,27,-1,4,5,6,-1,-1,34,10,11,12,-1,-1,27,-1,-1,-1,44,-1,-1,34,48,-1,-1,-1,27,-1,-1,-1,-1,44,58,34,5,48,-1,-1,-1,10,11,12,-1,44,-1,58,-1,48,-1,1,-1,-1,4,5,6,-1,27,58,10,11,12,1,-1,-1,4,5,6,-1,-1,-1,10,11,12,44,1,27,-1,4,5,6,-1,52,34,10,11,12,-1,27,91,92,93,94,44,96,34,-1,48,100,101,-1,27,104,-1,-1,44,-1,58,34,48,-1,-1,-1,-1,-1,-1,-1,-1,44,58,1,-1,48,4,5,6,-1,-1,-1,10,11,12,58,1,-1,-1,4,5,6,-1,-1,-1,10,11,12,1,27,-1,4,5,6,-1,-1,34,10,11,12,-1,-1,27,-1,-1,-1,44,-1,-1,34,48,-1,-1,-1,27,-1,-1,-1,-1,44,58,34,5,48,-1,-1,-1,10,11,12,-1,44,-1,58,-1,48,-1,1,-1,-1,4,5,6,-1,27,58,10,11,12,1,-1,-1,4,5,6,-1,-1,-1,10,11,12,44,1,27,-1,4,5,6,-1,52,34,10,11,12,-1,27,91,92,93,94,44,96,34,-1,48,100,101,-1,27,104,-1,-1,44,86,58,34,48,-1,91,92,93,94,-1,96,-1,44,58,100,101,48,-1,104,-1,48,-1,50,51,52,-1,58,55,56,57,58,59,60,61,62,48,-1,50,51,52,-1,-1,55,56,57,58,59,60,61,62,-1,-1,-1,5,-1,-1,-1,-1,10,11,12,-1,-1,-1,5,-1,-1,-1,-1,10,11,12,100,101,-1,27,104,-1,-1,-1,-1,-1,34,35,-1,-1,27,100,101,-1,-1,104,44,34,5,-1,48,-1,-1,10,11,12,-1,44,45,-1,58,48,-1,-1,-1,-1,-1,5,-1,-1,27,58,10,11,12,-1,-1,34,5,-1,-1,-1,-1,10,11,12,-1,44,-1,27,-1,48,-1,-1,-1,-1,34,5,55,-1,27,58,10,11,12,-1,44,34,-1,-1,48,-1,-1,-1,52,-1,-1,44,-1,27,58,48,5,-1,-1,52,34,10,11,12,-1,58,91,92,93,94,44,96,-1,-1,48,100,101,-1,27,104,-1,-1,-1,52,58,34,55,56,57,58,59,60,61,62,-1,44,52,-1,-1,48,-1,57,58,59,60,61,62,52,-1,58,-1,-1,57,58,59,60,61,62,52,-1,-1,-1,-1,57,58,59,60,61,62,-1,-1,100,101,52,-1,104,-1,-1,57,58,59,60,61,62,100,101,-1,-1,104,-1,-1,-1,-1,-1,-1,100,101,-1,-1,104,-1,-1,-1,-1,-1,-1,100,101,-1,-1,104,-1,-1,22,-1,-1,25,26,-1,28,29,100,101,-1,-1,104,35,36,37,38,39,40,41,42,43,-1,45,46,47,-1,49,-1,-1,5,-1,54,55,56,10,11,12,60,61,62,63,64,65,66,67,68,69,5,-1,72,5,27,10,11,12,10,11,12,-1,5,-1,-1,-1,-1,10,11,12,-1,44,27,-1,-1,27,-1,24,-1,52,-1,-1,-1,-1,27,-1,-1,-1,-1,44,-1,-1,44,-1,24,42,43,52,-1,-1,52,44,-1,-1,-1,-1,-1,54,-1,52,57,24,42,43,-1,62,63,64,65,66,67,68,69,70,54,-1,-1,57,-1,42,43,-1,62,63,64,65,66,67,68,69,70,54,-1,-1,57,-1,-1,-1,-1,62,63,64,65,66,67,68,69,70,60,61,62,-1,-1,-1,-1,67,68,69,70,-1,42,43,-1,-1,-1,47,-1,-1,-1,-1,-1,-1,54,55,56,-1,-1,-1,60,61,62,63,64,65,66,67,68,69,100,101,72,-1,104,82,83,84,85,-1,-1,-1,-1,-1,91,92,93,94,-1,96,-1,-1,-1,100,101,-1,-1,104,82,83,84,85,-1,-1,-1,-1,-1,91,92,93,94,-1,96,-1,-1,-1,100,101,-1,-1,104,82,83,84,85,-1,-1,-1,-1,-1,91,92,93,94,-1,96,-1,-1,-1,100,101,-1,-1,104,82,83,84,85,-1,-1,-1,-1,-1,91,92,93,94,-1,96,-1,-1,-1,100,101,-1,-1,104,82,83,84,85,-1,-1,-1,-1,-1,91,92,93,94,-1,96,-1,-1,85,100,101,-1,-1,104,91,92,93,94,-1,96,-1,-1,85,100,101,-1,-1,104,91,92,93,94,-1,96,-1,-1,-1,100,101,-1,-1,104,91,92,93,94,-1,96,97,-1,-1,100,101,-1,-1,104,-1,-1,107,108,91,92,93,94,-1,96,-1,-1,-1,100,101,-1,-1,104,91,92,93,94,-1,96,-1,-1,-1,100,101,-1,-1,104,91,92,93,94,-1,96,-1,-1,-1,100,101,-1,-1,104,91,92,93,94,-1,96,-1,-1,-1,100,101,-1,-1,104,91,92,93,94,-1,96,-1,-1,-1,100,101,-1,-1,104,91,92,93,94,-1,96,-1,-1,-1,100,101,-1,-1,104,91,92,93,94,-1,96,-1,-1,-1,100,101,-1,-1,104,91,92,93,94,-1,96,-1,-1,-1,100,101,-1,-1,104,91,92,93,94,-1,96,-1,-1,-1,100,101,-1,-1,104,91,92,93,94,-1,96,-1,-1,-1,100,101,-1,-1,104,91,92,93,94,-1,96,-1,-1,-1,100,101,-1,-1,104,91,92,93,94,-1,96,-1,-1,-1,100,101,-1,-1,104,91,92,93,94,-1,96,-1,-1,-1,100,101,-1,-1,104,91,92,93,94,-1,96,-1,-1,-1,100,101,-1,-1,104,91,92,93,94,-1,96,-1,-1,-1,100,101,-1,-1,104,91,92,93,94,-1,96,-1,-1,-1,100,101,-1,-1,104,91,92,93,94,-1,96,-1,-1,-1,100,101,-1,-1,104,91,92,93,94,-1,96,-1,-1,-1,100,101,-1,-1,104,91,92,93,94,-1,96,-1,-1,-1,100,101,-1,-1,104,91,92,93,94,-1,96,-1,-1,-1,100,101,-1,-1,104,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1
-	])
-
-happyTable :: Happy_Data_Array.Array Prelude.Int Prelude.Int
-happyTable = Happy_Data_Array.listArray (0,3796) ([0,394,269,14,272,386,408,201,151,350,120,131,132,636,433,157,158,500,201,388,624,133,134,428,135,136,137,353,178,138,139,329,330,202,273,140,509,132,18,160,101,102,131,153,202,625,133,134,501,135,136,137,502,178,138,139,179,203,-1,14,140,611,132,18,19,101,102,412,151,152,354,133,134,180,135,136,137,18,351,138,139,18,351,378,375,140,104,105,153,377,101,102,18,160,192,18,160,40,180,41,395,40,177,41,270,40,100,41,270,18,106,104,105,18,351,132,595,473,157,158,18,160,-1,183,148,134,242,135,136,137,444,184,138,139,18,106,104,105,140,180,132,18,160,101,102,374,432,157,158,415,134,151,135,136,137,263,375,138,139,18,106,18,160,140,-1,132,531,532,101,102,18,160,566,354,570,134,176,135,136,137,234,116,138,139,494,566,101,102,140,104,105,177,314,101,102,18,160,495,384,100,198,199,356,151,101,102,132,315,-25,385,311,103,18,106,104,105,423,372,135,136,137,-25,-25,138,139,177,326,327,373,140,180,132,104,105,101,102,336,18,106,104,105,422,151,135,136,137,344,337,138,139,104,105,18,160,140,18,106,151,183,101,102,236,18,106,526,120,313,121,18,160,122,361,123,18,106,344,124,125,376,373,104,105,126,147,445,123,185,101,102,124,125,101,102,18,160,126,228,18,160,186,101,102,386,18,106,104,105,167,229,446,65,233,66,67,68,387,388,69,70,71,72,73,74,75,76,538,539,540,18,106,232,223,224,104,105,359,158,104,105,617,539,540,166,429,157,158,104,105,237,75,76,61,62,167,168,-1,18,106,18,160,18,106,18,19,185,63,77,18,160,18,106,64,65,174,66,67,68,225,226,69,70,71,72,73,74,75,76,591,18,19,325,318,77,541,50,51,52,512,53,100,18,106,18,19,101,102,54,541,50,51,52,426,53,185,173,151,18,19,101,102,54,524,525,172,18,19,424,177,77,402,436,451,101,102,101,102,101,102,450,-1,177,305,347,101,102,101,102,23,486,147,104,105,25,26,27,348,349,303,368,146,155,16,17,178,104,105,311,145,305,28,18,160,-1,18,106,537,406,344,104,105,104,105,104,105,286,287,171,18,106,104,105,104,105,156,157,158,159,18,160,18,160,18,106,18,106,18,106,394,180,303,304,108,18,106,18,106,23,18,160,128,305,25,26,27,393,151,109,110,111,112,18,160,602,534,461,75,76,389,28,386,535,-69,467,206,207,113,108,14,15,16,17,23,562,388,128,114,25,26,27,115,380,109,110,111,112,23,44,379,488,116,25,26,27,28,18,19,-69,366,77,305,113,108,129,-32,303,491,23,28,167,367,114,25,26,27,115,305,109,110,111,112,359,308,16,17,116,18,19,356,28,20,21,284,285,45,559,113,381,129,-31,382,151,461,75,76,334,114,527,560,561,115,463,207,335,108,156,157,158,159,23,116,333,-69,142,25,26,143,144,-69,109,110,111,112,-69,-1,-69,347,632,633,18,160,28,18,19,-69,40,77,267,113,553,349,210,15,16,17,328,211,65,114,66,67,68,115,386,69,70,71,72,73,74,75,76,116,436,150,212,574,388,108,151,29,30,316,23,305,129,-69,142,25,26,143,144,-69,109,110,111,112,-69,332,-69,32,33,34,35,36,28,329,39,-69,18,19,317,113,77,594,472,473,157,158,288,216,65,114,66,67,68,115,318,69,70,71,72,73,74,75,76,116,434,-18,217,18,160,108,292,289,218,293,23,305,129,-69,142,25,26,143,144,-69,109,110,111,112,-69,151,-69,303,438,18,19,603,28,409,559,-69,18,19,305,113,77,79,80,81,82,23,24,573,561,114,25,26,27,115,18,19,290,301,193,291,194,281,436,116,88,23,44,28,167,302,25,26,27,305,89,545,129,248,15,16,17,397,29,30,90,214,305,28,91,436,92,274,40,93,41,42,466,94,95,467,305,263,32,33,34,215,216,37,38,39,40,56,23,45,57,23,24,25,26,27,25,26,27,260,16,17,249,50,51,52,287,53,250,459,28,18,19,28,56,54,509,57,23,24,58,303,568,25,26,27,513,171,29,30,59,252,305,507,253,370,23,305,174,17,28,25,26,27,61,500,263,58,32,33,34,35,36,37,38,39,40,59,28,276,52,253,53,436,506,113,18,19,505,285,54,61,458,443,305,162,501,18,389,115,502,79,80,81,82,23,24,309,17,116,25,26,27,293,62,83,84,85,86,182,18,410,455,87,88,456,488,28,79,80,81,82,23,24,89,485,196,25,26,27,23,24,18,556,90,25,26,27,91,258,92,88,461,93,28,18,19,94,95,256,290,89,28,631,457,96,97,18,582,478,479,90,370,16,17,91,496,92,281,197,93,454,177,198,94,95,79,80,81,82,23,24,96,97,151,25,26,27,449,470,471,472,473,157,158,268,15,16,17,88,444,443,28,79,80,81,82,23,24,89,220,442,25,26,27,23,18,160,431,90,25,26,27,91,279,92,88,422,93,28,18,19,94,95,256,448,89,28,254,255,96,97,129,415,18,19,90,563,256,564,91,412,92,408,353,93,307,16,17,94,95,79,80,81,82,23,24,96,97,129,25,26,27,23,407,556,29,30,25,26,27,244,245,281,88,23,24,28,550,262,25,26,27,555,89,28,32,33,34,35,36,37,38,39,90,449,151,28,91,23,92,537,171,93,25,26,27,94,95,332,307,151,29,30,31,96,97,530,529,23,528,28,23,151,25,26,27,25,26,27,520,519,32,33,34,35,36,37,38,39,40,28,518,248,28,513,511,40,113,41,507,113,83,84,85,86,29,30,162,163,87,162,115,512,23,115,493,16,17,25,26,27,116,611,610,116,32,33,34,35,36,37,38,39,108,358,28,608,40,23,41,562,151,113,25,26,27,601,598,109,110,111,112,162,108,151,457,115,593,23,151,28,592,590,25,26,27,116,113,109,110,111,112,151,399,586,585,182,114,129,400,28,115,580,23,401,624,402,113,25,26,27,116,576,188,151,146,512,114,449,16,17,115,151,529,108,28,440,16,17,23,151,116,-68,426,25,26,404,405,-68,109,110,111,112,-68,614,-68,512,155,419,16,17,28,151,636,-68,151,23,512,113,108,151,25,26,27,23,543,16,17,114,25,26,27,115,129,109,110,111,112,28,108,118,98,116,97,23,397,28,238,236,25,26,27,234,113,109,110,111,112,382,365,283,459,238,114,108,464,28,115,428,23,581,124,418,113,25,26,27,116,544,109,110,111,112,114,461,75,76,115,552,413,608,28,462,206,207,574,627,116,113,497,79,80,81,82,23,24,586,633,114,25,26,27,115,0,23,239,15,16,17,25,26,27,116,88,18,19,28,0,77,580,124,418,23,89,0,0,28,25,26,27,231,0,0,90,0,558,0,91,0,92,0,0,93,171,28,0,94,95,220,65,0,66,67,68,221,222,69,70,71,72,73,74,75,76,79,80,81,82,23,24,0,23,0,25,26,27,25,26,27,0,0,23,0,242,243,0,25,26,27,0,28,0,0,28,244,245,246,89,0,0,0,18,19,28,0,77,0,90,0,0,171,91,209,92,0,0,93,0,493,220,65,210,66,67,68,630,481,69,70,71,72,73,74,75,76,79,80,81,82,23,24,0,23,0,25,26,27,25,26,27,0,0,23,0,0,391,0,25,26,27,0,28,0,0,28,244,628,281,89,0,0,0,18,19,28,0,77,0,90,0,0,392,91,0,92,117,65,93,66,67,68,171,95,69,70,71,72,73,74,75,76,360,65,0,66,67,68,0,0,69,70,71,72,73,74,75,76,485,65,0,66,67,68,0,0,69,70,71,72,73,74,75,76,297,16,17,364,0,18,19,23,0,77,23,0,25,26,27,25,26,27,0,0,0,18,19,0,0,77,0,0,0,28,0,0,28,170,0,0,584,18,19,480,65,77,66,67,68,0,171,69,70,71,72,73,74,75,76,479,65,0,66,67,68,0,0,69,70,71,72,73,74,75,76,476,65,0,66,67,68,0,0,69,70,71,72,73,74,75,76,151,297,16,17,363,18,19,23,0,77,0,0,25,26,27,319,320,321,322,323,0,18,19,0,324,77,0,0,0,28,297,16,17,362,0,0,0,18,19,475,65,77,66,67,68,0,353,69,70,71,72,73,74,75,76,474,65,0,66,67,68,0,0,69,70,71,72,73,74,75,76,469,65,0,66,67,68,29,30,69,70,71,72,73,74,75,76,0,0,241,0,0,18,19,29,30,77,32,33,34,35,36,37,38,39,40,0,0,18,19,0,0,77,0,32,33,34,35,36,37,38,39,40,0,18,19,468,65,77,66,67,68,0,0,69,70,71,72,73,74,75,76,550,65,0,66,67,68,0,0,69,70,71,72,73,74,75,76,542,65,0,66,67,68,-243,-243,69,70,71,72,73,74,75,76,-243,297,16,17,300,18,19,29,30,77,-243,-243,-243,-243,-243,-243,0,-243,0,0,0,18,19,0,0,77,0,32,33,34,35,36,37,38,39,0,0,18,19,532,65,77,66,67,68,0,0,69,70,71,72,73,74,75,76,522,65,0,66,67,68,0,0,69,70,71,72,73,74,75,76,521,65,0,66,67,68,-275,-275,69,70,71,72,73,74,75,76,297,16,17,299,0,18,19,29,30,77,-275,-275,-275,-275,-275,-275,-275,-275,0,0,0,18,19,0,0,77,0,32,33,34,35,36,37,38,39,0,0,18,19,520,65,77,66,67,68,0,0,69,70,71,72,73,74,75,76,604,65,0,66,67,68,0,0,69,70,71,72,73,74,75,76,603,65,0,66,67,68,0,0,69,70,71,72,73,74,75,76,297,16,17,298,0,18,19,0,0,77,163,157,158,164,416,417,124,418,0,0,0,18,19,23,44,77,0,0,25,26,27,0,0,0,18,160,0,18,19,599,65,77,66,67,68,28,0,69,70,71,72,73,74,75,76,598,65,0,66,67,68,0,0,69,70,71,72,73,74,75,76,596,65,0,66,67,68,0,0,69,70,71,72,73,74,75,76,571,417,124,418,0,18,19,0,0,77,156,157,158,159,0,0,0,0,0,0,0,18,19,23,24,77,0,0,25,26,27,0,0,0,18,160,0,18,19,593,65,77,66,67,68,28,0,69,70,71,72,73,74,75,76,577,65,0,66,67,68,0,0,69,70,71,72,73,74,75,76,626,65,0,66,67,68,0,0,69,70,71,72,73,74,75,76,0,45,46,47,48,18,19,0,0,77,49,50,51,52,0,53,0,0,0,18,19,18,19,54,23,77,0,0,0,25,26,27,0,0,0,0,0,18,19,618,65,77,66,67,68,0,28,69,70,71,72,73,74,75,76,616,65,0,66,67,68,0,0,69,70,71,72,73,74,75,76,615,65,0,66,67,68,0,0,69,70,71,72,73,74,75,76,0,349,46,47,48,18,19,0,0,77,49,50,51,52,0,53,0,0,0,18,19,18,19,54,0,77,0,0,0,0,0,0,0,0,0,0,0,18,19,614,65,77,66,67,68,0,0,69,70,71,72,73,74,75,76,634,65,0,66,67,68,0,0,69,70,71,72,73,74,75,76,56,0,0,57,23,24,0,265,48,25,26,27,0,0,266,50,51,52,0,53,0,18,19,18,19,77,28,54,0,23,0,0,0,58,25,26,27,18,19,0,0,77,0,59,0,0,0,253,343,56,0,28,57,23,24,0,0,61,25,26,27,56,0,0,57,23,24,0,171,0,25,26,27,0,56,28,491,57,23,24,0,0,58,25,26,27,0,28,253,50,51,52,59,53,58,0,60,18,19,0,28,54,0,0,59,0,61,260,253,0,0,0,0,0,0,0,0,59,61,56,0,253,57,23,24,0,0,0,25,26,27,61,56,0,0,57,23,24,0,0,0,25,26,27,56,28,0,57,23,24,0,0,258,25,26,27,0,0,28,0,0,0,59,0,0,58,253,0,0,0,28,0,0,0,0,59,61,58,23,253,0,0,0,25,26,27,0,59,0,61,0,60,0,56,0,0,57,23,24,0,28,61,25,26,27,56,0,0,57,23,24,0,0,0,25,26,27,171,56,28,0,57,23,24,0,440,58,25,26,27,0,28,343,50,51,52,59,53,258,0,253,18,19,0,28,54,0,0,59,0,61,58,253,0,0,0,0,0,0,0,0,59,61,56,0,253,57,23,24,0,0,0,25,26,27,61,56,0,0,57,23,24,0,0,0,25,26,27,56,28,0,57,23,24,0,0,58,25,26,27,0,0,28,0,0,0,59,0,0,58,60,0,0,0,28,0,0,0,0,59,61,58,23,253,0,0,0,25,26,27,0,59,0,61,0,60,0,56,0,0,57,23,24,0,28,61,25,26,27,56,0,0,57,23,24,0,0,0,25,26,27,171,56,28,0,57,23,24,0,438,58,25,26,27,0,28,294,50,51,52,59,53,58,0,253,18,19,0,28,54,0,0,59,497,61,58,60,0,498,50,51,52,0,53,0,59,61,18,19,253,0,54,0,482,0,66,67,68,0,61,69,70,71,72,73,74,75,76,452,0,66,67,68,0,0,69,70,71,72,73,74,75,76,0,0,0,23,0,0,0,0,25,26,27,0,0,0,23,0,0,0,0,25,26,27,18,19,0,28,77,0,0,0,0,0,113,166,0,0,28,18,19,0,0,77,162,113,23,0,115,0,0,25,26,27,0,162,163,0,116,115,0,0,0,0,0,23,0,0,28,116,25,26,27,0,0,113,23,0,0,0,0,25,26,27,0,162,0,28,0,115,0,0,0,0,113,23,346,0,28,116,25,26,27,0,162,113,0,0,115,0,0,0,568,0,0,162,0,28,116,115,23,0,0,579,113,25,26,27,0,116,278,50,51,52,228,53,0,0,115,18,19,0,28,54,0,0,0,68,116,113,295,296,71,72,73,74,75,76,0,162,68,0,0,115,0,190,191,73,74,75,76,68,0,116,0,0,188,189,73,74,75,76,68,0,0,0,0,190,191,73,74,75,76,0,0,18,19,68,0,77,0,0,188,189,73,74,75,76,18,19,0,0,77,0,0,0,0,0,0,18,19,0,0,77,0,0,0,0,0,0,18,19,0,0,77,0,0,-290,0,0,-290,-290,0,-290,-290,18,19,0,0,77,-290,-290,-290,-290,-290,-290,-290,-290,-290,0,-290,-290,-290,0,-290,0,0,23,0,-290,-290,-290,25,26,27,-290,-290,-290,-290,-290,-290,-290,-290,-290,-290,23,0,-290,23,28,25,26,27,25,26,27,0,23,0,0,0,0,25,26,27,0,171,28,0,0,28,0,88,0,570,0,0,0,0,28,0,0,0,0,171,0,0,171,0,88,-171,-171,548,0,0,516,171,0,0,0,0,0,-171,0,577,94,88,-170,-170,0,-171,-171,-171,-171,-171,-171,-171,-171,-171,-170,0,0,94,0,-169,-169,0,-170,-170,-170,-170,-170,-170,-170,-170,-170,-169,0,0,94,0,0,0,0,-169,-169,-169,-169,-169,-169,-169,-169,-169,203,75,76,0,0,0,0,204,205,206,207,0,-294,-294,0,0,0,-294,0,0,0,0,0,0,-294,-294,-294,0,0,0,-294,-294,-294,-294,-294,-294,-294,-294,-294,-294,18,19,-294,0,77,483,46,47,48,0,0,0,0,0,49,50,51,52,0,53,0,0,0,18,19,0,0,54,420,46,47,48,0,0,0,0,0,49,50,51,52,0,53,0,0,0,18,19,0,0,54,553,46,47,48,0,0,0,0,0,49,50,51,52,0,53,0,0,0,18,19,0,0,54,621,46,47,48,0,0,0,0,0,49,50,51,52,0,53,0,0,0,18,19,0,0,54,620,46,47,48,0,0,0,0,0,49,50,51,52,0,53,0,0,263,18,19,0,0,54,264,50,51,52,0,53,0,0,263,18,19,0,0,54,274,50,51,52,0,53,0,0,0,18,19,0,0,54,337,50,51,52,0,53,338,0,0,339,19,0,0,54,0,0,340,341,277,50,51,52,0,53,0,0,0,18,19,0,0,54,275,50,51,52,0,53,0,0,0,18,19,0,0,54,503,50,51,52,0,53,0,0,0,18,19,0,0,54,502,50,51,52,0,53,0,0,0,18,19,0,0,54,489,50,51,52,0,53,0,0,0,18,19,0,0,54,435,50,51,52,0,53,0,0,0,18,19,0,0,54,431,50,51,52,0,53,0,0,0,18,19,0,0,54,548,50,51,52,0,53,0,0,0,18,19,0,0,54,546,50,51,52,0,53,0,0,0,18,19,0,0,54,533,50,51,52,0,53,0,0,0,18,19,0,0,54,516,50,51,52,0,53,0,0,0,18,19,0,0,54,514,50,51,52,0,53,0,0,0,18,19,0,0,54,498,50,51,52,0,53,0,0,0,18,19,0,0,54,606,50,51,52,0,53,0,0,0,18,19,0,0,54,605,50,51,52,0,53,0,0,0,18,19,0,0,54,588,50,51,52,0,53,0,0,0,18,19,0,0,54,587,50,51,52,0,53,0,0,0,18,19,0,0,54,622,50,51,52,0,53,0,0,0,18,19,0,0,54,619,50,51,52,0,53,0,0,0,18,19,0,0,54,612,50,51,52,0,53,0,0,0,18,19,0,0,54,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
-	])
-
-happyReduceArr = Happy_Data_Array.array (12, 329) [
-	(12 , happyReduce_12),
-	(13 , happyReduce_13),
-	(14 , happyReduce_14),
-	(15 , happyReduce_15),
-	(16 , happyReduce_16),
-	(17 , happyReduce_17),
-	(18 , happyReduce_18),
-	(19 , happyReduce_19),
-	(20 , happyReduce_20),
-	(21 , happyReduce_21),
-	(22 , happyReduce_22),
-	(23 , happyReduce_23),
-	(24 , happyReduce_24),
-	(25 , happyReduce_25),
-	(26 , happyReduce_26),
-	(27 , happyReduce_27),
-	(28 , happyReduce_28),
-	(29 , happyReduce_29),
-	(30 , happyReduce_30),
-	(31 , happyReduce_31),
-	(32 , happyReduce_32),
-	(33 , happyReduce_33),
-	(34 , happyReduce_34),
-	(35 , happyReduce_35),
-	(36 , happyReduce_36),
-	(37 , happyReduce_37),
-	(38 , happyReduce_38),
-	(39 , happyReduce_39),
-	(40 , happyReduce_40),
-	(41 , happyReduce_41),
-	(42 , happyReduce_42),
-	(43 , happyReduce_43),
-	(44 , happyReduce_44),
-	(45 , happyReduce_45),
-	(46 , happyReduce_46),
-	(47 , happyReduce_47),
-	(48 , happyReduce_48),
-	(49 , happyReduce_49),
-	(50 , happyReduce_50),
-	(51 , happyReduce_51),
-	(52 , happyReduce_52),
-	(53 , happyReduce_53),
-	(54 , happyReduce_54),
-	(55 , happyReduce_55),
-	(56 , happyReduce_56),
-	(57 , happyReduce_57),
-	(58 , happyReduce_58),
-	(59 , happyReduce_59),
-	(60 , happyReduce_60),
-	(61 , happyReduce_61),
-	(62 , happyReduce_62),
-	(63 , happyReduce_63),
-	(64 , happyReduce_64),
-	(65 , happyReduce_65),
-	(66 , happyReduce_66),
-	(67 , happyReduce_67),
-	(68 , happyReduce_68),
-	(69 , happyReduce_69),
-	(70 , happyReduce_70),
-	(71 , happyReduce_71),
-	(72 , happyReduce_72),
-	(73 , happyReduce_73),
-	(74 , happyReduce_74),
-	(75 , happyReduce_75),
-	(76 , happyReduce_76),
-	(77 , happyReduce_77),
-	(78 , happyReduce_78),
-	(79 , happyReduce_79),
-	(80 , happyReduce_80),
-	(81 , happyReduce_81),
-	(82 , happyReduce_82),
-	(83 , happyReduce_83),
-	(84 , happyReduce_84),
-	(85 , happyReduce_85),
-	(86 , happyReduce_86),
-	(87 , happyReduce_87),
-	(88 , happyReduce_88),
-	(89 , happyReduce_89),
-	(90 , happyReduce_90),
-	(91 , happyReduce_91),
-	(92 , happyReduce_92),
-	(93 , happyReduce_93),
-	(94 , happyReduce_94),
-	(95 , happyReduce_95),
-	(96 , happyReduce_96),
-	(97 , happyReduce_97),
-	(98 , happyReduce_98),
-	(99 , happyReduce_99),
-	(100 , happyReduce_100),
-	(101 , happyReduce_101),
-	(102 , happyReduce_102),
-	(103 , happyReduce_103),
-	(104 , happyReduce_104),
-	(105 , happyReduce_105),
-	(106 , happyReduce_106),
-	(107 , happyReduce_107),
-	(108 , happyReduce_108),
-	(109 , happyReduce_109),
-	(110 , happyReduce_110),
-	(111 , happyReduce_111),
-	(112 , happyReduce_112),
-	(113 , happyReduce_113),
-	(114 , happyReduce_114),
-	(115 , happyReduce_115),
-	(116 , happyReduce_116),
-	(117 , happyReduce_117),
-	(118 , happyReduce_118),
-	(119 , happyReduce_119),
-	(120 , happyReduce_120),
-	(121 , happyReduce_121),
-	(122 , happyReduce_122),
-	(123 , happyReduce_123),
-	(124 , happyReduce_124),
-	(125 , happyReduce_125),
-	(126 , happyReduce_126),
-	(127 , happyReduce_127),
-	(128 , happyReduce_128),
-	(129 , happyReduce_129),
-	(130 , happyReduce_130),
-	(131 , happyReduce_131),
-	(132 , happyReduce_132),
-	(133 , happyReduce_133),
-	(134 , happyReduce_134),
-	(135 , happyReduce_135),
-	(136 , happyReduce_136),
-	(137 , happyReduce_137),
-	(138 , happyReduce_138),
-	(139 , happyReduce_139),
-	(140 , happyReduce_140),
-	(141 , happyReduce_141),
-	(142 , happyReduce_142),
-	(143 , happyReduce_143),
-	(144 , happyReduce_144),
-	(145 , happyReduce_145),
-	(146 , happyReduce_146),
-	(147 , happyReduce_147),
-	(148 , happyReduce_148),
-	(149 , happyReduce_149),
-	(150 , happyReduce_150),
-	(151 , happyReduce_151),
-	(152 , happyReduce_152),
-	(153 , happyReduce_153),
-	(154 , happyReduce_154),
-	(155 , happyReduce_155),
-	(156 , happyReduce_156),
-	(157 , happyReduce_157),
-	(158 , happyReduce_158),
-	(159 , happyReduce_159),
-	(160 , happyReduce_160),
-	(161 , happyReduce_161),
-	(162 , happyReduce_162),
-	(163 , happyReduce_163),
-	(164 , happyReduce_164),
-	(165 , happyReduce_165),
-	(166 , happyReduce_166),
-	(167 , happyReduce_167),
-	(168 , happyReduce_168),
-	(169 , happyReduce_169),
-	(170 , happyReduce_170),
-	(171 , happyReduce_171),
-	(172 , happyReduce_172),
-	(173 , happyReduce_173),
-	(174 , happyReduce_174),
-	(175 , happyReduce_175),
-	(176 , happyReduce_176),
-	(177 , happyReduce_177),
-	(178 , happyReduce_178),
-	(179 , happyReduce_179),
-	(180 , happyReduce_180),
-	(181 , happyReduce_181),
-	(182 , happyReduce_182),
-	(183 , happyReduce_183),
-	(184 , happyReduce_184),
-	(185 , happyReduce_185),
-	(186 , happyReduce_186),
-	(187 , happyReduce_187),
-	(188 , happyReduce_188),
-	(189 , happyReduce_189),
-	(190 , happyReduce_190),
-	(191 , happyReduce_191),
-	(192 , happyReduce_192),
-	(193 , happyReduce_193),
-	(194 , happyReduce_194),
-	(195 , happyReduce_195),
-	(196 , happyReduce_196),
-	(197 , happyReduce_197),
-	(198 , happyReduce_198),
-	(199 , happyReduce_199),
-	(200 , happyReduce_200),
-	(201 , happyReduce_201),
-	(202 , happyReduce_202),
-	(203 , happyReduce_203),
-	(204 , happyReduce_204),
-	(205 , happyReduce_205),
-	(206 , happyReduce_206),
-	(207 , happyReduce_207),
-	(208 , happyReduce_208),
-	(209 , happyReduce_209),
-	(210 , happyReduce_210),
-	(211 , happyReduce_211),
-	(212 , happyReduce_212),
-	(213 , happyReduce_213),
-	(214 , happyReduce_214),
-	(215 , happyReduce_215),
-	(216 , happyReduce_216),
-	(217 , happyReduce_217),
-	(218 , happyReduce_218),
-	(219 , happyReduce_219),
-	(220 , happyReduce_220),
-	(221 , happyReduce_221),
-	(222 , happyReduce_222),
-	(223 , happyReduce_223),
-	(224 , happyReduce_224),
-	(225 , happyReduce_225),
-	(226 , happyReduce_226),
-	(227 , happyReduce_227),
-	(228 , happyReduce_228),
-	(229 , happyReduce_229),
-	(230 , happyReduce_230),
-	(231 , happyReduce_231),
-	(232 , happyReduce_232),
-	(233 , happyReduce_233),
-	(234 , happyReduce_234),
-	(235 , happyReduce_235),
-	(236 , happyReduce_236),
-	(237 , happyReduce_237),
-	(238 , happyReduce_238),
-	(239 , happyReduce_239),
-	(240 , happyReduce_240),
-	(241 , happyReduce_241),
-	(242 , happyReduce_242),
-	(243 , happyReduce_243),
-	(244 , happyReduce_244),
-	(245 , happyReduce_245),
-	(246 , happyReduce_246),
-	(247 , happyReduce_247),
-	(248 , happyReduce_248),
-	(249 , happyReduce_249),
-	(250 , happyReduce_250),
-	(251 , happyReduce_251),
-	(252 , happyReduce_252),
-	(253 , happyReduce_253),
-	(254 , happyReduce_254),
-	(255 , happyReduce_255),
-	(256 , happyReduce_256),
-	(257 , happyReduce_257),
-	(258 , happyReduce_258),
-	(259 , happyReduce_259),
-	(260 , happyReduce_260),
-	(261 , happyReduce_261),
-	(262 , happyReduce_262),
-	(263 , happyReduce_263),
-	(264 , happyReduce_264),
-	(265 , happyReduce_265),
-	(266 , happyReduce_266),
-	(267 , happyReduce_267),
-	(268 , happyReduce_268),
-	(269 , happyReduce_269),
-	(270 , happyReduce_270),
-	(271 , happyReduce_271),
-	(272 , happyReduce_272),
-	(273 , happyReduce_273),
-	(274 , happyReduce_274),
-	(275 , happyReduce_275),
-	(276 , happyReduce_276),
-	(277 , happyReduce_277),
-	(278 , happyReduce_278),
-	(279 , happyReduce_279),
-	(280 , happyReduce_280),
-	(281 , happyReduce_281),
-	(282 , happyReduce_282),
-	(283 , happyReduce_283),
-	(284 , happyReduce_284),
-	(285 , happyReduce_285),
-	(286 , happyReduce_286),
-	(287 , happyReduce_287),
-	(288 , happyReduce_288),
-	(289 , happyReduce_289),
-	(290 , happyReduce_290),
-	(291 , happyReduce_291),
-	(292 , happyReduce_292),
-	(293 , happyReduce_293),
-	(294 , happyReduce_294),
-	(295 , happyReduce_295),
-	(296 , happyReduce_296),
-	(297 , happyReduce_297),
-	(298 , happyReduce_298),
-	(299 , happyReduce_299),
-	(300 , happyReduce_300),
-	(301 , happyReduce_301),
-	(302 , happyReduce_302),
-	(303 , happyReduce_303),
-	(304 , happyReduce_304),
-	(305 , happyReduce_305),
-	(306 , happyReduce_306),
-	(307 , happyReduce_307),
-	(308 , happyReduce_308),
-	(309 , happyReduce_309),
-	(310 , happyReduce_310),
-	(311 , happyReduce_311),
-	(312 , happyReduce_312),
-	(313 , happyReduce_313),
-	(314 , happyReduce_314),
-	(315 , happyReduce_315),
-	(316 , happyReduce_316),
-	(317 , happyReduce_317),
-	(318 , happyReduce_318),
-	(319 , happyReduce_319),
-	(320 , happyReduce_320),
-	(321 , happyReduce_321),
-	(322 , happyReduce_322),
-	(323 , happyReduce_323),
-	(324 , happyReduce_324),
-	(325 , happyReduce_325),
-	(326 , happyReduce_326),
-	(327 , happyReduce_327),
-	(328 , happyReduce_328),
-	(329 , happyReduce_329)
-	]
-
-happy_n_terms = 73 :: Prelude.Int
-happy_n_nonterms = 109 :: Prelude.Int
-
-happyReduce_12 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_12 = happySpecReduce_2  0 happyReduction_12
-happyReduction_12 (HappyAbsSyn15  happy_var_2)
-	_
-	 =  HappyAbsSyn15
-		 (happy_var_2
-	)
-happyReduction_12 _ _  = notHappyAtAll 
-
-happyReduce_13 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_13 = happySpecReduce_3  0 happyReduction_13
-happyReduction_13 _
-	(HappyAbsSyn17  happy_var_2)
-	_
-	 =  HappyAbsSyn15
-		 (mkAnonymousModule happy_var_2
-	)
-happyReduction_13 _ _ _  = notHappyAtAll 
-
-happyReduce_14 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_14 = happyReduce 5 1 happyReduction_14
-happyReduction_14 (_ `HappyStk`
-	(HappyAbsSyn17  happy_var_4) `HappyStk`
-	_ `HappyStk`
-	_ `HappyStk`
-	(HappyAbsSyn117  happy_var_1) `HappyStk`
-	happyRest)
-	 = HappyAbsSyn15
-		 (mkModule happy_var_1 happy_var_4
-	) `HappyStk` happyRest
-
-happyReduce_15 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_15 = happyReduce 7 1 happyReduction_15
-happyReduction_15 (_ `HappyStk`
-	(HappyAbsSyn17  happy_var_6) `HappyStk`
-	_ `HappyStk`
-	_ `HappyStk`
-	(HappyAbsSyn117  happy_var_3) `HappyStk`
-	_ `HappyStk`
-	(HappyAbsSyn117  happy_var_1) `HappyStk`
-	happyRest)
-	 = HappyAbsSyn15
-		 (mkModuleInstance happy_var_1 happy_var_3 happy_var_6
-	) `HappyStk` happyRest
-
-happyReduce_16 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_16 = happySpecReduce_1  2 happyReduction_16
-happyReduction_16 (HappyAbsSyn17  happy_var_1)
-	 =  HappyAbsSyn17
-		 (reverse happy_var_1
-	)
-happyReduction_16 _  = notHappyAtAll 
-
-happyReduce_17 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_17 = happySpecReduce_0  2 happyReduction_17
-happyReduction_17  =  HappyAbsSyn17
-		 ([]
-	)
-
-happyReduce_18 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_18 = happyReduce 4 3 happyReduction_18
-happyReduction_18 ((HappyAbsSyn21  happy_var_4) `HappyStk`
-	(HappyAbsSyn20  happy_var_3) `HappyStk`
-	(HappyAbsSyn19  happy_var_2) `HappyStk`
-	(HappyTerminal (Located happy_var_1 (Token (KW KW_import)    _))) `HappyStk`
-	happyRest)
-	 = HappyAbsSyn18
-		 (Located { srcRange = rComb happy_var_1
-                                                   $ fromMaybe (srcRange happy_var_2)
-                                                   $ msum [ fmap srcRange happy_var_4
-                                                          , fmap srcRange happy_var_3
-                                                          ]
-                                        , thing    = Import
-                                          { iModule    = thing happy_var_2
-                                          , iAs        = fmap thing happy_var_3
-                                          , iSpec      = fmap thing happy_var_4
-                                          }
-                                        }
-	) `HappyStk` happyRest
-
-happyReduce_19 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_19 = happySpecReduce_2  4 happyReduction_19
-happyReduction_19 (HappyAbsSyn119  happy_var_2)
-	_
-	 =  HappyAbsSyn19
-		 (ImpNested `fmap` happy_var_2
-	)
-happyReduction_19 _ _  = notHappyAtAll 
-
-happyReduce_20 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_20 = happySpecReduce_1  4 happyReduction_20
-happyReduction_20 (HappyAbsSyn117  happy_var_1)
-	 =  HappyAbsSyn19
-		 (ImpTop `fmap` happy_var_1
-	)
-happyReduction_20 _  = notHappyAtAll 
-
-happyReduce_21 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_21 = happySpecReduce_2  5 happyReduction_21
-happyReduction_21 (HappyAbsSyn117  happy_var_2)
-	_
-	 =  HappyAbsSyn20
-		 (Just happy_var_2
-	)
-happyReduction_21 _ _  = notHappyAtAll 
-
-happyReduce_22 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_22 = happySpecReduce_0  5 happyReduction_22
-happyReduction_22  =  HappyAbsSyn20
-		 (Nothing
-	)
-
-happyReduce_23 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_23 = happyReduce 4 6 happyReduction_23
-happyReduction_23 (_ `HappyStk`
-	(HappyAbsSyn22  happy_var_3) `HappyStk`
-	_ `HappyStk`
-	(HappyAbsSyn23  happy_var_1) `HappyStk`
-	happyRest)
-	 = HappyAbsSyn21
-		 (Just Located
-                                  { srcRange = case happy_var_3 of
-                                      { [] -> emptyRange
-                                      ; xs -> rCombs (map srcRange xs) }
-                                  , thing    = happy_var_1 (reverse (map thing happy_var_3))
-                                  }
-	) `HappyStk` happyRest
-
-happyReduce_24 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_24 = happySpecReduce_0  6 happyReduction_24
-happyReduction_24  =  HappyAbsSyn21
-		 (Nothing
-	)
-
-happyReduce_25 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_25 = happySpecReduce_3  7 happyReduction_25
-happyReduction_25 (HappyAbsSyn47  happy_var_3)
-	_
-	(HappyAbsSyn22  happy_var_1)
-	 =  HappyAbsSyn22
-		 (fmap getIdent happy_var_3 : happy_var_1
-	)
-happyReduction_25 _ _ _  = notHappyAtAll 
-
-happyReduce_26 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_26 = happySpecReduce_1  7 happyReduction_26
-happyReduction_26 (HappyAbsSyn47  happy_var_1)
-	 =  HappyAbsSyn22
-		 ([fmap getIdent happy_var_1]
-	)
-happyReduction_26 _  = notHappyAtAll 
-
-happyReduce_27 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_27 = happySpecReduce_0  7 happyReduction_27
-happyReduction_27  =  HappyAbsSyn22
-		 ([]
-	)
-
-happyReduce_28 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_28 = happySpecReduce_1  8 happyReduction_28
-happyReduction_28 _
-	 =  HappyAbsSyn23
-		 (Hiding
-	)
-
-happyReduce_29 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_29 = happySpecReduce_0  8 happyReduction_29
-happyReduction_29  =  HappyAbsSyn23
-		 (Only
-	)
-
-happyReduce_30 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_30 = happySpecReduce_1  9 happyReduction_30
-happyReduction_30 (HappyAbsSyn17  happy_var_1)
-	 =  HappyAbsSyn24
-		 (Program (reverse happy_var_1)
-	)
-happyReduction_30 _  = notHappyAtAll 
-
-happyReduce_31 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_31 = happySpecReduce_0  9 happyReduction_31
-happyReduction_31  =  HappyAbsSyn24
-		 (Program []
-	)
-
-happyReduce_32 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_32 = happySpecReduce_3  10 happyReduction_32
-happyReduction_32 _
-	(HappyAbsSyn17  happy_var_2)
-	_
-	 =  HappyAbsSyn24
-		 (Program (reverse happy_var_2)
-	)
-happyReduction_32 _ _ _  = notHappyAtAll 
-
-happyReduce_33 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_33 = happySpecReduce_2  10 happyReduction_33
-happyReduction_33 _
-	_
-	 =  HappyAbsSyn24
-		 (Program []
-	)
-
-happyReduce_34 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_34 = happySpecReduce_2  11 happyReduction_34
-happyReduction_34 _
-	(HappyAbsSyn17  happy_var_1)
-	 =  HappyAbsSyn17
-		 (happy_var_1
-	)
-happyReduction_34 _ _  = notHappyAtAll 
-
-happyReduce_35 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_35 = happySpecReduce_3  11 happyReduction_35
-happyReduction_35 _
-	(HappyAbsSyn17  happy_var_2)
-	(HappyAbsSyn17  happy_var_1)
-	 =  HappyAbsSyn17
-		 (happy_var_2 ++ happy_var_1
-	)
-happyReduction_35 _ _ _  = notHappyAtAll 
-
-happyReduce_36 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_36 = happySpecReduce_1  12 happyReduction_36
-happyReduction_36 (HappyAbsSyn17  happy_var_1)
-	 =  HappyAbsSyn17
-		 (happy_var_1
-	)
-happyReduction_36 _  = notHappyAtAll 
-
-happyReduce_37 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_37 = happySpecReduce_3  12 happyReduction_37
-happyReduction_37 (HappyAbsSyn17  happy_var_3)
-	_
-	(HappyAbsSyn17  happy_var_1)
-	 =  HappyAbsSyn17
-		 (happy_var_3 ++ happy_var_1
-	)
-happyReduction_37 _ _ _  = notHappyAtAll 
-
-happyReduce_38 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_38 = happySpecReduce_3  12 happyReduction_38
-happyReduction_38 (HappyAbsSyn17  happy_var_3)
-	_
-	(HappyAbsSyn17  happy_var_1)
-	 =  HappyAbsSyn17
-		 (happy_var_3 ++ happy_var_1
-	)
-happyReduction_38 _ _ _  = notHappyAtAll 
-
-happyReduce_39 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_39 = happySpecReduce_1  13 happyReduction_39
-happyReduction_39 (HappyAbsSyn41  happy_var_1)
-	 =  HappyAbsSyn17
-		 ([exportDecl Nothing   Public happy_var_1]
-	)
-happyReduction_39 _  = notHappyAtAll 
-
-happyReduce_40 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_40 = happySpecReduce_2  13 happyReduction_40
-happyReduction_40 (HappyAbsSyn41  happy_var_2)
-	(HappyAbsSyn35  happy_var_1)
-	 =  HappyAbsSyn17
-		 ([exportDecl (Just happy_var_1) Public happy_var_2]
-	)
-happyReduction_40 _ _  = notHappyAtAll 
-
-happyReduce_41 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_41 = happyMonadReduce 3 13 happyReduction_41
-happyReduction_41 ((HappyTerminal (happy_var_3@(Located _ (Token (StrLit {}) _)))) `HappyStk`
-	_ `HappyStk`
-	_ `HappyStk`
-	happyRest) tk
-	 = happyThen ((( (return . Include) `fmap` fromStrLit happy_var_3))
-	) (\r -> happyReturn (HappyAbsSyn17 r))
-
-happyReduce_42 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_42 = happyReduce 6 13 happyReduction_42
-happyReduction_42 ((HappyAbsSyn62  happy_var_6) `HappyStk`
-	_ `HappyStk`
-	(HappyAbsSyn48  happy_var_4) `HappyStk`
-	(HappyAbsSyn47  happy_var_3) `HappyStk`
-	_ `HappyStk`
-	(HappyAbsSyn36  happy_var_1) `HappyStk`
-	happyRest)
-	 = HappyAbsSyn17
-		 ([exportDecl happy_var_1 Public (mkProperty happy_var_3 happy_var_4 happy_var_6)]
-	) `HappyStk` happyRest
-
-happyReduce_43 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_43 = happyReduce 5 13 happyReduction_43
-happyReduction_43 ((HappyAbsSyn62  happy_var_5) `HappyStk`
-	_ `HappyStk`
-	(HappyAbsSyn47  happy_var_3) `HappyStk`
-	_ `HappyStk`
-	(HappyAbsSyn36  happy_var_1) `HappyStk`
-	happyRest)
-	 = HappyAbsSyn17
-		 ([exportDecl happy_var_1 Public (mkProperty happy_var_3 [] happy_var_5)]
-	) `HappyStk` happyRest
-
-happyReduce_44 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_44 = happySpecReduce_2  13 happyReduction_44
-happyReduction_44 (HappyAbsSyn44  happy_var_2)
-	(HappyAbsSyn36  happy_var_1)
-	 =  HappyAbsSyn17
-		 ([exportNewtype Public happy_var_1 happy_var_2]
-	)
-happyReduction_44 _ _  = notHappyAtAll 
-
-happyReduce_45 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_45 = happySpecReduce_1  13 happyReduction_45
-happyReduction_45 (HappyAbsSyn17  happy_var_1)
-	 =  HappyAbsSyn17
-		 (happy_var_1
-	)
-happyReduction_45 _  = notHappyAtAll 
-
-happyReduce_46 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_46 = happySpecReduce_1  13 happyReduction_46
-happyReduction_46 (HappyAbsSyn17  happy_var_1)
-	 =  HappyAbsSyn17
-		 (happy_var_1
-	)
-happyReduction_46 _  = notHappyAtAll 
-
-happyReduce_47 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_47 = happySpecReduce_1  13 happyReduction_47
-happyReduction_47 (HappyAbsSyn17  happy_var_1)
-	 =  HappyAbsSyn17
-		 (happy_var_1
-	)
-happyReduction_47 _  = notHappyAtAll 
-
-happyReduce_48 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_48 = happyMonadReduce 3 13 happyReduction_48
-happyReduction_48 ((HappyAbsSyn15  happy_var_3) `HappyStk`
-	_ `HappyStk`
-	(HappyAbsSyn36  happy_var_1) `HappyStk`
-	happyRest) tk
-	 = happyThen ((( ((:[]) . exportModule happy_var_1) `fmap` mkNested happy_var_3))
-	) (\r -> happyReturn (HappyAbsSyn17 r))
-
-happyReduce_49 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_49 = happySpecReduce_1  13 happyReduction_49
-happyReduction_49 (HappyAbsSyn18  happy_var_1)
-	 =  HappyAbsSyn17
-		 ([DImport happy_var_1]
-	)
-happyReduction_49 _  = notHappyAtAll 
-
-happyReduce_50 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_50 = happySpecReduce_1  14 happyReduction_50
-happyReduction_50 (HappyAbsSyn41  happy_var_1)
-	 =  HappyAbsSyn17
-		 ([Decl (TopLevel {tlExport = Public, tlValue = happy_var_1 })]
-	)
-happyReduction_50 _  = notHappyAtAll 
-
-happyReduce_51 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_51 = happyMonadReduce 2 14 happyReduction_51
-happyReduction_51 ((HappyTerminal (happy_var_2@(Located _ (Token (StrLit {}) _)))) `HappyStk`
-	_ `HappyStk`
-	happyRest) tk
-	 = happyThen ((( (return . Include) `fmap` fromStrLit happy_var_2))
-	) (\r -> happyReturn (HappyAbsSyn17 r))
-
-happyReduce_52 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_52 = happySpecReduce_1  14 happyReduction_52
-happyReduction_52 (HappyAbsSyn17  happy_var_1)
-	 =  HappyAbsSyn17
-		 (happy_var_1
-	)
-happyReduction_52 _  = notHappyAtAll 
-
-happyReduce_53 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_53 = happyReduce 4 15 happyReduction_53
-happyReduction_53 (_ `HappyStk`
-	(HappyAbsSyn17  happy_var_3) `HappyStk`
-	_ `HappyStk`
-	_ `HappyStk`
-	happyRest)
-	 = HappyAbsSyn17
-		 (changeExport Private (reverse happy_var_3)
-	) `HappyStk` happyRest
-
-happyReduce_54 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_54 = happyReduce 5 15 happyReduction_54
-happyReduction_54 (_ `HappyStk`
-	(HappyAbsSyn17  happy_var_4) `HappyStk`
-	_ `HappyStk`
-	_ `HappyStk`
-	_ `HappyStk`
-	happyRest)
-	 = HappyAbsSyn17
-		 (changeExport Private (reverse happy_var_4)
-	) `HappyStk` happyRest
-
-happyReduce_55 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_55 = happyReduce 5 16 happyReduction_55
-happyReduction_55 ((HappyAbsSyn97  happy_var_5) `HappyStk`
-	_ `HappyStk`
-	(HappyAbsSyn47  happy_var_3) `HappyStk`
-	_ `HappyStk`
-	(HappyAbsSyn36  happy_var_1) `HappyStk`
-	happyRest)
-	 = HappyAbsSyn17
-		 (mkPrimDecl happy_var_1 happy_var_3 happy_var_5
-	) `HappyStk` happyRest
-
-happyReduce_56 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_56 = happyReduce 7 16 happyReduction_56
-happyReduction_56 ((HappyAbsSyn97  happy_var_7) `HappyStk`
-	_ `HappyStk`
-	_ `HappyStk`
-	(HappyAbsSyn47  happy_var_4) `HappyStk`
-	_ `HappyStk`
-	_ `HappyStk`
-	(HappyAbsSyn36  happy_var_1) `HappyStk`
-	happyRest)
-	 = HappyAbsSyn17
-		 (mkPrimDecl happy_var_1 happy_var_4 happy_var_7
-	) `HappyStk` happyRest
-
-happyReduce_57 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_57 = happyMonadReduce 6 16 happyReduction_57
-happyReduction_57 ((HappyAbsSyn101  happy_var_6) `HappyStk`
-	_ `HappyStk`
-	(HappyAbsSyn97  happy_var_4) `HappyStk`
-	_ `HappyStk`
-	_ `HappyStk`
-	(HappyAbsSyn36  happy_var_1) `HappyStk`
-	happyRest) tk
-	 = happyThen ((( mkPrimTypeDecl happy_var_1 happy_var_4 happy_var_6))
-	) (\r -> happyReturn (HappyAbsSyn17 r))
-
-happyReduce_58 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_58 = happyReduce 4 17 happyReduction_58
-happyReduction_58 (_ `HappyStk`
-	(HappyAbsSyn17  happy_var_3) `HappyStk`
-	_ `HappyStk`
-	_ `HappyStk`
-	happyRest)
-	 = HappyAbsSyn17
-		 (reverse happy_var_3
-	) `HappyStk` happyRest
-
-happyReduce_59 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_59 = happyReduce 5 17 happyReduction_59
-happyReduction_59 (_ `HappyStk`
-	(HappyAbsSyn17  happy_var_4) `HappyStk`
-	_ `HappyStk`
-	_ `HappyStk`
-	_ `HappyStk`
-	happyRest)
-	 = HappyAbsSyn17
-		 (reverse happy_var_4
-	) `HappyStk` happyRest
-
-happyReduce_60 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_60 = happySpecReduce_1  18 happyReduction_60
-happyReduction_60 (HappyAbsSyn34  happy_var_1)
-	 =  HappyAbsSyn17
-		 ([happy_var_1]
-	)
-happyReduction_60 _  = notHappyAtAll 
-
-happyReduce_61 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_61 = happySpecReduce_3  18 happyReduction_61
-happyReduction_61 (HappyAbsSyn34  happy_var_3)
-	_
-	(HappyAbsSyn17  happy_var_1)
-	 =  HappyAbsSyn17
-		 (happy_var_3 : happy_var_1
-	)
-happyReduction_61 _ _ _  = notHappyAtAll 
-
-happyReduce_62 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_62 = happySpecReduce_3  18 happyReduction_62
-happyReduction_62 (HappyAbsSyn34  happy_var_3)
-	_
-	(HappyAbsSyn17  happy_var_1)
-	 =  HappyAbsSyn17
-		 (happy_var_3 : happy_var_1
-	)
-happyReduction_62 _ _ _  = notHappyAtAll 
-
-happyReduce_63 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_63 = happyReduce 4 19 happyReduction_63
-happyReduction_63 ((HappyAbsSyn97  happy_var_4) `HappyStk`
-	_ `HappyStk`
-	(HappyAbsSyn47  happy_var_2) `HappyStk`
-	(HappyAbsSyn36  happy_var_1) `HappyStk`
-	happyRest)
-	 = HappyAbsSyn34
-		 (mkParFun happy_var_1 happy_var_2 happy_var_4
-	) `HappyStk` happyRest
-
-happyReduce_64 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_64 = happyMonadReduce 5 19 happyReduction_64
-happyReduction_64 ((HappyAbsSyn101  happy_var_5) `HappyStk`
-	_ `HappyStk`
-	(HappyAbsSyn47  happy_var_3) `HappyStk`
-	_ `HappyStk`
-	(HappyAbsSyn36  happy_var_1) `HappyStk`
-	happyRest) tk
-	 = happyThen ((( mkParType happy_var_1 happy_var_3 happy_var_5))
-	) (\r -> happyReturn (HappyAbsSyn34 r))
-
-happyReduce_65 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_65 = happyMonadReduce 4 19 happyReduction_65
-happyReduction_65 ((HappyAbsSyn106  happy_var_4) `HappyStk`
-	_ `HappyStk`
-	_ `HappyStk`
-	_ `HappyStk`
-	happyRest) tk
-	 = happyThen ((( fmap (DParameterConstraint . distrLoc)
-                                            (mkProp happy_var_4)))
-	) (\r -> happyReturn (HappyAbsSyn34 r))
-
-happyReduce_66 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_66 = happySpecReduce_1  20 happyReduction_66
-happyReduction_66 (HappyTerminal (happy_var_1@(Located _ (Token (White DocStr) _))))
-	 =  HappyAbsSyn35
-		 (mkDoc (fmap tokenText happy_var_1)
-	)
-happyReduction_66 _  = notHappyAtAll 
-
-happyReduce_67 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_67 = happySpecReduce_1  21 happyReduction_67
-happyReduction_67 (HappyAbsSyn35  happy_var_1)
-	 =  HappyAbsSyn36
-		 (Just happy_var_1
-	)
-happyReduction_67 _  = notHappyAtAll 
-
-happyReduce_68 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_68 = happySpecReduce_0  21 happyReduction_68
-happyReduction_68  =  HappyAbsSyn36
-		 (Nothing
-	)
-
-happyReduce_69 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_69 = happySpecReduce_2  22 happyReduction_69
-happyReduction_69 (HappyAbsSyn37  happy_var_2)
-	_
-	 =  HappyAbsSyn37
-		 (happy_var_2
-	)
-happyReduction_69 _ _  = notHappyAtAll 
-
-happyReduce_70 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_70 = happySpecReduce_3  23 happyReduction_70
-happyReduction_70 (HappyAbsSyn37  happy_var_3)
-	(HappyTerminal (Located happy_var_2 (Token (Sym Bar     ) _)))
-	_
-	 =  HappyAbsSyn37
-		 (happy_var_2 ++ happy_var_3
-	)
-happyReduction_70 _ _ _  = notHappyAtAll 
-
-happyReduce_71 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_71 = happySpecReduce_1  23 happyReduction_71
-happyReduction_71 (HappyAbsSyn37  happy_var_1)
-	 =  HappyAbsSyn37
-		 (happy_var_1
-	)
-happyReduction_71 _  = notHappyAtAll 
-
-happyReduce_72 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_72 = happySpecReduce_3  24 happyReduction_72
-happyReduction_72 (HappyAbsSyn62  happy_var_3)
-	_
-	(HappyAbsSyn40  happy_var_1)
-	 =  HappyAbsSyn37
-		 ([(happy_var_1, happy_var_3)]
-	)
-happyReduction_72 _ _ _  = notHappyAtAll 
-
-happyReduce_73 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_73 = happyMonadReduce 1 25 happyReduction_73
-happyReduction_73 ((HappyAbsSyn106  happy_var_1) `HappyStk`
-	happyRest) tk
-	 = happyThen ((( fmap thing (mkProp happy_var_1)))
-	) (\r -> happyReturn (HappyAbsSyn40 r))
-
-happyReduce_74 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_74 = happySpecReduce_3  26 happyReduction_74
-happyReduction_74 (HappyAbsSyn97  happy_var_3)
-	_
-	(HappyAbsSyn46  happy_var_1)
-	 =  HappyAbsSyn41
-		 (at (head happy_var_1,happy_var_3) $ DSignature (reverse happy_var_1) happy_var_3
-	)
-happyReduction_74 _ _ _  = notHappyAtAll 
-
-happyReduce_75 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_75 = happySpecReduce_3  26 happyReduction_75
-happyReduction_75 (HappyAbsSyn62  happy_var_3)
-	_
-	(HappyAbsSyn91  happy_var_1)
-	 =  HappyAbsSyn41
-		 (at (happy_var_1,happy_var_3) $ DPatBind happy_var_1 happy_var_3
-	)
-happyReduction_75 _ _ _  = notHappyAtAll 
-
-happyReduce_76 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_76 = happyReduce 5 26 happyReduction_76
-happyReduction_76 ((HappyAbsSyn62  happy_var_5) `HappyStk`
-	_ `HappyStk`
-	_ `HappyStk`
-	(HappyAbsSyn47  happy_var_2) `HappyStk`
-	(HappyTerminal (Located happy_var_1 (Token (Sym ParenL  ) _))) `HappyStk`
-	happyRest)
-	 = HappyAbsSyn41
-		 (at (happy_var_1,happy_var_5) $ DPatBind (PVar happy_var_2) happy_var_5
-	) `HappyStk` happyRest
-
-happyReduce_77 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_77 = happyReduce 4 26 happyReduction_77
-happyReduction_77 ((HappyAbsSyn37  happy_var_4) `HappyStk`
-	_ `HappyStk`
-	(HappyAbsSyn51  happy_var_2) `HappyStk`
-	(HappyAbsSyn47  happy_var_1) `HappyStk`
-	happyRest)
-	 = HappyAbsSyn41
-		 (mkIndexedPropGuardsDecl happy_var_1 happy_var_2 happy_var_4
-	) `HappyStk` happyRest
-
-happyReduce_78 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_78 = happyReduce 4 26 happyReduction_78
-happyReduction_78 ((HappyAbsSyn62  happy_var_4) `HappyStk`
-	_ `HappyStk`
-	(HappyAbsSyn51  happy_var_2) `HappyStk`
-	(HappyAbsSyn47  happy_var_1) `HappyStk`
-	happyRest)
-	 = HappyAbsSyn41
-		 (at (happy_var_1,happy_var_4) $ mkIndexedDecl happy_var_1 happy_var_2 happy_var_4
-	) `HappyStk` happyRest
-
-happyReduce_79 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_79 = happyReduce 5 26 happyReduction_79
-happyReduction_79 ((HappyAbsSyn62  happy_var_5) `HappyStk`
-	_ `HappyStk`
-	(HappyAbsSyn91  happy_var_3) `HappyStk`
-	(HappyAbsSyn47  happy_var_2) `HappyStk`
-	(HappyAbsSyn91  happy_var_1) `HappyStk`
-	happyRest)
-	 = HappyAbsSyn41
-		 (at (happy_var_1,happy_var_5) $
-                             DBind $ Bind { bName      = happy_var_2
-                                          , bParams    = [happy_var_1,happy_var_3]
-                                          , bDef       = at happy_var_5 (Located emptyRange (DExpr happy_var_5))
-                                          , bSignature = Nothing
-                                          , bPragmas   = []
-                                          , bMono      = False
-                                          , bInfix     = True
-                                          , bFixity    = Nothing
-                                          , bDoc       = Nothing
-                                          , bExport    = Public
-                                          }
-	) `HappyStk` happyRest
-
-happyReduce_80 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_80 = happyMonadReduce 4 26 happyReduction_80
-happyReduction_80 ((HappyAbsSyn106  happy_var_4) `HappyStk`
-	_ `HappyStk`
-	(HappyAbsSyn47  happy_var_2) `HappyStk`
-	(HappyTerminal (Located happy_var_1 (Token (KW KW_type   ) _))) `HappyStk`
-	happyRest) tk
-	 = happyThen ((( at (happy_var_1,happy_var_4) `fmap` mkTySyn happy_var_2 [] happy_var_4))
-	) (\r -> happyReturn (HappyAbsSyn41 r))
-
-happyReduce_81 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_81 = happyMonadReduce 5 26 happyReduction_81
-happyReduction_81 ((HappyAbsSyn106  happy_var_5) `HappyStk`
-	_ `HappyStk`
-	(HappyAbsSyn103  happy_var_3) `HappyStk`
-	(HappyAbsSyn47  happy_var_2) `HappyStk`
-	(HappyTerminal (Located happy_var_1 (Token (KW KW_type   ) _))) `HappyStk`
-	happyRest) tk
-	 = happyThen ((( at (happy_var_1,happy_var_5) `fmap` mkTySyn happy_var_2 (reverse happy_var_3) happy_var_5))
-	) (\r -> happyReturn (HappyAbsSyn41 r))
-
-happyReduce_82 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_82 = happyMonadReduce 6 26 happyReduction_82
-happyReduction_82 ((HappyAbsSyn106  happy_var_6) `HappyStk`
-	_ `HappyStk`
-	(HappyAbsSyn102  happy_var_4) `HappyStk`
-	(HappyAbsSyn47  happy_var_3) `HappyStk`
-	(HappyAbsSyn102  happy_var_2) `HappyStk`
-	(HappyTerminal (Located happy_var_1 (Token (KW KW_type   ) _))) `HappyStk`
-	happyRest) tk
-	 = happyThen ((( at (happy_var_1,happy_var_6) `fmap` mkTySyn happy_var_3 [happy_var_2, happy_var_4] happy_var_6))
-	) (\r -> happyReturn (HappyAbsSyn41 r))
-
-happyReduce_83 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_83 = happyMonadReduce 5 26 happyReduction_83
-happyReduction_83 ((HappyAbsSyn106  happy_var_5) `HappyStk`
-	_ `HappyStk`
-	(HappyAbsSyn47  happy_var_3) `HappyStk`
-	(HappyTerminal (Located happy_var_2 (Token (KW KW_constraint) _))) `HappyStk`
-	_ `HappyStk`
-	happyRest) tk
-	 = happyThen ((( at (happy_var_2,happy_var_5) `fmap` mkPropSyn happy_var_3 [] happy_var_5))
-	) (\r -> happyReturn (HappyAbsSyn41 r))
-
-happyReduce_84 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_84 = happyMonadReduce 6 26 happyReduction_84
-happyReduction_84 ((HappyAbsSyn106  happy_var_6) `HappyStk`
-	_ `HappyStk`
-	(HappyAbsSyn103  happy_var_4) `HappyStk`
-	(HappyAbsSyn47  happy_var_3) `HappyStk`
-	(HappyTerminal (Located happy_var_2 (Token (KW KW_constraint) _))) `HappyStk`
-	_ `HappyStk`
-	happyRest) tk
-	 = happyThen ((( at (happy_var_2,happy_var_6) `fmap` mkPropSyn happy_var_3 (reverse happy_var_4) happy_var_6))
-	) (\r -> happyReturn (HappyAbsSyn41 r))
-
-happyReduce_85 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_85 = happyMonadReduce 7 26 happyReduction_85
-happyReduction_85 ((HappyAbsSyn106  happy_var_7) `HappyStk`
-	_ `HappyStk`
-	(HappyAbsSyn102  happy_var_5) `HappyStk`
-	(HappyAbsSyn47  happy_var_4) `HappyStk`
-	(HappyAbsSyn102  happy_var_3) `HappyStk`
-	(HappyTerminal (Located happy_var_2 (Token (KW KW_constraint) _))) `HappyStk`
-	_ `HappyStk`
-	happyRest) tk
-	 = happyThen ((( at (happy_var_2,happy_var_7) `fmap` mkPropSyn happy_var_4 [happy_var_3, happy_var_5] happy_var_7))
-	) (\r -> happyReturn (HappyAbsSyn41 r))
-
-happyReduce_86 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_86 = happyMonadReduce 3 26 happyReduction_86
-happyReduction_86 ((HappyAbsSyn61  happy_var_3) `HappyStk`
-	(HappyTerminal (happy_var_2@(Located _ (Token (Num   {}) _)))) `HappyStk`
-	_ `HappyStk`
-	happyRest) tk
-	 = happyThen ((( mkFixity LeftAssoc  happy_var_2 (reverse happy_var_3)))
-	) (\r -> happyReturn (HappyAbsSyn41 r))
-
-happyReduce_87 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_87 = happyMonadReduce 3 26 happyReduction_87
-happyReduction_87 ((HappyAbsSyn61  happy_var_3) `HappyStk`
-	(HappyTerminal (happy_var_2@(Located _ (Token (Num   {}) _)))) `HappyStk`
-	_ `HappyStk`
-	happyRest) tk
-	 = happyThen ((( mkFixity RightAssoc happy_var_2 (reverse happy_var_3)))
-	) (\r -> happyReturn (HappyAbsSyn41 r))
-
-happyReduce_88 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_88 = happyMonadReduce 3 26 happyReduction_88
-happyReduction_88 ((HappyAbsSyn61  happy_var_3) `HappyStk`
-	(HappyTerminal (happy_var_2@(Located _ (Token (Num   {}) _)))) `HappyStk`
-	_ `HappyStk`
-	happyRest) tk
-	 = happyThen ((( mkFixity NonAssoc   happy_var_2 (reverse happy_var_3)))
-	) (\r -> happyReturn (HappyAbsSyn41 r))
-
-happyReduce_89 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_89 = happyMonadReduce 1 26 happyReduction_89
-happyReduction_89 (_ `HappyStk`
-	happyRest) tk
-	 = happyThen ((( expected "a declaration"))
-	) (\r -> happyReturn (HappyAbsSyn41 r))
-
-happyReduce_90 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_90 = happySpecReduce_1  27 happyReduction_90
-happyReduction_90 (HappyAbsSyn41  happy_var_1)
-	 =  HappyAbsSyn42
-		 ([happy_var_1]
-	)
-happyReduction_90 _  = notHappyAtAll 
-
-happyReduce_91 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_91 = happySpecReduce_2  27 happyReduction_91
-happyReduction_91 _
-	(HappyAbsSyn41  happy_var_1)
-	 =  HappyAbsSyn42
-		 ([happy_var_1]
-	)
-happyReduction_91 _ _  = notHappyAtAll 
-
-happyReduce_92 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_92 = happySpecReduce_3  27 happyReduction_92
-happyReduction_92 (HappyAbsSyn42  happy_var_3)
-	_
-	(HappyAbsSyn41  happy_var_1)
-	 =  HappyAbsSyn42
-		 ((happy_var_1:happy_var_3)
-	)
-happyReduction_92 _ _ _  = notHappyAtAll 
-
-happyReduce_93 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_93 = happyReduce 4 28 happyReduction_93
-happyReduction_93 ((HappyAbsSyn62  happy_var_4) `HappyStk`
-	_ `HappyStk`
-	(HappyAbsSyn91  happy_var_2) `HappyStk`
-	_ `HappyStk`
-	happyRest)
-	 = HappyAbsSyn41
-		 (at (happy_var_2,happy_var_4) $ DPatBind happy_var_2 happy_var_4
-	) `HappyStk` happyRest
-
-happyReduce_94 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_94 = happyReduce 5 28 happyReduction_94
-happyReduction_94 ((HappyAbsSyn62  happy_var_5) `HappyStk`
-	_ `HappyStk`
-	(HappyAbsSyn51  happy_var_3) `HappyStk`
-	(HappyAbsSyn47  happy_var_2) `HappyStk`
-	_ `HappyStk`
-	happyRest)
-	 = HappyAbsSyn41
-		 (at (happy_var_2,happy_var_5) $ mkIndexedDecl happy_var_2 happy_var_3 happy_var_5
-	) `HappyStk` happyRest
-
-happyReduce_95 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_95 = happyReduce 6 28 happyReduction_95
-happyReduction_95 ((HappyAbsSyn62  happy_var_6) `HappyStk`
-	_ `HappyStk`
-	_ `HappyStk`
-	(HappyAbsSyn47  happy_var_3) `HappyStk`
-	(HappyTerminal (Located happy_var_2 (Token (Sym ParenL  ) _))) `HappyStk`
-	_ `HappyStk`
-	happyRest)
-	 = HappyAbsSyn41
-		 (at (happy_var_2,happy_var_6) $ DPatBind (PVar happy_var_3) happy_var_6
-	) `HappyStk` happyRest
-
-happyReduce_96 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_96 = happyReduce 6 28 happyReduction_96
-happyReduction_96 ((HappyAbsSyn62  happy_var_6) `HappyStk`
-	_ `HappyStk`
-	(HappyAbsSyn91  happy_var_4) `HappyStk`
-	(HappyAbsSyn47  happy_var_3) `HappyStk`
-	(HappyAbsSyn91  happy_var_2) `HappyStk`
-	_ `HappyStk`
-	happyRest)
-	 = HappyAbsSyn41
-		 (at (happy_var_2,happy_var_6) $
-                             DBind $ Bind { bName      = happy_var_3
-                                          , bParams    = [happy_var_2,happy_var_4]
-                                          , bDef       = at happy_var_6 (Located emptyRange (DExpr happy_var_6))
-                                          , bSignature = Nothing
-                                          , bPragmas   = []
-                                          , bMono      = False
-                                          , bInfix     = True
-                                          , bFixity    = Nothing
-                                          , bDoc       = Nothing
-                                          , bExport    = Public
-                                          }
-	) `HappyStk` happyRest
-
-happyReduce_97 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_97 = happyReduce 4 28 happyReduction_97
-happyReduction_97 ((HappyAbsSyn97  happy_var_4) `HappyStk`
-	_ `HappyStk`
-	(HappyAbsSyn46  happy_var_2) `HappyStk`
-	_ `HappyStk`
-	happyRest)
-	 = HappyAbsSyn41
-		 (at (head happy_var_2,happy_var_4) $ DSignature (reverse happy_var_2) happy_var_4
-	) `HappyStk` happyRest
-
-happyReduce_98 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_98 = happyMonadReduce 4 28 happyReduction_98
-happyReduction_98 ((HappyAbsSyn106  happy_var_4) `HappyStk`
-	_ `HappyStk`
-	(HappyAbsSyn47  happy_var_2) `HappyStk`
-	(HappyTerminal (Located happy_var_1 (Token (KW KW_type   ) _))) `HappyStk`
-	happyRest) tk
-	 = happyThen ((( at (happy_var_1,happy_var_4) `fmap` mkTySyn happy_var_2 [] happy_var_4))
-	) (\r -> happyReturn (HappyAbsSyn41 r))
-
-happyReduce_99 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_99 = happyMonadReduce 5 28 happyReduction_99
-happyReduction_99 ((HappyAbsSyn106  happy_var_5) `HappyStk`
-	_ `HappyStk`
-	(HappyAbsSyn103  happy_var_3) `HappyStk`
-	(HappyAbsSyn47  happy_var_2) `HappyStk`
-	(HappyTerminal (Located happy_var_1 (Token (KW KW_type   ) _))) `HappyStk`
-	happyRest) tk
-	 = happyThen ((( at (happy_var_1,happy_var_5) `fmap` mkTySyn happy_var_2 (reverse happy_var_3) happy_var_5))
-	) (\r -> happyReturn (HappyAbsSyn41 r))
-
-happyReduce_100 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_100 = happyMonadReduce 6 28 happyReduction_100
-happyReduction_100 ((HappyAbsSyn106  happy_var_6) `HappyStk`
-	_ `HappyStk`
-	(HappyAbsSyn102  happy_var_4) `HappyStk`
-	(HappyAbsSyn47  happy_var_3) `HappyStk`
-	(HappyAbsSyn102  happy_var_2) `HappyStk`
-	(HappyTerminal (Located happy_var_1 (Token (KW KW_type   ) _))) `HappyStk`
-	happyRest) tk
-	 = happyThen ((( at (happy_var_1,happy_var_6) `fmap` mkTySyn happy_var_3 [happy_var_2, happy_var_4] happy_var_6))
-	) (\r -> happyReturn (HappyAbsSyn41 r))
-
-happyReduce_101 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_101 = happyMonadReduce 5 28 happyReduction_101
-happyReduction_101 ((HappyAbsSyn106  happy_var_5) `HappyStk`
-	_ `HappyStk`
-	(HappyAbsSyn47  happy_var_3) `HappyStk`
-	(HappyTerminal (Located happy_var_2 (Token (KW KW_constraint) _))) `HappyStk`
-	_ `HappyStk`
-	happyRest) tk
-	 = happyThen ((( at (happy_var_2,happy_var_5) `fmap` mkPropSyn happy_var_3 [] happy_var_5))
-	) (\r -> happyReturn (HappyAbsSyn41 r))
-
-happyReduce_102 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_102 = happyMonadReduce 6 28 happyReduction_102
-happyReduction_102 ((HappyAbsSyn106  happy_var_6) `HappyStk`
-	_ `HappyStk`
-	(HappyAbsSyn103  happy_var_4) `HappyStk`
-	(HappyAbsSyn47  happy_var_3) `HappyStk`
-	(HappyTerminal (Located happy_var_2 (Token (KW KW_constraint) _))) `HappyStk`
-	_ `HappyStk`
-	happyRest) tk
-	 = happyThen ((( at (happy_var_2,happy_var_6) `fmap` mkPropSyn happy_var_3 (reverse happy_var_4) happy_var_6))
-	) (\r -> happyReturn (HappyAbsSyn41 r))
-
-happyReduce_103 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_103 = happyMonadReduce 7 28 happyReduction_103
-happyReduction_103 ((HappyAbsSyn106  happy_var_7) `HappyStk`
-	_ `HappyStk`
-	(HappyAbsSyn102  happy_var_5) `HappyStk`
-	(HappyAbsSyn47  happy_var_4) `HappyStk`
-	(HappyAbsSyn102  happy_var_3) `HappyStk`
-	(HappyTerminal (Located happy_var_2 (Token (KW KW_constraint) _))) `HappyStk`
-	_ `HappyStk`
-	happyRest) tk
-	 = happyThen ((( at (happy_var_2,happy_var_7) `fmap` mkPropSyn happy_var_4 [happy_var_3, happy_var_5] happy_var_7))
-	) (\r -> happyReturn (HappyAbsSyn41 r))
-
-happyReduce_104 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_104 = happyMonadReduce 3 28 happyReduction_104
-happyReduction_104 ((HappyAbsSyn61  happy_var_3) `HappyStk`
-	(HappyTerminal (happy_var_2@(Located _ (Token (Num   {}) _)))) `HappyStk`
-	_ `HappyStk`
-	happyRest) tk
-	 = happyThen ((( mkFixity LeftAssoc  happy_var_2 (reverse happy_var_3)))
-	) (\r -> happyReturn (HappyAbsSyn41 r))
-
-happyReduce_105 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_105 = happyMonadReduce 3 28 happyReduction_105
-happyReduction_105 ((HappyAbsSyn61  happy_var_3) `HappyStk`
-	(HappyTerminal (happy_var_2@(Located _ (Token (Num   {}) _)))) `HappyStk`
-	_ `HappyStk`
-	happyRest) tk
-	 = happyThen ((( mkFixity RightAssoc happy_var_2 (reverse happy_var_3)))
-	) (\r -> happyReturn (HappyAbsSyn41 r))
-
-happyReduce_106 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_106 = happyMonadReduce 3 28 happyReduction_106
-happyReduction_106 ((HappyAbsSyn61  happy_var_3) `HappyStk`
-	(HappyTerminal (happy_var_2@(Located _ (Token (Num   {}) _)))) `HappyStk`
-	_ `HappyStk`
-	happyRest) tk
-	 = happyThen ((( mkFixity NonAssoc   happy_var_2 (reverse happy_var_3)))
-	) (\r -> happyReturn (HappyAbsSyn41 r))
-
-happyReduce_107 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_107 = happyReduce 4 29 happyReduction_107
-happyReduction_107 ((HappyAbsSyn45  happy_var_4) `HappyStk`
-	_ `HappyStk`
-	(HappyAbsSyn119  happy_var_2) `HappyStk`
-	_ `HappyStk`
-	happyRest)
-	 = HappyAbsSyn44
-		 (Newtype happy_var_2 [] (thing happy_var_4)
-	) `HappyStk` happyRest
-
-happyReduce_108 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_108 = happyReduce 5 29 happyReduction_108
-happyReduction_108 ((HappyAbsSyn45  happy_var_5) `HappyStk`
-	_ `HappyStk`
-	(HappyAbsSyn103  happy_var_3) `HappyStk`
-	(HappyAbsSyn119  happy_var_2) `HappyStk`
-	_ `HappyStk`
-	happyRest)
-	 = HappyAbsSyn44
-		 (Newtype happy_var_2 (reverse happy_var_3) (thing happy_var_5)
-	) `HappyStk` happyRest
-
-happyReduce_109 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_109 = happyMonadReduce 2 30 happyReduction_109
-happyReduction_109 ((HappyTerminal (Located happy_var_2 (Token (Sym CurlyR  ) _))) `HappyStk`
-	(HappyTerminal (Located happy_var_1 (Token (Sym CurlyL  ) _))) `HappyStk`
-	happyRest) tk
-	 = happyThen ((( mkRecord (rComb happy_var_1 happy_var_2) (Located emptyRange) []))
-	) (\r -> happyReturn (HappyAbsSyn45 r))
-
-happyReduce_110 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_110 = happyMonadReduce 3 30 happyReduction_110
-happyReduction_110 ((HappyTerminal (Located happy_var_3 (Token (Sym CurlyR  ) _))) `HappyStk`
-	(HappyAbsSyn114  happy_var_2) `HappyStk`
-	(HappyTerminal (Located happy_var_1 (Token (Sym CurlyL  ) _))) `HappyStk`
-	happyRest) tk
-	 = happyThen ((( mkRecord (rComb happy_var_1 happy_var_3) (Located emptyRange) happy_var_2))
-	) (\r -> happyReturn (HappyAbsSyn45 r))
-
-happyReduce_111 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_111 = happySpecReduce_1  31 happyReduction_111
-happyReduction_111 (HappyAbsSyn47  happy_var_1)
-	 =  HappyAbsSyn46
-		 ([ happy_var_1]
-	)
-happyReduction_111 _  = notHappyAtAll 
-
-happyReduce_112 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_112 = happySpecReduce_3  31 happyReduction_112
-happyReduction_112 (HappyAbsSyn47  happy_var_3)
-	_
-	(HappyAbsSyn46  happy_var_1)
-	 =  HappyAbsSyn46
-		 (happy_var_3 : happy_var_1
-	)
-happyReduction_112 _ _ _  = notHappyAtAll 
-
-happyReduce_113 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_113 = happySpecReduce_1  32 happyReduction_113
-happyReduction_113 (HappyAbsSyn47  happy_var_1)
-	 =  HappyAbsSyn47
-		 (happy_var_1
-	)
-happyReduction_113 _  = notHappyAtAll 
-
-happyReduce_114 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_114 = happySpecReduce_3  32 happyReduction_114
-happyReduction_114 _
-	(HappyAbsSyn47  happy_var_2)
-	_
-	 =  HappyAbsSyn47
-		 (happy_var_2
-	)
-happyReduction_114 _ _ _  = notHappyAtAll 
-
-happyReduce_115 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_115 = happySpecReduce_1  33 happyReduction_115
-happyReduction_115 (HappyAbsSyn91  happy_var_1)
-	 =  HappyAbsSyn48
-		 ([happy_var_1]
-	)
-happyReduction_115 _  = notHappyAtAll 
-
-happyReduce_116 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_116 = happySpecReduce_2  33 happyReduction_116
-happyReduction_116 (HappyAbsSyn91  happy_var_2)
-	(HappyAbsSyn48  happy_var_1)
-	 =  HappyAbsSyn48
-		 (happy_var_2 : happy_var_1
-	)
-happyReduction_116 _ _  = notHappyAtAll 
-
-happyReduce_117 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_117 = happySpecReduce_2  34 happyReduction_117
-happyReduction_117 (HappyAbsSyn48  happy_var_2)
-	_
-	 =  HappyAbsSyn48
-		 (happy_var_2
-	)
-happyReduction_117 _ _  = notHappyAtAll 
-
-happyReduce_118 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_118 = happySpecReduce_0  34 happyReduction_118
-happyReduction_118  =  HappyAbsSyn48
-		 ([]
-	)
-
-happyReduce_119 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_119 = happySpecReduce_1  35 happyReduction_119
-happyReduction_119 (HappyAbsSyn91  happy_var_1)
-	 =  HappyAbsSyn48
-		 ([happy_var_1]
-	)
-happyReduction_119 _  = notHappyAtAll 
-
-happyReduce_120 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_120 = happySpecReduce_3  35 happyReduction_120
-happyReduction_120 (HappyAbsSyn91  happy_var_3)
-	_
-	(HappyAbsSyn48  happy_var_1)
-	 =  HappyAbsSyn48
-		 (happy_var_3 : happy_var_1
-	)
-happyReduction_120 _ _ _  = notHappyAtAll 
-
-happyReduce_121 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_121 = happySpecReduce_2  36 happyReduction_121
-happyReduction_121 (HappyAbsSyn48  happy_var_2)
-	(HappyAbsSyn48  happy_var_1)
-	 =  HappyAbsSyn51
-		 ((happy_var_1, happy_var_2)
-	)
-happyReduction_121 _ _  = notHappyAtAll 
-
-happyReduce_122 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_122 = happySpecReduce_2  36 happyReduction_122
-happyReduction_122 (HappyAbsSyn48  happy_var_2)
-	_
-	 =  HappyAbsSyn51
-		 (([], happy_var_2)
-	)
-happyReduction_122 _ _  = notHappyAtAll 
-
-happyReduce_123 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_123 = happySpecReduce_0  37 happyReduction_123
-happyReduction_123  =  HappyAbsSyn51
-		 (([],[])
-	)
-
-happyReduce_124 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_124 = happySpecReduce_1  37 happyReduction_124
-happyReduction_124 (HappyAbsSyn51  happy_var_1)
-	 =  HappyAbsSyn51
-		 (happy_var_1
-	)
-happyReduction_124 _  = notHappyAtAll 
-
-happyReduce_125 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_125 = happySpecReduce_2  38 happyReduction_125
-happyReduction_125 _
-	(HappyAbsSyn41  happy_var_1)
-	 =  HappyAbsSyn42
-		 ([happy_var_1]
-	)
-happyReduction_125 _ _  = notHappyAtAll 
-
-happyReduce_126 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_126 = happySpecReduce_3  38 happyReduction_126
-happyReduction_126 _
-	(HappyAbsSyn41  happy_var_2)
-	(HappyAbsSyn42  happy_var_1)
-	 =  HappyAbsSyn42
-		 (happy_var_2 : happy_var_1
-	)
-happyReduction_126 _ _ _  = notHappyAtAll 
-
-happyReduce_127 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_127 = happySpecReduce_1  39 happyReduction_127
-happyReduction_127 (HappyAbsSyn41  happy_var_1)
-	 =  HappyAbsSyn42
-		 ([happy_var_1]
-	)
-happyReduction_127 _  = notHappyAtAll 
-
-happyReduce_128 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_128 = happySpecReduce_3  39 happyReduction_128
-happyReduction_128 (HappyAbsSyn41  happy_var_3)
-	_
-	(HappyAbsSyn42  happy_var_1)
-	 =  HappyAbsSyn42
-		 (happy_var_3 : happy_var_1
-	)
-happyReduction_128 _ _ _  = notHappyAtAll 
-
-happyReduce_129 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_129 = happySpecReduce_3  39 happyReduction_129
-happyReduction_129 (HappyAbsSyn41  happy_var_3)
-	_
-	(HappyAbsSyn42  happy_var_1)
-	 =  HappyAbsSyn42
-		 (happy_var_3 : happy_var_1
-	)
-happyReduction_129 _ _ _  = notHappyAtAll 
-
-happyReduce_130 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_130 = happySpecReduce_3  40 happyReduction_130
-happyReduction_130 _
-	(HappyAbsSyn42  happy_var_2)
-	_
-	 =  HappyAbsSyn42
-		 (happy_var_2
-	)
-happyReduction_130 _ _ _  = notHappyAtAll 
-
-happyReduce_131 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_131 = happySpecReduce_2  40 happyReduction_131
-happyReduction_131 _
-	_
-	 =  HappyAbsSyn42
-		 ([]
-	)
-
-happyReduce_132 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_132 = happySpecReduce_1  41 happyReduction_132
-happyReduction_132 (HappyAbsSyn62  happy_var_1)
-	 =  HappyAbsSyn56
-		 (ExprInput happy_var_1
-	)
-happyReduction_132 _  = notHappyAtAll 
-
-happyReduce_133 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_133 = happySpecReduce_1  41 happyReduction_133
-happyReduction_133 (HappyAbsSyn42  happy_var_1)
-	 =  HappyAbsSyn56
-		 (LetInput happy_var_1
-	)
-happyReduction_133 _  = notHappyAtAll 
-
-happyReduce_134 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_134 = happySpecReduce_0  41 happyReduction_134
-happyReduction_134  =  HappyAbsSyn56
-		 (EmptyInput
-	)
-
-happyReduce_135 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_135 = happySpecReduce_1  42 happyReduction_135
-happyReduction_135 (HappyAbsSyn47  happy_var_1)
-	 =  HappyAbsSyn47
-		 (happy_var_1
-	)
-happyReduction_135 _  = notHappyAtAll 
-
-happyReduce_136 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_136 = happySpecReduce_1  42 happyReduction_136
-happyReduction_136 (HappyTerminal (happy_var_1@(Located _ (Token (Op  Other{}   )  _))))
-	 =  HappyAbsSyn47
-		 (let Token (Op (Other ns i)) _ = thing happy_var_1
-                                       in mkQual (mkModName ns) (mkInfix i) A.<$ happy_var_1
-	)
-happyReduction_136 _  = notHappyAtAll 
-
-happyReduce_137 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_137 = happySpecReduce_1  43 happyReduction_137
-happyReduction_137 (HappyAbsSyn47  happy_var_1)
-	 =  HappyAbsSyn47
-		 (happy_var_1
-	)
-happyReduction_137 _  = notHappyAtAll 
-
-happyReduce_138 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_138 = happySpecReduce_1  43 happyReduction_138
-happyReduction_138 (HappyTerminal (Located happy_var_1 (Token (Op Hash) _)))
-	 =  HappyAbsSyn47
-		 (Located happy_var_1 $ mkUnqual $ mkInfix "#"
-	)
-happyReduction_138 _  = notHappyAtAll 
-
-happyReduce_139 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_139 = happySpecReduce_1  43 happyReduction_139
-happyReduction_139 (HappyTerminal (Located happy_var_1 (Token (Op At) _)))
-	 =  HappyAbsSyn47
-		 (Located happy_var_1 $ mkUnqual $ mkInfix "@"
-	)
-happyReduction_139 _  = notHappyAtAll 
-
-happyReduce_140 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_140 = happySpecReduce_1  44 happyReduction_140
-happyReduction_140 (HappyAbsSyn47  happy_var_1)
-	 =  HappyAbsSyn47
-		 (happy_var_1
-	)
-happyReduction_140 _  = notHappyAtAll 
-
-happyReduce_141 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_141 = happySpecReduce_1  44 happyReduction_141
-happyReduction_141 (HappyTerminal (Located happy_var_1 (Token (Op Mul)   _)))
-	 =  HappyAbsSyn47
-		 (Located happy_var_1 $ mkUnqual $ mkInfix "*"
-	)
-happyReduction_141 _  = notHappyAtAll 
-
-happyReduce_142 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_142 = happySpecReduce_1  44 happyReduction_142
-happyReduction_142 (HappyTerminal (Located happy_var_1 (Token (Op Plus)  _)))
-	 =  HappyAbsSyn47
-		 (Located happy_var_1 $ mkUnqual $ mkInfix "+"
-	)
-happyReduction_142 _  = notHappyAtAll 
-
-happyReduce_143 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_143 = happySpecReduce_1  44 happyReduction_143
-happyReduction_143 (HappyTerminal (Located happy_var_1 (Token (Op Minus) _)))
-	 =  HappyAbsSyn47
-		 (Located happy_var_1 $ mkUnqual $ mkInfix "-"
-	)
-happyReduction_143 _  = notHappyAtAll 
-
-happyReduce_144 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_144 = happySpecReduce_1  44 happyReduction_144
-happyReduction_144 (HappyTerminal (Located happy_var_1 (Token (Op Complement) _)))
-	 =  HappyAbsSyn47
-		 (Located happy_var_1 $ mkUnqual $ mkInfix "~"
-	)
-happyReduction_144 _  = notHappyAtAll 
-
-happyReduce_145 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_145 = happySpecReduce_1  44 happyReduction_145
-happyReduction_145 (HappyTerminal (Located happy_var_1 (Token (Op Exp)   _)))
-	 =  HappyAbsSyn47
-		 (Located happy_var_1 $ mkUnqual $ mkInfix "^^"
-	)
-happyReduction_145 _  = notHappyAtAll 
-
-happyReduce_146 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_146 = happySpecReduce_1  44 happyReduction_146
-happyReduction_146 (HappyTerminal (Located happy_var_1 (Token (Sym Lt      ) _)))
-	 =  HappyAbsSyn47
-		 (Located happy_var_1 $ mkUnqual $ mkInfix "<"
-	)
-happyReduction_146 _  = notHappyAtAll 
-
-happyReduce_147 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_147 = happySpecReduce_1  44 happyReduction_147
-happyReduction_147 (HappyTerminal (Located happy_var_1 (Token (Sym Gt      ) _)))
-	 =  HappyAbsSyn47
-		 (Located happy_var_1 $ mkUnqual $ mkInfix ">"
-	)
-happyReduction_147 _  = notHappyAtAll 
-
-happyReduce_148 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_148 = happySpecReduce_1  45 happyReduction_148
-happyReduction_148 (HappyTerminal (happy_var_1@(Located _ (Token (Op (Other [] _)) _))))
-	 =  HappyAbsSyn47
-		 (let Token (Op (Other [] str)) _ = thing happy_var_1
-                                       in mkUnqual (mkInfix str) A.<$ happy_var_1
-	)
-happyReduction_148 _  = notHappyAtAll 
-
-happyReduce_149 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_149 = happySpecReduce_1  46 happyReduction_149
-happyReduction_149 (HappyAbsSyn47  happy_var_1)
-	 =  HappyAbsSyn61
-		 ([happy_var_1]
-	)
-happyReduction_149 _  = notHappyAtAll 
-
-happyReduce_150 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_150 = happySpecReduce_3  46 happyReduction_150
-happyReduction_150 (HappyAbsSyn47  happy_var_3)
-	_
-	(HappyAbsSyn61  happy_var_1)
-	 =  HappyAbsSyn61
-		 (happy_var_3 : happy_var_1
-	)
-happyReduction_150 _ _ _  = notHappyAtAll 
-
-happyReduce_151 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_151 = happySpecReduce_1  47 happyReduction_151
-happyReduction_151 (HappyAbsSyn62  happy_var_1)
-	 =  HappyAbsSyn62
-		 (happy_var_1
-	)
-happyReduction_151 _  = notHappyAtAll 
-
-happyReduce_152 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_152 = happySpecReduce_3  47 happyReduction_152
-happyReduction_152 (HappyAbsSyn64  happy_var_3)
-	_
-	(HappyAbsSyn62  happy_var_1)
-	 =  HappyAbsSyn62
-		 (at (happy_var_1,happy_var_3) (EWhere happy_var_1 (thing happy_var_3))
-	)
-happyReduction_152 _ _ _  = notHappyAtAll 
-
-happyReduce_153 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_153 = happySpecReduce_3  48 happyReduction_153
-happyReduction_153 (HappyAbsSyn62  happy_var_3)
-	(HappyAbsSyn47  happy_var_2)
-	(HappyAbsSyn62  happy_var_1)
-	 =  HappyAbsSyn62
-		 (binOp happy_var_1 happy_var_2 happy_var_3
-	)
-happyReduction_153 _ _ _  = notHappyAtAll 
-
-happyReduce_154 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_154 = happySpecReduce_1  48 happyReduction_154
-happyReduction_154 (HappyAbsSyn62  happy_var_1)
-	 =  HappyAbsSyn62
-		 (happy_var_1
-	)
-happyReduction_154 _  = notHappyAtAll 
-
-happyReduce_155 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_155 = happySpecReduce_1  48 happyReduction_155
-happyReduction_155 (HappyAbsSyn62  happy_var_1)
-	 =  HappyAbsSyn62
-		 (happy_var_1
-	)
-happyReduction_155 _  = notHappyAtAll 
-
-happyReduce_156 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_156 = happySpecReduce_2  49 happyReduction_156
-happyReduction_156 (HappyTerminal (Located happy_var_2 (Token (Sym CurlyR  ) _)))
-	(HappyTerminal (Located happy_var_1 (Token (Sym CurlyL  ) _)))
-	 =  HappyAbsSyn64
-		 (Located (rComb happy_var_1 happy_var_2) []
-	)
-happyReduction_156 _ _  = notHappyAtAll 
-
-happyReduce_157 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_157 = happySpecReduce_3  49 happyReduction_157
-happyReduction_157 (HappyTerminal (Located happy_var_3 (Token (Sym CurlyR  ) _)))
-	(HappyAbsSyn42  happy_var_2)
-	(HappyTerminal (Located happy_var_1 (Token (Sym CurlyL  ) _)))
-	 =  HappyAbsSyn64
-		 (Located (rComb happy_var_1 happy_var_3) (reverse happy_var_2)
-	)
-happyReduction_157 _ _ _  = notHappyAtAll 
-
-happyReduce_158 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_158 = happySpecReduce_2  49 happyReduction_158
-happyReduction_158 (HappyTerminal (Located happy_var_2 (Token (Virt VCurlyR)  _)))
-	(HappyTerminal (Located happy_var_1 (Token (Virt VCurlyL)  _)))
-	 =  HappyAbsSyn64
-		 (Located (rComb happy_var_1 happy_var_2) []
-	)
-happyReduction_158 _ _  = notHappyAtAll 
-
-happyReduce_159 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_159 = happySpecReduce_3  49 happyReduction_159
-happyReduction_159 (HappyTerminal (Located happy_var_3 (Token (Virt VCurlyR)  _)))
-	(HappyAbsSyn42  happy_var_2)
-	(HappyTerminal (Located happy_var_1 (Token (Virt VCurlyL)  _)))
-	 =  HappyAbsSyn64
-		 (let l2 = fromMaybe happy_var_3 (getLoc happy_var_2)
-                                    in Located (rComb happy_var_1 l2) (reverse happy_var_2)
-	)
-happyReduction_159 _ _ _  = notHappyAtAll 
-
-happyReduce_160 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_160 = happySpecReduce_3  50 happyReduction_160
-happyReduction_160 (HappyAbsSyn106  happy_var_3)
-	_
-	(HappyAbsSyn62  happy_var_1)
-	 =  HappyAbsSyn62
-		 (at (happy_var_1,happy_var_3) (ETyped happy_var_1 happy_var_3)
-	)
-happyReduction_160 _ _ _  = notHappyAtAll 
-
-happyReduce_161 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_161 = happySpecReduce_3  51 happyReduction_161
-happyReduction_161 (HappyAbsSyn62  happy_var_3)
-	(HappyAbsSyn47  happy_var_2)
-	(HappyAbsSyn62  happy_var_1)
-	 =  HappyAbsSyn62
-		 (binOp happy_var_1 happy_var_2 happy_var_3
-	)
-happyReduction_161 _ _ _  = notHappyAtAll 
-
-happyReduce_162 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_162 = happySpecReduce_1  51 happyReduction_162
-happyReduction_162 (HappyAbsSyn62  happy_var_1)
-	 =  HappyAbsSyn62
-		 (happy_var_1
-	)
-happyReduction_162 _  = notHappyAtAll 
-
-happyReduce_163 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_163 = happyReduce 4 52 happyReduction_163
-happyReduction_163 ((HappyAbsSyn62  happy_var_4) `HappyStk`
-	_ `HappyStk`
-	(HappyAbsSyn68  happy_var_2) `HappyStk`
-	(HappyTerminal (Located happy_var_1 (Token (KW KW_if     ) _))) `HappyStk`
-	happyRest)
-	 = HappyAbsSyn62
-		 (at (happy_var_1,happy_var_4) $ mkIf (reverse happy_var_2) happy_var_4
-	) `HappyStk` happyRest
-
-happyReduce_164 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_164 = happyReduce 4 52 happyReduction_164
-happyReduction_164 ((HappyAbsSyn62  happy_var_4) `HappyStk`
-	_ `HappyStk`
-	(HappyAbsSyn48  happy_var_2) `HappyStk`
-	(HappyTerminal (Located happy_var_1 (Token (Sym Lambda  ) _))) `HappyStk`
-	happyRest)
-	 = HappyAbsSyn62
-		 (at (happy_var_1,happy_var_4) $ EFun emptyFunDesc (reverse happy_var_2) happy_var_4
-	) `HappyStk` happyRest
-
-happyReduce_165 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_165 = happySpecReduce_1  53 happyReduction_165
-happyReduction_165 (HappyAbsSyn69  happy_var_1)
-	 =  HappyAbsSyn68
-		 ([happy_var_1]
-	)
-happyReduction_165 _  = notHappyAtAll 
-
-happyReduce_166 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_166 = happySpecReduce_3  53 happyReduction_166
-happyReduction_166 (HappyAbsSyn69  happy_var_3)
-	_
-	(HappyAbsSyn68  happy_var_1)
-	 =  HappyAbsSyn68
-		 (happy_var_3 : happy_var_1
-	)
-happyReduction_166 _ _ _  = notHappyAtAll 
-
-happyReduce_167 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_167 = happySpecReduce_3  54 happyReduction_167
-happyReduction_167 (HappyAbsSyn62  happy_var_3)
-	_
-	(HappyAbsSyn62  happy_var_1)
-	 =  HappyAbsSyn69
-		 ((happy_var_1, happy_var_3)
-	)
-happyReduction_167 _ _ _  = notHappyAtAll 
-
-happyReduce_168 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_168 = happySpecReduce_2  55 happyReduction_168
-happyReduction_168 (HappyAbsSyn62  happy_var_2)
-	(HappyTerminal (Located happy_var_1 (Token (Op Minus) _)))
-	 =  HappyAbsSyn62
-		 (at (happy_var_1,happy_var_2) (ENeg happy_var_2)
-	)
-happyReduction_168 _ _  = notHappyAtAll 
-
-happyReduce_169 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_169 = happySpecReduce_2  55 happyReduction_169
-happyReduction_169 (HappyAbsSyn62  happy_var_2)
-	(HappyTerminal (Located happy_var_1 (Token (Op Complement) _)))
-	 =  HappyAbsSyn62
-		 (at (happy_var_1,happy_var_2) (EComplement happy_var_2)
-	)
-happyReduction_169 _ _  = notHappyAtAll 
-
-happyReduce_170 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_170 = happySpecReduce_1  55 happyReduction_170
-happyReduction_170 (HappyAbsSyn62  happy_var_1)
-	 =  HappyAbsSyn62
-		 (happy_var_1
-	)
-happyReduction_170 _  = notHappyAtAll 
-
-happyReduce_171 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_171 = happySpecReduce_2  56 happyReduction_171
-happyReduction_171 (HappyAbsSyn62  happy_var_2)
-	(HappyTerminal (Located happy_var_1 (Token (Op Minus) _)))
-	 =  HappyAbsSyn62
-		 (at (happy_var_1,happy_var_2) (ENeg happy_var_2)
-	)
-happyReduction_171 _ _  = notHappyAtAll 
-
-happyReduce_172 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_172 = happySpecReduce_2  56 happyReduction_172
-happyReduction_172 (HappyAbsSyn62  happy_var_2)
-	(HappyTerminal (Located happy_var_1 (Token (Op Complement) _)))
-	 =  HappyAbsSyn62
-		 (at (happy_var_1,happy_var_2) (EComplement happy_var_2)
-	)
-happyReduction_172 _ _  = notHappyAtAll 
-
-happyReduce_173 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_173 = happySpecReduce_1  56 happyReduction_173
-happyReduction_173 (HappyAbsSyn62  happy_var_1)
-	 =  HappyAbsSyn62
-		 (happy_var_1
-	)
-happyReduction_173 _  = notHappyAtAll 
-
-happyReduce_174 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_174 = happyMonadReduce 1 57 happyReduction_174
-happyReduction_174 ((HappyAbsSyn74  happy_var_1) `HappyStk`
-	happyRest) tk
-	 = happyThen ((( mkEApp happy_var_1))
-	) (\r -> happyReturn (HappyAbsSyn62 r))
-
-happyReduce_175 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_175 = happySpecReduce_2  58 happyReduction_175
-happyReduction_175 (HappyAbsSyn62  happy_var_2)
-	(HappyAbsSyn62  happy_var_1)
-	 =  HappyAbsSyn62
-		 (at (happy_var_1,happy_var_2) (EApp happy_var_1 happy_var_2)
-	)
-happyReduction_175 _ _  = notHappyAtAll 
-
-happyReduce_176 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_176 = happySpecReduce_1  58 happyReduction_176
-happyReduction_176 (HappyAbsSyn62  happy_var_1)
-	 =  HappyAbsSyn62
-		 (happy_var_1
-	)
-happyReduction_176 _  = notHappyAtAll 
-
-happyReduce_177 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_177 = happySpecReduce_1  58 happyReduction_177
-happyReduction_177 (HappyAbsSyn62  happy_var_1)
-	 =  HappyAbsSyn62
-		 (happy_var_1
-	)
-happyReduction_177 _  = notHappyAtAll 
-
-happyReduce_178 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_178 = happySpecReduce_1  59 happyReduction_178
-happyReduction_178 (HappyAbsSyn62  happy_var_1)
-	 =  HappyAbsSyn74
-		 (happy_var_1 :| []
-	)
-happyReduction_178 _  = notHappyAtAll 
-
-happyReduce_179 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_179 = happySpecReduce_2  59 happyReduction_179
-happyReduction_179 (HappyAbsSyn62  happy_var_2)
-	(HappyAbsSyn74  happy_var_1)
-	 =  HappyAbsSyn74
-		 (cons happy_var_2 happy_var_1
-	)
-happyReduction_179 _ _  = notHappyAtAll 
-
-happyReduce_180 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_180 = happySpecReduce_1  60 happyReduction_180
-happyReduction_180 (HappyAbsSyn62  happy_var_1)
-	 =  HappyAbsSyn62
-		 (happy_var_1
-	)
-happyReduction_180 _  = notHappyAtAll 
-
-happyReduce_181 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_181 = happySpecReduce_1  60 happyReduction_181
-happyReduction_181 (HappyAbsSyn62  happy_var_1)
-	 =  HappyAbsSyn62
-		 (happy_var_1
-	)
-happyReduction_181 _  = notHappyAtAll 
-
-happyReduce_182 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_182 = happySpecReduce_1  61 happyReduction_182
-happyReduction_182 (HappyAbsSyn119  happy_var_1)
-	 =  HappyAbsSyn62
-		 (at happy_var_1 $ EVar (thing happy_var_1)
-	)
-happyReduction_182 _  = notHappyAtAll 
-
-happyReduce_183 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_183 = happySpecReduce_1  61 happyReduction_183
-happyReduction_183 (HappyTerminal (happy_var_1@(Located _ (Token (Num   {}) _))))
-	 =  HappyAbsSyn62
-		 (at happy_var_1 $ numLit (thing happy_var_1)
-	)
-happyReduction_183 _  = notHappyAtAll 
-
-happyReduce_184 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_184 = happySpecReduce_1  61 happyReduction_184
-happyReduction_184 (HappyTerminal (happy_var_1@(Located _ (Token (Frac  {}) _))))
-	 =  HappyAbsSyn62
-		 (at happy_var_1 $ fracLit (thing happy_var_1)
-	)
-happyReduction_184 _  = notHappyAtAll 
-
-happyReduce_185 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_185 = happySpecReduce_1  61 happyReduction_185
-happyReduction_185 (HappyTerminal (happy_var_1@(Located _ (Token (StrLit {}) _))))
-	 =  HappyAbsSyn62
-		 (at happy_var_1 $ ELit $ ECString $ getStr happy_var_1
-	)
-happyReduction_185 _  = notHappyAtAll 
-
-happyReduce_186 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_186 = happySpecReduce_1  61 happyReduction_186
-happyReduction_186 (HappyTerminal (happy_var_1@(Located _ (Token (ChrLit {}) _))))
-	 =  HappyAbsSyn62
-		 (at happy_var_1 $ ELit $ ECChar $ getChr happy_var_1
-	)
-happyReduction_186 _  = notHappyAtAll 
-
-happyReduce_187 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_187 = happySpecReduce_1  61 happyReduction_187
-happyReduction_187 (HappyTerminal (Located happy_var_1 (Token (Sym Underscore ) _)))
-	 =  HappyAbsSyn62
-		 (at happy_var_1 $ EVar $ mkUnqual $ mkIdent "_"
-	)
-happyReduction_187 _  = notHappyAtAll 
-
-happyReduce_188 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_188 = happySpecReduce_3  61 happyReduction_188
-happyReduction_188 (HappyTerminal (Located happy_var_3 (Token (Sym ParenR  ) _)))
-	(HappyAbsSyn62  happy_var_2)
-	(HappyTerminal (Located happy_var_1 (Token (Sym ParenL  ) _)))
-	 =  HappyAbsSyn62
-		 (at (happy_var_1,happy_var_3) $ EParens happy_var_2
-	)
-happyReduction_188 _ _ _  = notHappyAtAll 
-
-happyReduce_189 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_189 = happySpecReduce_3  61 happyReduction_189
-happyReduction_189 (HappyTerminal (Located happy_var_3 (Token (Sym ParenR  ) _)))
-	(HappyAbsSyn81  happy_var_2)
-	(HappyTerminal (Located happy_var_1 (Token (Sym ParenL  ) _)))
-	 =  HappyAbsSyn62
-		 (at (happy_var_1,happy_var_3) $ ETuple (reverse happy_var_2)
-	)
-happyReduction_189 _ _ _  = notHappyAtAll 
-
-happyReduce_190 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_190 = happySpecReduce_2  61 happyReduction_190
-happyReduction_190 (HappyTerminal (Located happy_var_2 (Token (Sym ParenR  ) _)))
-	(HappyTerminal (Located happy_var_1 (Token (Sym ParenL  ) _)))
-	 =  HappyAbsSyn62
-		 (at (happy_var_1,happy_var_2) $ ETuple []
-	)
-happyReduction_190 _ _  = notHappyAtAll 
-
-happyReduce_191 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_191 = happyMonadReduce 2 61 happyReduction_191
-happyReduction_191 ((HappyTerminal (Located happy_var_2 (Token (Sym CurlyR  ) _))) `HappyStk`
-	(HappyTerminal (Located happy_var_1 (Token (Sym CurlyL  ) _))) `HappyStk`
-	happyRest) tk
-	 = happyThen ((( mkRecord (rComb happy_var_1 happy_var_2) ERecord []))
-	) (\r -> happyReturn (HappyAbsSyn62 r))
-
-happyReduce_192 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_192 = happyMonadReduce 3 61 happyReduction_192
-happyReduction_192 ((HappyTerminal (Located happy_var_3 (Token (Sym CurlyR  ) _))) `HappyStk`
-	(HappyAbsSyn82  happy_var_2) `HappyStk`
-	(HappyTerminal (Located happy_var_1 (Token (Sym CurlyL  ) _))) `HappyStk`
-	happyRest) tk
-	 = happyThen ((( case happy_var_2 of {
-                                       Left upd -> pure $ at (happy_var_1,happy_var_3) upd;
-                                       Right fs -> mkRecord (rComb happy_var_1 happy_var_3) ERecord fs; }))
-	) (\r -> happyReturn (HappyAbsSyn62 r))
-
-happyReduce_193 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_193 = happySpecReduce_2  61 happyReduction_193
-happyReduction_193 (HappyTerminal (Located happy_var_2 (Token (Sym BracketR) _)))
-	(HappyTerminal (Located happy_var_1 (Token (Sym BracketL) _)))
-	 =  HappyAbsSyn62
-		 (at (happy_var_1,happy_var_2) $ EList []
-	)
-happyReduction_193 _ _  = notHappyAtAll 
-
-happyReduce_194 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_194 = happySpecReduce_3  61 happyReduction_194
-happyReduction_194 (HappyTerminal (Located happy_var_3 (Token (Sym BracketR) _)))
-	(HappyAbsSyn62  happy_var_2)
-	(HappyTerminal (Located happy_var_1 (Token (Sym BracketL) _)))
-	 =  HappyAbsSyn62
-		 (at (happy_var_1,happy_var_3) happy_var_2
-	)
-happyReduction_194 _ _ _  = notHappyAtAll 
-
-happyReduce_195 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_195 = happySpecReduce_2  61 happyReduction_195
-happyReduction_195 (HappyAbsSyn106  happy_var_2)
-	(HappyTerminal (Located happy_var_1 (Token (Sym BackTick) _)))
-	 =  HappyAbsSyn62
-		 (at (happy_var_1,happy_var_2) $ ETypeVal happy_var_2
-	)
-happyReduction_195 _ _  = notHappyAtAll 
-
-happyReduce_196 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_196 = happySpecReduce_3  61 happyReduction_196
-happyReduction_196 (HappyTerminal (Located happy_var_3 (Token (Sym ParenR  ) _)))
-	(HappyAbsSyn47  happy_var_2)
-	(HappyTerminal (Located happy_var_1 (Token (Sym ParenL  ) _)))
-	 =  HappyAbsSyn62
-		 (at (happy_var_1,happy_var_3) $ EVar $ thing happy_var_2
-	)
-happyReduction_196 _ _ _  = notHappyAtAll 
-
-happyReduce_197 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_197 = happyMonadReduce 2 61 happyReduction_197
-happyReduction_197 ((HappyTerminal (Located happy_var_2 (Token (Sym TriR    ) _))) `HappyStk`
-	(HappyTerminal (Located happy_var_1 (Token (Sym TriL    ) _))) `HappyStk`
-	happyRest) tk
-	 = happyThen ((( mkPoly (rComb happy_var_1 happy_var_2) []))
-	) (\r -> happyReturn (HappyAbsSyn62 r))
-
-happyReduce_198 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_198 = happyMonadReduce 3 61 happyReduction_198
-happyReduction_198 ((HappyTerminal (Located happy_var_3 (Token (Sym TriR    ) _))) `HappyStk`
-	(HappyAbsSyn79  happy_var_2) `HappyStk`
-	(HappyTerminal (Located happy_var_1 (Token (Sym TriL    ) _))) `HappyStk`
-	happyRest) tk
-	 = happyThen ((( mkPoly (rComb happy_var_1 happy_var_3) happy_var_2))
-	) (\r -> happyReturn (HappyAbsSyn62 r))
-
-happyReduce_199 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_199 = happySpecReduce_2  62 happyReduction_199
-happyReduction_199 (HappyAbsSyn78  happy_var_2)
-	(HappyAbsSyn62  happy_var_1)
-	 =  HappyAbsSyn62
-		 (at (happy_var_1,happy_var_2) $ ESel happy_var_1 (thing happy_var_2)
-	)
-happyReduction_199 _ _  = notHappyAtAll 
-
-happyReduce_200 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_200 = happySpecReduce_2  62 happyReduction_200
-happyReduction_200 (HappyAbsSyn78  happy_var_2)
-	(HappyAbsSyn62  happy_var_1)
-	 =  HappyAbsSyn62
-		 (at (happy_var_1,happy_var_2) $ ESel happy_var_1 (thing happy_var_2)
-	)
-happyReduction_200 _ _  = notHappyAtAll 
-
-happyReduce_201 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_201 = happySpecReduce_1  63 happyReduction_201
-happyReduction_201 (HappyTerminal (happy_var_1@(Located _ (Token  (Selector _) _))))
-	 =  HappyAbsSyn78
-		 (mkSelector `fmap` happy_var_1
-	)
-happyReduction_201 _  = notHappyAtAll 
-
-happyReduce_202 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_202 = happySpecReduce_1  64 happyReduction_202
-happyReduction_202 (HappyAbsSyn80  happy_var_1)
-	 =  HappyAbsSyn79
-		 ([happy_var_1]
-	)
-happyReduction_202 _  = notHappyAtAll 
-
-happyReduce_203 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_203 = happySpecReduce_3  64 happyReduction_203
-happyReduction_203 (HappyAbsSyn80  happy_var_3)
-	_
-	(HappyAbsSyn79  happy_var_1)
-	 =  HappyAbsSyn79
-		 (happy_var_3 : happy_var_1
-	)
-happyReduction_203 _ _ _  = notHappyAtAll 
-
-happyReduce_204 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_204 = happyMonadReduce 1 65 happyReduction_204
-happyReduction_204 ((HappyTerminal (happy_var_1@(Located _ (Token (Num   {}) _)))) `HappyStk`
-	happyRest) tk
-	 = happyThen ((( polyTerm (srcRange happy_var_1) (getNum happy_var_1) 0))
-	) (\r -> happyReturn (HappyAbsSyn80 r))
-
-happyReduce_205 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_205 = happyMonadReduce 1 65 happyReduction_205
-happyReduction_205 ((HappyTerminal (Located happy_var_1 (Token (KW KW_x)       _))) `HappyStk`
-	happyRest) tk
-	 = happyThen ((( polyTerm happy_var_1 1 1))
-	) (\r -> happyReturn (HappyAbsSyn80 r))
-
-happyReduce_206 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_206 = happyMonadReduce 3 65 happyReduction_206
-happyReduction_206 ((HappyTerminal (happy_var_3@(Located _ (Token (Num   {}) _)))) `HappyStk`
-	_ `HappyStk`
-	(HappyTerminal (Located happy_var_1 (Token (KW KW_x)       _))) `HappyStk`
-	happyRest) tk
-	 = happyThen ((( polyTerm (rComb happy_var_1 (srcRange happy_var_3))
-                                                            1 (getNum happy_var_3)))
-	) (\r -> happyReturn (HappyAbsSyn80 r))
-
-happyReduce_207 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_207 = happySpecReduce_3  66 happyReduction_207
-happyReduction_207 (HappyAbsSyn62  happy_var_3)
-	_
-	(HappyAbsSyn62  happy_var_1)
-	 =  HappyAbsSyn81
-		 ([ happy_var_3, happy_var_1]
-	)
-happyReduction_207 _ _ _  = notHappyAtAll 
-
-happyReduce_208 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_208 = happySpecReduce_3  66 happyReduction_208
-happyReduction_208 (HappyAbsSyn62  happy_var_3)
-	_
-	(HappyAbsSyn81  happy_var_1)
-	 =  HappyAbsSyn81
-		 (happy_var_3 : happy_var_1
-	)
-happyReduction_208 _ _ _  = notHappyAtAll 
-
-happyReduce_209 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_209 = happySpecReduce_3  67 happyReduction_209
-happyReduction_209 (HappyAbsSyn83  happy_var_3)
-	_
-	(HappyAbsSyn62  happy_var_1)
-	 =  HappyAbsSyn82
-		 (Left (EUpd (Just happy_var_1) (reverse happy_var_3))
-	)
-happyReduction_209 _ _ _  = notHappyAtAll 
-
-happyReduce_210 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_210 = happySpecReduce_3  67 happyReduction_210
-happyReduction_210 (HappyAbsSyn83  happy_var_3)
-	_
-	_
-	 =  HappyAbsSyn82
-		 (Left (EUpd Nothing   (reverse happy_var_3))
-	)
-happyReduction_210 _ _ _  = notHappyAtAll 
-
-happyReduce_211 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_211 = happyMonadReduce 1 67 happyReduction_211
-happyReduction_211 ((HappyAbsSyn83  happy_var_1) `HappyStk`
-	happyRest) tk
-	 = happyThen ((( Right `fmap` mapM ufToNamed happy_var_1))
-	) (\r -> happyReturn (HappyAbsSyn82 r))
-
-happyReduce_212 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_212 = happySpecReduce_1  68 happyReduction_212
-happyReduction_212 (HappyAbsSyn84  happy_var_1)
-	 =  HappyAbsSyn83
-		 ([happy_var_1]
-	)
-happyReduction_212 _  = notHappyAtAll 
-
-happyReduce_213 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_213 = happySpecReduce_3  68 happyReduction_213
-happyReduction_213 (HappyAbsSyn84  happy_var_3)
-	_
-	(HappyAbsSyn83  happy_var_1)
-	 =  HappyAbsSyn83
-		 (happy_var_3 : happy_var_1
-	)
-happyReduction_213 _ _ _  = notHappyAtAll 
-
-happyReduce_214 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_214 = happyReduce 4 69 happyReduction_214
-happyReduction_214 ((HappyAbsSyn62  happy_var_4) `HappyStk`
-	(HappyAbsSyn86  happy_var_3) `HappyStk`
-	(HappyAbsSyn51  happy_var_2) `HappyStk`
-	(HappyAbsSyn85  happy_var_1) `HappyStk`
-	happyRest)
-	 = HappyAbsSyn84
-		 (UpdField happy_var_3 happy_var_1 (mkIndexedExpr happy_var_2 happy_var_4)
-	) `HappyStk` happyRest
-
-happyReduce_215 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_215 = happyMonadReduce 1 70 happyReduction_215
-happyReduction_215 ((HappyAbsSyn62  happy_var_1) `HappyStk`
-	happyRest) tk
-	 = happyThen ((( exprToFieldPath happy_var_1))
-	) (\r -> happyReturn (HappyAbsSyn85 r))
-
-happyReduce_216 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_216 = happySpecReduce_1  71 happyReduction_216
-happyReduction_216 _
-	 =  HappyAbsSyn86
-		 (UpdSet
-	)
-
-happyReduce_217 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_217 = happySpecReduce_1  71 happyReduction_217
-happyReduction_217 _
-	 =  HappyAbsSyn86
-		 (UpdFun
-	)
-
-happyReduce_218 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_218 = happySpecReduce_3  72 happyReduction_218
-happyReduction_218 (HappyAbsSyn88  happy_var_3)
-	_
-	(HappyAbsSyn62  happy_var_1)
-	 =  HappyAbsSyn62
-		 (EComp happy_var_1 (reverse happy_var_3)
-	)
-happyReduction_218 _ _ _  = notHappyAtAll 
-
-happyReduce_219 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_219 = happySpecReduce_1  72 happyReduction_219
-happyReduction_219 (HappyAbsSyn62  happy_var_1)
-	 =  HappyAbsSyn62
-		 (EList [happy_var_1]
-	)
-happyReduction_219 _  = notHappyAtAll 
-
-happyReduce_220 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_220 = happySpecReduce_1  72 happyReduction_220
-happyReduction_220 (HappyAbsSyn81  happy_var_1)
-	 =  HappyAbsSyn62
-		 (EList (reverse happy_var_1)
-	)
-happyReduction_220 _  = notHappyAtAll 
-
-happyReduce_221 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_221 = happyMonadReduce 3 72 happyReduction_221
-happyReduction_221 ((HappyAbsSyn62  happy_var_3) `HappyStk`
-	(HappyTerminal (Located happy_var_2 (Token (Sym DotDot  ) _))) `HappyStk`
-	(HappyAbsSyn62  happy_var_1) `HappyStk`
-	happyRest) tk
-	 = happyThen ((( eFromTo happy_var_2 happy_var_1 Nothing   happy_var_3))
-	) (\r -> happyReturn (HappyAbsSyn62 r))
-
-happyReduce_222 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_222 = happyMonadReduce 5 72 happyReduction_222
-happyReduction_222 ((HappyAbsSyn62  happy_var_5) `HappyStk`
-	(HappyTerminal (Located happy_var_4 (Token (Sym DotDot  ) _))) `HappyStk`
-	(HappyAbsSyn62  happy_var_3) `HappyStk`
-	_ `HappyStk`
-	(HappyAbsSyn62  happy_var_1) `HappyStk`
-	happyRest) tk
-	 = happyThen ((( eFromTo happy_var_4 happy_var_1 (Just happy_var_3) happy_var_5))
-	) (\r -> happyReturn (HappyAbsSyn62 r))
-
-happyReduce_223 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_223 = happyMonadReduce 4 72 happyReduction_223
-happyReduction_223 ((HappyAbsSyn62  happy_var_4) `HappyStk`
-	_ `HappyStk`
-	(HappyTerminal (Located happy_var_2 (Token (Sym DotDot  ) _))) `HappyStk`
-	(HappyAbsSyn62  happy_var_1) `HappyStk`
-	happyRest) tk
-	 = happyThen ((( eFromToLessThan happy_var_2 happy_var_1 happy_var_4))
-	) (\r -> happyReturn (HappyAbsSyn62 r))
-
-happyReduce_224 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_224 = happyMonadReduce 3 72 happyReduction_224
-happyReduction_224 ((HappyAbsSyn62  happy_var_3) `HappyStk`
-	(HappyTerminal (Located happy_var_2 (Token (Sym DotDotLt) _))) `HappyStk`
-	(HappyAbsSyn62  happy_var_1) `HappyStk`
-	happyRest) tk
-	 = happyThen ((( eFromToLessThan happy_var_2 happy_var_1 happy_var_3))
-	) (\r -> happyReturn (HappyAbsSyn62 r))
-
-happyReduce_225 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_225 = happyMonadReduce 5 72 happyReduction_225
-happyReduction_225 ((HappyAbsSyn62  happy_var_5) `HappyStk`
-	_ `HappyStk`
-	(HappyAbsSyn62  happy_var_3) `HappyStk`
-	(HappyTerminal (Located happy_var_2 (Token (Sym DotDot  ) _))) `HappyStk`
-	(HappyAbsSyn62  happy_var_1) `HappyStk`
-	happyRest) tk
-	 = happyThen ((( eFromToBy happy_var_2 happy_var_1 happy_var_3 happy_var_5 False))
-	) (\r -> happyReturn (HappyAbsSyn62 r))
-
-happyReduce_226 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_226 = happyMonadReduce 6 72 happyReduction_226
-happyReduction_226 ((HappyAbsSyn62  happy_var_6) `HappyStk`
-	_ `HappyStk`
-	(HappyAbsSyn62  happy_var_4) `HappyStk`
-	_ `HappyStk`
-	(HappyTerminal (Located happy_var_2 (Token (Sym DotDot  ) _))) `HappyStk`
-	(HappyAbsSyn62  happy_var_1) `HappyStk`
-	happyRest) tk
-	 = happyThen ((( eFromToBy happy_var_2 happy_var_1 happy_var_4 happy_var_6 True))
-	) (\r -> happyReturn (HappyAbsSyn62 r))
-
-happyReduce_227 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_227 = happyMonadReduce 5 72 happyReduction_227
-happyReduction_227 ((HappyAbsSyn62  happy_var_5) `HappyStk`
-	_ `HappyStk`
-	(HappyAbsSyn62  happy_var_3) `HappyStk`
-	(HappyTerminal (Located happy_var_2 (Token (Sym DotDotLt) _))) `HappyStk`
-	(HappyAbsSyn62  happy_var_1) `HappyStk`
-	happyRest) tk
-	 = happyThen ((( eFromToBy happy_var_2 happy_var_1 happy_var_3 happy_var_5 True))
-	) (\r -> happyReturn (HappyAbsSyn62 r))
-
-happyReduce_228 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_228 = happyMonadReduce 6 72 happyReduction_228
-happyReduction_228 ((HappyAbsSyn62  happy_var_6) `HappyStk`
-	_ `HappyStk`
-	_ `HappyStk`
-	(HappyAbsSyn62  happy_var_3) `HappyStk`
-	(HappyTerminal (Located happy_var_2 (Token (Sym DotDot  ) _))) `HappyStk`
-	(HappyAbsSyn62  happy_var_1) `HappyStk`
-	happyRest) tk
-	 = happyThen ((( eFromToDownBy happy_var_2 happy_var_1 happy_var_3 happy_var_6 False))
-	) (\r -> happyReturn (HappyAbsSyn62 r))
-
-happyReduce_229 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_229 = happyMonadReduce 7 72 happyReduction_229
-happyReduction_229 ((HappyAbsSyn62  happy_var_7) `HappyStk`
-	_ `HappyStk`
-	_ `HappyStk`
-	(HappyAbsSyn62  happy_var_4) `HappyStk`
-	_ `HappyStk`
-	(HappyTerminal (Located happy_var_2 (Token (Sym DotDot  ) _))) `HappyStk`
-	(HappyAbsSyn62  happy_var_1) `HappyStk`
-	happyRest) tk
-	 = happyThen ((( eFromToDownBy happy_var_2 happy_var_1 happy_var_4 happy_var_7 True))
-	) (\r -> happyReturn (HappyAbsSyn62 r))
-
-happyReduce_230 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_230 = happyMonadReduce 6 72 happyReduction_230
-happyReduction_230 ((HappyAbsSyn62  happy_var_6) `HappyStk`
-	_ `HappyStk`
-	_ `HappyStk`
-	(HappyAbsSyn62  happy_var_3) `HappyStk`
-	(HappyTerminal (Located happy_var_2 (Token (Sym DotDotGt) _))) `HappyStk`
-	(HappyAbsSyn62  happy_var_1) `HappyStk`
-	happyRest) tk
-	 = happyThen ((( eFromToDownBy happy_var_2 happy_var_1 happy_var_3 happy_var_6 True))
-	) (\r -> happyReturn (HappyAbsSyn62 r))
-
-happyReduce_231 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_231 = happySpecReduce_2  72 happyReduction_231
-happyReduction_231 _
-	(HappyAbsSyn62  happy_var_1)
-	 =  HappyAbsSyn62
-		 (EInfFrom happy_var_1 Nothing
-	)
-happyReduction_231 _ _  = notHappyAtAll 
-
-happyReduce_232 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_232 = happyReduce 4 72 happyReduction_232
-happyReduction_232 (_ `HappyStk`
-	(HappyAbsSyn62  happy_var_3) `HappyStk`
-	_ `HappyStk`
-	(HappyAbsSyn62  happy_var_1) `HappyStk`
-	happyRest)
-	 = HappyAbsSyn62
-		 (EInfFrom happy_var_1 (Just happy_var_3)
-	) `HappyStk` happyRest
-
-happyReduce_233 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_233 = happySpecReduce_1  73 happyReduction_233
-happyReduction_233 (HappyAbsSyn89  happy_var_1)
-	 =  HappyAbsSyn88
-		 ([ reverse happy_var_1 ]
-	)
-happyReduction_233 _  = notHappyAtAll 
-
-happyReduce_234 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_234 = happySpecReduce_3  73 happyReduction_234
-happyReduction_234 (HappyAbsSyn89  happy_var_3)
-	_
-	(HappyAbsSyn88  happy_var_1)
-	 =  HappyAbsSyn88
-		 (reverse happy_var_3 : happy_var_1
-	)
-happyReduction_234 _ _ _  = notHappyAtAll 
-
-happyReduce_235 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_235 = happySpecReduce_1  74 happyReduction_235
-happyReduction_235 (HappyAbsSyn90  happy_var_1)
-	 =  HappyAbsSyn89
-		 ([happy_var_1]
-	)
-happyReduction_235 _  = notHappyAtAll 
-
-happyReduce_236 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_236 = happySpecReduce_3  74 happyReduction_236
-happyReduction_236 (HappyAbsSyn90  happy_var_3)
-	_
-	(HappyAbsSyn89  happy_var_1)
-	 =  HappyAbsSyn89
-		 (happy_var_3 : happy_var_1
-	)
-happyReduction_236 _ _ _  = notHappyAtAll 
-
-happyReduce_237 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_237 = happySpecReduce_3  75 happyReduction_237
-happyReduction_237 (HappyAbsSyn62  happy_var_3)
-	_
-	(HappyAbsSyn91  happy_var_1)
-	 =  HappyAbsSyn90
-		 (Match happy_var_1 happy_var_3
-	)
-happyReduction_237 _ _ _  = notHappyAtAll 
-
-happyReduce_238 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_238 = happySpecReduce_3  76 happyReduction_238
-happyReduction_238 (HappyAbsSyn106  happy_var_3)
-	_
-	(HappyAbsSyn91  happy_var_1)
-	 =  HappyAbsSyn91
-		 (at (happy_var_1,happy_var_3) $ PTyped happy_var_1 happy_var_3
-	)
-happyReduction_238 _ _ _  = notHappyAtAll 
-
-happyReduce_239 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_239 = happySpecReduce_1  76 happyReduction_239
-happyReduction_239 (HappyAbsSyn91  happy_var_1)
-	 =  HappyAbsSyn91
-		 (happy_var_1
-	)
-happyReduction_239 _  = notHappyAtAll 
-
-happyReduce_240 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_240 = happySpecReduce_3  77 happyReduction_240
-happyReduction_240 (HappyAbsSyn91  happy_var_3)
-	_
-	(HappyAbsSyn91  happy_var_1)
-	 =  HappyAbsSyn91
-		 (at (happy_var_1,happy_var_3) $ PSplit happy_var_1 happy_var_3
-	)
-happyReduction_240 _ _ _  = notHappyAtAll 
-
-happyReduce_241 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_241 = happySpecReduce_1  77 happyReduction_241
-happyReduction_241 (HappyAbsSyn91  happy_var_1)
-	 =  HappyAbsSyn91
-		 (happy_var_1
-	)
-happyReduction_241 _  = notHappyAtAll 
-
-happyReduce_242 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_242 = happySpecReduce_1  78 happyReduction_242
-happyReduction_242 (HappyAbsSyn47  happy_var_1)
-	 =  HappyAbsSyn91
-		 (PVar happy_var_1
-	)
-happyReduction_242 _  = notHappyAtAll 
-
-happyReduce_243 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_243 = happySpecReduce_1  78 happyReduction_243
-happyReduction_243 (HappyTerminal (Located happy_var_1 (Token (Sym Underscore ) _)))
-	 =  HappyAbsSyn91
-		 (at happy_var_1       $ PWild
-	)
-happyReduction_243 _  = notHappyAtAll 
-
-happyReduce_244 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_244 = happySpecReduce_2  78 happyReduction_244
-happyReduction_244 (HappyTerminal (Located happy_var_2 (Token (Sym ParenR  ) _)))
-	(HappyTerminal (Located happy_var_1 (Token (Sym ParenL  ) _)))
-	 =  HappyAbsSyn91
-		 (at (happy_var_1,happy_var_2) $ PTuple []
-	)
-happyReduction_244 _ _  = notHappyAtAll 
-
-happyReduce_245 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_245 = happySpecReduce_3  78 happyReduction_245
-happyReduction_245 (HappyTerminal (Located happy_var_3 (Token (Sym ParenR  ) _)))
-	(HappyAbsSyn91  happy_var_2)
-	(HappyTerminal (Located happy_var_1 (Token (Sym ParenL  ) _)))
-	 =  HappyAbsSyn91
-		 (at (happy_var_1,happy_var_3)   happy_var_2
-	)
-happyReduction_245 _ _ _  = notHappyAtAll 
-
-happyReduce_246 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_246 = happySpecReduce_3  78 happyReduction_246
-happyReduction_246 (HappyTerminal (Located happy_var_3 (Token (Sym ParenR  ) _)))
-	(HappyAbsSyn48  happy_var_2)
-	(HappyTerminal (Located happy_var_1 (Token (Sym ParenL  ) _)))
-	 =  HappyAbsSyn91
-		 (at (happy_var_1,happy_var_3) $ PTuple (reverse happy_var_2)
-	)
-happyReduction_246 _ _ _  = notHappyAtAll 
-
-happyReduce_247 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_247 = happySpecReduce_2  78 happyReduction_247
-happyReduction_247 (HappyTerminal (Located happy_var_2 (Token (Sym BracketR) _)))
-	(HappyTerminal (Located happy_var_1 (Token (Sym BracketL) _)))
-	 =  HappyAbsSyn91
-		 (at (happy_var_1,happy_var_2) $ PList []
-	)
-happyReduction_247 _ _  = notHappyAtAll 
-
-happyReduce_248 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_248 = happySpecReduce_3  78 happyReduction_248
-happyReduction_248 (HappyTerminal (Located happy_var_3 (Token (Sym BracketR) _)))
-	(HappyAbsSyn91  happy_var_2)
-	(HappyTerminal (Located happy_var_1 (Token (Sym BracketL) _)))
-	 =  HappyAbsSyn91
-		 (at (happy_var_1,happy_var_3) $ PList [happy_var_2]
-	)
-happyReduction_248 _ _ _  = notHappyAtAll 
-
-happyReduce_249 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_249 = happySpecReduce_3  78 happyReduction_249
-happyReduction_249 (HappyTerminal (Located happy_var_3 (Token (Sym BracketR) _)))
-	(HappyAbsSyn48  happy_var_2)
-	(HappyTerminal (Located happy_var_1 (Token (Sym BracketL) _)))
-	 =  HappyAbsSyn91
-		 (at (happy_var_1,happy_var_3) $ PList (reverse happy_var_2)
-	)
-happyReduction_249 _ _ _  = notHappyAtAll 
-
-happyReduce_250 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_250 = happyMonadReduce 2 78 happyReduction_250
-happyReduction_250 ((HappyTerminal (Located happy_var_2 (Token (Sym CurlyR  ) _))) `HappyStk`
-	(HappyTerminal (Located happy_var_1 (Token (Sym CurlyL  ) _))) `HappyStk`
-	happyRest) tk
-	 = happyThen ((( mkRecord (rComb happy_var_1 happy_var_2) PRecord []))
-	) (\r -> happyReturn (HappyAbsSyn91 r))
-
-happyReduce_251 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_251 = happyMonadReduce 3 78 happyReduction_251
-happyReduction_251 ((HappyTerminal (Located happy_var_3 (Token (Sym CurlyR  ) _))) `HappyStk`
-	(HappyAbsSyn96  happy_var_2) `HappyStk`
-	(HappyTerminal (Located happy_var_1 (Token (Sym CurlyL  ) _))) `HappyStk`
-	happyRest) tk
-	 = happyThen ((( mkRecord (rComb happy_var_1 happy_var_3) PRecord happy_var_2))
-	) (\r -> happyReturn (HappyAbsSyn91 r))
-
-happyReduce_252 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_252 = happySpecReduce_3  79 happyReduction_252
-happyReduction_252 (HappyAbsSyn91  happy_var_3)
-	_
-	(HappyAbsSyn91  happy_var_1)
-	 =  HappyAbsSyn48
-		 ([happy_var_3, happy_var_1]
-	)
-happyReduction_252 _ _ _  = notHappyAtAll 
-
-happyReduce_253 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_253 = happySpecReduce_3  79 happyReduction_253
-happyReduction_253 (HappyAbsSyn91  happy_var_3)
-	_
-	(HappyAbsSyn48  happy_var_1)
-	 =  HappyAbsSyn48
-		 (happy_var_3 : happy_var_1
-	)
-happyReduction_253 _ _ _  = notHappyAtAll 
-
-happyReduce_254 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_254 = happySpecReduce_3  80 happyReduction_254
-happyReduction_254 (HappyAbsSyn91  happy_var_3)
-	_
-	(HappyAbsSyn115  happy_var_1)
-	 =  HappyAbsSyn95
-		 (Named { name = happy_var_1, value = happy_var_3 }
-	)
-happyReduction_254 _ _ _  = notHappyAtAll 
-
-happyReduce_255 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_255 = happySpecReduce_1  81 happyReduction_255
-happyReduction_255 (HappyAbsSyn95  happy_var_1)
-	 =  HappyAbsSyn96
-		 ([happy_var_1]
-	)
-happyReduction_255 _  = notHappyAtAll 
-
-happyReduce_256 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_256 = happySpecReduce_3  81 happyReduction_256
-happyReduction_256 (HappyAbsSyn95  happy_var_3)
-	_
-	(HappyAbsSyn96  happy_var_1)
-	 =  HappyAbsSyn96
-		 (happy_var_3 : happy_var_1
-	)
-happyReduction_256 _ _ _  = notHappyAtAll 
-
-happyReduce_257 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_257 = happySpecReduce_1  82 happyReduction_257
-happyReduction_257 (HappyAbsSyn106  happy_var_1)
-	 =  HappyAbsSyn97
-		 (at happy_var_1 $ mkSchema [] [] happy_var_1
-	)
-happyReduction_257 _  = notHappyAtAll 
-
-happyReduce_258 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_258 = happySpecReduce_2  82 happyReduction_258
-happyReduction_258 (HappyAbsSyn106  happy_var_2)
-	(HappyAbsSyn98  happy_var_1)
-	 =  HappyAbsSyn97
-		 (at (happy_var_1,happy_var_2) $ mkSchema (thing happy_var_1) [] happy_var_2
-	)
-happyReduction_258 _ _  = notHappyAtAll 
-
-happyReduce_259 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_259 = happySpecReduce_2  82 happyReduction_259
-happyReduction_259 (HappyAbsSyn106  happy_var_2)
-	(HappyAbsSyn99  happy_var_1)
-	 =  HappyAbsSyn97
-		 (at (happy_var_1,happy_var_2) $ mkSchema [] (thing happy_var_1) happy_var_2
-	)
-happyReduction_259 _ _  = notHappyAtAll 
-
-happyReduce_260 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_260 = happySpecReduce_3  82 happyReduction_260
-happyReduction_260 (HappyAbsSyn106  happy_var_3)
-	(HappyAbsSyn99  happy_var_2)
-	(HappyAbsSyn98  happy_var_1)
-	 =  HappyAbsSyn97
-		 (at (happy_var_1,happy_var_3) $ mkSchema (thing happy_var_1)
-                                                          (thing happy_var_2) happy_var_3
-	)
-happyReduction_260 _ _ _  = notHappyAtAll 
-
-happyReduce_261 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_261 = happySpecReduce_2  83 happyReduction_261
-happyReduction_261 (HappyTerminal (Located happy_var_2 (Token (Sym CurlyR  ) _)))
-	(HappyTerminal (Located happy_var_1 (Token (Sym CurlyL  ) _)))
-	 =  HappyAbsSyn98
-		 (Located (rComb happy_var_1 happy_var_2) []
-	)
-happyReduction_261 _ _  = notHappyAtAll 
-
-happyReduce_262 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_262 = happySpecReduce_3  83 happyReduction_262
-happyReduction_262 (HappyTerminal (Located happy_var_3 (Token (Sym CurlyR  ) _)))
-	(HappyAbsSyn103  happy_var_2)
-	(HappyTerminal (Located happy_var_1 (Token (Sym CurlyL  ) _)))
-	 =  HappyAbsSyn98
-		 (Located (rComb happy_var_1 happy_var_3) (reverse happy_var_2)
-	)
-happyReduction_262 _ _ _  = notHappyAtAll 
-
-happyReduce_263 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_263 = happySpecReduce_2  84 happyReduction_263
-happyReduction_263 (HappyAbsSyn99  happy_var_2)
-	(HappyAbsSyn99  happy_var_1)
-	 =  HappyAbsSyn99
-		 (at (happy_var_1,happy_var_2) $ fmap (++ thing happy_var_2) happy_var_1
-	)
-happyReduction_263 _ _  = notHappyAtAll 
-
-happyReduce_264 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_264 = happySpecReduce_1  84 happyReduction_264
-happyReduction_264 (HappyAbsSyn99  happy_var_1)
-	 =  HappyAbsSyn99
-		 (happy_var_1
-	)
-happyReduction_264 _  = notHappyAtAll 
-
-happyReduce_265 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_265 = happyMonadReduce 2 85 happyReduction_265
-happyReduction_265 ((HappyTerminal (Located happy_var_2 (Token (Sym FatArrR ) _))) `HappyStk`
-	(HappyAbsSyn106  happy_var_1) `HappyStk`
-	happyRest) tk
-	 = happyThen ((( fmap (\x -> at (x,happy_var_2) x) (mkProp happy_var_1)))
-	) (\r -> happyReturn (HappyAbsSyn99 r))
-
-happyReduce_266 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_266 = happySpecReduce_1  86 happyReduction_266
-happyReduction_266 (HappyTerminal (Located happy_var_1 (Token (Op Hash) _)))
-	 =  HappyAbsSyn101
-		 (Located happy_var_1 KNum
-	)
-happyReduction_266 _  = notHappyAtAll 
-
-happyReduce_267 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_267 = happySpecReduce_1  86 happyReduction_267
-happyReduction_267 (HappyTerminal (Located happy_var_1 (Token (Op Mul)   _)))
-	 =  HappyAbsSyn101
-		 (Located happy_var_1 KType
-	)
-happyReduction_267 _  = notHappyAtAll 
-
-happyReduce_268 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_268 = happySpecReduce_1  86 happyReduction_268
-happyReduction_268 (HappyTerminal (Located happy_var_1 (Token (KW KW_Prop) _)))
-	 =  HappyAbsSyn101
-		 (Located happy_var_1 KProp
-	)
-happyReduction_268 _  = notHappyAtAll 
-
-happyReduce_269 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_269 = happySpecReduce_3  86 happyReduction_269
-happyReduction_269 (HappyAbsSyn101  happy_var_3)
-	_
-	(HappyAbsSyn101  happy_var_1)
-	 =  HappyAbsSyn101
-		 (combLoc KFun happy_var_1 happy_var_3
-	)
-happyReduction_269 _ _ _  = notHappyAtAll 
-
-happyReduce_270 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_270 = happyMonadReduce 1 87 happyReduction_270
-happyReduction_270 ((HappyAbsSyn115  happy_var_1) `HappyStk`
-	happyRest) tk
-	 = happyThen ((( mkTParam happy_var_1 Nothing))
-	) (\r -> happyReturn (HappyAbsSyn102 r))
-
-happyReduce_271 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_271 = happyMonadReduce 3 87 happyReduction_271
-happyReduction_271 ((HappyAbsSyn101  happy_var_3) `HappyStk`
-	_ `HappyStk`
-	(HappyAbsSyn115  happy_var_1) `HappyStk`
-	happyRest) tk
-	 = happyThen ((( mkTParam (at (happy_var_1,happy_var_3) happy_var_1) (Just (thing happy_var_3))))
-	) (\r -> happyReturn (HappyAbsSyn102 r))
-
-happyReduce_272 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_272 = happySpecReduce_1  88 happyReduction_272
-happyReduction_272 (HappyAbsSyn102  happy_var_1)
-	 =  HappyAbsSyn103
-		 ([happy_var_1]
-	)
-happyReduction_272 _  = notHappyAtAll 
-
-happyReduce_273 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_273 = happySpecReduce_3  88 happyReduction_273
-happyReduction_273 (HappyAbsSyn102  happy_var_3)
-	_
-	(HappyAbsSyn103  happy_var_1)
-	 =  HappyAbsSyn103
-		 (happy_var_3 : happy_var_1
-	)
-happyReduction_273 _ _ _  = notHappyAtAll 
-
-happyReduce_274 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_274 = happyMonadReduce 1 89 happyReduction_274
-happyReduction_274 ((HappyAbsSyn115  happy_var_1) `HappyStk`
-	happyRest) tk
-	 = happyThen ((( mkTParam happy_var_1 Nothing))
-	) (\r -> happyReturn (HappyAbsSyn102 r))
-
-happyReduce_275 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_275 = happyMonadReduce 5 89 happyReduction_275
-happyReduction_275 ((HappyTerminal (Located happy_var_5 (Token (Sym ParenR  ) _))) `HappyStk`
-	(HappyAbsSyn101  happy_var_4) `HappyStk`
-	_ `HappyStk`
-	(HappyAbsSyn115  happy_var_2) `HappyStk`
-	(HappyTerminal (Located happy_var_1 (Token (Sym ParenL  ) _))) `HappyStk`
-	happyRest) tk
-	 = happyThen ((( mkTParam (at (happy_var_1,happy_var_5) happy_var_2) (Just (thing happy_var_4))))
-	) (\r -> happyReturn (HappyAbsSyn102 r))
-
-happyReduce_276 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_276 = happySpecReduce_1  90 happyReduction_276
-happyReduction_276 (HappyAbsSyn102  happy_var_1)
-	 =  HappyAbsSyn103
-		 ([happy_var_1]
-	)
-happyReduction_276 _  = notHappyAtAll 
-
-happyReduce_277 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_277 = happySpecReduce_2  90 happyReduction_277
-happyReduction_277 (HappyAbsSyn102  happy_var_2)
-	(HappyAbsSyn103  happy_var_1)
-	 =  HappyAbsSyn103
-		 (happy_var_2 : happy_var_1
-	)
-happyReduction_277 _ _  = notHappyAtAll 
-
-happyReduce_278 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_278 = happySpecReduce_3  91 happyReduction_278
-happyReduction_278 (HappyAbsSyn106  happy_var_3)
-	_
-	(HappyAbsSyn106  happy_var_1)
-	 =  HappyAbsSyn106
-		 (at (happy_var_1,happy_var_3) $ TFun happy_var_1 happy_var_3
-	)
-happyReduction_278 _ _ _  = notHappyAtAll 
-
-happyReduce_279 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_279 = happySpecReduce_1  91 happyReduction_279
-happyReduction_279 (HappyAbsSyn106  happy_var_1)
-	 =  HappyAbsSyn106
-		 (happy_var_1
-	)
-happyReduction_279 _  = notHappyAtAll 
-
-happyReduce_280 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_280 = happySpecReduce_3  92 happyReduction_280
-happyReduction_280 (HappyAbsSyn106  happy_var_3)
-	(HappyAbsSyn47  happy_var_2)
-	(HappyAbsSyn106  happy_var_1)
-	 =  HappyAbsSyn106
-		 (at (happy_var_1,happy_var_3) $ TInfix happy_var_1 happy_var_2 defaultFixity happy_var_3
-	)
-happyReduction_280 _ _ _  = notHappyAtAll 
-
-happyReduce_281 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_281 = happySpecReduce_1  92 happyReduction_281
-happyReduction_281 (HappyAbsSyn106  happy_var_1)
-	 =  HappyAbsSyn106
-		 (happy_var_1
-	)
-happyReduction_281 _  = notHappyAtAll 
-
-happyReduce_282 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_282 = happySpecReduce_2  93 happyReduction_282
-happyReduction_282 (HappyAbsSyn106  happy_var_2)
-	(HappyAbsSyn111  happy_var_1)
-	 =  HappyAbsSyn106
-		 (at (happy_var_1,happy_var_2) $ foldr TSeq happy_var_2 (reverse (thing happy_var_1))
-	)
-happyReduction_282 _ _  = notHappyAtAll 
-
-happyReduce_283 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_283 = happySpecReduce_2  93 happyReduction_283
-happyReduction_283 (HappyAbsSyn110  happy_var_2)
-	(HappyAbsSyn119  happy_var_1)
-	 =  HappyAbsSyn106
-		 (at (happy_var_1,head happy_var_2)
-                                     $ TUser (thing happy_var_1) (reverse happy_var_2)
-	)
-happyReduction_283 _ _  = notHappyAtAll 
-
-happyReduce_284 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_284 = happySpecReduce_1  93 happyReduction_284
-happyReduction_284 (HappyAbsSyn106  happy_var_1)
-	 =  HappyAbsSyn106
-		 (happy_var_1
-	)
-happyReduction_284 _  = notHappyAtAll 
-
-happyReduce_285 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_285 = happySpecReduce_1  94 happyReduction_285
-happyReduction_285 (HappyAbsSyn119  happy_var_1)
-	 =  HappyAbsSyn106
-		 (at happy_var_1 $ TUser (thing happy_var_1) []
-	)
-happyReduction_285 _  = notHappyAtAll 
-
-happyReduce_286 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_286 = happySpecReduce_3  94 happyReduction_286
-happyReduction_286 _
-	(HappyAbsSyn47  happy_var_2)
-	(HappyTerminal (Located happy_var_1 (Token (Sym ParenL  ) _)))
-	 =  HappyAbsSyn106
-		 (at happy_var_1 $ TUser (thing happy_var_2) []
-	)
-happyReduction_286 _ _ _  = notHappyAtAll 
-
-happyReduce_287 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_287 = happySpecReduce_1  94 happyReduction_287
-happyReduction_287 (HappyTerminal (happy_var_1@(Located _ (Token (Num   {}) _))))
-	 =  HappyAbsSyn106
-		 (at happy_var_1 $ TNum  (getNum happy_var_1)
-	)
-happyReduction_287 _  = notHappyAtAll 
-
-happyReduce_288 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_288 = happySpecReduce_1  94 happyReduction_288
-happyReduction_288 (HappyTerminal (happy_var_1@(Located _ (Token (ChrLit {}) _))))
-	 =  HappyAbsSyn106
-		 (at happy_var_1 $ TChar (getChr happy_var_1)
-	)
-happyReduction_288 _  = notHappyAtAll 
-
-happyReduce_289 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_289 = happySpecReduce_3  94 happyReduction_289
-happyReduction_289 (HappyTerminal (Located happy_var_3 (Token (Sym BracketR) _)))
-	(HappyAbsSyn106  happy_var_2)
-	(HappyTerminal (Located happy_var_1 (Token (Sym BracketL) _)))
-	 =  HappyAbsSyn106
-		 (at (happy_var_1,happy_var_3) $ TSeq happy_var_2 TBit
-	)
-happyReduction_289 _ _ _  = notHappyAtAll 
-
-happyReduce_290 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_290 = happySpecReduce_3  94 happyReduction_290
-happyReduction_290 (HappyTerminal (Located happy_var_3 (Token (Sym ParenR  ) _)))
-	(HappyAbsSyn106  happy_var_2)
-	(HappyTerminal (Located happy_var_1 (Token (Sym ParenL  ) _)))
-	 =  HappyAbsSyn106
-		 (at (happy_var_1,happy_var_3) $ TParens happy_var_2
-	)
-happyReduction_290 _ _ _  = notHappyAtAll 
-
-happyReduce_291 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_291 = happySpecReduce_2  94 happyReduction_291
-happyReduction_291 (HappyTerminal (Located happy_var_2 (Token (Sym ParenR  ) _)))
-	(HappyTerminal (Located happy_var_1 (Token (Sym ParenL  ) _)))
-	 =  HappyAbsSyn106
-		 (at (happy_var_1,happy_var_2) $ TTuple []
-	)
-happyReduction_291 _ _  = notHappyAtAll 
-
-happyReduce_292 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_292 = happySpecReduce_3  94 happyReduction_292
-happyReduction_292 (HappyTerminal (Located happy_var_3 (Token (Sym ParenR  ) _)))
-	(HappyAbsSyn112  happy_var_2)
-	(HappyTerminal (Located happy_var_1 (Token (Sym ParenL  ) _)))
-	 =  HappyAbsSyn106
-		 (at (happy_var_1,happy_var_3) $ TTuple  (reverse happy_var_2)
-	)
-happyReduction_292 _ _ _  = notHappyAtAll 
-
-happyReduce_293 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_293 = happyMonadReduce 2 94 happyReduction_293
-happyReduction_293 ((HappyTerminal (Located happy_var_2 (Token (Sym CurlyR  ) _))) `HappyStk`
-	(HappyTerminal (Located happy_var_1 (Token (Sym CurlyL  ) _))) `HappyStk`
-	happyRest) tk
-	 = happyThen ((( mkRecord (rComb happy_var_1 happy_var_2) TRecord []))
-	) (\r -> happyReturn (HappyAbsSyn106 r))
-
-happyReduce_294 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_294 = happyMonadReduce 3 94 happyReduction_294
-happyReduction_294 ((HappyTerminal (Located happy_var_3 (Token (Sym CurlyR  ) _))) `HappyStk`
-	(HappyAbsSyn114  happy_var_2) `HappyStk`
-	(HappyTerminal (Located happy_var_1 (Token (Sym CurlyL  ) _))) `HappyStk`
-	happyRest) tk
-	 = happyThen ((( mkRecord (rComb happy_var_1 happy_var_3) TRecord happy_var_2))
-	) (\r -> happyReturn (HappyAbsSyn106 r))
-
-happyReduce_295 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_295 = happySpecReduce_1  94 happyReduction_295
-happyReduction_295 (HappyTerminal (Located happy_var_1 (Token (Sym Underscore ) _)))
-	 =  HappyAbsSyn106
-		 (at happy_var_1 TWild
-	)
-happyReduction_295 _  = notHappyAtAll 
-
-happyReduce_296 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_296 = happySpecReduce_1  95 happyReduction_296
-happyReduction_296 (HappyAbsSyn106  happy_var_1)
-	 =  HappyAbsSyn110
-		 ([ happy_var_1 ]
-	)
-happyReduction_296 _  = notHappyAtAll 
-
-happyReduce_297 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_297 = happySpecReduce_2  95 happyReduction_297
-happyReduction_297 (HappyAbsSyn106  happy_var_2)
-	(HappyAbsSyn110  happy_var_1)
-	 =  HappyAbsSyn110
-		 (happy_var_2 : happy_var_1
-	)
-happyReduction_297 _ _  = notHappyAtAll 
-
-happyReduce_298 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_298 = happySpecReduce_3  96 happyReduction_298
-happyReduction_298 (HappyTerminal (Located happy_var_3 (Token (Sym BracketR) _)))
-	(HappyAbsSyn106  happy_var_2)
-	(HappyTerminal (Located happy_var_1 (Token (Sym BracketL) _)))
-	 =  HappyAbsSyn111
-		 (Located (rComb happy_var_1 happy_var_3) [ happy_var_2 ]
-	)
-happyReduction_298 _ _ _  = notHappyAtAll 
-
-happyReduce_299 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_299 = happyReduce 4 96 happyReduction_299
-happyReduction_299 ((HappyTerminal (Located happy_var_4 (Token (Sym BracketR) _))) `HappyStk`
-	(HappyAbsSyn106  happy_var_3) `HappyStk`
-	_ `HappyStk`
-	(HappyAbsSyn111  happy_var_1) `HappyStk`
-	happyRest)
-	 = HappyAbsSyn111
-		 (at (happy_var_1,happy_var_4) (fmap (happy_var_3 :) happy_var_1)
-	) `HappyStk` happyRest
-
-happyReduce_300 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_300 = happySpecReduce_3  97 happyReduction_300
-happyReduction_300 (HappyAbsSyn106  happy_var_3)
-	_
-	(HappyAbsSyn106  happy_var_1)
-	 =  HappyAbsSyn112
-		 ([ happy_var_3, happy_var_1]
-	)
-happyReduction_300 _ _ _  = notHappyAtAll 
-
-happyReduce_301 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_301 = happySpecReduce_3  97 happyReduction_301
-happyReduction_301 (HappyAbsSyn106  happy_var_3)
-	_
-	(HappyAbsSyn112  happy_var_1)
-	 =  HappyAbsSyn112
-		 (happy_var_3 : happy_var_1
-	)
-happyReduction_301 _ _ _  = notHappyAtAll 
-
-happyReduce_302 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_302 = happySpecReduce_3  98 happyReduction_302
-happyReduction_302 (HappyAbsSyn106  happy_var_3)
-	_
-	(HappyAbsSyn115  happy_var_1)
-	 =  HappyAbsSyn113
-		 (Named { name = happy_var_1, value = happy_var_3 }
-	)
-happyReduction_302 _ _ _  = notHappyAtAll 
-
-happyReduce_303 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_303 = happySpecReduce_1  99 happyReduction_303
-happyReduction_303 (HappyAbsSyn113  happy_var_1)
-	 =  HappyAbsSyn114
-		 ([happy_var_1]
-	)
-happyReduction_303 _  = notHappyAtAll 
-
-happyReduce_304 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_304 = happySpecReduce_3  99 happyReduction_304
-happyReduction_304 (HappyAbsSyn113  happy_var_3)
-	_
-	(HappyAbsSyn114  happy_var_1)
-	 =  HappyAbsSyn114
-		 (happy_var_3 : happy_var_1
-	)
-happyReduction_304 _ _ _  = notHappyAtAll 
-
-happyReduce_305 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_305 = happySpecReduce_1  100 happyReduction_305
-happyReduction_305 (HappyTerminal (happy_var_1@(Located _ (Token (Ident [] _) _))))
-	 =  HappyAbsSyn115
-		 (let Token (Ident _ str) _ = thing happy_var_1
-                         in happy_var_1 { thing = mkIdent str }
-	)
-happyReduction_305 _  = notHappyAtAll 
-
-happyReduce_306 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_306 = happySpecReduce_1  100 happyReduction_306
-happyReduction_306 (HappyTerminal (Located happy_var_1 (Token (KW KW_x)       _)))
-	 =  HappyAbsSyn115
-		 (Located { srcRange = happy_var_1, thing = mkIdent "x" }
-	)
-happyReduction_306 _  = notHappyAtAll 
-
-happyReduce_307 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_307 = happySpecReduce_1  100 happyReduction_307
-happyReduction_307 (HappyTerminal (Located happy_var_1 (Token (KW KW_private)   _)))
-	 =  HappyAbsSyn115
-		 (Located { srcRange = happy_var_1, thing = mkIdent "private" }
-	)
-happyReduction_307 _  = notHappyAtAll 
-
-happyReduce_308 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_308 = happySpecReduce_1  100 happyReduction_308
-happyReduction_308 (HappyTerminal (Located happy_var_1 (Token (KW KW_as)        _)))
-	 =  HappyAbsSyn115
-		 (Located { srcRange = happy_var_1, thing = mkIdent "as" }
-	)
-happyReduction_308 _  = notHappyAtAll 
-
-happyReduce_309 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_309 = happySpecReduce_1  100 happyReduction_309
-happyReduction_309 (HappyTerminal (Located happy_var_1 (Token (KW KW_hiding)    _)))
-	 =  HappyAbsSyn115
-		 (Located { srcRange = happy_var_1, thing = mkIdent "hiding" }
-	)
-happyReduction_309 _  = notHappyAtAll 
-
-happyReduce_310 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_310 = happySpecReduce_1  101 happyReduction_310
-happyReduction_310 (HappyAbsSyn115  happy_var_1)
-	 =  HappyAbsSyn47
-		 (fmap mkUnqual happy_var_1
-	)
-happyReduction_310 _  = notHappyAtAll 
-
-happyReduce_311 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_311 = happySpecReduce_1  102 happyReduction_311
-happyReduction_311 (HappyAbsSyn115  happy_var_1)
-	 =  HappyAbsSyn117
-		 (fmap (mkModName . (:[]) . identText) happy_var_1
-	)
-happyReduction_311 _  = notHappyAtAll 
-
-happyReduce_312 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_312 = happySpecReduce_1  102 happyReduction_312
-happyReduction_312 (HappyTerminal (happy_var_1@(Located _ (Token  Ident{}     _))))
-	 =  HappyAbsSyn117
-		 (let Token (Ident ns i) _ = thing happy_var_1
-                                     in mkModName (ns ++ [i]) A.<$ happy_var_1
-	)
-happyReduction_312 _  = notHappyAtAll 
-
-happyReduce_313 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_313 = happySpecReduce_1  103 happyReduction_313
-happyReduction_313 (HappyAbsSyn117  happy_var_1)
-	 =  HappyAbsSyn117
-		 (happy_var_1
-	)
-happyReduction_313 _  = notHappyAtAll 
-
-happyReduce_314 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_314 = happySpecReduce_2  103 happyReduction_314
-happyReduction_314 (HappyAbsSyn117  happy_var_2)
-	_
-	 =  HappyAbsSyn117
-		 (fmap paramInstModName happy_var_2
-	)
-happyReduction_314 _ _  = notHappyAtAll 
-
-happyReduce_315 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_315 = happySpecReduce_1  104 happyReduction_315
-happyReduction_315 (HappyAbsSyn47  happy_var_1)
-	 =  HappyAbsSyn119
-		 (happy_var_1
-	)
-happyReduction_315 _  = notHappyAtAll 
-
-happyReduce_316 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_316 = happySpecReduce_1  104 happyReduction_316
-happyReduction_316 (HappyTerminal (happy_var_1@(Located _ (Token  Ident{}     _))))
-	 =  HappyAbsSyn119
-		 (let Token (Ident ns i) _ = thing happy_var_1
-                                     in mkQual (mkModName ns) (mkIdent i) A.<$ happy_var_1
-	)
-happyReduction_316 _  = notHappyAtAll 
-
-happyReduce_317 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_317 = happySpecReduce_1  105 happyReduction_317
-happyReduction_317 (HappyAbsSyn119  happy_var_1)
-	 =  HappyAbsSyn119
-		 (happy_var_1
-	)
-happyReduction_317 _  = notHappyAtAll 
-
-happyReduce_318 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_318 = happySpecReduce_1  105 happyReduction_318
-happyReduction_318 (HappyAbsSyn47  happy_var_1)
-	 =  HappyAbsSyn119
-		 (happy_var_1
-	)
-happyReduction_318 _  = notHappyAtAll 
-
-happyReduce_319 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_319 = happySpecReduce_3  105 happyReduction_319
-happyReduction_319 _
-	(HappyAbsSyn47  happy_var_2)
-	_
-	 =  HappyAbsSyn119
-		 (happy_var_2
-	)
-happyReduction_319 _ _ _  = notHappyAtAll 
-
-happyReduce_320 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_320 = happySpecReduce_1  106 happyReduction_320
-happyReduction_320 (HappyAbsSyn119  happy_var_1)
-	 =  HappyAbsSyn106
-		 (at happy_var_1 $ TUser (thing happy_var_1) []
-	)
-happyReduction_320 _  = notHappyAtAll 
-
-happyReduce_321 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_321 = happySpecReduce_1  106 happyReduction_321
-happyReduction_321 (HappyTerminal (happy_var_1@(Located _ (Token (Num   {}) _))))
-	 =  HappyAbsSyn106
-		 (at happy_var_1 $ TNum  (getNum happy_var_1)
-	)
-happyReduction_321 _  = notHappyAtAll 
-
-happyReduce_322 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_322 = happyMonadReduce 3 106 happyReduction_322
-happyReduction_322 ((HappyTerminal (Located happy_var_3 (Token (Sym ParenR  ) _))) `HappyStk`
-	(HappyAbsSyn106  happy_var_2) `HappyStk`
-	(HappyTerminal (Located happy_var_1 (Token (Sym ParenL  ) _))) `HappyStk`
-	happyRest) tk
-	 = happyThen ((( validDemotedType (rComb happy_var_1 happy_var_3) happy_var_2))
-	) (\r -> happyReturn (HappyAbsSyn106 r))
-
-happyReduce_323 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_323 = happySpecReduce_2  106 happyReduction_323
-happyReduction_323 (HappyTerminal (Located happy_var_2 (Token (Sym CurlyR  ) _)))
-	(HappyTerminal (Located happy_var_1 (Token (Sym CurlyL  ) _)))
-	 =  HappyAbsSyn106
-		 (at (happy_var_1,happy_var_2) (TTyApp [])
-	)
-happyReduction_323 _ _  = notHappyAtAll 
-
-happyReduce_324 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_324 = happySpecReduce_3  106 happyReduction_324
-happyReduction_324 (HappyTerminal (Located happy_var_3 (Token (Sym CurlyR  ) _)))
-	(HappyAbsSyn114  happy_var_2)
-	(HappyTerminal (Located happy_var_1 (Token (Sym CurlyL  ) _)))
-	 =  HappyAbsSyn106
-		 (at (happy_var_1,happy_var_3) (TTyApp (reverse happy_var_2))
-	)
-happyReduction_324 _ _ _  = notHappyAtAll 
-
-happyReduce_325 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_325 = happySpecReduce_3  106 happyReduction_325
-happyReduction_325 (HappyTerminal (Located happy_var_3 (Token (Sym CurlyR  ) _)))
-	(HappyAbsSyn106  happy_var_2)
-	(HappyTerminal (Located happy_var_1 (Token (Sym CurlyL  ) _)))
-	 =  HappyAbsSyn106
-		 (anonTyApp (getLoc (happy_var_1,happy_var_3)) [happy_var_2]
-	)
-happyReduction_325 _ _ _  = notHappyAtAll 
-
-happyReduce_326 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_326 = happySpecReduce_3  106 happyReduction_326
-happyReduction_326 (HappyTerminal (Located happy_var_3 (Token (Sym CurlyR  ) _)))
-	(HappyAbsSyn112  happy_var_2)
-	(HappyTerminal (Located happy_var_1 (Token (Sym CurlyL  ) _)))
-	 =  HappyAbsSyn106
-		 (anonTyApp (getLoc (happy_var_1,happy_var_3)) (reverse happy_var_2)
-	)
-happyReduction_326 _ _ _  = notHappyAtAll 
-
-happyReduce_327 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_327 = happySpecReduce_3  107 happyReduction_327
-happyReduction_327 (HappyAbsSyn106  happy_var_3)
-	_
-	(HappyAbsSyn115  happy_var_1)
-	 =  HappyAbsSyn113
-		 (Named { name = happy_var_1, value = happy_var_3 }
-	)
-happyReduction_327 _ _ _  = notHappyAtAll 
-
-happyReduce_328 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_328 = happySpecReduce_1  108 happyReduction_328
-happyReduction_328 (HappyAbsSyn113  happy_var_1)
-	 =  HappyAbsSyn114
-		 ([happy_var_1]
-	)
-happyReduction_328 _  = notHappyAtAll 
-
-happyReduce_329 :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-happyReduce_329 = happySpecReduce_3  108 happyReduction_329
-happyReduction_329 (HappyAbsSyn113  happy_var_3)
-	_
-	(HappyAbsSyn114  happy_var_1)
-	 =  HappyAbsSyn114
-		 (happy_var_3 : happy_var_1
-	)
-happyReduction_329 _ _ _  = notHappyAtAll 
-
-happyNewToken action sts stk
-	= lexerP(\tk -> 
-	let cont i = happyDoAction i tk action sts stk in
-	case tk of {
-	Located _ (Token EOF _) -> happyDoAction 72 tk action sts stk;
-	happy_dollar_dollar@(Located _ (Token (Num   {}) _)) -> cont 1;
-	happy_dollar_dollar@(Located _ (Token (Frac  {}) _)) -> cont 2;
-	happy_dollar_dollar@(Located _ (Token (StrLit {}) _)) -> cont 3;
-	happy_dollar_dollar@(Located _ (Token (ChrLit {}) _)) -> cont 4;
-	happy_dollar_dollar@(Located _ (Token (Ident [] _) _)) -> cont 5;
-	happy_dollar_dollar@(Located _ (Token  Ident{}     _)) -> cont 6;
-	happy_dollar_dollar@(Located _ (Token  (Selector _) _)) -> cont 7;
-	Located happy_dollar_dollar (Token (KW KW_include)   _) -> cont 8;
-	Located happy_dollar_dollar (Token (KW KW_import)    _) -> cont 9;
-	Located happy_dollar_dollar (Token (KW KW_as)        _) -> cont 10;
-	Located happy_dollar_dollar (Token (KW KW_hiding)    _) -> cont 11;
-	Located happy_dollar_dollar (Token (KW KW_private)   _) -> cont 12;
-	Located happy_dollar_dollar (Token (KW KW_parameter) _) -> cont 13;
-	Located happy_dollar_dollar (Token (KW KW_property)  _) -> cont 14;
-	Located happy_dollar_dollar (Token (KW KW_infix)     _) -> cont 15;
-	Located happy_dollar_dollar (Token (KW KW_infixl)    _) -> cont 16;
-	Located happy_dollar_dollar (Token (KW KW_infixr)    _) -> cont 17;
-	Located happy_dollar_dollar (Token (KW KW_type   ) _) -> cont 18;
-	Located happy_dollar_dollar (Token (KW KW_newtype) _) -> cont 19;
-	Located happy_dollar_dollar (Token (KW KW_module ) _) -> cont 20;
-	Located happy_dollar_dollar (Token (KW KW_submodule ) _) -> cont 21;
-	Located happy_dollar_dollar (Token (KW KW_where  ) _) -> cont 22;
-	Located happy_dollar_dollar (Token (KW KW_let    ) _) -> cont 23;
-	Located happy_dollar_dollar (Token (KW KW_if     ) _) -> cont 24;
-	Located happy_dollar_dollar (Token (KW KW_then   ) _) -> cont 25;
-	Located happy_dollar_dollar (Token (KW KW_else   ) _) -> cont 26;
-	Located happy_dollar_dollar (Token (KW KW_x)       _) -> cont 27;
-	Located happy_dollar_dollar (Token (KW KW_down)    _) -> cont 28;
-	Located happy_dollar_dollar (Token (KW KW_by)      _) -> cont 29;
-	Located happy_dollar_dollar (Token (KW KW_primitive) _) -> cont 30;
-	Located happy_dollar_dollar (Token (KW KW_constraint) _) -> cont 31;
-	Located happy_dollar_dollar (Token (KW KW_Prop) _) -> cont 32;
-	Located happy_dollar_dollar (Token (Sym BracketL) _) -> cont 34;
-	Located happy_dollar_dollar (Token (Sym BracketR) _) -> cont 35;
-	Located happy_dollar_dollar (Token (Sym ArrL    ) _) -> cont 36;
-	Located happy_dollar_dollar (Token (Sym DotDot  ) _) -> cont 37;
-	Located happy_dollar_dollar (Token (Sym DotDotDot) _) -> cont 38;
-	Located happy_dollar_dollar (Token (Sym DotDotLt) _) -> cont 39;
-	Located happy_dollar_dollar (Token (Sym DotDotGt) _) -> cont 40;
-	Located happy_dollar_dollar (Token (Sym Bar     ) _) -> cont 41;
-	Located happy_dollar_dollar (Token (Sym Lt      ) _) -> cont 42;
-	Located happy_dollar_dollar (Token (Sym Gt      ) _) -> cont 43;
-	Located happy_dollar_dollar (Token (Sym ParenL  ) _) -> cont 44;
-	Located happy_dollar_dollar (Token (Sym ParenR  ) _) -> cont 45;
-	Located happy_dollar_dollar (Token (Sym Comma   ) _) -> cont 46;
-	Located happy_dollar_dollar (Token (Sym Semi    ) _) -> cont 47;
-	Located happy_dollar_dollar (Token (Sym CurlyL  ) _) -> cont 48;
-	Located happy_dollar_dollar (Token (Sym CurlyR  ) _) -> cont 49;
-	Located happy_dollar_dollar (Token (Sym TriL    ) _) -> cont 50;
-	Located happy_dollar_dollar (Token (Sym TriR    ) _) -> cont 51;
-	Located happy_dollar_dollar (Token (Sym EqDef   ) _) -> cont 52;
-	Located happy_dollar_dollar (Token (Sym BackTick) _) -> cont 53;
-	Located happy_dollar_dollar (Token (Sym Colon   ) _) -> cont 54;
-	Located happy_dollar_dollar (Token (Sym ArrR    ) _) -> cont 55;
-	Located happy_dollar_dollar (Token (Sym FatArrR ) _) -> cont 56;
-	Located happy_dollar_dollar (Token (Sym Lambda  ) _) -> cont 57;
-	Located happy_dollar_dollar (Token (Sym Underscore ) _) -> cont 58;
-	Located happy_dollar_dollar (Token (Virt VCurlyL)  _) -> cont 59;
-	Located happy_dollar_dollar (Token (Virt VCurlyR)  _) -> cont 60;
-	Located happy_dollar_dollar (Token (Virt VSemi)    _) -> cont 61;
-	Located happy_dollar_dollar (Token (Op Plus)  _) -> cont 62;
-	Located happy_dollar_dollar (Token (Op Mul)   _) -> cont 63;
-	Located happy_dollar_dollar (Token (Op Exp)   _) -> cont 64;
-	Located happy_dollar_dollar (Token (Op Minus) _) -> cont 65;
-	Located happy_dollar_dollar (Token (Op Complement) _) -> cont 66;
-	Located happy_dollar_dollar (Token (Op Hash) _) -> cont 67;
-	Located happy_dollar_dollar (Token (Op At) _) -> cont 68;
-	happy_dollar_dollar@(Located _ (Token (Op (Other [] _)) _)) -> cont 69;
-	happy_dollar_dollar@(Located _ (Token (Op  Other{}   )  _)) -> cont 70;
-	happy_dollar_dollar@(Located _ (Token (White DocStr) _)) -> cont 71;
-	_ -> happyError' (tk, [])
-	})
-
-happyError_ explist 72 tk = happyError' (tk, explist)
-happyError_ explist _ tk = happyError' (tk, explist)
-
-happyThen :: () => ParseM a -> (a -> ParseM b) -> ParseM b
-happyThen = (Prelude.>>=)
-happyReturn :: () => a -> ParseM a
-happyReturn = (Prelude.return)
-happyParse :: () => Prelude.Int -> ParseM (HappyAbsSyn )
-
-happyNewToken :: () => Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-
-happyDoAction :: () => Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn )
-
-happyReduceArr :: () => Happy_Data_Array.Array Prelude.Int (Prelude.Int -> Located Token -> Prelude.Int -> Happy_IntList -> HappyStk (HappyAbsSyn ) -> ParseM (HappyAbsSyn ))
-
-happyThen1 :: () => ParseM a -> (a -> ParseM b) -> ParseM b
-happyThen1 = happyThen
-happyReturn1 :: () => a -> ParseM a
-happyReturn1 = happyReturn
-happyError' :: () => ((Located Token), [Prelude.String]) -> ParseM a
-happyError' tk = (\(tokens, explist) -> happyError) tk
-vmodule = happySomeParser where
- happySomeParser = happyThen (happyParse 0) (\x -> case x of {HappyAbsSyn15 z -> happyReturn z; _other -> notHappyAtAll })
-
-program = happySomeParser where
- happySomeParser = happyThen (happyParse 1) (\x -> case x of {HappyAbsSyn24 z -> happyReturn z; _other -> notHappyAtAll })
-
-programLayout = happySomeParser where
- happySomeParser = happyThen (happyParse 2) (\x -> case x of {HappyAbsSyn24 z -> happyReturn z; _other -> notHappyAtAll })
-
-expr = happySomeParser where
- happySomeParser = happyThen (happyParse 3) (\x -> case x of {HappyAbsSyn62 z -> happyReturn z; _other -> notHappyAtAll })
-
-decl = happySomeParser where
- happySomeParser = happyThen (happyParse 4) (\x -> case x of {HappyAbsSyn41 z -> happyReturn z; _other -> notHappyAtAll })
-
-decls = happySomeParser where
- happySomeParser = happyThen (happyParse 5) (\x -> case x of {HappyAbsSyn42 z -> happyReturn z; _other -> notHappyAtAll })
-
-declsLayout = happySomeParser where
- happySomeParser = happyThen (happyParse 6) (\x -> case x of {HappyAbsSyn42 z -> happyReturn z; _other -> notHappyAtAll })
-
-letDecl = happySomeParser where
- happySomeParser = happyThen (happyParse 7) (\x -> case x of {HappyAbsSyn41 z -> happyReturn z; _other -> notHappyAtAll })
-
-repl = happySomeParser where
- happySomeParser = happyThen (happyParse 8) (\x -> case x of {HappyAbsSyn56 z -> happyReturn z; _other -> notHappyAtAll })
-
-schema = happySomeParser where
- happySomeParser = happyThen (happyParse 9) (\x -> case x of {HappyAbsSyn97 z -> happyReturn z; _other -> notHappyAtAll })
-
-modName = happySomeParser where
- happySomeParser = happyThen (happyParse 10) (\x -> case x of {HappyAbsSyn117 z -> happyReturn z; _other -> notHappyAtAll })
-
-helpName = happySomeParser where
- happySomeParser = happyThen (happyParse 11) (\x -> case x of {HappyAbsSyn119 z -> happyReturn z; _other -> notHappyAtAll })
-
-happySeq = happyDontSeq
-
-
-parseModName :: String -> Maybe ModName
-parseModName txt =
-  case parseString defaultConfig { cfgModuleScope = False } modName txt of
-    Right a -> Just (thing a)
-    Left _  -> Nothing
-
-parseHelpName :: String -> Maybe PName
-parseHelpName txt =
-  case parseString defaultConfig { cfgModuleScope = False } helpName txt of
-    Right a -> Just (thing a)
-    Left _  -> Nothing
-
-addImplicitIncludes :: Config -> Program PName -> Program PName
-addImplicitIncludes cfg (Program ds) =
-  Program $ map path (cfgAutoInclude cfg) ++ ds
-  where path p = Include Located { srcRange = rng, thing = p }
-        rng    = Range { source = cfgSource cfg, from = start, to = start }
-
-
-parseProgramWith :: Config -> Text -> Either ParseError (Program PName)
-parseProgramWith cfg s = case res s of
-                          Left err -> Left err
-                          Right a  -> Right (addImplicitIncludes cfg a)
-  where
-  res = parse cfg $ case cfgLayout cfg of
-                      Layout   -> programLayout
-                      NoLayout -> program
-
-parseModule :: Config -> Text -> Either ParseError (Module PName)
-parseModule cfg = parse cfg { cfgModuleScope = True } vmodule
-
-parseProgram :: Layout -> Text -> Either ParseError (Program PName)
-parseProgram l = parseProgramWith defaultConfig { cfgLayout = l }
-
-parseExprWith :: Config -> Text -> Either ParseError (Expr PName)
-parseExprWith cfg = parse cfg { cfgModuleScope = False } expr
-
-parseExpr :: Text -> Either ParseError (Expr PName)
-parseExpr = parseExprWith defaultConfig
-
-parseDeclWith :: Config -> Text -> Either ParseError (Decl PName)
-parseDeclWith cfg = parse cfg { cfgModuleScope = False } decl
-
-parseDecl :: Text -> Either ParseError (Decl PName)
-parseDecl = parseDeclWith defaultConfig
-
-parseDeclsWith :: Config -> Text -> Either ParseError [Decl PName]
-parseDeclsWith cfg = parse cfg { cfgModuleScope = ms } decls'
-  where (ms, decls') = case cfgLayout cfg of
-                         Layout   -> (True, declsLayout)
-                         NoLayout -> (False, decls)
-
-parseDecls :: Text -> Either ParseError [Decl PName]
-parseDecls = parseDeclsWith defaultConfig
-
-parseLetDeclWith :: Config -> Text -> Either ParseError (Decl PName)
-parseLetDeclWith cfg = parse cfg { cfgModuleScope = False } letDecl
-
-parseLetDecl :: Text -> Either ParseError (Decl PName)
-parseLetDecl = parseLetDeclWith defaultConfig
-
-parseReplWith :: Config -> Text -> Either ParseError (ReplInput PName)
-parseReplWith cfg = parse cfg { cfgModuleScope = False } repl
-
-parseRepl :: Text -> Either ParseError (ReplInput PName)
-parseRepl = parseReplWith defaultConfig
-
-parseSchemaWith :: Config -> Text -> Either ParseError (Schema PName)
-parseSchemaWith cfg = parse cfg { cfgModuleScope = False } schema
-
-parseSchema :: Text -> Either ParseError (Schema PName)
-parseSchema = parseSchemaWith defaultConfig
-
--- vim: ft=haskell
-{-# LINE 1 "templates/GenericTemplate.hs" #-}
--- $Id: GenericTemplate.hs,v 1.26 2005/01/14 14:47:22 simonmar Exp $
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-data Happy_IntList = HappyCons Prelude.Int Happy_IntList
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-happyTrace string expr = Happy_System_IO_Unsafe.unsafePerformIO $ do
-    Happy_System_IO.hPutStr Happy_System_IO.stderr string
-    return expr
-
-
-
-
-infixr 9 `HappyStk`
-data HappyStk a = HappyStk a (HappyStk a)
-
------------------------------------------------------------------------------
--- starting the parse
-
-happyParse start_state = happyNewToken start_state notHappyAtAll notHappyAtAll
-
------------------------------------------------------------------------------
--- Accepting the parse
-
--- If the current token is ERROR_TOK, it means we've just accepted a partial
--- parse (a %partial parser).  We must ignore the saved token on the top of
--- the stack in this case.
-happyAccept (0) tk st sts (_ `HappyStk` ans `HappyStk` _) =
-        happyReturn1 ans
-happyAccept j tk st sts (HappyStk ans _) = 
-         (happyReturn1 ans)
-
------------------------------------------------------------------------------
--- Arrays only: do the next action
-
-
-
-happyDoAction i tk st
-        = (happyTrace ("state: " ++ show (st) ++ 
-                      ",\ttoken: " ++ show (i) ++
-                      ",\taction: ")) $
-          case action of
-                (0)           -> (happyTrace ("fail.\n")) $
-                                     happyFail (happyExpListPerState ((st) :: Prelude.Int)) i tk st
-                (-1)          -> (happyTrace ("accept.\n")) $
-                                     happyAccept i tk st
-                n | (n Prelude.< ((0) :: Prelude.Int)) -> (happyTrace ("reduce (rule " ++ show rule
-                                                               ++ ")")) $
-                                                   (happyReduceArr Happy_Data_Array.! rule) i tk st
-                                                   where rule = ((Prelude.negate ((n Prelude.+ ((1) :: Prelude.Int)))))
-                n                 -> (happyTrace ("shift, enter state "
-                                                 ++ show (new_state)
-                                                 ++ "\n")) $
-                                     happyShift new_state i tk st
-                                     where new_state = (n Prelude.- ((1) :: Prelude.Int))
-   where off    = happyAdjustOffset (indexShortOffAddr happyActOffsets st)
-         off_i  = (off Prelude.+ i)
-         check  = if (off_i Prelude.>= ((0) :: Prelude.Int))
-                  then (indexShortOffAddr happyCheck off_i Prelude.== i)
-                  else Prelude.False
-         action
-          | check     = indexShortOffAddr happyTable off_i
-          | Prelude.otherwise = indexShortOffAddr happyDefActions st
-
-
-
-
-
-
-
-
-
-
-
-
-indexShortOffAddr arr off = arr Happy_Data_Array.! off
-
-
-{-# INLINE happyLt #-}
-happyLt x y = (x Prelude.< y)
-
-
-
-
-
-
-readArrayBit arr bit =
-    Bits.testBit (indexShortOffAddr arr (bit `Prelude.div` 16)) (bit `Prelude.mod` 16)
-
-
-
-
-
-
------------------------------------------------------------------------------
--- HappyState data type (not arrays)
-
-
-
-
-
-
-
-
-
-
-
-
-
------------------------------------------------------------------------------
--- Shifting a token
-
-happyShift new_state (0) tk st sts stk@(x `HappyStk` _) =
-     let i = (case x of { HappyErrorToken (i) -> i }) in
---     trace "shifting the error token" $
-     happyDoAction i tk new_state (HappyCons (st) (sts)) (stk)
-
-happyShift new_state i tk st sts stk =
-     happyNewToken new_state (HappyCons (st) (sts)) ((HappyTerminal (tk))`HappyStk`stk)
-
--- happyReduce is specialised for the common cases.
-
-happySpecReduce_0 i fn (0) tk st sts stk
-     = happyFail [] (0) tk st sts stk
-happySpecReduce_0 nt fn j tk st@((action)) sts stk
-     = happyGoto nt j tk st (HappyCons (st) (sts)) (fn `HappyStk` stk)
-
-happySpecReduce_1 i fn (0) tk st sts stk
-     = happyFail [] (0) tk st sts stk
-happySpecReduce_1 nt fn j tk _ sts@((HappyCons (st@(action)) (_))) (v1`HappyStk`stk')
-     = let r = fn v1 in
-       happySeq r (happyGoto nt j tk st sts (r `HappyStk` stk'))
-
-happySpecReduce_2 i fn (0) tk st sts stk
-     = happyFail [] (0) tk st sts stk
-happySpecReduce_2 nt fn j tk _ (HappyCons (_) (sts@((HappyCons (st@(action)) (_))))) (v1`HappyStk`v2`HappyStk`stk')
-     = let r = fn v1 v2 in
-       happySeq r (happyGoto nt j tk st sts (r `HappyStk` stk'))
-
-happySpecReduce_3 i fn (0) tk st sts stk
-     = happyFail [] (0) tk st sts stk
-happySpecReduce_3 nt fn j tk _ (HappyCons (_) ((HappyCons (_) (sts@((HappyCons (st@(action)) (_))))))) (v1`HappyStk`v2`HappyStk`v3`HappyStk`stk')
-     = let r = fn v1 v2 v3 in
-       happySeq r (happyGoto nt j tk st sts (r `HappyStk` stk'))
-
-happyReduce k i fn (0) tk st sts stk
-     = happyFail [] (0) tk st sts stk
-happyReduce k nt fn j tk st sts stk
-     = case happyDrop (k Prelude.- ((1) :: Prelude.Int)) sts of
-         sts1@((HappyCons (st1@(action)) (_))) ->
-                let r = fn stk in  -- it doesn't hurt to always seq here...
-                happyDoSeq r (happyGoto nt j tk st1 sts1 r)
-
-happyMonadReduce k nt fn (0) tk st sts stk
-     = happyFail [] (0) tk st sts stk
-happyMonadReduce k nt fn j tk st sts stk =
-      case happyDrop k (HappyCons (st) (sts)) of
-        sts1@((HappyCons (st1@(action)) (_))) ->
-          let drop_stk = happyDropStk k stk in
-          happyThen1 (fn stk tk) (\r -> happyGoto nt j tk st1 sts1 (r `HappyStk` drop_stk))
-
-happyMonad2Reduce k nt fn (0) tk st sts stk
-     = happyFail [] (0) tk st sts stk
-happyMonad2Reduce k nt fn j tk st sts stk =
-      case happyDrop k (HappyCons (st) (sts)) of
-        sts1@((HappyCons (st1@(action)) (_))) ->
-         let drop_stk = happyDropStk k stk
-
-             off = happyAdjustOffset (indexShortOffAddr happyGotoOffsets st1)
-             off_i = (off Prelude.+ nt)
-             new_state = indexShortOffAddr happyTable off_i
-
-
-
-
-          in
-          happyThen1 (fn stk tk) (\r -> happyNewToken new_state sts1 (r `HappyStk` drop_stk))
-
-happyDrop (0) l = l
-happyDrop n (HappyCons (_) (t)) = happyDrop (n Prelude.- ((1) :: Prelude.Int)) t
-
-happyDropStk (0) l = l
-happyDropStk n (x `HappyStk` xs) = happyDropStk (n Prelude.- ((1)::Prelude.Int)) xs
-
------------------------------------------------------------------------------
--- Moving to a new state after a reduction
-
-
-happyGoto nt j tk st = 
-   (happyTrace (", goto state " ++ show (new_state) ++ "\n")) $
-   happyDoAction j tk new_state
-   where off = happyAdjustOffset (indexShortOffAddr happyGotoOffsets st)
-         off_i = (off Prelude.+ nt)
-         new_state = indexShortOffAddr happyTable off_i
-
-
-
-
------------------------------------------------------------------------------
--- Error recovery (ERROR_TOK is the error token)
-
--- parse error if we are in recovery and we fail again
-happyFail explist (0) tk old_st _ stk@(x `HappyStk` _) =
-     let i = (case x of { HappyErrorToken (i) -> i }) in
---      trace "failing" $ 
-        happyError_ explist i tk
-
-{-  We don't need state discarding for our restricted implementation of
-    "error".  In fact, it can cause some bogus parses, so I've disabled it
-    for now --SDM
-
--- discard a state
-happyFail  ERROR_TOK tk old_st CONS(HAPPYSTATE(action),sts) 
-                                                (saved_tok `HappyStk` _ `HappyStk` stk) =
---      trace ("discarding state, depth " ++ show (length stk))  $
-        DO_ACTION(action,ERROR_TOK,tk,sts,(saved_tok`HappyStk`stk))
--}
-
--- Enter error recovery: generate an error token,
---                       save the old token and carry on.
-happyFail explist i tk (action) sts stk =
---      trace "entering error recovery" $
-        happyDoAction (0) tk action sts ((HappyErrorToken (i)) `HappyStk` stk)
-
--- Internal happy errors:
-
-notHappyAtAll :: a
-notHappyAtAll = Prelude.error "Internal Happy error\n"
-
------------------------------------------------------------------------------
--- Hack to get the typechecker to accept our action functions
-
-
-
-
-
-
-
------------------------------------------------------------------------------
--- Seq-ing.  If the --strict flag is given, then Happy emits 
---      happySeq = happyDoSeq
--- otherwise it emits
---      happySeq = happyDontSeq
-
-happyDoSeq, happyDontSeq :: a -> b -> b
-happyDoSeq   a b = a `Prelude.seq` b
-happyDontSeq a b = b
-
------------------------------------------------------------------------------
--- Don't inline any functions from the template.  GHC has a nasty habit
--- of deciding to inline happyGoto everywhere, which increases the size of
--- the generated parser quite a bit.
-
-
-{-# NOINLINE happyDoAction #-}
-{-# NOINLINE happyTable #-}
-{-# NOINLINE happyCheck #-}
-{-# NOINLINE happyActOffsets #-}
-{-# NOINLINE happyGotoOffsets #-}
-{-# NOINLINE happyDefActions #-}
-
-{-# NOINLINE happyShift #-}
-{-# NOINLINE happySpecReduce_0 #-}
-{-# NOINLINE happySpecReduce_1 #-}
-{-# NOINLINE happySpecReduce_2 #-}
-{-# NOINLINE happySpecReduce_3 #-}
-{-# NOINLINE happyReduce #-}
-{-# NOINLINE happyMonadReduce #-}
-{-# NOINLINE happyGoto #-}
-{-# NOINLINE happyFail #-}
-
--- end of Happy Template.

From d58d1cdd537debcdc8470b03117843069f51fd4c Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Tue, 9 Aug 2022 17:56:15 -0700
Subject: [PATCH 039/125] gitignore src/Cryptol/Parser.hs

---
 .gitignore | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/.gitignore b/.gitignore
index cd7737b8c..e3fb03b09 100644
--- a/.gitignore
+++ b/.gitignore
@@ -40,3 +40,5 @@ cryptol.msi
 cryptol.wixobj
 cryptol.wixpdb
 
+# happy-generated files
+src/Cryptol/Parser.hs
\ No newline at end of file

From 823d1e49872da997b103ff09c17ba54d9c4a0545 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Tue, 9 Aug 2022 17:57:31 -0700
Subject: [PATCH 040/125] [ci skip]


From 2ecee7b7823ab3db6d2dcd5da7f412d9d13b4b95 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Thu, 11 Aug 2022 12:02:06 -0700
Subject: [PATCH 041/125] docs for constraint guards

---
 docs/RefMan/BasicSyntax.rst | 37 +++++++++++++++++++++++++++++++++++++
 1 file changed, 37 insertions(+)

diff --git a/docs/RefMan/BasicSyntax.rst b/docs/RefMan/BasicSyntax.rst
index 90e31090b..61abc23e3 100644
--- a/docs/RefMan/BasicSyntax.rst
+++ b/docs/RefMan/BasicSyntax.rst
@@ -19,6 +19,43 @@ Type Signatures
   f,g : {a,b} (fin a) => [a] b
 
 
+Numeric Constraint Guards
+-------------------------
+
+A declaration with a signature can use numeric constraint guards, which are like
+normal guards (such as in a multi-branch `if`` expression) except that the
+guarding conditions can be numeric constraints. For example:
+
+.. code-block:: cryptol
+
+  len : {n} (fin n) => [n]a -> Integer
+  len xs | n == 0 => 0
+         | n >  0 => 1 + len (drop `{1} xs)
+
+
+Note that this is importantly different from
+
+.. code-block:: cryptol
+  
+  len' : {n} (fin n) => [n]a -> Integer
+  len' xs = if `n == 0 => 0
+             | `n >  0 => 1 + len (drop `{1} xs)
+
+In `len'`, the type-checker cannot determine that `n >= 1` which is
+required to use the
+
+.. code-block:: cryptol
+
+  drop `{1} xs
+
+since the `if`'s condition is only on values, not types.
+
+However, in `len`, the type-checker locally-assumes the constraint `n > 0` in
+that constraint-guarded branch and so it can in fact determine that `n >= 1`.
+
+Numeric constraint guards only support constraints over numeric literals, such
+as `fin`, `<=`, `==`, etc. Type constraint aliases can also be used as long as
+they only constraint numeric literals.
 
 Layout
 ------

From 840449a80c1159cb74dcd7ab7b187c0b30e24eb6 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Thu, 11 Aug 2022 12:02:32 -0700
Subject: [PATCH 042/125] [ci skip]


From 5e0d8a8e5f236e2b3cfb599f587d80b29a111e62 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Thu, 11 Aug 2022 12:12:00 -0700
Subject: [PATCH 043/125] updated docs: constraint guads exhaustivity
 requirement

---
 docs/RefMan/BasicSyntax.rst | 9 ++++++---
 1 file changed, 6 insertions(+), 3 deletions(-)

diff --git a/docs/RefMan/BasicSyntax.rst b/docs/RefMan/BasicSyntax.rst
index 61abc23e3..43acef714 100644
--- a/docs/RefMan/BasicSyntax.rst
+++ b/docs/RefMan/BasicSyntax.rst
@@ -53,9 +53,12 @@ since the `if`'s condition is only on values, not types.
 However, in `len`, the type-checker locally-assumes the constraint `n > 0` in
 that constraint-guarded branch and so it can in fact determine that `n >= 1`.
 
-Numeric constraint guards only support constraints over numeric literals, such
-as `fin`, `<=`, `==`, etc. Type constraint aliases can also be used as long as
-they only constraint numeric literals.
+Requirements:
+  - Numeric constraint guards only support constraints over numeric literals,
+    such as `fin`, `<=`, `==`, etc. Type constraint aliases can also be used as
+    long as they only constraint numeric literals.
+  - The numeric constraint guards of a declaration must be exhaustive.
+
 
 Layout
 ------

From b7f6137770aa1c6888c36a757d0b304141c16728 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Thu, 11 Aug 2022 12:12:10 -0700
Subject: [PATCH 044/125] [ci skip]


From eca83666599d422a54ff77422d96882e3a119e89 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Thu, 11 Aug 2022 12:24:53 -0700
Subject: [PATCH 045/125] rest of the docs stuff rest of the docs stuff [ci
 skip]

---
 .../_build/doctrees/BasicSyntax.doctree       |   Bin 45268 -> 53487 bytes
 .../RefMan/_build/doctrees/BasicTypes.doctree |   Bin 24627 -> 25225 bytes
 .../_build/doctrees/Expressions.doctree       |   Bin 15217 -> 15445 bytes
 docs/RefMan/_build/doctrees/Modules.doctree   |   Bin 61145 -> 62133 bytes
 .../doctrees/OverloadedOperations.doctree     |   Bin 9434 -> 9572 bytes
 docs/RefMan/_build/doctrees/RefMan.doctree    |   Bin 2810 -> 2948 bytes
 .../_build/doctrees/TypeDeclarations.doctree  |   Bin 8226 -> 8414 bytes
 .../RefMan/_build/doctrees/environment.pickle |   Bin 114200 -> 126903 bytes
 docs/RefMan/_build/html/.buildinfo            |     2 +-
 docs/RefMan/_build/html/BasicSyntax.html      |   151 +-
 docs/RefMan/_build/html/BasicTypes.html       |   152 +-
 docs/RefMan/_build/html/Expressions.html      |   160 +-
 docs/RefMan/_build/html/Modules.html          |   564 +-
 .../_build/html/OverloadedOperations.html     |   160 +-
 docs/RefMan/_build/html/RefMan.html           |    11 +-
 docs/RefMan/_build/html/TypeDeclarations.html |    30 +-
 .../_build/html/_sources/BasicSyntax.rst.txt  |    40 +
 .../_sphinx_javascript_frameworks_compat.js   |   134 +
 docs/RefMan/_build/html/_static/basic.css     |    46 +-
 docs/RefMan/_build/html/_static/doctools.js   |   449 +-
 .../html/_static/documentation_options.js     |     6 +-
 .../_build/html/_static/jquery-3.6.0.js       | 10881 ++++++++++++++++
 docs/RefMan/_build/html/_static/jquery.js     |     4 +-
 .../_build/html/_static/language_data.js      |   102 +-
 docs/RefMan/_build/html/_static/pygments.css  |    41 +-
 .../RefMan/_build/html/_static/searchtools.js |   789 +-
 docs/RefMan/_build/html/genindex.html         |     1 +
 docs/RefMan/_build/html/search.html           |     1 +
 docs/RefMan/_build/html/searchindex.js        |     2 +-
 29 files changed, 12357 insertions(+), 1369 deletions(-)
 create mode 100644 docs/RefMan/_build/html/_static/_sphinx_javascript_frameworks_compat.js
 create mode 100644 docs/RefMan/_build/html/_static/jquery-3.6.0.js

diff --git a/docs/RefMan/_build/doctrees/BasicSyntax.doctree b/docs/RefMan/_build/doctrees/BasicSyntax.doctree
index 3daf03c9cc3e27eec6d870b537375685e4146395..0814ac2fc53d18dd1201440ce0dc5c0b4f577d66 100644
GIT binary patch
literal 53487
zcmeHw3zQ^RdEU;<&dyBlORL8Ud9+fkgm!0E^W2qINZwtvl8_}<J3`W82}!H&n(mtE
zs_pJ-s;YNpq?H39U=&w^fi?;PLL8D1Y-}eS1q_A=+abix!8}5uU>qL<HgOClKIUO_
zf=#~v-nx&f?y0Vt*;(lTd!(tZTlew5?|=XMdfnhJ{psg6v47!Czge{#%Ts2h(r_!5
z-wuZ>Zn;&r8bSN*?eW*QpKOnXBc8eByDhJ5wZl!wQLfsxif1+2r`zEU${yG?e<~_J
z<Xh#yb{n#Ib+EdnI&``{Rvifk13Rc$+NW^aZKiLRjR#g5fw|nKe8{%>l(kIlC%(S1
z&EP?WmxNoICLjpf)m`C8QG#3@2)9I#&V`$6cEf7VwdT#RU<QF_&$j|#NEi*+6`!CV
zD%VWkM<RX?Hq1KzHC$;m)yuqDKI2&nl&2LA1?D1sYFBqwN2}YaS5^nAd%}mNU+r6-
zKV6-#nT>MQ3Ic2Tj);u@blF>J25xP#>^3Skk;Y`d{lGKrM&M5adVl(UYvH8Xm}b=A
z#F+AYpm)`Yf!2I=E9ZnF<wYVP+;)crBs`NU_BjD}ClVFi4g%;I4)k30Dk4qwYS5#)
z7i7N{|6hmy_v8O@;99+&;W){&S0@0<5I`9Tx7X~z^2}OszUG$C=*--?U@RL)@&EP4
z3jTjwfYXt#Ald?mZcT$D99gc{Zt<HYN#AhOvq0&y_&K=Xl0ZHc4uj^4EpriRLlLPV
zmQ{PPTEqWA(exIH>4eX*>K=y22pVO0wdO5JfN)zyr=%$e(vhwasGx*E5-5dNJ5Q}N
zE#m<jA{4ZMiKI_5UD0PAEtK+c?6k(Qo#5EZrL0`JFtKRdVmx6^%s*+2E!Yji95;?0
zGafNd8}kB~^h^pe;#?z*bJe-(z13GeRlQH~rTRde5xY<a12@KqodL)+=_@iRUa(I_
z>{ALm2>TRvTrmej=fV2i4%Ok>X#7me^k5s9A=(|L<WPk81t9TMJ{G-6W6|YIsYYPW
z%tg;^R&|B?pT`YND2*jMs2Zk1-zb|6qvcyhBSHiwMj!%}03s8{Qq?Y_kY^b+`;1j+
zxL)0?8T_j;=C|mhZ;&V$^;RvgC+9t~VMfVbD3uIrnKaIaZ5hY!vegWXplZ?|tHA28
z8;gcCY(4{Mz8gILlyRr)p$@a&tXa1(0*_U9hmXH-7`7z~Ur;C@J@3?|2NrfG>n4ln
zbu4spuyUd+t`3HSj4?t$2f!tT2Rho(>c7$}OSkX;lG=v&?G9hFahz6E-oQqZL{w&7
zm~p*ddpha|u0S!SiZLr$u2~JTl8wklLiEW-Hcp$y<T2y!Mqn*kUV$<#`^Gt=VH`bb
z%utq@g2De$;xU6K&Y~lvykiy5Z5pK~W}if{alyX}(w5`^laEiV(`N6{i1yE9*D^8Z
z29~f5HVg{>t2bRQFdIQ_#i-Z|OqK&<!E@^Z`+S8I8lMFSpUE!fg559GAXlAY1Kio4
ziQoH);YSU7!6<cMI<fv7eaXi83*D@u9vO)*uTu#2X{1y_@ZjAIqeSE^O;8VEuzno=
zaQTeoQP<FL1N3Kb9_#STxv&tujvBM2sGqX^f@i(9WqVe|2wc{;p(5E^44?sJ?n3qo
zNWP)VLiK%8D7SE6gt%=1XkUHZJ5>ctAHJg(?rkr>!R+ODW&~AhVU9v6NDT{;Nwhc#
zRYQc9Gt{?f(^@dwlg<e#Mq!VPNer@C<Oxl#l!|WCZKpsxo+#mB$QwX@of1B+L82u5
zWxkF6m<c!a!~5a!h*2GxJhuT`=QfP9X02tx`67WQCGe-D2p3chiesUk3g*oun5W6~
zW@=Z^px<6ll`zb2PL%8^(5x*c(-Y8*?D$B6hX?Xdp%b@kf^n!TJKlAdyJVfUya{q(
zN!hy@9*k1WT5V+#BYn8ZK4YHdC^L&aQ$h^|=Gv-Hlgz_~C5l{Pvr#d8*RTWT=Ay*~
zv%IQ7Qykx>1F6^*#?!&|`xCs=xIV~`6Ko#<rm7;w_eT<Cd-I)IV|+i@#g_G;nQA;-
zOX+l6ha!#$YzL`Jol#9Pd>d=W_pbBBY6Vhw{_0GpO-AGY`n6N1Z%RW8FJ0itrm;6_
z8jB%K#X`J+g};h58<8zFqyay9*zeLro+9E*buHsVR|Bp4xqCnnO8=I^q#?%eN^Qm9
zmKkHe)g&*J%(Mu&87?e_95P42EPn#dyBH0Z04gj=>Bv#~dzAiKL3zqxVH#DFVb*LD
z(L-hq%o<DshQ1h%S1_VRZ8aBTV~nlgz)+`vo<S=rM(m>bDWGx+E|W;tvPNTdcL76m
zJsMDN`2n?PEmuwaw9i^og+kQNAcjhAmPWjAdyH~Ixe}?;syiPb5gK*gpGT6Me@(f0
zjO{22|1w@-Vn)J(;;aUeWc=3oR;^|Q-35c<#v>#$NpT4O)A{55`Q&^)zH>$>593D%
zDGKl0fBspdnWv4Y9b)^bgv`hKVKNOuc?R&Jz+wH;A0*25?uV&0)(`hj=wlmtONV7M
z*(U)?|B<5!NWOBOAaVYLD&kZDoN9EnnJlAh|7f!PZ?C<5a}D-3r`AbB7hZtIy6`bu
zA9^!N{x*}3R5@~<<1G3(%j$d*4><<D<Gl4MRb`}ZTYsfOaLz|nl9|p+`kAcmrU#pw
z%QDR+;zLJ3?Tb+|ZRCh)q&T%#XJojAcWdpiZ<3~;oR1Ngc<)Gz{Rrb$I%EF>6%ifj
z>P=DY?^U%^-}~+iwLimZ=ONJQ9!@INNO(o$jL^(w<UH{qk>6G`G9r`i+;EQtnNsFv
zXxbxXZf46p=8D_G1Sq+NyF>A+IDH@I^u4(_jY(VQ9$A7-+1&~_q+mbffFeKRxveI~
z@(a4R<+CXi*IP6j_Tw}pgyUDCp}yUyz!hcFuTuqmE|$;M!1*(LOc?9=;IuJog#efQ
zyhx2s74AV`j5Qr#1{_~8)k0G@yb&~5ckzbg1}iylE!vF+O~H_J2q#O<1jm{{CE6!8
zB~+v7pl(eSWK%WF`xrb{XCky~8VtlFS*8p&duCT?5RNHXF~c)~!L)^hTFqS|0B`4$
z;5r~ap9QM!{t4ADEY+0~6}b|fmMW3QT;8TB6O>4W>t2>v27s~9QWY~<c&@PJ0SAm_
z{C-?46(|%I*@qRO?Q5?<qQ;!DGr%j&m}i)wzB`VjvJ^XEDNa=p^W$n!rGeg(8<Xz|
z*ay-9&nPXF42mAf_r($v=Xk9~YFyx&IBx|@7AA^B-qK<z)c{aFX-EoqLyf0|wP|{Y
zQ`(qmHOywSW>eIQ8yn3KuvuTy(o%`B2h+W5MMnX~1l5VDV>Wc73V<CmKP)z6umv(0
z9j|cAN{^RR#A`e=VU*7r<|qW7JdqGt%`Y7Q@IsRMlJU`hlqi?l{Z=tS%36YW?+&-e
zSg1js_|OZwMFriWs)Y&c(`$$Bid6+lwGpOd>IHQQO@C$WP!BSiY7j;Vy`V{<;V0G(
z&7M?+)1d5;u^03ywEW!Kq2H>R0}a+#@;V^<+S(zzdCjIt!($zlbi;Zi9ExIZT0|-w
zk+x7+kU?e}6&y@Y|27XTobOR?&5#t7omKUQdTKX-)xbN|z-=AKGxUiWxP947z6NvF
z620(QQ6_OkRnJI$)!Ok%8W-o|F-GVFeOv+XcmjZ#wF98X(w(=n!B$7drN&!nD^>0X
z1;xN6wpMOSjgOPmfJ~*NjJ{~plQQ}mzTK^}2)ob%l^{JV=hZ}*QRjhN^q~>ht7Hi_
z0()2=frY;(Mha2n-sj4K;U$Mi$fzHf2<x*Iai!Aq0XQ$@U|IN|(h8;0f$0)_7)m7n
zsz-U`Wm&cH4qxO(6~Z4PH;Jl&A-j!My~^s0y14?oYhWxDP~hL2x3QAYvui8L9XgmF
zB_)I5T1tb+rX(`=>7BoU@XM&s7EUw4-u~$Wszs)DPNI0KpCl|CwaHwi9dTx;y2Ip`
zERYf>C8P(YRc#E?C)WijELav1QEi4<OJu=pTE}cUiP<l%3$y#qzd%df4>zFlF7(P~
z8y`hUVNxJ{Y8*O0eE=gOz8KAnn-Sx{bYXg0`>NZBLaZEK=D2bnnC_@Vh~<T7N>ZPR
z{Rfz?t*(|C#<ryx;pAQrM4qMsx8k<L5qcD9V~6e|T_UzNVBk1?-~dP&spnW#ZA;jE
zifV|Wcl;#||0nYZH|<1lK29Zg_;f+<GMxWN9}p*`38xVWoTjo`BI@~rM9Xo@h@K;c
z6a^o7f~t@);D02lS)COWosE1zYFqEW)B60y2xmP%?Od7V(bsUNS*g2xN_~>?%hdO8
zghSX@!nUe}TeV#!JP=KwN0f}ofKoW@@)0h8axL_<6z76E^c3e}>)jMFwHIt`nGq5a
zOOt})^lfG?#t-w5n#sx!WC`YCoYCdwp*O)36J0U_mjV_R!Nxo@_4gF0LEMJLJIYlo
z%`d|<z#4WIVOg-THK!nxv2H$^h==2Wl?4dSzM`>+8SAQnNo|y)npy}Gdw!Y1w_~MJ
zu~Zu8l@(NoR95H<r=p`KbXF8$vS|r_#a^_7i9%<^2s;4?10f)Uozd8S-q-^!MWHox
ztL9n6rkkkFtQG1O0^5kwVpS9Kb)r2r6SUw72`daFTFwSvhb?hH#-`_D#{%3kZ;}Uz
zDg_o5!nOhnQKb{s%94vc2&^Bvt!3AONff%biM>OC>-nYPxN?!sy^#D+iXFbNa6lKg
zlf-K?S8?Ms$V5jdO<z$#&P>woMBz*(iCTnu><&+Dgh(m~H>m#g(rkQPG~0<ay}Gt(
z=yrU{0x5J=a(BO~jB)qKx*!dRyBFF9C=9|Eru{B7r{zRlch+3f+hPgcT;0RAX?XX{
z3J~wh%-L`=@6vnL8V&+SyV4G?J`<VYNsMzQ=OZ&b=?XK<9D;iZ0B(H3VQlzvYiF%W
z`$QkJ3;nRuvP%x>tqWC^=aA;o)KOA&&8Qokz|?YpZLpT7d6<xP=FK5QS2ml8&BWp5
zui$&g*fgoup9$Wq`d#AStZ;OfGLxM=xEAH+PE!ChJiG!0HQIP3amK(udd`X;`{@VG
z_F7(%J{0DnT=YChAL++_%Eoiit3c&^Rw=P(w&aZr`qle~45J4{1jT!DPY*`!>19!P
zb&^dgO)g<?BV-OAwN1v!y~J-OLN|%fN=`uYEo`r{*34F&@5(<-B&WEj<PfH~s6Evy
z8rbyAC#mlID#z*r^w9eE)mZ>iFjw~9$P&zzeG-t%S;(+{3V|u*LTY3&bob7P+&ebq
z7r9zI@PY6Z_Jk_8j%F*BUk7IsOWY9GYCtOGeEo%PRT1%{oQNNhB*`;h{SP2if|$(s
z3`Ij6&GdxdC4vU#JZ4U5a&<}UXkD~mqp%JFD?e5Yuf<ngl*(1NIaT#bv=AhqNCT}?
zy`^B)e5-(AwB<Dl_Cf)k_*oRiB!9Wqs#t}(TWQs-g5R2te&HAZ%fn^@Y|pipXuk-G
zn2U8253<w23N5C<_5}LEXVNjSDDeGt1*|o$+7<ZjsDHs;uJMP*AJldotFF(YN{nLa
zwE3!_mh%)U?oy*LFDKrAOtF^&#%$xKAzi&z4UnDs6c<JzQc>UVZYEk=5S?DM^i}TR
z_NghODEx+K>C0+|FF5n4I~*2WH|wMSJ2iLJiT7wyOii}to!8=vi0npvr*l?I3x`Fs
zqGM4B5_RW)Q~jgPpV1?$fzmt0_oDDuQ5g8kPVu38Fx1A%h}b`_7(6Lb3GouC0e_VO
z8@)!lz~8tUKo?{GxFYZ*rVZjN^hNxnCs!|-A~lhvFzr=3!gFEMr~JqDEPCZCEWb&8
z<0(vUNy%ge{NReqQ&?SI^fl6ckvFm%;+51tV&G5cO7`%4(pBmKGXdXba=d!qtlXo`
z4TOr?$#X4~E-0skojP-<?R*7wTjV4=@5C?W4r!V$*G#6lMw-bX*C@OK$28#79d%$p
zr8vLB+)W&O;tUUN+T=Wsw*2t&t{E{*KsJJlXN!3l|0M2V@UAiP+I_LC4?6(mfPzmu
zR4v;>*W|m1E}{FegB3nkhb|StbSR)zwh)WLUP@Jv#nrf5LdUltAG$A@4=42mJYa-a
z#apsK#r89*>S>+_`nWN0N%?Uu2DxDhFQP|QJ6aV>kl(Lach->%GJ<O!N@U=*Q2V9#
zMq@dRsxq+J{iA~RIu7l%xuD${^>x1rXbqH%x;(ZLt_!F%j&o}iY3%qYPv1$78Y%u<
zTe2%bwS8iodfUSs&_k>_=O#SjU0$Y|c6HQ*G3X$K!mM<HHWCha?ovlOJI4w^V{fJ7
zljfKY3#P~}S0*UppXN9{LXX^{^6Mb}LyQ`$+bKf#XL%zJu&mC5cq9m?MibkQ>k2C%
zPoygF175R7k2QhsGMI9JudHcOUI^3sI6QM1YQ2YN<<i7tVBW2CGIY$j9~tBH8cV0)
zPzl>&jzwX-SoGF;FExtD2JF`W@~EH+>vMjYzGfw(m`{2S3Z?m~Ad9pu{|*B4Oz-?c
zV4h}K(~%wY=!h*LDAAh|kmm@cQRfr%$ckAE+>hl2H<N(0IcB+8i$xQUin-1hXG8r9
zxZD3|aw`8Tc}O6b`@ec)FRAq*(D@I0=NHU<o|7Qe8uVc9rY(%Qf1d}l7`Xp0FSr}c
z-04TVsVy;Aej(;gKbp|oYlsqA<y$cKDiq49xzB>RqrLMB=DvhwU6<w_CzM8=m(wFF
zW|FxC?vcFUZYXp2kWt1GuTp6*e;k#scxU!&tV5$Ii!g2d9orkrc}OFeUSw2(5cTO>
zJ@EpH(Knse9q<t75}v)u?UrW~#nXG$XgNYxc$^kh#Q{QeA+~Oe^==v*=*N<Py!k=_
zvR7x&0NxU6`OMk@NfkyZ=N|@<9z`QP)L5wHYgpEFwcJUuST$@C<NdHBU3Ib_B{Z>{
zFb}pd6rRnCLMnBH7q-?;_NGz^-V-$S2>%OV!^<%|urlY!OZgjr961`j(zBZqW4c^;
zVx)6PkL$~MNG4SHc}A^-3JaB?kE`o2zyVT1h5L>q<n=ETg)?bzPjHeNjNS~}#w8S;
z`^JBGp}-)X3S#shOKR_~p*SgXQlp@V8}{K;j8P|@H$)a8Mbyb3d8w*^x#urkA3U19
z*M+4EcaG^`97}?6_=11|GtZPuux9{o33}Xhp#V81wHtgHz*_>4hu02Bsv(m$@;4zo
zUu0UJE`!lP`|~X8c{lSbgyyKTln2`w3IR%H?5Q{ksnl7onTNieI~VDH%*AltNf`1`
za{sw=31+`55BkDnKiwO1NvYogjoZERi$49WENeQmdyJz#N+_ZKrblj9o4|cGFSr}Z
zSafoab>-`q2tm%*zQ+=5{c;}U1zVr*jkjd$CqSn!_RcTZ`gxW$ovoW|)`ARu@E7Hj
zeV-5-b^eAPxtU79ekU)m8_HB@>%M(mxq8L0<ZA!EeF?UX(#Ndm3$|X4LOtx1Wb1RF
z)TO=i3%2fJS<~6tLtAeqlt!JK=#dq(7`Qj&1$RRk3vIo&D_>tj2u9j^ZGx?j<UwAr
z^}*hFOFI2FD154Se!<rJSk`s1b%jtu?@Eu{Y$b4myx?vqTd%{wCmKcZVbn4CD&B>c
z*%|kstiti@Kb9Ocy(<ri1oNL})LCWFL?3mc$J_ymz8%p<P5nob!=_(L6i;{3qQFN_
zfRc_mJYq&eL6`x&CDh`%3kAp#ogf2vO91lu3kAqAeXIhCBwh2btsRh5^^k_*ccFQ0
zG}5EL5QgHdENi-<NbT19N0^z|M33BNf`I+IyuhZ?VZBcH)>7$u7EqatG(KSr&^zF}
z5c$6A6LR*_JY*22z(66)7so@OVn|FMb;8C?0l*P}Qu)aQIENF3GZ_L7PAZk9w0#N;
z+{3_6uR0nC{uIl)4rzNeA%qRqdGLw>`>MRarqW@((sniWWHV{Q92!D;=%es=8vPKx
ztkNBU<tQU1Fu6;4DGzCc1p16Bt4JVyOqD<}0Z8SOvwTk_3a5)n)D`svC)pK&CZL_9
z$#n@ec-I910^KsPPC(H=owWVGcA>zKq63cfUzY^qxwV6lsti)kJ`D|RqLGYUP@QF6
zhf(-rLTJ?aqda)Ufc;WlU{mR^UZVgxdaQfA;O_~;C=T>kGGMT&5LeSon)ZX<m`h6i
z9%%gi-uZ=R@jaF`ovl4amRAu<qt2CiFpGhE1xjX=LJsbRGIq37x)r7!w*A)VxtCe`
zy?8LI(dla-pRgx=w<fIGt$D~IEd3Ei5wZ)07Jp}Npfr75-PA)c32*^W|E)=g9!M0=
zB!b-`a_*<PI7D5ny`UI%IeQayvDO8JJ`F8=u%2X*93;Z-O#-yEc7RglQHuJ11)*+6
zBN;{gFw2^*nW;YiI|v~RGxFdS1NN<XflZ~udJXO+W37hit&Br4;Y{Q2&k215JBP(b
zC1qL~sPJrp3b`EgPb3Ow(im!S)$u}4a0GIsIzOk7Vl#T5T{}3b9Folc3<&n`8Tjd#
zM&pHFXIaxFwMQTFEkbG3`DPx>V&MLtyx^u%A}*`xS>HzM$VMH$B6Ibu;bvM&+&<Ay
z3qEIg8NLKrm7!gTH}GAE`es8aaTPD2EuhD}rgQoU8%~+6%8zbCRoiFTvUah3RxMgb
zGyBzrsmc35pA2!GRdk78w4XL**Wn&{NCI6nF<HaSHZ^r#g6N5Q<Wh4G`?oTRUPq72
z!3sKP<r-On?Ku1b)K9GuRwpFz-E27C0oNUQwuKe`bZ~~)SB$0hba*kH|4WBuHCz0Q
zWNZ|mdv?@C7qqLz=SNE5h*EYO#li}$)5kTJkMpyTeO&oLTLq$9l%UHmED(ysH*yjm
zk_5}MAMuMCsnP3S4be=jG}agSYa$_OEJWhct{)YccXBZA$OWcY<o`UtJdTn8@n9#2
zYh8)IjkNJF*T(yK?KgGQo@q`0SZ7TqJ8H_mjyux={(uwK%SBkR*W(XCSeK!mse7n#
zDy1&j9XiR6aS?(c-<2%<0tfl2HG}-7ydW#XoU&-&&QNQ#Xg?B{w|6jk4XgDLOA!&y
zm@DHvOZ186zmjp!59gts7>j(UH-fS!{v$}nZ}iSD2A>~fS<@Yd;o}v4`M3}bm7rwf
zi-g#y^96cj?lFWo6VRW{3v?#g_yET*_j-LWSHz3s%>51_7%?{)MgCqM<OOs8x;NgE
zxql2g{omgC1#`d2vZgb4>jSNMoH|)%M`c8a#nKduFWtsid@((8vzS2NiIN$IUL5p|
zX0eD5$60&>AsDeZ88tqf2YJEbgT3*VEdCSFX}WiQ!Qu&)HJ!yfPSWMvILf`uu9^^9
zoJ>}XK1E34PC<I)W;7viZ(am8n$aTi9%pnw2u6%f#^cZCL0&N0>y5W$^jASAw|9QQ
z=o-tK&gkJguv?ZcTo)`>35vOGLTuD|8$EI}mw<jtUZ6LWxip#3JqY|PVaU1LKb;H$
ze>e~Ng1sN=jk#p+pMp}q(L29j?+01dboO3*yJh37(M25J$JtCL^g*%>-2Z|j0xL$V
z$u9?|!z?fE%&cM<UB3e0FC?fEQx{wxPpt{r>X^a$a-wj$XBy35QHv}@vn_^&6xT4G
z-UY@~>58%Av#hOju%dVhXGdz)B0#YY4?|4F#mMXoZ<li0mz<z0(6_8wE5vpS3iarA
zC7r$w3J>(oFT{2e%bG5>LnrCXnwH#FF5e}SoiRdd)Y(Umtk}gszBVt&8_HVPr0crd
zq`L^i$R=Hvv`MebgT7$yoxL%al=^ef`1aoU1#@p@S<{)jSC|=gmPyMu#(2QSGMXkv
z4UI)^kzkNA<WvGtB~pw!3-rh>5QJtqFPa-I5Ub2ozL_wL1fpZ6@*n3xUkJpTdSfmH
z;x9m{H}uXg1mblpYq~(}c*SxP$C}_^+_<xuNLH-=w}d24*P=&mRucm6%ZtE<vKov1
zYKsS>ZZdAz{|lkWc|CwUsyk*=3csI+0D{^7xi{{T+1~`Mez$ji!R$}6tm(}DDWUx}
zcM);ipjtP^=yp5fpj7*`EJ_IeoRA-NzD|$aLO_UpEiYmlDg<;D44psHRSbrANHG}X
zr<6!KFhMBL_pC$^g0KaJvi9-c0=))$=NE#oiDgX}guS=nW_yN=F@}gcj+jP3o@v5Z
z<NDcgoFdKKMsiFq?Uq&P!YbbZ^1cLJV#*b6(_0fh>M+!d0ifz<B%V%GmF^Qpt}3<9
zXA{R&bzvVc>x3;;x}-)DBd%q&rUMW;rJNC|Rj=16h4reN%U#9xQKDI7y^u$dfKl|Z
zwNUio-ndIz{S|2SVDJ1wXiu@M=|Ven(p<Ldt-6pF`7ZU*IY(%XI*-#Mt4hW|Udjvd
zhO^ghbY<_m2}Qx)j;pEvc^(1?oAgX?+$F948dQF|cYeX%Hp|+Jy>=tc-soMi_v3`t
zsPi#;<Yq5{{E@sM=U{Jo)@aU~PiU;3wcDIGpOI5#XwLh_)H(0?tnQpX=N;}56WfzC
z9m{8)wIia{3A-|*p)#sD-}K3FnnzBV{k}+C6@QP7V<1gT@<*cF`9U%NyPWyo&c%G1
z<NhmIg3WP%FE+>hbpc9rgt5GkVF~_GfIB*IkHNf6%V===dpR&`6XI3|It{*1wU$kB
zO9Rex;CBPFn<JQCg;{bF2gNcZ4V)QUp+i~g?3i7gXK4pMo#Td+TyMdF2Q%{s4bhpr
zqB$hFQBu@$Bbqfwf6dELe!2^oZi(Qh>7fw%16Gd)8$V2sy7QlZk>IQPqZbcIkd?lj
zanllaS`a88E(vMvpP5%^a9=P{Jl#)-92IJlIV#&@>{nHXi4U3Jgy<+ZT~!%_bI-cq
zoMv!lmr2!ln7e2uT!jY&`R<=dx;iuK!gW`tDoK+RcKO%^US+wvOp41M^>0y9SSqZ)
z=y}lZrTW?U!gvXecmF5>cjkyDxMnaHX|z-E{|<%kMq!ApJODWS*1;QZ5C_=GCvM)l
zBf7;V0<tjEC11B}^RxWljI7K+w%eF77Dlx&;~u){u*$%GA=kZRs#T`tJ71B=Lsi|S
z8E*;P@&Y^AU(en>tDyCd8`@Hem?e3bNx|xNP92{+ROa`>cbuTBgh^=%`8bEUkE71c
z70d6^&dU`lB(D-s>)9T<4<}T2bbp=wJGx-4>oi2SZs4*EOw7U|DB$8pL#|Y#rEsQ!
zP8>5jHLI~0RE;rv%9@&>m2E5hY<}{fFus1Iahmtd1)pwcDmCb8s8d+~7M1Jp5NK^2
zb0nezZH-2&K96JF(ImSQO5W=oiSJZW*|1~}*HF1<EwARnQK@hzfnW5*4w)yf1P4=F
zo(J$3Jhx6)V+A<3n;f5|s$H(K1$t5al$)-Enlgm-;isFEXYs@fNLsCjc|pN|S@aS%
zHSR%Rz|Mp~7>@zGDd3q#J&~wjb={)XaFGu|tuh~?K>ZaLFI8`-r*?rccB6Vj`VD;z
zRRsg>pXLFL-KZ|%`kfyENtc!{{87NBiySEXo8qaQ9O^?+VP~_rDlfSw8s@3<!r7Qo
z4*OQmAW80gkYsPv`IS5(sNGp`ayvo&ey%3cXL)ERx`dhe*_m0*$)K(uUH&b`BR8C$
z!0%b(KxB8x)N{KFzhm~`p@h4`3(X#+Qir-0T3)r#VJdV(w?c&^Y!bdF%qORev52?^
zvYF$?(PM^Lpd8760M0ay8h69E<ANf($qc3k7T!Yt&@hf2jl#jRGm&Zf32C~JMv5ad
zhrh|BX?6SD+xO9>QYjxfKR2Ck=jZZn&JW#ajqr<W;HpOv@W34&O}DnvaO=1%5?6BL
zG=GFbXdMeKnv@@K=M6#-KCNCNPl3W3?3S+5atW0MOBO;WxYH8r*V$c@IN1Y7fHD0y
zjdIQPsXm+wcC1vIDs*!kR7+hPFoZ}F4j6Z!3UrqzyT}te68P<w6>HJ6-~sV_y;ZHa
zA+OVgDR)3}{t2YI)bN5d2dnqFgw2d~_sgogPmY|wlqk2lq{9<o-95F$+>lGV34w-s
z_wQX`jk`|>z>pjX@2USt^3b?%<^fqaPZH{#2?5mr?)a1iRuXRs>$zj9I%Yn8xGq@#
z;fp|Tq&W;<4A6Aph_b0^4$b9x9hysCCGDVyF-Tvg>o-X#XU|2<jTxm!)+r3#jk%Iw
zeF;j(LNBjBa?V(O?6Jef_4K%bKMwN8EFQDQxnshqxe1<zob%<r58^BZUPDy$5EW%*
z;%)@@aBfW0K<<+e^A`amlGsek#u=?vH(ePzX^rMeps166+4=6Ie+!+oxE`7H%YLib
zbUn-yEJSPmRaA>c;?#@s=>lUcni1e3>hXyJi_hxGhzO6%*$ZO~lL@>C5-Gf($2?SJ
zE@G?W1@82s&ph4*5Pm6kbWaeR1a#?9S5LjC%Wn0==D?K#yQUERGF%6?<Ouaq@I%a$
zP_RRMibcYCq`8m;GKxtce&HJj849r)kXkprGqlc@(TP6#EA@G|1_+zvcZk4bciL*e
zFbHR7IGtkkSX57^Bk}TeGEwyu;kv7Wy*Qq*HXWU6`mDw)6UA3oCM_aCZ8BG2SBETW
z*me1s3EtG%jnnIbcP6irXz1iGn+03aL1AC}-K3Y+To<;}Ih9*OHh0mUxMIaROou?V
zPrHklnesQR3)A;76Y*j-Ng7>W<bY=3BFwAgVpE~UxcH8Baq;%^V73)N;d!Yp3q{aT
zNQzhr07j7ytcxOB^$tk-K4C1m3xvv(Npp>_$?Y27+3BbV#4qXgO+xH^n#eHfd@2_;
z)THFe0|e{upmfYN_Gf3N4kCs&b<jGbJF{?QDG?F3*_p=<6=s$X%}lYYyhSEtpdj91
za*1cBXAehNnp)5gS;k^{#!=wlV>bwdUy!yXL78m*H%5=ud+ZGEuSQoTH01u?e4gFk
z@R{SaS{Da1If*3=IiglH8^y1iq&YU9A4L&)%>~V|;}d7t?_f<WVrs5bx}UApF>9rg
za_dT^J26cb&>Wpvw`=T_3s&v8T0mo8Fc_7U2rpox(4lW6G%)TiV&$%)osjflk)(iT
z;`g0IRjUi4<~maQ%yld%)~I?zJ+&vaSlS)&RDe3j-c@}J&Y@j-#^ceXn}qY?F7hJP
zFzoiV3*1V#(hTy!xIxxtw=coi@d27v=8C`soz2}!3Pezj(?#cW`H*K(2p4-l=<Jqm
zddKc$wSB9$f}z?2EzAYWF&9lMdzOQ%XrX^TEqp7}7>_0t8nJ<?ST<K!Wm+9IKd8zi
z*V3^`bkQme^rF3!g}`OFQ7D-%nU$!p>)dggP9vJKQHpz6SK=r+2v^AfRv8KDh$}=!
z5gSibl1UY)Wu^+>{qba;(xM+z0(6nSY=+{-)eJ@W4(h?sA6lMW7OKUUy|R##xTn2T
zDpKFb*ML+pD};cNwXgt<$GJ|Ve1*su;7q7m3t^mAfPl*iO(n5T85)Y)&poU?fp(e|
za~_+a12QCc(Uc?E54H#fYq09gn&qp7B>S?#r)h515+LSn2`!APG6tYPTJ#isMb!rD
zB~By?XHsEmk*V;R3rS3+I2W|pE)>otu0I_Y*WT+NhhEL1dPTu3`7SYcY+~1_vzUu(
z+JNF1!BpYwlS>A|D`w`4Gx&!;vojbJ6z{}8{CUN30ZK{^2^^EB7OQ)8DazoSYcMK8
zhnwvRLh@`a|2mh?X_a0S*^Eiy1n>sv+`UkIllBDP_OE_e9@gM%6>md))h<u^D~$jf
zmDCOdo{pexl%A+?fKQ;XMg0S5o9V(WzT5K3xM6XECMx^F9px6*yETGhls*@36Dc^b
z!D`Qi!@d>JoVVW&cU9bSE3j++6qd(f^+co64!8U)nLJ<J3chnL99gs)*vt^P9?FkY
z%m97~OdDRd@@9&t`wU*OI*Xtww!9kNwg+yxIB%BE&{x0BcFcqqFSu?17tPYXoahU;
z`>?*?LU9?3yy|VF?C=B6ZWghLyAFJO)HljgteVAAic8q$SuEFZ(IntSb5Q}Aunn#g
zW*Ca>2tpjT7$Qtxldpr}E^FBaq2S@Qe35A|9IROLtwq$gW6AVrh95a#<?Bcpq2q}x
z!l?b`aEIN%aeze}>F3h!@^(1V3Kk|`HtE~=eP#S(5sMIAuZWrZO3m^>WCFDuw8Ncl
zD~Q)J$ZBbadlFv~RXEQ<!NMK9UIl|FeP#SZqHuT-;oyT%RgkC#oZ47;YBm;I=As3P
zSMc6%HQM1No>g|eO0i;Lu|oyT*o@L!Fe9=6G(i!&Qsh%D?dq0rhuI3;qDl(;ZAjGi
zN~_*1N~r^3S%M9L^BU-vQO!=40_rw=V!uji`c|vr7MJTJPZ!Y?if<M5l1xg<L6MFj
z;qtk&Sh0Qbm4QeE<&e;Z>O{B=$oP<dz9$?~6J;wd*yyU;Q25>S3yt`eM@LbC!&F-Z
zEZ^#xOY#*Wx{Fi_l0z$Fp#pU~XrH`jf4HM*HH-4ZOhRTGrO;Fh(~R&X)gWm4w@gnX
z*`I2z1XZ^&<$8<L?eH?n$pC;36$1+n1k|k^4kLZ?x|th5&mG=EIZ-{OsOtBL>Y=G7
ziR>B6o5InS3#<+3{B$*_*U;EVV9rB}usyhaVmRCbnXDJ3dP)R}ev>5Rsqi9hu8LJ$
zmtJF6riYtrE{Xm&AM;T`@wF}JwGTpF!ru97vF2j@#7VoSTs0|(W_euSKxIZkn$2o8
z(Zmiw7uW&l&+WidkRG>;RlJY^VHhqZQ{m&Ruy{Uf6oT;5T41J)o0&<1%wSb<1uDD(
z5UQ3HppnZkv@*{Wt-5K~iZ~mB7W*);cTvs6a*PWXxJ`R1+{SBQ)%z$tU^ULRvGFV%
z=H><Z4AHb36&uPD6a&*+v|z3vNV@<eL@j`cMV%FE!EZm=4lj<SHq1JjMlxz!kS|xC
zu~wF#cnA++`ciCb)3&IcZaeqU39o**g?3q0s0!yRNWq8a`G+B@jei+)o`JP+p2nZ*
z!_^0?Z>YY`xw{`JchaAe1Niew`tyDI^F8|WKGfm-3;J^vPHtnT$vVS0s*tte{3W)X
zIe$Ta-bVGl1%F!M2(`xs=zxW{I9GjmuKI>K*47+rXO6Wo$LgPBb<eSS-^}WqWA)9o
zs(Yyh2JSY1J6U~Q^)!RE`X&zOJp?xc^i>4yH|fvE=???>2lR^$z;)<^Tn_SA=@$c;
zb`Ua<*+Ng}Y5L&NpFzTp<-3fs(0RPh*9ghu^jgD`7Pc|O`F;9D%PpOsMl^@5SaAM~
zeo=td`FWxU^Q^+{x-Ky$Z!g<?BOU24Pa%^j@^PurQ+Phe5_FH|ccpr=td}MdW$uw!
zjU%E}R_Nkb{pkI?fV$hul66I2HiZQk^fJzMg4VXftvI;2#<c_v#L(?g`rAqVJ_FQG
z6#O@~?}w3UnjXv@gxiN&@`j~-*ORLw=;>E{SUQoaT#rGxlC%+6p4%I}?+&N#LP*pj
z6*suT8P^DvxrSmXJO(7rEKbh0U4Jo+TUK{Y$(4E<4)R!!eBof^TJ(jRN%Gs_=DX+a
zyqEfS;g!KclG}CSJro4o$LkBXN=h)}u{9c(!gwu`-JorcF5E3xjrJUQg01<f{}1gQ
BEsy{J

literal 45268
zcmeHw3veCRc^&}}1aSEPDT<P1iPh4wB=CV3Nl7+KLT^?sMaYq8TdFADySR68?_S=Q
zclQziEm^i3JCd`uWb4Y$dQvw{(s64?m903hN$k{h;!YDg8f#)FX*200QR_5KM`P8l
zQfK=8=efK0V$T8~C{1h(iN)^z=luWqU*|vnIeX4~2A}@MGaJ}XIO?}5Zewx6E|nV1
zlH+&6;Zn2Mt~-sO^HgW=dpnPG#=;TLUhtc3ujq8b4S*<C+*-+V8l8ta;Wh#f+?qcj
z$`AQYF>sp=RlG7-*;E;Ns54d>2?ql=s5y~W;g;KM-z{4AEj0pru|seG+jz=ZB>aiD
z@9!{rP~pySQ_BVgL8r2#(pMP>HwpS?!;Lk!;dEx(b9R`sgTQm=+5y@{?HF)NKG8f>
ztl7SghxmK2Vb}Rz!=-jh-^|&?vz{|gFzs+Cu*>wSQyHyXS=mAuD_4cbCM(UlGg)%&
zpjbKUPWoPPvgj?ff@W>JZu^1bO@cZ8<h{=PNxL!08p_)_;rXC^_lbe_TxBz7vgXou
z`5@eKhXYDIo7m}d-dvV=s97=%$|gBwvz6V{{>nc>qbn9T`Ud=eBmQ59|6^!SWglzE
z0S;c-4^oCe%1F4i=7MaymY=INi)W*98lATmtz-DV-&(@|^OBsd=bEBTpy=i_I>M2~
zdhLkcvPrRqTb|=P-Z}g^INu~)dpsPj*^P4BF5}sd;4Cz*;+88l{15WBS0>3)dyZAE
zV(l0KQr52aoTC^JZYf1MX-kH5J&!ObrzNczlp?FqQ%fz!y3d841Z}iL@hACQ^T!5;
z{K_PDIwG-ANNh&w%2o3R%GMF<UG{;wN35}Vw_(|Ptz$FRgZ4w#oFpb4NK;0VtEWk>
za<Vd8x##i9TeVy&_r?XW19dQRV}ckBz@~9uvq{T>y|QAjQp7>6PZ7tayX~cB8%9PB
z<+4!T>Lz{=<UO`B=D$C}{MRva8G#eB%bwk;L`>!WYTt$p|HNyyTfWttx1yS7!Dm@b
zuWUEm^G?Z{vwi$-HY~SMf-hrsK9P$Wy|v&56)UJXmJjz6g|p_ITC-8Mf~J05CZrR&
zyWs#C>HuC8Z|#8L<w$_A-UJnR++Zc=oU+?!xTp%m+PMh1F%+mI^6G%KfIh&n$k%qG
z$|+Pe$M-FGl)4MEa4g$mBqrH1VOh7s!?`8LJ7B@~EoafLw`$IT9JPGDS*tY{h``&q
zbBz+>9}yz{3D++!*R>^m3YPSV?3VN~;izAaV$7mqZtP8oZYF0z(;Uyib%}L9`>aL$
zeO`7&xm=mOSdx~$`U-T5$o>7|8r|QXNb^1}z4ZN~a1Ey_t}pDMV#7KXnlXhw0Ea+I
z?^%WUf@L?zL5TZu0hV%Wtwwg6<EA&~1PhMSP_Tt^A=TokPUSgrxI>Mnq<d+3ZlmbJ
z@GQI4s=2Ui;awt@@52c(zfmYK!4yy*#R@ri4^+n-L$QJup$no4&^qRC0AtrI7GE8(
z3QN3Yh4Y08Cb%*9=)IX4(@~;YNg)X2SE6c)aA%Z-qj|)6P_YI=4jJ-R2EzfgMk-a`
zyhe#&_R7jv)3k%ak>4h4(Co{?tuYzudXg`?$oq=a8jw=fq?C0PjFfL@C*_J|)koJE
zrU0dqn8K|Wvy(W;xD_EsJV-^I!kt&Lqu!lrI1!QzfT^S|&!y^C_=fD%ZjP97gtpk@
z)ly=uh>|z2+J!{uUPC2atsDu5#4sjm&m+oVNvj@Y4onk4=2X4G-1h1rzz|ku-#P97
zbX8&WX%~S}%T7^<yUe6S{LFRPTyKQNtR+(EU(%jwN!QI-`QVD^Pg;KE{|XjIxpiJ+
zJD<Q-UlF#x30*wIO|p%8>?p^I(ZREfVfLYzh+%Yra8r$sJ@n8<KS>$U(2yc!L^FJQ
zvrcIlHL}zXRCic?ifLx`BXnU&ij1j%>W5VcHrPD~T2#~$enSS{e!JCbdV$YX-YN=;
zq~`g7?FD?uQYcLBLuf$Zi-Z3(jL8)W`z8yB5a=OAFNX4fWuTGa1C3^!994*DgT@9_
z4cyOd6oIJfth&7f?`R?Z2r%5Sy*W4VY|pJN>0smF%9|8XnAMbqZ}~aJWG<HKVLVX1
z{3gyb>7Du~_i2pGp8gG>4IPAVO$-zBPTS%l&^3n1H(BT-`6>GLP3qbheZR2^`rw1I
zsDs87W-XDWJ(JP)OeWj&2dik$PhEJGRn{G@L*+fVq&-=h>pP5+(rG}`bRueQavw$%
z7~<fc9d{JgzRBF=WaMqs3*=(ua5Kxzci&`JB~k@11}epUrs6LeR3bxO>`gJosRTSy
zH4{Oz)a-;KbjedTJsQ63yhEhrEpik4z)E3?V-=k+-gt^?5IHY?6Q}?04fKo5aP<|y
ziE;W&v@59oKYGEE`Im(wilm5nMjoP}Tl&dm#r+)mfmj15J;xvDY8bOGWrb7I*wWu|
zJlQn&X3$0Li{&LTH89;_9d<Zsm+H-iOG)=}CJ{TDI}eAD(`R!5;pRw2pK{REA4a$q
zld>iZlP9tp*Wp3*SxSIFopMTmu=y>NM0Dp}$5Syv?3q%9>doLR2s}oY6@>{$R0$R)
z+#c19`#*r@%Wf69JV^`sW#sn!fck7oWgxS`G6Ka4lBY%V?!Fj6%)6Kt$*IRyy^TWX
z#~lO@jt9qT-PtJDT)$$~oB-vhrZzICo?oPl=2)SSFBJCj%5pkus4DbjV9-?)Iw8uz
zxOJo`N^aQ=4&=HkMq&m;SV)o}6ANV5b7c2n4#<i&w_=||y0(St>{_nwAlHl3rAV5{
z`HTaW&+@iQjHE`BwX;pxU;wtfCUVLM_PlYPMk(c3-ozU79mgu1aF!ODUJ2e6anNmT
zw-$_}&^;~8+XPL|FXZ>?Fz4Y{Qy$u!!&jFMsQL+|xV=KJL8dy=arWgk<;)SCLg9>o
z7vX_XTo#^M4@J~;tyBGL<y3hUoEqI5x2#AbyIy6X4|b^}dA+WTN%H(E=nF`a7u(7;
z-QlZ)zXzw0FdgZcDt&|5CrOE1ZSY=^b{j!K;u8jWh8uZTZLBLCM9bV#C%pQsaIfQV
zuj6yVy^c4fdu1K{hk#ZvC>+LQZ?ksJDRoZtG0X3V|5aUWNOwJWsUw24Ap1^~lwB_B
z2LI8Q1~vx0UL-bzW{c$&Lq)rlSbGs(ekY$yW7Bkzeo9JY+4rgq)i3krK4)Myg+N~<
zP(BlXH;8|R6^V=v{wc}B!Vg`i<saA6A2glmczJq}n-x%WJxDL<kLwAHL(#2lz=f<*
zwV8Q~|6pivhG<_iK}($0p&S&!<}Q(`9A}d#;|rKehNj_VWVuFiRmNk)=r0hXwRV8#
zo7k$42%61NY3pb+@i-;mr0^~!;4~VQ7>F3*6xXZ&gSYBMx~wQL{R>rs1*UHU<vM>=
zrx`9C5JuQyMT0d<1Z!-HO9W0lJ%NN$E*hlK?3|9$#AH{A&u+;H>F^?B)lB>WXX49>
zC0UYyGNt(rD3xR;b2&p|z!Gsd;mgF(z@EcQAx$POSVe@?h}6ptJQF7Rv9w{y^4fe^
zL7`Y_wk9fmfmS*Mlo>z_9~{X!H6OXWMFjGVoI9UGTzw8jF^gTSwM$N}-Ym6iPR?)7
ziND+iK<BYmDA#ZnXc-BL*yXy73wh^YiB=0Va_kMCGsZ9>=hi7>nX~;|#VsKcNB#5e
zVvS!sej(g-4EWBWN{mVB4iM#N)Pl4ju;xn5g+^{pO)>wNwq7Y1^NoW8=`k_+M)Few
zfQzV<=o<p2TAPqBE<1XmA!c2-PE1&N86yZ&T5cIz^<P56!(rKBvz~b;q1%0;oj{2k
z#4iI_=2}IMS^ZMvSvV}w%8o@pP))C1%bRnJq4kNbZ~^34tcdOk@4p+vWz7G_ez-aC
zN5T-~jZl7mtJGB73Jc(OT=`*vu^+Df{1LMO`4(0p|D-E7D)mI!AA7=VR$B&#a_1E^
zhOcB@;+`9>da108KVjBNrlkPz2RB##gw^GVx5DNntne1{mW*DA?I(OCFL)vOs<fXO
z{<J~$bx^difpkwNxh_!Kf(}*K(%eIx>eZ;*p@6vhN3cv51V!xImQ!$P0g>#xL_ic?
z;VdE*6X-P_rTp9y3o@~Aw0ax}tGn>a4=?Wth#>*Mh%OEmiz_}9k1KeGC?a%Uu2#Dq
zfwvqy@X3LS<9g_j{3bF)=ycp*iO-p#BSp#^2Iv$Wq|b^-m8pU(H^zezTK)<+bXp1y
z%b5e7^g-s~i7Zt8xA%PVqS2-Fr}|d#5w38SE}6qS8JRp9@#(Dl7-S5O#3jP5M-t+f
z-Xk~|;i^iG_I|0UEplpYTnyPCtfuB;o_`J+&oFol);0xfwPOzgu|lEPtWl1z>!n(=
zoE#TY=D4=tmV!#>#9r!O0#4pL8M<m4mw5M<siqxWHG%L!xMsW5P1;B};58Szp0kDh
zNcVb6U9TcR_^=d(>R#0Y&GJw4Hhq${DK+z7k!tY)u>50Y_-cn&{SgLQeHxbpyYzTr
z>#b4al=LQ^YNDUzH9x~@&QA2_&G2!ewZBa21_|*APDPlZ)(>(}t~pHJbInq>@W!f7
z0x-^{v2@N26$;0W&4>hCY}%*#UkE8*jXeMuog!hq%AaK*n=iYm{)rh>DaT__j_;V^
zC7)klpy^E<^yt$AsTAT)E5naa1(5!o8EK5jADZFgL}pTk=XrZpEJiFvI4$QFV^R#G
zZ_wBDpH5DiU%k=jE#;)$m1a=IBP`dizRnCUd9;gxu1SzHr~*ijnvuqce6txoPULzE
za`JR9b0k5kHzdf((+P_#WN3)6$kS#}#iI~BeZUMadGvM$x+XzBiYkEg5i`;lk>}0u
zaU$1Mkh{sTVnI})u!mocsaxDLZ#33rsRSY&RsXSL2?2jLLj#3?Kf^$wCViH!gl@oB
z{;mr*k*RR+N#g#}8gW;@hzgcL&ibGTcJww$^j}|J^n0R=AHbbv8td%7vr_b_s-?8{
z!(hm#GE^-hp^r1rbkiE8tfwBT$T4=<^;~y=KR~r0<YhA<F~VOm!%K7Hgs1XEMnkLZ
z0B<T35XHdSj`H77C)~{7g4HWW-^lOy<>)bSOV?h8h{<Ic5s?KYBcCe<Gk2J~7-+%_
zr77^2aXSQRG(ehR-_e8~?q5gL=wFUTjIjS`(g=>NFLIKVY<T}n68Sx=L7vm>3;S~9
z`+D)58ZI?~I@Y6a)Ww+f&#eY`#P6mF9LQ&)$Y+wsgLOm>$IFaCvV8z|iMD@WebLV-
z8wBSEaF;;;iIt*Hbu!9-JqcB~BtzB0@s2Xk3+{NojA}v1b7n$fgg<MBmyVYcp30N8
zI$kL7!w(C~jrp?bA5ru8__6=thZBPRZiYsPSmp&YsN&C4;OFyZc*&n{GSGCv8itQQ
zKovmxvKeWN$d}CUaU$1Mi0F3C^pxS{o0JUu&Ll*51>PCbY;xeZ%M7Zx^EBC}8D4T{
zl!2y;aAVDxR|x=qqr;z@PytZhU`81u@t_$#PU5->5LS5Ibv-5c4r-pT!t1U}i12|7
zjSyD&HZ!Q=&&R>fd(H5YKld=ubP*b?Z~;{SY1@o6Mx<wkj}y7BLWC7w(^G~Yr`B;9
z_Fa<@;U_aRL5T2aGpORuC&A5+n&BmPo?xJB65*Fo1&}^xMj9jXSu=c`$aNLrwFu|L
zID`*GX4I{`m(gDL=$}AkDAqrd9Cmy+Lqlbc$v~GGcD%q|#=2_CEgg-FJNl0%2OfXD
zj>r*(GA_xc58y7L<Ud+p^hcwOAHZD#{pe8Uo{n>O1*~VSmpZ|M;I1LSo|U3cRdHoK
zpN6$PpMkL=2>vG5o78!j)Q<KRGy^DS%&m!$_>ax-(!e>1sjXjYxVyPf*w2y)<HA-G
zW(*&W_fnPn_9rxHE<<C45uah8%V-jR88>2}mPAph@dWB%rKnT+s6_M`i1fh>RSPY;
zpMj=#6scPD6e<A9kC;)$Nc^xFUTP61F}3w;)uOBMWi8Vp%-JAKg<b={C*cL?MmmFT
z%|aQaS;=orpUcodp;`Z)fi9z2{AHJB$;l-um7GEP-StHc?x<E@n^5ZSt|Mx6iX;+=
zyMHp7ocQbYMXnS9Jnz3YiTp<^MV_kA%2s|3w)KS!RSR?ew+wU*=6uyKGw0XiVi-%t
zNW9z(FU^^gnA-Zanlm)zOz-jYQEHwTeVs`Tpl32PLYV9kGpORvXCcCy%<z&whZ$(P
z2o0mJ)2ISS|Ct$SjL3JG;p0TEs}Qd&6mEe7h6lbyT=y`4yayNN1G@b&;G}oxyCvb7
z-kqUwLb&G{C|S7`$r`geaFxG}J7g#v5h;=P-;%`sk+ov4K8YHZ!Hz&f@`SpBJ&Bh8
z{3>uqrzvH+e3^zTc@V?)B#}S2Qsk*RrPTH3!HR_pRSUNmFwk_HN{w>9jS7JBc{9ow
ziQhECON-(prnY{qZgJ;WyJ34vdtp)tO!52O(vl#$Vfj*PPvjZe{u1Y5Y{v~li2HXL
znlEgQ*G}piF*&Ju%b=FzQ>k}rve_Kb))8X|CX=DO_EgR*q5c9G@wXXTCG_rpa-OA*
z(G0%)02%_M`^@c$5qZ5CUTPjEGPV72%}WRU7GJ-`*TyXm8g8TooShT>wDhjY%ba1W
zt#lds&g(G$&MW#k7nL~8OGFkcV-H^J*{cgzKg(7?i=BJ*XNhbHvHUDiFAxTrln=Sy
z7UtB4o8mjgl<&HBtB=Z0(PphR=bTg1-<Qi?!T_Z+;tp4VB3&{s`o%uW)q*O)zUlg0
zZ0)uFqMUy(M4OGA!zMotR#VeP18U_o-~W`h5Ty-*T5Z0~Di%NEQz3lC)WBZX9yXw+
zF9>{#eS(io583DY^Gj@xAs>6SvX3Wy=bdd@mhG#h)~_xRn#De6@jDg6R`SKyzl*RM
z-^n}#)l97Uj4r5-sD$FNREbM_zSLy?G$-?YxR|1IxuE)&LENJZzS`<0Y_+SNw?tMw
zKgnxvch#P0{q$IOO+VXJ)5_P;W?C%$ENAC48Q3WoOFs*Ce%=f(ee35qZ&Evep_6=z
z3#kO^Ud#O(oY3DjBUYUN5&AVVe4J42JyRA)|5Aop#R6%e8h_X&&{eFAMyw$-d9mQT
z`Vuim%*G`1d*9DMtB64Uw;5D1_e)^z-<aVgbHB$x)5Fi<TT3OjWsXz>{Xpx%B{>!h
zY{$i9|59Oz)U9UtIH{TR;6>i56|aqs1dVY)9;DU@K_;`Mhch%m2y)5{ss#Bf;Lf-i
zUUFw215Fp?=KI=n`0SM*;UJn5d#1&CFRB9pZ#5GTBlx5lK2Gp@i&N%7<KpzFbwZrU
z>}Zgo2|}DLGpORuuY#L(GrZ(Zm4T*<bKA*wEx?w}ZjtRSFRe5ASPS)|s1#&8X(l5^
z_J_>yakAH2s4~MG7wWUrIw90#-uX)znjnPwj2TpM=hwl_&zs>TcRt5J(}g;G2fiBg
z>5LW87X3gA@_AGQ)Za3rj*<HNX81U%>ncb}n)gnHzC_LAlI)*Mrb54;p%Jp*G=nPs
z{3iJMH)eRrpYJiybWvV&yW?UP#4@%W<07S<#h|+uj&i`(W+kiL+RLO&JEULI4XpD9
zJ>P=h?VG8$jhR7+K1|vNWgn83a0M%p`X!spKJeO6$(9(!N(~dw6+Nk16Jz++48(|h
z1!s6_)iM>ZhTi{Lk#>r)w0az5O3#v<R=O)g6NEb6VFp#)`7LnsRx`X*#~B8iu8u<|
zY1fUm`b1XUD}h$$Q4J86%!p%z+GhATq3bF}_?2sW`;`w+^MqfyHtAO$%g_iR$e%WY
zD*k*0{Cuw&Uh?PN3^ZMkd!(yidoZ+pYm6s99IJ(+zTj}USApSXfYieOMW6<;|JqD!
ztZ|<;!^a!9-ojsIe(mejJR$t9`L*B6&<G*?ubDv=e|`u2{HhsV^5?f0Xu9yX-MQGp
z)(hBxGamFM9&54w6)FW8e_<vgM)seZ;p1elt5~u0sa8JN(>ZV2qU1UN7~N^IWcx7Q
z8pfltyW406RUG;nINE21mmK>041#^VwCY;3j9h0>sas=oh?I3unR6P57Wj3<kSnWi
zG?N!=&K@&-ygBPCa5~X}_Cx3?^5fJ(Zpwpv*96siCiJ^9G)4BwW>CeYuY;?%n&Bmv
zW*BI?HSf92rA_tGP-_esXlzl71U1w3vBv)Cz1W3T1&EjS0@d0c_I?kNOPr3_?AVql
z4mHw%`7pG)R>sbHhBga!a$FR5?$wphjiMt}YhtXnGoTg0A!l`J)oTq7;eqP*Vo!Da
z6bKdSH~<*kaK^oVk)auad!I0aDh~Y~IQq01UMk~98ECpP4xO|Y-Fmw&^+DY$>#F`b
zssZ9(H6xA@`kWa)PUyOe(rxq<<sVb~xMvx_xpoOr{%MA02vL5=45~QvpTN-<%<z&!
z&ofYyDBVU}l;U2C@)cAA#6L76juHB@89q+v3PhO>DrRqa;(mG1UbDA+mPwbP+1ndZ
zXK&;4ld;*`aJQVI9jA#!K8G6FL{{&{sQ}pwq?l~gGi#~Sx-=u2GLO4`R?KbQ%@1`|
zqq^=FTI7eeGLcWyWks{K6RHH8t^I@8Z0%o3Qp9$rYAf~yL@@!*ufq=Jb1p6Kz+TYB
zz^)yT`?1sB(76f@gp~WU<BN2DP$oOKjzvG1@3pb1BzDL{=ZO6!OSFL_Oq1_J>EgT^
z?3IOm>5kyz?Ws8=S7`rEi4KpN;*r4I5c9vNjF%&LIvA7ohv$26p%DB$t0zJmpBJV~
z&Ck3>+N+(@YlkE_l$({V^xBObgL9IS>|*+-=5#Z7?1thQ19rj$O{8P^qC(ddCSPQt
z4ho~GYwF4vbq}tBx=BV|cKy>R!xb0J)Iu4>fOGv*$#A8yiWctZHWuY{!X7VsP^o=$
zkLg|20euT4r7y~|?dPS@{jsHclG5${QW0Ja!3p5|U<QUncE)}IMSg}A(c6KB|Lfol
zhvjyb>Wb5H?hxlv2-0#>J>YtQ%}w*4DOH&Tu-llEmCiCZ)jV|5jT(Uc1*m(-1#6(i
z<98-tsH(dnPFWGRIL~(Xj)M0Fl^p(YYqruI<|{s7P#nFPraJ#Txu2$1CT$-SyWGfQ
z7rm3FTp*UVd!{rTwVk-$!0-N_!hW?~-CB3QjjlD)C0eq(wy;e;rXtbN=WraGrPfl>
zVlCT3=Zwy}<}}JQ%5^84i37CuYKia9O(7IUybm@W;(cz;r!!Xy4La<FHoFw%x_W+E
z-^Bt1Iw?gg_L{@i&Opgdc~NKC3iX{x8XFds(ShCP9Iw_y08-+eKR>#KZ8S~M2DYhn
zJP+j0d(Ao>cEgU{24iqUHcrANyrO=BrWIxrmh?G%hhvHu-t{W7Hqx8Cs${?|K0^*Q
z5_iTXSwal3nG#6nF@QTwJhP}@GguU@*An9|!o^~P9Q93HsdQ~P!c#x(L0RQ1a+O>-
z09BME^(6;{|Jh6so#M$_&ZzmFe*jvoyj=JXp*20EuYGM=Eb?b4DP3xoSmbqgi;<e%
zD3~uymD;sDfZ}-ddt^daR{y(M@1m!5{3VL~B{v9lmLEH=d}?lbYB~}`P}hzw{fPD8
z;fD_3?`dlvEuw{AC0EY<D&mUigNG8~3@<c&kV+luS!i+DLN`*O!@UaSlC&xM-eo^B
zVT}onS^%^6TE}KA8^_0Y|A06fXUe|?&Krl2&`Do#E&S+tt6|L?6A9SqDItlUum(r6
zVfA#3HA)AWC;mSM1<VlJXr<KlMzPIJ7dp1NyjN^P$H>|>^!7N}Lgp#3VSlSxTWU1x
zINc5B;9~1;WH4v}2Tq1lFL0~{G6y~_(V@%+Wh2-M^1@;Pl?4k9G9EZF18E+1I2^W1
zz@A6U=54E3Yx-0lHbR;y6ee=L;sTASM|_3MMk2oA@llQr-(x55VM#ol#Ni-OQuc79
z9PF0vbgek>syjj{c2RQS85HS$FA6$1y=~j#5l5_FU)242au9qu${CUntY4@4S-*a1
zFVROD-1~hG3ga;mvL&QFvWMtDn%o;}pP5h@5h+?n6UrDNv+GqB3Q3g}g%8i@>X@fE
zwh9X0_ZqMa<?q7R0yRD4puJ{Vl=8PIxsoVl=UbJdlOr3ITJHHy@u~VCBn@m2WDs~H
zU-Eqvc{?i-$(OwM=)>0HnKL(9`{{C+Uk>uiG%nND!!t5cxe4KenmXkH4U!`{UV|ul
zh>Ef@@#p}N0b-pS5;agvBo+EKK#Afov!}9wy%~C5&2p_n)bqaSLifCMXt+G2ly$c1
zjQM%73SDQSX!J~7BTwC1V<J1x)5Uua<XHYR`WSgy94;wm4#tq!=SA?4QUcLDg|4iL
z+~?jL4`k61-imQOUk<Mc;YZVolRnV%qn{T2H+6|kb_Snat1ac&@nYy~5f88hIjHZH
zOiGAeSH5ETQ8_8WGr_qeks^=4&elH2nn3-wssZVRy6v5%Rilhg^wM9d&oyhHutmXy
zOeS_WiDf2qRV-~XJ;nJHtH+^wx}$@e*C<5YC4_6P3hv@jax}~45sWhoj~Of|l0_g)
ztbgCprGb$)^>~?y%G8;LPp^W?sg)W;q!BAGo289pZ_<_aH<Mx37go{6$rYM!q=_po
zYHT6aTEjWW2KGhH24%kbtE*_=XPD`~R$Wbmo3C*~v&ar^Q^~HSo5p1K?N!L`_6y*I
zH5uUrsV)m2;Pw?C98Cb@!;7on!{%rwqQaLj_P7UKIvPofXkS6e6-BhiySjKC(e`?$
z2(Au}vWRv77sF^Ul5IQL-v<geuriU5)}Nl5IEaMS#6jm!GzdiqN)M6#nw~myC^xlu
zXljC;ohyL=KpC|gDU_X_oW4<jv?3WefQ-dp_M*VSGl!*6UlrVnjZBSp7<gz7Tcdo{
znnH2wn=f$O8h+~5TCGQ9n4B?Eo*FqMwz<FpR_%(-2H4I7BHYbIA~K#$#gctzqKtX4
zLg8Mv;Ki;L3OXJu6pmv~Dxe85yYAN5rUx`n=F@r8Se-_5O72CYQ9Fc-i4-=pm&|Y3
zI1fu$HSeUR56efIXr_J#4eA$(`3NhYInn~rwS~FJQzMO7#VjN#2^?hix;{qTovWbk
zk{-IDOfKy8wg<J^j#51C$s9Q}?Q$d2#yc^<yN~8;nRareX6Z)NZb9W<Iz^by8}S@U
zp5pTbWM6yQ7(4pV^_|)h##8sTG0Cb1Ml@gRIaQqah*6MFE5(X55Ti_fBQ|=J>&$Y?
z%vYo4cjz*52q|Z?+3d8$O4GXHbG;mvX47bilDKr1qiPB}D;XQ9G{jtqHqu=^nWLp2
zE&~95pGj5zjEYsxu2_VRsr}18o+8t>^JB_@9y*uJJ#1ahJ%k^lJ_<b^+k{7%v6@+s
zhaeXUdFuW6l8OpuVUWvl=I3GO{8Vu#C(2?IpjsQtKH33tAxkuMBlq;d(ZU{<a=<3-
zl0Ap7ZUb^3chNK!c@4Iv1WTIgt(xQObs5)Xqc38wSxbPK?@2Xaj2zKu*(>zrH4fGz
zJf7Wf2@f;evlo+v+FULw+8%t(rldRLN@_kaeCTZ~&6bxUQunIm)n6hBUs?Ty46@P*
z?~|7iCI5;GP0hxKS4_?2r|^Sc(^ClX^T+XnUw7Ur2}prZBr)CjqJf?ap>~8u&E9aM
zTS8)-EpK1r%CktN+l7A^m;QkxpiR|6`A&AmKHjD5gob75k&3q<&FL1${iQ~LZ*uga
zeEuA{Q}H}e;Q)^~**f=uv{7HU$#1s3B92YlkLa<|7j7%Iu~e)P<i+#ZaEp9`T>zZU
zY&h&Y0nI1-op48~S!@Sx&7Z)^GAvAJlse(2x08GG^+CI%v*AeDX<+Gl(DYD#q+|z(
zJmAJ~vzepGqwce~#S$l?Cg1jIxZ4^ui}^Xbc$VJ!9ri^=c*%UT86e7WB5zLgg<E}i
zT1X+kh&5654xViD1J7;c@l|mh?eS6HmHdfQbJ&wSjdb!w98HZ#h|q}w>cJKSM@=ut
zv;F0;lU|5yc}?98hC7@^7mPv-*Y+jQU^rNE=GtY{w{5}pX!aZs@aT0s8KHe^9BNVL
zv2dH)z+P{8?AO+$&z(ErNIRGxf77_{;_s{CFY{Qx*Yxt36))8s4@@Rfi$NzGZMK7W
zErYC<PPjYqCQ(K8M=-E(8?RT>AWL5re~~C0Zl^Z*U{nPxs-aCCtl6|1<+fdR!0{69
z`<+H7+=&ywn_ekja<GtqP7HS$r#E3@Vjj%|N8D1L&v<kyo5F2&J80(hqp%;Rn}=IV
z?RqP(v<{4A4_qjm*T9Snsu^WZz}<#V;@6K_zSAx>^NV%Tr|mQk;XC<gNv0(@eVz8U
z;QBe5FS$NN!)S=0a!6W3Wq-H@jq#!X{KI8vjR4EfyXclXF!*gPr=?GGCt9}96PmDK
ziXB>&AZYnVCMOpb7A9ItL8aN4XnN(zl5=hnkp5&R+(jj*Mk<jH9Q66Hnoc;3=i}E-
z9R^#rdGo~t8hWD9TqV&2P3#0YfsF^}8JbE^uK~pf4kw2Ru;aRi!`)D*dS2O<+Ke&p
zw@AE?hnF#G+=lOX0alGbZ;3}GDDq~{UQo9%yzSg8<>?ss8as+O+*oUphHvpP`xE5f
z*@pT0D7ll}^V@u_iGdL3;O=6@rhJ#<akGNN$ob@H?x@`YG27sH0yhAAxVb+LC21D1
z&K07T_J0X^1Rr}v#o)F(SO`{vNiG3b#c=}EwhMzH`)uB++ioq7%?D^<45M$rX`Jie
zv#D^Hdjgmqw8(9gT<CR>4{WdOz_UQ+JAepU5x^UQHzjA@?>y28FNr;E*mcy3$Ea;y
z-CTXvSz3UNATNUnKlxFX-X0RQSD&DrHvMoDeIrz&DymlxY}kMoyKupaA*zkP8LNH=
zhFyIDzbX$@-d=fM<<aWTVt`wHjDFpOimHd{*Pqj`|4P43W1BIymuK}jYGXB5_hV&L
zb&P&}i)#CQ{A!0IgoTZfK>^1zTX|r%^1fMyVV2cC%W9rwwa&5{A7i!6vYKYw6^qI;
z^0t7y1C>WBrx|UP_jAHNOmyxe!d{`j7>P&dmbM$M(tf0zM2m=JB+^%Ij6^oPuf9Ma
z&(N>i353DjM<BHOX>|`ZioT?)evba4j~uGQ$PTlmh1Dhcizf1`*HF7D|5^Qy^oxZ$
z;nt{qFi~zTy8L4=vPAxbe3*pex)FWC;h-_F5}Nl^CdWW8O*~Z4Be5DsBvw}Fl34xd
zj=X^Szg@|?#G4Ia4j#6M-FskPop3X@iLF7Kp||MKhi(_opCT>WynVxl6FL9=oqNfv
z*&ZAiRM>};=ZKZVjXuV4?c4k%A3jSy)v>@JVmtaURh?un?k@``?m}wNqmJI<W@WuW
z8pazaeZkW%SjSHLo0gJuR3#9a7UocF^D#uMwgE026n%YPxREry6K;IV?D2c3!<AtY
ld>O?-C)$*4%k%oe&59GuMbM{sO~gCkX=j!~vG&}={|D;+LdpOD

diff --git a/docs/RefMan/_build/doctrees/BasicTypes.doctree b/docs/RefMan/_build/doctrees/BasicTypes.doctree
index a7ba5840b4c6eb112f5413ccd5b0f38c8b308254..faa49b9be86c82fe3d1c8262696b6337ffb89e27 100644
GIT binary patch
literal 25225
zcmeHQeT*bWb-%m4-M#Jmv<)Z2`b;0T<2}4Pd%K4boX(ds_E{o^wK<>R#QB)*nW@?C
zxt{KEchBu^93!I05tp<A$P*+Iq$m+6i9!fMQ4%F0A0!~<1C)P=B1IyIM3E3g`A|as
zL6F~j)zwwqJKH<s<(y!=((X)GSG{`mzUtMhSG6CU{KXG6_V7=7H14@xuu*ebtsrcP
zc#s}wh0T6f1j*pV!Kt4fJU^IAXCh}k4*OA44AMQQ(R4k(6^USQZIB+J>WSyawXFSg
zESiZI26=OL(w%aruMOthnRGJo5?>gv(t~ezVy|gm-t3`ss)kzoFN+Q8zWDNm0b>Jj
zccfE22mL1l_qKGVo+Io|q*EE5E9rjU3&dch-*8gPNs`EG^b>SJ<C*YUG2uSl^qn|H
zA-+!rPFH?A(CYW}L&Irak3^g5^wa6YS)*42_ozGT9&+z;C)^Y1dl#RMMHDZ(4c`fx
zu1FHG_-IDNc(EC6_L9(FXof+{Bf>cRJx(IW3zB#d*vE^PMEhM%u*kGvQq-atqr3a@
ziGIU9DA}OtcuW<fw_on}d=cAD(6TRyW*A{$OvK|uUuhC91OL+!{}uOcqLTXtkj6a;
z2Hb<+`|x`|eotZ8?gKpB1zFvl2U^oWYbKom7o4@o>A40+uQ+@6>@m=aBw98YX7^*!
zvfE)~_dr!=%?sA-Zr@KljKRL)_<f8d3D-p8il}BO7-%PgrXNyUFF;e`yeq)Bd3zm_
zC~UI}qpH>HNB*YWh@7T~Yqova6?QZ1_QC)FVmoZxjWBWTM3c}26bl+%f=(No7MgXP
z;V@KlLUW@Ri8uz2bJTz+H8%P*`*3XEX$YU$=ST|JX1{o0i)Z_eZ^hnPfFWGmaJt0s
zvl*9PCHBigY^^tMhu&NmU2o32Cs<!*(2Vtm_2#heB_eYCdczN!*A3lCzcjZrzdV2D
zl&yaj7ww0ojN0oS#Py7pVQbE;$W6+%gHTtGE$caZ!+ywKnzuLcv1~tY+uT6Pq=cWW
zhj!Z&ehV_Zy0OZ#xw^S(J%`H0pDj(%nQW<S&?{v)n*UQ^<dap_GM(Az`e$PpI82rY
z$R3F32EI<h?4jspdH|EeTHjei*>pBHU>0?~HP^>)Qg@;?nx)9<u4K}4%#fZR&u#x-
zZMA2HE%I70avs=0_RH>tG0#29Vpf}_Vq4VpB5A1RSsLQdruLX@L_{VWhBOl(!_s-N
z9fXPP!SqFm6C`Z*yJ4Kzy?z9AV3Dn|HA`PfL((#{2KI^ZZN{Aj*PqC_{%3{`lCd~t
zKlG3-zZh@u720_@>I=&#)%BO>m&&FC^&fNmSPU@|=wYkj&^>H<$MxC5%u9Pih9<AC
zjKeEnB$~%$7vd_r;J)9jyQ?={M{B*?EUNhlgW+1uKmSCoXTdOE1&Y=ZZTPw^+ZP*N
zGh~O%YdXHaS+m)RGCdG-!$?i>$?g<1*=9{9o!+#aUQaj?nF$dIC(abxl4hNKIJ2?i
z_gpwI3H6pifid99HoMR@#q1yQQD{cL04Dv+_{w~r!P^Rd{@BA!_^L5k)yH@aR`lEY
zLZkFCz#fc_5-nXmDyy?^G7q0bi`(yC-r^-Y%DlsIcQRL`>%g%Vw!`RVk_5+L-Pw%K
z+BZDM>S4_#qQLGt36_gAOGGpg^?7V?lzp%1CE7QE+v{W97)In|U(8->xz(>(2G=7G
z&;uI++75j`T+bci^oJII&CgGQLBBRSKb4PJQ+x$K^?dQ}xupl^?d8*_YNw5v02X@b
zK`Vc?RD893I-dm4mJRu7`}rDNM{1@-@)khWG$4EW*<IRGTH~^y7X<v5m2@eo&Lt1B
z%0kVn)G)x((QA`cw0jX5)h?tpNU&&+t+?NALw@05*$Dy{SeC-OgQR0If(0z>F+{%$
zlgzDS*FhE7MFPbh8g#*u9utK9F(`(R%R05HOaEWvsG0Ny5cp5W7u2^Ie9?mXRi@-+
ztV^D=X|-#gwcqX~^LEhhHbjJ{t4j}Fv!AytI4bXPe6J;^J$7r)QX!L<xRH@M^GPv3
zUJt_cpk{gTlk5iH5P){sUN}!3n5DEf+Ne?I+{-%x#3Z)%0|D5c{WYuMv>p|0_IoyJ
zZKW))(9vmGAcg(PE*176LooD=^sQktlF}ngNEx3=dEvi?g=vYWn=Nw@wC+hcJ<<FT
z4fCqHUKG(AsBF9mt>3VyA`AfHc74P*F`>zT)!9s?v-vKj7}xeODus%ymPe+xEQEff
z#;k?t>kxpijc-tX!jKznP<#XuAH#ZcZezZVRg%47SuHQdTC^#av-Qjd41%2CHt`Ls
z6x5<G?|(mnBM;bINZ&21ZTILU6-wWj*Hr**ZxZaD(({+MQ%yNizi;nS{hlz$sMT-%
zDdm~5>%}VOdu<AgCT<k=*IYPf&-M{_g*%8abh{sL{GVq=P`4K%%)PMg#bVy#$bo}N
z6KW+LH&P^uaMIKn+p!z={g&;9ek-2~|Ihl@#Qh!!^WE{q@`^!EEtXGj#5JEhsjHZ4
zeEX*$ROc4#jo7}%P8cRKMb6l2qXJcZW`ky{Im{}js3iMARYmMP>VJ!%Yg$0iIu;`Q
zyOg!725q#gedMy+hseO~S{JtKV4`+%YVfqqp?bt6S2yC-)p?SmfT}hTCx5o@HLt^G
z3mfF4*^Z^iD8riU&yn287}@<;rDBUkFF;~iozS|1B$D9QPOq-Y<?Eb#JiUKJ%mz87
zMsEU&z8(}c1q_=j(^-(%3=dDqfh%LPZzI<IVUumPb6*Kg<*rWW9;z)nhl_kXeP%Zl
z{l*7BUP)7pY5Kn1^i$2b!4P70?!`Fs0NMe?Tt&tG#A}Tm)A6mlqT}A02AASt2u`AM
zyG<?WR)=cIuRrB=J>S9JR!LQqH6R6POZ|YcrGO1>edcR-j@QQ6cZ=sOQ-etQ1vMqn
zr*#Y_P&86dp=~C#T%lNzEUbkhESRwVQ97oT=Z!lfY!Gae+MwvWODrmKd6FrhSiHBb
z;WK~VS86<xo=}ghCvPG7HEE%uBGr`DIHWHX!j9vf&e*3$J^^OxetGQOU5)*bAB13N
zBl!aXH-svq=~r{8eqFrmV$s+Tn1DPu{rHZ#1)AZ)y<zVUo3dE2djU-qq+N)++ASw>
z?98>fbn(e|=8?}I5VV|RoevTJW;;JS4jWx%QD`qBi-~9wrN?9(593*ok=}u$vH*;C
zYIDyqGXpFDG&2JznphFwJo<DGlp?|v<C|N`^>}|(j`vr_8ZUyJoloQ~IL_HEgn=$y
zhMgkj>1=>}DG8=4jaDHc!Wtg03}2Fo%iUKC+g$9v<{s;<0IkXKJCYo~oeyr5{0+ta
z&>#!Qk$a_Az6o&fC$oiUwzjn*EN!yg9U~AZ-A~k31hW#<o1@*PdHPe_S>k%^bXfs|
z>rriNF~r_a3Vd5Sjo2b@4h1468q4)OM_`^pE)B_w6iVz~N9->@WS`+S$`OW#EU`Ru
zT8Ar9J3;N!=z{mP<Q^27p!OV>NMyMqmP$$_@xe;CotXTH$ykR-QsiC34W~umg9=*S
z^|IMDg`+Z%j-3sQ#{f71km@BAOvTU@7((hf6r(Vsw*jt5DicJ8jf7JMv23uc2qK#t
zUS&Ed^^XkGa}&Z|z#l>3ce#d(3dY2kPLB37BfoVv$zP2$nZRTlU~iX8w*^eY3(`o$
z#ypk1<rsv1Yvi!eOqHeV<vDB>Gu6yfSyUrmTN@=gEjwSA=J;!4nPZxr{vmI{*!-+H
zJ6(AJFCW%RU$`Lf!@UjBTJS}%hAf~aw!LJYC9R7Qp`naT&S@jN6(dKH<1fgf!y`x5
zQH@{(<jLeqV-#ipR|Bl4Il-s^jN<95&MKnhSQuOluGtP&#kTzf;y(ehL52Zrcvx6u
zwGm*abqHG1el(1`W4&n|+s$tRjQ0xOaB&)qNMOehXc6j+tL%y!(;go`a=#A;wAaFe
zD6Q{@VGWNB357g_)vIX7*vlLifTRMfbG+C>^guzi5#JTq>H%SB9C{5Cyu9qtK70Cd
z_YB$mb}pOJxj;DLC}-~0kqV2%0L1#tu*3v}M=dz^1{!rXH2+hARlU^uZ>lX3fI=Kk
z@7zu(buSflh76_i9rTa~112EbIp&Ur$(URFib0w2FyBu)qamj9c^F28@Wf26W(u!K
zRyz%eaXT><Zdss**veGBZzL7gU8W;8*l~0R4b4{Lo2KzW*L8P1!qdAN;gO=z(Xi9<
zn;|$u+z*H@Qd?p#HsyRu+Af9oezIg5GGl#lEUX`)+J>~>U2PV1U+GRYhm5KiAQ^)b
zSH>DsS=RQG1vfC4&pYCWKnCPuHP_AwJZUIQ>+8G1s|H$+F`ekX({Wo48|&y+=mTSo
zvTQ#sJqH>iFiVGFSFlJVDQfamqCcILXqe2AkB)_FSyHCt)U08qs$@qT$!f~^TwyrL
z&l(ov_sL!1_lBK(h1@GlcdR;OMB39;u@^JWqE_%9LQCa37FO^J6MObt6-)DCd0w26
zdr8^)7>iNEd0`(9J9h%-6*9NcvaTjeHpDtvE;qc0^b4e_)ApRIbgozn(2Yv=oY-jk
z2$NtD-3a?Z>y&DiEYl7POuhUmH-q1WwBx)sIx(vcuRV`ATy1MNEo6JB#^r|eZrzDm
z<mZ|FokxF0yB(U9J4QTsndzqqUxt9tMvss}#RWTAIt7{wqIpdbMAPLRnTM<0bnIG3
z90);xQ7lnQU_d>Zt<mGKmZI0A5DK~$%L{01U9|;;AeNSB-%%_9RBvfneqSae07or-
zI6xK&?6UEp7T)tl(`DIonVK%kruevKSrpV*69EZ~u;-rfXxCDPgG`|9DD0|g9No!w
zjM4mp?E!?yXrVvM<}AQo&_d9)fe%2ioG9X^7wk@{IT~JG4;NY<)<-l3<f*E~Pi85u
zys9{v?wblgQczIqR~6?~#mNF9rAhVkm{fNeN&0YcQqu_mKerMl0x4Dq4Df6c(+*=P
zh!NX!iHidzGJ3IEtF4~mOch%ATf>j!8NlE*6k{R?wID^Fle^5;IufunHcpyg=}Tw~
z+I+d>w-gt#`)SO|@7Y%~HlNw)`MXl%k(RO4BQF)7zBR<uuF@^)U<lPlbFe;DltntT
z>@*5zmO)iM&a98&z9yeA!(QesWuYU4FowU(3DEft@n^R4U*oU|2Xf`X!rw&8|B$?z
zNvD!EBxLoBC96Ue=_H64#y!#8@^afm1f25@{dKRExP!;<#&NXHG(1dnw;vz<M&|%N
zR2)TiGZLhQEs(I<o`ixst*xldq!UrNzNMT`l5@hrmRH6}h67J9FTzNvhAz;=ugNjZ
z(+8jC9%nc0)1byFrbe|+-7h=2m#cQ>@KGY1Hh2dg6>&52dgO2`ybEO-^@|efBlPi-
zP`|+VjDdQk0(IUf@p;1tP*2FJQj(bejj*-3g_(1mdr+}RtGR0WA@Ad!END=OcXWEx
zC0#FYJl%VbHppxtBYHO~302lqfJRl*9v$FRi?+`|P_FM>zmo}y%T=ofdOSBdNJ?(P
z-wt?@retQj*IIl&LW7>|`~rQ9I`+bVetz5mjU+xoj(u##A6Z>Je;(m{Y!;k5mr1}}
zK?G7{&ruacqJ8Jjm*n7c<IqCM!Dkp@h}AyZ40F*F$V+cc@@~N>N0uO*J6FQ!i>2n(
z%9;gKBu16g&Kdbx;P_iSf@;v2Wc~(Mt(MF?o^p{MY|lk>oOvGmOYP*8qWREwS|<OQ
zhCAE&#yF!c4CNok9ZDsYlu3K3GI^8)j)anAavPzX&gv)%O`t_d2&VQIWvH4{nGozl
zBX;2Sno@}e(3jqAFO<MYV+*OAz*7mM*OdT_fl(#Fb6$Q9Sbl$WUVfLWR*U6pE>WHi
z!V<&ea`;Ovm~W*4&vxE2&bSMMIfIrv%ofV}%fVFAX}5yOLU-@bdGZPkQO=VP#d}MP
zf8RI+P!{q%JC8l5)$fAJPwiY^(dtRATFv+e9!6fP+oe;=HuE0G4A?;7upah!Z^&b(
zHs!PCc519PT1+;GJhPn}^fC6FN<)vw9r`U5lY^_P7ub5896q7K*}{8ex%OTt3Ck~y
zLk1-*A7cuTmuA?l&Yc8mwnHyX!WL&!pra6__9si|e7e+lB%>wKsibl)yT1nvUu5*F
zL1%O6N4RRW?4FS4!ShHx&VWQXggS52wN$yZ?odn1=U)>EW;=g54kZf1`_j0>tEAj+
z&DdecUnZc6@mpO!s-Z-5--WV_{_8lTP%`>WrouKdN-wvUQTU)I6|MlV?_^m@zh7!z
zElSyBFA=Jwb<V~=fB^gp51<-!CZ+$xRjZ}+WG1D!0AoQ#*N02$2sO2|-aX0EdKZ0+
zZB1#IuS3fbCtW$rN($~)TJKz4<-9n-CRKjD7_^3)R!dh_!aF6Kl&so?aj2sN_#6{v
z8v&-5CcTSB7CKi(9dKsyvJ!fiO2DdRE)!>oUL`YfasET_`E5L$YS5WDzlEz-i}Ts1
zIoq3~&Kw7(Y%t>>nv+<#xGlt@n|4KqTIAh;&<gM@5pT8=jzhx&Vf=9kQ%UpPD!}WN
z=-}+0oqyj}1>k*1sX}$71JhYaNy=UvheApTKFq|~MhWQU_DX<YLxzaP9)K)eSVHhq
zC2-ZUnyG<Au#zP?xBnP&lJbD6L1$`kldD#%!Sd5m4azq(7L;MQ_`j5<TI~OVh&9{!
z!Z<W55aLh9B}65Si(+40wTXo&P~Xq%(e10I`zabfczhoP!}rNHGK#O;&@H7)I=|V-
z1?l{o+%ZsTAaW}JcX%4X?+1|gi)}30$}&%E^I>c{i)|0ts2Hn_X4ij8cK!QHV%ML8
zT523-I!o$Y?QwbmQVh=E_svF{gqaMGUAtiQmh5|wjG!|H@^4fdw+$uvzCUhf;H!z0
zO?er5%8A9{=I`wwo+Dfp_Qe9(4567({+F2=Uns1|h^HL%s*L!@vP2D?5wA<~A$De`
zSO;E5A0xYMlo5YCZ^0Sye^Zc$YtMkiU@&Er<h<oCVDLMgZlmQG_pj1@4P1RoG6`xc
zq>T$?lq}rhUUDL_9NdrbR=KAm$iY_(vK7us%&1el1vxMaE93x_H$>`SgKlVEpzU-M
zm@MY>dMYk~n~<z$M&b_R?I)%D#%6b(c1-rBM{sK|-SAt_Z*o4QO5}~s>48`t3&UmA
zx8=7_^SW3BtwB2V9==If?<O5xNoTUGBy0xafsXwkrK;P*!$H|i9k8$C5m!{uJ=b;I
z9E_*KN!YB@Qk&k!1CBbSx3|ME!J$84ym@?YdYJCLMz&migYJSFpyUYUnDy#7WXOjz
z0B=^7sJy#6r83pkCDiCHYmnVay^<b^1YMt5_r(q2W4cH!*YWem$@Df{_y<BEuGx=O
zrO9-%B^v!Tbaw=qZgfZ$HRw<SN@j5DbW_lX1|Ld~cmWQE*OAR1QWn(!UVPGCc<TZ#
zKpLcX6<^i`-G@`BBe1@RKx9I-nGDjSVLvHCnPez~^hD`R2}H+(_@_rCT#bWjeOK{C
zsd0LY#t?&0NM!8!eA((@b+IZa-oovw`*1;ddWSp;RBwqMgah4p5aN||3Y%ta3=<Ub
zT6Nsgio-PncPc&N^pmizi_(1_B<gUh-|f|NsRLoT0QZ{UhC58J0CSW}K;0lF_Uocv
zEc&gmj!R)t>lo5ekf~BPTe6filll!0SG2Nx9<Ae^8p=7qKr$?+l{UEZ=^+dzMmC__
z?}OB2)#`2Bh0S-FAE$5V1Xs_}5(OM4Xf3e(AZ~KcA0eW*kxD^w=u8n*po=X0cOAPw
zJ<=0Bebj>nbBIb{2&87Dce+W^i_b1DqBySgHj#i6)WT?Oage^2YBB=Qp?ZQmdYq}`
zyKqHs;l9&v20f2N?Pdu)m1yukrocl}9TM5=xDebENt^qC&M&%2*GFeF$jyKjagM@)
z^aNzGThG-qKdVxg*YVy=kIB27>iKQE16&gylIS0byGXIDKih|1#~{=l{45{qwARZ=
zd!p&$R`4bmFZB&nW)h<Hb!1-L<oodDQ5k6mZbEv(CbEnm1IjSmPNo9El2Sddi(7%w
znIpB4F0j8ofXv|jvldi%6DYVsB<SR|xDMU9UKd@*^Xs^}pKcvzv~SBU--odJZE4eP
zriUa11|OsKga~fX#rWv~X<neu5KT&@gt8=c<eK8*2NtB;fFwjM!3F;iBV02|Hxs9~
z7fR(-`6vdocK$F$Duv7FQ9ezD^7~xpQ7C=qVfyp;IE>QyD*gF5{rMRE`CIz)W%_dm
zRXIj~&e5N@;ZHxEAxLr_!d>+YYlY#gFpL#$zrt--xZO(MJxMjGL-!E(<}Pqo?nh-m
zpP<gTAM!%EANE5!--44SGi%brrbO|O4&&}hRzH$rSwe<G)swU{OJqI#n*m5*w-Nfe
zkaE@6lnV3OGX;n<s#k7wdjURY2-BqV+A^%{&7RbPS!*IC8?uZ4te_7NVj7)(BrAUr
z4C}0eT95CIUl?41s^X$pC_Vl)LJZ-Q9p_fAP<${iW_dd3;m-bki{yEY{=b6NqW=Ss
M*(`Dn`i<KE0#sDHrT_o{

literal 24627
zcmeHPeT-b!Rrh+myWZ!|IEgW}9iH>Kj(2Ch>zW4FaqJ|HRMM_fXWgVY&g`3+JNw@F
z&3lvg-gtKjkqT-cDGw4g6N#!40u@vNrF;khs-P$;MW_n!4;2zpsVG7Mg7^@Wf2vme
z&bjZtd*AGMX4YE=n#PiMX6`%p+;h+UopaAU_rCkFvDc@Tw(!4nPuz07V727bYC%{N
zaVOng3#;v>2$Ifgoufb5d7(3vPDaj39JZsX=%iafQFT4P7Kxy9rIYR^^2GDwQdWN=
z7S+THgS@&s=8n4)S2|PfWIC33i7$*t>5hk;*sI!$Yb`WRWT4u%C|0TY;=>m^EDhM*
znvS;|w4Zd`Tig+MG#$^RTS&M0ULZOP?TV9HPLf1krJaB=^<vbk#U$}W)pz0;h4?-e
zI8FI&d#&BlKPpc3Y9#7J(@rN6XPF*#+&%6=cPF*z9!gKox?xky);uSvx>vo~II7N8
zqqSBN`ZG-@PDC^d)x@(GMg2ogFw5QKUY4R5f**c-v|Vv`NDXTh?NtTozQuOS7qRUG
zHT$Bdh7qJ^{p|1gNNZ;fLe5Gd7u>_73il55-?gFJJMsT+{J$6fr_eX|e(uw>BzKQN
ztO<xUnNC8%&T{0mTw}1Fc1E^rF~o|bST@GOZpWf#*TcweL3Pfu7cAS&wx4+DgMH2M
z+vrIWE{nt!QOQy~P)`I^Kcu=|fT}d8uE5|-+baN>u+1h6QmfjI{5880IaLvtY<tla
zb~S9a!T=0nJFMH4FmdfftI%W=3+i2hMk{L;s$sZ#@=(=D%+*#T;uyHjMT4MJ*=W;j
z!?As*B77b`M{2+}+r<N0JlA%7EB2NHG=F~8Y0`k7%0~HJWxp-T)^>9acJt8icJrWn
zi0x$()!2U6Zg%+|EZ_0V6+f(AHEbvSv#Gi1`RNl!ZT)X{);=dOYOi>J>j{lvYsw_#
zD&5pUsL5l?dfr~OAGGJD?KOPN+b`HQSCE*L{F9Z?u6x3-0mDnHON`B>wI%C$5EuWg
ztBS^CP342$Dc#ZIKaPRC(9c_@ldDbtR161)d2l=V0})-r*D<&~6uq2o_nlz5?JT2g
zBAW^@LAu_u>*Ie?cA{mPipcAJC_~R)13hPQ-~W~M{><=2UJXvp!*G!QvRh&7(R`~s
zW`DO-tP5H%l8$Pc(GZ6=)yHHbB68tyq#1w=Pv^yU5GJ+<*B2#Dkg(fthH+xI+7ZNo
zN4C1XS^7@ulEzFO!&lq5&p2R=`a(YHZx}X6&f=*3;DfgOVm!fDSm$EY7M4+}>F1~C
zx?Kn8A9MUz^l%brVZGzfEv$RS^z31#rN1FZlhZ5b@DAvS9%J$gQ9r-nUU8pw%P+f2
z+Ung((aaAU1Fp^dk1ynQ7W9f$U}!Z_M?hP%eX;6QLk`His^j}>C7XjNGXkM7jLa0D
z98STKZMI~x={4JFwS*Iqn-Gz3;>@ru>DD=hGb=lO%S8Z_P-__%I0GiOIZiIA!Tuia
zg&ydSV~~Do<HmfCF}8i;`Mu|=h*e|qs*mv;tn|13ffng?@P2K0k!XGLswC&wWEwGv
zhT9)3u8Wc#<=zpvJ6R~wbP!kz+hK7tBq4BEan|Bf_BGG3T3A?#D6pHf^5Iz`qKT-@
zeM6w^dsQ#du?fOnA4|e8q9FTx_E_UqKV}TBL>{;YHUL@=eLq~u1LE|1R(?I6pTPkA
z^6=xSV$6~nSB$5gFFrgqcXHaEKYp}y+?WaAq32Fo`J=hwqxs|cB!If?$dB7Eln^>n
zH3i9=z**~n{ONCP(x1*73ef=nv_h9cb&fn>l|jv`)G)x((W{eJv|AB5)h5syB#sxv
zR@|=FfnP*ec7mJ)mZga9fOJGySir&`1Nu$4WUd{%4oKh^i4{j^aFv#fm;m<2U{yjc
z>(r_){eLZ^9;7#*;6K?oP=CZ27Y)>}vL+X?E_vRj)vkTYe%MQ<?V#PPhzP$f&z-zt
zzhGGiR6gSPUQJGW9M+zqLRK%0MyBd4CdK@CH3(ONlI6uua2R||fZL)ybA}o)OKEMi
zTB63el@A2SNvv-N0J#3}m#m6YdsNgp?pZC>m9e}-d#ABL2KyJAG}s3XU}%GVtJjRA
z><AN5HqK<ch+o6Pw8YcRy158e_k^6DX#R+LMO95Nis%VUHeQ3(uUbS12M{Mw8>vf7
z&@y3lDl_S9zKbcxb^RQb5=D~bnW=RPq3^3cYY=@M0QlO*9m<ayxX}*9M<VettT(4t
zr^{F+*{haS^J1(;t71M|&#b~B$O&!@->^yn6@7X3StLh}*<489Evs&~=phx#*qGN<
zU~R7v@0POjx3^KPIWoVuHfeqr3^i)=TX|ANW*mC4iTPfg5~GP5h3#b*!P#?d<XsUC
zA`M+{2b|jHnGxD;g<g=%ta!1Qwm5U(VA6zH$-s>ai87otb;fq=hHbxQyP;pp=feN9
z_O)`q4aIzG<FI_%(5HswrPa9PQzUg6bB%BR1VD9q#$Ju>D;$JjB2(&&tvU#Z^qEzf
zt)?)m9Ho-%A4rw5^Q`|(;;wZ8pfx6u;ol_IE*rYhSbKHRZ38k0yH<qlI+&=PTpK*C
zbE+PB$)(kJX=$2p6cA|@dGhDlUiB(swy;7mn(bIhjWVst@f_h!=E&~DDivESdI1vC
z>V(!6gh=9FI=-|dm#<Uq{`9^fCF|sx8omlN`h(D@2{3G~Ok_!7Gd(;mJFc9~*40?I
zhyAmIjk^bo46=%iJE<+%BvuOh(`PoL$8UV>Q++k5<x78TGwt*ruTBpYHts?{^R(G^
zHKa;++h~NfbgaGi-GKH+N}5TEA3Y=yeYe)s@@=W7MSS*2uj%;?_OZImLRmf;LtWYe
z94jSfXfHEgr*m#L#vWTdZJE|WNEcL<U`}fmOqQsmxWckbZn^QW(O6jbL|7bQt)uKo
z8_J!71vV5m3^g?R1VNT}ROM!6acsv}18QJL>Y6`~>PLqkRceQA;)e;VrUq2rqrX0N
z%ju1B7}(p1Y|vDHM=^xDUGA}e13iA^y8#02{Jtyfdgx*}TdMZ7rSpp}7K0UmiN!-O
zkMEc>U<EG17LMw$*@}g@7tj<ymV|t&U2_u0&O(-p=b!jsp3(d+am!WK_!$EE!N!a9
zVPL)g#=P<#%eu!}Md@CdpF@9UWCpk6sNH?zncB2-%pHFV49y*X$`bZTT<*Elf~H7u
z#k}RZa^2rwlKuU~4fPkv%f_ek8l1muLNXmfTwH`tqQTR<{P_|QgRbmYrFuweM6xn1
zN$xBUOD$|)aafv1qBn!JR>$Y1IzE?oZkTf!YWPD#El@`uZ9e_aV23y{TVQ5uRx84i
zCEK+z5_~eO1hrC_m4I%Fc9Ev(PjSbH={T6O0%q4DYHS_E-j54>n>&u2A#eHw0ta1c
zYAb<KHBX9!u_8f<UFnG9;0Ns!Tt@}Ch<v4#CywhhB&ZWmA4e0sUnTdJPzBUeTq1?#
z6b_@34v6>|N`#Y`=xC6!zL2WOn?`s|i@TGGTi*1%*)++Xv2^ULTigfm2_RG}p(H7~
zuGo-J&!ZTHnZ6BnMOB$BGHE2AZWi;#kQG^EQ^LE0PDcHGGw8Vs;ko|{F!)Wb&7y)c
zF{YC}?aaxqpH1>dLro@d*#_Hva!EFWX?R8^^I~J3%ARs=K|eLlrqN85owv)+ruCVr
zCZEi*75SRkD9Lr%__}n*U)zv7rrGIl^BOG8Pn)yT(=@rC(@R=}Ac(oWRZ*MqMX-$1
zJymRH$)l09-bLnx4q5V9HS$|A4j6J?1*hZilQZTZBOU=oGWn7hg&D)80PAEvI8<Op
zdGaM^3E6Kf0xkzvYzM1d+rEIj4i1U*WLWXAh{&jsIHxrSYSTV5oV#P)zk+S#`@!QW
z!5b+~r4kA31VStlon@6xab?=O<DcB_xq$XixD#FL_FhsWV#7f}?!wY#)MM%8*%Yv(
z0<3Ag*g{r7akY`R71+XoVyGW_y%M~=!=WSf^zCjL*nBI;rVK8SX4u1rZOb^viVc6{
z@XU0>D8QqZ86$xfogK~pfLA|9L#c-UruJmBFoXT+f$Kq0^X@~_qXUg^qJ?~sKMF+W
z@;aI)%R9Ms<MM7J`_Oz+`MZ}Kg=E8IZc<8`F*Y&Hi6uHTghW}gh6au`c+XHqsvAm&
ztT3=oI}F=Zy_%q2!J2h*+^^Xi=-2L|GtnH=?k7DY1&p_gCXS-SUTorbT>2y>?l$sJ
znlsD#=n%3#44SM}9)mmjJ2~A#I*77IUy7-X4QTzTA$rn{rfuYf4SD77fl?s_fstRz
zZEY04G#A!u;|8QDL9ZK_2y~0-Mr-!!;qad1g(3RZ?fEP{XBl#vrM+Y-coo8en(P#$
zC$bXFlePcq5E6D{VO&n2np3Ju21-W$PR_bYt}*_td9hTVxdEwuXwW>KM{Map(jNWL
zQK-s`m^l!&x_${YRagfPpjX#3qg%FI7IV{Lep;N6`!{-T#t1Ap{=#mVz&iq2NM~7>
zlQ|o}P3F5Rp2v{~91o{0F-3H`NQGsnL1a&f)vAva1{S!LupQKns%ptR?P|bD%YWU~
z5EJ33Z%&OyO!D5;)5wvP);Ckb2@6%ZyCOYXaiSW<U}k$~(4J9mK(+3Mk)fSu{b|K_
zb3odmMM8ma#!lvrLg#{XUQ!Ctdig*Wed-VzJH-(vDUkdVb5s)&P>W`5wAibrXtgL6
zhNi{*3@TffZ9(aQxjEYF6LVnInwyv3=Sc|gQOgoeUPS^sTl^vk?=z$7ysSD;Rp(_@
zd|a_CN;oWwfB+-xsb@UeDU_)ilW9E)n~ID?Q;B|5KWlqnAu?U)53@Q0*b8b%h*t0c
z4we%|T=lHo=&Fv2i!0$w&BNM-`hc^cYGIQ3ho|2)oXqx310WO>%=%r!dDn2VWJT9h
z`bPt%(jiWpzfzpkbO!ws3t=K~tO<*Do=sxf>FY``#P(F;;w285Sy(ESmX7l25L%R5
zy<dYfm?2gu<|~i}!Lf8cP-WKEtMs`I%cK>S-auvO=1r*B+=nSHHMdcpRkX9UWNZR+
zsPokU<6|t2sU2QcT)H_b)B(~>YM_U%h6}5HwTM7^@z<#oUi^hF`JG_>!s~7MG#R$C
z7%5BUAidE0VXlD2H)%)@HvVhy;NXQ<`QqNMf&M?_2u-Hr$ubT+wTvaE5)j8VkhzOn
zqPp(kbvOU<igf6&c(ugsJbniOVjR&Vnj6JOyV97zhstcoW`^Q4vyKy1$73*Nr?y_S
z$#gUdSJsvDOW3^0zwVK-)3*Hrk3bkHGtdQE<uuWwPsg}V!);}L4)jxl=^OV-)^{;!
z<34<JsY|=G9gm8*8hI@Wsg<;aGA;0<lIz3Fb$Edv8cbglxUY#cjz}r)7=r5|Nh(pp
zV_gYrYwHGXs&OX>iyE5huQi;jxGP)a7qSwKkeZ~o@b{-9cWFn<p6|IKM9!9;&B3Iu
zT7rEZplA%HS2|v1(*E7spSuzq>#ZVs4tU9>@NvDz8Y-`#5s3A3gT*Rz;}e7Fi`^Is
zDmB^T4G;3}rKK}xkS<3u{`Bc=w5JNgo#NCPktoG%J#(gO%ztNy9%W<xn@kGeY_-kA
z6a9iJ<<oVo=Ymna)2F*y|I>}O-dCUbQ2jRK`Sl@KXKv`TOxhoDw?66O;H*6r(Tl#*
z*rBN>N0nB4KGRtH2e5}ge?M5DLI?hCFulT>>_A`LD7SQ@SldHDBCrwGt^>A-j7I5Y
z6g9dAd~Dm`OnwHp5hf)+Wugr~piB9z2sX5?B}27Q{OW4`z(!l|tI~Y5eissbXZX?j
z7L)de+ie%=1PhV^z3|rip$6Rh&`pSRa&T`8U6>zCuK*{z&{sQ~1ssFv?w)hlQ`A2>
zhXG=DcMbAKhv-HIu}gzVa}E6-G<tC`z0%MHChb4S$Ijs-r`x1=aBUuE9HM6@gICe8
z(|Jw4RB6)*&fM2*sE&rj3dBJN+Jie#=x{WczS!ZL3JGM<&$0(P(tEN)(1Yj7`;46J
z0>-C?=u8HT*O|1-_cVS0rBI@LSad#US_wt9j&wEs8yju9uO9Ou`h7_A$st&0^V};;
z+8>jL<y*{ot{ZPIM0j;_+NK+maug1r(zyGIRN0>o7P8Q(FAt_yxRaggtFO(vqFumM
z20S&$>%%OfP|(|Ywi|o@Iz)#u?EMpyUI%;fVG(<X@s23DP;KjxZuEU;qmB2~W<F4V
z2=x8q5UexweS=B+qwh$DzPMePQF-Uy2pob^qww$;8}31T3^?{s=-h$9^a_QtbA9!;
zSri^vTH-TYf?c5edOoQ2c7>KER-hc0Rk}RWLqqg21Lpgg^g6(l4~xKr-E@nI+LL)%
zmna|Js3?8aosZ-f0MiGCV4cDAB$M`s>8VS6_L%dmocW})Nyh6=PGaGDun-GV+6V0E
zK{vxf1G@!b(Y;`B_X_H`I+$JoTdJe4rZ)@h_b8a)y)ZlfeqCrI3Xli_xx)5DR?>y2
zPY%(~4BS7@q}Ktrd{_iG7T;N;T2fTEbYYh;zp_zb`YJsi&o5&9e|8Ag8N6R&(*E$C
zza-(^eZOA;<h@~iBULq=zXajXoi_$|r_lW`4yIRdmfi2G*&>|#lUA^lgTSM_qPsq6
zx{Wf-oyWIQf_FsLk(p^-hpw-j(`RRmvkZ-Yleuqoj6tTiaqpv%&^?ATrPzj{tr+ty
zUw(m?-ru!*q}(@DM-S3}%0c>f`q=QhE?<JSR6oq)7^!o)#oOc9B0quu?=`mh&CTrW
zReh^9XWxa*biL!9e<Nz#P?O~Q)_9|zud`9U;%#UtR~DyLzdZn+Lu~kcxu7-!G?OYy
zGLKys3j3V4rt{7HPFp{gy$-HVTkDd%i;ee;vke@ekD>8Er>$?#Yw&67Hw$>U@(hL;
z1576(^0DPF7~l^&%}UKN?(C#@{F!{+VF*wwp^ZyN6c%oBE4h*w2lt}C{ld>7aPXIg
z+6w3JC)J^l0uIc=J~)8p4M^>%(1pD-v>j|Rlf`^=n~J;Gjmn|tfyBMH*WY}}ukv+|
z!5O+E>2BQgO1Hw6^DBOLsuFqCZ@N8}uN>j-;#=~|h<Q~if?6jX{|Mhct9MQIETog!
zsTyo>;Rn4^f+IoA7JlrI&6L6WDt_Wx1G@IOjN4}MYgZCh%e2s?r*VfTjdWi<3=_Oi
zCX6SKkEFZk8f2XIDzDQ0K^>IrrZZBlGG1Wgga6=nP?o53V`VyuQ&zVVqq(d?c3ts8
zx-$}V<zm?v*MyJhBDGw{&wq}kx8RaEC<>XucC3iT(y^MTw3pG`Zk*Jj7a&1F2j)>S
zna~Bg)T7Qz>25E;3&v%f6c6bXPzRBCQlEKX2AAe^(nH0EWkGkSl<D<KUqnzciCRrM
z>7KBi6uFEsmri=P>q!@jh70(oyCq*OgQ|U~_@JwDx|jM8Ls2-0*Yf#-&Ryy<PH4P_
z8#%Y)zUuT=`I<?&CRzXon(+YQg>)R-M0Io%8u4mn-0X=LH#+Wky4z_dVObZYTRk9Z
zSFPP_m2=cVv0Q+=FmNjxrdP1p!zIve5YzDMqE;;0wXlqfL_xI|$0=~qqHNY=lvI=Q
zH4oQ%GCuc|akmNWo}(j~loQGt++*oZbSB1WHo3zE)MRAkI_^*AORjgfL`%N~K(g$l
z64<c>c51sx(uz;b&aSMilv-;z{t=YIXnD3KuFZlnp6#T!Qw`!srch3BBpa{Y@inNT
zHFMAL_d+eZqk6Tg87k4u98%3BA;O)KCz3ih<0efXO-$m508D^4&9|qA0jOp<x2^mo
zhO)eW_2qOwOM@Gm1kUn>0dPw?ssYG5a9w%+6Na}}Uh`AVFJkTBn(&YizB6v(Bw+cu
zHq19h&0G1m{8^?2TBgCnRTmdVS24cQtT1Bae9EYO6^901=3CI^+ZNK?Uj|6RDh|V7
zsFnTiBaeX0MUif=z#UjMnB*GTa)n61?RH#=?OZL3rsMf#+{{ilPqTcZBDhAEo2T2Q
zCxGbzMRaNpxK7GA)`)lgdCYG?LqJ7>tJ$F&+#*RA&!+ndrSiIS6oXqm|1nPJ$6ezn
zpP)kdeX8*Y?6Yx}{`?KzSZMq;{rLs@^E&<cEBf;${n<w(d+5*m>CXfB(@rOelbkYe
z6*==-U_J}XV}a{0aNPy2x6pQNqNE1ho!pu`%}u$l%68~gVc8A^jNA@~42^$5JS7iy
zq`OS~aF=%BYC^UYLaHnw8&`BvcV>yC!&UJ>QL_^IIV73%wywgQda}TAQnkvJ_7(W^
zVN{wQZtv!mJ=v04@IY0Z{ssPUC%%4<3^U%uBU$-t7_i1QXzTHj_{Gjem?Q21g@NOG
g`xrM8%Z77@R4Cq&7c-u$8eQw2xf7bV+m+J)0(D*fSpWb4

diff --git a/docs/RefMan/_build/doctrees/Expressions.doctree b/docs/RefMan/_build/doctrees/Expressions.doctree
index 53f579161c67ce4419448ea3d80cad33e84f2cc5..7f983f0ab9a15f90bd410c50cda93d3170ecc200 100644
GIT binary patch
literal 15445
zcmeHO&2J>fb>Ces$>l7UA1jG4z+JgyL0+!N8EQ!xQ8uO$eOS?Yt&w0bk^*@%-P7GO
z)x)0daet5;Ih)uA1KywnIMCRD;KZ;2!_Fla!xtL{oCNs;5(5E(1j)g-oB~J4J-=7g
zUEMt#4u_`fM2HCNY<G3NSFhe@y;oIVp8m#XKYdRAiN&bLUH`CV+O{9qPBajg?7&L8
zjvo)+9o+oN;QnAu%!TGb6eOYL48%F~u(<2lq2mwk4a5R<k6kaSrSP+nW5sUZYj8fz
zXZY;B!5W_v)3F<SPT`Zd{F%dE=tL19q5*Y7uZz3RAq`*t_|<`=2Iw9VGd&aI#{<4B
z<{Fw{J|$*SI_u)1=laf|o-|ESG2=LNn@NoM(R`*{J0jX=EzgW1G~#*MH@oWTlAZMO
zm!@g$g-(n5Bw{u;+w^I`7x^lm=hyfYzb@X~{Da5|qfOrQOyA;896OsYrc8`Bt+3yV
z1FvcYzU>lYO!*weq3QZ@v<d2?&CffnS4@Aiz>8WKVS10=y^u7)kvYuQY=>r#7kT%Y
zUG7FK<u~hv!M+O-GSg?lz7y`d&H)QrEanb-K@o8yVvc4vi~4?S9@Z4sSH$n17TYhr
z{N6}>xu9-=OPh*Ib^a*Hf`1$W;EzGfkK^AH_;&;UZi2adomcsFzJWPk%$SS0UsgJp
zE74NcAeLV+JqWqYUP^qaa;XBXjQWxj^*pfu-sD7)q<2(zN!+Xy$Q93xozV0eO)s$a
zibDD87TaRQzs*f%fly|&40hngoRKWM4#1hQWmMYiko61wb@z7KJw6C>kmxou4h@Ld
zW=7wraJF{1(Z8v|H84+s1K-JkH<(n0p6Oy}320=(|Bz9gOLGR|d2O6xiMhkBcRT8t
z<h?GDuYqacak>?dLwg`D!D`!y*+$!JYOHW;+--9Y|Kf%jw#jXfg4R<7oy&A0X*yb?
z#WIN*`dDpgeKa#Q*B@E&V?p;TK$$uet!86%f9W+iCHIiM+JhFxL8w*#=!cwFA;##P
zPV>73&0mJ*znWR!o1Zv;?p(F3=`2&f#5cn}GpZvMzIu#(j0I}3wdz)`=XxY<RHW#T
zl#E=kk?NKKZI@934l#6?+wBEmZ2EDfI%J?H6Ab{PQe|bh$-q+k`iNVp6FgqX#N<J)
zt7O-IGS05~AMpk^9&j_aT5gri^kLwT3S2VNCHMfCPBqY`lUr%}jTOI*F;cRKF-E$0
z$0r*-5}uB<=hOZcNPh2hCi=~Si9T8~(U)POTWp<e>-fNO!&yHrylkc6W!tDI;3wIq
zQUsaK8z%!ZKpB;_^_#HveEd@&Fe+qk>#VK8PX;C(Qn3+GWU_>ydI|(^8w$QE!4(Bn
zq9HTnk9hh4@-)|bGWQ>x(cB*c4rvS}b6<4H2uH?b^=Z<GOtv+~*q3(uJ%>H#`$25d
zGCz;VM?U1!{(F%8cc(M=pB2n~9VFGVh%D|Qeehh%jaf{jm^mq|YxY?aO}6dWEbt3i
zK(v7<iHs%m@q}e%#r1U@Wi}k8FO!x?rwPC2QF7k=9K895$$66{4^@Ck9+h0-FW?Ff
z*=_bbxRd?CpF};!a$9{Yi_KUrthpH}?iuJwE~pH21Oy!nHUvZ~1p<5PnR{}mBS5l4
z5ez*uXFCQ=dgCKtUpQpdXA9$Dv?1{`B#DqY@`eot?UXq{whFDdptU0N0-yEq;CPY4
z-p)8h$dEoBgYfMF!UG<74l~@AQF-fDt@hh${*nR1^LIRl>I)Hrsu{BLJ(|^iI*uW^
z0oJdjOuWf<Fu!$n3)~zrJ4`Lp;LJ&XB<=qf($0Mag^zzfWB7O~cO1GbhB{O&4(wnc
z=IFl$)wqhu{<YUq->EWtX(#(;=$cIr#Uxer$_o}3cL|j&a;>1qMK9$k{P*PUj>;0h
zOw-Y4i(!DjpAImdwtV3C`D$kh?s4+5Ggte&L_;aqqOx{tAeYl((X_jP3LaI-LbF)z
z5woa!$x>Rm$VXZBe`eFl1yabemx#&LLU2>#5pp5F6$2l>jaj}^_#6|_S9LtyrFeSB
zk0^h1WpvM^IJS@Gapwl{ceV4xsn`q=cPPs)1pF6^k`_<iX)yyCut6T)WWB)acY_cG
zU5o9TUgG3Rc{|m`6)^>vT<g>;#@W{6s6riTj<acrtElhOa=2{r=UX`@)Oc4r&kkW3
zTkh+8ntH3DF|8Hxi3z5mSvpbg5fjTbDJ#tsH6+vQmjIcu9<=GIhd^k*&Ax<y_!<@Q
z*!}DY;cADy?S$IAPwuFvB3btam~lo2_Hvo%d|~)>KS)r6#Ildn!i*88No#23hr&Aw
zs8|%4D#+{FWUevGN1$`5ixD3|MSDmOIy-34>(mpJs5b;WkrL5}Qi&ctVOE;!;-sD<
z<}sP_yi%4!t~?LHTyx#oVYjx~{mhm|e$&KC6?q`%csx5MsEE8;A}ybeSjE18%pI!I
zy}Bh|m)A#hH>EAZ-NyJ@@?2wl?bXi(sGhPH9c;;<pjphHMt#zZ>3pBGWwrCY(<lw?
z-gLgJA!NPv4bYcc%=3yIyFgC5Ld9zMz%lonD8`11V>!0tTMlirP>Da^T*>pL4+2#_
z-5;sx{!kNtnthc&EKIxT)!v*2I?68Of_wKK(trc*gbw8e6!~`H+n&M8p~{?gP*%}@
zSdbgLY0-o>CaBcvv&cdPjkscDXpOgak>kj8gHj3~t9hAfY-NK1dl50=1wI5ejSdf#
zj1)4B$`|@7`B|5_izIpkp1#CGsn0Mjnc$MPNm>uH?U0Wcq8Xx9Pr9JLfufu-O1)K5
z!h#FBik&p<jTUXLu(VTOQIRM(h_Q=1GUzc5XYqO3xMR<yTL!vXbEI7}p!09a_Wt!$
zwnwh!pEZPZHJy^HvELwTNFo$wsP+H_$EGymaY`7A1H|SmU6(tF8x@1{Y-Mzw*=^cp
z(ep4nkZHc}0HxXi$%Fa!uP|C6-2Y18;J|-q4k&+BUJ%Tv`DCH+f;+sf{I4PK<6|K5
zhiqL*V}jEwVqKPWCuEcs_vye!%rRH(aVt%)pdUq_EZ%9cthA$?Ej(g*AGx^Y1!pNe
zp(-P#MIC~ZzLp9*^p_TQ@T8FyEBTqu(I#_N2nVWKt(G~)|7%ofX-V&N`NEmKQ&18|
zE<&*=H~OoZMFrQSK52`M#wVR*{bT&n{0sRx5$%-9je63ZHB1-;f0F)_XHh0u4Uk8A
zTti5YbXf98Z|uSekx7!|l>*TNDG!_u&avR^N@B$_qd-wvx-L4{Q0XRK?DkLwY=-h6
zOjKhp1tENs*+pyagf7wm1+SvsLDtintWj>_W5>~yIgW=%k(`esb!2B~h>2VY(Is8U
z@0?}&T5jS@Xh!fU*VA#X=Iw&uORlC*OE2)Q&z`{2ZfA!*rKG;Kr98&=cBOJmms`rS
z{IP`HF2WW+e5&waTYZqO=(jS-{V!6Wr6Seibt&oNm12S%>wbyNxoE_E;RqNxiSz{2
zk@hiJ6dCFm=YjmG8^n~+*KrUcL>-7KS6Ed9>~$&#X@_!hN6nT_L>9B!`Qm8|M`l>Q
zhLBF?Ye$`os!~}&h*LQ|@_V3Mu6O*De3^b^n^%^FbAnjYB(i3Kz*cDmo);VtRJQA;
zoD71#bYi~_{5fO3q8Rh1dYY4X->ky)XJBc@ppr3OFmUc~7Kh?i1U>5Eq<X%CvCg>u
zey2Qep7Z|XWu$z}hz%C;An|OuVaVhLV7fDtr?;xIm`Q2R_3avC<kcZa3Icw+QtFJ{
z7?FaqWR?LnO>8ugd^eEMxfZ8XFG^Z1Y+zz@$m?Sn9JZYbse@$&-ELr0;R;euYn$oG
zM#7LsmT5VMoM|F$z?}bbNKB}3F3QuW4IBr-%#p?yE1gqdL?(yx!(#ZWAza7%3tEqU
zpL#0-An6tH!w(^YwHkgXsUIQ!+%IQ-cvKzu&&$S=m-1GPm<qw>eYW;FbrO^zXTwhA
zv&_uYW^5nLP-)kHdv?42Mw!&yt|NJ_m(DTAE;8QCQ%ZZ2CxBsgZ8Kyz4~ayHnLR25
z$`TwIEV)?&HrsSU0~If~8@u~3*(i{vXf|=uI6GZ%5V|->01Q!Xkk6fY@PaXa0LZ|k
ze;hL2&JWO_i_@2~$!1cVQIpTfkOKRcAtV!d02*0(fG1DENv$a2G*BbvIhn@4S5~83
z;~!6z;7jrS6E%OLzItMkq3=uH9M8rH7G8f*COx-+gF6&><XQr|AXEoLFv77Q2kQ=-
zwZfoF%la6by*L5`Yj9)Qzf}MSu8dt3Gl_#Ptb$VTKC^fbLDR8j?giLFLGKMLOA`6b
zxC2yen2S0xvj&gf{f!cktLkrhU<hDps+^0Kt!qv*Co`|vlv_E`QXS@p&>XKAg$PSy
zOZz%s%h3tEjG${WYxqt{rE(a7LZn)0SJU;3+&77^(_NK|&f@xB_tk43QboBc*L}yV
z`LS*;4176XR~5$?Y92y2RoFttg_7f$sqfG54cdu6FBYr>M&ic}eXnLdYf<-W#H9!q
zUa;W9)uCm&i6id<!KPpYzC92#udBo(yG+Cv>te3$`0CjD057zz!_IoQhnLH0m<Dj~
z;kA;!CZUJ7D{){oD2~xr3^xtB!u~*9Z3RILt9A+>@17S|=wb|{(>O$A>kiPefWn2_
zYtU+v&L08gs%ptjBsHjv(a3HEVZ;<5y(Ux_^Pxk>$Qz!s?|6f|7es}do_?Jc%g&(-
zUf~2_5@nsH#kB1-lQxE1I50yWyh4xAF}rA)!!;nwp-BzCCKg=3m&6S$MFUEOaOfn7
zTh(W(k&EYR<&O<GuOMu29NF`n5PT+5t#}|7gCs6vnU+`v;`-2+ArzfAVLoC(;mv8t
zps$rb3;~NJnnMIeaj?jfmo2Vj7c0PV9GejraAQn7giW&`v>Ue5gMMHb7g=dt%)kM+
zFimj8wHxY$_JGfb1@gO%yh&Vep;TAwq}yv~#RFqy1MXAd9HZ$G!bRBv?)njlKX2+q
zPJ)v>xD<k3ORy$*@<tI-YKav$_T9+E%?iTRu-%A40w$7DIhz>--w^YdOav292ScDW
zX}3nprBgsSm$E`n7z9^OXtN0tCTuoDei>Km^ea?!nXC$$<F}!Rp4)Zf!7EEQ#6r*M
z<#`HCW}aFohiZ^<h>!6&?nSpZH_;r`di|IOek};wn*;F(^^^plXCrn{i-X0{T^OfV
zed4L7!Ow-TWeuUHmK^;jGxRW4lT>!k32Uwsx8xWw`%NBqJq$L7&<QKDV?MZhNnD3c
zb{pC}b)wZ!*Kr<*C3Od_p>Nv^aBnXl)t`^LCJgP13G6xoqaKp)>a`(viWF<FTO1q4
z76h;C4P2Hi1oU3g!}T7zps4aZ<p&->djbp5A3BgZhO6W%qNF+0&+Xz?5C$`qHPVg3
zJsdJ}uo$*s!hJ}WJ5G#29<k7Cui<n}*K6REE!}98WG|<;^PsF=OS!cNVqRg8=p#T+
zIsQJ~R1}w#dx1SeHIY=iFqXIxQz8s^1w~p0kx;c5UKVPE-AlTeB(9cP)!juj16xbK
z%+RF=Tzf?OEH$d<wayldzOzZuw!_=}UH*0cQ~u-5$FX<Pxkf+Vrk`)o&p*-6&*_I@
zt=73tKYR4U>E}tpa|1t#m?Qi$#L;a_IYOOx>ipe0|7l&Ku1mCaiLx%y)g`LBL{m@r
zV+1Ivng>-opsLG%%)co~;y>$L1r_|4iYz*&qsaO$JxQ`?!%dMzg>FffEVd-#N>Ldl
zH?H8ow6t6@0M$Z1C+nx!UTjhQAPgvPw;6a^zh&2lhZ=S7xe~^?Y*Yz!wS*txBaA6t
zJu-|d{c=uJ;1R7LA%BNkvKGo<P!y;HqT=ieY5Tk2ey0VA+&v$Cb?|vuIW_~~FL2E@
qf?lhEwSz1*U)If16)(HK<s~+mLYuU(f?e1^ozfW8X=#x(YySf)BZA=o

literal 15217
zcmeHO|8E?}b(biS6i<{$$~IAek~?-|hcb0Xi%d{gwj9__TnmcNM!?!B9QAf@ckgCT
zd%KtYLh_udaDND37ZVgs&Oj5SK!76YPyM0oFF^yO4e|#h0SXi?+F$Zhe=1U=e?UKP
zW_M=yNZlPHC#_Kv;N9))yf<&&w|Vc)%scb%cb+{Z|HMi%;C^`6uw6HdTrU}kb8h5h
zeJ@N$-xyu}<I%m*rdW#YgCxpg#~X=L=;3fbaAPkV-5H6C)IIfsq>;lfCZ3b}QK-TB
zJYV38cSf6hNzA8y8hE8w;{4|h2eFqVfJjEv4ZY6pd51K7_2pMbk{Y0UNGuF&jGvD9
z8b8g?h=rWGrZ^k;p*Lz~ZCljrG>!dsmSR>ki!;8P5XFm5U?&M0@q0eB`|8&@HyfCT
zw(Z=Fy$<!s#A0f9>D7p@@D099Bl64Q<~EP|-nQ%8sl)I3+ez$fJMnOkMnS!AC#e^2
zgEh(a7rf4^cDP-dW+P5O`IXyqSsRmG!c^>TY!7&uEuY)te!_BAvOyf}`;ZQ^Ll*6O
z@xJdJu&BdQ?y;BDn4e6Tr#Z=zVVK&74aLxP@w+F*_VahXc`QC7gQvlYhGIpNUm=F`
zN5N&zAi>A+{|Wp*iT_P-kUzz*@ymP*b3R*e5OY7T)XV6{YSAFpUa|v7vddo1La9x;
zZmb{o#t`)auzzNDqDY+2sqT`vMJbRAfe+!?L8~1^&fT(5{<_0<Sov>zn>iqqSsjZV
z_$g;3%f1J2X6;zDE<0qyQh(jOn|DtSA_J1#VAi1p5xdM9S~bo#53dccYH$tAbKofS
z4DdB3m0@7}7+L~ah44ROR2yk7Ks>KaQY^7_*bi<b1DhPvIdUT~4g8$%MC7a96Xyau
z>}GZsZHu{W!eep2%LDwUEj#X#Zy*JIHCNE3LMO7er!`uvk(i;6^^Vp@yHIoel9gYU
zbiW3ax!2HYHbM7SUx(-M57}!2Xki+~TJ?{<FueLQ#)wX)`9VqZ*P!{$!ur1W_~}!p
z>Qzl=h5BWo9S@mRKUU%E_py(OKpnPO-!XcwN76<`iVjK1MF}=i-?5<Washxtj6LS}
z2T`2bVOpz?8R&GP0bteYtO_?9SZ-e*b1Qd(_ZKoTd1Q2z?E2m$yXJTJAMn<D+%i_n
z+f_4t7&xQ?SIl%3J^-dukF@C+E6v}r^1BH}N)|D}NLOx!WTQuxrz7oV+TQ}ne||C(
zeZOR)k5)|d6`1G_+hV(VePG6Lw(hsQ?BvVKu2oaOPq9zu2nwCIrUNrTS+&irtFU%6
z{s|CRHL|xY*45zCfk}td+6X8zSwc`h0Rp%U1z(roih?@PP#E&ZJpB-PYV@AW{d*5+
z?vDY7G=_?~ulQty$F9lh)vPNr+13POU)>uHJoZ8uMyXAyjaiY8yfD-LF-ZQ=$;|zS
zC3D{bN%dky7I%<71is^^EG1HGLkjELL)J!<>v}GW!crEHT*E4vA{Y(v3t?r=5A{0A
zTsX?mm$T7n!moG~!<(OhH$R!3H%0PL2bknh#TEV>uJDlEU@w9@#UK1hGVmO~GelTy
zr!uhScA~gvp(nYZD$o%Sbg<YM5Jd_E_SQ3Z<WNU|WQQ^sdKS)h0+{s1N5H;x$m-9R
z#=~f1;%7(_A#>yn*BG=@<^V+$TJu3`P38q58{&r-Bp!Ra;1nT4`gk9NZ<i1r@F?(@
z<#(*wTh|+n-%<0I3>crk7kE@UNElSjlAZ6+toHM9EXfV9elus{Rdy5e+hW(j&0}VV
zsTCSrIO&h2{r^JR##hkt@$V0~d{D6>cO1Ing%VREjofG?mguWR<*RbCfBE&?cdE=@
z+R45h`*u4(#Yh#jOu^#p9-)%;t98_`=%G4=|DH4jN<gU?@ryhOeZK7c`3E`L$rPF4
zKHwX@IXJ~>BNlG;Gc<B#VMVFz`bdV(V#Rj*ky<F~l3jMWv?CT#<C3+pYORhY^q<9K
z4D(AF^(ry6URuc1c!XTYcjZM6?<R!mv{X)5y*KpQxkqc~tuUcn5oJ3nQs%6k*hh1=
z_awLq=6-^{WEF6h(ia5VdrU*f3czQ}@)b|r>M#r0u0`J5W`igg_M;eeS%>Z0LFO3+
zypikOx;O(Eqhab1<Lu~h6lJI{F6QN|vTo1I;fl$h?ifrc)o%1|0?QQT={-v$sR1#W
zb@BKN#A`;*)ccs}82u@VFJ-+b^!a5#77Pb%x~?Ixc;8@O!IJknmFd{M;ujXAo9t~b
z)&@Miqn?Un*c($AHbX-DN|k66`h98`WvDVDup?!#Q>?_KD-_$IYK{^q!X8^K<GT82
z^knS_w2`$q<|U};jOkGCIW*`<bc*UkQ#b*~P^b=#BUR_oDRa@h7SnnjL;Y+j^J<m*
zMr9s?X&Q~W$*%9RdxhN``%V)p731A0?3h6@UaOF1rXw~`@0U42UAj`g;@3>wLw8d;
zGTv>1UnMU!!LMHWe1xhf`>cok6cj4UdC_sNG-G<-1yeAozof4ddC~7^2<b)N1bxO%
zUR30`C35n}6H)GgXW#Xb6dNg?<GEhwc(i>&rF*k!lIT3>!$4)G`*&)(f1`<?Wzi^n
z+3$l<#k9-5?2Ge2M_Gdmr1$P1yg%Sx>`}Z=tK1$u+B0}KlxYecO66Px+SXoP451AN
zDxrofaZni}u2=<H>#aTHE;5avR3Su^E>nn|VlZGYBPP7Sheb@I!w*U_N*P4$OGA~^
zY{{HN5`7Gwp~OQe%{VTZxRSO>S`UkDj*l6l8KPBBx}bl6qD)%MXK+DpRg|#gf-Yf)
z%ns^hn=6HJ>Mbe_B?mDvkRyYh;BZ!6qzyUtLcSHCt1w5}H3NG8rflzDPh@)(u>G@!
zkgldzaW(FnWDQw@f(z9Ypy1e1#wwf>#?lBYa*>A19l~ohi}Gh>bb;M(yLQ?0FgKFv
zd*}hB+SxEm`0g(;T4|C0rNF^~|Ii#z{;C=VEU5VuOW~Y99z*^Yz$d9)DG;EMz~6PT
zB@47OvPTQ~WMIe4%qaAvs4^&NMcEUJuXR{as8P-qez3YLT;9Nfi<JIP6@~H=4Z%qd
zOJy4R%S$!*rIBrwiu#47(Ux&h)&{CZqfxlS|7%ofX-S_{o13g0Gx(&aA`T-$u_Cwa
z>zYL+hooL<J5461m1Of1ywUPYQRvD7svT%oRBhCg?tKyy2Ek9z*NH-&$2ElXLx&YV
z^yVI14;dm!UMUd$AmxFpaZspE<IG8A_J9(xbXasuq1MlW)E}Uz*N*Mb;a<{UFGn#v
zlHEtEaXn{gfRZm!&zQ)rChIuo@EiA|sc;t$A4jqoN9xFP7-B{TLexkH^6Z05T1!hj
z5SnASW3+RUgLxZ}g}5sYW=LTcI5uQYAdI_tlRd3uy|bhI#O`jbcAqZSl|T7I3A<Z{
zEx-75>BX*kAsx_f7xMaFq(DnWD#h<jQHmKH$Gr-hjcCL&48|C=Nub8tCuB@yo)cUK
za;1KhQqJDQVTKs>9jZtnf{54~ROr!eWO_%<mR?MzxX~NX*NI$9UqeXO^6pXBqN-0$
z6ys#gfS3cyWo#4X<jYi}*nn~z9OFa$lF6zBma|$X3WDf>po*O{<yx@ROV{<Qz;77y
zj$+Io>1m!M@A?z4v|v!h80RdU-J@fQ>w<pj;iP&Bj5Wz;&7huNs}5}P+rNJW=^e9D
zizPhD0#|POF}aDC@2;3sR#glODc$u$x4{_satM-Kf7q>6IwKFp`al^mD}dTIHj7BU
z*O0yW4yUv($vPcuLSlm_7$W42yIzgd!EvH~KXR!w1*zvX%lvdAVKD2-yqtq!n#db4
z=WmaR36;wgd04cCBORDIQucBM^9&eK$l>(382)OC7%2AqE{&&#g?!h=-+lzys+I2}
zN&PWGH{N*CLiuM^6EVfQ4J)MruYHegeqNp7WXQ^}$M`(63uT$uM>AAf^FK~eqZzFE
z{VJ)(niF{<myQ{yK62W^KT0c;XLn(2T{~tt$%v$g*#j!|$s!w>DLGdQmfH4W3pFjj
zpZfbS)FhGyXt!}jxHuPZ5c@a+01SyS!xtWS@RA9C2*|*spN^S-?|W#_Mdx$HWD6-S
zsL2~Lq`>}Vioi;CPvc3uf9eGM)9N8k0(H#nX4CU;R+Y!-`ETW-|4Mpqs=m+ES5Hi`
z@q;OBoI&ruT_xS<{lP6-WMtfcJq@bwVd23s9uF~w%Q|t?rw~5H<}8k^zy|!3_FEOe
zfiKsonw_OlAGSbA_K-O|N}%6}j|UMpM9}*hLXb?pvu*)Z7e=B=yPNRy{a-5qMnQkw
z1496FXR0A#)uxs-a|)wc%(-QVmg;aGXeI?UC99$lrB$777$gD@$51ny4Sc7fNCrlr
ztf*q?dLFUJU62HO)O8tFQgWZ)Loj`HbVCX#<8Iw|LR62)xHRy26FHT~7;7FwcSeQg
zGSJ4gkNe-1&{tXb7Wm3fi;GSM(+Ja+zT&c6w5Y2t;#}gT6w=}D&YHfA151MHhwex$
zyrEKy;x-RoX^N$;7plYMBRo*#hCT8A01xNYFfHJ|i^p32n8g8}E~JsuqBV=&Vz_zG
z6%R+^QYVU1*s@o8dHb}uK-X6woz@{%vHl1x7g3P#2Q7*h>68#qZm5>x+)#_k6RqNc
z4o1uY@*6u%u^fAJ*t->Y`(7}*Jtu114)o)^So02j@CxVjvZUxVFXmmZopmwX#REGI
z!7KELJ-d&Vr8LI%0h-k4U2)M52U*%euo+RZgQFo?+NnQNPkj8oTz%Ps%ZlO_$HBV5
zi@|3i)k#NUCCbt&mU)R~B(99T8AH)~6Xqi>D!hh<0{U|G#Tc+yr8y*E6bFj}c_rdP
zas2@t$Ke(+hbvp+A#8y~vD<RJ0rUgI_{ck(VgYWqgK2^zzS~mgs7HK3TqJMXGEHL6
zhf-Z|v;Lr^6%UM+4L)=(4yhj26f3d?+zk^FziApIUWW5FxVnK}tFR{c?^YR7YKfD!
z_Wi`i{RhI;a{YuB0!$>Qa<MQ7z9p71nFJ=Fj&wk4@@}n;PiJ-LmfFA@m_&kTS*8|B
za$2O@g7GvRBsaFV4-O6*gJH^}uo1=GZP(l1M$cq>Bpx9M!blLU)I+HZhC>%myg~hm
zr#}U@T#P%;*f7*$hPhk}lSUD)%=up0k;Cw`A7F?jtadN~H|3+-=fo8#RKKNdOXoo?
zb>rndu`a2>j;<Heh8Xmgc;rHn&*R3PeuUwzstaK)ef4F8n{p9p_;S*>VNYMqV7>_;
zACk}Nu_d>66bG+39J{;@<g3gI5+nc90`%Q%fV(zy5l|&;%G}?Bl0*)cc8I#L|4ZZ%
zlB`|rx9TB~bzzc2NQ--33T%%!L1f=;d41atS~%NER|F+}XS{Hq?)Qmv$`io!phd`V
zedu-CN+~OaXMxPuFc7pN#qC7!2HS>o)kj>aw5l6_Xa=^9epsMe1h_1S_C;z`zc+i=
zVV}JQKDf_2{OkNr`49N_dyiuKqPIaGe?cGLqK|)~kDt-UZz7oLU8av7eRS#LD&ct&
zADLJp{Bkv-JBo6ICik2C>rMWHrbOM8XqyscQ=)51R85JdnQ<IQ*i=+4gR191RlvW`
z-<KruANJNj1^<O2>oH9h?I|m=Xs1h&Ma4%+maKea;zC*VBsVVL1hO<TQgYQo?xE<X
z*j{c?{U8h|V80y&TAO9phsPRq@1+XHrD9YGbg6<Lo<2@#X?bKESN`UdsKI$TQAVx_
zH%cAUq@XBJ2`pfXFXipu0QY+yBy#(7^3~B7$YIzqd;>0rCb&MP2G+i;(tKVwOI564
RyE9V9Ax2GF^|N;4e*ii&D4qZS

diff --git a/docs/RefMan/_build/doctrees/Modules.doctree b/docs/RefMan/_build/doctrees/Modules.doctree
index 0da8e85af5864ddf2dd84d4c3be2ad7da525e352..49bf0289b1b12bf3373a07308147ad92771ea3af 100644
GIT binary patch
literal 62133
zcmeHweUuzmb*DaOG%aZ)8B5rVWtWVJC0R4FB#iAL!aK&6J=oKhEjgC6ai(j!tEZ~e
z)7|ds)@W?(KnUkxsIz}Svk4&t2p?hbLINb4LlVe_kPui-NZ2e3ha@M-;T#UhX2W`6
zLz0tZfA_x6s_Cxj?ioq8jE>#YUG+ZhyYIgH_3pdx4V&Nj(dX9jzj#Mf_k-&B3Aa?L
z)=FN~j<=L*#nysXZMNUhKJdo&Q|<lnNW)!>YOO}mYsc$QqUZ;eQp2mZA8W^>RJ<8f
zq6t}lIP!|kpjOq@{muT6Km1sGzdsUhZU)VYXT6GtXKJNZ1szinl-P9IJ5ODk7jJGe
z6lmrp@lf4Gzs<J4D;}BEfchKbAqihT-c$*yUOV5KbK{)bY&L?qRuj$BI5q~Qh+rNr
zR@^AULww&{br;09Eu~i7{Frl#XB%Fb%CzF)raMos+WroI%-`l;<8So$#-|TI9C?lC
zus>IEt3}^yHoe1lN#sR`i;bmvvsM`|)~cm|5aROpsM&CXYBM?v=%d3AdF2_mdRXFM
zq7h+e*WS0GH3v+LV65(Z!>#)^zQQTz-~yxUpc6z+EAmQCv*ye<YOT5x)fPOb;Z@uw
zo|e3FQ01PZ3CFqHE&5J5sCdqTyOaY^O@QIJO=qDNHJw`3Lo4<1ig(Vd;1Ny91W(C+
ze^0z&%4zFa;9tPPVS$Cbe=TqgaJP61b>EGG$cA={f>liKo_I*KZJGmZjQNvxTdsc{
zCd=Oka(FrZe+B-(5&s{+MEE!Pw^7&Va8F#g;Nv%AzVLmeG3sSvVcg&A9|EOpLNz8w
zo`UU_py@T-%IsXFRy=FZ!y$ooXU19dy@r>|HJ9q1bJ{uX{QKJ;%jL?>B!4O6!I7KQ
zT=iE;Ba3JBVXVKdBZx=NFH|O@x=RdYOTFP?8J)w|&E*>Lm}lZGSWxpVcOK7%<vIeV
z@q>B4g8!SdZeyNSG||H;iHTtg6I%t}GK^=ZdJtcIZvYH6z`=@c#hGD3ck;{vm;vp{
zDq)6LLvIVc6D@I#P!#8By8_cSp<()Y2?iFX<GbfP#|xU6B_|3N>R7L}hI7!jpg!m@
zmzu~WhQiMra7PDg8%(BEBpxug<jhxEL3JLhd*0(#YmHJ+bsI~$paf1Dl+iM=5ia9<
zPPDWzSF1RM!sKM3U|7Ju6=5_>I_{w`5b~srKmT@(j?v_36*X?NabP-QYWo?xsqS>A
z_{WpXKS~z^j|R~A;`Fx+u_N)YWD7P!7!nh#kh@`W(m={6eOK=&{aNahQM!J@v=ZY-
z8kpXg+Lfrrs|9VI)?{&`WMTKZkv}<k>fWiNx4cSmv&eVp*KucJLXa%PL(k>SswPqN
z$t=d@7yXj&J>!=RTk`!RAG*o{UN7-8Z(qM|-Dz4~yf9l>r4YVYj!c3ik)1g&CCl}K
zmGV3%#!s?*suI->arM^<CBtD(K}wrTng+EL@q5!>txOMc#3o2zfPjFKz-3q|kP3m~
z0!DXmL`9_&<W7JcdFNf?Oos^lRVVV8pMuALeamv-AND*I3WppCYHl&8RM36xEEji$
zPC{UnP)SVd1bBV{A{Y9JQwkc;Cu@x*2MoL7m2#qGYEi<BiYQ4Mj09Cx34nyC?iGp0
zF)J(-Ui;9aCr>|c|H-M-_uAa;?_N}MW3AB_*}$<jKWFnb|K~J&*_ozT#TvKSgltg9
zO!B|kjb+OnVv?U@Ci#k<)`ICN?y*9~;6{@xOARe&mYeC02lf|(4D6*{R;+0|?ph=R
z_$_M1E3h}wjF?6l;QuoSz{dvQA*SDWpz0X|-I3x?YP?%5u4THXVTYR_R|XlmEvWrx
z(=hcWrmsacDW*+@_-b2C8y7NboR!nItL(XCAtf?YA<Njyp$lnkYrQ!`xgV8E>hwar
z)@VwX!k#$&SPT5{0HJRzys<AVLYWV5&@~vY8?mspu#X=-T_Xw1!qo`U$SF5!3oNIk
zCPVVAT7y(pQWFA|wE)OC2y_eqLa^k)S<zsz9!)YukVQVV>Mjf+twm!%$t@Zs(j{Pc
zt2G`)(?eo_1_~zU*QDB5k)?94%vDEIn9`FRr{8pd)zGgZQQPI9jO_!~#G_AmXp{!h
zuvBXdL^`{Mi*7yT35&PLxt~#pFb_1uVS&&v7XD;E*a&}uN(-;RI4VDip8(S6&$k~w
z?3`@W&cW;xej<xBrEY251GYopr~-8rE$FfFG*=k5?vvYtnr((?=8pV(M+BFNcT1aR
zoLwQ~i*TdWy#`)d?xZ;7FL?{>!|)M8V`701v4<->gBMC$kaHY9W<AqWn^*W!Q=2zb
z9==sH{}%egUPQ52y5oXivZnS{!1iWTPE74jVQS%ujBJ;m;5LPsf|}dBGM2>3!(2P4
zCVxP+?p!%H538!|aM?n+;4He4tOJ#r85+7!1HR;NB+2YQGM>7lwg)mZ=uVQ^Q9)+m
z8_>nzH05W=vTf5W0i64T$Vjr}Lp|E?Q$$W<;V0-%uT({@?C|5d2FtP6f~<@jd)q0v
zlbZqD<1CoSN?mlTO)?)P+0?3)CBaOT>1BM*Ii?O*8IFzvkyWapw32cVeySZy$T^Ea
z)6e16LD@$I2skLLdXjukT~eUTO1{*9VDf%PPo9*x#)q~&fjzZ8w^}GQBVm^OhpD!@
zuNvt@<K96od&tkDDUo!^WpJ6LlO<j6w#YHT-Q*U6Eu4-!H=n=xDDx(KIhOOmr10gH
zYM}j8F|d<D{g=SQDm_5c-3IcIl>N&%@&59m`2);i#iEa(C1PO_zjdo{i_F8>fn6*I
z%A!;73%T5RX394?^J>5sqUj`JzPozFJeWj`VKg6pnBC9b`FbTN22I5kXyr$a?^Ws%
zHnmEvqI8!PYZbhLpDUWkO*b7E-Y}=>RZDPr)!<7zOD=FIIUY8npjzWut6GASy9rz#
za^Pqyy3o#Z=!eQeoHeQF5*3U*p|y+6MDizDN|N?0zEHr`6BusT!17@o{pndgD7E*|
z#I%{k9B&isWSr;8vhL(_M?Fs(bZOg(WKM=09KAQde#N{aSB4_^^kXyDF)`Mw`x-0B
z!aceM%fi`&Ec^>CcHong>zD*$U24<|Zgt5fmP5R9Va_RuNhBw>TG<i1zzdpW9oj2<
zi}0xyJ+>AiXTLWwKY<l52o+{z4aVeRtyL-IuvONoumpC6>zH=3{R8j`JJayQwy?(=
z1<jT)7m2d5MGPb5oL3Ft9L~{NKwB<tC=ph%h0I!pF)aV+@*1a+O!4J5GEnS|nqrqJ
z09(`ys|7P8X51iz#s1By7FHJf)F+GmEt+=p+KbJz4$v9Sk);N>)=F&6^=@@#8q|3j
z=2&=tKcls+t}-f5i-8-1x*sJ&?k)FIMPrpG>c_eF?$gtQEn@~@W`a!SV}sZ-7PDMa
z`*=~zRBO<gs$-@a>6yB(o8sk&Md9rC50Eh|WQ>Ctn8s2QVNvtUq&sU|YuaXVuHUr!
zxi)A>&h;zTWUj3?5tKoKWL(IR$kGDj8_6Z;O|~9D@-{;cxaz@{TM;{XGa_mur4e*5
zps^c%L{Qg<`=KtjlRuzqux{}Bgl=$RN_ue@p%6gCy60+v*zAYwRjMjUVnkzzKnpi_
z@NqR9C4-HLdu)LA3}252s*YvzYkG{!q{&tbTqRIO^axDf%&I<<YNtEXQl=#JoRBG&
zMX6;9@Ut97Ly1{3<!RJZGq`3l<(o9jvG5!HjMkPZZ$#y<iGdrLvR85{9jDdN5xYVu
zP47G%-{wBLPeKop!+>h=O_Jl5LAZ&U2>7bkRB~+E$n&v*{`6|&*z@sL%*Vf_=i{fl
zN)GrzPv+PIadL99oP+e}>K>(+WWIB>1oUsjE5MfbJYldR@B<NW<>0)CQJ|m@wXzyc
z;iPu1J|93yQr1qOdX>HsgY+b2y=qM;%kpKu$%qdrs)VNiGf}TaQ80%<JFxD>TH`Ex
zAZ=SN*Ypu5>(dSbf_7>mMvvwxqF@@1sG;el*gJL?&;(ZzxKb`7)Dr$uK|_)DA3QH$
z(Nh^76bom6KMTiK&VhF(SgVEb6P*ywVNS)`!W=@hO9IbgHiWN$LLH?>2D=t3MecaQ
z$+%X{nPJ~1hW)C6hW&GiVXthZ4Bst6rj+p1zYRRo0-k&Nfyd@wKM#=ZLS+b2BTwEZ
z(L3dUU)|~KFT>3!|Iy}8wb_6!RfH4lPGVxR@EI!nsG13`lPsK8km09fXaAX;YJB-$
zv|xfv1;cX+XEb+v{sXFKilyqqjOkTLRWo5p-goO-^S<&l`+?X`YBM`>1!*>BWR9F1
z3g(lnQf%ccXK0RNMFR>S5|--4>P}BcSQATUp`WFrIoSKxeks2}!1HuJ@YqZFg8=DC
zR8B1AvBXkNtkpXeTgfb=@x=rjbNj0zU;}27fNxuC0)E>ma%@_ggb`#1cC0P_)p-NE
zFog&j-a-MZDdb2>OBX2Ue&LX_RBH*xs+8$9sd_0pjaG-^RRyp}J7)CO0f92sQao@I
zppOrxh|3CP++3h>E1Fn8WqRb9|5&PKcN!r33~`Ix7u#o>8JVWNSUy-09$;U?bH>zX
zc>e3)@El*&lo~kVRW_78{^5e49fg67pd`~b<KVv!j)P^}uW8CKi!;kc{wT(vOtaRU
zsS{tNBtuC>^GT^7RyhUKSY_1Sh$)lp^?@hF>T6V}%ALGP(h%#`ZX!&O!tpX(Nuwtl
z!8wY4zmtwhnJ~fBW6dwab(`3<{MWuFiMEvfS=V5<(XRk5v+Mbrv|~dD_KGev-9xs;
zAp&XTkQeC46Yty5R;bs=m0MLlVM!tWFignqpq*iGLu`UVuLg@#rwMAUW<&vB#K=T*
zyk!bs)O@X00&jEC682S5rCz~tEU|@@;IuGh4%Q{YIG8FrXts;~(+g${X2HcTAfQ1*
z+lcrqhlX`hYG-<46o(m2PM8@xGn?J17PAEa4qP$}ECAM9j4Q^E4)B@foW*WFVXcl{
zTylEN3KG-<Rcls0Hf#2nShGj^8LO>>{W<`gKxGWum{U*6CE3wEhX9l#&P^Pz;5E#*
zqq&@%jU3D)v4oGv^OolKaR=qp&!ef=M-lFEObz*x!l3cXgmeevr#t!d;94|jHgrR-
z#oGtbAuV<*T#JU=o>_<ZmD8-w3Es~HBjRjqS6l!N3O))CPMN%Pg7<=(mf^^+E#mpy
zQVwV3<$-Re-kL+mN<uZ|z4$VsQYr{qS->G{+DA%oRASi7qZMHgd#-|qJ66jA5OJIf
z?3!Ri?=Z}Xl@|(<q@do4fsj6&!^wF_0BV~G(bweREhZrfqWj`yg9*dhE~i0(_dJqf
zT$X;n)tY|A6^1227<}*wEu>oMzE+j4PyI5hM*s?`M{H@WOj(*S#QoLlFjB(^vINNQ
zUuXgHG@))Re0@I{v<1kQP<crp(+H4gl>#IwKGZK39^!`*9qN}QI4()wnl6|e-^%#t
zPJ}%O41-ofC-Ei({@;9|B*s~93EKj6I@K^;+w%b4yy#S1_!62<RIJr;E|y#l!Xsf0
z@8qCJ6I&LmN*&aPa*ohOsj|!V6$6(FJI?zesH-|psXKV*J4b<M^5}`PfOxQg(gdi=
z+&-NWwtREqu&|I}B#vY|kSpHfEy%+PZBt0G0e{E2pw^-oRL>~-+el(4Oc*8;C!d4l
ze<`(I2IE`LrdsJvGKz0ezs$G3lW+@N){~<bSNtLxbO#zUoFGeLd=oX5hIm0tjxQ3?
zj)h<7hjwj=@t3Ilc|pcTVyJE30Zk5NQgpF6B-7~4@_0UgqDh|R$^T$%b!QGe$P<Hf
zLq#l4<Vmvrj`%40(!mW@qsk~3N753ZQc2zoL6&ryC7fI2M9Ok*<-LgPml+ln#<`Vx
ztnnEBlc3rk^h32A6ZL&vgPmK?0WRa*ni2i0)E2`20az6AOcKaG_6pyZ*%~YqqSl;{
zPcUxIdL(*HXw+?kHfxEj!P~(49NL`n#+XyC+Y_KG#e75$$AG}JyCc<7cPdsQj{0U1
zw?*ScPb0#lG_ICIX{a!ZL4FV8Q<K^YgS`GOKATL_iD+~|c4Fpat_~-!u+U3UJ(h5s
zP%{?Z)DMPiM*9CydA~rGVWh_;Xqu5a4jrT6gGAtedYT+{JcstMmr&w7oI3gp>?&K)
zV`LJzonh=g@jb9FGgLFj%)SOXp{QnGvoC8!KXFQ}%ZOJsVwS||8a}sA9&2c~0g}U1
zi<KIm=V4`dA}6Rs9Z8^^F2J?iOAz~bNZ(VcEsAtZvLOfBG^M~IeOd?3TuKo1%!Q`}
zbw1b+b*kOwnRV+Ei_F6B2Rh<ufim$aE-E%ZBo~D}B7PgvMN*vHA~Ku#9LE$nVGF7K
zDgh2e;XI|v`z1H^<$)7S8nzG$v^@%U6=pP|Ln36Sa9k7oM?76(?HE3MbHBhE<`?&0
z7bu%eVcRk*uIz*e#dvn6aby7DCFrNx?Y<Zl7bZxU3*R~*vJC|Bz)fUh1RKDZPlbZ@
z=?&K>2Osmxdm$3NRN|hBcNmM|Wf}5nW@B<KtsI4QgE(hcvQlb@z@=q04j*Z6h4om&
zcM(>{!k_I2xt7qH*+Qdf3*s_T%U_k$qAi8=0)TuIv8#^r1f<(h=b(cK)+I$P7q3H&
zI$nq$;*ob>ek;pD8-s>`SQrj;#3f4@ekfn#>}lYgNKe*kM8P>3{3#NyI&QInuu|!0
ziS!;VoI<pVFp)cjWAM@;q#Z6gtr|8S__!Z!<AQU0jRwVHmBFSdEgDiVFpow`G_Yz4
z;wluLz;iSg;JmCkv1-_L>ym(LF}h0x09MpzQtQzY9AJ~cry~6IO9o!1$UjKc>`t3X
zG*DkG8eY<2l1%Gy$JZ;uiaFM>K4Ds8Sii9vSUV7oUYmfm!|M*PniZGDviBrec9tQ#
za~e4Y`8YVf*y)^>ztGTz|3G+v71I|wC{p7&U4x9-nZ4^1)@+e{srnpkkuo1*WtQON
z<rEeIOdTg<6f(tp5lfl#C;>C2U98|}zlsyrR)>iWzbJhfjBOrbjBTVpR+K?DvCHW1
znd@je73z918IR7mXUSe9t|j*-A)gYb{(-CIIw$1uAXUvU_lRL$+0QU->3ltnbQfxa
zE{t@ZS+#UlA~<h};5BYlBY`=^^*n~|)7yibwQylpJ<HjFju$HW>11?P3I)OpNj;p*
zK&}R{hmsbV`mDUlhl;g{RH63jlxk4YR=|;ZPv}E=6WVD!I><aIdRKgR6HikTp|9zO
zq&S>%QjpP}_};Y|m5~N(*d_>`Aho%IB|OJ6Fsab>Qi*itau%))xJ;4{rh4g4oJ!DY
z3@!_POhar4G)pW^B>9-B6qEhP?5RUcqJAgYe1|ixmJX@KN`~`xH!cHk=ZQhih%>Hv
zJ2QEgx0)QobA-sTu-O+rN%}pmYq0b?mXLmDmSpIRaP)v}CwzTExkdg9q-*CayW~8O
zd@)*rFM5If5IOckBpeIKm?7N2mO(}<TrOg4VV?F|a1M*^kUfJhieP7msDb_zLlAK|
z5FN^uE^nd0HYVrW2pa0n1H!IoO6=28WR2W^734~z@F0aaYLe0pS5-LWL{0!C)o#mb
z)B>I0N!_CW^_;@cv1MEXM-n6MQ07jQY0!2oa(p<=MI@tXdUccX@yw6@a27<0>;Y%N
zFr6Qwa+L&4VV^&(S%y3<Zp7va=MUbNs<|?|r@q*(x^9J4Wac<tvFM6pz=BkQZ2g_4
zWfob#IQST@?6}G`6OTK;?*OflQdy$y77}fWzXORQ@m7uynSHzk7sj%@rFg%?tK$A2
zq@49ivy{SVSsA*>XN2C&;<}Lq>vcSRB0!!kGL95i)oK^9K=94E2Jv584A6IN1`$7J
zpTEGo-cJmFpAbGwmk8~Nuj<x|nWT&|K*twSvuCL_E70y&QZ-kmUFwTz7cn?}4Bya0
zfAu<yt~WaQQKFOIV_-7}75*-vU@ZJB7Y#p$KPoF~eDXBKu`Zwe<P<MMgY;PmX%63)
zqJfEAiVETf*0=+;zSq26J$>Q#1iGH1KYiQR$7xdjH)FbwN$Eb}xTFbdo9_N;$3w^}
zJr@-5MVxSJ`$M=zt5rrOg0}xGH0|)W1?Zpdq5t0yMHQd%_X?q~vP=Fp;gV19AIsdK
z=E!MUVbXhogEwI2Xl$5C`fB>q>m1q6fjelL_MmpcIq)f|1W&2NyM1jq=cK;t+$pPT
zPyUpBxEjZ*?<AHQIfXpCfSG%CcKbV4;iW`j<%Q6@053?`^@OsBzLDpn`?Bf5(P7Q2
zSySxj7%20JSseh7ZcVcq-OUCRCQ==;V`IxYVy6oz+e#Hkh6?Eb4tP_@;v`ef>Sk2f
zQnHgo3{ujl%Z@>!Sf4C2_9S=<QU`mD;0bW`nPe!^?#^%Z?1iVra(t+t<;W3959k^^
z_LF4B;`*aSw?T(6Y(-@Wf&|%!#YKnmkOjGx5D_a4N6Obku1JzytvYg6klu36Z3L77
zxmHF_5F85e+$Qewfj5{p-RYPH&fzV2$SLABs1$5f2s65nP#d*rk#?ye*%Mzv2+W-O
zV$REY2896WzI@3Qq}<S_i2u%^YF0KHl4u3dOOj6L`oaui-ZhQ$K#ejTj!Y49hc{+G
zKP9?)s;>c&FXjndgNgV|!WR>lrYJMEhDeB*gK$4YMci~ro&(S&#fDQvHwaKAE5)@-
z$Rmmfb&;@?h}orb#Rirs`L8OTzCOzA8*W5zmQu|>0pi;<h|4mCU9lWErDW|)gKb)7
zhTTrJnmzY)ERo>A<n4(cSZf66d0hLZJK)bS=qyX_$BD`nb@Z~?awTRjjdQIxb$+SG
z9e$E#V=VmDekR4%i5??pKPD!~Y?ypA4UaQzv?IQgvWl~hFBcjP)RjUNdI~&@4x6Mn
zX-8!!s)5Ube&uzl$ZP{fTZOOCc@3_xJb)7Ee`swgidqXY$*wy`tASRF_9dqKI8Vng
ztB>i1s0CSCMziq(V<;dM6rEqzW7Gt~OZKxozugyV4?31bCuSM2jx|sYFtt89Z6=+#
zpF-hMk;j@KO|XW%j!!B?K{c1CqVwFWRdX7p;n&5Q`&vJ1P7A@HU-oeIlyc;297x?#
zQF2BJ1N3(U(BJL{Xq!<~2<~s8HaNLq6hDy0lNGINpfv6xi+f0(&?EmCgoAK~{yupK
z*?a?WkryulG-)x5`94#|s#uIgVJQ|fP^ztEEXHbdmnPB<CYE_A*I9=R!=!3D!`fel
za=Le#V`EsIt0Dz_Qd3pyc!g3L;o-}+u+YDX{`BeyVasc`uE9#{>yt|B!&Ay=m8_L+
zHaGSm(&7p?u^fiR;US!v#4ec2=h!WERqzHix(n30!ODJtl^@Y#?8i2Fn%J8{PcK^A
zo++{(E%YQu+wHXh_jUp9t^I&&GvqfC#IHo{1VjFx(0)!sThfz5Dz`B?0P=!M7Jq~}
zQ&cE<xMI>ahwe#*ldLnBqYSF2$vBrS;#&eo%2#$G?JF~|Oq15QBzQ4@69+qvC@Q*a
z$EOK{+3DRpud8CG7JXQpkB(pul=w}pjZPZd{AqpFl=cvtDHWlwa)-%0hK@fcq9>-2
z^No&T^PMme-MTDKJKzPG6?&tAiGa42_N~~VF<N^mjFt3QY8_geO^6K0hF%fpHCe?B
zL_EXgRDa#)T1C?kgltA%*$G>w`MC4@>@i|P4cJx#SwC%>V`!HKhjx2%3N@X_sTUpK
zGjy9}aKAmtx~;Q1-|3Q3Q%;jUlW&MpFs|rOPP!C1b#VGM*qfkHy3V@jQ6`zYDQZ+S
zn<Hy;xkXR$Fo+Y!fABM&6|pRIZMMojteiZOM<VEj_S=NJh~sA_aqefbK#~?lYyiu)
zIzKDHEf`nOmoKLw8zPJ^uW^Ca-=11g{<?S@5?9kL4YTJl)wUb_nyk4OYjz|a3aaG6
zw(5oNr9QA5501IJBjFeX^D6&93Z^7a+8=LXz~YTjv(%1<@i|U_diG_V<i34BH8U2z
z2Y<3Wz3~ug!?};9X5`jGJi?F29p4T=j{5O19*B+5jnr4X6`$$?vi39ln)VIaZ{ey<
zw=wTE+ucS>z`dJ*6PqsYB*sDWz+81%jAD9*dgDgis1laFD3W_;RB8~zXSCL&4~DN$
zN^{llPiTB&;aBKSueO1$R=%5%@@0V(W9R>|flcamYoIO4ma?=#;)2uA1D6TbX?pWI
ztt?JYPF5e2`Xav5S>Pk|@(I!;UngJE_9?#eOC{+pzkz8|;3fU%Jd??VY_HcITz?it
zm?gljzk#y9skNaMNvqMlVxGYR$KC3<ra5V(TidLrU?*9-Y*#c)+3RfhX4vbyr?qkP
zTJ5~nYq85)jrefG2(Q6)^rzP~$oBca=vB-1`L8DJ^Y{^t+d+gqS>Svr-EtKMfw&Z#
zgB>P5bXIOv=oA{AP?L8j5Q^z?Ig=gF_~$8`5INg(#B!l{v)2N;3debn6JAe=-k^AX
z0cGZ3r<jA$zUDyfRDP0}pqh+cnE1gdpc9i~qY`M>=rVS&rlNkTm|^V`!@91YVcG2c
zztG68LG6Us;Li=9&o}mNATzji_7lH%jx#&29>|gc#P1cazsyIeiG&&dIM4B_7{5g;
z7LSGp;pjj~+|+u~jNh`<es5Zab;!fD6rCs;6|o&_>ZNO-3ZKD#dbJpoa5*Pzu0r8_
zp>Tkl1#{R4GD{EMD9Wz@4oHlR3_2KW`k?J0s#>h!XfWbKs67hlw{&H2f6n8kE)X>a
z8`810z#}R6gu6C2*hGJWF-mycZ%wS_yHlLN@>{^B2bvW1udkYpm_qWYn%!wdc_64S
z)|GdpaBo_Um%UmMMogQA@w{n?VRQ$F@!X}M1v7y7QbDjPj5i0z_%aJBO`C>`WchRc
zFe!Wy8a5>Dx_7j74D-t-CY)Joof>C|-1xojDFmVKgYElr{Ey`KDpyy$85U#!`!#71
z>wO@y5o5x^wKIQY141@qB1RAOr2~E3uqQiI&lIru*UEcItn_8*rZ-I6E+E8QoJ?#(
z2vb@usNM=|$r1iCjeIQpP+vqq;ZVP%Yp~|})uiV73HWQt4eS~{h(ivgvSEdyD?SU9
za?BH5pkl>5nP5MSeTt<*eg`PM=mFX<d6H!-Ie4SN?{$EnxR#mpG|@31T_XoGTy03B
zNhYO8zG*JBdI3UiX7ks@Y<^15O+Pzge@fJ^rnMIx_%&(5)LsmGu0;wtoXNv9AZ3!C
zMr}~6wiz@0KM=$Jd_Tjtb>*)U27VW{6T0$OG{|b3YxS-Wxel^CAzI1Reh%s6kaefA
zPV}}Khh0HIc5Z_Ygwm%SeU%PWpIJJA2Pd2-=^ovR^ORy0m)*EDA+RR#Ri4N0I!+Ic
z5Q`p+BqK-2(Sedss<qWgAAbG4$Tv(%u*yI|`)Z4d;3zo-tnxwubBQf771o@q%{AdU
z#T#tZmyv0nI34t1Ng>$b!Gxo{ikH@eoCD|NN`(U2Gm7jDy+C0pJiV32qWYWElC+do
z+`_}7Qe?Rizf2cAmH#(YyZfXn#g+PF#dUwL$TD5Vz1PVe8PXJp2~b1ZL_bYOJhq`+
zKRzS6^+}IyEMsC#FL7qE>=D4A0DUO%*Qe*@>cL@OraGo6#4Nb9LPv9~{5Jn9DYGmC
z^TX37$eQGRN;WN-1l@X7M7a)n3GM7*)=U((T3xiLD0hsBt5E4uA?qr9HxM67Xa;bx
z2`?Me6q&;t=MgwmRSUrv3b>lbhR0~~$HF6h(SVw_?<VJM<@0FcJ?R=?gQWjytoB*U
z4DK#5xI6n9oUKWGkH&WgYTKH`nSDqVfQXrC)<0pC5a)&pije1X2%hdiC+J~!L{qb6
zgY@Y>)1VN$I?|JlK_!oNFL~@{-KM3DKr7)M4mq!rUy=1rsV6@~7L?_ck)=tNg~>^#
zxbEVy2c5^FT*HD{=NTw-ZI;gSS0ac)S=D;a5B3>d_7ju?p`=juJX+Q&uP0e=IKp-g
zZ}mP!q2NZ)bj0<<YE#3k1+Z|WDuek4sQ{-RR4p`ui+vK+4$<K;-VV`8R>?uAC5KqH
zrei*9#`Y#$id53-uNirjvQez=Tf?DRqJ2%91;_GJ{LWI-h6JjVF0jFk3>-{*kEiN(
zr$VKqQE#lI9qD`COyBVUl~*~^pBa3lkIIo=08-POAijW|bikb95?PAcwhgGNm;okT
zXOM_zPX&mnGHXZVElP3#Uj4Mh5T=EtPd1LQf$(UFlXyx85CW&fVNbE(5jdrFfeYS`
zo`CSZL?DQV>5ER3YIH?cOx-slGc73_kpi@hZxA|W;)KkhoSkP{<#ZBShCVE_rfnJw
zd`w{A*?};yJBfjnmBVZDi6r+4oap(_E@VLetN{JD`vKin{jMVDKaJY9>K8vGwLAOV
z49g_v6s{UwWRV2bP|R%P+(X_UbDV}8IOf+q<jT>C(gkT+qk~!dmv}VY8F~+Dg@qNv
zFj%cPCZat0yU#;$k`AtvGcSXdo!XE)1VL}`M=liBAy@;?C07wVD17;=I9sM=KY28j
zhF&P#gN*KE%ps&1Q5Nc$gwjU}1wE&5uH^LABe5+$%1#%{vciDqHKg=0cRVF1H^&jW
z1gVSIj{11TJLgrT^@+>eyrN4Ub`kpldlHuxdPTmB5CbA@#2PXNEboXiDhW<W3uttD
zV@s%ZcnPZh>(rXC)Po&XZ;s_N*lMBOw9i!ax2e{;)0a{hsDD-%j<0I|3>@()8_LEB
zyeA+Or7^9)$MnnN|JT9CKbAp#rk6OgST^jqG{qufHHH!W%=E%z*|oJ_FP5ImSFd7)
z7%1XZHIt2t6+-227<}xLgRgFD=&NZZd*ppyopbBpm>4k(O3R+ude{L@BS*3n&wWW{
z!csgR#vWzeMKXAOghk3|xMYZbYUWJw{f@fa`w;ogZQkn8p%s}#Gcb7}<5#bud24c4
z)eNw9GBqdNc(!#I#NyfMV<C^GT3eZCQ~%7fx7tWDbDVhG0p8wbd4F=2FS5$GNLU#Q
zTm2x%RvB+1=o<o2CInmFw&nDyGV(?^AE&cq?lQ&Eyt7oui_w*yauyhG;?Z^|pB_|7
z3u}f*Sfv~&-Ssk+(lok1zQNMWC{}qqp%|)g<?vnDcJdTAO4sTV43Q2@QD=N`%p#RS
zDizcG)%Ee!I2qv;o3nIAqJayZkQs7rX_l<z_EYWf{lIbf9{^GmzqDgPM8%*O0WFGQ
zoo2+Lj7?Q*)ujcxf^=H@?4(Jm6okw&ngYU)(MlN$pQS&2#Y=xg*Wjp=+cp4X?MgVa
zlQjRbo#>D)V0*4G36jf0OQxgCExMzX{C5-peOSc!;e0bkR3qsxlJFoI)f~>x!c3zO
zYv09<BKRvTH8ip4*U&=bQ7@FTN25mcgRHnUanO-fe?CcuSeJ8NH6X<wJ5DMBhGdSp
z3Rdk9@g5&{hRt2doQ_n*au!Ti6apjSEC4vCUYYlsj=ShCDMSB<xWUf&GTa!7{4GI|
zpVsu%Pvp!b@oz<%y+qDja|-?`P>oHQI1bD19pkXbEM!3cvH<-{{eW&upF0TpFQ7Ko
zl94`-%VlCo9}O*h6R9)fy`}BY=f)kUtWSKGA)=1p_>PX+z63pMWU_4fI^$whvdO}!
z5hE;{2Fg&VXsd&}BmU2)+1A&S18r1XWvzTkozA8ThCwGjnzs2xEJ!zmIBMKy4L-z?
zeBfS`%~CYV=Ti~4fxhU{Bh)gyh&?NGy*At-NaYm4lPjXNQQCMPHWAd8nk#;T5Wkxu
zV@qF!HKKttcJ+vUW}4$^{Kr&F-6vG}7pQO6Rp&1f3Jt{ZMe8yf$FOxVPfDDxpD_?J
zPPc9AM`Ba7ipJ@Io=L^@8TV0XRpYvD@Nq4RWJy!7VE{@qv=uw$_P;+VLrkT3OiTP_
z2juMNV^hppjDm@;9D~e?REF-i&({6)fpqLROi2%>KIPOyNzHA;y9n)L;hlY9pQ4ZN
z&^1^Od?=v@#@{A4RWn#%{>CnrN>qcYHU|x$7i})5wK*vSS&f9!$L<0&LO~nQ#4PVE
ztB0BsS>9qw7O;{A7`5uOJ<VQ+ga(Mvp&Z2-S=I+|u2fj1+r4<kYbfU-K{+Qi9rUBG
zou;*>NGPH8{4MriI_LRO&i`KZq4T68Ia<r195>bjXi!NFh+=z}L_!^%lqoUms{cIH
zr5RM`EhGHZk-x`|;+O0d8r2c}l3gBme6LdX8nmY*zLCnMuTFkZjagF=i?g2u`DA4*
z=)nu|Xo{A!H5$L0R2=IH9VlBOxTH|v$<vA&R3)d`K+a-lOv3k=69%6M9pvmHS_UZd
zRmA`^Ptp}NPogux33jCFv3xgr*j3$tw1jZ?GFV2{)C#opwGll~rB7_;ft#jz5*AY}
ztgNR|pRA|hlpk*HJIfIO7Y&03{P@!JpN;huG`P18j_qZdPI~T*(vqd=)RQa5REqa$
zDu<?HX&K{6(%SltDV!FMS|xF9MJorir95b?He_f$*I8PR*sPzn!O}X<isdxd34evq
zj|9AZ%>rpWAJsKj<2jeqcz)~=<41~?s!g}pL{i?UHSadqfh59V=y(8Geim}+iP+n~
zRhT$cMYbI0KqB=?D;O85d4reF2)z839%VoB{5(;VLQq1UKVsb7=B$n8i;#yh59n<w
zmxw%LBk*O#T$tK?x<)ay3)a5I4712D0xheQQ%|OFWaQL)NCaqBEjcQg{;=dVImkV+
zbTK61g=ZOo5D`?>Xc8(%t;KEw;U^H<2?&y0mZUS6kgA_fQ6qi<S)SorAg_YsRU$99
z-<z19K%(dxV8PKB(ra+M+eoUe9)oYBXr_M&^w+5tR+d22CrhAfv+-rgij_)&gjYY3
z?+-qbpO7QDAX94L;llQljm51NX{jYVEQ!s4$V+a^_I^DbnkF`YYW4b!=~oA+jM&SP
zm2d94Y9E~DEee+`TjY0%0xR1KOvxmhrwjT7^LM=SxFC$a3)422+POyNunW+##zy#Z
zLhD$#uP^K>AIUQ*Y#48Kb3i_Cs@<b4Dq`@r=I9(U+2p1KouD+o?lA#)m!@-#QzqBL
zK<FwZM4ZB|kr2<G@^B3fGzz*S8|j9O5(GLDcp}d*JAI)}@MYR6hq?5ifF2b_;c|AI
z6Lfm&yi2<vA`OR;EE4hJswp}eLxPAd;DqSFmKj+#B$kY$#I~`7%0ekaix&ZCYnfk^
z?yz$1NUfayrQN-$7FL#a)F(^3JJcDCK_^EOZM^EHI^d!=p8Bp7of|IFHp^S-dr%QO
ztBdSjk-3WDw=p%9gGipkPP`-MjVYOAC^ODeD7%d7<dvLyegdZ_l(~?*dM@;y<m{L!
zjjyw;L*~s%Bhj`EO;JU#7SDpBx?;XKHm@=)!+j?aI7U+RwBM+;=6!W9^huSPL)(Tu
zl+-v3pQfcb7QVi(6-w6OlCHtl;U^Q;;hB387x6$5QO8iyiG|CcVFa=vTU;WTfur2O
znni{U&FA4rKM3rD?KTePR2iXCXbV9v6X^NEa8L#3Ji?URIn3=3COqi*+Uhjxi}*Zw
z*lFVso-%msMVHDxJ)qKe;Ogfb(mQbq4}@_TKxB|JEC{_H2``(F6lhfjMyn%RR&o*?
z;ze(^WUE!t8y|-URCpzYm60$1ZnYS-gvaXJ0u8)X(}1v@{o8f&oDn^Hikl2e+!`Qw
z0ly>FMz(CAyPl|5mJJ_#ArOWcZv4W4x6{0u8=bKuZV|eg+Y$ZD43}s3!+p&z?cVCy
z&9Ct)(mXF->y|rU%m|SzTkF?I@+d}Xdy&rk3;3tTsU^TqSvCXG&ccaA7a~k4euW@?
zB@Q?t4w%|0OHnWuhZOo9yGZI8)O?aDf|IfdX!S(g)9y&=G99w&8fD}ZaqTJEB0?X=
z%?Z!YJq5{O^=O>JRDokUP83jnnaV=vlgwDAoTtdmhE~;usP-MFs83mXr$m-s?0{M2
zp1?7kD#QR^ojRE;hhkm-9d~Y_cQ-lvZ=tln2dK@i|9Gox*$@oM$QrywuB;ytf)KSY
zVnWb-iy7+gu<+|HBzxFD{LLiSF{~=yN4gL+r}3uHF=dpo2|czoUR4;Hn@~ul-L0o;
zWu2FlMyvbXx+*a*oi5K+EHq9Qkp86Q-T2!?h%YOqboHy%$FP9X9*FfQ8UE~VH0|66
zP`hIt*JUHWXVGgTfgf_ktdB>Ftp>uQo3rwHKHjFDa0dN+ye0CQ<Q0qB@h-Z4wi#5S
z2^hHu=B*-i;Lwk;*V?4o-;s|;=Dn(ikl$LPjUOfK-eSjUp^hJ0MK`l(`z(Iu<j+>4
zf?wO4wc_lYTRcl|(cNai)mUoBSCnhDCRn>?y}WOIyq&JS#RZ77=Me|8(8iNd#P<gE
zS=@X}CkG=mIVPTXB1ug&ONpXq;f#SMO|Q4h3i`pehDWZgSw2wMzHdXE^WBR6xjEhi
zA0cps3^lDt71|tcE_rjUd9*hw@9jkiY+5hi$w;$-YglPeNXtJORO_wgETYkClp(nt
zkF=WQ@!Q6u0N<}kzMS<Mjap;Yhj*yrHGpRVwTOKFI}kaTY-KaI(vJ70-lUocbECLK
zU{thgU{JNMNxn!`j(5@+A|T2KiYgdWJKkP#tMe^)-UG%<_`Siaw&R!Js3lIK&z3y8
z!2#U_jOif+c9$_sU?eEbVq1joY#)k8-Bz<UYaYcLC?Dna5-z=*)r1Gc@&lHfFw<!2
zcJLEmw;Iv(n@9D?Yn5uV=NE{ic47+#8NQJn6Zt7+O{Nl@3^*4=fgsTxv!x)SoZuLU
zgmPFd2>(#L4TB-aFsCI#quXV%S>zSN;2vwod*~ab;Pe_4n1C6k)=HT2tqpfk{{)Hd
zqE!XTsm_BCE5Sn0Y|rexF&?dZb#qjK27?PQ>Y#VPPKzVH%5OI7(d6O7cpOdCmvA#~
zb)wdoKimehK}iMxC1;x+9EVtO?RX2GkH6yPR|21-jdC&7JUubZ|A=ZHi`6BPJ?k|l
z0<T%-KCtW$`^|+4IvZ)ab67>lGu*y!OS~5}xiG7jr#@>j8`X(Io{4wzj_dhZA4#7$
z@l!kARH+f^Z;KXi;q>g|Ev)MZh<XYC7C&d%O)5~kx9CHED`NV@dIOdjg{XbDRYw=2
zfUX%dfq%gVo&ojLib1su8c>Yk3St#d=u+i^1tQ)`%@wP06LTfd3=TDvu!NT|yS|4z
zG@glf7g6f$EPTB|Wftk;X<LuM-X-te2C-Jkf~`FhZxbzW^AT!q^s49DxU)IlBG?Po
zGe|SQ1t(Z6%~_Grl?iDVfCQ;E!DT^4@C!sZh7w<qcuF=pKSpb1{evzL2}<;wPpv%G
z=5s4<6c1Ao@n(PcElB0?ujpeR6!-92`uM>{e0-liUa|onJL%(n^zk10_%6NpJNkHT
z6F&Z)KJLc_hv77RREO|!mOk#HpHuYlXVm;R=;I2c@DF#;$3M}>KhVc}=}65l&<CHv
z;S)CRLvV5U9{TuEY|@3d)5kB<#|P=-95ofu$Dh*2pWvevkI<<2U<yVo#+BzW<#{}L
z9!s9bk>@ew8U8%Oo@co840E30%`>cdhBMDF<{7@Xgalij;mR{id4?y?u;g3*KI)wi
z>ThFg`k_GO4TM=n<;Uq8qjC@7lTrBr`o^gIXTmI_^818YM&)yx@r_aWIANAiN#Pj+
zm2{V*KqcKCAy7%_#KmDHI;tg5$=?{26e2HBNr8O=l@t=dsARJ)e42oKls-N}A8)3Q
z3IRDyAMd1(27UY^eSD2Rt|!3%jlRv(x4Y=$7wO|k`go8AGeIA}Kp#u=@ooC}Jbm0p
z1Kdv^zd;{u`gkP`br*fyP6OOSAAd|AbRly%Oar7FSHnl>8(sAm{ylxr?JVIPG-yiX
zAAXBIC{1ZNha=>iW-R<O`bJqN!gmrP=rCdUH}t^=JL2s&`{H%Ay%>lTbi^{n6OvM@
zoLH##6HyLw0PGGIxm7er<f2!m9_rE~i55pxuUzShMEg)U8cou0cBk8tZ`Q>*$WR>F
zA~}bffr>R`#ROX<hi*LlTKW7P#2v1J7I5Fy(VN>3K`ua%g@ge=iNFa($6BP?kCAwK
zG+M&NmJ8~sQTR4P-=~X}^ro2ny(fP4y@*t35La~sk8`fKoXt?*rH*?&xi_KUIa+{}
ztZia8Cz^mdOR*(wb{tNM$5$v9Z<eav`gjwu56GkG{D}uhzfy`ZBoy5pg_PH5G^~jR
j<E<Jm%)PfFGf$;eBIz+t8UVr)q4r1(fwb|~+{FI}9mT(a

literal 61145
zcmeHweUMyNb*D#PqiIPa*;vA6Ec0wWJd$TdwuG?|k;&K~YY@{GmH>H!xBE@^>*;>#
z>2CMy*31Y53xrw(Z~s`_B!sW<O~o;rK(Z7?ARCs2g=CAcY$&K@vm1&kcG*oJWL<=$
zmaxBb?&s_7dGGbiNU~*I*6Zol_v74i&pluF+;jiM=68MlN7wLw;m)8@uGE&M++wj-
zFM2^I+*+&`+6!K-)p@kD?@gTxo$+v_=`IHKcC+Ah!fQ~XP_9&qO|RB@xD$?2@m8f8
zOv(Dgfmdi%>NQ=xyt%xkJp6EHygU+aZdF=U&-y7Go~;+#Rdh^6P-4?*Z;84#KfJZW
zP@tJ-gj*Ue`fYW}*OrIM8^bLUs%*HaTB&)RY<tcPGj6NZtjx7rXq2GeSSbbs>2RUy
z1_55;@69!LLHxC~*lw6Fb8g{m(<@P#b~xN}=jo?Td1ra7yq$V1-xR*+K)Jr)9Vk}Z
zR-t^hav*3H4iuWpjaI!nx!?vZuXz9{2@X8ym1f=A0Xe*>W&o)7p4iZy!yrd640pci
zHp(_C{Ap+Z0%K#pQwf}Q;1!)#-I;IJ+YKi`r%uzWx-GmddZkLOLRb!_9Oq?jq3o0@
zRnJ*)motTWt>so~j@xn;>Osq?*F3b+n5=r|yeeK1wx<}|<K;c!hH0mx5zOB()G0C4
zY<Vvb3UIf23yrcHR012?tqN8#b9=%qqHWV0rhTmZB1}p7X3Rs`!TjEef6v9g=i}cv
za9rMBzMDEkH+#bTB_FjJ>80<h8;@Qr7ADF!m2U@qY(h1rG)DZ6Y6bM<R&#UJdf}{%
z{Rx3=XVzIPdrdEsX)QNA=d^Rw`L)9jXEG({2>(&Si#zX7Gc;HwjVzwW({b|{jw~%y
zj|2^uIK<XQ(+j-jIsCb~R41l!G2B{pYx8Y)9`A<bVgc(YSLVxA{A=ah<~%J{qK5}1
zCWb9cY!i&gaFSi>MR?=!3NX|JODeckXO_v^$@1!Ej<P4Ngc)KDy;W_pk0)AU2o+JB
zr|mjS*QAE&JrWEoN2lzb^Bk|z!YnyKWubvpT5mf0%NEr89cDmNnaEK1odb5~U_}S5
zX1hQue{R{CueK|-d93Mqk6W!bi<O$&T+URAV2za$S|;YfWy+otEHBK}t4=<D<VZem
z7XB@XFq(xNrYH=AoVW2;KCIC(8Xc{o#_cu^OlM4OZ;7Ke#Wl_|*C<{N>>2RF%hO*E
zI!D4`$qZ~ZutiL(Lg|JhM+~Hl$ag0p@;9g_M&!_xsT<-;Hwft%*!8H!D+6tw(j;)3
zWLL-CpnT-WspHcJ?|Px)TtV5TZ%3V}DM6kP1*yxM6->hBQ*om$&y@@1;>EIOSWtOB
z%5!e8fY;0U%sYp!x#l#jBwmDVtVoDgEIlSXlDW>D*Cnm>;*=6QBgRkCdb%3aC%F23
zLThlCE0D(Jl0>JL0{-3fS1-|v46y{#2p|lg25=b``%>hq6>qcyM^sc&KXVMM$6IoV
z3r!IEYfj)X?*u;qtCr=!E9`m7=O-KqYG$!gt)lz-SuXAht%JZSqLP@_De(6^#49uq
zr&wu18LT&#9WdvrSImf(sYMAhDxxImC=ygvr2-@b4X;4_jM-j3f8T=-ojm=(D^5<I
zK5lcezj<2CjkQLfW&_9C{9;7H{HA6vySgb>F~sdQAsf^&Yy8tVW<fHBSmPI&H9jxZ
z3NY=5DJ#SbX*9Z?)POQ(k(uszIDeUbIL};Rb($8#6^q1xyj87k1?(omzG;-f{M+<k
z9$E#LFujGVsva}Eon0JAjdGjCmrVCGSbrlVNBZ&F0=WEGHzeuA@6D(t#jmLl-e{{@
zlR_3vvVz%hl}#2cq(p%#WEpH3bRmslt^39(=%Z56oLOkpn=NVQ?+LqKYeDXh18KnB
z^XY?4ZefQeD&+oibPa~<HY{B&#KVV9*GaOn&@=)va7xYk0?Qw%p^)6F)gf(_G=!jJ
z=?>WiL5(3mxD`G45}GWogCk4_WJ^!4xeG%+>(LmH_yUa*Y0Mj*X^lrw@)j{b0|gWD
zQM8eQh`BH3mZM$x(Ni0C|I!CSL$!)9ZD)ZpllP&fnr`$7kBZVKnwEMD@TK2rxZpOr
zoKoRdIpecx_~wO%*v}CH$NYzrap3<N6%|(eB&wX@DwYoXq5}t<lg;`$m}$bBW09fM
z4~;o*8}J7efNN+$kBF!AY{GC-sLE!DX2!_XcBkMd;cjWIOtR}@auLq1hS$W8mis5{
z@^8EiQrCYqq0!7PFuH~PQ2uN1gOd1iX8qS%@AQOb6~5GjW(`IA7e({`5+4afZBHni
zRQ|7X6>CD@hzWfaDeKlm3VxEG&8r#BDl<o{EzGckYVr$|;{KI0^RS0X4wucB^3I|g
z$U0DlnPs61HOwmxN0hkUm4Mn5#AVPOC9Z>lxcoPwi`7$7IYwG-pJ5*FyrL2qSrvV$
zN9%tYV1O`wpFReXRG-u}SW?{=kyP(E1y^sY0{=9N9<nbN-CBzbKS?(AT6I~l5M?wO
ze{hDW!&N4q<3K1C>nN?{7{r@u#}Z@CVx?8i;HUkvk17zbU)bX$+b&#Dpv?Nc(tu#P
z|5#6+l&QwkwIhN(wLZ65C^aKtM*JVqRstI$2RZl2vb9@B?19ECm^k_QGPJ3P5bYXA
zjdbeUg6ODo$I=}KnIqwkLzyyI6aILC8r~pP^xEOk|Br;xr{EMbD-Gm9DcyVc?|5lq
zejhVdvD5=-e^^e$W!)Ow81ryWVDrd<66oa1`AlYsS@G@8yc+POXgZ3RAFmxTuZ$wb
zD8e6q6}yJLrAD<<sI(L>p!FU&Wv|)@u+3C#7o>ZuP_N=A-f7Crv>X@SE2rhvif~cY
z;rlvE?rA7A9=3;|GUHvlR)hn(1zb)zaEujPXx$m~LuDbvT2yqI3I?9g#>E~U`F|`q
zsy%^E6>#+g`a>I7D*U30O~l(TO0j(?GHqrthuZ}cndEu0tTy@HQSYOMnpTpfVoH)G
zM*58&uV61>-jORq5q$S+GuCH`vED!*14+Q$x&}+YTtou?cP(t-LzL^7#9%{e&kJsC
z*(R0=Ub!&Sl$<1z6PusxI9=ccO%e|6mApmxKnot*1A#N{P0deX#S21(d02;$xL9vj
ziy3TVwW}<5UE%7b4dn7Z_;8&Wcuw2cbqy-5wlD*Uvax9kGvu6CtH7C?p|yavT-xj*
ztYTA_bqixKe*Nkir;%;p)iyG$%I9l}?GgK1)eNfzvqj9fK?sYx185<Qu&16_*l*Po
zqgPyL-t~dW@QXO%@1mw!f9<*Sc2%sQJWJ>q^G_s?(YC8fsB&Bk_X_DC4<!JcLI*K}
zF!(1^_|R&s6*V#IZTFrN^V3QgE?MA~Bcp-&d8B)OPOPL_IfCq+@$x=0a)lIe5O>mC
zZXwEOp4o7JooZd%)T@P;-J27JoMMIz8lp4&f_0f;t4)MNkf@jxk|MC=y!=IS1o|aj
z(vw7uk@Ppbvh7yI-rB5)ndp-FD;Ln%^*<qK>SOdVko5nsuEEm(^%3cRY+CwX7a{T?
zMBQ`sir93AbXCeI$y&rhh%g5?v;Pq_93^Fq>3V1t?HSG;uBtkg%^&D7_Q;EE7Pv}e
zjOY=VzL|VKk9N{X4eBo<HSFztB{hJRUdRmn#Yv4fpr)F)b(0$Zm5?;%e<yj2HdlHR
zs(ecf*GP@Mk}K(msJ<@Lgi@Ne8TCI%04oLOFrXSNlWe$aHJn4Cf4ybH#*I7+L-<Ib
zG<z1_j#>Dp?pb*Ain0M7%##`RBAh&Oq?CbtSkbXbKavT~5em?u5hDP5-1CIdiC_yv
zn3XC^A})XeG1S^=I{A~@E&5~tB}z{_6A+w&o($5X^z_1Yp(ks<>@7w>NMR(beau9o
z9t4#+1hRoSFV>r9*>`B$W0_VN(Whnd_#;rJE@I$lo&pMB;V2fGUW#pFlb<HIhG3CW
z389SebP5^@v=87(0gIkWf1g+`x6wyxv8N3DcSYE!h45qj5YC}Rh5EuAqMM5X&tf)&
zy-%TpQs;tgij^XFBjK=Jujb6K?-s+pYgNO3cVyVfHplSGM3|BikNUfT=eU697(NEz
zTJHfM_i+`=>-j;6)M*D?>RxBO1P7t~k2Y&+ttND&0^C>k66=zM&rsoq6#ltRv~aiL
z3lAeZ=g(wR<Gr6~!GvxKHs|EeXrA`u2UO1wOVHB^laqqunF)(>yt~(%<CSLEgTo$9
zo5hh6M>8)YY2@Tk*qmgLV(X=sjX91LcPG3*SfH1yJ3S$OO)QuyeGJUEKD7P|_>BUd
z3kfvRWs-grfSl(l)&d@jEa1ory;rf2*fJVROt$Yx04W988Ze_|dw9Lc_8q6l5ovAZ
z1&|ZiSGKrT|83^{G$L7e%L5E1pCO4XU6!Esg$ZZ5-WHBfDZlGd%~DnutqH}U@?ea1
zOy=FI1j^Vx;i{VeeSCx{%Odfz347U`r*SKq7@9Uc^2|S;F!M4lkb7WjYcr$Jv=Yh}
ziBJIN8j3TfK11>E28H72nx@b69<H&W_)!n%1)ZpIZv@qtzIo)|9CYM88=~EFZ<b%2
zb^90~SLRiF&eRESP#nLg;^ri`7wee9S*$W@x5AW(_tL=gVf8gC6yJW{A8A&t)NUjo
zj{@IfTtA~Ho0W4EKYlMADl!3iU9UAq^nXFCY0UpQeOQYsenSf<Wc+{BHQ3Gbdl5I!
z=V%Xw4z(3r=&cjB{UE|q<&YQXfDrGb(B`Dq%#_+SK43^e@-Q>VilDt(@H=cvLQ4h{
zQ}Ouqb}OK8D`HimxhdMjgzsp+UN3@sxo8PHov6~N;_#B#)QRv?7$*B05@8(56zn$}
zIKT6h8G~77;Zq1`(9pI`QL3}f747Pt7{ymcqZ4Mv&MfA7w3uKpaLfhu%q)J$Vp1W#
z^nuDO;y5PrDQiunaiQszDhN*xPpwq>+N{)rgsd_Dj^q*Aj+}psDwATc#+~*$x%~RN
z(-8h~r*k_;3wTZQ*TGCiVm<>CM=aMn<w->I{iuU->g&O-pARC~;*c8X6@@`#m5Jt_
z1eB)G2o0JIwU8_DMXS*WE!HZ+BaJ8F%r%HSIL*qL;PXr-BFe>fqE)~x!874|DUp9o
z@L6!q5}fSyMZBL|&fr)$A2Y_$%0_z*0V5GblXt>PhzY48WMlz{j%kl4!aa#OGe1^@
zL9Dn2e(hK-3qZu-C$MIM5xv8>Cbpf=OOk@JDh5K@Z3c(L!R@JSDnx%qk2*04QQ+Fw
zt{O}jHg+`)3cTml#I-EN!qV2aS<|n$!muO=gAZPzxr7y}G<WKa**bzgNC9GNDVd%$
zI|v7>*JpfY`Ns*1FQcYf<(EWQTp+ZM`L9dHn=LH<6jhc43XQM`)+j8ZqC$ORK_R{<
zF`>R$LgI?_t*L=Y?_vT9QwRrxRzn@(CWO=9ajB%kS#KH6dpfsi7_99x03Tj-sxG_$
zEhi|{8#pma&H~{}FvnjqP>_iQi?yVVt3&BV5TR7XW&4U*OGO+fVG%x6o2RrDyaSz~
z5HER*!&yM&RfP`AtIFIyou9RQY2p~IkXIynWIK={-Xm?uzA9}dND%=~#koqoP0^m7
zQQ)_ebWoTu3?+=d2g!ek7R#D>)ME*RqIeYb#yskW5jW0NJtcZcg-@eF_n|Da{^O*>
zcTw|_N{6o!!H@Z0Nv2p^I{X!?d`S?mkq&Ajc9o`tG8I;^BqW1KXHh&EK+%NGvg0oj
z5S&7G7^EB8Vc8+iVhwg&Mp2axGO!v|hP61<6$wv@@@WXIsN*Z*pdv?5oP#RsA&pW|
zCUY?ks;<`>kN!UhTK#+auy}N`gX#%ggB?_V2e?e2{Oqg<jFJf+gk1x$D2|w<jeSTI
z{wuR>m(K_7IU$Q+w4C)w%$jhd!>eu95>Kmd1M741<|vvhb$dqybfs{Q=;0U;n080e
zQj#YHhv>OS7H3;EHuU5npjBh27dAtCam?@u^r5CQjjDX>OZogRO(G(@1+j_wl6fke
ztQvcoqIxX;1fh1!-=B;Zn`!<ORc_-d){fRu36N%*jzb4g_$Ur|ot_d$9dMz&<Ykmt
zf@4OX7+qs4dSpD^hZBaCf>oKJnwe!*wW^bSYR)yQvR3c;Q)&$coT3F0L*jf2pJ*o!
zGqlzU(xKD})jFSuVI_AeBWObf^-~rT;9C0r#m*WM))ecDBJGfD$bptj37$w#)?q7G
z5(GVS{)2)hPtr$f<|w08X0I8FEG-MaAL)yy1<EeR_=Y1%Y*t8)2|Gi4H>8U+FquW<
z?J9E=QQ-J(q^qk|aHI(55LH$y*@`@}fk}hQKTjK$a5-T{13G3w_6J85!3V_CCDxAN
zxpxc-tYLKF;B|qrf8K>{i^pEy4-typ?CQpm0fd*}e8Lh`1_brb9QW>3qS*8suDXeM
zJYXX>ZVUAMpd)=w8iLTvB1~1h&j<|PijhdO8>8zcIo|2H;#6MIN-QCQg?i{2KFxH6
z^;rFP6E%+czmbemODxT9r7=7z2+1h(<u%DAa{PCbI3$>e4RxIJkY5L#{SG2Tm(`NE
zd>v|p@lyL}0=AN+osB_5HZ1N|bu=VS+<h!t=Zs+Bj!3!HZUz;k9kk9<I&PtfuubVA
z3G}Wh+&SdypURxV0deWd(XJAmDh%5Ld?b!GR>7OSW|N|xN?^pxV8lpHz+4z<zQBwr
zTq>VGkN0S<f-|KC3d4}wR|H&(sa+ueu%bRsi_sFqmS_M=1U?nv4=o#bnIgZOK#_|1
zQxDAipV4P(Oq*ffpA#X(%xVbFo7Nb@?+gxMA0pA~5D@nHxetV9b;U8|JyE6{XM*mU
zL5@5=9*sZjv_-u?XlVVP(#*mVp$}_<lg-ed=o(~(&h8zG*r5gTc<OVd1<KrqRak^8
zmJ>M$Fm;rQQLhxEMTBC;qZGlEHn57L?keV5+Ylzw`m*$8Ft%w6V{8L`q{f)iO`lEE
zsZf{3>^nH?o+X=)IF#Hige;1jf(Nd8HAqO@)l@aZ+%1Or416S*%eMTzmBzP=>sWT-
z?3(4T60%uK$gXp%dg#m*Zb=w-3Q20=!mM?cq^mlDr>Lf%;aJV*2{R<uaJB&%3&j3L
zw@}n4##I(itVkrdwAZ9mbfWq`4widD<H?$UNfVxk9D1U6#bY<|G({15Gy$PX5WGkb
z&z|u3dX2^K`*my+WKNLU9KaHaV=?$sNP4D3HFGoz!v<U?#FK;KttYs!8%{%vae`+m
z%Bf7HknBBXKz(BV^ly@p_c`-vX@pvE#5h)WBO$#zPb_d&xHhwPp6nHV)uiXQX_ChL
zplhy@<y%A7VEJ|^BHzv|%WxIpm;qysc;tktii{6P9?p4S$=H`XFj$74c!B)}8TK1Q
z90AA?AzZYUQAMj+E?8_Oo-ViHxE0;Wd|kp>Bx;~PwfIHs3xtDmbIVH(u${;mCMr#p
zcb~8;z!UqW6wM;{K?RZ0C_Km+j!LA&xHT27IF%6qNhR8{{Itj>c)D`=L)oT4ZfxDw
z!F|Mt`;@sCWty}timVn+YZ2*JT3*8>FFf-rznle;#CesoU|7vBQMpEfrU1(~X_nEG
zxH2Jv|Lv%mpk+~JU+#geq-Q6r9W%3GV$np%u?&^a8oJlC%;M?&gF=3N-xaMHcG&;-
zJ}?@I6eq^+A~B|TIZ!teZsVwo+#_u`AA0g`;`g0i4Oht^QL0zWQG%kLGIS@*2>p`7
zMHdU!&*99m3bII%siQckR;P&Ffk)0YiPzdJpZ?ZH4e@UF#|wPxeLep_5NUB<&^_S|
zEA?WgCZ-I~@fDskOI=Bz&abDOW7+N=M4JsVR5SO3)zc$MM+v_|l<@D9hvNSU;d;#f
z0vGkah!2&)Gdy{kB0+oSH#&(ugO~m!A)DcsQnNgj>6+*8fpzXct=n~PS5KP%e+9aJ
z!sv?EtCSUdl&0cuk}E`~V&!SZWj|Q6bel{k+=3j(bCm-A5a+x)<t?~!sa?X^`%d{W
zSQ-8w34lMFqW{l`qKbc%ZxW0>*)@JxxW>D8YGs~FbKJ69>CyXet8c)}%(I4>kZ-_8
zf^e}-_?OV+?B+U_3I7LDeVtaRVF%jU%}7nvxmQ-#9`$MaI57?q-%AWKaPnDp#WFAK
z?|yfz!po7u%2%Mh@lQ$E^)#}WeSX3mrf^4C^J-QSyCYVW*Tbv{07!RkS&i;y(+3l&
zj-RoaWF0=!1(a2!3Pb~NbbthW9%L($5oUEWDy$&cNhGo-YL3N6_D}>(oB?_g90kd3
zy=LV+IJmGvb%4+A{=e$k^G}II_)7Xn?JlH)Xjxr@$9|FwP+X|9=r-xdf~|HeLueph
zuDAhD9!Vev5MoND$w#Nh$W2Ics@*_t2GT;#xy=gY=&hHK`vONOJhz2=V&JLe?QJ^L
zfD>xV9&%^6O)7;gatJQEvre0%-Qw#?L$W8lf)JQFpBHoP;Uj_ZmX%06MO@cSuHffH
z+fnMEEAL`R_}UqqnQ4~juwWPY_W8vO;|-##*VD&9q`RzZFzKF&_)fy&G-Yho5DCGu
zAMS#nfGZHm(g!tCOf^M9gX~l~O<d%IOqYo47AZA}gk36EXku}azp3i!3yI9G-A43g
zDaQO2sD8T!u_x2jb-lnTHELHk*rsJ>(~qLnq#38w$kaQgY)|;WdJkLA-ugG)2Wy5I
z$Jt>2jA&cYM4C;H>oI5DnAVz6{~z_Z{ZG-%j`_crJQcRq^Dx2qxR@3bIPl$WD4ZFi
z|M2aFHJk-}j?iJCkmPI7MBx2%*o4H%Gb%&z16&rgitDk!L|e$#0#;gsAJ4f5mmTgy
ziSGZ<+H?@K7i7v;caA8ZR)+TTb@#DE#}aD~>xQTWSz1Ph@nT{q!1onRU)5vOWWmex
z3kfulLW{EK#1KDgQLD;krB+41O`T(}ps=#8h+R#PCM-h6`bw3jQp-fD=-e&q)tpAD
z|823-zC|CY<%1G<l|h-pjnm4>u5lo>M@7joB@EF2O91_Y1X3VF(c~1JtrE1~=Q@^A
z^fPG`S@Et0HsjQ>c!uNzDY?dK_y%W*ACPm9Ew?J(@$^N2CMaesPb5%N3dUklSQlei
zRnn*)#$q*kttQewrjz+muC6{?cv0nZmi4<B^>gnG$D^>qRzn){s4l8jZ$c@JaR0`w
zEa0C>AF0_6Syb2S8myMSKB|_!YFZhilA+Rl*T(Kc;#T3zmBY|DoWN;9>`S?Pn%h!H
z1#eKJyF{%UtlTEB@;p68q1UE!$i0Esn?g?-4Q<afS%nsQqN82uX9MnG0qzU&k)SZ!
zZ1_zC=OM0RvEgq+(>V>zNKXkV)y9+npbIY9?*V2?(VpboiZ$DOIhDF58D=I!c|T8+
zsV!T?UlGhG&)2bT&zFH^hBU-w!GZZNaUkMOMLSpR_%t~%6Mbm{Eu>(g7JXR!j*cX+
zDutO^5&g8Y`P2GpBkkoiQz`;V<?fGp4Sjx2L@~@Ddl?-~=G#aDx}R5`62K2+Lg+05
zCIU(daZ6%{#u!ag7%S<uv<NL0YHbN&hdv&9MVvRq6*Ca=40{PPtYUx&E;f&^?}sDP
zXxRVv_>p0=3piHb56zh77{;YRVcZd&E=|*6*AIQ5GBg@zKEE@{oUQXLKNNYPda^&t
zDbeTA4FL)!6-;ELGmw+pcK-}kCg_naIWBmVG38|xiz%ATkQLc$pVI*vL|Ws2cnHsm
z_z}8HS>?x7jvC1i5okiYV#4LaF)K%KHs(m4WGRf(3M|&zd`^OET><}}uBIUy(hIMy
zae>zVbvJLhCfttH%5+meZV6LuJFstxn|rZRN5U<Y8u^~Bdj1Ef5A2GAJMQjFI0nJI
zwm;lwZI6eW7@Tlp&?<JqVLT@ZJkP%Lk*vWFQfFiS`}(wD7Y(<dHk|QjYL;1j&<RKQ
z6}itl{wGmC9L5W=UAd9^3b)~@F1PAj<e$mU-+3EXZMn^Puhm&;j0D_!2sp7x@-AW*
zgnj0qJ<)*O^OBASaidBcrcn_0&Z=Y>hP!CJNbjB`l+wJ^{|1e3%>OzMD^{nq)y4M`
zD*jBM!Z`K5VIYz^+d620vZXjJk2u~8^t&E`IYYm^Tq}VyM~>7UmU<xmrn9kk(vRm!
zLwvdXkv2K;H~*+)+0{2NO#r-n|69WBr%(_riZF!F?z>fGG*c@=D~ML3d&NA1-%Yx;
zNlkOo<hC|LO~HP0wP)|Ldt;Ez*cj`3_l!1r?$Zuvy#iPGRU_UX8sU}q3tE7dsu;Tl
z%Vcf;KV5^Z?ca}D+u>_Ck_OT0WKZ)oXT9nQ0$nLu20KE0M61-U(wQwf&m}YY6N+&#
z!ph5LeC(7phaBb^Vzf}G*#`l=gkvzsk*=piZ!J8zfHHHiQ_R5*`ba$o%F+61VuETi
z(y;FR(@3C)NwHB0v}<%3`&LuYAXUt;95Jk$@iBl8;4?IyF|K3z0RGZ|_he)01~P+D
zXPmgabCj8QZC@PkCoZoz{8c_mO&ZMZClcr)1-rLs#p2BH2OL~giZZo|G`qKKu`kWY
zkPCSLm7)YCdm?6IO}#YqYw!S!(@%?)A})D^Rh7>#<@5W<^q<2Pj#+T<Em4*M@I7K@
zWU|2|(}z(fsA{2(<Fkm}p!O(G-qMD_^EpeIx`@)4WJosF24|$e5boM+nokWj7^7x~
zgVw}aekrj5i>+B+2-xaClcN5in(2rsWHy09ls|!bU~PD37sgF{Vb4#AkYTbkWJ{(c
zhAclQWaqBTyc@8?D+R%t@Ei<^=N@~goB9l&i1W#OH7ZmQn6*V(X^(bvwD7a0rktF$
z5{*McZpz+#p)+1~V87mqe@M!%@=t}EVGmYdjYh3ny<0;T-#ajJgv5Q_281lYNQ4~f
zONaNQVL*1EoGD;&sN@|VR_0=K&gah9ZXCozoQ!N12*X${o^*w^Z16u$BOmiWN*@;6
zNY+R{q-(H7`pu|D`YHHV$!+Tz{e}bnq&i^*eJf51lydA5UEN{D9+^-(jeUw~LY4z4
zv*-a@EqQ)rD;ao?!O?Yip18o5^e@pdANeAOFx+KG14*W$NFHgfO?nDKZf5fj#cY0B
z&&?qFR)0a%uckGPZhKERVQQa*J=Y>F8qTs|8ju=DPop*z*4m62{+Gq@zl4tgbl~sM
zxc`LfSUT{ZYe3az)Y=^zlKSKP8d`bPUJL26kacIUI`rlj2SP#dbq>R$LCL`mzEB5;
z&n_Rsi(}5~=oZ$hb3rkPt8QF+`dL@_&k1v%LeI76!N@OiYaCovIz_dj`sul^KaMQ9
zq}-~E47B^Ts0fadHNeKs=P{Sq$Wo!infhD{-cS63ZS)dyp%Z_Do+~K?J2IGXlvgpz
znvgT#ms}~IM|(y=eQp{kEafI$c`T|Q(t5O{ilvO=CKw)-BFl~VX1d_1{JVsyR0=8e
z!V2klS`?X%!t{0G$Ae@00_|!*o9L_Qh)1+JlgOC(WTGC?Sj;4vw!_$B@o>W^04*q>
zhq~wBhCw0jQ3<<gz$~e5MUCcD`C0xtDvK=B@Z&Qkh?(Sgm&{o<iK8{$2bn(l2JO0G
zhD?;RT0gXGC|in&Z&0Z{A;YSC7Yzsdw<>Un39lH`51CsUQT`krs)gHA1zgQV{ezft
z(99k5VXfVGjZn?o-$v&x`E1u@Djfohj`TW>)d6dn!QCeYH=Rt@_SVM}G^%^Jj?oa#
z+=2u1h*z0mZ4xF1abzfz2rfQ{Fy$1oKE)n}reVvX7|`9NK_P~8XDZ!+N*-Lf<e@us
zo0gUVZG(H5a9%F|L?$<-cKi}qP<@k;r3sbA#RCacnnIVcDAzDv)@4?eZ#7Pr`JM=C
zP&TsOnS-@O*UX5k<|*(G8R2L#tGtwCi{UufIjkPNn~=}D0W=tKrLEd}Flzyf8!5S9
z%t02wNe2}Qjo?a|NVN$%h{c;0IyERc^t8MX%hq(v=eF2-gbR>LTK%;GuUaw+(}{H)
zswKwPwOMeid17`J3%As-Edo_a?r(4d0|(PyBZ2mm@<n~H@^$CHvt@b=S5bM5<9o}X
z<9kSs?-G!eUiIN6?4%FA3`dAl#kOxiRkiRj)jE$tm^)QLM3Y%3B2!Ovwew1+<%A$9
zEOW9`gdKxd%bbK#x^57*Bo0Z6#f`8fE$uIPKY9ZE573f9Tnc?yD<_@ubKQ!VIx#Dv
zSG1i+e9(CHphZT`olIoxOvoyWk<cjg5tMap(_r9nfq}<Xg@N5s3?!?6H)SKq*CRO5
z^B-Txfc^ym`XAwA0Qb)g1oLOPj#2Ky2c`aIpGIM+<D9~km5VHNp!^BDJ#g+Pzl}Mh
zLarC{?S68?XjSNvG_8@q%=>Ez7)YTwSXeP^f)$5DBHCiGJ0%qV=;H)A^DOAmU0Y-m
z5akAc<osYQfpzRmbnU?R!Iy}Nb6Q%ulLu1i;Q9Rh$TUty8bXE<?Vt`HD2*eZ*K-QD
zNJei460_oi-*iDKs|1K0LpmFCr%;4mGaL&`kh+MmXiQdd{d-kfmAEp@E4btl7cm&H
z6LBG)SKy28Fd))5tRZ8-@=hY7bl`NcfJP_fwFGFNA3@dMqXl8HF-rm1Y4zq<9)N8Y
z+D-dRRsTDIs+3AVy|PMhbWO8ndJoswP&_8!0Red^O=#$T(=U(u=Yx)VEQZod+hJ_6
zc!+UHhefao@)7;c^ui<9wJnh!ve!w^+l$w*229`Knwp8nKtkC0a|Rvpk=3tSYrt!1
zC4RgEUd!^rLB~I0*o~GXq4ly4bVe$~DUY{A6#`3nd=+*G8!i%(>jNKB;=+YO+)%Sx
zija5ImCqC8!?ro4Lq|Mh>c@)7W*EMB4b59qx~67;wFfX0X*jTTh{EE)-Nz};q?}jk
zl{xS>8#QKTBd_~FnQm^!qjP(imA!L>*)hMBj1t?EcRRuSh(M1CVwQI`Icb$W-g4%H
zW|p+<QTfbomhyKwy3!NP?ElRP7)qfGT39or!OGyOk}vltgQn5(@VS;wMbW;K5tU8_
z{QB?4rjMsMPj{^q!VbDaK-7sC98c&<mDF`6_nSlEjW|)@6<RquThPRnLC9w~x11yE
zwsWE5e-JqK{}n(A!e{m^i1-r}BcMewtj?H-kFn`my|%nSmsQSaf0{HQmAH>Bqbb0D
z9FT$JAEOUT6O1=#DdPAOx(3I09Nu7?{%3ZP&R(*U_p!xl&lM&?a&+jobd<MEw|SCp
zjY5bIh<G`i_vM&mq@_jL86;hr!^u(@SQMmOc5#CRK81~iCKk(ev=DgI3ni)1s1f}j
zZ);r~0c53}&s`y^<eXQlkjjodAQfvu^2J;ls`hMnuZ=syhAQRpMlxMF3#KayHW3jG
z0Gtz$%$Hk^yXY<}!~B=H!ESU9ZVW|!PEh1$HGK^dqjH4!w<66nF)BBmf<FmVV^by$
zin2S#I2d9J8PNYsfc`an4B%jR3Bmjou46eE9+8W~k~tbi_!7F#P^U{?q0dn}PD!7D
zE<rHe>D=z<xaTX-vqm9Hq;DtSFNH+1aB74HOQcoh-%}LT$2}1~ewuA_Jvq=f#Z|}3
z_tWqEreG6vQle!WQ^a_5Ln6~SxDQ9lfoD;!M$ssr;Y5T4`l73KP|I*2_Jq*&%Wz*H
zjZpx9tB7|-Y2z)}L{M9btoRN>{4vq6B?&B_0IUoRoUw>U^gGiWPvg%LrcwC=s7KaD
z=PwiD44mO*>oOj*uvalVN^}p+8VDJa+qNe%6t>VcCikT#3)53LK&3T}=H@|1(-Sk&
zO`~RsD~-=q*i`JnE26T&R0_wmB=0#oX2<WEV%BmKY&toLmldQKo$eM}r_;x>;rXAI
zK1F^0Cq+rkPyPFVY|Pd)eORkHS--nS*I@nb!H9kr{!elywJHnD!Pq%c4eC(A<{;VA
zXlWU(rAaZz>LHXlHu=#A1xi4}vizy6_Gw;Y`ETjSe3E7tv>UV~%$|dYW``i13`O)<
zRt0dbR8yt1J$=S&DCd=eavsohFo+&@n%0^kAuxAiOaCA2iuBKCqulXnHJ&BXf*h^K
zP*xY~1$3mSjze*>%OZu0PCgWwb=7|s3eha8^Ck{HbrkKPgZL(Uh0b&*zR50+I%Tig
z@S3#CBmN?#N?)@3v>LOfAQoK@gM8w2;S{>uLtV6FHkjW_N{n@R3)CqQ(2>vc<Y`q5
z%8=7)BIm9M!Ggk+5r&)y(&HQ(S_UYyRK?RWPtp}NPomSY5q6~Nu`D;5)(tBGX^GyI
z%U~HTbge*3BOB2JRl37w9=K_mC*fSeBq&XcdSXos=ihJ_+*#g#zifCjK!;bR|9D&{
z=x7%Q#c_{T(>>2dL5b698qw8ZDuuUbiiTEWX%v%6s@l4ZDcmgzwff=ON>v8P>hglI
ziV&mWJloQ6#8&x?4VKn#63b~0<Nq648b~Ee9|LJOzoTogc5^PO-MsoW#upSU*II6&
zh4ivPd){rb6G()hP*^?LaTapvjo6F8m5Mln1V-a<)*n)pv@&t2nm2g)yui!n^e6|B
z-AhDK3PBOs{Tk!4HfK~c4}|QKxh)T?j2iN6ioll@@nCB6sT9S$E?N5;Gt3UZ3bd?I
zCcUl;M@A;SpV+--%aV^$^bYKDO%8GotGgJ|$-+B~FoXbVX>bJUMZL|DKf>x4ng|Gz
z+>WFl7m-$;P8B110QrjHDIgz#<5dGMGww~zPa)-T9kAfY2<b35?rfyeiuV6^x@cx_
zY4g1V^eSmXJ+ZX8IUY-vTu3Sj!d*N3PYeqGYbE@bWcsYpU)p}+aktGPBeh(IC1Dv5
zd3g=*h+kek^S=RfsaI%7-}=B}1Y4XmeCvwq@|82Zk+4$wwkRW~i{1o#cf2KBK1F{E
zLseZPsP>YP4eJuLtg+$W3S<Hs4t=DSaLVIxu?ri<3Tv&BlbdSyYx{^;_}v*gmrEA5
zDM4oo&A0nafZLVnT;r69bSi;JQ`jY87j}&d_}x<;E@gqvK({H=t?63(0v!oFktdg(
zv``rM+GUk*Tlzylj|!u35j)N?I(4+<(q4r~JYi&qM7+4}hz^&KsG*A-Asn!=#W$}*
zCK<PfZ7~U@gi>A>E(6fkGQTX{VddP@wQ>fRXZI(NisEO~6U(!gsIv{Lof1u|;hLN3
zgMoCM^tZaG+whK#S=368gX-5`4P+OI%&-gJi>axcJn~#}<TrA_n37R8GV5GG*&be#
zRWj+x37no#<~{iYf=a=A-XEPEGo|6PEvt_?a@6><Z9Y>}5v;|jpnxW3Lu0ck#^Sr>
zBm%fdcAhRb>+Sinx>fk3N>HI~z7!=j4*d(Xq{sZ%(MM{TNHGgbx&~W)pN?34XO1Ig
z;ei5Td7*q0<CdYg2q;4?v`C-<N1K5mi#!vWyTcj2AJ~VM-`t;3WrQN3HGjQKpuY=)
zKoy+x2vc%@FEd`5@}R$KYtpPQ;_l=nr|ms>yWn*fT`IeCpGsnZi-R*rW5kIp5Mp5f
zk)gw|4D_xcJY_;Ypj8=etd2TaDLQcEmAvv1DnW02JRDHrCn=(gRQc7lV$>2DYi|oQ
za8c8Mu!+lubqbjgJ$s6q3`^V^Ab0`46K%v9kR%c4<{|2fCBjFa3glo089p`O?Khjh
zsb>?r)fRcH86DB@%y4;5KbB%n=~iGpr`dI0F`B=H>)mo6JQ;xzXHESfNg2g7ZBNjd
zpMzIwOj^SFlw}nlfhrt9l(K(X@g{`6E7s2`V8FmmSxSMiDWrh!+eK8Tpys0t5L}Zs
zBki7uQ`#LVy`@inSfhBHA`U%GTRP}t#&CHD=K&-))qOa)Vx6Nbj^$ClM?IkvK4vV_
z&INLnp;dJOr+ud;>QlbiX_0RhJ62Y?^El{&Yuv@P#Ydv$P;ABjjyiYIZ?`++cj196
zu;L42YpZ7n24!UL-6hx4F9|`2)u%BbXuid4^p6wRXbRo-b5X8iSXFon={?YrCR;+E
zl+nH>1lZPYRbgmpLiv=IwVtYE{gxC&tNY!$DlspeAkI}RG>jII9;4oF%G-t7%1S6*
zHEQ)SETFUpV!eunA(uCrc1{4)m4iBPDKm0b7Q7Bp)<HKJ3P%g=Cc>0kIr%;tZdY$O
z?|U}f8h9=8dm*FxwRGKSt5OZ7V9+9{wuWSRTVBncXOkd)XEq#}_iA*Pd%fAgmm+ps
z;rCc*;LA4A4X${voyFIT{Mv3-@oh(|UdYY4g|qZ4y4wu6n#-N=x>CK~0&DlIA5RR0
zJLsBKT*sGNLfpne2X96ZXIp9HaMLQCy$jIfn0Vuf^esV-QXc2vZh_WJKktwg^o#9H
zkDOOIK9bitu_4Tq-Kze&IlLBLK;R0wTiSstv^m^d^yb?0Xm3>B6N?hqWM06V5nMf3
z@Mus-D?eJPHQKElqQdKx>lZ2N+pW^%;mM$azi*2EnDd&=dNWss|EKCTfoB4>fPC~j
z5z7~CWiz+Z3HNsW($$1NGKwVlqoQ2{gQ|T~^oOp>;Vv3O07R96qAJGJ33pW8+I-uc
z_ki&tzHjhqo$whrtcVlbxuQq+4xpO~V|oh$tV<XsFj6Vzu(iQAgKr5(-FB;<Gq1u8
zl!0+a5mzwgG~ofU{DLJXOfs6fo%{yatpzmw=2au`+QoWqX@N*;7q(H5s~Y(rk&#i>
zWGX>~{<%s}5hS`ZSF8k--5LXtP!6jFQNBIgj=_-YmlO7&(H*i_4mq_jxQ9F8Xv1rm
zh<}0ww=Oh5uIQR*J9NseRwFoa;K1VI;#6Z9H>%dA>dpBBMep1Jlnf4Zz%x*TTBI7e
zmIn_X7EUMJiuaSxyW<5w%V@Jy=<0^vm~L)T-L&d;tkR0tDseaE)<P9sjI`W2ECD3G
z?VQ*e?gc?D<n-Fo2NrTcgQoXlxQC&Ek>@ojJOXq}I4XjWw>8~G{S^yu7jKR(<;uu<
z#F>ve;ihVxD13XcfP0K{kF>FT1Jry5e-~eK?C%s9+*>F^AuM2)#InMS5&y}d_Stp=
zz>I?Tv??v2M=bY?Ad-5aQY&Gq)%w4VI0E#xXt`Y;4hs~qB$qK;We;~cTnu*?s&)5l
z4&K>HHHSpzwAIG&ZS-pAI=I+3+$uN$mL906f*UkI*R7mLH_CH<Ejj{Kw7?L78<^_>
zPHu$PMc$I>%&*Z}Nq?ccDk?>K&j&po?(k6$HwcHRi1=mP|2_n$|5x;Ipkw=c>GAg)
z@pytB*KNRKCp~_f9`B>akLicMrpHe<;qfDSoWLD<{&9LNY{A2)$9?qmSLyLxYW_R)
zxE6Wi{ZV@S13i99j}Oo(l=squkFD^bl;1{-uKzxIycoM<{$YB2oE{&cN1K{z(&N9-
z;~RLi!x0)4pXI=a#kjIOrYw&q%VWv%II=v3EW@8=*s~0GmSN5^yjg}d%W!5H#w^44
zHlJY2GF(}PDa-I=8J29jjD3f3Mre6EW3yZlsC*7#mQndh`ioJyoAAk~{4o8+sQgF5
zETi%X!YrfmC!6sXqmpiB7pSCY2!Tqv4p5+yt}GC!q-@sWd=H&&5~$?A7?l)XE>KA^
za{`sL1J9^r3(UVjK%Sw;C+P9(^f*gE9;Zi#9*@xDXY}|MJ#Hbu|B3!8(O>t`<NfqF
zPmhx{m`QrPmmW*>_yIk>M30x#0B@tmXXx=LJr2=OchTc84RAL-{+u3<(_;$_kS^`?
zUrm3}y>b4J=s{P4`1jDDDUZDWeR@zfP2a`IY0jGEf0zEE6bpWb5JBhf{2$VTPep_~
zY-YvlYDb|W@~9D86mLkNsB&VV+HXWTuxzj_+zM9J{Ev%X-}O?L9*ML#qI%^@*G1Zg
zZqRIzGP1k7E&0neVFuz3r<_P6;S!oc9myNP+Q`ou4&Nu=KT6!;nGo0~ZVcYqd5}bm
zi(KP5@RI-%S9GkUpZywHkw=4N+>N-P-WuI(GgNcBxkv9%$?to@7avDpK$8?NNANi3
zR?E8wO<Ss?x02Tpx|pNIMbX-`WzD|^sN-}{QamT%PdJ-UF5E1&u%U1hu@A_Une4F#
oNEK2#ETjxwPK12SXw<KW2E%O{FU-9W;RlUG3U5-B+jCR@A1@(>+yDRo

diff --git a/docs/RefMan/_build/doctrees/OverloadedOperations.doctree b/docs/RefMan/_build/doctrees/OverloadedOperations.doctree
index 93fd5978756fe3c64003dfe27ae2daf3ede0c019..dfd0f3dccdc313fab25625daaff5a0a7f5adf8ce 100644
GIT binary patch
delta 2720
zcmbuBUuauZ7{GVaW^0?4rJbxzo3=@tTDLZdZWNhgb+FE{b-A0Cs+|q>=H@Kl&60c5
z+<OPnmaGgb)l4_e6+v(VUql%Uj88s^AU^1W3YFm$L4EPbS79*x&Pi`_)6vqBhkKHo
zbG|>n?_ch(Xa7FuzUKa5ZseBxxAs!&LQ<2>EKv>X)?bUK{LlpbB`G?qle`{<L`G6&
zAcjGrQybUxsGKk43@sCuH8rUiil$2ZyKdwqMKyG~B#br<OuOh!-yr=~2u&V=K6o0q
zW)TKNGa<p?vh@@M;}#6#GlI`3K8NC#31hGyuZJtwVH^g^qpmhr-^s0|==tXJ^J6dx
z{p|YmK3m*OkgA<h3t2R!jA9fl$+lUy=dj;~3fgP-r`-rLK)c*yQwcnIeRm*nha#_;
zfal9A?%S@Sx-||4LWB!&aSdK9?b`^o1vAS$Ha27zdcsxLL3(5@o0Ia2uBp0%bJI4W
z`s`S5X7zH`^_F8(@1ljZ-LbAZSO+=lORYZ$Gaoj{8bnXH>KZFu^!VJobm;pYpMRU=
z4RWAAJ^fQ(qM9#u2XxN?G{%7Fsdlyab%Q)%bcAcJ@x-lC^BW|uIg)1oevHk-8;O_t
z7>AqdI5zb=>U^*}xcd&cqdZ%`bi5-J|7nnJ0zKiX>*%^NT1t^|PG~ujm)Oj37N~t1
z&~o&T{hsaed6XlEyc4r~g*|(qFWt;Ob~9VjLREqXagwngTCvzfa+iPV>=(-4cRnK&
zyYO0ru{eqT+1Bd9;Y~=oB8Rb64agEhksXPzoCWBc2RgP3#3T>IHwTW#qLn~|t5`c6
zvgyNB2_A@PUIgc!_{cSPym9szvfBn~?DRx;??&U!clY)_R@~LvrZ>A!&%RnAd%5c8
zPRVAf5}a(#nPPgQCr;n)Su7?ShkOkoZCf=+?B<rFa#hi>%pHk!?jd;h7BiT>=Q|x+
zsgM_|96Kdns!DM31kY)p_dlU{qjB6M;@Sr4ar2sq?*eMdiR;)y+~F;7r_n|Gf0};f
z_it3k1Hb=;P1Vul7+9|DI<vG_*UY?3EEvc4iSmj5e+A*ka(Hk;5XPw-7^d^V!v{Mv
zib@tTL`@m6kWsRVVa2?o^sT^9PY)PIPJb>M&5@iQ$rTLH)QFZ((eDChf=}9qNy(7#
zjYqyh@)3m?m)VUdzDv=O;Ini!`0>FGB`c-SgeLLGl$z1v6^jlHMM9lAk=YPj&`IVp
zTF3phQai~eNOFNo>DC&(Ftl9!9Fvy*l;!jiyaLzZ8r+4?U>$yjNANH`%1%RUxyY6n
zTMBHs%9c;qat9Z))T&B2W(ql?voV)uT1B`d!gUeuim)!iBatf;xgwD(5mCWeyk|m?
z$#5sy(TOlR5l1Ih(TRKT5bjqzU~{hG0qgpT2dp)?2kE7<HGD(}c@$O7m`N6tl!a~5
RmL#%P`9H8kmR>Uv`5zZ=jEn#P

literal 9434
zcmeHNTaO$^6<%Lv?>Dcpc~~1J#Ie@#?hXi$z<3Rbu_feqj208(Bu=ZRyJo6qd%D}*
z)q5c^gh-ZbRBvhWh{OvbiWCXKJ3k>p3W|jI0g?Czks|S(>h9|9-PzGhRy;tw(#%d*
zojP^u)c2jL>Qisme)rLZG4&@GqJTTz?z(B)o^P`#k(0J>#XaVU<lW@bZ<2?}iku3~
zoyd<vizRXl5*Bw{J7ivRKauk!E*v*n&)QE!%o2|8>E^t~$N9wlWQ9-3ns9{6N>%dA
zooyDnzG*YNekWj|No}Kq8bJQ!UA9Yx947WCQ5K?$({em8VUtMsDSnKfkmH%fO?lFF
zJeD-$mMN!AAws7W3yhRTcEYhE8pVX=no)#8{H}RsFa0%X$3gMXGOewUwMizH6T<9J
zRl*neGM}X$`8j#B!Tla<*p4YIzU4Hc&}vxWULbsTt!GApg$=kXYHYIhZPRNMLoY_Y
z9!40#`CG^17N1G|UpR0vFOZWr9>k{Wh`rQPXG;ZzPre1y8mVbbex4k_zlKrsI(+*L
zd@kT~5uX)|h(E7JvYLwX%P^q^6Q<-Gdcm}~M$7fBt@6};dgH-#y}q)sajBmDU8%om
zKBV6(Hy+f@OZAOwb+f*feZA-i5`Shi@r^<~X<x0k9xClErF})I$8U6U@HcwAly<56
z{6ac%AAflUTwrJ%82aHL<jASro_i$<Oo|SZLC7K&ZsTXI?Nh*bA}3wb>%?XUWfK`0
z5H`5e;VwSHFvAX!kr24S&ne_hpi_m!xWzPN<s{27Z|3l=l$D@7U64{kc>tScuKPVi
z4=2*0=d7%h75*@x*%*yeua`Kr2u@wgS^UZmj*X37?*)X>tC~dhltnA3IE+KrMiIWM
z!9R@V5rlh=mlJ=GW)s8fnY+V^nysj>=xTk_@j4ZcWW0Rp#(j~NJU)sW3v?6PdxO}{
zZ}TR<^MwDj;4<H=l6MI@6yz)9ov}(3EBL#wcmRcoIRhxX^fRa9VGq%V$^EK|A^#TU
zJ|2zGk4l98dYRDjAE^~Nr!Q!pW}Md56&%y*m937~MsIR;L$?{am(iN!>)-$B=n5<l
z{NFnw{GWji1&|8-mm&qvwf-!~YU|b70c0T54IsnGS6S%ivz9&-gZv8&{PSpl|F8u3
z%N4+1q@ECNeu;m1*v?Q$H95?4TZR=ctfeXW+YzT^4LZ~iDpPWjY)*<$ls^w}JB@vS
z+m~MQJC0?#2M#i4WxuLokpF^#{~T>fJ}FJfw<}ZfS7in5DK1{zAAeL;J}G)<PV2?W
zTW^gZ{DzjzSN_8_6R2HAC(8Qa!Z|?xH;pf5lHmI35#jn>=up#Jf$Nf+f@{q$PRRv$
z^V)i)b^w$KGXtQ!_@Ws(R{e$05xmEQW91WcutE>MTf=siFLzJSKXo7;^3>TK(=F6)
z{aP8%uY47iwDki>+o9k4i6>Zxg*lW;o5H+?4xEJO%LhPO5-!fAN_K4o+2@Cs^;pLg
zEDelVSUg|@nfgXSC=y$(Gn{f$$<?|V7f#@HR_ybbB5yV+PhB*?MH-%X3$@%m1uz|v
zo<D+`9IzFJF1Cm>YdA;doGJL3*3~O@1K3Fn7{Jccdc4Jpqnx09>$DTP>qNEX?y6?o
zupGUlTPTj+s&MrCsLX95JU0$dB(Lqi_&hhF{1@a4OcTDc1OY^^M*U37gwVk8+BXq)
z6o)ek_iOMP<nB`_$>i^H=H)S}pS+4cX``IQPn~!aCu)c*o?ihVkI3`eph*t;3eQhF
zv;-j__g{*2_0VfEacKbCCx7g0I}yE7S8v7fu2&c6L3e*a^jz-#T(fjoUT^9air4qb
zyq2%tbeL-c)giN-Alu+)EKpSyIzw)yv976ns9bsN`mc7O-J>vJ9UT*|!Ns}5DwvqG
z^EoPFez|NwtS65Tn*B{b_H68b^z7>bJ-qJQ>FobX&*iYQ|E6xCX1`UL{eP>TFsl}G
zkVEN|W1y-k&wddx+ph0Zc%{D#0|TT*7<*PKJcM*e&Uj(R+#5=_lD_NT*e+u6VV30H
z{Zfrt14!{h9-SXH_>n`Z$`3UagyIrEN@WB10Zf*X0B3xiFYF(FO9BG}@QKm^8p*c9
zQ)4=l$S+fl;+UMb;*c_phR!g~<|S#SQBFoo2n-hK)KfY?io*-m4bM*G_{*jnBgL2}
zSouOzPIZ_^*-t-A@L=QA5DBvv;9(~1#(?fEJWgkiap>Y{PWYBVnMtZecQx1*?j>@m
z?fb&>1uIqFIwt2RIqSteV;9+(UV@VO2no@^z#*MZ=n+&drzI>svq#1bwzEc_A4QK@
zgDhd%l(QiV{7@J!+h%TZ>$sfermG)o@)X;3;45K@ILd`;vSzbZ+(CEqJ7(y?SC9yq
z*+a>c2$4*pK_!pnyyFG2FqmigDhSG{ShUx^w}$s=i9A=WG*}q=p}|ehc3B8Nlc|<S
z<bofIs+OA4lF0M>YWAt<egsa)`BZOVL*DvawPIgmiA}$?6~R#)E^<|ZY%WiR!Q(bE
zV#kq1m#4A1`k`&uEC4>xjRSBr<+$a0Z4470acl#bwYIaH@NqeB#=<v>B6-{asOIdr
z7Z@6NaI7kzy-MhrE-744CGf5n(exKZLBwL)H;~AK)FRsr{D>LlmI@`7FlZl=LUh5f
zoycst3<JrmoX82mFUwgBCISUiIv+~sGBKm=xM^~IK45`?F)>idQsbSa5}cu!LD-gc
zE<_MrX*70rcGiPE!F_Mt4?7K;Z8snpH4=G-T98I+VF-p7O&|`XAz85Y+&8}ix6Fra
zYhO21Qgm}J??(7OZZSAav{g4;^jvf?CCnBmU<;nynv~}OsGgy@rOh|e{O1#SR$1eC
zNP^Nu2H=)_WCO@ExJ02JLA=Fi&lBdZp%bAAE-Ls4ka9Nanc&ld81#+M^0azR9}Oho
z&CG-6EpCD-nBSCEm@$e!23l{$0Wz<2H$z>x$msqAAn`36P%zaw|CcBtL~*Msx5#=e
zW`mM@=!-KZpzVx>YZ_Yy>zR&g;Jyely>w&Zu{^=NZMt3|C(}p(>H$R#HZ8!lFa#33
z43Py_D^8&!phDon2z+DHWr~N0Rh828!Uc+<t*sx%3H`XMf$|9|On<L*-v>Xtf22*!
zJ^nI(hyR*?!2iTQ=6~m(^Ut~$srFg=x<g+t(bq10#q{+D`uaV-VmU=R#a@8%;DUtG
z+T{0|{GBHMpvgaO^3R(}SyL%$DkV*&pc(TzHBmOq!iH7Y@H%XG1RFl&pYcyp1L%!G
zY5<)nQUhowsSHqSW-RB*z*1wKvmC@tau&v)mJs=KxzwrUl2i_^2E2ML-_=-EqF>op
zsHLYW8mIDJRimYfe#G%m(86(MzpkuiOim*-S=grmn2AJ!&vgL<i~-Bj#PzKFUHJJ?
ovI%}7?+(V}#!ZAP0%?ajLRE@qbg=^1v`s-Xi!Zd6$F24M0LUP>jsO4v

diff --git a/docs/RefMan/_build/doctrees/RefMan.doctree b/docs/RefMan/_build/doctrees/RefMan.doctree
index 812de7147fcb31660222ca0fe71cc2b640320223..1f47142dc4914b37a122d46ac04a9aee4009170d 100644
GIT binary patch
delta 610
zcmZ9J&ui2`6vv5a+}-Z_qlc~qyIt1SR_ks;dl5W{NU37!B36$}m?Urag(j19W`ZnO
z@Sulc5Xwx!gZ%?MFaAT`JX!GOL7c>u77vd%ym{a6=gpg6^Y3n0Z>^JY{n+}}$ZKwp
z_*o28sN?SkgGDs4mG3#PI56&@7ZK_s2m#L4w2eDH8>b?PdVWHKP=pC3<(UgcLMphU
z4Y~6IhP#ALlg+qLxFkOt51Z{nbq6~Gh08i_>sZrqSDqQC^+)&^w{RPu;xqZ_(nt4s
zhWBt2TiC^=9Sd)wlX(O$8syhR;tK}Qd(B9i0#oGNbD#=+PwN_3zN_%*XC6!~<a@Ji
zl~c$sW_!Dw<F95`Ys_=aj`=_LA|$`elZ^SGu&a5Kt1~|g<HO{)wP_e#xlvh`>(%w<
zToh7pBcLOJZWP9$P`lUH<X+|0!U77B@&}HSLdxxQEHI&V!bb9>@}#r+?=m2Q=mq=x
z!0Zsju;?f@Eq_+-%a_&D=9MreBaKK%5Ymy#XEbqN$+N1xGRMI${>kMK4K-cYkMah@
z9t3Ww;_67YYHt<+J)YMni9w80;ObBz^f`8P_9kCz8^%gKq<)kI1!trNDxVF&PZ%lO
LRlnF+=GlJ$x{%w*

delta 472
zcmZ9Hy-EW?6ouKWn?D5`qlJlyMnn>`L$pvV6crOhj9_6SB9q<G8%#3m%&Z|uz`{y`
z5N8CNynt;w!NM2tA$$RgbXIO+M6o!W=6>g#do%GFF|Lh=k8sO)_kq^xUTkWhL$tYq
zfK~{yOITQNUP7E%$YOOz&~m1NxgZSL)Z*xXobKW3z)Z%4f|z{O*2bqAY912D3T8ab
zdYbbzFC)J8@H%Y37HmTvcI1oi?quJE6l5U^X^8C_FbSqx#PBzuIVz|n7$KP&!;V9k
z!oQivs>d&Q+z9l?_i_qukqjc_lO8wvE99FV&-HhFGhvU>f0<qVfA8Otrk_)nSwunF
z>+38HeQ4TkC+T0*w6r`7B;|8pI*|Y&9KMQBtyVLgx&T@=DLX?pxkL_exa<b<6Vaa|
zL1~$rB_d9HNAf7REbD=kybrczE|igvp{uA3m^VXJTp^<F5Uv^u>;i{`=eUEyS#2zA
R6N@q|O0=p9y=UB_`30m$qp<)0

diff --git a/docs/RefMan/_build/doctrees/TypeDeclarations.doctree b/docs/RefMan/_build/doctrees/TypeDeclarations.doctree
index c7a02e1cfb5c0e1c83fbaa511c3a00cb8fec3d81..6741795089dc697a76fe38fcc58caa1be8fcb04d 100644
GIT binary patch
delta 1798
zcmbuA&rcIU6vx?81WKVoYUM{;KtMpCt;QdTF|<U`2vRTxIAPsxhrWe&w|1v7O>7{+
z7)ka*W=*_kjNzh*@v!k?V#5DGylA3F6GJpHdeVclTMC2xD)F#s_sx5sdGmeq-aZd~
z8n7;uJz86~zPGEDk(exGl1ReZ^2a-u-B1c1b=p6nptRzLXo8mnKo}$c;D(#x7t+}j
zmJ@w~EX71D$`Wt>S8$paC9Dw4wQ*kZm>cUq15FSBlNknYI1}ZeIj40&>$C=K^y#2a
zCw;o7wG8xtgSz+S-Jut}q{DKnDYSPGd1|>{+XMaJF}z30^U?Zm%Nx!%wYe*KYYhgX
zo395ZahqbM^yadkmia9RjY9jTKCzKRRpAJ1fLe{SDb%NAC0WWQ6^$<(KEKeyEHG-=
zYADOj$nmUVXz(GmJt+P#hN6pGh!JNd3PI9c85`C1)|D0{3}Z091UJ<3jbdwXGiTPQ
zpth?(ro>78L*)yLV};ENcrxxd8+gUq_OHGn{0dpOf7=aoe)W(bnwCq&WX^`kyPEsE
zAp>iNMCvacb)}(gr!4MLG_qQeKXt2)b$06wseZAxgQZ&6JDg4~w2f3;Ivq?pL6SXo
zZ@h*pDf!R)(9J+6^&wXaH{3$0&@}5ceu|y}g+}r*ydZgf{L*}H(MeiqpP?N$_VgBU
zODDBLLU)bsWV@2JZ8qe557;PyX-K1+7*eg-<S`^9_%v^fMHXo;w*0fW$<Cuo^D3Fc
z%(9~#4a~4qk0^2`EzmRe(z&Ty8oqO!tp8{{$8o)+%iTs=J*Ql?2~k3k1d`$yA_*}m
zVr}$jCmD91sILc%Q_4lZKZR0?FO|h0OFlUrC#w5u>&e1mjK@5k>B1aJ`$U9i3=cp3
zT9B{q3uMIe#8oXO`8eG|=3}B1*HkOraZV#&Jihi?1qp@*5d|e?=<d|Mq}ow3ieeEn
zO3{{x)0+!lqg9=~VqB30$juHIZ~aE0)k=v^qI_lOCu7#|3&TR#bO~pm)i9cIcE~}W
l83c>^XRn`YuM#C8k%<|Z#kFZowNc&Wd`+~lA#x__`wIYZY7qbc

delta 1563
zcma)6&rj1}7^dBTF_{Zm0ogjL=z<%pG0~V98PiA<kcvi#9wwHp`fkEH*Un{eWQO=7
z#$Cu)6HW90oJ_nmo;)b=5Aa9gQ9Kw=9K4WtGk)K?jUur0@TKY3_j$hOecnFb>glD3
z{eI)Kjs^QS8mNU|cX}zXfwy#q2YFWF;|WoX!R-XEWMX_QlTWMiO#iH?s8R;Kpn7cV
zD2={2eCRvHhmV2>cqqdKV1?|o2);S37r3Yf2k|<Dmmja*sFsBQxN&)(Q4T?1(FlFr
zGq^JdeWWk61z-TYq<Xa3K<k|CE#;i7or-?g2mRvCEXL7O7(A&9jqCK(1{4dH>I%M6
zIeJ%BxEWA#srj_jujEs5DnF}eqR}#1bTD0}rkxnuYHIqEW9aN-y!WuyfhFJOHz-D#
z>@<YY)t2}es@FG+fdChuz<8;-GDi(A&y^=p^|T!eDKlfn3BASnnszUnb-@j^(t0fL
zrrt4Rvc%qH%+Zb(T{3#^y0;yT|Ggy|^l10rZQ)-n!Sz4xJ+{cEF02i?%j^Xj-uuD5
zw$%#%x)l*?dVyi6$R@ls5r<78!szq9!nliSXsCClg()8~kxu9@+c|2a8?%BZ$&!cV
z{8r--GVz5`Q|GB-(6UH7PK&hVKO`4P<v-l;spLpWIg+tjwxZgmy;{oH0Q?s-l94JC
zTJ7wNRj#8_8zJQ4Qfx-dh-yMk5%L<5!DBOJjjrc?sY#KunHcUTh*O|n+y9%QQu?sx
zI7J0f(c6Q5dJk|MsA^g{$@95fE|kuzAg4ld<`y59?(%6VtspOZuESd`Qe}BY2_+=;
zCMiM>*b`{U8$j>aS4j5tqZMC)Igiaw4w1<fp^%J_w*hpioAHwm0u+Vvo{$9&-^E5@
dD-@tFIY2P;`qOTnVw~6l*>FG;NWa<X&_CFr4l@7%

diff --git a/docs/RefMan/_build/doctrees/environment.pickle b/docs/RefMan/_build/doctrees/environment.pickle
index b3dff66909dd0284becd9d7d48248cfb0e184031..e4d51c1c258415a09a326d22beb791d77025e4c8 100644
GIT binary patch
literal 126903
zcmeIb37i~PbuTQ9woz+FGo#Ix*RthhBx`20c*9u2l4T<yd2DRi7;L$_rn_dkN<H1}
zUNkdCVhf9v6d^ns9s~l(OUU{QUr2Z?31oR8KeF*9?}aV-5<XrCfrMZnk8IzMB;Ws>
zdv8_Us_LGunx3%|(9iDau6yg;bI*3qJ@?*oU$gG*t5&UEMgQC_^=i>B&yQQ>b9Sv#
zp0&!2mOFg3X_pH31s=VvwfnWL3$0OijajX>Cf!V-l5f;3t6<k!?&A}W)~#B7qBvDD
z%lV?!Xjl`+D)}Y>t54)>3)M!YG?uTF3wFb<luiC#Z`4ei$^of9@vt@hfLWf%PEo`3
zh=A8y?)rKy&utv<RU3c_Os4IbmOCi>u70n-R}^@i-B>wi)oOMDm|SSN>*`jc$(^_6
z8&<iFuGCv+K$9Uw!}-Q|qf)4}e5&Hftl20!=6uWD5vVp}H;T=vsyRcQ92N!HTBDF{
z6s=jSWx4$z<xCUhEw|4qx7=;T#%w8DwQ93w$u6I*XKi5Ja@TzG2VUE9H&kmC$I63q
z8}1d<Zn+!tmFhyxo+;w#jsyD+?B8pgE?R~xH%?pTEJ$HC8^sD(I2<k8fWA{7Tka~r
ztyv|@tOJ|%2gdjBAK%w<H#e-=YRPO^^=uVg1SQ-|)_c}6LEcKUmbbF?=Jd3U{%^`x
zN+n>)baOX7SSwgHt8mN)-k|uyEqCpBt=?!&*4@mkS#MaiEaU(U3fTaT)_lIyELhYW
zN+t2v3z<QOPZyiBQ}yw}6uyridnEfvqf#SMZmurOuqbBhjfIj$(#ymYq%L0W4)f1?
z!)(}juP-C?uxOR4*(vn9Y=SH9PDwpr1k}rU3o_d@ON{1bBE@_bWa73+V1~pa6bn@#
zVJYr+uZV{-j@Mi6cEzA$@+}|*9u%*4*Uxfetp-TD5#NC+NsoZJBQN+~Q<%xh#iM8N
zu6c4by)}Xs?DBMl=&E6~BOaqx@o4e-;wjg7uxuHSI?I42<ZE`7P%<jhh7`MTsL}&=
zJ#UpDv{t2AXB;zDwK<h-*bR`pc#XS-e<~JE+a<=`-Bh>CTD~|=)CP)MNPn_+SumP@
z)LYNGoB7>*y`J^n+sr)E9u4v%Cs1jy+?<7`XQwMrn+Dsj4Rs-b5Y|V;H{(XKGpN>t
zw747Yw`a!r(Yl5?1=QXC)AW}gW%8ARH8xeM<j>;$Q+B;!muIM?>8?L#mYV1iY-I6j
zbaxF5YHRXMt>Sec;S9dGBa&KKUond}xNEuNRPoxPQ9Mgub`@{nH;OkFZxXMr10l?X
zmVEAR<e%B;StyIBxwCkMsJRKanI$U=n@OVKZV<ogEmM?VF8Y~O)`bZwgnP#;Yn4jl
z!uTsy*@aia&RuAU7mXPUN;lugnx#@@E<4?P=9z^oOnA8tA!m)g=x&g8xZnGV`^B66
z1eR4<J}K@2yO|_I(n3I$Dg}@dirZ{VkKH*|w`WAV#RJ8IqV7P!nl_uIMz&TV9TpES
zHwy*eQf8w9g@95*tLxyyv!cQ<RhX?5nxF}F(<`{TQL|?u7?no3(y+3g-el`lGjFvn
z%0}x&bXFM2x_nr?W0LvgZYjdLmdL_-<OIPbnv!fIew_-d4M_;YF5X-m6>x@>(acU^
ztbxUs@CVOYRy8|k*2*A_YTX^FH>=f}1zqq;pyEu<9q6cCF2D-qE3>l|SO|0rmKWtD
zSZ)U9HEUJvQe{RFkRL%X1CO>aWndy;*&EsEl8Lq@H8)p5G_$q<Zq8!x#?VxSRC3z`
zWjF(MP>;Nc*5o9$H!Pk7M#~E*LBRm56I-urvsO~5^q1{M)y|(?XkFw=o8|AUJyRw_
zenz~zO@9o|&A@KT!u3Mo75lbI{fExuTee_TF;1OaE$IJ5@kxRD5RK4TRG7k$1MyaG
zkMMKrX%JCa5Gi(>)Em$yMVm~cRL^3_w5J!;qfPWE4{@qB>Z+HSCS0W~EI0ft1+5O6
zHlA)m4n0b52|UZ1EZ!LGpFRdt%H-Y_ESE-=jgPxgsW0n)pJT$R_On}s;T&{=3kT|B
zuqAD7Sxo_NkS(k?(iN`}eB!6d4|wrC{p>TYa@W#x(sEZCd3IWgUo3u+o(W6OqiZ%G
z^i)=SsCbR2w247W_X8%9-xOG=4zys@_^~kmXtHG2i&hN-TJU+moEqZ!5W|MsR&LnS
zHePTyG|Okpl{t)~3{W&)hpUQFz4%S>u%F**+68*TL>8UPlM~q59egx{T9$ewv8!3$
z;3TRFEUFb!B01V|LGjVzW87l#rNxIuRnhN8B`+m(jd(23q{nbOr3!jg>*zO-e_OCI
zD0>zPN^XHPVB5G;v!;BWowEz10;|MZ0(G`=P(&IA?J|w?l1!o)0*e6|Rs|?9^@bT{
zz!mUFC`#a%!h}pU;eL4~BmB->4HJO!3>jn$tQmNo_A{t#mPCWaJByb~lgLB45FzPY
zDw|7ga74C*c@r<O!{J_~{3zkB8p`F7?i9Zu{XU@4kbX*6uL<u_`jP^zjodVhXa!2m
zum||bw0VyGbn&qGvf|@hT6}r&72?Yaig$_nLtGy!Su>RjDhjp>&~S*e&1wNYCI&nn
z__-P3^VA`ZQzq0KV+%hPFJbJH6E5j1s^YB-Qy6jLt(|Af!>@`m8aDmO2Bsf!?xGBd
z@Ymd}aH+{Vf)%dTvXv>Ggz)q!*sB1bXZd;Y%Hma`f^g%4BF0Ea&QwcwL(1MoQC}30
z%4db|0HNeJ#QcawSrpJLNfqwk{`$|oDaqRL28^J9AUaN{K(WfgEhU#LfDq}idROvU
zAViIY3IsSt$hS}u*~<k!<Xeb#@a`-PtO{XIGEqT{sPauAR-|EMy%j%2=PS)dwTS`V
zbEej@GbOvXh1-N<0RILK3w&1^Y`AkmTErkpW1yO_^^F_yWl3Fj)qQ72l0f!U6b1}F
z!xqh|Ugj~7!zkRqql@GU`KtwCwt$w;G|^QWlE_I=jJQg60|HNOIK5$&D{wq`YUd0f
ztRXrj8s>o-ULj32Yiht{$hT(68sVXoEchfmPZ!$fzOdM6RO@$5OympYai?CeO7^+h
zc-d-9l&iB7vhF<xC#?Ey6X3<z>@1=hgc~YLqOo6rnSXE)WSVSNO-XA@gL2=Kqj0C5
z+}*MS`rgY0yN+4*0*~B%Pd-7F&ZtTrAP5AxB9bBM-2?Cg<DMT3KUcoJln%(n1sceQ
z)pMFe@HA8w45)%84VM>1?Jepd2K9=Zl*>Wu3a`kwNDZ@wr{s}{vFI{Yr$nYs%`7N3
zvGe{%Pn|L*k34Xnarb=>96537o+HPOJ$&CIj~s4^mbd$_ikJz)5ER|mcIwFFiyuAm
zV!U_i)IBA8yi%J{?+nQ4dU=M%JGZ}DfTs&avXfbSQSlxY(Tu1i3_Cv=7EcfbgHW;E
zl&<HMqJZp&_%@5l3XFfLIa`(<t&9gy70km6%F*2^>NhIYl6B51!6dN1NAn@!M{g4q
z!uFc+kuU>ecwZTV5V3Eoc#Vt5+lC(tzkrI0hl+=}$_`N_Fi<F0g^M>y%!HqGZxCvD
z2<9?L9Btg@0vQ~^Ae;w#X`GVvq3`g*pvStCe<c|LQJ^9QY5*sR;g<t-cuoo<f^d>u
z1NFQHHv4eM)l{$U^dHx(r!j4BWQ&#w8{xe;608Al2IJ$&)!b~Lq+!n@+5ta4TrgLu
zoh4u=*M&<cK3YM^vs`ew--;~o>EQM~bzRHkYFGKyYLHRbyjhHks`VG&Q~OQ!%c*Yh
zzT*A-&LBmIe5nvqsw?Q>ta%oLn2<4w6X06~Baf)DwGOc>Sz>%rUWIc|S=Hi8iYFQT
z7N`n`lA?+*tcn7mFn(u;Du@+iFF55R?e?qrx#0MA1)z)&menxr5<+cFiTUNKFkh=+
za_mj$6|D(=L-jjfByY*xu;<X&tFFH#Cr!{GS1DU_pf?!qu5Fevdlu$tE0>X5<c*Ww
zWR37*&~gr`jh|vBF;BtUn$>7{lf$8W)-Gfb$z)d<%_&2;g<_Bxvf|2y^I72{p0ySr
zWCbyy+klYpOxdIk@wdt}aG$DFN_apfy+nb<jWjW^%j9IZ{WPI&G;5d!4$816v=Y-)
zOwAj`8dM?6aU+Z~jQ-}l4Evx9*>eZg<l^!?#~`wZG$;*}6{Ow2EMKh(|1BDkV8A0>
zA(jl=sHg)WPzoQQIRi{9XE8sz2(N;S9=#?CSdeHPL6z;qnuA@<BDhpG(R&M#-TYa^
zuj)nBqwA^*h=-T6WTKnprxDww31lJLSg5M_k(^j<hu}j`I6mAg7i4&e0-YPZ5}qM%
z^?qVZ<cb(FC!IZgt5y-d+x+5!b&jGL6z+A`S>-XrQN3!H`_&{AH7j>l@As>1_N$3`
zhX)|g&e<u5B0^%cUa(nClg4CJ->X0DLqdHH(|Bb8ST$>w!e@H<W&XP&9Hp$@MGwSI
zzsjs##&}(u&6ce43~aPdn*izR7#)Sc7q9Su1aK5#PDBj6!Xdu}5rcLI)RgczxaQOB
zO1~n7cS$;+nG`#KviisbIN((i!Lc(wtQ|fq?m3)kp1!(66U};UV#+R06zyiiF8Qwn
zh~>c*?~Hiwr~>~j!*2)<B2U3!7_cZ}Vs;G8$3X8<Vi<y@FJwSU5vSyb9IJg{@ou3#
z?B{dcn5m9mNaK;3B`BZsX^i^8#S#R1#LP(+aP*a9tMZKjS-{=`B)*K5!E<W95iAS)
z&&AVn-m;k&3mBP7xr8B1dj9;_qA}77k&2>bbIKhQJ~2&P8_=+mt6?(OOO{WBfyI2o
zT@P;z3zS$d^4Hfk%XzSj<-@=}B$wX2MMJe@S=>m0Znqzfi-<hG1#bTEX;_kD7Q7&g
z<Qz8l*S9v^HxKh!7wd{{=BQb>^Hd#neG~t9WC5`fnDT88LitM-I4p$+F}GHLHax&_
z?t1G-&`odk4hs@$fpJ_6y!G*X>tvsMx$KJfu!t2$#LgQ;lgq+|Hm#1qGNDW@8GA2c
zMfl`;FGQdovjR~4ogr9`dCnBeNQB1LP$|ug==t{0b77fVC)Y&Ur$s}&5Js!sDBy8%
zJBro|Sgn(HHr;K~a8eu!j297-)<t)V_8hZhgq*RYA$tRl)$IpuD11du;;6fsr#TqH
z!82ao?1No*2RZzPG07C`8EZ*8Y3UNdWw;JBNks?~G`{F=&!g7atc6H=DGSGfSPx!5
z>kd>A_NRF-n^hOV0x=WC<NCND1I=V6V7;kkz|)y@2Wr##z`Hl8cM&);F{jGIEgiS5
z#xw(fWKNK$N08_}4bo=2tVI)wuXi`&1-7Nxd0J5;qLCk2Z%*k?N0fJ2w@TAuPJa>6
zJ`;;KJi~!s?CxL#V<XN|Be_D<f{a)J-QOAvZ40|jZjL)3XsF_wVuh`^#$9YB#~oAw
zW$+tu$Kn<405_3UA@`=+5C4Uhs03?+s`ug}U--o7-~6ugfUBvec>J%gzt;7%jvxKj
z>i_b_Hu@>b`=0z$Pvhm2_gsuI3!-ez@NYQh;VICsM>jtG##@>$*1>4%i6{?EN{Y9*
zo8*cUW}~!_E`t4#Q<#l4q|I+@y`l9m1lB|JE&iH1zG~gV?_lTgGitE#Fx~*Y1<RoQ
za_P3va{fE;c0P&^YTg}0{Du5VvovQe)LQ`3KMNP0<Wg4sFsiz1WiR-h^(<D*6XzGH
zlmw7Q&-!?oMrsTiT!Xd`h}|h0Yv!Dc3&Mc+=Zn})0#_R1<NOJOKaEk6h$IZEA<XL=
zTKu;21*)Qzxa-B5V$1m)%9>NAn+bUAWCqsQ?1aP7rim?Zf~2k!_8#B*5xMt&kh=*T
zqdHA@L&Jm{O1lbVCz?~v2hfP~S$v4@Fha!}oIk}A^x)6&M`xFgcyRb|{*pj_8y`U0
z`7-_jS?4SG3qW5LfBr`N`MUV?4gS+~zKOrix9|ac{xAC886QuoG+ex=0*`-ZaOv^*
zrN!~s?vIH^U{KVsYEwtxIJjnMwEE!UI9{$C(1+D74dVf^r$a-teKmpUl}p6*mlwx$
zgcQTj{1gqvm~w&J?j_<z#%>Xb8(?3^kj{{XmR=+<x<kh(wZaO;_zduCPBq<3se;K0
zEj9V(iEV_?VNyJyJtX=L%P$F-!%{*FbeIc7E;jHEqlraXIR>%46E<tpR1@2#M9AK=
zbRpBg#%&`7^|Od+&$g-N?^J`kAuZ^LS`mPuGiPdMwb<rmfy_qFM`%|~SSi7ysCjk%
zH_?NQQ%+}07siQ37cs|yo3I|3G;4NCj0_nu#bkq8yg^toH-M~Y@`=PvN=PwO5)dC{
zh|Yuf6KAtWozrbgUeTt+$+jzC(r!83MBt%rnB{`;u!RK`j6a$Z#8nW;z7~L!4F_FP
z+}*khJ0pSB7_b^cM3J$QV@VaQiuPZXxP1v?&I9pE29bi^PD*kQAIW2Jl%k@>{kByK
z6FXWgy87P|cePtmkL)rPMq`Lg5k?V0zb|p?5kkKwB?#<4@vM*_#k&N{+9^U>#tc15
ztKseV5-An9d@6CTx@F7oE?%7nK5e=3$;6FExbj<RLHs6O46?&Y>=U}$I3!>RZA=c!
z@zI&*9<?=-X{BT1BebrA9l9ao7<ewa@Xv`U+O0%ncGW!`A{zP+iJOhc!r!L_vHZlp
zU+%~Z6W@O>h=0}E<r<JOyVS1G81uL@akCNP???+GO#Bqe^K~#@&`)?DDM0vGJd{?7
z2n#i3ZRh^9RqN5TdaXq(f^LuV&z@uXXky;Pt2E8VG2iDETg|a_e3$0o#BD`H=|Kju
zf-cR-y@+=4z!|TmG37$s8i_mGC1KqyyRZw0a2o5NwofN+K0@nqS`fa%oE7ZqwL3HX
z5au)Xyo_B`usR)-ZZ}#iSn|%q9qN`PBfCUkdknkbu*5(ZNpkwq|MtYKM>z6d(t=oa
zjtrf^-l=)RAG0)uL`nreKAyNc-ST627xr7&^PLprV~HD&u;asNK`c8vI1p_dDdV_?
zT=3HP5iJ%B`BLHzb<2>ET@3`uFyr+xiYUlmByK&zkv~fdV%a%zB?8VRJ8w5QjBcDL
zV@VaO=3<>tV@}7Kf=_GL^~M#94BGBhyDW+47&8njBLO@kEL)uzkqFEF?UH5LmQ!>*
ztV3Wou7Y6DXkxl_t4LdS@haa~A-F6a;meJQ+mG<&`m`XHU6qE8f&^!cBefZME>lyV
zNU7k+sl?ssmLtQvcysj_w&+THBJ4PkxbX-(?oSJ1+1W90ui6-3VkeEp3%y7%qMEoP
z-7;cum$yZMFo|$sHgU@lE;wmHEISuqrm(q;CMuJV!kV2I%e6+MVmu}e+iILyyt?34
zD{+Ur<<@n(3KHWn>;xr@dBmxYH7aBBcyNS+Z%vF%go8hv7DSkXDFO+8EJ93UQ-JWX
zIF)wXl(7h2u3ouVgty2Y6hmjd7oGWZV!p%+8g*;2IK=NKZYv^2pJEUz7>C$-9A`7>
z@V`wyiP*emO!6V^AVu8{^@K+MUE<DnNoe<qUBv*7V>q{ngXCir42m(vf0G!E2oL@`
zEeKzUzAV_-E<TYu^0rwr=)`Ol=Osg<Vz^N7Wq5sWeENt2xI?=nD{P5P#I6n|Zacz^
z41-ufg%}XDHBRy2JWU7mB0=8$iM!aX*bnX!bR84N1S7;9Puy~ZxVNMQ;Y<3c;7>bA
zPa9(1eB7qJn?}5#hYAHJ9!=btZaFao14P)2wH5S-6Sp1V#e-=<EIThQf2lfxp~i<;
zuC%Wv__L6>gWd9H=PvJ%h#DQ*a_U@SEFzq$rv(w_R0==MclCr}Oaa2jVv$iQweCJt
zv(Mp(oWb+y@E{c`6teMiiAmb6Yz!fS&e({IK`|b~PbY3WA`w5C7DU&)NbfOB;$Wp!
zkeVB2MyOCQ<I{<I(>*hAqz~9gEsbHu?<a0M!i-Nbh!yl0hG7mx2sYL(MvDcRpG(};
zZpl1Co&#gle#H8E;?^UC{#sfPzSMt3@T%9|!*=ZGrE``uYQTz_(6p%|c(Y~0ayiXA
zcFjuM)KJxCA~Td2g$RQN(t-#xD8(q_4^%=QQ-JWXSY)6|Z5+2hg#ETS0f8vdGwp0-
zn>s>HjwYsXw>rFI7wrZ1aBFWdUz8Yyh@9NbAXd;~j+~$^#M4O16+bS;lnZ+26L+>-
zdT+tXuEeQ5t#gT+kI?!|S`fZAyh5<6*GBVdF?x~JG|N~>)H$RF;1{VYnDwT_UG0`x
z*T|_c&B@I2SeSFs5dG^DqY`1<Ytw>QcE)Y@d4(ktmC{#dSerV6QNNJ5Yuz$xM?kBv
zh~nWUsq1fI`PsxML>Tn`v>=w9K{o_e<w?7YxM4@<S9h-n_We=fj(5wx8^Jzrot|`U
zEN)PWs@oqX#wfzg-%AT(*|~Y;5gd|Vm_>%&h>;9UuR7Kgy!$_iyV))8uG(cPJR=4&
zX5#g&#E3*#_Kmb4mYrqS1zF|^G}0%xS?lkjzF^;FNXFTV!#vU8`t=(70yuZt53nsU
zIuRz0qy@3;OuRP0L|$;vH#>!NZ_(O<fiFzl-EQ^I2r`iIg&GF<7^8!CCPpU0zT47*
zSa$YZ_YjU|lXH2xSgSN=ifU@^jfEiwc2QrjFq^o`-Lmj{%)uDvG2~++oYj=w8wF#S
z_+(;qB20XFS`c9-rkHg5^L8;SOaa2jLd@G!fbg*p3*sq2_*i^0?RqX@fzuUyaCqf*
zG_*M&A6$uawt4#-ek!r7#7jSQa<TmlKaseth-kl;L9Ae?q5nQ!8$uSTAOT(fu`nXP
zow#dVlF{9`3kT4U!VDNlYWTCB-%Q+UgrJ{D3&PirUlly*bv$9yy_Dv*X4mP47LE8?
ziJ<>i6L+Iq`VV0Do{vX_1%H*e;Rp-<cUln3&VntEAdeaXn{7D}S3xjj)5hL-wh_C6
zW9pRM4U0e>`O=@b{Rm&yr3JC<d|CSnt5(r<LOc?*pGb^&x5}_?*E7^|L<{yNZZSgb
z-DyEAJGHT$euj6qwM$78S3z*%k;I+qmJ_t!p0ScgyEqM9gf9;zZa>182hxIAcD@XY
z{3J(^0lbKX4m+=FM6_7&WG-=sy5-5pE+l-zeqjt+3Zn=|8i`wvaOCN<AeNmYTPc!^
z{4=Gt*_&c(2)?{KakskV%QlW86J8ya<(-KUh_L4EX+bPIYx<Ab=WM<SPIIOF$ASsJ
zk+=ihGGXJcg2Eu86dzCAYJ~D1OABK8DgST<DT5KY(9Ki7_gGN=%ZWSCJ>?O65Ew)#
z|E0vOMkxOmX+eZ3pJI~k&-2B^Fa-!7i+88>!{t1m(}JzsJimR0xuAwS*Lzd_t1`WD
z$*G@<P4#ysZYv^JI~YXUslM|#I)(&{;+D~NiOjlBn&@YV<o<0y)?mId;7n_DQcvCc
zMkEu~QdrP~V8%`Q9iLs3N}|a)>8W=P<&C)PazG~FRQEWHI`@JY&VBUpV){5iA1CSK
z0es-1QCtosubo<lES4tUQrB|Zi-@~+rc{|i^4Im)nv6W8_%<jT^&a$#O!&y>dJ_B=
zdGbVxW?VvN&iMr5pQ=&k5nv>k>2n9kd-)pCmitJru7H)d&GK!dE@kMokdaoH(gTD+
znv9vgIT6CQBy+NLDOezE$hieq&YZ+#gVgNEKF^N4GI7V^M=I*zVs>Ocaa$2P(qs^A
z?MVCVerfkF4|3j3q_(7G-caZ&R3_y0M-z9lOM<$aMS6p}!bK9tk0Acn#7#%&+e!<<
zA9>#@Sk&tXV*jKyN7({GJn$b2^8b3`4s=WYjk|CUiNGL2`Cm)iYJ~D1O$#DS`4o1}
zH<d!aQh@NWsHN?Q^t?FX?8=!+JwvT#B@cU6@}EL|x(6jl+k8~~IVS$xFa8|oKk-sU
zeT%n}PvI>g!QV;TmXxKJdmz5eAXd;y4zy29tQUzc?%1S{={+N-JBS0{fvX%OWqjgp
zP26&XxWj2dJmT?ZkU_M~#g=xg8WLlbx=bfzDI=wV7k4G@PM4zX4$JY%$0x#$I}$e@
zVaKg$K`c8vcB&)^{zgpW#Z5Dk9=Jn2!J?-Ucd=U*U9n50MesLdj?D-hBg}dtF&YtO
zJ)RcCvNLP_DRY5tjtdR|u6iig@VdmvcguziyKtW*wH~4Qs}r{wq51i=AeNox{aA{`
zeR1KV>;7Xw_n%JOfo|!(k(Pr61`*2tWa3sMl>hOxAeNo-n@)IFafe0;twhlO_Y-%c
zTlx>|64!dsmEhj)DSxp3RN{ssEcj$v5X;VjYfs7x137Q}(WYH$U{7GXY?F)D7OZ+M
zad*3Am9a}*aEL<|g)zEyn(&S0qV(DK^~A_T*!Q)xAeNndS9=^Ir)!LFQEJD$Md}LH
zZ5dcDpZJ<x9=B-vDsb(@xS_<TL>M=a7R0hMZdiF`r|7QfNH(!(v0%^bi96J-W{r40
z81{t;j3haIRXUis^$17yr3De@h#wqSeA*_lnDk~oVrH5Ggpb8@Y3Ij;1>F=ggk^>-
z{9fE}CRPRLA||@c>g0O9E9PW|FN!(2l{b6h7p)<jT+K1ulWX{Ln3I{Ni@Of<!K-I+
zA00o!wch}aTifX#8h2Q(Y2eb;e5pxSWL;=6KrBTpvJg;rhk4Ba*GJ+aIMU$)-E+rp
z;pRey@*}*C;Qyip1^*YVEcm}@iNXIxYYpD7raMSW2xuu!*R%3%U?ZXzbk}O&X+~VX
z$G3z58FzJ_@7~)~t5k5|?!xR8?znYcOJR=nkBDFDDlpa~+=o}Urzo%Vk*Uf#3u`6n
z_fe}<nZxgO>=NJ$Zc+1Q^7x5+|M=EMTmYH{>XYt}U4PgL*170z%m(fka|g3@=;dDj
z#xc5tu`=b*1$o4UR}))THQkN4dsyDHNIlvhe+H}cBd4m!qDl-9FXBD<kQqIwe$l0U
z^rY#o!Ogcs9p}~1J?Hgk&Up>K=>&0Jk4KZv8|V{P0+V0%VC}&wdb}C;2H~RlhQ+($
z>DJ2u^#n&%@Y{J4zxphHGEtn1_<qs(L3|=S<?<h_KG3~lfex<|7eNNP;w_NTGg1Y-
zO?g}Khfbs54{hDUA5sPUp=dw;P&f-Wr#0O^hk88f{4iRC&~FgApfoD4<!dAZl?IDu
zJxkkR#jTsF<%`_#MQ-;ZH+zv=y~vGT<TfuhJ?8aQ7XmFizrqN3rEBOWO21A2IbB7G
z=k6w48#+_r6*k6Jc3^$UoU)MKk*f61SY<&l=XU`ex7ZEJi!jAih%I*{d%9+pacwd6
z1h<dQFJJ|8)cHNsc875H{4)z#-1Nv5ER=YcU%DFrnk+tUoI8OF1m{}~+<WJI8t*y(
zH+}pOef%*#-qd<yYYKN0_k*wk7ht|XClJIhTuJu_s5TmU*By9(^P}N#Ogrdb2tZ$7
zw<!5r%lRT6wgb885w3(|i!)X%zW;9kqK0G`Wq0dCe7CbY{2`D;FSiHI#^6p+B}^<5
zp+fI?w%gqyNur^0WQF_&e!Kn3CvUw8>Whm8utMqy0&`!Az#DP>AiC*%o(Y9tL@`M=
z{Q3(0`fFA8H}s3t$oX4*L-9B00f)Jt;|EHbaql2*T_&k((!FDa3X86^HtXmCOQf!#
z#qI7!zFwEE57Sr9-K!qL-H5n?xNgj06PrQapK%Tw+UR0WTxBh8F&quw?&hvNO>JwJ
z9EwN5;0WY{FAdu;2r1u4S9Nk?+Ll<#r#p7VZ_nD%U5@_MiF7|&@l1SS1S4^kL|2zC
z25z0$3Cx@!`q)ArXK2(AV@Im><ZlrNxyw7EfZfM?wiF(?G?LfD8Re6GFyrD*IXZ6?
zb1j^E-|3=VH{?aH2JG573?_6dnSp_}cFwlujLNiuyPXYr>EX?F19`aR{l*5C6>*jE
zxX$($Cx!W!uX$H2)S%=zw-Ei9lDngnTmp;SjXrId-Ofz}pGL-$YvWi4nr=sp_<Q0)
zw`@AEL@rcKCt_~p(7MSla5rDr({A!zprSi>Mga%<yg|v#pqyD`If-=0Nc`foali=v
zo0u@@?hhk3ofCG0sLIJljNE}-X2zH|76SFX>NB!>W3FO&uhj1{a`QQkapV?qnW8Z|
zzjtA`_qz9TQNCO$TmH*?4VKrcY1fP#znIhI^FJ8wLGe)b^Ce(mGJE81oS!Y-Rp*=A
z-F{MFs5jkOiz}e>bVYW*x?UNcSiZJUZNMjYHy7=hVhR5@vPdG%gA8AwiOZP9v{MR4
zSaCMSNm_HtpTdbNY~7LQeKDqfudP?b@UN6HotVpR-3`);wc?aEj37yQ_gehEuog$}
zaS3wC;rgt^rKqkg!Bz#7*p31YDDeoocLFs6M(XkFSFc(%rYo(XG^trOYYRqhELL~N
z+NgTRm!^%;u>-!!dM$bOfpk_SriZ$Z9mqj(VF4^S9{4nnfD8$0aT7&mEM#jIM;b5W
zGGm7RUU#o)rsDfFlUBVwtBKUw`j;|M3yDpX^Ek=$%jx44__*jifluEUIcM+_Uaq*o
zH%ryXI}1qtHlg{tYQ$Kb;mDOpVWT5!82+V6u{Osk5*F>;y8vdSkKLP_-wvCb$Sp;h
zwc+ZFM2pZ_4(Ii)QNV%TT@zz%j>Fm<Fm5ppdZV`C+kjiz4f+S<pnouz5ijpCZj%6%
z`sNmY*}z-5%;+t<VYvME69C9%$aLId%y_Ra{xT_o@L2E`Sswy0mH+@Opm=|bUl$mR
z5e~Xd`aWfQNZFtwDa-W}5cXuw)sijOb;5|~Y8GR;hQgPJg$<Xeu$ZsZwcR4k?%r;F
zHEg${w|NEW?QnfITpy3xm)^KZABzGG7_M8;y;0N%xJm9A?>a1wd<5<VGiJ>NV+vji
zw#yd`<o@v|!u7pyT}0GmFDY>bi?YhOF$%a5uxxX{GBi_O=C(9q{{c~giT!&~nk<Fb
zcM!PHNIWK5(y1RaO8g~8iFxBL<0x()Q~zLU>s2dnPcL8|XEt~yh^Vg!MCDMEth4@7
z<P}uN8KIZRAEeiwxbqA*6?us(1Ybi<H4b%njR&g8YfsJ_V}}Fnp|y}a83?>Uh%nLJ
zYvArVp0uhtPR0hV8J@_NjRkx`T-h?7QIsNJ2+6bo_)GxcT(MHJjGR54%RI4veEbEX
z|4e{z|E-e6yIKs$ZjLLTp<bPn?c|smApNK$;%?&*`ge=5AJmNL9lEAeLLa}r&-3pI
zo(GMO8d*ONQ?bG$>%KOYXbn(_gd>JYqp(%QzX~!uzH$v%_+X8gU_{pgER8_j53rk%
zhe(SicD#`>$N`66W%K{{y*2-Sg!`LOz=5&$Sj<?v=ft#;Lqs4)w$L=Hl@hWd)~dKk
z2rCYyrsc0d+@);DsPpFtsk>|NrZ(*qPXx37J&K4oz=?SH1{uBzMK#wkGO8)j(&}lg
z9VN<{&ApszxgJ7(4?r*O>h)a^C&+5In-~0M+RYck%Atql;v#TPoF{O<Xi1lis3+iJ
zaK6iUC5E(zC~j<AP~R}%95OiNh$i@pR}YdzG3^F0ZH4X6@izSryPdaUD=#AGa4Jdi
z>Fx`bMe-{}(mQxarWo<PFnL%hMj|jY(RE|W1$MV~5N2m13WE-E0wp=r0j}wEe==9b
zd@d(&Y{Lj)r61QULZhG{xQkWx!7sC3JkUliLQz|HD=eh17Ke=e2aOB5fr_mW?6i{p
z$CzkI=)UB6?St{X4BHm>N=&81brU=S2bS_H<yLqM_9_c?2v=Upa7=?#_rvi-csP!`
zb~nfghu>fce!91+;g7=QDB!>-{4#VfY<iB0+k^wVqUzG`#~fqMGSA}16)X)~d2F02
zBjG+4glVNOF#8QnYkL7uBin1JPfWH~MSJHB?MWnCT9mjE>*b;)osQ8F>+y9m!pYO2
z(`PVAn=4v1i)L-KW#Tl(tvm5!Ud(F`As*=c!*nTkT1NY5os*V3%0@kpa5GUiM^j1y
zn|tCkW}rM7qzPXcb1j|-9#D;;RuC}31w1%Y9yolVsbXLrn0azROigd$nI$6~180HZ
z(8M$hi{lv-&R|^U_0`qylf@%TP=u8Yb|Jqj?14NHFV7Jhyd~!P?y%_<br8|=Hd)qT
zo|j^A$sl!aaUTg=+{m5UL83cco$bcY^ww_p=JuzefCJ{%i7~f@mysqn>xdyzR13;k
zGGSo7a3StRHoX8YZ>rdv$x#GH7>trRJ5?})*4HRhIDk~P08*@=hCRcBDcaP1$5ar6
z<b5bgBF|<=yvy~XtGbKRXU9*%KG6YkiqXLLF9~I^j^|&u@TyFgWDkm;o9NBOX%*Jk
zlryrDXh|2`==kQodD>7xOfhg_bkVo?1efqJ@bIW20;V#2N$>HvMIlW3C&QTd<^c;X
z=P4ba{Xc3o44}rx$Mr$xQo}9Cb!F*4$0C$O3YY9{SK>JvmK%47cXS1=0SKFUQNc4w
zOSSQ21-rNLb731lfTPd_UOx#Rym7cL8~AVc))e>#{<$dNfPtTnG4L-t4VzA8j09K6
zKYbzDhYc5JrknW&&-SsL#3KQ1wav^nOAWh<c>NSMe&>r;ecZUeQiG{Cv8CS%+w`^6
zjBcdGBOwL<7R9^0)xEqOy1E_S7S|^Y1tt9(hI$zub9~E8-BOnMg-ao3P-opGL0X*N
zVGT@axt|d&=@J=Zxff_w09Gv+H)7Ut=#a5bNa2A4!T=vUn8~!MvR@eL^Zf3?;Jd+s
z+X4j#MFCs(J9Ke*9`OirSIMLSnOtGt`$9a&!t&q_z$*AAE^Lm&rAzU*$zXMFi{Bl#
z#l|sfw$h+WIMj*A)0phSjjb4uQN&(981C@<Y@c7)TZ7=+=R2c-1NQmZcJ^7UFXSsV
z?1Zfn@zEvrym5dHmpSIeBwnrf=kr#b9QG#PKLVE~GhHd+=o!7GmV!L{EZjyO1(u_g
zplCZUq24ork4Nd?+5043NQcPC4~mv_ipSWWzFb2$1oR+?w$jMQfb$A#<eS^{AsiI@
z)#Hfe7`aBys23~EQh_&q7`%}~E{OZ_FR@Ie1m`SHSB)FEq{cEJTQsDXXEIu41kW(;
zQy9%qFClHT0J|5V8arR47*4%8J#FW0ob4+uV2)Uuu`(o~c}hP~!C6YYfHs7P$wL|x
zdGh2?E|sn0o@n%U<ugHx=?;=3mdl1X^&_281W^zI3@w|j0hx4$ua4*U(;Zq$E~7Y;
zYd1<(04={ikV>As{qlc6_60S?{g2oIpAE~ri1OAp${b!qxiZ(F)kX7yF?vdzTQCrC
z!3LJYhN%l~$C^RLC=>QWD{sQy-lo@K6ISPQSW{;HEHdMt^~NbSEqrbZ7G}n*88`ug
z5Qkw_X$gjpqmpf+K`saLgfr<mME~vChJDW3Yt$=jbxb;ltv1BXA=`ZeF)gzmwmnCd
zjDl{rdH_!l@7*0NkyAxsaK*D<(LtA$^@2JYhDt1csssGwmd<%Kf#YGG5Ld=+PXfLK
zW!FveqTlQ?EAzYBh;>+*Df0yh<trN(x>V|}-Ut#%aq$yO>?HhJat!A^ZKx1d?zt1>
zKJZEtb`8)n4O|NB4z}RX7L4gyWtJw#4QsxE4XIFcWF5fyUGc)4%^pa`Y&I%5U{5!j
zz{AKFD|IL_=8e?~wj7}LUiiDXcnW1XzSaRm_g4C(b1}Q3XlSbDu5jCeF`w?B*b&3A
z(W9GgIW|agYW-0{_qh%&BoRgF$or;)P*<j7^|;oyi{Fd)FFb8c8OHeWco7dncd^VQ
z=9**DOCBR}ua7k<W9;-&Sn{jb42GN%l&j)Q%YVc3tN9I@*m-X(W%7*KWCY7izH1*v
zC{)<FZ9Z^5M0?k~qvwH{EY5N#;l7t|ok0j$aQy@J?&f?GmZFUGD<UmB@`R`-oJoDs
z?XO!6n!D7ItAY;ZH|$b<9EJr(rCdNhipRu!-#d-}8SntfNJMsuMx}<-BO7U!f*VU`
zDKp6?(NY%R&*EoB{%qDt_%%p*amZDnQna{^((Ej>+%3~c5d-UH1qx5DMlucLV}Vp;
z=i$7}w(w*#ZU(ojSuZu;q<f`!qP8_>Da4w^x+Ny^lon-BzTiC=s9AL4Fw0rFS||J5
zOwlZPKi9b<*1QdJA*D;Rt}3l_*A<XtX9n;#&zUu({Fp(Fnq|)7$wuVw$XnE@*0b(r
zyIgHHkUc0*={IIt?#5<gdhE_I++@~ruhI*%FyfV3771nwC96iMKhU>)qvZ}E-J=d=
z9YblkSBFYMAe>#p*fhCW!1ZxZZ(pSsgkE-ssSn6hQZIr;CG@F<^S@>pDL-c{P#hT~
z+&)|&;BLhpkxH$Q#XSTN5j0~nrPpI1LVhEnh+W8vvv)0IMA=N^Pu73ryp48t4i=iT
zRisFgvIoNQ0~=yjE7Jl1lKAiw&W=Lt_a9a3R<lsa;-oWb4MQ<8q9KQp|0YXGzLBMi
zaD<2sWeawlhDLNmV!1)-1gnlafd15>2<#aH?x3uhRd+MEJLntQ!I5g(76B#`zyi3w
z3AZG8KOv<fq+1Z4@(g6LWY5}-)&s*gyPK<4)t|;ve+K9Y1qHICAI`goGTZ4HH-%?e
zmDLBiN$`B^#(lR!DL2=q^C3X=#0T^q0<;mn0Mwz-D7H@a7vFr*9Ts^UvfgR$7VcB1
zkdzM8XHDqD(@m&g9Ua=rzs1k2NM(bZAnzxrS0e=y1Rlf|+5v)aZvo(Jvx*bun_)%7
zj9q9gE}Xy<_$=U<QsXV8*!AXAsGdDbqE@PytUJ!zsl8zfZeRiGwt&1OMaycSiS2pR
zIh(a+O}muEIUUMV!FZ3z!{HFD(zGx^7u^8?fq~as7mG8KNcPk(%mDNbB7{(m4WVvi
z8x(#)1}F?NBR~)G(11Y%udx}1j>WrMw5MgHKH$fIHtqdbj~{k{pKqXt;`^xcT^jNK
zg+45@{!{ev!}Re(^zmW(_!av2JNoz=`Z!CAJ4O2V3Ho?1eSDohzD6In5vT+7@g4g3
zHa?KBidy91kQ2mEo0Ht$B)2um?M!kTlMH{7VNWvLNrpMe@FtrM<#3|}NsKcmHesAO
zu>|96dpPrvHpZC_1G#JL!v2;+o9_ks-=uGhe%V8xSEd<#Ug;q89f~<3-<UTV$aGn5
zB!QMYNLEGF6ATMJA?@I&ka@~Gmes0m3qAB|Z`7&<l6XNNwrKD%K-3yEB5e=Dk|oIH
z4x5+9g-lSDR`C{h!@ctR+rSw%f+ttk-_Uv(>WtkSFaeOII^>_x-r|`(?eQk>F$?Y{
znK%wAGea_)!H%6uO<FL29tUr*cL{EosiAXVhtWc4=Hjd)mIu@FbWS)FoR^7rc^>?O
z7|{HVEV&zT8v$P={8Z{!)bDfhKtTDQ?vPoSt%x&za8Hp3$&@aszBkIxN5}cfq*oTm
z#1uY9cUYhhK1XMEkzmc~1Kz<X#@1spyAsx>C-&?y_DtlwsBI*9QnGYTKj$%HL~j&x
z8p-MI*PIT+xTv={hTGL;3m@@N_#l02Bi3CfpCo5i(EdYFz&*^{bd;`(#6>ZbMTyeR
ziM&H=pf=qT>}uq@)d_YixIa%*Ag;>_^t;i1#jF>lAlUCj0Xv_hXPi=r60d|KIzx0Y
zQyeB-z|Pla^vQChG}s|EY5pu42u_d|$9u7aIK`cQ>WQ{_aGc|0%-HDpU6jdhbUFkr
zh(OLA2yLU(E(VE|Y8QnF%TYYjRzyP-?_QXWgoP<`14NMg4p(P+`c9PXy^*JHM*#<V
zHxwgJS55Do;n3jTDMb9SW+!9)Pnc(nDP6caR}FSmN!sd>q>|=*nR@V7^zjvZTntK<
z^Hn_YlA6Rx(}>`)PK6k08Y170rjwYcG~xGR2+{?LD;QdZ)G|d>?_Q>?uuOHhydp?)
zhhJprx(ZYm!+np<`_3rffOK7keun%P_X|gY`=7<yFCwgp@Vu=Hd%C<36y}wfznhqb
z8sd@+wZu!?{!8{*D^tcK7B}XKQe(8<#QHC`29w+xyeDi-YzQ;NE?__4v>SWF@>Z43
zj^m&_t=KRO#1|;|D>jtW)jl&BM3Z}_2%paT%bt1u`l-hzpHD=D^6icaiD%m)LEm-E
zCEd)d!S-#fQ_7kg=m6Od_bon}$zX4V=1QzEgffJe9jKQFc8m8|WP<AIE@L}>r`lNo
zKQP-hwQi0XymyM0bh8jM#^e#ip)sZ`N0>6NCO=U=W70P06PVl0ShWmQny(w@jk4G=
zhXv<-aw{}HJZxZZ9v<$8+e39n3$;oW2mbb7z-zm88CsDRgZxx7dXhyci8L;4#Jjo;
z3&MtY?<9g!%Jk8hC;X?9#$nB>U{CXQl?Jbd>9kDtYLF<-8PZr*u_t<~yK&Me)8#HI
zjb#YW&0UG(%_NV!J2V#~le9<wyn&J=g1OR-2ic)y)Lvm3y{StXec1^lQz7OcCkyS?
zVkZq-yYpwQ8V$^}a9gkt2%1G;SjaL_ALo3LB28`t%hZtY9AU@;tz(gA0YFNey>tlW
z&{ps@Xjm@kEp(96$mq3RV5{JZ0c1UTfF!-KBiQRYKu=;bA|n`~twyljT~klP(M|B4
zU}z#*VPA+~Rft;RsfLM?)3>h#wXW_gIzjz$7pc2AReCh;?roz`;aI^yaD>$9t``M+
zsi^+}7O5msxwMgNqD`m5BiWtUR*ZwyWFW|SM2>CGeWy{4uH2?nQDO~SW{aYw@bGSo
zj1NbXJ}kC+4M?N#>m39!VieXARywiU9m)Gt2e?THA2A1nurddGIb(RYGzv<ByC(^8
zd6@4+sU8Xc!7k<G-N!3)7V@(1rMV#)>bOybSLI3zV_4|MR(5g1G%yF{!F?YNcb79f
zYxIl69gY}g<ZKhm&$QhSiAOL{QH#@9-D@{mg+*~7h^j7(dXeb*mpX_|L>$*~*L8VZ
z18Qi^D4qYC4v?25kc6@l$OAFs(;|G(kag1lNI|&`lKVRC){(!rPeVvi@4G8Oz2m(S
zMy(5O@4%*@bPC^KXiHCHTz)JdD5;^1U(VOOh(RY6?2(<jt&N@IJ1U0!JegRa$6AQD
zvnYBAh`TLRIg4%Gv-%s4UyB4C4-40s6C2)zq`Z^zbdPWKRM?FN*?O}|dw_y5GQJ4I
z3+BnZVfDS3#j7}74iRP;;@sVb=<^VLT8;d;aT-H(01}d>*x1k^;&Ir>QlTB2G7SKr
z(S8e=5P$}I+K}l74pr<<H9wB7oQAico(HPRC?a-nn_8T5wuvMIXwjN4n)r&%+~b*y
zvIC>yoX1+4i0D*w2Q?C^7sR|ER2Cd)o!d#8c>uk&w{m@ez=f7v4vCh=Q3R9B;)Eq{
zKCOdI8hVdl+T@z#gIH+{tdM#Iqv1=o-B0#TZh9#-$z;akUD*BnPt`j)BYwE|9Meaa
z<!C@i@ni>miSdQV`gpA6c<&lK(vVf7`O7*$UXm|FC@Wv6Z*M3RK@U>&Y%Lj7y<>fM
zABydl^L+Hnv8h$IaI*X1b0ceMFbMVFP<#*0FRce}|H*Hz;(yo+eH>N|_v?vk5_~5h
z$Rabv2$j&*1jhn*1={l&vCInuFAy!gge5+O()f3hzL-Ho#+qZj9M~hPmq(WlU6<%y
z01OI?^Anz0y>Dqs5!Qvc0Q=p7oA2%wH<LKZ?)s@_sf2y2?&>k6uYBok$hnaccPuTA
zM?Hd$Gl(QON;9&TK!nheKG*KFXx;3gr7v&jd$+>Kx;v%MJLdbmB5)Di@t~>(J!#<{
zV{=66y$`e}p!>ZK7sGoW)}Jzwrd2;5?Qks~O1?l;;X@!j-stezDB!?GhkMYekX!h;
zgZa~oYn5gd5y<J_TtZyXRH@CFW&0V57hzh%7b0N0G|p}CHq-G;a1)wL<ct|h9lMY*
z-S_HYO2Q)xmNqE-$;C6&=y>K7mPEK|I>jc|MntAWdKnEORWvV|hzy5Q){I@I0~ma;
zo;JMV$ULK>HGzE+fg;|Dfn#yBQ9areZgG%JVTU;aX}n59=k85|Q4Es>r~dE7oDDZ9
zB0@)}YGvl0y@<3~c%U*y$g32Ci1;UGd1m!}+OI6_wE^g>o?-e*RA;<>A1Q|ZxB=*>
z7=U!`gffQLJ?;$ckwnBmr5jz~y_0+R!iZ<oKFSQPT%>{peY8#wCP*SRpZGtZPqJN?
zOIuGl(S}%I%QXbc#V5~&n({>;a}`bB_9DhYI*B_XabqQgy1m~sIVkcG9Fc|AW`t#!
zvKn(1_GhTNIb2)G(epM2iRyWVErVY&Aqbl{9Hz(7D9ZE2NA4*^FN|NnF!Am$vKqM@
zvl)rQIB8o3mKfmF7BY@;5CHU!%^?S!4L)&#SQK)&QqOYFM9%H*?wUN>gv(9vp5WD*
zt?kFN$Ygd6x~9u(o9z1o9iXOAOn;U{=&FhApe7bN9YSTP`Z^Qt>x|ZhQnG7TqOUvK
zioAxC+o4`68g$9;11mv;b<A(Qzw%kCzIDmp`&OcFS9dg5dY>1mn~D})^7-+Vpv9(u
zY1VtLl`LmJ&#pv2Uyypx(W$ZoI9<>%e7(d*Z^Y9_f^|F&YM3bt`KsPhv!6~P@?<PH
z8f5$dSVO`M7Wl8Vo5Q6a^WNIqUdE4kH+AP(=oIMorBu{e2#=BrTH{IverhGC6Ei|M
z$Ee|;w1lI;Yv6wAqP+T<*e-l{CA!dl{kM~+7LLN`M@!;jDNfvE=V3vp@MI?p-CbW2
zF_Q2R7XNwb=nVxrx{u!cVmNx!e=m~nA^Z@^bIJ8s2>!IUO!Utoel7|)5WjgvG=Ag$
zo{BTbRqeX4V2Fl^E+|#!bIBq?LnlLJo_S<&;AhA^PbWqBT1$?TEb>0;vL6+QmWZP%
z1Q4?qn$*yw3WL*8%vR2N;8Zp-L}DnqW7ei@9Gj`xrG@a`q65i0rYW4827nOVzm9Uj
ziwMN!vL|xt%HKD!M?*##uy1yNoMKAj4`PI}n$m1$)_APd5OKqW>3SSIRxEZ2^zE6@
z8d5#(+tz++*s~sEY@#VJNt`EXF@mol=yv;3Iton$4qi(NO~g}Z`$|ygrM*|zV64bp
z2KbB9Jv^kO9I&1gE$Oxw$`p>yO-<~<ejGZ0LiZSQq((^_&e>-sCIY2FQOs!X;m4#f
zetRY&Ky)jz5)B5qsC0H561kEQzg!yzydTGA!#sBT)yNh(`x-1s?K;pH+r8`XKf|uW
zrW3T7U{BjtE#y6LRrVfE^j6`0@8SL^;DGmVHtIb*{zk-5)i{e44TU+x8Y>*wN`|4F
zBBltSa^TTR{)0oMyftmwMm~d#_ZSCR<^D6I;lkM$>?ppkJcE6HMFUHqa25zs6YDKC
zT!V#mozYw_o6GGMzyjH}J%DxPFGL_w!b5~ok=Cb#Ltry@V{ax381Y{q!3i|Ev71F>
zk5p)RD$rfN0GaQjHcOdV3oBk&VZvT$c4K4?ER_{?fl-pV7<p$ODpqTi8Qf@zq~c>D
zT3g6)coye;ErfSZS_^Z?nFX_fQR-;ZE;YvR(t}kCYgd(8J(t}b_I}PkpIp($$>$dp
zVHzHbN_KmXY#mFLZc0~YwN5EZm+b&|N!|$|to*Ul%OT)eciiP^VtHv_TM60^?bdC8
zPPRyCx*o%<grx0etsNz8Z&-;QH%Qu6+QMnwb)O#;y5L=QjkXuqy?$}atTXo7MJ%~a
zhec}(l;7DSv2fSYnA36>ZPs1KIqFdJtQ?qd9eQDGN)Ak8xS>)EOlrf@Q=pqqUdo<V
zuawRq`Qgdc%E<L$2n+g>E<NzyX%{ICyLTyF_*v1C?f?Nb-Xy*e-b@3jFpxAY{<MMI
z7{4KJRw><|Udz4gK5;b@ZygDE4Z38straAS^P9wKb^?FBM@*M{w?0nbLVLFwqNR_a
z2&4$lW?n+VLPx>r?|${=X8J;Vb&%kZ3Nn+j7X9VRP3g<cR87>PpE@Oa2{=eRWkvsx
z`;%mJUfO;Hjf`P=rCf&xyqSo*U7p<-6PK^e)v)*vu```x&>(D8)TSlKuPW{-$a3x0
zvyzt|AzreO=<>|`1r;d87Lr&-P}vj|&Tv#URHz{$+U+jU6wM;KpCA20cz(2~Z3=SS
z;n$fG-y)hU$BwygL;(lpOc&7G(7qFQ_O!OoD?oH{p|YGu7;+xLn>?g9FTzx~ZwT3d
z_?!;UA83DyKY_rk20Qx^8!bb#LOaG*x^0aa|L%$9zeZ{1dE-g+Qp$VWBEqYM0_faP
z27QAJ0fY?oKM-R?27KC<GpBMQ$z;_a>C}QzYl{7YIb_1Gju-1WOmH#JLr8~?qurIE
zE6#9{59X?6T*;ilHlB0X42X?t`BJlBWpF1?vt(tE2UdRL#KSl<iv&;B93_6hE9T6s
zi9a-qHWp}GAWq>@iP+19nQ%s=Fv*zpOwp!nw}3xw&zHoXn)pL)BX=;)aAlAo6v6<U
zGX8$pOrbJY&P;{2etnP9ASkG6oEY4mK8htJa}z+s31WDpeUFmN^&*9ENH7P-$BnG=
z9KG99oG&B&Bqi8gJe862bEI+44WL8f#K)C{7^hnNvCjAbv5(^2_ycgC&`aEYg`+;8
z`;UWUcJ_M2*+buYXPo1FnfHlq-i(&erI0W4_$h?3kV{SbCv;dmlG>|&K#@pe#ZOPS
z<WH%#;+N1^m<{cp&{^?_6<3u)wbfVpD=dNc#4{TFgbj_a&Y~9X<?#LqlOTTzYvYx9
zra?Sm6GQgEtAH=U#)u~jt0qgOp;C3FiBmtxQfd7EK6S}}_ma9nHB#2<PL}K>qi2j)
zyS9vIZENv#lbSY#{m4=BX%Dv8+*oQp_9d7K&x`#A3{mK8#p1rKK9p;|th*E04k-aU
zrlsQUxk7eof#)BTESs8ht_FST?q#tR?E+OJ^C+spLWG^RH|tKD@Dk*_ux?2A3|T|G
zsjpZsD_V99qjVh^>~YHAoZVOuOX%<}u!aK#xAGR^$gm~;iyRXdo*t#zM?H+>UOl=7
z-V64Mg~7LUgBvG9@f)E)GPHhqunWqk^B5U-_Q6lnx89lgIJfU-;zlz$xE9TJv-i(p
zAPtOg?zRVI03*O4TwoAPM;>2A>v+-Y_;hbO&I>l7x%w}Nj_1*m?5?}M!5iCkUjpVr
zbi<2TR7y1AXj3bJk3kD-C3#=OZs}$$cqBL{5PJrH0+jZ!N!iXwyLLEkvkn4o7TWcU
ztE{P2=Gs({1d?~m#EVYEO!O<s(WS+ItVzg^d*pd9eOq4D_<)d*cQYfBj1!W^@A8m+
z2ZL~a6n|oQ8Md8+M}h`Wr%b3!BhN>?7XLeaTM_d7GWV?q<Oz?8Y9NdY<VXs)y#Bs5
zEf#O_KuCp?iZE3vEVPyLx8tQaMvivR;te^RVm};M#t3cLb^ekN3mVWhsILWll_T?4
zRI_)y_P02F34oLBN|1bs8)$w>XwzS$h3RY4pD~E;NxiNHryz87vV5j#Pu~vEk;mOt
z^sRRk?Ldxy?G-teq&=S(6zzdnug~S44DQ1UNwpg;=foO)PsZ=lx}mph@CDld;GPNg
zFAJHuIxS3Ju&-bcy%+3ziH<DTN9fz~3brK2;a-vB(h=;5C)=BA5^Swp2=>I2u@>9v
zEgO8nHq%l)&P07k$jnn|Vfupo1cT_kV85Q|$b$Vk`nJ4+Ey?lfUXkMx5$vnU5y9s2
zT<$vY=aBakzm@Mf8n+9ZDyj-{$8DQDJU`uA_V@z--<TVs@ztRON%$><gDSNXj<|ji
zAwvDSE<V4|$2vex;SzV%FXyAwC`-NUeRz;%-!jq%_>b|O_=8Ke6W2urYz>~pn$*8o
z-cF=Y);N>;VZpce0ohdkhi_8f!yvjhsYA5>>BrUdfU_GZ)g0sR5^Y)F{=eQ*xdVy*
zsaGUQ!8w0g**nMhj$972Jy_Yh#V6DgKMvy$P6FM1gZL%>+<i#?q`%4zMGY`ET?Xfm
z>~O4(pCMjzS$hMxBr|md03&)P+Sbi)z)VrCuI(?n1rn)lOVD@6>ioVAa95~X=zQ4v
z!V^S>y-*L@rPw=qsdj-RQ)fco;dsk?dPTaB(ImiKjU20NkrK%ku_mBX(r3B*1`W0f
ztIVuOzd9;SymTFocHwY*7ZxtbF2Fru6Q_&U8a#{T!w+4moj4q{&q9{g;8|=Zer$O=
zkz$aG8+$)0bm}r7yF~Y78-rLG_vGV5TQ&y2+FL4jAkjy9MWPg(TMqXGmht@gfW;3D
zYR;b%WrNY^zVqi}1^tV?Wr05<`m?kYkK^L633>T^TA02c{uu_*y`Xm+jQ%dsQTW{S
zZFxf*k{tikD{@>SLJe2)sSYxI)#V|XUj0<8NMA$sddC1?q^|(rRCYE_q(32TcUqXf
zNN-~h-HY_vk~JM#UJ;M9N#xx`MHcA0=v(jT*?|~$^okglh(N<i-*i(4iGGqOt6Axr
zZi*G@r+Ui*U!-4=mf~?-{0$*5FG~y47wOXsqI;3<)=HlzI<indL*JHHs3ke(dPR;)
zM5tk<cXg2I_Yh%&GQE0NtVqANw+!$_`bX2!J5Hp3OGwLqO$*Z(=@x_Ny-0tY=qS8t
z`nJ3xEy?kbUXkMx5$PKdnv>B!5$-$e{ZzjLbNFaz4|bkj&?m@!hvS2LU+gWLe8K-S
z=E`EhJ*w4CN@8PUk?3CE-SOeQZ*_pYr0`z%9g7LTAbP>v)S0se&tlC|-_G{rd0snl
z_uUajtiiL`PHekWJ8?J~3j-(OLohcjZzocip11+xw}tKfJnLQx0r3Zj&j|JHdedQd
zZv1^jMIIjR?JYe!5aS-Slxm(7CPoS#El03rQ!aN4FZhi4Ha<ECz%N2A-OQ}MC00LY
zddmub2*@+#7aIboR@XxSx)tcQ1U(kpt%VM7Q>aF`TPdU=PDp=8s6&oPl>#kaNY4mr
z_gG`!NmOKweMfKU*?|~u>lHCl@Mt+S_F80XWR0aXjJX{AJA6*Shoc`IT{(z*Bv;|;
z_*8|z+FSPc;{IXg#$sAbwUTIYaGR%C0FK|q`G+0grcjqO-HLJJz!z{aWL<BJHA7##
zBs+jP0tukrgT9G)-{)JGY8QgaBLuYX#`rGuUC~}Vdmu(B3{9N<`;@S>zXEzM(PQ}~
z2GRZezB~8rI-(*E2G{nMo*jsB6<X>EF;ehoIR*o0-cy~{6^;;PgAuE~r{WhD?(HoL
ze9QQvv=ooy;_nH0xjQXP-@kbQgXmtQyN$w{L`N3tEPY$vkd-9Ilf5FxB_h;U=5qJI
zoq<1dkNkTbdpFnNj~ZiQ=P0PH%B6>KPwXiA1HEO9FYK>oPRPN-(D&20eRv>5gQ~R?
zjkq`!kwNcR-#zg?dq)SzOB$Iv^~`xYwaP*-tA&>AU3fSF-bvnE7t5QUU5Orqwr2<S
z2PS1rP$nhcuZ!>4uP$%LQs{1+h5ZA;$MZmTiR0t~gXrGEcIPzwDN&I{?eo2*X9r?@
zrdPyB!K3AH8n%u$%Vuq1Hw-MoANYKgZ(iix+Wo4ErlYR^Sn%MVI`AN3$Y2Dzjkc`1
zvb}*^k{Kg}F#}s<lW@{*1?VS1ze=N<+QzwMdApTDyyB$((}K6(S-RAJTTr{}AX2wZ
z)_$TR8-a=5QnUj(_M)XFT0}vP6kG}$ffOJ<i(|EdWa4aj5)kfMB!{TCPWH(o)eR4p
z$XF4EMJZ%%_0l57W<L~=il#s*COeFuhA$@Bq4V>ckmjgJt9Xq6_~}eJd5cPC>ZfJ_
zLidXoj`JUh!Wn_WhmdVP<dXR)oV?&>{OmL$?`ijG5O-2)n&2GlYA*@+X{1{kD_Q5P
zlAjM;vm6e;%%WcGt*HBn<E<#*K-d2l%w;$ygr5{#B*vo~5zgTr7pt+rN#j)pStO~!
zWxOU`ic5DTRGZ@BU?kc>PCTURllMFuly$0Za5_ZXlgTL*rx!T?dL6e9bL!Q)^>ouh
zs-1c$ea`cXingn4j_Am&YDOvA>lBHf5iRMw1FNQ>oAK!&B6)HG!sn$H(q|dlVykGK
ze%9;s8++U7xI8(Z7oGkAw1loU+jjMtHYF(&)eK0xx8T{mmcXFL?Tof-=SSN0rw3UQ
z{OmTGjq)FB?EbLF?ho~r-EkxDp9yw<kcpkb?en8O9}xWN+7a3CfVc)iR|oH@Mv_l^
zB>96CBgyafiX`EoJ5i#WUr39EpXf#^(&yR;_^8tZ3CFx6xOg3kO*sEZTni4*Z5Fow
zxwqW)gGS#;OU5{z`E#K&-%bnD*O})SMECRe{v(9~64oMvx<*a^v8FXUu2O^LHu|=_
zaZ*W?5wx^K7hVu$Nm}!DLD$|0c5p%+7VO)Ju$o}UZ*91<w+!$F`_{DdjuY%J3c=o=
z7N#%Q;|!vE!QS*pa|+iK=A*K$m1yGq7}1n{!PE3@dBt0j=B2$N&7~vW!R-oR@jgd{
z)x<k~E5m$m8Q_a|BQ3q-#QRG^TAoe|(--eDgXmtoH$TuUHSB81&Lhcb*m{QxH6eco
zQI>_gMc<ZJ$R&Z^+A9KGIzk@Yyb>1j4-;WEA&=kK^3mQhz!&llrKNYAkpHESmJg<d
z=?nP>7)19%-hT}Fd+QPL_8)74{W+p03-)K|+wuywB+CEn6;Un`!KOVyopvVtBT+Ue
z*?kl7I}`r7w=D2Q`#WhV9w*v=CFJGXX<_=J{TzenUbJ`JYuUJPbOsk83K6G^6=`o^
ztwMJq7K~<fw{pql>duzvD_YdijjJF!xb5op3K6&B6Etp}cII8(0d9(^zt3etSgrUB
zXfz3`ysH;2-q#db)<JAW7|9g<42w+)wEV?|p3Y2e^w$)_a^bv$m>typ)$zL>Pc4^F
z98XK{I3E7Bke2(>!t{A~ltFZ_`Wqgg3u&66?B?Fnpny9L(UQlsB7IxlF-?-h>J>>Y
z5wXUYc4Mb8?FWgnLAma`F@8*Qd&>gf+C7_=;&FogH6br=NDI>!?AI}f?gjfgH9+yr
zC(XJsDwdBdqiQ0`RG#rhG_l^^MSV>fexB&h%J8%FZF!YJlJWh$BIBi_3>~+g{ytGw
zQ-(HMPyevDEbx`#chgclP8t4I$jk4fh3PB9|6mZ^E5qjd=Bv2b1=n-OP0&MynwbAB
zQI^I0YxHe-#at5TE4?DnB_ifHV_TXz(7~C>ToaP>HK?z-(`x(A0M+ar6MRAM2jEnJ
z?KnaIJ0UUa(!%rwy^le3FX&e&t6!?jU^hXdIBSefnRUxJ5Hk0jDryR_hbYbpFiPKg
zNBa(hyRlb<yF?UVV=l)R!*o!Amk@D-rhc8cN+!q)r39yX%Lrcyj;E!2950^}QgdHg
zn7$GmWf0vf!F5ON2CkVZG>XP3_Pm%S16yL)291_)*}prN^K?N@=C{SYpxGZczKZB#
zu>(KC6E}Ath=>X*2p6m$R*x~%npRwYx<e}|roBGb34JxaU%gvv+r{t2`<Oz@ItYx#
z=%naTSYT41wHy<9jDEA`d<WHkFEKW#`fE^MV}lZbA73sJcu!iI$MNx7LSo*P7N*a~
zcQA<V6@SA6=Da=IoYmFJdm6N*&aV?Kd0hKAeOumfO_Jney&}maB-(blgJ^$|NUMvs
zU5*v)FZGrQzIFTav^0+s?Y|ci^QUQH`l9_g29ZRx?Q)!G%cq)X{~OVgMf<z-ZFxmo
zlH^}{MUozfb_x)m4ed)z0;2uiZn4WU42$-5-<D)=x4uI)ba!&h-fs75wRL-pwgrpb
z(PRDw)$rB!UUl9@EH_gJtEb-dO*@~v-{pNMyvuudvN>zj?7VTx#+Ab+HqdKw&h=T&
zZ@adqa_(>JJ`e>Q*x3D#=w5hZ_g^cVOA==T*VP+SmNAFvSi>qCcG;M+>G05Aqmpl!
zrM<YYK5x&`mr5;DwB}9u+rS+U9IhBQ=z>$8##N@VPh3JaaOZk~E;XO!>+W&MvfZfD
zjh(m&{VrTXux|=0Sksl7*Bl;I<RjT~S#A}Fi!9!w`WX)&x+E1Z!Fgdg0o=ST<kEwF
z(<RbtO+egB1}kBWk4A;b+tVJICm>Kx4AfnjzI{_#50zthvIFE4p0q!D63S|BFsKQW
zhKCy}OW9vYXSlx=tsT|hr&glB6WrhKHATbJP5gFBngwSTygJ;sFMjgy^h(fdBx)#v
zCfkiEU%cPp0kn%9)^X0;KZ}-hlMdnjC{9AfpZEBLUgB=MZ{D1(mc(%yW#4s)jjs}<
zf%6t(1P@zp?k!6`4s=7_!O4FWE&U)`LRU`=YF%}oJ8;{r>fU<q@5F?0OpHisq{-}y
zsTWsmYQOlm&jV(l+EE_vd|;J>ciiq*;BTn)APt6orTP2s3)LY|#{<KoWI$%${Iu0w
zRh?DeYn=}Yp)#cJX1Pc*L^xljV}5@{A78=8#o|tPL%z09ZB$Av=c{;fp(W4Y9EY%V
z6vwb$lVg0l?-+lHPbi9`iTb%icTn;^J5{RW&$gbGEq;U)fHg~3a>fE(&SqAvg1;R0
z*&cuCYI-hQO{LZ`ei~e<fD7cgXGYDcWB(^!$V?&d=pD18b9|-&XAB#NN>+J>!jbm4
zHNKaQ<t-RR^PI&FH(abI%4dX+m8n-|EhAUX?G{d-d@thZ(a}G42<1KYbPjOJs%6k*
z!JZ*M5N;+_lHC~(t2E9V)-0oP&Z?Cva5xKl`N(IzLN8@#)<E8+U7ogTHK0FTtIXo~
zVYy+=Q$LNlqMa`W;Ztood^m0>6M2_XHt8Y0@_8h%J~BVAm<aLwl@5kK;t3*v$nv2G
zDuTsp@J#EMQt6L(fSp9qrB3<2AR(=M!3>S_LRd8<++aZ$eXS1Z1JW9ZzTVH(@$sTR
z>TNG8z{5vZ_40rGC(y#6)p!3hbjW8@yU12}TuJ9IKCof6Xi6VTARFB~jF+EMK>%r|
z?V32Lt;=}(YC-Nf-yoUi;qB|amHrsV@qt0v`>zSD4|$G{4`ImMH?@D?{(!4TP8fW&
zyNoApJ+l|z_ZxfUxI{yt7?(2pD*F!{3^|?RrTqu!t%I>I&9{B&c6#a7xR)|v+&uhV
zX<isNMkQ|yR5N!QhYlNNhH8ZW0Xfq+WSqd@H)GWhqcLE4F#=i`Kg-79Lvp2Y|2~bU
z-zQKEfr8SkhO2*J`ARY{Ey)87$#vLNkPCXp^WlPC7UzOe<PcHMN-%tABE(lIEtD&>
zHi`^H{V1?Vo7c@iLB^U#K(9{6HP{nGkdSjg<mPh#)|j&ph&0QT*`rLa;tId>a6rjO
znMS@;sf&l_59e~@nK;MIM<K=yM!+%T1`9VfgDqIbYz2CQq!z+GEm$)(3x4P{JCi=t
zaigsxnUCPpdot-h&5E=r4Eu-y6W?aR#)&#h^I>NxKJ;@%2dGIjPr8J@vqb1BXK7oU
zVCjU6uhK=&Lua~N1V>3=HH+)^-5r02-B@pX?>of7-VcS8NAGx~G+m!bA47dUe^_ft
zS=D=1qR+3p1Z+caNO3O(gcj#)c+5%Zo?f<e_jKz+-bkVX1)+lwu{DA;cb+0iW2f}V
z-pX8@Q+k!`^UKi`>`urjbzgh;d1L;mr*1cHp+C2ZKL^C0{rI!rIDc5VsCU3`^freH
zPZqJujDR3tJxH(eJGxUS{MFk+5Xc$Uweu3dC&(*h92}-z62reVmrLhbSp3Q5y7T#P
zxqb~U*S#WgDZH$Dvs$gx5IdWesS5mfG)1?_ClV{S#;9B^6>D_6_hxvNDEJslS-ZWJ
zU1Jmrt>P6tBrhu%NA!VJu$Z$uBPL4lfR4l<V$3${4GzVbh{Kui+{UHjMqW^*O6Sj!
zEo>pf;YD~^a0GehJK&vGK||?osUmG%Ppo%k!btjI(YkSfyFk%J4+6q}vu5oq9hGD{
zQDJ>ycB)bWhE?(+)sjLyZ3Cb<ths-mppyp2A~@~hi!WLtE45+NT{1Lb5?|NBBu3(V
ziB^1nr~~9AnjMMq5z5M?8;MA^PNkUgl>P2{<@dcS(eHgpRaYlV^4HT*jm(8U;Ph4E
zCjcK@393ybG+jE;62F~-X6x8m>Lgn|uHm7^$WN{W#eR$p>7{D8HM+Q$IIiiW0V7jL
z8md~al{9>QC8Xir9t@Hi_HIugrlTyz>JViu4L3#Ezg-E+ZVI{$L66wgN*3>F*mq4i
zb-TU?Q@8u0KB`Xet#LJiop<`LQ&YF~^sP<UDTOx?H+9=1`@9BC#Z2Am`}d6>K*WCh
zfORl9*}_zd9wNTKf8SFFvDf3^zVZE`3bbT!J5Aa4Pwc;4R;dP-7yx5btFs#~9C+$h
zonFri20?x(mDt7<N<#LfP0w`BghiaDXD@gjrf2St9x0V#CP3kh3*HclEw-Hgcn+r?
zWjbWeoh)Z{nZU$DY?i>0cx!wH+c9#vhk2i^S<2=7X-6)1Kek3RXkUgoYnM1JGi{8h
z?+$N%wO0&N&4juu*sd^*dpnqk$aDq=-F&j@s@AUxwEighzpX<nNwgv|wITG?)F$II
zT0_DO7NqDkj(SS5(Yw5kpK491{vKb6{%(np;-K+y<0>rP|FE@4IUpWrHz1Dc8x|km
zx_Z^BM`()_YobtKUOMu~F8jIL$eU$spvUGcS_s3@e@dbrXHPOH&)apYw15!FBTejU
z@?ssdMXF{wR=$D2Mx8d}=P9;Ai@#+pAf&ePXWDEL1LT+a?}YdF^M)|hD($3_X{Rzc
zwn_mIT9C64_3^r5PL&WaIR_+!B?}v*?Xe`%gwJhLN3h)NAd(S9Pa*P72lz`;aY9_F
z_&<Daih`!q-=j2GT#9>SxNhsxaJlaw9|79R$C*3><E>oV;uZ+FB3bf5#Qw@6*7^}R
zwx*|HfpFmi8H0>`7nenpn%D!{Y^d`^>h1@7wpzo!PFM@GU``>gU4snUaoVmz_KY`}
zViz^<V-IiAys0}ZbxYFiOM)ps&_VShrUd~T&_f?dS7){6)hOzAfV(7<LI^99a&{$I
zqbc%=w!Ao}dZa!tY^OfmZ?W6(C@(l<bs_Pd28rnWJjn>JRsL*mr6q2{dsz1E{X%}i
zYn40qO=b7tA3pZ)!=yEPKmOt4z9V{1I@AmHO{u|$xwRw$zqHAt-pjC9xNGeK7Dc@S
zr^~jbKhp59w6$Z(*7`_@69ulSp&YL|YTUnO)v7ZsC;9D0I0+g-VE`*xc7CkBP;MZf
zgGU3|yeP#YnJn$l^aqC{(V4&@)HTV{7P;%|m1Zq(wHSn)BMsA0jSXmK(&^{Vjnw1-
zKIFkDIuSeR3~|{oe~$3y7XI9dPlwO8Z^yTjtDPO<&t+VCIe+ft&nu{)&$*KRtaGjs
zf3D`DYxwh8d_L<K_$<EOxgLLjZv#hw8!hJs`n9gvm>#>c<=liH&R0o`Zw@}*O+SXG
z%>3DU$*dRQF_%p0>n(U*yuum7pGjw&KPTwX4bDFNao&dRIs5tX0scJ5pSSYoZTxvV
zf8N2Lcj8lU;065qE__04?#7>IokREp2@d1W1H(5vFT&qR=N^1I@1j<Y;G5fDwW?z`
z?z^?na_;5wV^sbgD!&ikPWBhye9^g|YOXC+$}^Bie1FzCLABmbwO)d67oC&*c?zFs
z@B#iYiBIS4ROLbb{SZE%bzaKfAEwXZ44r^^1Yake)A$75kKxaSmh-sy^9ug6_+4Ol
z@tt%+r|vu{UVIM6xAE|59Hqy@r}*Kh^ZyW!zCa((;feEg`q(jokFE6azqa7xkLcr1
zw&LTD>Em8H#d8mR{4ITal|D?|_~6i$WzIL~kT^BvOkn4zvzI>pguwqXKAKK0(Cj2P
zImyjUa#NGs%p^B4$>1j$^dy6QmO-KpAWb%%dteMMv_=K;e7PAT|2xzJM*iFMjgj9;
zePQH3OMPMFKZm|h@N9p}c|TR;e%w!85dENU+>e_n_W<{U5BgI-9Nu&OMXK^K`gjRd
z;d+k~A?VIH=SJ!|Wf*XNk-pIhKW7s~(`m=HbDqA@HW}w8f=5wT=XdFYha;!JWOAm(
zpCbN%bB_2^5`W6#PgVS>i9Zeefvh#@&no8}{y6jafb@_Goy^qV(0aJ#oW~=;dzJX}
zCn#|@*B9yyYc@NJO{wOL)p}bi?#N~MWES)@m_20tIO1<LWNJQZG|bwJ)iAC<Yc0%G
zYK8jsG;bF3eVkdcaLrjEeqnFmdUEHI43N@B@{v+@9yTTh;jZHw>TvCyyOtssEqCpS
z$@?E{>Bbn!j+6YYlRqX~+#uU|4d^)OyjD>22l&Sj8SD?@D|Gn`ooZ8O+fsDQ&vw9a
zO5g&+%QRXDMPZzuLBo<U@^sh6W0gE6H;A%m&bb?SE*!60(5H4Q4H5SrNem|T>@oIC
zgy#V3#bd24<pCY+&_W98_}e`R_2@94F5-1^Mv#Lj9s~1VpsC7XaEHvoY^BWi0*y5)
zg$i5=;X~-|it{WP#q)gt=zJ5O&gz)+m(!wIvQ0i0pbpJu(_N1w6f;)6<!-81i*|W_
zyxFizEqC~S8{4<dS?kfV{q!*!iCK5w(wcHN6iU-5#Gb(iK^u4QSY@tE#|i0;x~S%E
rsnl>F5qpxd3_jbe*{usLcO#5JHCr$nCjHukq!n3tz7W5gQ{(?XbIkwH

literal 114200
zcmeIb3!EHRc_(U(UNf!t%Wvbd2iuaYnbE@-V=Q6WlCT+hY-|ArTkfvuu9@yqKgM0%
zni)TME?|)gkI)3TTow~xVV%GQmdm{tLP7}P2kZtm2?P=duMKQ&*xcM?2?=Z<`~SZ0
z)Z<iD_jJ|FNXo+er0VW-PJQP)-|KwmJFl0oe#@#0R$M@T?p9}}T&d5ETJ_VFW}{xS
z>aC8u`L=eYS~?m^dUI#jD>{#NcDgIgnVHUnn=3Vnt)^v_D$S02aID;@S!1P&*(#P#
zRmPlVaje*!pJ_F!BQ?`$S<NvNcgF6urtUK9WBEyfPDup8>9}j~0s|UJ1qd$|8}+Hm
zbjRJGTH*a(bGu~tXb&|`Tg_&rgz6sexT_tj)#hecb1kdxR2p@sa}urF<WXa;HQH*F
z8l8YXNU52vvTe?F+zUg+rYo&-dveB{rj~4$jC`|I%D2i^&FWb0VAZTow~-IBZ7;WK
z)%=XrteMqH{gjih0OO9k@^4@DijKQ>rrEHqBIv*NcA;L!9V#|v=9`u2GEy(xzjyz>
zJ;sT$WvG1Pgk{!12D9BNH^7L^@w~NYH?^<hUI4gFt7@5!g;(~E?%OxIx8rVXS+$v}
z*|MDc44MZjxVgNa)-gfaM!Q+G@=kkds)Dw!D>kZCV97Ld*WKMLSxu{SqyoG_?Rz`!
zs?ny?>P$FpPI#XOqfwzSA2?cb#cI1`QFV|EMff!$6lm~?a=SL^jFu+xee}qE`TJUp
zCXsRD%=|P-r;~SD^Hm~dj)^H`E??|!=ATZ>Y*mVWTh^j9C7>Z&D8Fn~XY!LELEQv%
z+)ET8fgD;<FIte#wpnG2HxgCm@}L-3OLDVGl91h&G{{VOuX|}Slu^9iad&vUI-=eJ
zI$%fnDtAqdE9<m?+z`G4X%ZrVd0|mRpy^?z3YTv?iFeKM74+5?)KIBUHHgF-Mi(Yy
z)G6OqzN&oOHSVrk1_aPDpb*7oWrk2P8dHXnz)@(_T@|NjRUx}pqwO$`IcugpnQv8E
zpnmxZcPsz&xH(m+GVbm=$1<D6@+eUoC~hS+%2(>bbNb<Qo^UtvyG6&z`|oXJ_Gw8Q
zILQtb+E8!Tpz!&r1~jO}25GG$!U(y&Prez~kWE3cHU!6Ad#o}&%1NtR<|I&e2T#x^
zC*_Kbk~K0}Z4^)8{o@s<RjE%?PTO5`+N`$GBpAK&<!J6oSjf)AYdd8FB%H<<cZ;G{
zKG4zfu)B&IP6eM<zOsCZzFb`%<~PbuFJB|Ct_C5@`Ho6=hxliHss_E0l9$M*yAG(C
zRVxqkNRr{MmETUs6hIeCGxMH}VS0*eU-)RV(P%wB`ly%p_@l6Pk9VYkvGQJlFi53X
zM^#FBS9wITHYwGIVl+x13^cOcni{!j#HmaxF#F2;rR@5WHD$J|t$edV$|;E#o262I
zs$FMm0r7^4L0uhC^$97knF`bzr8b&KSo;}Qw3?L~*xYE<8!apEYeC+bF^g8`jH=Wr
zH)iu<{T!88zHx%7?rtr^Y*xv1`qTma6q<rQY=U2=!Ad~<X4vIx%hw5<O`bK(Poe`M
zGcM^HPFdDWe%5T(K^m`icZ<`WnQ2;(Y(EDI%kpv|8d|BBU{i{XTCD+nN3&p3kxydc
z=3qDT)=Z_^nDz+BNf5J8(pIJn6doqKm7l7bs9RBU;|z#qHs`_3npuI#ADDrRaoy|d
z=&NBmxwG#~Oi+EBB`wqiK8_q@tcR^(Ta<4%s~#$Y^-61|Qam-^Im3lEs^9s_be$~p
zNqKj>o(#@S!wRa*HKM*A`?e`<h6dwXzGTgy0~%i;^nalIprF2qy4^eqOj^ynS*?0+
zZ{c+7VGz-?2cFV+Z$LRb+T>bQCy&0cGBxidt)rwO#HrbGyjJGg4%ISEZjcAf0Zm&E
zw;_i<rMHIC@+ONndhv&kz%Vkow}<nUiDXma4td(h>O5eZu#to85TTz2o#0`C`shVr
z+FKo~E$}w5z4ZI7@)g1-PW3wY=iWNVF5Lz0DoQ6?<tmfSo=Eu{<!?}$*lq4M^C6+9
zyz)KeE2Pjm2Ce)G7(9Mcu<#lH@v_j5agNw?)LN}LWvhuEDx4m&k5@|iCI%08tlp|j
zRq%qlwp~9}Z_IiCrGBR<nE#EuHOOzZE2U2PZ-g$=z9Knyon7IiX_T_OB!ykm@_QR8
zDp<@kNRL$a#Tn%nlwZg-mY-j~SBgs0TaBU;(v^}dXi_rVNu`B;Q3vgYK)f+r8T365
z9i@I=*|6>0sG6zL^Rtx_X~6~ZmY~jN4!TJFTBS}Mw?=o!EP7ZN7NEfF*vv3PeLE2>
zlmn*|R%Egb*UHb?!tcyBE7S#&O-4_dgI8I31clA2R9Jpy`C?@ixo;LJQjVi!Yz<|E
z#7iuk<go|gUhX+Y;))uc52O4eenI(kK%=D`kG@_L&rtb^g4PgM4LjO^UNh|VoHAve
zW*=M<%P%V5&$;CnmtP`ZZYn=Z%5UQG(8{LixtEf$LqKDolW)(I;54Go<DQ(W5huoh
zI8K_-aC9%6EH9z^1HBt{6N3U43NL#b!xTGCysZ@3`0%TeM?GgSkm$JE)tJPyCE|d&
z+sFZiy8}Z!)66#}d4R#gqHwE1fS%y=@}=d=q=5KkVG&~_6lZ3tm6npdGg4kMNage5
zK0qk>4H^5eC`$&7fV|8LxxGQUKipU~+JYSv2-0vu1&UP{Ka+f@5JIHK-n)v=f)G^}
z$q;aiP+*}HvcBNWdVQwK5UC*rBKz#IOWM|Gw`SVt!hLsXHM>g+dr=H@{qSJmlEBxb
z?u2m{VUTW+dO2^bH85(Zmlg5YwGP}F)k4(}$&BipR4c^F!z4AyJP&jKp@>cnW=X6P
z&<c1WO{GqU+yIZxmoulxZ)Ufd-mvNoZ&YUI5Lb{!NyXe1!|$U}V$<tV8S)KzGB!w5
zf&;IEhu5N9?z79S){JxW*jTYtAGMv5Rjr(Ej@GT#Sbe58rpn%WV9au!F$P|Y)N0j{
zBH@O@ifHUPV89;k=9u0ay{eQkrEYiN!JX*Q9^BQj1bzSIQpLdld7k^`fd?O;LMOdK
zJ|GALIU9;0-n;wZ=_REfh^9|l7z@v}$T1}8zzAurO5$#OvzJfaKMx<Du+M<d)Sa*Q
z^4iofp7GPSdg<uI8)|f|dZ<hNtib%V%qCLF1CfsBBCkx9>>6xd-NE3Of((}&d%^MJ
z#>C;fjvBWdz3cFu$8SA+<jB28@4N3%$FF=x@V3N05K^E>#rETeC!YI)!_UR5$B*Ay
zt&BFB)1lYat08xNnz}f5aHa(R7KCBfvizL#tt_@VDJ8a?Q#MNqLQ@blHkHcZyi794
zWXQJ~hA6Q2)po6}{8%-nry>|jmpu3O5-Hzm%v7z@RyD6inKTL#?|Hivh?;1|N5Kqr
z+XHp<JH)PS@)~E6$%pp}SAeq02g`@J$c0iQ)HitE31_cUn2Bq2dl+iespC9F9IdP7
z3>Dx&zgq;8scTZ@VFTcJ6;DN6`^(5UNCw>S#w?5mB0rTTM&16)8$)Ffl=2+^OM>L4
z^)QCjt$f)sVH5lpw}eZ;IYD<fzJl=y<+Lg_L?hstM>A#{%~J$ye04O(tQX-uz|wNY
z#X&79BWR;L@X%EqlZ#y*6l+5MVB>1&=DgaUdu#L4>}gZk^3n1!erE$kZ~~6YAn8&{
zteL0KCrNCA2J-mUXnJzC&4EZ&E$RL|C&Aw5S<&+I%Hs@vE7X8PJ#iu5>}7>QRs7C{
zUPhvj`oW_BX?M^Yaf>MI@Bq{iVzOFhrHZguTPY5`-}2g3ER%ENuHAib<fT_%Ur<J5
z0~e`Vv!Ev!>aJ?nG2RsevyJn}i}CwCe|SapGH5mG)A~amVCCj0j@pFT^oMhsiup<@
zkDwxZwy4fCWm_p6h%P88Z*wt^s^HO`vgRQ~B^iRPMRaz$Zc>BzTVo2iPc|A=B#?=&
zQebb0{P;>8<84?f8UnZ4O$^*NNWd`<jl#eZ_PJGVLe%pdxIw?c=x;32NEWdRG$DWb
zfHxMnxX4k1JYoZ$hN%L|a$i)OnGts@9z$TjTev_X8Maea4?-XpeR_Kum^MyfICBPG
z0vRlNO)^+eC}!{FUE+Y)GkJuA>LyxmA+lOLg?_>*do8+ZW*(vGdY;T{yZ$g@t2Ev#
z<y-SJUc^U@gLXi$p$8nFZP!aGAVh)2AwP#Z!)^Xg^lDrX{oaIq^?>w;+k@<qb(-Q2
z6mE4_TlEpdG5ul}2gMW=ZyfEe*cTMr7!;FXf)5~6&#6i95kV{p-EUN*nh_OX_see%
zAfY@5R{XpWtfp0?fR~<sQShz=kUXn)#s_gpP^4C=qq}X^@>Q!o4I3QLCPX?1J(~!8
z`3F9b5RMXO?1VBm1vN+v*j?|9;O+p|0-9YG6eKs1qyw5sLwzV~fJ}%3elZDWoeW@I
z7{KC|!#U>Brn_mZ?KH<GEA_E*rQNDjgI7Yt^5M!mTl{ytjNmOJs0a=pkC<Q>Fh7Bz
zSqqwvPC6hH1WTVtfRrM#$cY>yes=j5(H{2OxopD7B*>)x#`F3;AM#=J*x|_vgl1%*
zqcS*N%F$5u#(I^(Jv}78j&bE_Z~PF>i~7Um6KWi?k%RS&Oru^!7o|LTPPV8I^n;p`
z)oxF^8^p)ui56(s_zIW|_Ig!{7+8!S+%@o|FoA=qn_#MIqZ+oVSUL>sJ!%%rpS$y>
z2g^egnsx`_ut==<4RG6od8HFDDMu{0GU&3Q@?^a4;>a?-<!&>bN|8$7$M(CS>eU9^
zkJ8;3_<E(+9i4-*b!0NoUB_?SH;>rIT<48wrazH}2?1}OZ&W%~XSCQEA8;>LP4N@U
znD|4qyG1m)D4JQJc_~;X<au+j{)?Dm9be^-=)GiC04je;1eR@{Hf0)z(AXBqrLhjB
z?}(&}W$uixjMY!`cX%O+meVRBxx52eYXnwj{HC_MT^UXa8-ei>(CD0Tw`%Da*C0rI
z25Qov*fjZl?jUGG(I)x<np%kP!W*F3Jp>U!wlnUIBKUMFZ{d|{9=-zc2P}NTT|a}^
zI}J_QQo4pWSe%`m9hHXB&|(ZaIfjzX7z{JL;m;$G5Uy`d6+<vEu$2KPtNUohYE3Z=
za?R*{Dy_Z0u~OHD`{h@-8!0YN;jR1}O;HgQ$nkU9lX_~dY+|Z}M;7o|-3!?`fGY49
zAQOlnkO3;8o!i2JWN+>V^FTZsRbJ^XG*9Ag@WQp=4MKY5AGqroWZnyCx7|Vb8Z-eU
zY|sS%xre|0i66e>eLo!0G)Pk4zwzs?rZXz}zwhXxVUqt_+kWONtxB<qn7NK>ugd$@
zdb^39oqzr0eSh%jwu_l28s;I&LW6|zZg-uU)4|A(=Ab2<4!MG=uO#hzbLZ8adpkSr
z8Nhi%$9`Bo9QkO;M_WEl^9M+xCM-)G`~66=pTdKHxEm0~AaBmB&YJU1=MAW>2FDmt
zKT{R`0E)V+6fXSE8s<Gy*M1k}l9W)N<&4&;e}t*#5;T7<i!6qk=Bx^y!E6o|%UCY~
z2NoW!{kshQ1o|dw>Uy?PhB8yH?(pmOXQ_;y<*t$0w~qZ8WVR<wHy84hN&Qw<*!hKn
zOM^jR1u0uCb{5|T5#SDfkekN?*OQniUE4C@{?Tl@YDRm~eiD_~zlVo3h%qV;+kb!*
zwBhskPzKfzo2+3j5~y<QFA=D}zynCzU&bepwf_j80Q4vF@m2Zwntc2jf3)py;M4vl
z9>C|_^nC$*!scJcC!8br{E)$B$LBW|#%D*+OBtbVO2e#68Nu-<i^TCg3*&gP=K$X8
ztx_=Vk~Iw)n%#>DrfXL&j=S$&7}G5zXNKk;XecJ+3vN3Wi5nTO1tiaRQ#6eHRKa6d
z$0M`4iduY{WuxupstpVgsKW}(6I%$;U{X8L9TIq(rIy6XX4xRN*-U#P5}Rq8(ZuAX
z>P^_*iOpI!*~Ypd34HsOE@BwixD8QgJden5txK_BnHD?(WkI)iadntEbGm8Hl)Jnv
z$PD=%dADM0qjVb@W{>@cL<Y7^$92y1VVkIXk)Z{8_%%SK-K=z^YsksSj_qlASd5q(
z!d9w$Zt5x(qy#bv#KR2Hel|XmO!iLu)-E~rv2GdT-7<u<-F0!jmL>Sr04!Yx&?k}I
z4a24Iph5K;528M)*-l-v0#WoqOlJgv#R9%62r?yxwB*d##MbdXFO1{BVG4N?v0TCB
z*HX8tUzThhZoyj9DkBLiVL6tVt$-_UNL_i1D{fX0zk(N+l^tu2oAVUr*0|s$O3fcn
zjeNhvUptJ+E~-67^Z$^#&KS)<oE5~f(|quDtjXf&ghursS?K=fsT<HQ-G_$Jg$V{R
z%6~0&tue}fB`b(!r~JA*{bfKA!=vR0{ePai8U50K{jkI+X*p7Y!TBGlD~_??pR$5j
zb{1SYu4X?BvtBZ2@qcTiQdh%{2FRi5#Db-TRadWCt}fdc_GW8FfbR&ccp-d88XV0d
zd}A7PWol$%?7KWGh-GKr6+XwPA0OecQa9!;P*zxXEOk@+)v~7z``qF_o^kEPxZ6{s
z5@X!0SwSp2<2FxV)qb;5G>+3k7!#8Wnxe(Cg*|ra2KCFHEyI{`C5%R}u1heAsnT@n
z+G89kWd#xCh?P1b<Z9zkp{ERf(!;U?bZ*IN+h5P5kl}W>(N|Z0e`nUwmlk3R%bfj}
z{<!wNshN~4WfTiUw2{|gXyaNtaOdBhx~`Z^{aYbqHyU;y!Dc4n))Q^aSUcQj-fLlH
z9RjFfTDnOEMB;uwb$k1yt-Ea)JKKO2_l#I-!dS(0_|vKDkJ0;6S?QfsW;Y)$Vi7DY
zmobi2tZJ0l@oXXWU#4zqzogzWY<d`tz-uIoVub!~>e^$3{#I5Hfpz+Z@M@`JIGbKT
z%bmM1B$g}u7+k$HZeh%<xSNN0`8DwA%8u2kE03{bAS;L{J2Lb))L94>Mf);<2(b9X
z@(9JyeYC(2TPY*PFqAG$xG6Ou`&G=`u;b$p)5vF}t~MqD`?G>re&Qcfo9&{+57LGB
z52kKH|HSt;{3V#f7pJZ^M*J6M1ra5F2IUF#PrQu`AObAjk=3p%myzc*ySY2d;4+41
zLBnp2{rA4h_?FbXNtP;V+CnblucfXlCQ5H$5NC1HW6SMWYQg<wvYIC3i@JU+bz}P^
zth;p>+dl}WksfOMk<``4X#JtAAOeN?O<~tkdoi2u!3<nwu3Nw)o-Hi-dg=!C%aSd_
zSce9TdWA*4n!5HFNB%e~h-K%<raQ4|X3hxutgyLpW4XeQe@@+;e)+L^7z^*gjvfl~
zlhl>R*zx16AeNmSyf(`?T*pp)wN_H&M?6~?VysyjM?cmXxLag?&<tUu$QeWwu1H;b
zj3bw31+nZLxeR@AwNk9Kc#)KGXB~SEu)JCplxocBSyK3PBy}_URh-L*ErsU@2Yaz3
zFN9}|WrtHE5@Xq+tRR-1Wm}KaK^{F;ASD$L29;Acs$T|e8|EdYBfVEZSgGre@nteA
zh-K%?rrSV*Q^w)uv^qdXQ=eF_aKugBoPIg7d6;+Aj$k*Y!Y8ICXHr)lW5;W<f>?HT
ztiRn`K^~h8(X)gRA5Ptnei^X=)A4F8J7E&z!Ut2=9OJ@MSwSp27htBa3yB6Q-UJm*
zEILN3VZ2aIMbfln;o`!rucU5pzudYCi?{^i5pM#EdK_n@)fiFdIK?>lN2#%iaqvr7
zK}0#2A&?NnB4ikw0Yrd>o7MSLu?SundiG)wUDiE^h0?wNGjbw!8`dt3BT9{2C@PUl
zT~|z~)-s5*7?l`2%KI|0IWJ5=H%JyT?n&LWWbKWS(H$B_xE4D@fk8}5ccrd1M$l`s
zf(Z0uSa`D3p@(%?bcO}X6^FK~X~frZg#P!WZbrZKUr$TVd^}<-xGQzVF%~>8D~M%h
z!B$%JYL$$xoJcAl3~8lqRKE<_HcV?@t<p$OzC4_|{up2CSwSp2Usk=uYBqG8kR+k~
z+fpOmFYQ+kKSDLfwBRkNYm8C**Rq0Gc4}krIbEUgX}6t5Nd<%xzn!{K{c?gvr;L>f
zgz~1|7+?OM)b+>s^6{)7mYpw~Wq;pc9F$bXK0};itMwA`Y~jgwQa7kyo@^P$rduoz
zL#O3o6ywNWq^>>2kw4E0V%a&e?M`gn!3Lx5s*+ej__7KoG%m$1mbeSG9WiRbtEaN8
zNR2>@H9tRZSu=Q~a=OB2U294bBnuOErlvu^$}u!t@-T=g#WksGjZyyUtRR+MDF*Lt
z;3O8r3v}}oBn#z_r*1(1ly7<%#3+Af>RMxzKb93ll=2w{>A^T(28J0x1X!%fs=R8P
z&-*^l-Z;Pe#^JDr+Z+9%{;N|nDp|s)oeK^1UzxhDm|VS#L3ADJ+egqa?5~%L61weF
z?SD^va0mdmZ!NYv@j+`RJ3A-z15aLq<1w_e9Vj7uhzk8qK1YRe;-@)Ks=uT8H8{?H
zy*gpRJKAoi{aYZ0{ULgMm>wUc$H(aLaXfI10*=U4hwrY&Aq6HM*WGcui-@~wy4sk;
z5gcpEl@hiX;oAmPsh=>2Xdw>V#8DgL;J0jqmXmLA8n-zc5Qu+zmD;}zjD(p1cW@>O
zUzE^sZ%TEGg}N1kFHLY)VI_uz6G6mYzJsdCa_T`~Gep7`WiuXI3>G+hfp>_XJ)4oR
zlV39ym;1)zFH<)x*;r5m7cv&#O<h;aSbU2?bTt;;7r19#aJ_+o{&coTqds4Y#HS*8
zBCjil(#mU}1a&v69l;(hia5b^{{^Y5j?wpLSy>cxuRj$QEp?c1aKf79>5Pbb<tGdI
zuS-pXe#t*Hj58bsgBazXp1Rf;<*&*LB1-uTb}lfLqF)(61Xz3{s|YFgiVq7pd#2Lw
zkTnCj+c%Jf2w(Of2dD0g%Ew;$*e@S9@JF&hQL~Z_<n!>B2=B?%bty4A>VtR*gE)%@
z@{&8SSC}rl;n0~JHfK!mH6~$-x;@HC<6oA#@qH57y>z%7!f^!0`s1pV5!#03&uIrd
zcq}y<F&@lk1@Ro8ji-f;-Hd4F?OGcZgYK-&;5vawe-_OYzPu-OYx?EOreVd3io!-w
zGGNA&sq2n0<DEjuZU$xPJ%;r{TWn{g!|gR4(6fZRpH1Dwe#yIGSm=svtb|F7xWAXW
z<`{8*Co70R(myHu=_ct}{kDyFR45i>Bnx^ZQ#kQgsT<QTCpN(V5jG=T1^xS}>yGi_
zds#s&J1;JNzIWuY(aZdFFDCq1pVK|-CF_aZONRYJnZ4ejE2oB1V-e%jnyetAoC^H3
zg=wL%xY_Sw#4u(65n!=EFO^w$?`c*}<H&h~mnBAQ=*CE<$i^+HN!q{e;zBXPMsCPU
zu%pjPU3W|(Zp;dzZ(d~g7$$I00oDeH=0=$j$rNT3Qn#jmX5a{YV577&ff*-L*BxWV
zOBlpibfGt+laiI}iM>@kTgd#1)J^S|%v;EFV2rx=ST9XodyLSJW(5&Q{haV>slA6C
zIKh+dHJJ7~tb_qgmombe_oZ%Hzr49{xTbLPx~eV%ncql_LX1K0$_gUNpbWiC&{2s#
zW&jaju|P+a**NaF2PbV}O#)7fd8C_->{3SL<g2ME+`pXADWE=X-7V%Hr$!+rCtqd|
zXVGGAp#=!dDO_8b+%F~M3%!4wy0QJzdn+$KV4S+s`oE{HK1S>RKP!kp8~#SvwbVxQ
z3hBMbYMOQI$I>~ZkAxQ}E6lod-EuknPg6r<8k3oI9Gj+aRh)~Dl`l$-N{n&avw~Q5
z#_b4rg`Fq3&IWfAL_-%{$_S$lrEXfkT6JMatFRZv$4yZ;h!j0LH3~5X-INu?vNP!E
zq0Nn?T}D#3qbpc{uL%1lQ#ZU{_FV(^`P&^y*G7^$rMSA~Q)3k4=7U*5EIT(ZJIs@b
zxKTc4BqPJCo+X8MuSwm^etCEKu<79$Gmr@buUDl;B*wCrX9cnBEW0YqGGCw@^=?}x
z`zSB$dn$F4`(@wN8v8;x$G24mR`mU;(TOqfy;(slI}@)AF_9-6^gZJd-CMA<Fz`#M
zo7*n~jW7clU#MY-j|n>XA5$X}W8deqf>?I;U3CwxWFhDBL>cQGr_0{Z-0uq`4D6%4
zu<-9wH@ROHUOhY`IFI1|L&Dh`virSY0u%o>H99dS{<o|kqD;&%=nls1GAhgfBEUk%
z?HND>SjdEU1`q)jFUmTzLRhpX+wLZ;Ud&^a9qzP}#fEf!58Z+^KE#Kfj<4YhM#gh|
zy9hpLY2x?_UNttpk}nk*-_~|<GhH!!Q7CQ?<0M?VEKB(4{t|byS}KVvGK<wVU9I$Z
zhXG=R;{xjo9d|P?MZ{%)xaEruDK62iWc(KHnPVt#<mHLMFIuM<{GtVm!7p0582q9o
zjQ+2-yMb0FqNXBUrpdQRZSfW&YN<K7ERAoM0y6H3BHxs@uGwhdder&aByJ?N=V^7t
zn)~FJcZC$IH?BByDwA}$)8Wa+X$wm*z2CQ4xO^19SM!<Y_<}pM{G0Re6SuVS9ecR0
z@$*1^!rfGH?zO^Y&bUMQ(7jadhCI1Uw+A;>(Uo~}-8^$)me_hh+a1D9vFcVlYSCKt
zlNjX{8N|URa+C=%KvMCZN@PZF@P5&aY?RV=SK^*h=Gb%BV@=6psLs9v-*kf5$B{H)
z-$hSc;7SM2-`%`>1})x*`(|*>cgtd%%GbkrDL5MfzwNvE)qD8KM6sWb?`Q0L@x-c_
z6a0boj&vJUs5PtQ+P+Xz{B^gKMyi0f=`>4x&{;S5p#2^AAXUHztuMp}t)jtwTWxm$
z7o5|pFGP(H`n9r>K%??1zVt6tXhYd_^0doVu154~KEoBC;d;+-wP(22GhFEzuJcUW
z=gh#&e5hvoQAWVeT}k%_26YDMba5ck-F3L+aXPr4-fO^`syS)lj0Gw(IBnI1VD=jU
z9k-utP}dg9<#!!-Oa6qqj2!#Ha98BqJQhapwBLl%?k3#w{m8t3Te*cC|EfZ|QN2z_
zTH~IwJ8^y7T&IOgPVBefJ^R<`@m6}g4UgA$UelSx&9{Rftl$F7=c)gaU%1HZ%_z1r
z@~*pH=8521b%Xw72>KewqNPI}``;n48_0F{aUl$Pr>#VM-yedgAsI#4-F6S(#Ot{Z
zf+V%lJ4;{PKotCT2fb?nIw-dz<bmO)M^ETjL?W50tH;H5{SC!m3-!eT(O7ux3j%Xr
ziNI?*_P<3l?RPPu@QWy>$cA4Zq+cKM@;*YpNU7|P;v2I6PfFm0bsy&hPnvOC9qz~#
z+kyM4N(~lWWo=edf@qm2XnBV_#J8Z*eN*~Me0SRsT<1qOcNm4j*zVoN?y*9lqwc!f
z8NK_<U3G%$(yqdjr0{YX$OGRk^(CO3X$3gldnX{iNbUa|jJSI+-MVz%dMGyw^5S&v
z3C0h>!u>9QyF=v2CET=S|0k+YZu;9PSN#q71kwXFp>)CZ+uU4%zgC?<A0c)wPGhNL
zjgVfe!6W1Un~{vJk3<;1z@h5*8p1HKm>2dpiAdCoj6Ww}Q+qNBnyz`<*D=*ahwdh`
zRBO~LWW#Z?3B<_c-Ugk+*SK@A<?h3v`({lLA2}?)Q5+5l4#d~;Nx#SZEdBH@ZHx)B
z{asp45x&texGN_t%2JM{dBX<C4PD>M+S1|eE%tUKCRb?>AuIVdvfl%0p&Yr5EsRTF
zH@965_*}nzA$=nyQU1;%b?%Zl;1I`GLWTNoS}RIs{dzQw)LfQHy(f;r(ll*X9B`;<
zYd!0*L1}NEkF$#C@TMta&Nztw*BkTr|A=l4W4YlbdK&#~pplMA?$BJVdb7h9X1jxQ
z)3eotPwcM7MZHD3nRw8<DHkqPu{l4}f^+R|ELWz>Rs3(|aU>V_7JL;M?$wnGGE@Vj
z8Z{&urBf?Gzj2wZ?{_=CqARVYt8TSiP0N*9ucZryVGue}V{g$T{`4<;Z;y&z>?XJ{
zYiusg(swd0BugWGFNp&VN#7>4?q-w-SqAs=sXf!i&BmkVp2^3Jom05g$lPTdJY+mz
zo-`(P!RuW#+*D5r?bK3e-$^Za9zDkKIAb5jGmtlX0zWaDk?Zd6p<-l}LT%h4Y}N^p
zAXuAdyGHm5J+Bk-WQz+Jp*!|Wy%SM5yqIucruLRBqJ968^{J?2dAHkzscds8uKU%5
z1@#n5ZK+=w2OJ{y#c0&G&{Ky5>VA6#Zlgv-YsN7eQ$|=p4cu^U;MQ@o&MP8tPy*IP
zAW%-D23#XgN;;Z564Gd67KbPpt+Hh}SgjB)XJ9~tn_20=H9vcrDjm%o#|}ZRx`jKS
zk!!ZNUa15X)*8S9$#s5n(!x?6jHspwSu+<xSE~X*LRou^S&ZW?gEk|^tIGLR;hGVg
z2?sB_f_oY*!!#JhC|O1g9IjJ$FxYPHF<@*BYtF<_+uD<(rcE`f2t^Qr-d(~WM4X#7
z4gDqU&o1pXW$gHd;Md|hvl#3Cb8>|vR_;<UIl6WxSofPEo<z=o=wd%FKIhrP*lo<=
z`y-yWk;_eU#=It1ZgwzX5_!GClb}yJ-(=Cf!c|@96*XR)V7yM0D~{4s1ci*&Y$L4u
z&K{U7Qp=`Mm@4qyM*i>V0(ALswMv#HC&ppYYRy_!-7j01F7&iX1k<-|Is5{|6P^LY
zYU6sb0@GlaGgyNu2Tqca2%7|$Nw#c-0&}_mcyxkm4)zV;*mM=kcmrKM0YK~6B69f1
z;PrxgjKaLMtnf%-)RP1?R^8P%d9;zHo8mp;)rWg%k&J*h@qToQa6+PSp-RMyUWw*<
z$jcCT#gvAVCy$>@Esx5zj3E$U4qfDHoHu9^qE+uk@`9JU_2l*^fN7|&byq^1B2Cnf
z81b6;<%~_Vzd&4I7lZiWwd#_ta;~?qN4WrKiq`hY(C;m6YgaQ5^_Ho$Os(jXXaBIY
zt+=A6-O*dOK-o;K?vr<e8`E|U$`MbN)O8_is<%<gS<V(+wzMsJR^}c-Z~r3T^g*q^
z(nkgEkl!8Y_G&eEQW|ES%^J;0w|^vuDQ2^BK|iQf=Y}(a*OuNY9nRXGWXZm^zph+w
zYrijLqQiW&FVYXp_4s;XY3Yz)o$Vh*d#!lK`A8JmM>I-#$WARSvMWZlT3q~InAFjr
zw~BTrhPIV4Od2!nmYSkthA4Cw(~W$;eKa5vq$h;g?0(}Q6f(#Wd-@NCtfpK2!oh3p
z-t+JX!{(x_`mY1yy6Lc)`c_;!m@j&59B?QiayyzA9aOvqg9>l(9=b!_phe5reogTJ
z8bV-1!Jar~{F`PGVFO25`l$*gj&pvpQETI+Nz1Sh9kH5lPK=}VX>8;!8&#`?_XrY>
zn*#vcZfY4j3x#~4uuFjDf_Q=t&@pP}JOPYB+Jl${#uk;DSv5+P=}K!)E)Ez2A|PR4
zaDo^OD!Wc9yRShZo8antqimi=AZG^P%xbP?Aqs?`h8nDRq2)b>!x5c%MhO?{5L#`D
z6QLl@j$_*j?q9}*95j3><#@be>~t*4D0q{x?5+7Xe#?QaxbwV_-xVFpJa#U*q8oy9
zi;7r=x5g#gk6YN$4t+ICmEM`J$ZL)AZ0M6&ZD`Pu6KdYz<HT}^vWB?3JXI_&mH)%i
zQhC!ZU9WWl#d5Q?4W=R@LDy;ZcoOuvrEOb_B<O70C#_-bxj~^1E{$X6Ask}3dSSb&
zv+&9V?66LU1xpLcf0kMR+*Q;!ble3ia97i1f+dvn7W(kj;IzWAg;mwPE*T`N<PKt{
zv{5}xM<lNBOw<6nny_EuQo_Q-kGf(R9lfJclkTVhHCdJducL)cTvk&LmqFFMH7Q)q
zKS5Gkd*EJlR3;~Q+9TAv>oU-_RG29CicQ`)?O#%}S4H4_ETaMP<3fX<GT_*x=krK5
z4E)jOKJUwQ^o6FCtY)4vaucc)eeS1B`f?o=lT!3kZ}?II4%5mrgd0J!vm83tC>fPd
zT7R?OpO$xbs7Zf04`XDui8wU`t;;H$$P$4k6i<f&2~84Y<}~QROH30ccGrcaGCGEd
zWG-ePL!N&BW0+mhG0cK?Da?MGU*~bn0aBXfnCaac2OJvLya26@jBDH)O-uyii4fg2
zU*Ax^zC%8|^0+ausADSDoX>@Qe411VoP0G$QIbgseWvql*R3(*Hs5aD8mF1>F=rTL
zCXL!(Bs!pT$1~<@asLS|tkg}p`wzsJmN|)uBAQE@HHsM7VIU<7eCfoN$$6vMmU-_&
zvD}y$EjtAaLJ=ay+!vh*c5@CZj;$P~(5+@YSDDJGlWs7<$~y;gvc5Ivv?tX!f1`9x
zorQ^4%;}nmj|PlDYo4aF>p5C>k&`({j8=0vOazC`<xD3h$6x_Iu9B_FM^iqi?iv>L
zowjoR=9nA}o@F;OHUZ4mbCZ!N%U@6$gay^>H12_vX6-cmepU%uk~Bv9-j*kxYg$+n
zW<{lQ!|14y_ngE)t@}Tw+x~0x>b!heVdvE&3r5?$aRhQd!TTW}H{|;KT+a!u@YVuQ
z!NTt_z3qp6!_Y`ga%qaafj~qi`)8#=RfZY$W$r(Y=n|%>wLei?Nm2^y{eV96*%<uW
zS0~B!G*y0ylEPAGf1;+6#JcL`LYuv>^eM{kr}%b)Q`oiy8Z4zMQ+{dm6l4X|Z!s`_
zrf&@-g{=yi0KWjfh*^;ohSgNL$~Jjrl~wb8l5x@;x?fV4Z1z%8H>@z8fqFc(wj?hI
zS%obU;NOC41T}?<y0kmVr#;YN`(k+`u&aTg@5Ry<ipXNX=yF%(%i7nGI<w!Vci@^6
z>t2Fups`3bSjkYzPtNlY1bZ%Q-mzf<kmFvISP+9(6r=4NHWy29)qYiX)x<YYezxN|
zW!GU)ho0JOAzI4*8C0v%MBnT*5VJ-9iwg*4NgjL(oV5lWw~E;GhNTyw7dcuj{vE9i
zMmhA~ez~gYwEQrvERlFaKe&DG<!?W0*o8&ZeuvM&x6`+!^SqOsy_Y4)it0_vrZy4}
zby|_d{<wESaWTXoM>A_(if9f0px^M{#J6<*gX+w9(j?NEy-J$+0fs3di8U==7pXh3
zq4ueGM59WR2VF{~n9*?ui;e1RrPL~S#&-q&jX)RdKB=(7N0OhAv9c|SEMEjzy&mk=
zz;>&$WtO@%k7=;7iA|~9q<~AT#$cdH8~zf}jt<}kJwefhBS_W+;s-w3f63%oq5;lp
zgcRS+2-8(f7AW6jDE4>o(H8|a91a^doeYsYjTS#g1ybWbXT;l1(tkyZpJavkPd-{g
zh-lyDb!W5%H@YcGX#&fbH0^5{(eOlBpm@3@GCtWTbra8>_BT*r65Dq6&(O7n!oh=w
zLemP7c`N(+&EQ;kGI=G+Yr$I2D;Yt_OlB{bw%U~yM3QhkA@sa9E6hMRh8aZvL|xsa
z4L-Vds5DJ0#sOE5yfZ73JsN&2E6ixa(`$u&q2Drtu~-UGT~jDL7}^ONn_-RS^Lo;O
z2geeHwU(7Qfv{Gxf=J@o>qHKwvce2_RuqEwZPNP{Ru^yu$=78?vPZ*Tn-ylX;pdOA
zjy>4jthx|ZEnkFn?7>7~{ZLlo1j71MRuD-%b43o`pA}}nv-dKHrMIkq2)Kgef6R(x
zkA{CfE6ixa&l6$2f}8+sd?*yIl8=M_PyF`!v7Jd4mkN3XWOzDo@L-}4|7}*H1w#Bo
z2BG#Q7+Njv3PVj8t3nY!h7^t(7s2(aWLyWfEZUXnfvdd&;6*ySAj@7^3|n|!$>?rB
z_vl^~7lf5a(|F`Liq|d`x*60bNvmHky!flE0vc%b_eDVa?t3@UY+evA(qpM^ELU?L
zkNQG%dsce(AjYj(VMd9Ofk(^XJU+8fz$gb6?iP7Mx$xr<K5ziYEl-zU@^Q;S^^-n5
zdl5H&SkM<9H*p8PB6(yqot2n@=_@jbMAH{CC#qD`_5oEi+iQvfa!aCa&YxpcVWw}1
z8NPvAk`2kPoO@(Rf^@<T97;y^olA^tPUD}uBB%PlE;2xb4au|Wt8aO_2F0_`A6{Zy
z^}c#xfd#UM;>aFKM)ou37+G}IY%+8)Sc$Ym+J5ESqkAZ9*+ddnA}tZ!A1oER89IWb
z{^^a<Sr@XR74%Oh8AShMk63rCg~ejIT4%j_tLO2p#J5aQvL3{^AS=u$F*5LIIXY{o
z|6`AZ>}sSxv#%j)hGUWgk3E(syw_zVOwjQTX9bbOuQ!YE8d+fm{JMfc^e?>qMtP0`
zt{{1PRwR2g{MM{6qYXb#1Qm|eLp|iwB4UQ+bj3r7Vmh6bEP<F7vw}$C)?1W~%?dN%
z)=37@znHG7T2qn0xg=@U^woeWD84EyianbB@~kkU%|1_r6xQ_GYkNrP`-qxhDIK`>
z+C(vZe^$Z-V)~w}Ad>j?R*``xv%(Dc^-c!SznJ!GP5%IJ1<Bvfie!(5e>yA7Xv5DF
zL4`FP?jfh&Ct`->bj5I@nEuzSWC_IdzhniG#I3iB1bine%z#^e!624iOjmF7#B?RT
zEtz+!8h$}mn9+uxCt`XH2B#{PB*COZ{!j0BXzUsf9MRx57C9O?lpH#`E-Uc@VIF1>
z3x$qUsfephVe?yJv7>=ol7mOjI>*RjB+k5ujKq<aXeh?dJ-WBViMtYMiRhj@_vjvq
zM`czbEfL+uQlXnc?UT&#JH!kdS<wot(G?7$e>2>lQ~P>A6%^g9DE4UfnXE9Q&CbA$
z<p>e1D-^Ehp#4bTF~m(RJPMT3&B2Q66UFtzSqT&v+TUUj3mIBfDr#tfYN#m+$Veip
zpIItYGw?D=#NH`l`|q=&6^Pis6AJb{f7YL7eHTy##cyXtu}8DNnH6TV*%`R89GZ1y
zp|G1Z3u~<~MFwvN&oOv3^rNR^0};lX5pCO@D8ehZXY?}zZTlCI6`6PII>DeyC1_iC
zDVYFCUMaTY+@lH}M5uaAB2}+D$Ed<tBtg+}9T-dY51w`IkqwKpSloeYl93%>Dr7S#
zd6MmUm)Ns^UcBx3iKx*Mn_L_85){i>Dc7UfR#upS$(3ej;Kp*8T<Fb1z2eBPBWi{t
z9|I312a?^agbB>*6Inqd@$20p1Fy~sGvL=N8ASg+cfS$3rvO)w{6JPDdo=ugSz$&S
zex3;GWrf16a0K89+^RmWV!z-je0Wwr(F;duFJHN~w<h*r|0yfM0s;O!gHYz&&>aJJ
z013iwRV?ZlKozNJI<f<|CS&{U<;B+i7U1{979LlK@`|!oB~te9mKIkmx74O&f+daJ
z2^*FY#h<H^kzKiC(e9z3kwI^g)cHNag+Itj!$6%s!yx*%WBrYAt_HmXMI$TadNlir
ztT3a^&cKc3=x(>|Y}d`^{4SU=47u@qX`t}x)b>HIh$iK3kSx@`l_?Wj7Y()ScPxKr
zR@w#zPa(0uK&U&aq1G!4@=~qU-lDJv`bG6E7yQlz{D&=ba)FrI$Qi{sgFGaO>HCBk
z2m8e@idG<|Hw!=ec82@)G9Ce3L2@oDl06#U&I&Wy@C^Kj>SuZo*!{?x9ECoz`!Nj^
zcNMlLJDu?XwIS2n9WC%=-*gln9a(ULe+*ZTgMon@9Sfv<hJ-T-f+L?M;%95wKg97U
z(Id6|WApgP0Ponm;6MPNwU}eJUf|~Z3m()Fd;OofbyxJ%tt<R<VNcNYPgU!*RW-a_
z(E26eHowegH++o5ed%`o2WJU?Bn~)W!1z-M2RQ`i#Ht&daq{kIvstllGy|O@?4REt
z7a!5xK{#i)Hq(~-m2idvj$p#+P`FOnYF3H{op|EN3A?yUiBIR9n&<mN99+`Gr~Em%
z7MIR=a3be6oLf{hZ|(Pqj?Ajxi&J!|PvrV7sY&M@SoQv{yO(1JG=zlD=a}xIZ%-_u
zHTo-lqyHG+GR<-)9nkQ9Nb|nTFzrutZPf2}$;o&)!ur_Z2;UJ5mbjjs-Rk+%ZtYou
zUFpGz3R>7BNY)rTaG@v77vNha#wPWy9~H*_EUT~tz3WefGkv=iYwwcNzI74zQ?<rl
z;y3=HWoZ2NtT3aEkM_U|pR5qtL;jChS#SmRV+j|Pa$Jdo<P#H?Kx*Okhi4ljp#}Rk
z;#4?_*JUR1NLHGM-0Q3$lJwwXLcxPsVFsdbGlS@V@H=?8RN~8tbwvo0HBFcVbV0R{
z71bWiKbaL~wE2tDgl7r`mqu8_W7MdyzLJQk32X9P^uNhUmOxlvo)ttAw>~Zs@OW03
z0k<Au5d915y8GIbIABxVof{^dmZOR6Z=eoA_{ppY_aMSMv%-uL;rtQV@ceRAWIsd1
z4AXr@^4#-hvyvqc*-vK$k;JY4TO{C9Sz!j;`UHdMUt~Al)vmU1KVqfGm&xi@Hkzpk
z?)OlWp#7b!X!jt+Uu1<DCB^w8xZ%|XQNbO!C@Q$gD-l+qTqf@}5Znv0f=J@lCqx2%
zws>y+ltJ__xPwP<xT3?Cl!p~QNY;e)YN9WXc8z6d{uNna2Er=MKTm{}7IE~NjJ}Pi
z8K(NcSn_1_k*tIX#P!y!Ad<xOw?zgHW`!B>>t+Vgzqk(HZdGu-?KJL$60xOgpJ;g%
zZs5kfQzfH4v&%ESY64<w{1q)I?<N(H1{MUnh?Q|MItd%0UQ3=TSxFRdP9edytk>EZ
zR!vvW3ge$a8+tJPWY!i%nVtcyAVj{T-upGdq*ZhR%KmjUSJTlI$qUBbmX$04qdQqa
zBysC^L;~KF6=uM#*E5LzRdnrLjZ(YXjvV{yr-p^r{y1O@q94nOXphE!BrD8l<IfXO
zMSpTlum0puiJDq}a!qo7^7X8Q354}4SwST6>(e3wf0Pwwz^^Yci2jB3Dz9_kliu5o
zu~VijEMvw*#H2p$_a-u-+edj#z<&&Uq;WsW+PEGB`@5_#qXavD1ia_!y$dgn3V4^*
zdl#eNBK`aASwST6>oXz)Te89o__dKi^e^BWkIv2DX!?4Kj!|#aJ>N*AIhv`7?v1EP
z(7qun+C50IFDuL_Db5qo#fG`+^!^@>#0!a>VdK0K<uymtTOD$LR?-C4`9xL_NgVsE
zNWt^7!VEYz!65n<-b+2}Ty0EarnyzF89OIU$1?Uu%yO@Snoyqx2GX2X*5>pe(Zg9`
zMoDy@2sK@uPN&uP5bIwjf`-L<wVZDsrn)ECZ_7%aK(ISmK_qeQb0P_E$_g{!+Upra
z|AKwhZIu@8vjAz0omk_5JC3mgf-T6-`t|#E;TmJlP^&@g_M{gy>)|FBktTjj@QV&)
z*N3b0YLu>F5Y~xt(JJvc`KhcV3plAzlEL#Xtrm9$nlH;=xSkB!(1YC{$%=cF-5JnY
zjsYxso|-w=Lq-1@4c1h2CCY0A_t^U1vXUlX>tAIBk;Jjjixhl6E6jjn-(wK{E9lz0
z%(+UfUDK7qPYqi)J9mlKrwrm-CbzRk<5y>e8EyP|B(9Zu4{_a1<P7&HD{GZ{qPXtK
zN}51icV-2V#IY}mxL%VLX27wl8AKX!t<;mmRi$d;`aHlEMDNIoXphDp%?dNx_$3h6
z3?SZy^)W&mS>}=kL}dA_{iF{|R<uQ7(bCyx^s{u<{(uijU-}oht}kKTtb2vGEOvy}
zTgtN2(8bcxCAEHWUY@B|sRj!L7q_66R+aX@g7)F)3fj#RYUSwh3a%0~u~J!+Yc9`T
z!z)O_mt)cFOXGk;i)O!+uxR!N9?t4|Vux;?r3+DKF`Q{xb-I{#vO;?(aOZuoWmfm#
z?%86cMqe7uT-lm4)o%j_T=Niq)Sz3-co>9bw<hjPWoj6>KDA`wE3Bnlvs!66bPX4-
zGrSomGw+?mED2q6>s5!OhDuU3*VQsyxTEqOmCyP3(7m~M39bgi3E}21&sE;)YtNHb
zYXah)H&}^*d3{`%{Pn`oX$U$zh#085BLjOUwHA7A+*`BS;Gkb5<RH%Moo~>@Myt_{
z<YjCb<S^Q@hE|W)vZt1|Wn<j3{-s~T$xZ!sM(TupduGVM-emXvQ%g&oEpasu8(cRb
zf8iEJJHb9yuO@jL|5<9%4Kf6_|NC{fADuI6GgaAW;8|x~3X_Y3X<&Z?Bo|cvEGzMo
z?%n;W!2DB&8NGMc{r~nq;|A~ESpRcu%s3)Fhu0(I_9m1|DmJ-K{`UI73>3SKyQKhF
z<G?d-3<~f!l)9Tbt)S4{v7?bP1nQ1ZH>OCP+dDU9^;cA9$}d{u!{X+d!T*|C){<|n
zU0ZC<&$JrVJ}$1+Br>YR<jLL`c(U4+wb~A>g)ghsHCnr@Htt^C|9sp)9rHEfE)~3<
zkhkJ{QbyBquxt-LSZ)&WIDfYhZD%qK_)YMms#blPqI8u}Yjh9oPMSB$=4sq<4{sXY
z&;#|8;tu7UMhyw|!Y=X8)O#_fjCMe=??&E~+72~oHFK!4RGB814d_$4(v#7sR^xu$
zCN8}_Z8fV6_=Y99@78J1OMJyWIfA%&+G;j|{#3J3!!E3P3-@vp<k@niSPsLd(rw2o
zjT)Xk^zTJi&fKHtkidF}drmPCi~KKS@4E~wVon<(b1Waa0b7YQtzDj04_=xvdK9>A
zgr4WN<*54>vDB(_!x??F>JuBZjUMhw2)W*(70Kb5%d)oT3#c(b%xlkQ{uj`!urYW4
zS7=bcrfymh?JF`meBYLu^zI>*!*}s<6*dSi7?(Y$x-fSy7G|FPEC{!t^vtYcp5*v_
zUtr$AFr$v&{hQF;?Va4WcVEa;BOeMb*3HHPH=Nvq@B571w8a*E3Uy=Br{wlF_U%6q
z@fqc%ef#OH1Boxqb$#hZdg+FwmvT|ueEc3YA0IV#Dkc~xX6`Z$9x}`vm5BZUIny|3
z+=-5Bnp)B{U^UTuS?K%f#-W31@@(H;jd{N$Py&I%V(WD^M^nq}q8&(0vZF?U9LQ&$
z3kUL|BnOg0bO<jt!f`qiv9v~YzTT)+kY!BHa|Dl8BAcO%oHd8YnM3R8*^fgsjyJLw
z<_ZATnzaz|GwZZhzD}>=L}*;j!uH5Ciq(cAiH{vB6h?DNZdZUpf)k6#Uc`wNCp3rk
zKSr$q&B4xmaV|^Nbkl+tImNDE0Cm*p>IN2L_$)n{bU)>+)F}4$Bw6!rZe82~nu|I>
z$?=$})LN!?hzAZ3A?7(i+ml2{Cs}flKH3;v8Gv{riKb><-GN(@?*^LB+Rngn4YzYs
zL?QGh#&WZ@j&v;2y2lP_HF>tuUE0>Y@;uP&aF^ho4+t&H!)T9@(T)6Dsc8{z<hFbK
zZonI(N0z!LmI#yFehMNbh<qTca3wj9KN6VlW0+Cr(S5}&j~R0hJ#?dSJ$>9DAN%EF
zA3pXOj~(({$!Eg9^VcPb$B7VOP9UgP574Xpj_$mPU-^s(1aew+eLD~E2{Xl0_m8LM
z$f8{%jc-vwC)envbKx3&60Xth5+4+A$Z5~aG@6J|O{u-vLEx8SNaVZ7+@i5lO&`jn
z)vi4`o?;0nW5#EfKh<gM#LT0-f<y|8g`;%=um)yAcI9M915f2}0wPAO?X)=HWg^;T
z!owO>4i<SUjTu@4ZC0!EIS%5%8-l~e%cBABgcq7qZjqOzO@GN`Q7($4iq;|W<{10A
z2^7QgAt1G8Hc!$1G^P_}I`g&3Mim&&khkZ>?vrU70>#0@eS3vY8XSw@bc^CWXOXPb
zx<+@=(8N-GiR@rEw=2OV>3<6JYpJzZxn6-wLdbcp*Or(J>-0#-&)CAgr$YaFX<N8A
ztvc!iNdI~^`j83GyODuLvh)43rKQhUO2ea*C-vJIsDoXpuys0dR*Y(RczxXF%N8AJ
z4r|9d+2Eb823Dhhd!FN(jqm6|B7C3GTJ7<Dcxm~5`x10p8lLWwK+Hx%^qvtKS{iO1
z4R2gp8m<d>*<pXw)p8bYQ`B$FI6(TT)U=oZ(y_REs8e=ZQi*We?GqrfAaZY3awiOs
z?iyGjK<{Rtu@RE9Z|~@S1h7Z<TL;2p8jNTt5#jEAdmlQ0l?w;<j_!*Tpa}YnG&0&Z
zw(mw&WF{1G2aKIsnO%5c|3f$ElsP9DgemVyc_B5~7dr}yFefU`Gz@yyIT!}H|J&he
zHDRC;ord?jK&<Vg`E*QBVA%kz5^yN&iomRlo^l}vU#4lW=hzyZ#^QoP;a*<gX;uq`
zz`ZXNj$xv|MXL<VTBXWotuokM(N&j~vxcc=7~Qj2uc+@FS%-dy4cOxpkX6^VK`%pV
zkEa5!NUZ{~Ap{}n4Iy#?OSS6Ua7KpqVUL~?5WR7$IaRC5YguP$TedYpGQ&2-O)9W(
zOQRMbTZeX6PTBlekM^zg+Pa4Ow;|qfA1&e$rDdh$=@Fm6s-3%xqFKjkY%Cw5$sX*j
zMtmgEM&yuRtT<M69^r-i+E{tx#|dZ=Pt&rkVhgsyp_Sc5ic8QGXI%@Xc<aJ*T^2C`
z@{59ZqKn0O$&yzq1t-)wIXUb%q~HNfI$4OA_)VcRx(%F7U00LHQ6sY>kwlu9xn0T#
z%RiV#c{2$2#}_Z$grcXm|L}{+bWMMML20nCye^T6+R&$oa(|tAcz6wbe!6c;{CU`l
z9Lx?!B2ONKto18n<{IHuYibI%#=yKZ)IO))#rf^kHr6AyTi&)5c3of_Dz%v=))>Mr
zm?d)(M{c#qgxx{QFUWH7Vn;0M<ptEy1%uc2hox>a`h7{5^5rx}1c4FIL+>3|<hAO(
zp7HC8Hy(tVXFN`wO(tk6dsb^+m?ul5DBHRzO8?9L*S>%Q@OfPv{M0ZJ?H`kr@s6?|
zWtEGhQRs!L6@Mp^a&u&T<t2M3^Lz1!$G*K7N#>8?509gVb)0*Y3%9}(?SaeF#{3pN
zqSG51l>v8ErGz;_e+S~#I0fHKyg+1;tHxs$Z&oIB#517*5?>v-;DVDK*DK+9P7X?F
z3)z*c|6+fo>Lv6|ACu@?17ldM$4pM8IO5FLTiA~8lR;r1xtJtUxxH(@uxITn)9p!j
z*Eo%Kvxuu&z6lpuTIvp#8bx$G^;XB-SZrf$dA*fa#U|YKUJ8z8v^o>+pkuXKm=AP1
z?iPBlRjE3oSc;C-eDzYtUGqZfcAU<eJL&-WPlM_c?$ESV$G*;1qX`g0C9?&`6g>=n
ztdpAZ0DlTUv8b8w%eR|V{MyiJ6!Vj2@f77^DxNkHyIZFkjTU@#E0i<7!rkDY69o73
zb66W)>mX&L(`r^`@;LR28s`AsWs+i5El$bPKt5lrnhqRgs!qM&C#;9>jA_w4-{^wN
zb6m_VR{fu=-7VH!1+;>T-*&u0tKHQlYqC8JcpGQUCM^a-33RqKqzuv7*A}&?^Mt#x
zQpXJ{dEA21pyS9o?ohimHFDF4Q^EJk^~^lh{5P6;Eb=N<ttRM9s20JoO^tR-hq9WX
zblfW<IS~-{U9cMNMu8jP;Jtmho)LN3-Arw8K&UcER7IOQ&}6ed-8QE!P`rfS16IA`
zZo??4(JbXl7S_d;P)&s?y$1UhrqE1Kq*BVu{BWl{>~1vMtwugbatA69stu)fZ6@yv
z9tg_`706r@Q@+HyO`HPi)*WJhkTm01?NTE@S0j1aOtZF*l@GtkQc`T?>C91)&rSJK
z#i79x8ltdV>nQ~5jk_N0ai9fq?iK_`mCR37u<NV?E3<LNn#ucD3=ul(DTQWuS+?z8
zg<iNjD2?8sw0z5g&jr=!xPwR^xn}PTX#2+IR51dGQUXA4BtS#BfC<u!LuWeUgXPzq
zaW7=3mAYd!X<i&cMhz-K>ee;QS^p=rWV6_ze7Q1RuHrvrYE`vC;<(<y#C9wHa2vYj
z;LUCPTYl!N4Ge0LY`=}_zoJ++DKu;~MGZh<vKM)p8E?;Y&VXZ>U9YszQc=${U}~d?
zy)0mjr>|Q{gB_d?ua(<uVZn0=Dm0Jk%9hmvv>h1Rny2zs&8$@OILwdMWfF?zY3!4C
z2Ssb4Cg6CbUaCL_TltpRoVH*Ez??0p1ng_Uc!4w}Ys%?7-f_2Tsdcjkh)4#sDgVcU
z*HY1~X>^^H<F29Y*(CyDe-ySB87B3Dj=PqiNzP9DIw+z2bb7py?EHQ7co{t&qsPAi
zDEk$7xP!hG3w^am0MXt}j}Ou@0(6m<{Sj2gHQJBThL$;cTuBvNjz`-aqS`qO0?efT
z39fsB>z&{_C+ydu@C3u3VAvB3_X&nM!SE*9_MVj&TtGk=f9@q2|6M-*FQIRQzx_)3
z_A7)&j=rs+#}^4x#{RWbgt6z#!-!sXm72xa^T7y&z0H9hgED?fZ@huNak=+U^XV2d
z`(bJ?9m-(;guc->OZ!EbFScpjz5RK5&>||kNe&=Q7TDVfGCOSU2ES_o^O*Y^iWS+K
zPdX?mWTL!sB2M8HDF-2gUeO|uyjFC3B+)NDq!k<TYGwFaHTdXlnl0+yc0^&RoD19>
z3}_LDCPN)N<=yVu+tv3slQ2Gj=8or_S9k6uD`hrekRa&}?6y?q+t6^b{kx>)8=ZLv
zM#{?wI{D8c7tW|U*(DNv3o>|z^XMH2oHwaMH$)|kt4~?;v*;w8t0{^l(KqaIquaqs
z$&=h4MjO&OKFX=%{l@I}e=s!&ceQc@R=BH3fnX=^oH%wj^~E8d3dWNhrSZ0MuA(#p
z+U`1^#%!bL7={L%BN(I3MBr#*r1`l)(!$TvGgEVeJK<RCy85vDQCEa(?iajOMgH2b
zN!a{TbnhEGPu}>KrB0?qaCSDXp5W;cboQKv(<ye3d2=2_nFZcQSy^Jmhh3mEG%&wH
zVGRPP7H<(4L@aL8(D9-ib#%-KyP8d`m~Y}>LBwahv6b5NxIcZvw19$}1%Qk-|A<VD
z&IO;nu`PyJr%mMau$KcH2F8-F>-h83;;b|xSQJIbdC`rHIurHwM>Dgvjl?3-w%y4$
zI{eMjw(VM(tyxGI^)~nWQZ`zQ#c45?Op6Py$Y}YJ`TYE)SGI6~!d(XV3sX2c9M3kp
zG=78Bq+3oXNHnN3Ikp??OVM-TpJ`}D(%3zg!|H$_H!O5H?LGXM5Yx4LECxi^le1A_
zn2TPR>5|m4x7aY#_)T4SK(1qq&E#H2VlC{)E-t=9eWP!(sTY0{&JMi!cgx2YfJx}C
zJooZ@OdS5ytUJLf0lrF=hF|_>f}M8s^3GK!8l{HLW=Tq7#4}PeLK*wOAJ_*F>|VGB
z$I6%)9V_7w>0<d*Wz1<7$BMExe57WgGi{Dxq~?s>Yfar{*2j+eyWpJBrqk-McQSq`
z?m*ZFsEY7mf4xZ)Zm7J=e%g_&ZDm)F94PyCLWG>C@#ly*QRCzH5YsZ0eL=8pC59-;
zF-v<bjb4cVimZe5J5tplsjB}o(XLwqAYpQCK0)VD9H!}L_6;LvqH%d9(F4>z7SSC*
zBqWT1=iNUVe~)HqXsioyT<a5UF3K2`eGDe)+tRtMRvd7Moda>HbC0sIrAPwYY3w{`
zoUR~NgKmz`)i_<TW<57jxq;U?w3gr7*(t#g-(?i1>$z!Re(&XPPlT$;_$;-J$=8mz
z(sv8Z6gS^0aZHl@RZ^2qPmr&F!T99rh+u5F9jh8>XUMU3ov9rWP=0~i_nM_`Utq;v
z6$cy=kF{uDw6p%;6!vh0|Ij_t>I|bWRS=7fAu&Zrurs}|zmS{8KB)OndB6CyD&CsK
z{ub{Q=VpVp1Je$Y!h9izvt{P?%<uAF_g^lnmudH||1!4S)3S{jvx2Jm#fX3WuMGFF
zuzN1Vo58SjBiW2DL}2rWMDle}NwEG~NDLs(BU8RON1O@QD`JF;^q#%Z6)xIIkc9TH
zf!~g5;O2WM#yHpQs(CKY3izS8o-D?|1Pb_@alj!3+!9y7`>)1QtPx!W>5L23!8RS1
zX%t2hHF2bi;`V%L%Gf!wKTtrwCSTi00}&YJ=`Sen$bKxYAeFS>z|m?5ESA6okXdi#
zMk1DDVWjawAva>^@AdbZ<_Z3iW(&#(ky>+3JcIMevu|*=i^0)VBf;QomT9jZC-$lm
zbfyH)oi038-P_!dKK5^JRz@AtO?P58Y_3~(&&Ao={At`MERD7KlQ`gzwRu{CwYdY<
zhW0^+*Zg}Lh-=8z7%kd`?^j*;fkIAR-fcWXb>b;r#wLJg6mmPS-vz@J)Sm)CAxEa;
zdSlvuec_i$5ybz%TV#C*z(@)Juz>RZ2)`~Ej1UgGP5LEemyohauF`)w`<Ck}v0S>E
zC0MRan76IW^>CD=z>>L1q}lhA?)PuJ#-qmTG7MvJg)@%P;bHZib<A7%H)n<EZ}Y2c
z$bKHTH%nv4{zn{e$dDaDbEC5{yYHOB+RrJ>j&PKbj`hK@KQlP;Q7!cJ_oPIZY_7zc
zTG!}uim-a!(?C@Y9mEIju?Yz*wgdv28E{ujX|TO+cRS#w^YdfV5ri5D!E=T@F(`*I
zb!~N+hi*SFEKGq|gz--#<|pg85?75SjlGXaO*+%#os|nu@n+*u>`}Of#*@b5-Zyju
z2aQLpW+XniaPcrnJkE@y=FFl;V0UzBe^kbAm~XUc{{{9aU=bP3{jtF9fj^F8w-9K6
z@|wJbBN#MCrF}~bh9;kGLcU;kaG5mWSZaF5G=Wg_G~sCrP$SH8ccH=yw|t2-;I1wb
z5RJ}kgOLjq;GnVZfPobY;h<<@iEyJmInSr2`=aIi?&MZRY3N>tcq4a3a&HF~X@$C?
zXw1PcEP@{`yqM?%^)vnVsEufky7f3M0i!dFtFTuTZjA&0`3>$!AL*f783LR^{9!f@
zIMk882n~!HncD<wEV=NpR;NBA_BLyor!Wae2i9Qi2`xaOU@?UUgAlP32@Wp>z_0+@
zXQ)j~w%5j6w;2B;sc(9*)TGlf-Z$O9S`DP;=rqz3CvmVRAJ~acS_)&FKo4~je$2@*
z=^%z3{vQS{g%fH}LBUaqs?-gqh*2$3w?KY0fh_=TA(yL6;THm-b(~sdRp~-VuQH^E
z0TW!nqls4!9KKKpb++8VPPam33g8}`H%1QO&FhW%9&qLv4lO;3!ouo6tQMuY1j03P
zI^ZwK;*%vT!k!I&3*<MQ7r1B}{6Mli$87LcEFLneBVjWTO#P{K`cj52?eR^;f_nve
z2Vlq`^>1<C9JRQcWXaQE6|an#TQ1Ia<HJj9Hv)6}!8qWMxwR9_ZAoolr6pOkTONns
zV@}x*xzgR3IF4UM+&K!o2TR7FxneM?W^J-$hOMtrYVZ=lx&@FDsEzu72Qt*Ddx@DK
zh~#}LP9ooC$3|3Zq^Y`#Gf+t$Q++PAHpM(iLJmygG1c`P=IN8bVeNKPy}2+|qPm%C
zxlS<8Q<a)@5smj`?ypW656(%SAYGInRP$y4!*c>K`CL{afz&sl7ok7yp{PrtKkla<
zp>IC0aB$I^V4&$iFT4g&qobpd(e!zSTbS#fP5*XkDO|KoZzOXzDmU&XUVAm-Q#)qR
zrGRgI78_0{d)L1;|G%QveEsbW>`froB6i;$mt|A_(;ntzQJ(WZ#sP;+`CNi2f6)n8
zZ!%aUxFY}bg=8Pr8e3(sC8>>l$TWfvpOliT;Ubm_u46JLu|20)wwzJp7*0G;dyJ#j
zdlglqn`225DOh`Diip+4-O$x7?)IcMX()KozZtcs^Jro=m>S^O;Aby}Y+>zm7X@iy
z%0_i9qm6z<YSLvd!A8%Mrw^vg8`oeYaqytASLAK~elfKN4&-uOitH1U{20G`ApCAP
z;~Alh1Cqfu{F%C7oI^aq-1VeyS8C~7wC#O7nPX9Tz&6paF^dK<qPdHST99e#-|BuN
zYIPB>s5NK<t1+PtTcG&>xTXz5ZCwph-sbn&5+CVdcot=e561zAEb$ZFEU}#LfQ=(q
zx`uOZX$Prz)7~KxJTRvNBw&oqVv)AUh0dtWO*N|3#w@+%Eim*gu{elq@0X(%jllO&
z>zTmMkJG{ToHGzODcbQmsY$1Jg8dmNU}0-G>_`b=v^|Z?1Lt)8!J;+tSG%+!8tD22
zpXgC&6%41`Xje-t2DtgGj;nGcXcNS=WFFiToKx5{iTyRy4@0)7^R7>aZ@-wWARq>z
zqR^OsWC?9ZWw749AjD;y_S6)n+_3o?rypSqJ&jw;Fy1TD7NQ1i0_Opth!}vurDh1e
z9I6dFtGOi_{auwNv}p8@9Qzacnpk%wNTM@$MKW*aQu9{z^<SXnz%0^)7{rUmTOa*b
z$cM1VyZ;&+5U`=!EN8SQ%jns>sf$)dXE-h^v}lsgd_1@=3DFR_ElHQko+ZPK@odqX
zQp@Y2ZP8o0v^r{w99}?8M+V?5v{QbEL$O;~a1B#2Z8rHdc8ng(8JZvADFrezunV~Y
zj1%s?Dj+mpskJJntvxuXh%JUWNrxG!e$Kmk+jOEv<nW?V&<)TMz!T!VJB{%g^yr|=
z${L}LhM^}GPo)-%m>DA!Ju|jD1qZ@X>ZW;dVahC#+P=Mu07un!Sc%`Gt;hRR-@e`m
z6UgJ&@2BS1qSg3+??Q#B8qeNIJwE%D806Dz3A}*B`$)0H5-N?Y^K|4Ozo49k9PMSV
zLA7bY@4Qhg<2Vl7r!|F(wlK$!(tB`1Vw>{{>V~+2KjEhQf!bL`LsKgEEY~fJ`I9sz
zV#uePZX?zza%%1IgzlTEg)U|!2uaUKM9!wS=jgNs_K12lWr=k9$z*AcLU%E-BO}2P
z<@oY+yfe~jjIc{e;X!S|Pw<BC^^$1w*wKGuF+*F7^<r4A3%v9=LXphgb@K`@eXUn$
zoQb_uX$D!rp$8O!SHiFl8!+wtcud#__;~{*JQI)bVNmwXocC;g-onp={5*swAMs>A
z2j9k5*tg2ZVa~mcpSSb#2xSb|N9kj=eM~-{%UO5u^G-aUu%CygJx-6~^q>Qe><N0@
zO^<v0wCB^ed+Bi>Jx<W$1@w3!Jzj*zgnd6hUyLVo<|UL)2Wi+3a`H)jKE%&FKMVXc
z`8mnYBA!C;692aF#5U4t{!yk(IugjP&^MbNr#PodU+Ih=yM}LkxQ|`Ow<qid{a#_u
zP=SZ((d1-@zS5yQb_?Im*lm8E#uJ5S`NteT=kb&ibL>a(b;5oWPhj*oKCtTMW%BU~
z`FOQ_Ji#A3?G*;#|D4Ry2WTnd`{?nX>G6m3_$PY&10L>Xw*A~!s1+iTG!jm-TNI0a
zm>y5j<Nfsb5k3Bn9*3x!XVc>+^!PCzZQBhYGQmhpFai@?IZn|4f)fmQf`LvjzzGI6
z!GJ>N*Kk94=9U}6TZOnGyoR3|V)L5V9n@-Gh<YET@g7=6o0s-6+Psj0(dLOLMw`Q(
zgtkqAhqnC&q2-(8<IVU0)!!l?Z<UX?%f~z9<DK&HE_{H8PtphWpW?%Q4<6tZiQ@PQ
zKGVg1KfVLrzn70M;A6u6B0qiIhnZfwEt*UZA9Qqw)Agt;>PDPA>Mg~MN{8ph<47mO
zs<7rFWc+C1o9wLS^BZzlsNv1@z>;%ZgO(uq&Vr1(m$|O6180wrcyKRwJ$=(@vecoh
z5vfV1K8PLhT<`xL7VgmMn%l5=()+_Cr89%mtEc8Mg2MSKw2X$%l4W)jP?B~Y=r6@y
zL4nvywAYCj2;Fp&tBSqE1;VdAa1)mN&;p<XKoLKZU*iI?*SuL=??u!WktZ5oLWt13
zJ-lXs0!-do172r@$UoBRyfjG7;VMcIFcpr%Jh>Mk^#DE+0vK9s^uWH+(Pv3RxFyl{
zd*=?)BBKHqK1r>@@Kq?!)Bx#sDk35*0D98(eLS%oZ5{1zRw|*ndcWlPF9y%U#>aEy
zp9Ra4&XZg8=y7isOGMpc)Sb1d3yrwd+*dDjMn~^;Rn*J)=9ZfO8?sRUJ@WBh`DpS-
zyWMuzRBC+Q8BQO?7K-}ZC>>*pBioMQC`LLT?*;YB!$;_NO+Lo-4V_7MZK*0}JK87E
z0(Zla#%vvD5SHi-b=s-Bwb86h<50+Ip26cx#|j-FI7H_<<`M2T>DM}J*`?DWTh?3)
JzuS|e{}XntS=Imm

diff --git a/docs/RefMan/_build/html/.buildinfo b/docs/RefMan/_build/html/.buildinfo
index 7a9e1b227..bb39e3d43 100644
--- a/docs/RefMan/_build/html/.buildinfo
+++ b/docs/RefMan/_build/html/.buildinfo
@@ -1,4 +1,4 @@
 # Sphinx build info version 1
 # This file hashes the configuration used when building these files. When it is not found, a full rebuild will be done.
-config: a4ccf7f1b3589b784c5cab7c48946aab
+config: 12febdda05646d6655d93ce350355f10
 tags: 645f666f9bcd5a90fca523b33c5a78b7
diff --git a/docs/RefMan/_build/html/BasicSyntax.html b/docs/RefMan/_build/html/BasicSyntax.html
index b919ea8ef..87614545e 100644
--- a/docs/RefMan/_build/html/BasicSyntax.html
+++ b/docs/RefMan/_build/html/BasicSyntax.html
@@ -1,7 +1,8 @@
 <!DOCTYPE html>
 <html class="writer-html5" lang="en" >
 <head>
-  <meta charset="utf-8" />
+  <meta charset="utf-8" /><meta name="generator" content="Docutils 0.17.1: http://docutils.sourceforge.net/" />
+
   <meta name="viewport" content="width=device-width, initial-scale=1.0" />
   <title>Basic Syntax &mdash; Cryptol 2.11.0 documentation</title>
       <link rel="stylesheet" href="_static/pygments.css" type="text/css" />
@@ -13,6 +14,7 @@
         <script data-url_root="./" id="documentation_options" src="_static/documentation_options.js"></script>
         <script src="_static/jquery.js"></script>
         <script src="_static/underscore.js"></script>
+        <script src="_static/_sphinx_javascript_frameworks_compat.js"></script>
         <script src="_static/doctools.js"></script>
     <script src="_static/js/theme.js"></script>
     <link rel="index" title="Index" href="genindex.html" />
@@ -41,6 +43,7 @@
 <li class="toctree-l1 current"><a class="current reference internal" href="#">Basic Syntax</a><ul>
 <li class="toctree-l2"><a class="reference internal" href="#declarations">Declarations</a></li>
 <li class="toctree-l2"><a class="reference internal" href="#type-signatures">Type Signatures</a></li>
+<li class="toctree-l2"><a class="reference internal" href="#numeric-constraint-guards">Numeric Constraint Guards</a></li>
 <li class="toctree-l2"><a class="reference internal" href="#layout">Layout</a></li>
 <li class="toctree-l2"><a class="reference internal" href="#comments">Comments</a></li>
 <li class="toctree-l2"><a class="reference internal" href="#identifiers">Identifiers</a></li>
@@ -80,58 +83,92 @@
           <div role="main" class="document" itemscope="itemscope" itemtype="http://schema.org/Article">
            <div itemprop="articleBody">
              
-  <div class="section" id="basic-syntax">
-<h1>Basic Syntax<a class="headerlink" href="#basic-syntax" title="Permalink to this headline"></a></h1>
-<div class="section" id="declarations">
-<h2>Declarations<a class="headerlink" href="#declarations" title="Permalink to this headline"></a></h2>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">f</span> <span class="n">x</span> <span class="ow">=</span> <span class="n">x</span> <span class="o">+</span> <span class="n">y</span> <span class="o">+</span> <span class="n">z</span>
+  <section id="basic-syntax">
+<h1>Basic Syntax<a class="headerlink" href="#basic-syntax" title="Permalink to this heading"></a></h1>
+<section id="declarations">
+<h2>Declarations<a class="headerlink" href="#declarations" title="Permalink to this heading"></a></h2>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">f</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">y</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">z</span><span class="w"></span>
 </pre></div>
 </div>
+</section>
+<section id="type-signatures">
+<h2>Type Signatures<a class="headerlink" href="#type-signatures" title="Permalink to this heading"></a></h2>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">f</span><span class="p">,</span><span class="n">g</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">a</span><span class="p">,</span><span class="n">b</span><span class="p">}</span><span class="w"> </span><span class="p">(</span><span class="kr">fin</span><span class="w"> </span><span class="n">a</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="p">[</span><span class="n">a</span><span class="p">]</span><span class="w"> </span><span class="n">b</span><span class="w"></span>
+</pre></div>
 </div>
-<div class="section" id="type-signatures">
-<h2>Type Signatures<a class="headerlink" href="#type-signatures" title="Permalink to this headline"></a></h2>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">f</span><span class="p">,</span><span class="n">g</span> <span class="kt">:</span> <span class="p">{</span><span class="n">a</span><span class="p">,</span><span class="n">b</span><span class="p">}</span> <span class="p">(</span><span class="kr">fin</span> <span class="n">a</span><span class="p">)</span> <span class="ow">=&gt;</span> <span class="p">[</span><span class="n">a</span><span class="p">]</span> <span class="n">b</span>
+</section>
+<section id="numeric-constraint-guards">
+<h2>Numeric Constraint Guards<a class="headerlink" href="#numeric-constraint-guards" title="Permalink to this heading"></a></h2>
+<p>A declaration with a signature can use numeric constraint guards, which are like
+normal guards (such as in a multi-branch <cite>if`</cite> expression) except that the
+guarding conditions can be numeric constraints. For example:</p>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">len</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">n</span><span class="p">}</span><span class="w"> </span><span class="p">(</span><span class="kr">fin</span><span class="w"> </span><span class="n">n</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="p">[</span><span class="n">n</span><span class="p">]</span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="kt">Integer</span><span class="w"></span>
+<span class="nf">len</span><span class="w"> </span><span class="n">xs</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">0</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="mi">0</span><span class="w"></span>
+<span class="w">       </span><span class="o">|</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="o">&gt;</span><span class="w">  </span><span class="mi">0</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="mi">1</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">len</span><span class="w"> </span><span class="p">(</span><span class="n">drop</span><span class="w"> </span><span class="p">`{</span><span class="mi">1</span><span class="p">}</span><span class="w"> </span><span class="n">xs</span><span class="p">)</span><span class="w"></span>
 </pre></div>
 </div>
+<p>Note that this is importantly different from</p>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">len&#39;</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">n</span><span class="p">}</span><span class="w"> </span><span class="p">(</span><span class="kr">fin</span><span class="w"> </span><span class="n">n</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="p">[</span><span class="n">n</span><span class="p">]</span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="kt">Integer</span><span class="w"></span>
+<span class="nf">len&#39;</span><span class="w"> </span><span class="n">xs</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="kr">if</span><span class="w"> </span><span class="p">`</span><span class="n">n</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">0</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="mi">0</span><span class="w"></span>
+<span class="w">           </span><span class="o">|</span><span class="w"> </span><span class="p">`</span><span class="n">n</span><span class="w"> </span><span class="o">&gt;</span><span class="w">  </span><span class="mi">0</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="mi">1</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">len</span><span class="w"> </span><span class="p">(</span><span class="n">drop</span><span class="w"> </span><span class="p">`{</span><span class="mi">1</span><span class="p">}</span><span class="w"> </span><span class="n">xs</span><span class="p">)</span><span class="w"></span>
+</pre></div>
 </div>
-<div class="section" id="layout">
-<h2>Layout<a class="headerlink" href="#layout" title="Permalink to this headline"></a></h2>
+<p>In <cite>len’</cite>, the type-checker cannot determine that <cite>n &gt;= 1</cite> which is
+required to use the</p>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">drop</span><span class="w"> </span><span class="p">`{</span><span class="mi">1</span><span class="p">}</span><span class="w"> </span><span class="n">xs</span><span class="w"></span>
+</pre></div>
+</div>
+<p>since the <cite>if</cite>’s condition is only on values, not types.</p>
+<p>However, in <cite>len</cite>, the type-checker locally-assumes the constraint <cite>n &gt; 0</cite> in
+that constraint-guarded branch and so it can in fact determine that <cite>n &gt;= 1</cite>.</p>
+<dl class="simple">
+<dt>Requirements:</dt><dd><ul class="simple">
+<li><p>Numeric constraint guards only support constraints over numeric literals,
+such as <cite>fin</cite>, <cite>&lt;=</cite>, <cite>==</cite>, etc. Type constraint aliases can also be used as
+long as they only constraint numeric literals.</p></li>
+<li><p>The numeric constraint guards of a declaration must be exhaustive.</p></li>
+</ul>
+</dd>
+</dl>
+</section>
+<section id="layout">
+<h2>Layout<a class="headerlink" href="#layout" title="Permalink to this heading"></a></h2>
 <p>Groups of declarations are organized based on indentation.
 Declarations with the same indentation belong to the same group.
 Lines of text that are indented more than the beginning of a
 declaration belong to that declaration, while lines of text that are
 indented less terminate a group of declarations.  Consider, for example,
 the following Cryptol declarations:</p>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">f</span> <span class="n">x</span> <span class="ow">=</span> <span class="n">x</span> <span class="o">+</span> <span class="n">y</span> <span class="o">+</span> <span class="n">z</span>
-  <span class="kr">where</span>
-  <span class="n">y</span> <span class="ow">=</span> <span class="n">x</span> <span class="o">*</span> <span class="n">x</span>
-  <span class="n">z</span> <span class="ow">=</span> <span class="n">x</span> <span class="o">+</span> <span class="n">y</span>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">f</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">y</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">z</span><span class="w"></span>
+<span class="w">  </span><span class="kr">where</span><span class="w"></span>
+<span class="w">  </span><span class="n">y</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">x</span><span class="w"></span>
+<span class="w">  </span><span class="n">z</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">y</span><span class="w"></span>
 
-<span class="nf">g</span> <span class="n">y</span> <span class="ow">=</span> <span class="n">y</span>
+<span class="nf">g</span><span class="w"> </span><span class="n">y</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="n">y</span><span class="w"></span>
 </pre></div>
 </div>
 <p>This group has two declarations, one for <cite>f</cite> and one for <cite>g</cite>.  All the
 lines between <cite>f</cite> and <cite>g</cite> that are indented more than <cite>f</cite> belong to
 <cite>f</cite>.  The same principle applies to the declarations in the <code class="docutils literal notranslate"><span class="pre">where</span></code> block
 of <cite>f</cite>, which defines two more local names, <cite>y</cite> and <cite>z</cite>.</p>
-</div>
-<div class="section" id="comments">
-<h2>Comments<a class="headerlink" href="#comments" title="Permalink to this headline"></a></h2>
+</section>
+<section id="comments">
+<h2>Comments<a class="headerlink" href="#comments" title="Permalink to this heading"></a></h2>
 <p>Cryptol supports block comments, which start with <code class="docutils literal notranslate"><span class="pre">/*</span></code> and end with
 <code class="docutils literal notranslate"><span class="pre">*/</span></code>, and line comments, which start with <code class="docutils literal notranslate"><span class="pre">//</span></code> and terminate at the
 end of the line.  Block comments may be nested arbitrarily.</p>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="cm">/* This is a block comment */</span>
-<span class="c1">// This is a line comment</span>
-<span class="cm">/* This is a /* Nested */ block comment */</span>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="cm">/* This is a block comment */</span><span class="w"></span>
+<span class="c1">// This is a line comment</span><span class="w"></span>
+<span class="cm">/* This is a /* Nested */ block comment */</span><span class="w"></span>
 </pre></div>
 </div>
 <div class="admonition-todo admonition" id="id1">
 <p class="admonition-title">Todo</p>
 <p>Document <code class="docutils literal notranslate"><span class="pre">/**</span> <span class="pre">*/</span></code></p>
 </div>
-</div>
-<div class="section" id="identifiers">
-<h2>Identifiers<a class="headerlink" href="#identifiers" title="Permalink to this headline"></a></h2>
+</section>
+<section id="identifiers">
+<h2>Identifiers<a class="headerlink" href="#identifiers" title="Permalink to this heading"></a></h2>
 <p>Cryptol identifiers consist of one or more characters.  The first
 character must be either an English letter or underscore (<code class="docutils literal notranslate"><span class="pre">_</span></code>).  The
 following characters may be an English letter, a decimal digit,
@@ -140,14 +177,14 @@ <h2>Identifiers<a class="headerlink" href="#identifiers" title="Permalink to thi
 names (see <a class="reference internal" href="#keywords-and-built-in-operators">Keywords and Built-in Operators</a>).</p>
 <div class="literal-block-wrapper docutils container" id="id2">
 <div class="code-block-caption"><span class="caption-text">Examples of identifiers</span><a class="headerlink" href="#id2" title="Permalink to this code"></a></div>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">name</span>    <span class="n">name1</span>    <span class="n">name&#39;</span>    <span class="n">longer_name</span>
-<span class="kt">Name</span>    <span class="kt">Name2</span>    <span class="kt">Name&#39;&#39;</span>   <span class="n">longerName</span>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">name</span><span class="w">    </span><span class="n">name1</span><span class="w">    </span><span class="n">name&#39;</span><span class="w">    </span><span class="n">longer_name</span><span class="w"></span>
+<span class="kt">Name</span><span class="w">    </span><span class="kt">Name2</span><span class="w">    </span><span class="kt">Name&#39;&#39;</span><span class="w">   </span><span class="n">longerName</span><span class="w"></span>
 </pre></div>
 </div>
 </div>
-</div>
-<div class="section" id="keywords-and-built-in-operators">
-<h2>Keywords and Built-in Operators<a class="headerlink" href="#keywords-and-built-in-operators" title="Permalink to this headline"></a></h2>
+</section>
+<section id="keywords-and-built-in-operators">
+<h2>Keywords and Built-in Operators<a class="headerlink" href="#keywords-and-built-in-operators" title="Permalink to this heading"></a></h2>
 <p>The following identifiers have special meanings in Cryptol, and may
 not be used for programmer defined names:</p>
 <div class="literal-block-wrapper docutils container" id="id3">
@@ -222,9 +259,9 @@ <h2>Keywords and Built-in Operators<a class="headerlink" href="#keywords-and-bui
 </tr>
 </tbody>
 </table>
-</div>
-<div class="section" id="built-in-type-level-operators">
-<h2>Built-in Type-level Operators<a class="headerlink" href="#built-in-type-level-operators" title="Permalink to this headline"></a></h2>
+</section>
+<section id="built-in-type-level-operators">
+<h2>Built-in Type-level Operators<a class="headerlink" href="#built-in-type-level-operators" title="Permalink to this heading"></a></h2>
 <p>Cryptol includes a variety of operators that allow computations on
 the numeric types used to specify the sizes of sequences.</p>
 <table class="docutils align-default" id="id5">
@@ -277,21 +314,21 @@ <h2>Built-in Type-level Operators<a class="headerlink" href="#built-in-type-leve
 </tr>
 </tbody>
 </table>
-</div>
-<div class="section" id="numeric-literals">
-<h2>Numeric Literals<a class="headerlink" href="#numeric-literals" title="Permalink to this headline"></a></h2>
+</section>
+<section id="numeric-literals">
+<h2>Numeric Literals<a class="headerlink" href="#numeric-literals" title="Permalink to this heading"></a></h2>
 <p>Numeric literals may be written in binary, octal, decimal, or
 hexadecimal notation. The base of a literal is determined by its prefix:
 <code class="docutils literal notranslate"><span class="pre">0b</span></code> for binary, <code class="docutils literal notranslate"><span class="pre">0o</span></code> for octal, no special prefix for
 decimal, and <code class="docutils literal notranslate"><span class="pre">0x</span></code> for hexadecimal.</p>
 <div class="literal-block-wrapper docutils container" id="id6">
 <div class="code-block-caption"><span class="caption-text">Examples of literals</span><a class="headerlink" href="#id6" title="Permalink to this code"></a></div>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="mi">254</span>                 <span class="c1">// Decimal literal</span>
-<span class="mi">0254</span>                <span class="c1">// Decimal literal</span>
-<span class="mi">0</span><span class="n">b11111110</span>          <span class="c1">// Binary literal</span>
-<span class="mo">0o376</span>               <span class="c1">// Octal literal</span>
-<span class="mh">0xFE</span>                <span class="c1">// Hexadecimal literal</span>
-<span class="mh">0xfe</span>                <span class="c1">// Hexadecimal literal</span>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="mi">254</span><span class="w">                 </span><span class="c1">// Decimal literal</span><span class="w"></span>
+<span class="mi">0254</span><span class="w">                </span><span class="c1">// Decimal literal</span><span class="w"></span>
+<span class="mi">0</span><span class="n">b11111110</span><span class="w">          </span><span class="c1">// Binary literal</span><span class="w"></span>
+<span class="mo">0o376</span><span class="w">               </span><span class="c1">// Octal literal</span><span class="w"></span>
+<span class="mh">0xFE</span><span class="w">                </span><span class="c1">// Hexadecimal literal</span><span class="w"></span>
+<span class="mh">0xfe</span><span class="w">                </span><span class="c1">// Hexadecimal literal</span><span class="w"></span>
 </pre></div>
 </div>
 </div>
@@ -302,12 +339,12 @@ <h2>Numeric Literals<a class="headerlink" href="#numeric-literals" title="Permal
 type is inferred from context in which the literal is used. Examples:</p>
 <div class="literal-block-wrapper docutils container" id="id7">
 <div class="code-block-caption"><span class="caption-text">Literals and their types</span><a class="headerlink" href="#id7" title="Permalink to this code"></a></div>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="mi">0</span><span class="n">b1010</span>              <span class="c1">// : [4],   1 * number of digits</span>
-<span class="mo">0o1234</span>              <span class="c1">// : [12],  3 * number of digits</span>
-<span class="mh">0x1234</span>              <span class="c1">// : [16],  4 * number of digits</span>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="mi">0</span><span class="n">b1010</span><span class="w">              </span><span class="c1">// : [4],   1 * number of digits</span><span class="w"></span>
+<span class="mo">0o1234</span><span class="w">              </span><span class="c1">// : [12],  3 * number of digits</span><span class="w"></span>
+<span class="mh">0x1234</span><span class="w">              </span><span class="c1">// : [16],  4 * number of digits</span><span class="w"></span>
 
-<span class="mi">10</span>                  <span class="c1">// : {a}. (Literal 10 a) =&gt; a</span>
-                    <span class="c1">// a = Integer or [n] where n &gt;= width 10</span>
+<span class="mi">10</span><span class="w">                  </span><span class="c1">// : {a}. (Literal 10 a) =&gt; a</span><span class="w"></span>
+<span class="w">                    </span><span class="c1">// a = Integer or [n] where n &gt;= width 10</span><span class="w"></span>
 </pre></div>
 </div>
 </div>
@@ -317,8 +354,8 @@ <h2>Numeric Literals<a class="headerlink" href="#numeric-literals" title="Permal
 one more than the degree of the polynomial.  Examples:</p>
 <div class="literal-block-wrapper docutils container" id="id8">
 <div class="code-block-caption"><span class="caption-text">Polynomial literals</span><a class="headerlink" href="#id8" title="Permalink to this code"></a></div>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="o">&lt;|</span> <span class="n">x</span><span class="o">^^</span><span class="mi">6</span> <span class="o">+</span> <span class="n">x</span><span class="o">^^</span><span class="mi">4</span> <span class="o">+</span> <span class="n">x</span><span class="o">^^</span><span class="mi">2</span> <span class="o">+</span> <span class="n">x</span><span class="o">^^</span><span class="mi">1</span> <span class="o">+</span> <span class="mi">1</span> <span class="o">|&gt;</span>  <span class="c1">// : [7], equal to 0b1010111</span>
-<span class="o">&lt;|</span> <span class="n">x</span><span class="o">^^</span><span class="mi">4</span> <span class="o">+</span> <span class="n">x</span><span class="o">^^</span><span class="mi">3</span> <span class="o">+</span> <span class="n">x</span> <span class="o">|&gt;</span>                <span class="c1">// : [5], equal to 0b11010</span>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="o">&lt;|</span><span class="w"> </span><span class="n">x</span><span class="o">^^</span><span class="mi">6</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">x</span><span class="o">^^</span><span class="mi">4</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">x</span><span class="o">^^</span><span class="mi">2</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">x</span><span class="o">^^</span><span class="mi">1</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">1</span><span class="w"> </span><span class="o">|&gt;</span><span class="w">  </span><span class="c1">// : [7], equal to 0b1010111</span><span class="w"></span>
+<span class="o">&lt;|</span><span class="w"> </span><span class="n">x</span><span class="o">^^</span><span class="mi">4</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">x</span><span class="o">^^</span><span class="mi">3</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">|&gt;</span><span class="w">                </span><span class="c1">// : [5], equal to 0b11010</span><span class="w"></span>
 </pre></div>
 </div>
 </div>
@@ -331,10 +368,10 @@ <h2>Numeric Literals<a class="headerlink" href="#numeric-literals" title="Permal
 Examples:</p>
 <div class="literal-block-wrapper docutils container" id="id9">
 <div class="code-block-caption"><span class="caption-text">Fractional literals</span><a class="headerlink" href="#id9" title="Permalink to this code"></a></div>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="mf">10.2</span>
-<span class="mf">10.2e3</span>            <span class="c1">// 10.2 * 10^3</span>
-<span class="mh">0x30</span><span class="o">.</span><span class="mi">1</span>            <span class="c1">// 3 * 64 + 1/16</span>
-<span class="mh">0x30</span><span class="o">.</span><span class="mi">1</span><span class="n">p4</span>          <span class="c1">// (3 * 64 + 1/16) * 2^4</span>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="mf">10.2</span><span class="w"></span>
+<span class="mf">10.2e3</span><span class="w">            </span><span class="c1">// 10.2 * 10^3</span><span class="w"></span>
+<span class="mh">0x30</span><span class="o">.</span><span class="mi">1</span><span class="w">            </span><span class="c1">// 3 * 64 + 1/16</span><span class="w"></span>
+<span class="mh">0x30</span><span class="o">.</span><span class="mi">1</span><span class="n">p4</span><span class="w">          </span><span class="c1">// (3 * 64 + 1/16) * 2^4</span><span class="w"></span>
 </pre></div>
 </div>
 </div>
@@ -348,13 +385,13 @@ <h2>Numeric Literals<a class="headerlink" href="#numeric-literals" title="Permal
 literal value but may be used to improve readability.  Here are some examples:</p>
 <div class="literal-block-wrapper docutils container" id="id10">
 <div class="code-block-caption"><span class="caption-text">Using _</span><a class="headerlink" href="#id10" title="Permalink to this code"></a></div>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="mi">0</span><span class="n">b_0000_0010</span>
-<span class="mi">0</span><span class="n">x_FFFF_FFEA</span>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="mi">0</span><span class="n">b_0000_0010</span><span class="w"></span>
+<span class="mi">0</span><span class="n">x_FFFF_FFEA</span><span class="w"></span>
 </pre></div>
 </div>
 </div>
-</div>
-</div>
+</section>
+</section>
 
 
            </div>
diff --git a/docs/RefMan/_build/html/BasicTypes.html b/docs/RefMan/_build/html/BasicTypes.html
index 373526e8a..c5ad54b88 100644
--- a/docs/RefMan/_build/html/BasicTypes.html
+++ b/docs/RefMan/_build/html/BasicTypes.html
@@ -1,7 +1,8 @@
 <!DOCTYPE html>
 <html class="writer-html5" lang="en" >
 <head>
-  <meta charset="utf-8" />
+  <meta charset="utf-8" /><meta name="generator" content="Docutils 0.17.1: http://docutils.sourceforge.net/" />
+
   <meta name="viewport" content="width=device-width, initial-scale=1.0" />
   <title>Basic Types &mdash; Cryptol 2.11.0 documentation</title>
       <link rel="stylesheet" href="_static/pygments.css" type="text/css" />
@@ -13,6 +14,7 @@
         <script data-url_root="./" id="documentation_options" src="_static/documentation_options.js"></script>
         <script src="_static/jquery.js"></script>
         <script src="_static/underscore.js"></script>
+        <script src="_static/_sphinx_javascript_frameworks_compat.js"></script>
         <script src="_static/doctools.js"></script>
     <script src="_static/js/theme.js"></script>
     <link rel="index" title="Index" href="genindex.html" />
@@ -79,79 +81,79 @@
           <div role="main" class="document" itemscope="itemscope" itemtype="http://schema.org/Article">
            <div itemprop="articleBody">
              
-  <div class="section" id="basic-types">
-<h1>Basic Types<a class="headerlink" href="#basic-types" title="Permalink to this headline"></a></h1>
-<div class="section" id="tuples-and-records">
-<h2>Tuples and Records<a class="headerlink" href="#tuples-and-records" title="Permalink to this headline"></a></h2>
+  <section id="basic-types">
+<h1>Basic Types<a class="headerlink" href="#basic-types" title="Permalink to this heading"></a></h1>
+<section id="tuples-and-records">
+<h2>Tuples and Records<a class="headerlink" href="#tuples-and-records" title="Permalink to this heading"></a></h2>
 <p>Tuples and records are used for packaging multiple values together.
 Tuples are enclosed in parentheses, while records are enclosed in
 curly braces.  The components of both tuples and records are separated by
 commas.  The components of tuples are expressions, while the
 components of records are a label and a value separated by an equal
 sign.  Examples:</p>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="p">(</span><span class="mi">1</span><span class="p">,</span><span class="mi">2</span><span class="p">,</span><span class="mi">3</span><span class="p">)</span>           <span class="c1">// A tuple with 3 component</span>
-<span class="nb">()</span>                <span class="c1">// A tuple with no components</span>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="p">(</span><span class="mi">1</span><span class="p">,</span><span class="mi">2</span><span class="p">,</span><span class="mi">3</span><span class="p">)</span><span class="w">           </span><span class="c1">// A tuple with 3 component</span><span class="w"></span>
+<span class="nb">()</span><span class="w">                </span><span class="c1">// A tuple with no components</span><span class="w"></span>
 
-<span class="p">{</span> <span class="n">x</span> <span class="ow">=</span> <span class="mi">1</span><span class="p">,</span> <span class="n">y</span> <span class="ow">=</span> <span class="mi">2</span> <span class="p">}</span>  <span class="c1">// A record with two fields, `x` and `y`</span>
-<span class="p">{}</span>                <span class="c1">// A record with no fields</span>
+<span class="p">{</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mi">1</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mi">2</span><span class="w"> </span><span class="p">}</span><span class="w">  </span><span class="c1">// A record with two fields, `x` and `y`</span><span class="w"></span>
+<span class="p">{}</span><span class="w">                </span><span class="c1">// A record with no fields</span><span class="w"></span>
 </pre></div>
 </div>
 <p>The components of tuples are identified by position, while the
 components of records are identified by their label, and so the
 ordering of record components is not important for most purposes.
 Examples:</p>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span>           <span class="p">(</span><span class="mi">1</span><span class="p">,</span><span class="mi">2</span><span class="p">)</span> <span class="o">==</span> <span class="p">(</span><span class="mi">1</span><span class="p">,</span><span class="mi">2</span><span class="p">)</span>               <span class="c1">// True</span>
-           <span class="p">(</span><span class="mi">1</span><span class="p">,</span><span class="mi">2</span><span class="p">)</span> <span class="o">==</span> <span class="p">(</span><span class="mi">2</span><span class="p">,</span><span class="mi">1</span><span class="p">)</span>               <span class="c1">// False</span>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="w">           </span><span class="p">(</span><span class="mi">1</span><span class="p">,</span><span class="mi">2</span><span class="p">)</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="p">(</span><span class="mi">1</span><span class="p">,</span><span class="mi">2</span><span class="p">)</span><span class="w">               </span><span class="c1">// True</span><span class="w"></span>
+<span class="w">           </span><span class="p">(</span><span class="mi">1</span><span class="p">,</span><span class="mi">2</span><span class="p">)</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="p">(</span><span class="mi">2</span><span class="p">,</span><span class="mi">1</span><span class="p">)</span><span class="w">               </span><span class="c1">// False</span><span class="w"></span>
 
-<span class="p">{</span> <span class="n">x</span> <span class="ow">=</span> <span class="mi">1</span><span class="p">,</span> <span class="n">y</span> <span class="ow">=</span> <span class="mi">2</span> <span class="p">}</span> <span class="o">==</span> <span class="p">{</span> <span class="n">x</span> <span class="ow">=</span> <span class="mi">1</span><span class="p">,</span> <span class="n">y</span> <span class="ow">=</span> <span class="mi">2</span> <span class="p">}</span>    <span class="c1">// True</span>
-<span class="p">{</span> <span class="n">x</span> <span class="ow">=</span> <span class="mi">1</span><span class="p">,</span> <span class="n">y</span> <span class="ow">=</span> <span class="mi">2</span> <span class="p">}</span> <span class="o">==</span> <span class="p">{</span> <span class="n">y</span> <span class="ow">=</span> <span class="mi">2</span><span class="p">,</span> <span class="n">x</span> <span class="ow">=</span> <span class="mi">1</span> <span class="p">}</span>    <span class="c1">// True</span>
+<span class="p">{</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mi">1</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mi">2</span><span class="w"> </span><span class="p">}</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mi">1</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mi">2</span><span class="w"> </span><span class="p">}</span><span class="w">    </span><span class="c1">// True</span><span class="w"></span>
+<span class="p">{</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mi">1</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mi">2</span><span class="w"> </span><span class="p">}</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="n">y</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mi">2</span><span class="p">,</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mi">1</span><span class="w"> </span><span class="p">}</span><span class="w">    </span><span class="c1">// True</span><span class="w"></span>
 </pre></div>
 </div>
 <p>Ordering on tuples and records is defined lexicographically. Tuple
 components are compared in the order they appear, whereas record
 fields are compared in alphabetical order of field names.</p>
-<div class="section" id="accessing-fields">
-<h3>Accessing Fields<a class="headerlink" href="#accessing-fields" title="Permalink to this headline"></a></h3>
+<section id="accessing-fields">
+<h3>Accessing Fields<a class="headerlink" href="#accessing-fields" title="Permalink to this heading"></a></h3>
 <p>The components of a record or a tuple may be accessed in two ways: via
 pattern matching or by using explicit component selectors.  Explicit
 component selectors are written as follows:</p>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="p">(</span><span class="mi">15</span><span class="p">,</span> <span class="mi">20</span><span class="p">)</span><span class="o">.</span><span class="mi">0</span>           <span class="o">==</span> <span class="mi">15</span>
-<span class="p">(</span><span class="mi">15</span><span class="p">,</span> <span class="mi">20</span><span class="p">)</span><span class="o">.</span><span class="mi">1</span>           <span class="o">==</span> <span class="mi">20</span>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="p">(</span><span class="mi">15</span><span class="p">,</span><span class="w"> </span><span class="mi">20</span><span class="p">)</span><span class="o">.</span><span class="mi">0</span><span class="w">           </span><span class="o">==</span><span class="w"> </span><span class="mi">15</span><span class="w"></span>
+<span class="p">(</span><span class="mi">15</span><span class="p">,</span><span class="w"> </span><span class="mi">20</span><span class="p">)</span><span class="o">.</span><span class="mi">1</span><span class="w">           </span><span class="o">==</span><span class="w"> </span><span class="mi">20</span><span class="w"></span>
 
-<span class="p">{</span> <span class="n">x</span> <span class="ow">=</span> <span class="mi">15</span><span class="p">,</span> <span class="n">y</span> <span class="ow">=</span> <span class="mi">20</span> <span class="p">}</span><span class="o">.</span><span class="n">x</span> <span class="o">==</span> <span class="mi">15</span>
+<span class="p">{</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mi">15</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mi">20</span><span class="w"> </span><span class="p">}</span><span class="o">.</span><span class="n">x</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">15</span><span class="w"></span>
 </pre></div>
 </div>
 <p>Explicit record selectors may be used only if the program contains
 sufficient type information to determine the shape of the tuple or
 record.  For example:</p>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kr">type</span> <span class="kt">T</span> <span class="ow">=</span> <span class="p">{</span> <span class="n">sign</span> <span class="kt">:</span> <span class="kr">Bit</span><span class="p">,</span> <span class="n">number</span> <span class="kt">:</span> <span class="p">[</span><span class="mi">15</span><span class="p">]</span> <span class="p">}</span>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kr">type</span><span class="w"> </span><span class="kt">T</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="n">sign</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="kr">Bit</span><span class="p">,</span><span class="w"> </span><span class="n">number</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="p">[</span><span class="mi">15</span><span class="p">]</span><span class="w"> </span><span class="p">}</span><span class="w"></span>
 
-<span class="c1">// Valid definition:</span>
-<span class="c1">// the type of the record is known.</span>
-<span class="nf">isPositive</span> <span class="kt">:</span> <span class="kt">T</span> <span class="ow">-&gt;</span> <span class="kr">Bit</span>
-<span class="nf">isPositive</span> <span class="n">x</span> <span class="ow">=</span> <span class="n">x</span><span class="o">.</span><span class="n">sign</span>
+<span class="c1">// Valid definition:</span><span class="w"></span>
+<span class="c1">// the type of the record is known.</span><span class="w"></span>
+<span class="nf">isPositive</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="kt">T</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="kr">Bit</span><span class="w"></span>
+<span class="nf">isPositive</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="n">x</span><span class="o">.</span><span class="n">sign</span><span class="w"></span>
 
-<span class="c1">// Invalid definition:</span>
-<span class="c1">// insufficient type information.</span>
-<span class="nf">badDef</span> <span class="n">x</span> <span class="ow">=</span> <span class="n">x</span><span class="o">.</span><span class="n">f</span>
+<span class="c1">// Invalid definition:</span><span class="w"></span>
+<span class="c1">// insufficient type information.</span><span class="w"></span>
+<span class="nf">badDef</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="n">x</span><span class="o">.</span><span class="n">f</span><span class="w"></span>
 </pre></div>
 </div>
 <p>The components of a tuple or a record may also be accessed using
 pattern matching.  Patterns for tuples and records mirror the syntax
 for constructing values: tuple patterns use parentheses, while record
 patterns use braces.  Examples:</p>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">getFst</span> <span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="n">_</span><span class="p">)</span> <span class="ow">=</span> <span class="n">x</span>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">getFst</span><span class="w"> </span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="n">_</span><span class="p">)</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="n">x</span><span class="w"></span>
 
-<span class="nf">distance2</span> <span class="p">{</span> <span class="n">x</span> <span class="ow">=</span> <span class="n">xPos</span><span class="p">,</span> <span class="n">y</span> <span class="ow">=</span> <span class="n">yPos</span> <span class="p">}</span> <span class="ow">=</span> <span class="n">xPos</span> <span class="o">^^</span> <span class="mi">2</span> <span class="o">+</span> <span class="n">yPos</span> <span class="o">^^</span> <span class="mi">2</span>
+<span class="nf">distance2</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="n">xPos</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="n">yPos</span><span class="w"> </span><span class="p">}</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="n">xPos</span><span class="w"> </span><span class="o">^^</span><span class="w"> </span><span class="mi">2</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">yPos</span><span class="w"> </span><span class="o">^^</span><span class="w"> </span><span class="mi">2</span><span class="w"></span>
 
-<span class="nf">f</span> <span class="n">p</span> <span class="ow">=</span> <span class="n">x</span> <span class="o">+</span> <span class="n">y</span> <span class="kr">where</span>
-    <span class="p">(</span><span class="n">x</span><span class="p">,</span> <span class="n">y</span><span class="p">)</span> <span class="ow">=</span> <span class="n">p</span>
+<span class="nf">f</span><span class="w"> </span><span class="n">p</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">y</span><span class="w"> </span><span class="kr">where</span><span class="w"></span>
+<span class="w">    </span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="p">)</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="n">p</span><span class="w"></span>
 </pre></div>
 </div>
 <p>Selectors are also lifted through sequence and function types, point-wise,
 so that the following equations should hold:</p>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">xs</span><span class="o">.</span><span class="n">l</span> <span class="o">==</span> <span class="p">[</span> <span class="n">x</span><span class="o">.</span><span class="n">l</span> <span class="o">|</span> <span class="n">x</span> <span class="ow">&lt;-</span> <span class="n">xs</span> <span class="p">]</span>     <span class="c1">// sequences</span>
-<span class="nf">f</span><span class="o">.</span><span class="n">l</span>  <span class="o">==</span> <span class="nf">\</span><span class="n">x</span> <span class="ow">-&gt;</span> <span class="p">(</span><span class="n">f</span> <span class="n">x</span><span class="p">)</span><span class="o">.</span><span class="n">l</span>         <span class="c1">// functions</span>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">xs</span><span class="o">.</span><span class="n">l</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="p">[</span><span class="w"> </span><span class="n">x</span><span class="o">.</span><span class="n">l</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="ow">&lt;-</span><span class="w"> </span><span class="n">xs</span><span class="w"> </span><span class="p">]</span><span class="w">     </span><span class="c1">// sequences</span><span class="w"></span>
+<span class="nf">f</span><span class="o">.</span><span class="n">l</span><span class="w">  </span><span class="o">==</span><span class="w"> </span><span class="nf">\</span><span class="n">x</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="p">(</span><span class="n">f</span><span class="w"> </span><span class="n">x</span><span class="p">)</span><span class="o">.</span><span class="n">l</span><span class="w">         </span><span class="c1">// functions</span><span class="w"></span>
 </pre></div>
 </div>
 <p>Thus, if we have a sequence of tuples, <code class="docutils literal notranslate"><span class="pre">xs</span></code>, then we can quickly obtain a
@@ -160,57 +162,57 @@ <h3>Accessing Fields<a class="headerlink" href="#accessing-fields" title="Permal
 then we can write <code class="docutils literal notranslate"><span class="pre">f.0</span></code> to get a function that computes only the first
 entry in the tuple.</p>
 <p>This behavior is quite handy when examining complex data at the REPL.</p>
-</div>
-<div class="section" id="updating-fields">
-<h3>Updating Fields<a class="headerlink" href="#updating-fields" title="Permalink to this headline"></a></h3>
+</section>
+<section id="updating-fields">
+<h3>Updating Fields<a class="headerlink" href="#updating-fields" title="Permalink to this heading"></a></h3>
 <p>The components of a record or a tuple may be updated using the following
 notation:</p>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="c1">// Example values</span>
-<span class="nf">r</span> <span class="ow">=</span> <span class="p">{</span> <span class="n">x</span> <span class="ow">=</span> <span class="mi">15</span><span class="p">,</span> <span class="n">y</span> <span class="ow">=</span> <span class="mi">20</span> <span class="p">}</span>      <span class="c1">// a record</span>
-<span class="nf">t</span> <span class="ow">=</span> <span class="p">(</span><span class="kr">True</span><span class="p">,</span><span class="kr">True</span><span class="p">)</span>             <span class="c1">// a tuple</span>
-<span class="nf">n</span> <span class="ow">=</span> <span class="p">{</span> <span class="n">pt</span> <span class="ow">=</span> <span class="n">r</span><span class="p">,</span> <span class="n">size</span> <span class="ow">=</span> <span class="mi">100</span> <span class="p">}</span>  <span class="c1">// nested record</span>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="c1">// Example values</span><span class="w"></span>
+<span class="nf">r</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mi">15</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mi">20</span><span class="w"> </span><span class="p">}</span><span class="w">      </span><span class="c1">// a record</span><span class="w"></span>
+<span class="nf">t</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="p">(</span><span class="kr">True</span><span class="p">,</span><span class="kr">True</span><span class="p">)</span><span class="w">             </span><span class="c1">// a tuple</span><span class="w"></span>
+<span class="nf">n</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="n">pt</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="n">r</span><span class="p">,</span><span class="w"> </span><span class="n">size</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mi">100</span><span class="w"> </span><span class="p">}</span><span class="w">  </span><span class="c1">// nested record</span><span class="w"></span>
 
-<span class="c1">// Setting fields</span>
-<span class="p">{</span> <span class="n">r</span> <span class="o">|</span> <span class="n">x</span> <span class="ow">=</span> <span class="mi">30</span> <span class="p">}</span>          <span class="o">==</span> <span class="p">{</span> <span class="n">x</span> <span class="ow">=</span> <span class="mi">30</span><span class="p">,</span> <span class="n">y</span> <span class="ow">=</span> <span class="mi">20</span> <span class="p">}</span>
-<span class="p">{</span> <span class="n">t</span> <span class="o">|</span> <span class="mi">0</span> <span class="ow">=</span> <span class="kr">False</span> <span class="p">}</span>       <span class="o">==</span> <span class="p">(</span><span class="kr">False</span><span class="p">,</span><span class="kr">True</span><span class="p">)</span>
+<span class="c1">// Setting fields</span><span class="w"></span>
+<span class="p">{</span><span class="w"> </span><span class="n">r</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mi">30</span><span class="w"> </span><span class="p">}</span><span class="w">          </span><span class="o">==</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mi">30</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mi">20</span><span class="w"> </span><span class="p">}</span><span class="w"></span>
+<span class="p">{</span><span class="w"> </span><span class="n">t</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="mi">0</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="kr">False</span><span class="w"> </span><span class="p">}</span><span class="w">       </span><span class="o">==</span><span class="w"> </span><span class="p">(</span><span class="kr">False</span><span class="p">,</span><span class="kr">True</span><span class="p">)</span><span class="w"></span>
 
-<span class="c1">// Update relative to the old value</span>
-<span class="p">{</span> <span class="n">r</span> <span class="o">|</span> <span class="n">x</span> <span class="ow">-&gt;</span> <span class="n">x</span> <span class="o">+</span> <span class="mi">5</span> <span class="p">}</span>      <span class="o">==</span> <span class="p">{</span> <span class="n">x</span> <span class="ow">=</span> <span class="mi">20</span><span class="p">,</span> <span class="n">y</span> <span class="ow">=</span> <span class="mi">20</span> <span class="p">}</span>
+<span class="c1">// Update relative to the old value</span><span class="w"></span>
+<span class="p">{</span><span class="w"> </span><span class="n">r</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">5</span><span class="w"> </span><span class="p">}</span><span class="w">      </span><span class="o">==</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mi">20</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mi">20</span><span class="w"> </span><span class="p">}</span><span class="w"></span>
 
-<span class="c1">// Update a nested field</span>
-<span class="p">{</span> <span class="n">n</span> <span class="o">|</span> <span class="n">pt</span><span class="o">.</span><span class="n">x</span> <span class="ow">=</span> <span class="mi">10</span> <span class="p">}</span>       <span class="o">==</span> <span class="p">{</span> <span class="n">pt</span> <span class="ow">=</span> <span class="p">{</span> <span class="n">x</span> <span class="ow">=</span> <span class="mi">10</span><span class="p">,</span> <span class="n">y</span> <span class="ow">=</span> <span class="mi">20</span> <span class="p">},</span> <span class="n">size</span> <span class="ow">=</span> <span class="mi">100</span> <span class="p">}</span>
-<span class="p">{</span> <span class="n">n</span> <span class="o">|</span> <span class="n">pt</span><span class="o">.</span><span class="n">x</span> <span class="ow">-&gt;</span> <span class="n">x</span> <span class="o">+</span> <span class="mi">10</span> <span class="p">}</span>  <span class="o">==</span> <span class="p">{</span> <span class="n">pt</span> <span class="ow">=</span> <span class="p">{</span> <span class="n">x</span> <span class="ow">=</span> <span class="mi">25</span><span class="p">,</span> <span class="n">y</span> <span class="ow">=</span> <span class="mi">20</span> <span class="p">},</span> <span class="n">size</span> <span class="ow">=</span> <span class="mi">100</span> <span class="p">}</span>
+<span class="c1">// Update a nested field</span><span class="w"></span>
+<span class="p">{</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="n">pt</span><span class="o">.</span><span class="n">x</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mi">10</span><span class="w"> </span><span class="p">}</span><span class="w">       </span><span class="o">==</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="n">pt</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mi">10</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mi">20</span><span class="w"> </span><span class="p">},</span><span class="w"> </span><span class="n">size</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mi">100</span><span class="w"> </span><span class="p">}</span><span class="w"></span>
+<span class="p">{</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="n">pt</span><span class="o">.</span><span class="n">x</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">10</span><span class="w"> </span><span class="p">}</span><span class="w">  </span><span class="o">==</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="n">pt</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mi">25</span><span class="p">,</span><span class="w"> </span><span class="n">y</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mi">20</span><span class="w"> </span><span class="p">},</span><span class="w"> </span><span class="n">size</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mi">100</span><span class="w"> </span><span class="p">}</span><span class="w"></span>
 </pre></div>
 </div>
-</div>
-</div>
-<div class="section" id="sequences">
-<h2>Sequences<a class="headerlink" href="#sequences" title="Permalink to this headline"></a></h2>
+</section>
+</section>
+<section id="sequences">
+<h2>Sequences<a class="headerlink" href="#sequences" title="Permalink to this heading"></a></h2>
 <p>A sequence is a fixed-length collection of elements of the same type.
 The type of a finite sequence of length <cite>n</cite>, with elements of type <cite>a</cite>
 is <code class="docutils literal notranslate"><span class="pre">[n]</span> <span class="pre">a</span></code>.  Often, a finite sequence of bits, <code class="docutils literal notranslate"><span class="pre">[n]</span> <span class="pre">Bit</span></code>, is called a
 <em>word</em>.  We may abbreviate the type <code class="docutils literal notranslate"><span class="pre">[n]</span> <span class="pre">Bit</span></code> as <code class="docutils literal notranslate"><span class="pre">[n]</span></code>.  An infinite
 sequence with elements of type <cite>a</cite> has type <code class="docutils literal notranslate"><span class="pre">[inf]</span> <span class="pre">a</span></code>, and <code class="docutils literal notranslate"><span class="pre">[inf]</span></code> is
 an infinite stream of bits.</p>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="p">[</span><span class="n">e1</span><span class="p">,</span><span class="n">e2</span><span class="p">,</span><span class="n">e3</span><span class="p">]</span>            <span class="c1">// A sequence with three elements</span>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="p">[</span><span class="n">e1</span><span class="p">,</span><span class="n">e2</span><span class="p">,</span><span class="n">e3</span><span class="p">]</span><span class="w">            </span><span class="c1">// A sequence with three elements</span><span class="w"></span>
 
-<span class="p">[</span><span class="n">t1</span> <span class="o">..</span> <span class="n">t2</span><span class="p">]</span>            <span class="c1">// Enumeration</span>
-<span class="p">[</span><span class="n">t1</span> <span class="o">..</span> <span class="o">&lt;</span><span class="n">t2</span><span class="p">]</span>           <span class="c1">// Enumeration (exclusive bound)</span>
-<span class="p">[</span><span class="n">t1</span> <span class="o">..</span> <span class="n">t2</span> <span class="n">by</span> <span class="n">n</span><span class="p">]</span>       <span class="c1">// Enumeration (stride)</span>
-<span class="p">[</span><span class="n">t1</span> <span class="o">..</span> <span class="o">&lt;</span><span class="n">t2</span> <span class="n">by</span> <span class="n">n</span><span class="p">]</span>      <span class="c1">// Enumeration (stride, ex. bound)</span>
-<span class="p">[</span><span class="n">t1</span> <span class="o">..</span> <span class="n">t2</span> <span class="n">down</span> <span class="n">by</span> <span class="n">n</span><span class="p">]</span>  <span class="c1">// Enumeration (downward stride)</span>
-<span class="p">[</span><span class="n">t1</span> <span class="o">..</span> <span class="o">&gt;</span><span class="n">t2</span> <span class="n">down</span> <span class="n">by</span> <span class="n">n</span><span class="p">]</span> <span class="c1">// Enumeration (downward stride, ex. bound)</span>
-<span class="p">[</span><span class="n">t1</span><span class="p">,</span> <span class="n">t2</span> <span class="o">..</span> <span class="n">t3</span><span class="p">]</span>        <span class="c1">// Enumeration (step by t2 - t1)</span>
+<span class="p">[</span><span class="n">t1</span><span class="w"> </span><span class="o">..</span><span class="w"> </span><span class="n">t2</span><span class="p">]</span><span class="w">            </span><span class="c1">// Enumeration</span><span class="w"></span>
+<span class="p">[</span><span class="n">t1</span><span class="w"> </span><span class="o">..</span><span class="w"> </span><span class="o">&lt;</span><span class="n">t2</span><span class="p">]</span><span class="w">           </span><span class="c1">// Enumeration (exclusive bound)</span><span class="w"></span>
+<span class="p">[</span><span class="n">t1</span><span class="w"> </span><span class="o">..</span><span class="w"> </span><span class="n">t2</span><span class="w"> </span><span class="n">by</span><span class="w"> </span><span class="n">n</span><span class="p">]</span><span class="w">       </span><span class="c1">// Enumeration (stride)</span><span class="w"></span>
+<span class="p">[</span><span class="n">t1</span><span class="w"> </span><span class="o">..</span><span class="w"> </span><span class="o">&lt;</span><span class="n">t2</span><span class="w"> </span><span class="n">by</span><span class="w"> </span><span class="n">n</span><span class="p">]</span><span class="w">      </span><span class="c1">// Enumeration (stride, ex. bound)</span><span class="w"></span>
+<span class="p">[</span><span class="n">t1</span><span class="w"> </span><span class="o">..</span><span class="w"> </span><span class="n">t2</span><span class="w"> </span><span class="n">down</span><span class="w"> </span><span class="n">by</span><span class="w"> </span><span class="n">n</span><span class="p">]</span><span class="w">  </span><span class="c1">// Enumeration (downward stride)</span><span class="w"></span>
+<span class="p">[</span><span class="n">t1</span><span class="w"> </span><span class="o">..</span><span class="w"> </span><span class="o">&gt;</span><span class="n">t2</span><span class="w"> </span><span class="n">down</span><span class="w"> </span><span class="n">by</span><span class="w"> </span><span class="n">n</span><span class="p">]</span><span class="w"> </span><span class="c1">// Enumeration (downward stride, ex. bound)</span><span class="w"></span>
+<span class="p">[</span><span class="n">t1</span><span class="p">,</span><span class="w"> </span><span class="n">t2</span><span class="w"> </span><span class="o">..</span><span class="w"> </span><span class="n">t3</span><span class="p">]</span><span class="w">        </span><span class="c1">// Enumeration (step by t2 - t1)</span><span class="w"></span>
 
-<span class="p">[</span><span class="n">e1</span> <span class="o">...</span><span class="p">]</span>              <span class="c1">// Infinite sequence starting at e1</span>
-<span class="p">[</span><span class="n">e1</span><span class="p">,</span> <span class="n">e2</span> <span class="o">...</span><span class="p">]</span>          <span class="c1">// Infinite sequence stepping by e2-e1</span>
+<span class="p">[</span><span class="n">e1</span><span class="w"> </span><span class="o">...</span><span class="p">]</span><span class="w">              </span><span class="c1">// Infinite sequence starting at e1</span><span class="w"></span>
+<span class="p">[</span><span class="n">e1</span><span class="p">,</span><span class="w"> </span><span class="n">e2</span><span class="w"> </span><span class="o">...</span><span class="p">]</span><span class="w">          </span><span class="c1">// Infinite sequence stepping by e2-e1</span><span class="w"></span>
 
-<span class="p">[</span> <span class="n">e</span> <span class="o">|</span> <span class="n">p11</span> <span class="ow">&lt;-</span> <span class="n">e11</span><span class="p">,</span> <span class="n">p12</span> <span class="ow">&lt;-</span> <span class="n">e12</span>    <span class="c1">// Sequence comprehensions</span>
-    <span class="o">|</span> <span class="n">p21</span> <span class="ow">&lt;-</span> <span class="n">e21</span><span class="p">,</span> <span class="n">p22</span> <span class="ow">&lt;-</span> <span class="n">e22</span> <span class="p">]</span>
+<span class="p">[</span><span class="w"> </span><span class="n">e</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="n">p11</span><span class="w"> </span><span class="ow">&lt;-</span><span class="w"> </span><span class="n">e11</span><span class="p">,</span><span class="w"> </span><span class="n">p12</span><span class="w"> </span><span class="ow">&lt;-</span><span class="w"> </span><span class="n">e12</span><span class="w">    </span><span class="c1">// Sequence comprehensions</span><span class="w"></span>
+<span class="w">    </span><span class="o">|</span><span class="w"> </span><span class="n">p21</span><span class="w"> </span><span class="ow">&lt;-</span><span class="w"> </span><span class="n">e21</span><span class="p">,</span><span class="w"> </span><span class="n">p22</span><span class="w"> </span><span class="ow">&lt;-</span><span class="w"> </span><span class="n">e22</span><span class="w"> </span><span class="p">]</span><span class="w"></span>
 
-<span class="nf">x</span> <span class="ow">=</span> <span class="n">generate</span> <span class="p">(</span><span class="nf">\</span><span class="n">i</span> <span class="ow">-&gt;</span> <span class="n">e</span><span class="p">)</span>    <span class="c1">// Sequence from generating function</span>
-<span class="nf">x</span> <span class="o">@</span> <span class="n">i</span> <span class="ow">=</span> <span class="n">e</span>                 <span class="c1">// Sequence with index binding</span>
-<span class="nf">arr</span> <span class="o">@</span> <span class="n">i</span> <span class="o">@</span> <span class="n">j</span> <span class="ow">=</span> <span class="n">e</span>           <span class="c1">// Two-dimensional sequence</span>
+<span class="nf">x</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="n">generate</span><span class="w"> </span><span class="p">(</span><span class="nf">\</span><span class="n">i</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">e</span><span class="p">)</span><span class="w">    </span><span class="c1">// Sequence from generating function</span><span class="w"></span>
+<span class="nf">x</span><span class="w"> </span><span class="o">@</span><span class="w"> </span><span class="n">i</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="n">e</span><span class="w">                 </span><span class="c1">// Sequence with index binding</span><span class="w"></span>
+<span class="nf">arr</span><span class="w"> </span><span class="o">@</span><span class="w"> </span><span class="n">i</span><span class="w"> </span><span class="o">@</span><span class="w"> </span><span class="n">j</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="n">e</span><span class="w">           </span><span class="c1">// Two-dimensional sequence</span><span class="w"></span>
 </pre></div>
 </div>
 <p>Note: the bounds in finite sequences (those with <cite>..</cite>) are type
@@ -258,19 +260,19 @@ <h2>Sequences<a class="headerlink" href="#sequences" title="Permalink to this he
 </tbody>
 </table>
 <p>There are also lifted pointwise operations.</p>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="p">[</span><span class="n">p1</span><span class="p">,</span> <span class="n">p2</span><span class="p">,</span> <span class="n">p3</span><span class="p">,</span> <span class="n">p4</span><span class="p">]</span>          <span class="c1">// Sequence pattern</span>
-<span class="nf">p1</span> <span class="o">#</span> <span class="n">p2</span>                   <span class="c1">// Split sequence pattern</span>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="p">[</span><span class="n">p1</span><span class="p">,</span><span class="w"> </span><span class="n">p2</span><span class="p">,</span><span class="w"> </span><span class="n">p3</span><span class="p">,</span><span class="w"> </span><span class="n">p4</span><span class="p">]</span><span class="w">          </span><span class="c1">// Sequence pattern</span><span class="w"></span>
+<span class="nf">p1</span><span class="w"> </span><span class="o">#</span><span class="w"> </span><span class="n">p2</span><span class="w">                   </span><span class="c1">// Split sequence pattern</span><span class="w"></span>
 </pre></div>
 </div>
-</div>
-<div class="section" id="functions">
-<h2>Functions<a class="headerlink" href="#functions" title="Permalink to this headline"></a></h2>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">\</span><span class="n">p1</span> <span class="n">p2</span> <span class="ow">-&gt;</span> <span class="n">e</span>              <span class="c1">// Lambda expression</span>
-<span class="nf">f</span> <span class="n">p1</span> <span class="n">p2</span> <span class="ow">=</span> <span class="n">e</span>              <span class="c1">// Function definition</span>
+</section>
+<section id="functions">
+<h2>Functions<a class="headerlink" href="#functions" title="Permalink to this heading"></a></h2>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">\</span><span class="n">p1</span><span class="w"> </span><span class="n">p2</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">e</span><span class="w">              </span><span class="c1">// Lambda expression</span><span class="w"></span>
+<span class="nf">f</span><span class="w"> </span><span class="n">p1</span><span class="w"> </span><span class="n">p2</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="n">e</span><span class="w">              </span><span class="c1">// Function definition</span><span class="w"></span>
 </pre></div>
 </div>
-</div>
-</div>
+</section>
+</section>
 
 
            </div>
diff --git a/docs/RefMan/_build/html/Expressions.html b/docs/RefMan/_build/html/Expressions.html
index d00e28191..35c450b07 100644
--- a/docs/RefMan/_build/html/Expressions.html
+++ b/docs/RefMan/_build/html/Expressions.html
@@ -1,7 +1,8 @@
 <!DOCTYPE html>
 <html class="writer-html5" lang="en" >
 <head>
-  <meta charset="utf-8" />
+  <meta charset="utf-8" /><meta name="generator" content="Docutils 0.17.1: http://docutils.sourceforge.net/" />
+
   <meta name="viewport" content="width=device-width, initial-scale=1.0" />
   <title>Expressions &mdash; Cryptol 2.11.0 documentation</title>
       <link rel="stylesheet" href="_static/pygments.css" type="text/css" />
@@ -13,6 +14,7 @@
         <script data-url_root="./" id="documentation_options" src="_static/documentation_options.js"></script>
         <script src="_static/jquery.js"></script>
         <script src="_static/underscore.js"></script>
+        <script src="_static/_sphinx_javascript_frameworks_compat.js"></script>
         <script src="_static/doctools.js"></script>
     <script src="_static/js/theme.js"></script>
     <link rel="index" title="Index" href="genindex.html" />
@@ -81,134 +83,134 @@
           <div role="main" class="document" itemscope="itemscope" itemtype="http://schema.org/Article">
            <div itemprop="articleBody">
              
-  <div class="section" id="expressions">
-<h1>Expressions<a class="headerlink" href="#expressions" title="Permalink to this headline"></a></h1>
+  <section id="expressions">
+<h1>Expressions<a class="headerlink" href="#expressions" title="Permalink to this heading"></a></h1>
 <p>This section provides an overview of the Cryptol’s expression syntax.</p>
-<div class="section" id="calling-functions">
-<h2>Calling Functions<a class="headerlink" href="#calling-functions" title="Permalink to this headline"></a></h2>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">f</span> <span class="mi">2</span>             <span class="c1">// call `f` with parameter `2`</span>
-<span class="nf">g</span> <span class="n">x</span> <span class="n">y</span>           <span class="c1">// call `g` with two parameters: `x` and `y`</span>
-<span class="nf">h</span> <span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="n">y</span><span class="p">)</span>         <span class="c1">// call `h` with one parameter,  the pair `(x,y)`</span>
+<section id="calling-functions">
+<h2>Calling Functions<a class="headerlink" href="#calling-functions" title="Permalink to this heading"></a></h2>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">f</span><span class="w"> </span><span class="mi">2</span><span class="w">             </span><span class="c1">// call `f` with parameter `2`</span><span class="w"></span>
+<span class="nf">g</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="n">y</span><span class="w">           </span><span class="c1">// call `g` with two parameters: `x` and `y`</span><span class="w"></span>
+<span class="nf">h</span><span class="w"> </span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="n">y</span><span class="p">)</span><span class="w">         </span><span class="c1">// call `h` with one parameter,  the pair `(x,y)`</span><span class="w"></span>
 </pre></div>
 </div>
-</div>
-<div class="section" id="prefix-operators">
-<h2>Prefix Operators<a class="headerlink" href="#prefix-operators" title="Permalink to this headline"></a></h2>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="o">-</span><span class="mi">2</span>              <span class="c1">// call unary `-` with parameter `2`</span>
-<span class="o">-</span> <span class="mi">2</span>             <span class="c1">// call unary `-` with parameter `2`</span>
-<span class="nf">f</span> <span class="p">(</span><span class="o">-</span><span class="mi">2</span><span class="p">)</span>          <span class="c1">// call `f` with one argument: `-2`,  parens are important</span>
-<span class="o">-</span><span class="n">f</span> <span class="mi">2</span>            <span class="c1">// call unary `-` with parameter `f 2`</span>
-<span class="o">-</span> <span class="n">f</span> <span class="mi">2</span>           <span class="c1">// call unary `-` with parameter `f 2`</span>
+</section>
+<section id="prefix-operators">
+<h2>Prefix Operators<a class="headerlink" href="#prefix-operators" title="Permalink to this heading"></a></h2>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="o">-</span><span class="mi">2</span><span class="w">              </span><span class="c1">// call unary `-` with parameter `2`</span><span class="w"></span>
+<span class="o">-</span><span class="w"> </span><span class="mi">2</span><span class="w">             </span><span class="c1">// call unary `-` with parameter `2`</span><span class="w"></span>
+<span class="nf">f</span><span class="w"> </span><span class="p">(</span><span class="o">-</span><span class="mi">2</span><span class="p">)</span><span class="w">          </span><span class="c1">// call `f` with one argument: `-2`,  parens are important</span><span class="w"></span>
+<span class="o">-</span><span class="n">f</span><span class="w"> </span><span class="mi">2</span><span class="w">            </span><span class="c1">// call unary `-` with parameter `f 2`</span><span class="w"></span>
+<span class="o">-</span><span class="w"> </span><span class="n">f</span><span class="w"> </span><span class="mi">2</span><span class="w">           </span><span class="c1">// call unary `-` with parameter `f 2`</span><span class="w"></span>
 </pre></div>
 </div>
-</div>
-<div class="section" id="infix-functions">
-<h2>Infix Functions<a class="headerlink" href="#infix-functions" title="Permalink to this headline"></a></h2>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="mi">2</span> <span class="o">+</span> <span class="mi">3</span>           <span class="c1">// call `+` with two parameters: `2` and `3`</span>
-<span class="mi">2</span> <span class="o">+</span> <span class="mi">3</span> <span class="o">*</span> <span class="mi">5</span>       <span class="c1">// call `+` with two parameters: `2` and `3 * 5`</span>
-<span class="p">(</span><span class="o">+</span><span class="p">)</span> <span class="mi">2</span> <span class="mi">3</span>         <span class="c1">// call `+` with two parameters: `2` and `3`</span>
-<span class="nf">f</span> <span class="mi">2</span> <span class="o">+</span> <span class="n">g</span> <span class="mi">3</span>       <span class="c1">// call `+` with two parameters: `f 2` and `g 3`</span>
-<span class="o">-</span> <span class="mi">2</span> <span class="o">+</span> <span class="o">-</span> <span class="mi">3</span>       <span class="c1">// call `+` with two parameters: `-2` and `-3`</span>
-<span class="o">-</span> <span class="n">f</span> <span class="mi">2</span> <span class="o">+</span> <span class="o">-</span> <span class="n">g</span> <span class="mi">3</span>
+</section>
+<section id="infix-functions">
+<h2>Infix Functions<a class="headerlink" href="#infix-functions" title="Permalink to this heading"></a></h2>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="mi">2</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">3</span><span class="w">           </span><span class="c1">// call `+` with two parameters: `2` and `3`</span><span class="w"></span>
+<span class="mi">2</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">3</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="mi">5</span><span class="w">       </span><span class="c1">// call `+` with two parameters: `2` and `3 * 5`</span><span class="w"></span>
+<span class="p">(</span><span class="o">+</span><span class="p">)</span><span class="w"> </span><span class="mi">2</span><span class="w"> </span><span class="mi">3</span><span class="w">         </span><span class="c1">// call `+` with two parameters: `2` and `3`</span><span class="w"></span>
+<span class="nf">f</span><span class="w"> </span><span class="mi">2</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">g</span><span class="w"> </span><span class="mi">3</span><span class="w">       </span><span class="c1">// call `+` with two parameters: `f 2` and `g 3`</span><span class="w"></span>
+<span class="o">-</span><span class="w"> </span><span class="mi">2</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="mi">3</span><span class="w">       </span><span class="c1">// call `+` with two parameters: `-2` and `-3`</span><span class="w"></span>
+<span class="o">-</span><span class="w"> </span><span class="n">f</span><span class="w"> </span><span class="mi">2</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="o">-</span><span class="w"> </span><span class="n">g</span><span class="w"> </span><span class="mi">3</span><span class="w"></span>
 </pre></div>
 </div>
-</div>
-<div class="section" id="type-annotations">
-<h2>Type Annotations<a class="headerlink" href="#type-annotations" title="Permalink to this headline"></a></h2>
+</section>
+<section id="type-annotations">
+<h2>Type Annotations<a class="headerlink" href="#type-annotations" title="Permalink to this heading"></a></h2>
 <p>Explicit type annotations may be added on expressions, patterns, and
 in argument definitions.</p>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">x</span> <span class="kt">:</span> <span class="kr">Bit</span>         <span class="c1">// specify that `x` has type `Bit`</span>
-<span class="nf">f</span> <span class="n">x</span> <span class="kt">:</span> <span class="kr">Bit</span>       <span class="c1">// specify that `f x` has type `Bit`</span>
-<span class="o">-</span> <span class="n">f</span> <span class="n">x</span> <span class="kt">:</span> <span class="p">[</span><span class="mi">8</span><span class="p">]</span>     <span class="c1">// specify that `- f x` has type `[8]`</span>
-<span class="mi">2</span> <span class="o">+</span> <span class="mi">3</span> <span class="kt">:</span> <span class="p">[</span><span class="mi">8</span><span class="p">]</span>     <span class="c1">// specify that `2 + 3` has type `[8]`</span>
-<span class="nf">\</span><span class="n">x</span> <span class="ow">-&gt;</span> <span class="n">x</span> <span class="kt">:</span> <span class="p">[</span><span class="mi">8</span><span class="p">]</span>   <span class="c1">// type annotation is on `x`, not the function</span>
-<span class="kr">if</span> <span class="n">x</span>
-  <span class="kr">then</span> <span class="n">y</span>
-  <span class="kr">else</span> <span class="n">z</span> <span class="kt">:</span> <span class="kr">Bit</span>  <span class="c1">// the type annotation is on `z`, not the whole `if`</span>
-<span class="p">[</span><span class="mi">1</span><span class="o">..</span><span class="mi">9</span> <span class="kt">:</span> <span class="p">[</span><span class="mi">8</span><span class="p">]]</span>    <span class="c1">// specify that elements in `[1..9]` have type `[8]`</span>
-
-<span class="nf">f</span> <span class="p">(</span><span class="n">x</span> <span class="kt">:</span> <span class="p">[</span><span class="mi">8</span><span class="p">])</span> <span class="ow">=</span> <span class="n">x</span> <span class="o">+</span> <span class="mi">1</span>   <span class="c1">// type annotation on patterns</span>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">x</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="kr">Bit</span><span class="w">         </span><span class="c1">// specify that `x` has type `Bit`</span><span class="w"></span>
+<span class="nf">f</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="kr">Bit</span><span class="w">       </span><span class="c1">// specify that `f x` has type `Bit`</span><span class="w"></span>
+<span class="o">-</span><span class="w"> </span><span class="n">f</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="p">[</span><span class="mi">8</span><span class="p">]</span><span class="w">     </span><span class="c1">// specify that `- f x` has type `[8]`</span><span class="w"></span>
+<span class="mi">2</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">3</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="p">[</span><span class="mi">8</span><span class="p">]</span><span class="w">     </span><span class="c1">// specify that `2 + 3` has type `[8]`</span><span class="w"></span>
+<span class="nf">\</span><span class="n">x</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="p">[</span><span class="mi">8</span><span class="p">]</span><span class="w">   </span><span class="c1">// type annotation is on `x`, not the function</span><span class="w"></span>
+<span class="kr">if</span><span class="w"> </span><span class="n">x</span><span class="w"></span>
+<span class="w">  </span><span class="kr">then</span><span class="w"> </span><span class="n">y</span><span class="w"></span>
+<span class="w">  </span><span class="kr">else</span><span class="w"> </span><span class="n">z</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="kr">Bit</span><span class="w">  </span><span class="c1">// the type annotation is on `z`, not the whole `if`</span><span class="w"></span>
+<span class="p">[</span><span class="mi">1</span><span class="o">..</span><span class="mi">9</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="p">[</span><span class="mi">8</span><span class="p">]]</span><span class="w">    </span><span class="c1">// specify that elements in `[1..9]` have type `[8]`</span><span class="w"></span>
+
+<span class="nf">f</span><span class="w"> </span><span class="p">(</span><span class="n">x</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="p">[</span><span class="mi">8</span><span class="p">])</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">1</span><span class="w">   </span><span class="c1">// type annotation on patterns</span><span class="w"></span>
 </pre></div>
 </div>
 <div class="admonition-todo admonition" id="id1">
 <p class="admonition-title">Todo</p>
 <p>Patterns with type variables</p>
 </div>
-</div>
-<div class="section" id="explicit-type-instantiation">
-<h2>Explicit Type Instantiation<a class="headerlink" href="#explicit-type-instantiation" title="Permalink to this headline"></a></h2>
+</section>
+<section id="explicit-type-instantiation">
+<h2>Explicit Type Instantiation<a class="headerlink" href="#explicit-type-instantiation" title="Permalink to this heading"></a></h2>
 <p>If <code class="docutils literal notranslate"><span class="pre">f</span></code> is a polymorphic value with type:</p>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">f</span> <span class="kt">:</span> <span class="p">{</span> <span class="n">tyParam</span> <span class="p">}</span> <span class="n">tyParam</span>
-<span class="nf">f</span> <span class="ow">=</span> <span class="n">zero</span>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">f</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="n">tyParam</span><span class="w"> </span><span class="p">}</span><span class="w"> </span><span class="n">tyParam</span><span class="w"></span>
+<span class="nf">f</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="n">zero</span><span class="w"></span>
 </pre></div>
 </div>
 <p>you can evaluate <code class="docutils literal notranslate"><span class="pre">f</span></code>, passing it a type parameter:</p>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">f</span> <span class="p">`{</span> <span class="n">tyParam</span> <span class="ow">=</span> <span class="mi">13</span> <span class="p">}</span>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">f</span><span class="w"> </span><span class="p">`{</span><span class="w"> </span><span class="n">tyParam</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mi">13</span><span class="w"> </span><span class="p">}</span><span class="w"></span>
 </pre></div>
 </div>
-</div>
-<div class="section" id="local-declarations">
-<h2>Local Declarations<a class="headerlink" href="#local-declarations" title="Permalink to this headline"></a></h2>
+</section>
+<section id="local-declarations">
+<h2>Local Declarations<a class="headerlink" href="#local-declarations" title="Permalink to this heading"></a></h2>
 <p>Local declarations have the weakest precedence of all expressions.</p>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="mi">2</span> <span class="o">+</span> <span class="n">x</span> <span class="kt">:</span> <span class="p">[</span><span class="kt">T</span><span class="p">]</span>
-  <span class="kr">where</span>
-  <span class="kr">type</span> <span class="kt">T</span> <span class="ow">=</span> <span class="mi">8</span>
-  <span class="n">x</span>      <span class="ow">=</span> <span class="mi">2</span>          <span class="c1">// `T` and `x` are in scope of `2 + x : `[T]`</span>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="mi">2</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="p">[</span><span class="kt">T</span><span class="p">]</span><span class="w"></span>
+<span class="w">  </span><span class="kr">where</span><span class="w"></span>
+<span class="w">  </span><span class="kr">type</span><span class="w"> </span><span class="kt">T</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mi">8</span><span class="w"></span>
+<span class="w">  </span><span class="n">x</span><span class="w">      </span><span class="ow">=</span><span class="w"> </span><span class="mi">2</span><span class="w">          </span><span class="c1">// `T` and `x` are in scope of `2 + x : `[T]`</span><span class="w"></span>
 
-<span class="kr">if</span> <span class="n">x</span> <span class="kr">then</span> <span class="mi">1</span> <span class="kr">else</span> <span class="mi">2</span>
-  <span class="kr">where</span> <span class="n">x</span> <span class="ow">=</span> <span class="mi">2</span>         <span class="c1">// `x` is in scope in the whole `if`</span>
+<span class="kr">if</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="kr">then</span><span class="w"> </span><span class="mi">1</span><span class="w"> </span><span class="kr">else</span><span class="w"> </span><span class="mi">2</span><span class="w"></span>
+<span class="w">  </span><span class="kr">where</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mi">2</span><span class="w">         </span><span class="c1">// `x` is in scope in the whole `if`</span><span class="w"></span>
 
-<span class="nf">\</span><span class="n">y</span> <span class="ow">-&gt;</span> <span class="n">x</span> <span class="o">+</span> <span class="n">y</span>
-  <span class="kr">where</span> <span class="n">x</span> <span class="ow">=</span> <span class="mi">2</span>         <span class="c1">// `y` is not in scope in the defintion of `x`</span>
+<span class="nf">\</span><span class="n">y</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">y</span><span class="w"></span>
+<span class="w">  </span><span class="kr">where</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mi">2</span><span class="w">         </span><span class="c1">// `y` is not in scope in the defintion of `x`</span><span class="w"></span>
 </pre></div>
 </div>
-</div>
-<div class="section" id="block-arguments">
-<h2>Block Arguments<a class="headerlink" href="#block-arguments" title="Permalink to this headline"></a></h2>
+</section>
+<section id="block-arguments">
+<h2>Block Arguments<a class="headerlink" href="#block-arguments" title="Permalink to this heading"></a></h2>
 <p>When used as the last argument to a function call,
 <code class="docutils literal notranslate"><span class="pre">if</span></code> and lambda expressions do not need parens:</p>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">f</span> <span class="nf">\</span><span class="n">x</span> <span class="ow">-&gt;</span> <span class="n">x</span>       <span class="c1">// call `f` with one argument `x -&gt; x`</span>
-<span class="mi">2</span> <span class="o">+</span> <span class="kr">if</span> <span class="n">x</span>
-      <span class="kr">then</span> <span class="n">y</span>
-      <span class="kr">else</span> <span class="n">z</span>    <span class="c1">// call `+` with two arguments: `2` and `if ...`</span>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">f</span><span class="w"> </span><span class="nf">\</span><span class="n">x</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">x</span><span class="w">       </span><span class="c1">// call `f` with one argument `x -&gt; x`</span><span class="w"></span>
+<span class="mi">2</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="kr">if</span><span class="w"> </span><span class="n">x</span><span class="w"></span>
+<span class="w">      </span><span class="kr">then</span><span class="w"> </span><span class="n">y</span><span class="w"></span>
+<span class="w">      </span><span class="kr">else</span><span class="w"> </span><span class="n">z</span><span class="w">    </span><span class="c1">// call `+` with two arguments: `2` and `if ...`</span><span class="w"></span>
 </pre></div>
 </div>
-</div>
-<div class="section" id="conditionals">
-<h2>Conditionals<a class="headerlink" href="#conditionals" title="Permalink to this headline"></a></h2>
+</section>
+<section id="conditionals">
+<h2>Conditionals<a class="headerlink" href="#conditionals" title="Permalink to this heading"></a></h2>
 <p>The <code class="docutils literal notranslate"><span class="pre">if</span> <span class="pre">...</span> <span class="pre">then</span> <span class="pre">...</span> <span class="pre">else</span></code> construct can be used with
 multiple branches. For example:</p>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">x</span> <span class="ow">=</span> <span class="kr">if</span> <span class="n">y</span> <span class="o">%</span> <span class="mi">2</span> <span class="o">==</span> <span class="mi">0</span> <span class="kr">then</span> <span class="mi">22</span> <span class="kr">else</span> <span class="mi">33</span>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">x</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="kr">if</span><span class="w"> </span><span class="n">y</span><span class="w"> </span><span class="o">%</span><span class="w"> </span><span class="mi">2</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">0</span><span class="w"> </span><span class="kr">then</span><span class="w"> </span><span class="mi">22</span><span class="w"> </span><span class="kr">else</span><span class="w"> </span><span class="mi">33</span><span class="w"></span>
 
-<span class="nf">x</span> <span class="ow">=</span> <span class="kr">if</span> <span class="n">y</span> <span class="o">%</span> <span class="mi">2</span> <span class="o">==</span> <span class="mi">0</span> <span class="kr">then</span> <span class="mi">1</span>
-     <span class="o">|</span> <span class="n">y</span> <span class="o">%</span> <span class="mi">3</span> <span class="o">==</span> <span class="mi">0</span> <span class="kr">then</span> <span class="mi">2</span>
-     <span class="o">|</span> <span class="n">y</span> <span class="o">%</span> <span class="mi">5</span> <span class="o">==</span> <span class="mi">0</span> <span class="kr">then</span> <span class="mi">3</span>
-     <span class="kr">else</span> <span class="mi">7</span>
+<span class="nf">x</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="kr">if</span><span class="w"> </span><span class="n">y</span><span class="w"> </span><span class="o">%</span><span class="w"> </span><span class="mi">2</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">0</span><span class="w"> </span><span class="kr">then</span><span class="w"> </span><span class="mi">1</span><span class="w"></span>
+<span class="w">     </span><span class="o">|</span><span class="w"> </span><span class="n">y</span><span class="w"> </span><span class="o">%</span><span class="w"> </span><span class="mi">3</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">0</span><span class="w"> </span><span class="kr">then</span><span class="w"> </span><span class="mi">2</span><span class="w"></span>
+<span class="w">     </span><span class="o">|</span><span class="w"> </span><span class="n">y</span><span class="w"> </span><span class="o">%</span><span class="w"> </span><span class="mi">5</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">0</span><span class="w"> </span><span class="kr">then</span><span class="w"> </span><span class="mi">3</span><span class="w"></span>
+<span class="w">     </span><span class="kr">else</span><span class="w"> </span><span class="mi">7</span><span class="w"></span>
 </pre></div>
 </div>
-</div>
-<div class="section" id="demoting-numeric-types-to-values">
-<h2>Demoting Numeric Types to Values<a class="headerlink" href="#demoting-numeric-types-to-values" title="Permalink to this headline"></a></h2>
+</section>
+<section id="demoting-numeric-types-to-values">
+<h2>Demoting Numeric Types to Values<a class="headerlink" href="#demoting-numeric-types-to-values" title="Permalink to this heading"></a></h2>
 <p>The value corresponding to a numeric type may be accessed using the
 following notation:</p>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="p">`</span><span class="n">t</span>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="p">`</span><span class="n">t</span><span class="w"></span>
 </pre></div>
 </div>
 <p>Here <cite>t</cite> should be a finite type expression with numeric kind.  The resulting
 expression will be of a numeric base type, which is sufficiently large
 to accommodate the value of the type:</p>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="p">`</span><span class="n">t</span> <span class="kt">:</span> <span class="p">{</span><span class="n">a</span><span class="p">}</span> <span class="p">(</span><span class="kt">Literal</span> <span class="n">t</span> <span class="n">a</span><span class="p">)</span> <span class="ow">=&gt;</span> <span class="n">a</span>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="p">`</span><span class="n">t</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">a</span><span class="p">}</span><span class="w"> </span><span class="p">(</span><span class="kt">Literal</span><span class="w"> </span><span class="n">t</span><span class="w"> </span><span class="n">a</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"></span>
 </pre></div>
 </div>
 <p>This backtick notation is syntax sugar for an application of the
 <cite>number</cite> primtive, so the above may be written as:</p>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">number</span><span class="p">`{</span><span class="n">t</span><span class="p">}</span> <span class="kt">:</span> <span class="p">{</span><span class="n">a</span><span class="p">}</span> <span class="p">(</span><span class="kt">Literal</span> <span class="n">t</span> <span class="n">a</span><span class="p">)</span> <span class="ow">=&gt;</span> <span class="n">a</span>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">number</span><span class="p">`{</span><span class="n">t</span><span class="p">}</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">a</span><span class="p">}</span><span class="w"> </span><span class="p">(</span><span class="kt">Literal</span><span class="w"> </span><span class="n">t</span><span class="w"> </span><span class="n">a</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"></span>
 </pre></div>
 </div>
 <p>If a type cannot be inferred from context, a suitable type will be
 automatically chosen if possible, usually <cite>Integer</cite>.</p>
-</div>
-</div>
+</section>
+</section>
 
 
            </div>
diff --git a/docs/RefMan/_build/html/Modules.html b/docs/RefMan/_build/html/Modules.html
index b7b58d915..0be50b526 100644
--- a/docs/RefMan/_build/html/Modules.html
+++ b/docs/RefMan/_build/html/Modules.html
@@ -1,7 +1,8 @@
 <!DOCTYPE html>
 <html class="writer-html5" lang="en" >
 <head>
-  <meta charset="utf-8" />
+  <meta charset="utf-8" /><meta name="generator" content="Docutils 0.17.1: http://docutils.sourceforge.net/" />
+
   <meta name="viewport" content="width=device-width, initial-scale=1.0" />
   <title>Modules &mdash; Cryptol 2.11.0 documentation</title>
       <link rel="stylesheet" href="_static/pygments.css" type="text/css" />
@@ -13,6 +14,7 @@
         <script data-url_root="./" id="documentation_options" src="_static/documentation_options.js"></script>
         <script src="_static/jquery.js"></script>
         <script src="_static/underscore.js"></script>
+        <script src="_static/_sphinx_javascript_frameworks_compat.js"></script>
         <script src="_static/doctools.js"></script>
     <script src="_static/js/theme.js"></script>
     <link rel="index" title="Index" href="genindex.html" />
@@ -95,26 +97,26 @@
           <div role="main" class="document" itemscope="itemscope" itemtype="http://schema.org/Article">
            <div itemprop="articleBody">
              
-  <div class="section" id="modules">
-<h1>Modules<a class="headerlink" href="#modules" title="Permalink to this headline"></a></h1>
+  <section id="modules">
+<h1>Modules<a class="headerlink" href="#modules" title="Permalink to this heading"></a></h1>
 <p>A <em>module</em> is used to group some related definitions.  Each file may
 contain at most one top-level module.</p>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kr">module</span> <span class="nn">M</span> <span class="kr">where</span>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kr">module</span><span class="w"> </span><span class="nn">M</span><span class="w"> </span><span class="kr">where</span><span class="w"></span>
 
-<span class="kr">type</span> <span class="kt">T</span> <span class="ow">=</span> <span class="p">[</span><span class="mi">8</span><span class="p">]</span>
+<span class="kr">type</span><span class="w"> </span><span class="kt">T</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="p">[</span><span class="mi">8</span><span class="p">]</span><span class="w"></span>
 
-<span class="nf">f</span> <span class="kt">:</span> <span class="p">[</span><span class="mi">8</span><span class="p">]</span>
-<span class="nf">f</span> <span class="ow">=</span> <span class="mi">10</span>
+<span class="nf">f</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="p">[</span><span class="mi">8</span><span class="p">]</span><span class="w"></span>
+<span class="nf">f</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mi">10</span><span class="w"></span>
 </pre></div>
 </div>
-<div class="section" id="hierarchical-module-names">
-<h2>Hierarchical Module Names<a class="headerlink" href="#hierarchical-module-names" title="Permalink to this headline"></a></h2>
+<section id="hierarchical-module-names">
+<h2>Hierarchical Module Names<a class="headerlink" href="#hierarchical-module-names" title="Permalink to this heading"></a></h2>
 <p>Module may have either simple or <em>hierarchical</em> names.
 Hierarchical names are constructed by gluing together ordinary
 identifiers using the symbol <code class="docutils literal notranslate"><span class="pre">::</span></code>.</p>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kr">module</span> <span class="nn">Hash</span><span class="ow">::</span><span class="kt">SHA256</span> <span class="kr">where</span>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kr">module</span><span class="w"> </span><span class="nn">Hash</span><span class="ow">::</span><span class="kt">SHA256</span><span class="w"> </span><span class="kr">where</span><span class="w"></span>
 
-<span class="nf">sha256</span> <span class="ow">=</span> <span class="o">...</span>
+<span class="nf">sha256</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="o">...</span><span class="w"></span>
 </pre></div>
 </div>
 <p>The structure in the name may be used to group together related
@@ -123,104 +125,104 @@ <h2>Hierarchical Module Names<a class="headerlink" href="#hierarchical-module-na
 For example, when searching for module <code class="docutils literal notranslate"><span class="pre">Hash::SHA256</span></code>, Cryptol
 will look for a file named <code class="docutils literal notranslate"><span class="pre">SHA256.cry</span></code> in a directory called
 <code class="docutils literal notranslate"><span class="pre">Hash</span></code>, contained in one of the directories specified by <code class="docutils literal notranslate"><span class="pre">CRYPTOLPATH</span></code>.</p>
-</div>
-<div class="section" id="module-imports">
-<h2>Module Imports<a class="headerlink" href="#module-imports" title="Permalink to this headline"></a></h2>
+</section>
+<section id="module-imports">
+<h2>Module Imports<a class="headerlink" href="#module-imports" title="Permalink to this heading"></a></h2>
 <p>To use the definitions from one module in another module, we use
 <code class="docutils literal notranslate"><span class="pre">import</span></code> declarations:</p>
 <div class="literal-block-wrapper docutils container" id="id1">
 <div class="code-block-caption"><span class="caption-text">module M</span><a class="headerlink" href="#id1" title="Permalink to this code"></a></div>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="c1">// Provide some definitions</span>
-<span class="kr">module</span> <span class="nn">M</span> <span class="kr">where</span>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="c1">// Provide some definitions</span><span class="w"></span>
+<span class="kr">module</span><span class="w"> </span><span class="nn">M</span><span class="w"> </span><span class="kr">where</span><span class="w"></span>
 
-<span class="nf">f</span> <span class="kt">:</span> <span class="p">[</span><span class="mi">8</span><span class="p">]</span>
-<span class="nf">f</span> <span class="ow">=</span> <span class="mi">2</span>
+<span class="nf">f</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="p">[</span><span class="mi">8</span><span class="p">]</span><span class="w"></span>
+<span class="nf">f</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mi">2</span><span class="w"></span>
 </pre></div>
 </div>
 </div>
 <div class="literal-block-wrapper docutils container" id="id2">
 <div class="code-block-caption"><span class="caption-text">module N</span><a class="headerlink" href="#id2" title="Permalink to this code"></a></div>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="c1">// Uses definitions from `M`</span>
-<span class="kr">module</span> <span class="nn">N</span> <span class="kr">where</span>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="c1">// Uses definitions from `M`</span><span class="w"></span>
+<span class="kr">module</span><span class="w"> </span><span class="nn">N</span><span class="w"> </span><span class="kr">where</span><span class="w"></span>
 
-<span class="kr">import</span> <span class="nn">M</span>  <span class="c1">// import all definitions from `M`</span>
+<span class="kr">import</span><span class="w"> </span><span class="nn">M</span><span class="w">  </span><span class="c1">// import all definitions from `M`</span><span class="w"></span>
 
-<span class="nf">g</span> <span class="ow">=</span> <span class="n">f</span>   <span class="c1">// `f` was imported from `M`</span>
+<span class="nf">g</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="n">f</span><span class="w">   </span><span class="c1">// `f` was imported from `M`</span><span class="w"></span>
 </pre></div>
 </div>
 </div>
-<div class="section" id="import-lists">
-<h3>Import Lists<a class="headerlink" href="#import-lists" title="Permalink to this headline"></a></h3>
+<section id="import-lists">
+<h3>Import Lists<a class="headerlink" href="#import-lists" title="Permalink to this heading"></a></h3>
 <p>Sometimes, we may want to import only some of the definitions
 from a module.  To do so, we use an import declaration with
 an <em>import list</em>.</p>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kr">module</span> <span class="nn">M</span> <span class="kr">where</span>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kr">module</span><span class="w"> </span><span class="nn">M</span><span class="w"> </span><span class="kr">where</span><span class="w"></span>
 
-<span class="nf">f</span> <span class="ow">=</span> <span class="mh">0x02</span>
-<span class="nf">g</span> <span class="ow">=</span> <span class="mh">0x03</span>
-<span class="nf">h</span> <span class="ow">=</span> <span class="mh">0x04</span>
+<span class="nf">f</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mh">0x02</span><span class="w"></span>
+<span class="nf">g</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mh">0x03</span><span class="w"></span>
+<span class="nf">h</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mh">0x04</span><span class="w"></span>
 </pre></div>
 </div>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kr">module</span> <span class="nn">N</span> <span class="kr">where</span>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kr">module</span><span class="w"> </span><span class="nn">N</span><span class="w"> </span><span class="kr">where</span><span class="w"></span>
 
-<span class="kr">import</span> <span class="nn">M</span><span class="p">(</span><span class="n">f</span><span class="p">,</span><span class="n">g</span><span class="p">)</span>  <span class="c1">// Imports only `f` and `g`, but not `h`</span>
+<span class="kr">import</span><span class="w"> </span><span class="nn">M</span><span class="p">(</span><span class="n">f</span><span class="p">,</span><span class="n">g</span><span class="p">)</span><span class="w">  </span><span class="c1">// Imports only `f` and `g`, but not `h`</span><span class="w"></span>
 
-<span class="nf">x</span> <span class="ow">=</span> <span class="n">f</span> <span class="o">+</span> <span class="n">g</span>
+<span class="nf">x</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="n">f</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">g</span><span class="w"></span>
 </pre></div>
 </div>
 <p>Using explicit import lists helps reduce name collisions.
 It also tends to make code easier to understand,  because
 it makes it easy to see the source of definitions.</p>
-</div>
-<div class="section" id="hiding-imports">
-<h3>Hiding Imports<a class="headerlink" href="#hiding-imports" title="Permalink to this headline"></a></h3>
+</section>
+<section id="hiding-imports">
+<h3>Hiding Imports<a class="headerlink" href="#hiding-imports" title="Permalink to this heading"></a></h3>
 <p>Sometimes a module may provide many definitions, and we want to use
 most of them but with a few exceptions (e.g., because those would
 result to a name clash).   In such situations it is convenient
 to use a <em>hiding</em> import:</p>
 <div class="literal-block-wrapper docutils container" id="id3">
 <div class="code-block-caption"><span class="caption-text">module M</span><a class="headerlink" href="#id3" title="Permalink to this code"></a></div>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kr">module</span> <span class="nn">M</span> <span class="kr">where</span>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kr">module</span><span class="w"> </span><span class="nn">M</span><span class="w"> </span><span class="kr">where</span><span class="w"></span>
 
-<span class="nf">f</span> <span class="ow">=</span> <span class="mh">0x02</span>
-<span class="nf">g</span> <span class="ow">=</span> <span class="mh">0x03</span>
-<span class="nf">h</span> <span class="ow">=</span> <span class="mh">0x04</span>
+<span class="nf">f</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mh">0x02</span><span class="w"></span>
+<span class="nf">g</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mh">0x03</span><span class="w"></span>
+<span class="nf">h</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mh">0x04</span><span class="w"></span>
 </pre></div>
 </div>
 </div>
 <div class="literal-block-wrapper docutils container" id="id4">
 <div class="code-block-caption"><span class="caption-text">module N</span><a class="headerlink" href="#id4" title="Permalink to this code"></a></div>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kr">module</span> <span class="nn">N</span> <span class="kr">where</span>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kr">module</span><span class="w"> </span><span class="nn">N</span><span class="w"> </span><span class="kr">where</span><span class="w"></span>
 
-<span class="kr">import</span> <span class="nn">M</span> <span class="k">hiding</span> <span class="p">(</span><span class="nf">h</span><span class="p">)</span> <span class="c1">// Import everything but `h`</span>
+<span class="kr">import</span><span class="w"> </span><span class="nn">M</span><span class="w"> </span><span class="k">hiding</span><span class="w"> </span><span class="p">(</span><span class="nf">h</span><span class="p">)</span><span class="w"> </span><span class="c1">// Import everything but `h`</span><span class="w"></span>
 
-<span class="nf">x</span> <span class="ow">=</span> <span class="n">f</span> <span class="o">+</span> <span class="n">g</span>
+<span class="nf">x</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="n">f</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">g</span><span class="w"></span>
 </pre></div>
 </div>
 </div>
-</div>
-<div class="section" id="qualified-module-imports">
-<h3>Qualified Module Imports<a class="headerlink" href="#qualified-module-imports" title="Permalink to this headline"></a></h3>
+</section>
+<section id="qualified-module-imports">
+<h3>Qualified Module Imports<a class="headerlink" href="#qualified-module-imports" title="Permalink to this heading"></a></h3>
 <p>Another way to avoid name collisions is by using a
 <em>qualified</em> import.</p>
 <div class="literal-block-wrapper docutils container" id="id5">
 <div class="code-block-caption"><span class="caption-text">module M</span><a class="headerlink" href="#id5" title="Permalink to this code"></a></div>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kr">module</span> <span class="nn">M</span> <span class="kr">where</span>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kr">module</span><span class="w"> </span><span class="nn">M</span><span class="w"> </span><span class="kr">where</span><span class="w"></span>
 
-<span class="nf">f</span> <span class="kt">:</span> <span class="p">[</span><span class="mi">8</span><span class="p">]</span>
-<span class="nf">f</span> <span class="ow">=</span> <span class="mi">2</span>
+<span class="nf">f</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="p">[</span><span class="mi">8</span><span class="p">]</span><span class="w"></span>
+<span class="nf">f</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mi">2</span><span class="w"></span>
 </pre></div>
 </div>
 </div>
 <div class="literal-block-wrapper docutils container" id="id6">
 <div class="code-block-caption"><span class="caption-text">module N</span><a class="headerlink" href="#id6" title="Permalink to this code"></a></div>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kr">module</span> <span class="nn">N</span> <span class="kr">where</span>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kr">module</span><span class="w"> </span><span class="nn">N</span><span class="w"> </span><span class="kr">where</span><span class="w"></span>
 
-<span class="kr">import</span> <span class="nn">M</span> <span class="k">as</span> <span class="n">P</span>
+<span class="kr">import</span><span class="w"> </span><span class="nn">M</span><span class="w"> </span><span class="k">as</span><span class="w"> </span><span class="n">P</span><span class="w"></span>
 
-<span class="nf">g</span> <span class="ow">=</span> <span class="kt">P</span><span class="ow">::</span><span class="n">f</span>
-<span class="c1">// `f` was imported from `M`</span>
-<span class="c1">// but when used it needs to be prefixed by the qualifier `P`</span>
+<span class="nf">g</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="kt">P</span><span class="ow">::</span><span class="n">f</span><span class="w"></span>
+<span class="c1">// `f` was imported from `M`</span><span class="w"></span>
+<span class="c1">// but when used it needs to be prefixed by the qualifier `P`</span><span class="w"></span>
 </pre></div>
 </div>
 </div>
@@ -229,9 +231,9 @@ <h3>Qualified Module Imports<a class="headerlink" href="#qualified-module-import
 <p>Qualified imports may be combined with import lists or hiding clauses:</p>
 <div class="literal-block-wrapper docutils container" id="id7">
 <div class="code-block-caption"><span class="caption-text">Example</span><a class="headerlink" href="#id7" title="Permalink to this code"></a></div>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kr">import</span> <span class="nn">A</span> <span class="k">as</span> <span class="n">B</span> <span class="p">(</span><span class="n">f</span><span class="p">)</span>         <span class="c1">// introduces B::f</span>
-<span class="kr">import</span> <span class="nn">X</span> <span class="k">as</span> <span class="n">Y</span> <span class="n">hiding</span> <span class="p">(</span><span class="n">f</span><span class="p">)</span>  <span class="c1">// introduces everything but `f` from X</span>
-                          <span class="c1">// using the prefix `X`</span>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kr">import</span><span class="w"> </span><span class="nn">A</span><span class="w"> </span><span class="k">as</span><span class="w"> </span><span class="n">B</span><span class="w"> </span><span class="p">(</span><span class="n">f</span><span class="p">)</span><span class="w">         </span><span class="c1">// introduces B::f</span><span class="w"></span>
+<span class="kr">import</span><span class="w"> </span><span class="nn">X</span><span class="w"> </span><span class="k">as</span><span class="w"> </span><span class="n">Y</span><span class="w"> </span><span class="n">hiding</span><span class="w"> </span><span class="p">(</span><span class="n">f</span><span class="p">)</span><span class="w">  </span><span class="c1">// introduces everything but `f` from X</span><span class="w"></span>
+<span class="w">                          </span><span class="c1">// using the prefix `X`</span><span class="w"></span>
 </pre></div>
 </div>
 </div>
@@ -239,34 +241,34 @@ <h3>Qualified Module Imports<a class="headerlink" href="#qualified-module-import
 from different modules.  For example:</p>
 <div class="literal-block-wrapper docutils container" id="id8">
 <div class="code-block-caption"><span class="caption-text">Example</span><a class="headerlink" href="#id8" title="Permalink to this code"></a></div>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kr">import</span> <span class="nn">A</span> <span class="k">as</span> <span class="n">B</span>
-<span class="kr">import</span> <span class="nn">X</span> <span class="k">as</span> <span class="n">B</span>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kr">import</span><span class="w"> </span><span class="nn">A</span><span class="w"> </span><span class="k">as</span><span class="w"> </span><span class="n">B</span><span class="w"></span>
+<span class="kr">import</span><span class="w"> </span><span class="nn">X</span><span class="w"> </span><span class="k">as</span><span class="w"> </span><span class="n">B</span><span class="w"></span>
 </pre></div>
 </div>
 </div>
 <p>Such declarations will introduces all definitions from <code class="docutils literal notranslate"><span class="pre">A</span></code> and <code class="docutils literal notranslate"><span class="pre">X</span></code>
 but to use them, you would have to qualify using the prefix <code class="docutils literal notranslate"><span class="pre">B::</span></code>.</p>
-</div>
-</div>
-<div class="section" id="private-blocks">
-<h2>Private Blocks<a class="headerlink" href="#private-blocks" title="Permalink to this headline"></a></h2>
+</section>
+</section>
+<section id="private-blocks">
+<h2>Private Blocks<a class="headerlink" href="#private-blocks" title="Permalink to this heading"></a></h2>
 <p>In some cases, definitions in a module might use helper
 functions that are not intended to be used outside the module.
 It is good practice to place such declarations in <em>private blocks</em>:</p>
 <div class="literal-block-wrapper docutils container" id="id9">
 <div class="code-block-caption"><span class="caption-text">Private blocks</span><a class="headerlink" href="#id9" title="Permalink to this code"></a></div>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kr">module</span> <span class="nn">M</span> <span class="kr">where</span>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kr">module</span><span class="w"> </span><span class="nn">M</span><span class="w"> </span><span class="kr">where</span><span class="w"></span>
 
-<span class="nf">f</span> <span class="kt">:</span> <span class="p">[</span><span class="mi">8</span><span class="p">]</span>
-<span class="nf">f</span> <span class="ow">=</span> <span class="mh">0x01</span> <span class="o">+</span> <span class="n">helper1</span> <span class="o">+</span> <span class="n">helper2</span>
+<span class="nf">f</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="p">[</span><span class="mi">8</span><span class="p">]</span><span class="w"></span>
+<span class="nf">f</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mh">0x01</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">helper1</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">helper2</span><span class="w"></span>
 
-<span class="nf">private</span>
+<span class="nf">private</span><span class="w"></span>
 
-  <span class="n">helper1</span> <span class="kt">:</span> <span class="p">[</span><span class="mi">8</span><span class="p">]</span>
-  <span class="n">helper1</span> <span class="ow">=</span> <span class="mi">2</span>
+<span class="w">  </span><span class="n">helper1</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="p">[</span><span class="mi">8</span><span class="p">]</span><span class="w"></span>
+<span class="w">  </span><span class="n">helper1</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mi">2</span><span class="w"></span>
 
-  <span class="n">helper2</span> <span class="kt">:</span> <span class="p">[</span><span class="mi">8</span><span class="p">]</span>
-  <span class="n">helper2</span> <span class="ow">=</span> <span class="mi">3</span>
+<span class="w">  </span><span class="n">helper2</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="p">[</span><span class="mi">8</span><span class="p">]</span><span class="w"></span>
+<span class="w">  </span><span class="n">helper2</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mi">3</span><span class="w"></span>
 </pre></div>
 </div>
 </div>
@@ -276,18 +278,18 @@ <h2>Private Blocks<a class="headerlink" href="#private-blocks" title="Permalink
 extend to the end of the module.</p>
 <div class="literal-block-wrapper docutils container" id="id10">
 <div class="code-block-caption"><span class="caption-text">Private blocks</span><a class="headerlink" href="#id10" title="Permalink to this code"></a></div>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kr">module</span> <span class="nn">M</span> <span class="kr">where</span>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kr">module</span><span class="w"> </span><span class="nn">M</span><span class="w"> </span><span class="kr">where</span><span class="w"></span>
 
-<span class="nf">f</span> <span class="kt">:</span> <span class="p">[</span><span class="mi">8</span><span class="p">]</span>
-<span class="nf">f</span> <span class="ow">=</span> <span class="mh">0x01</span> <span class="o">+</span> <span class="n">helper1</span> <span class="o">+</span> <span class="n">helper2</span>
+<span class="nf">f</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="p">[</span><span class="mi">8</span><span class="p">]</span><span class="w"></span>
+<span class="nf">f</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mh">0x01</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">helper1</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">helper2</span><span class="w"></span>
 
-<span class="nf">private</span>
+<span class="nf">private</span><span class="w"></span>
 
-<span class="nf">helper1</span> <span class="kt">:</span> <span class="p">[</span><span class="mi">8</span><span class="p">]</span>
-<span class="nf">helper1</span> <span class="ow">=</span> <span class="mi">2</span>
+<span class="nf">helper1</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="p">[</span><span class="mi">8</span><span class="p">]</span><span class="w"></span>
+<span class="nf">helper1</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mi">2</span><span class="w"></span>
 
-<span class="nf">helper2</span> <span class="kt">:</span> <span class="p">[</span><span class="mi">8</span><span class="p">]</span>
-<span class="nf">helper2</span> <span class="ow">=</span> <span class="mi">3</span>
+<span class="nf">helper2</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="p">[</span><span class="mi">8</span><span class="p">]</span><span class="w"></span>
+<span class="nf">helper2</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mi">3</span><span class="w"></span>
 </pre></div>
 </div>
 </div>
@@ -297,33 +299,33 @@ <h2>Private Blocks<a class="headerlink" href="#private-blocks" title="Permalink
 is equivalent to the previous one:</p>
 <div class="literal-block-wrapper docutils container" id="id11">
 <div class="code-block-caption"><span class="caption-text">Private blocks</span><a class="headerlink" href="#id11" title="Permalink to this code"></a></div>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kr">module</span> <span class="nn">M</span> <span class="kr">where</span>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kr">module</span><span class="w"> </span><span class="nn">M</span><span class="w"> </span><span class="kr">where</span><span class="w"></span>
 
-<span class="nf">f</span> <span class="kt">:</span> <span class="p">[</span><span class="mi">8</span><span class="p">]</span>
-<span class="nf">f</span> <span class="ow">=</span> <span class="mh">0x01</span> <span class="o">+</span> <span class="n">helper1</span> <span class="o">+</span> <span class="n">helper2</span>
+<span class="nf">f</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="p">[</span><span class="mi">8</span><span class="p">]</span><span class="w"></span>
+<span class="nf">f</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mh">0x01</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">helper1</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">helper2</span><span class="w"></span>
 
-<span class="nf">private</span>
-  <span class="n">helper1</span> <span class="kt">:</span> <span class="p">[</span><span class="mi">8</span><span class="p">]</span>
-  <span class="n">helper1</span> <span class="ow">=</span> <span class="mi">2</span>
+<span class="nf">private</span><span class="w"></span>
+<span class="w">  </span><span class="n">helper1</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="p">[</span><span class="mi">8</span><span class="p">]</span><span class="w"></span>
+<span class="w">  </span><span class="n">helper1</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mi">2</span><span class="w"></span>
 
-<span class="nf">private</span>
-  <span class="n">helper2</span> <span class="kt">:</span> <span class="p">[</span><span class="mi">8</span><span class="p">]</span>
-  <span class="n">helper2</span> <span class="ow">=</span> <span class="mi">3</span>
+<span class="nf">private</span><span class="w"></span>
+<span class="w">  </span><span class="n">helper2</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="p">[</span><span class="mi">8</span><span class="p">]</span><span class="w"></span>
+<span class="w">  </span><span class="n">helper2</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mi">3</span><span class="w"></span>
 </pre></div>
 </div>
 </div>
-</div>
-<div class="section" id="nested-modules">
-<h2>Nested Modules<a class="headerlink" href="#nested-modules" title="Permalink to this headline"></a></h2>
+</section>
+<section id="nested-modules">
+<h2>Nested Modules<a class="headerlink" href="#nested-modules" title="Permalink to this heading"></a></h2>
 <p>Module may be declared withing other modules, using the <code class="docutils literal notranslate"><span class="pre">submodule</span></code> keword.</p>
 <div class="literal-block-wrapper docutils container" id="id12">
 <div class="code-block-caption"><span class="caption-text">Declaring a nested module called N</span><a class="headerlink" href="#id12" title="Permalink to this code"></a></div>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kr">module</span> <span class="nn">M</span> <span class="kr">where</span>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kr">module</span><span class="w"> </span><span class="nn">M</span><span class="w"> </span><span class="kr">where</span><span class="w"></span>
 
-  <span class="n">x</span> <span class="ow">=</span> <span class="mh">0x02</span>
+<span class="w">  </span><span class="n">x</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mh">0x02</span><span class="w"></span>
 
-  <span class="n">submodule</span> <span class="kt">N</span> <span class="kr">where</span>
-    <span class="n">y</span> <span class="ow">=</span> <span class="n">x</span> <span class="o">+</span> <span class="mi">2</span>
+<span class="w">  </span><span class="n">submodule</span><span class="w"> </span><span class="kt">N</span><span class="w"> </span><span class="kr">where</span><span class="w"></span>
+<span class="w">    </span><span class="n">y</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">2</span><span class="w"></span>
 </pre></div>
 </div>
 </div>
@@ -334,44 +336,44 @@ <h2>Nested Modules<a class="headerlink" href="#nested-modules" title="Permalink
 to the name of a submodule.</p>
 <div class="literal-block-wrapper docutils container" id="id13">
 <div class="code-block-caption"><span class="caption-text">Using declarations from a submodule.</span><a class="headerlink" href="#id13" title="Permalink to this code"></a></div>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kr">module</span> <span class="nn">M</span> <span class="kr">where</span>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kr">module</span><span class="w"> </span><span class="nn">M</span><span class="w"> </span><span class="kr">where</span><span class="w"></span>
 
-  <span class="n">x</span> <span class="ow">=</span> <span class="mh">0x02</span>
+<span class="w">  </span><span class="n">x</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mh">0x02</span><span class="w"></span>
 
-  <span class="n">submodule</span> <span class="kt">N</span> <span class="kr">where</span>
-    <span class="n">y</span> <span class="ow">=</span> <span class="n">x</span> <span class="o">+</span> <span class="mi">2</span>
+<span class="w">  </span><span class="n">submodule</span><span class="w"> </span><span class="kt">N</span><span class="w"> </span><span class="kr">where</span><span class="w"></span>
+<span class="w">    </span><span class="n">y</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">2</span><span class="w"></span>
 
-  <span class="kr">import</span> <span class="nn">submodule</span> <span class="kt">N</span> <span class="n">as</span> <span class="kt">P</span>
+<span class="w">  </span><span class="kr">import</span><span class="w"> </span><span class="nn">submodule</span><span class="w"> </span><span class="kt">N</span><span class="w"> </span><span class="n">as</span><span class="w"> </span><span class="kt">P</span><span class="w"></span>
 
-  <span class="n">z</span> <span class="ow">=</span> <span class="mi">2</span> <span class="o">*</span> <span class="kt">P</span><span class="ow">::</span><span class="n">y</span>
+<span class="w">  </span><span class="n">z</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mi">2</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="kt">P</span><span class="ow">::</span><span class="n">y</span><span class="w"></span>
 </pre></div>
 </div>
 </div>
 <p>Note that recursive definitions across modules are not allowed.
 So, in the previous example, it would be an error if <code class="docutils literal notranslate"><span class="pre">y</span></code> was
 to try to use <code class="docutils literal notranslate"><span class="pre">z</span></code> in its definition.</p>
-<div class="section" id="implicit-imports">
-<h3>Implicit Imports<a class="headerlink" href="#implicit-imports" title="Permalink to this headline"></a></h3>
+<section id="implicit-imports">
+<h3>Implicit Imports<a class="headerlink" href="#implicit-imports" title="Permalink to this heading"></a></h3>
 <p>For convenience, we add an implicit qualified submodule import for
 each locally defined submodules.</p>
 <div class="literal-block-wrapper docutils container" id="id14">
 <div class="code-block-caption"><span class="caption-text">Making use of the implicit import for a submodule.</span><a class="headerlink" href="#id14" title="Permalink to this code"></a></div>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kr">module</span> <span class="nn">M</span> <span class="kr">where</span>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kr">module</span><span class="w"> </span><span class="nn">M</span><span class="w"> </span><span class="kr">where</span><span class="w"></span>
 
-  <span class="n">x</span> <span class="ow">=</span> <span class="mh">0x02</span>
+<span class="w">  </span><span class="n">x</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mh">0x02</span><span class="w"></span>
 
-  <span class="n">submodule</span> <span class="kt">N</span> <span class="kr">where</span>
-    <span class="n">y</span> <span class="ow">=</span> <span class="n">x</span> <span class="o">+</span> <span class="mi">2</span>
+<span class="w">  </span><span class="n">submodule</span><span class="w"> </span><span class="kt">N</span><span class="w"> </span><span class="kr">where</span><span class="w"></span>
+<span class="w">    </span><span class="n">y</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">2</span><span class="w"></span>
 
-  <span class="n">z</span> <span class="ow">=</span> <span class="mi">2</span> <span class="o">*</span> <span class="kt">N</span><span class="ow">::</span><span class="n">y</span>
+<span class="w">  </span><span class="n">z</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mi">2</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="kt">N</span><span class="ow">::</span><span class="n">y</span><span class="w"></span>
 </pre></div>
 </div>
 </div>
 <p><code class="docutils literal notranslate"><span class="pre">N::y</span></code> works in the previous example because Cryptol added
 an implicit import <code class="docutils literal notranslate"><span class="pre">import</span> <span class="pre">submoulde</span> <span class="pre">N</span> <span class="pre">as</span> <span class="pre">N</span></code>.</p>
-</div>
-<div class="section" id="managing-module-names">
-<h3>Managing Module Names<a class="headerlink" href="#managing-module-names" title="Permalink to this headline"></a></h3>
+</section>
+<section id="managing-module-names">
+<h3>Managing Module Names<a class="headerlink" href="#managing-module-names" title="Permalink to this heading"></a></h3>
 <p>The names of nested modules are managed by the module system just
 like the name of any other declaration in Cryptol.  Thus, nested
 modules may declared in the public or private sections of their
@@ -386,43 +388,43 @@ <h3>Managing Module Names<a class="headerlink" href="#managing-module-names" tit
 </div></blockquote>
 <div class="literal-block-wrapper docutils container" id="id15">
 <div class="code-block-caption"><span class="caption-text">Using a nested module from a different top-level module.</span><a class="headerlink" href="#id15" title="Permalink to this code"></a></div>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kr">module</span> <span class="nn">A</span> <span class="kr">where</span>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kr">module</span><span class="w"> </span><span class="nn">A</span><span class="w"> </span><span class="kr">where</span><span class="w"></span>
 
-  <span class="n">x</span> <span class="ow">=</span> <span class="mh">0x02</span>
+<span class="w">  </span><span class="n">x</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mh">0x02</span><span class="w"></span>
 
-  <span class="n">submodule</span> <span class="kt">N</span> <span class="kr">where</span>
-    <span class="n">y</span> <span class="ow">=</span> <span class="n">x</span> <span class="o">+</span> <span class="mi">2</span>
+<span class="w">  </span><span class="n">submodule</span><span class="w"> </span><span class="kt">N</span><span class="w"> </span><span class="kr">where</span><span class="w"></span>
+<span class="w">    </span><span class="n">y</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">2</span><span class="w"></span>
 
-<span class="kr">module</span> <span class="nn">B</span> <span class="kr">where</span>
-  <span class="kr">import</span> <span class="nn">A</span>            <span class="c1">// Brings `N` in scope</span>
-  <span class="kr">import</span> <span class="nn">submodule</span> <span class="kt">N</span>  <span class="c1">// Brings `y` in scope</span>
-  <span class="n">z</span> <span class="ow">=</span> <span class="mi">2</span> <span class="o">*</span> <span class="n">y</span>
+<span class="kr">module</span><span class="w"> </span><span class="nn">B</span><span class="w"> </span><span class="kr">where</span><span class="w"></span>
+<span class="w">  </span><span class="kr">import</span><span class="w"> </span><span class="nn">A</span><span class="w">            </span><span class="c1">// Brings `N` in scope</span><span class="w"></span>
+<span class="w">  </span><span class="kr">import</span><span class="w"> </span><span class="nn">submodule</span><span class="w"> </span><span class="kt">N</span><span class="w">  </span><span class="c1">// Brings `y` in scope</span><span class="w"></span>
+<span class="w">  </span><span class="n">z</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mi">2</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="n">y</span><span class="w"></span>
 </pre></div>
 </div>
 </div>
-</div>
-</div>
-<div class="section" id="parameterized-modules">
-<h2>Parameterized Modules<a class="headerlink" href="#parameterized-modules" title="Permalink to this headline"></a></h2>
+</section>
+</section>
+<section id="parameterized-modules">
+<h2>Parameterized Modules<a class="headerlink" href="#parameterized-modules" title="Permalink to this heading"></a></h2>
 <div class="admonition warning">
 <p class="admonition-title">Warning</p>
 <p>The documentation in this section is for the upcoming variant of
 the feature, which is not yet part of main line Cryptol.</p>
 </div>
-<div class="section" id="interface-modules">
-<h3>Interface Modules<a class="headerlink" href="#interface-modules" title="Permalink to this headline"></a></h3>
+<section id="interface-modules">
+<h3>Interface Modules<a class="headerlink" href="#interface-modules" title="Permalink to this heading"></a></h3>
 <p>An <em>interface module</em> describes the content of a module
 without providing a concrete implementation.</p>
 <div class="literal-block-wrapper docutils container" id="id16">
 <div class="code-block-caption"><span class="caption-text">An interface module.</span><a class="headerlink" href="#id16" title="Permalink to this code"></a></div>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">interface</span> <span class="kr">module</span> <span class="nn">I</span> <span class="kr">where</span>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">interface</span><span class="w"> </span><span class="kr">module</span><span class="w"> </span><span class="nn">I</span><span class="w"> </span><span class="kr">where</span><span class="w"></span>
 
-  <span class="kr">type</span> <span class="n">n</span> <span class="kt">:</span> <span class="o">#</span>      <span class="c1">// `n` is a numeric type</span>
+<span class="w">  </span><span class="kr">type</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="o">#</span><span class="w">      </span><span class="c1">// `n` is a numeric type</span><span class="w"></span>
 
-  <span class="kr">type</span> <span class="n">constraint</span> <span class="p">(</span><span class="kr">fin</span> <span class="n">n</span><span class="p">,</span> <span class="n">n</span> <span class="o">&gt;=</span> <span class="mi">1</span><span class="p">)</span>
-                  <span class="c1">// Assumptions about the declared numeric type</span>
+<span class="w">  </span><span class="kr">type</span><span class="w"> </span><span class="n">constraint</span><span class="w"> </span><span class="p">(</span><span class="kr">fin</span><span class="w"> </span><span class="n">n</span><span class="p">,</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="o">&gt;=</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span><span class="w"></span>
+<span class="w">                  </span><span class="c1">// Assumptions about the declared numeric type</span><span class="w"></span>
 
-  <span class="n">x</span> <span class="kt">:</span> <span class="p">[</span><span class="n">n</span><span class="p">]</span>         <span class="c1">// A declarations of a constant</span>
+<span class="w">  </span><span class="n">x</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="p">[</span><span class="n">n</span><span class="p">]</span><span class="w">         </span><span class="c1">// A declarations of a constant</span><span class="w"></span>
 </pre></div>
 </div>
 </div>
@@ -430,39 +432,39 @@ <h3>Interface Modules<a class="headerlink" href="#interface-modules" title="Perm
 other modules:</p>
 <div class="literal-block-wrapper docutils container" id="id17">
 <div class="code-block-caption"><span class="caption-text">A nested interface module</span><a class="headerlink" href="#id17" title="Permalink to this code"></a></div>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kr">module</span> <span class="nn">M</span> <span class="kr">where</span>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kr">module</span><span class="w"> </span><span class="nn">M</span><span class="w"> </span><span class="kr">where</span><span class="w"></span>
 
-  <span class="n">interface</span> <span class="n">submodule</span> <span class="kt">I</span> <span class="kr">where</span>
+<span class="w">  </span><span class="n">interface</span><span class="w"> </span><span class="n">submodule</span><span class="w"> </span><span class="kt">I</span><span class="w"> </span><span class="kr">where</span><span class="w"></span>
 
-    <span class="kr">type</span> <span class="n">n</span> <span class="kt">:</span> <span class="o">#</span>      <span class="c1">// `n` is a numeric type</span>
+<span class="w">    </span><span class="kr">type</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="o">#</span><span class="w">      </span><span class="c1">// `n` is a numeric type</span><span class="w"></span>
 
-    <span class="kr">type</span> <span class="n">constraint</span> <span class="p">(</span><span class="kr">fin</span> <span class="n">n</span><span class="p">,</span> <span class="n">n</span> <span class="o">&gt;=</span> <span class="mi">1</span><span class="p">)</span>
-                    <span class="c1">// Assumptions about the declared numeric type</span>
+<span class="w">    </span><span class="kr">type</span><span class="w"> </span><span class="n">constraint</span><span class="w"> </span><span class="p">(</span><span class="kr">fin</span><span class="w"> </span><span class="n">n</span><span class="p">,</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="o">&gt;=</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span><span class="w"></span>
+<span class="w">                    </span><span class="c1">// Assumptions about the declared numeric type</span><span class="w"></span>
 
-    <span class="n">x</span> <span class="kt">:</span> <span class="p">[</span><span class="n">n</span><span class="p">]</span>         <span class="c1">// A declarations of a constant</span>
+<span class="w">    </span><span class="n">x</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="p">[</span><span class="n">n</span><span class="p">]</span><span class="w">         </span><span class="c1">// A declarations of a constant</span><span class="w"></span>
 </pre></div>
 </div>
 </div>
-</div>
-<div class="section" id="importing-an-interface-module">
-<h3>Importing an Interface Module<a class="headerlink" href="#importing-an-interface-module" title="Permalink to this headline"></a></h3>
+</section>
+<section id="importing-an-interface-module">
+<h3>Importing an Interface Module<a class="headerlink" href="#importing-an-interface-module" title="Permalink to this heading"></a></h3>
 <p>A module may be parameterized by importing an interface,
 instead of a concrete module</p>
 <div class="literal-block-wrapper docutils container" id="id18">
 <div class="code-block-caption"><span class="caption-text">A parameterized module</span><a class="headerlink" href="#id18" title="Permalink to this code"></a></div>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="c1">// The interface desribes the parmaeters</span>
-<span class="nf">interface</span> <span class="kr">module</span> <span class="nn">I</span> <span class="kr">where</span>
-  <span class="kr">type</span> <span class="n">n</span> <span class="kt">:</span> <span class="o">#</span>
-  <span class="kr">type</span> <span class="n">constraint</span> <span class="p">(</span><span class="kr">fin</span> <span class="n">n</span><span class="p">,</span> <span class="n">n</span> <span class="o">&gt;=</span> <span class="mi">1</span><span class="p">)</span>
-  <span class="n">x</span> <span class="kt">:</span> <span class="p">[</span><span class="n">n</span><span class="p">]</span>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="c1">// The interface desribes the parmaeters</span><span class="w"></span>
+<span class="nf">interface</span><span class="w"> </span><span class="kr">module</span><span class="w"> </span><span class="nn">I</span><span class="w"> </span><span class="kr">where</span><span class="w"></span>
+<span class="w">  </span><span class="kr">type</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="o">#</span><span class="w"></span>
+<span class="w">  </span><span class="kr">type</span><span class="w"> </span><span class="n">constraint</span><span class="w"> </span><span class="p">(</span><span class="kr">fin</span><span class="w"> </span><span class="n">n</span><span class="p">,</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="o">&gt;=</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span><span class="w"></span>
+<span class="w">  </span><span class="n">x</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="p">[</span><span class="n">n</span><span class="p">]</span><span class="w"></span>
 
 
-<span class="c1">// This module is parameterized</span>
-<span class="kr">module</span> <span class="nn">F</span> <span class="kr">where</span>
-  <span class="kr">import</span> <span class="nn">interface</span> <span class="kt">I</span>
+<span class="c1">// This module is parameterized</span><span class="w"></span>
+<span class="kr">module</span><span class="w"> </span><span class="nn">F</span><span class="w"> </span><span class="kr">where</span><span class="w"></span>
+<span class="w">  </span><span class="kr">import</span><span class="w"> </span><span class="nn">interface</span><span class="w"> </span><span class="kt">I</span><span class="w"></span>
 
-  <span class="n">y</span> <span class="kt">:</span> <span class="p">[</span><span class="n">n</span><span class="p">]</span>
-  <span class="n">y</span> <span class="ow">=</span> <span class="n">x</span> <span class="o">+</span> <span class="mi">1</span>
+<span class="w">  </span><span class="n">y</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="p">[</span><span class="n">n</span><span class="p">]</span><span class="w"></span>
+<span class="w">  </span><span class="n">y</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">1</span><span class="w"></span>
 </pre></div>
 </div>
 </div>
@@ -474,46 +476,46 @@ <h3>Importing an Interface Module<a class="headerlink" href="#importing-an-inter
 module, as described in <a class="reference internal" href="#instantiating-modules"><span class="std std-ref">Instantiating a Parameterized Module</span></a>.</p>
 <div class="literal-block-wrapper docutils container" id="id19">
 <div class="code-block-caption"><span class="caption-text">Multiple interface parameters</span><a class="headerlink" href="#id19" title="Permalink to this code"></a></div>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">interface</span> <span class="kr">module</span> <span class="nn">I</span> <span class="kr">where</span>
-  <span class="kr">type</span> <span class="n">n</span> <span class="kt">:</span> <span class="o">#</span>
-  <span class="kr">type</span> <span class="n">constraint</span> <span class="p">(</span><span class="kr">fin</span> <span class="n">n</span><span class="p">,</span> <span class="n">n</span> <span class="o">&gt;=</span> <span class="mi">1</span><span class="p">)</span>
-  <span class="n">x</span> <span class="kt">:</span> <span class="p">[</span><span class="n">n</span><span class="p">]</span>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">interface</span><span class="w"> </span><span class="kr">module</span><span class="w"> </span><span class="nn">I</span><span class="w"> </span><span class="kr">where</span><span class="w"></span>
+<span class="w">  </span><span class="kr">type</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="o">#</span><span class="w"></span>
+<span class="w">  </span><span class="kr">type</span><span class="w"> </span><span class="n">constraint</span><span class="w"> </span><span class="p">(</span><span class="kr">fin</span><span class="w"> </span><span class="n">n</span><span class="p">,</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="o">&gt;=</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span><span class="w"></span>
+<span class="w">  </span><span class="n">x</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="p">[</span><span class="n">n</span><span class="p">]</span><span class="w"></span>
 
 
-<span class="kr">module</span> <span class="nn">F</span> <span class="kr">where</span>
-  <span class="kr">import</span> <span class="nn">interface</span> <span class="kt">I</span> <span class="n">as</span> <span class="kt">I</span>
-  <span class="kr">import</span> <span class="nn">interface</span> <span class="kt">I</span> <span class="n">as</span> <span class="kt">J</span>
+<span class="kr">module</span><span class="w"> </span><span class="nn">F</span><span class="w"> </span><span class="kr">where</span><span class="w"></span>
+<span class="w">  </span><span class="kr">import</span><span class="w"> </span><span class="nn">interface</span><span class="w"> </span><span class="kt">I</span><span class="w"> </span><span class="n">as</span><span class="w"> </span><span class="kt">I</span><span class="w"></span>
+<span class="w">  </span><span class="kr">import</span><span class="w"> </span><span class="nn">interface</span><span class="w"> </span><span class="kt">I</span><span class="w"> </span><span class="n">as</span><span class="w"> </span><span class="kt">J</span><span class="w"></span>
 
-  <span class="n">y</span> <span class="kt">:</span> <span class="p">[</span><span class="kt">I</span><span class="ow">::</span><span class="n">n</span><span class="p">]</span>
-  <span class="n">y</span> <span class="ow">=</span> <span class="kt">I</span><span class="ow">::</span><span class="n">x</span> <span class="o">+</span> <span class="mi">1</span>
+<span class="w">  </span><span class="n">y</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="p">[</span><span class="kt">I</span><span class="ow">::</span><span class="n">n</span><span class="p">]</span><span class="w"></span>
+<span class="w">  </span><span class="n">y</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="kt">I</span><span class="ow">::</span><span class="n">x</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">1</span><span class="w"></span>
 
-  <span class="n">z</span> <span class="kt">:</span> <span class="p">[</span><span class="kt">J</span><span class="ow">::</span><span class="n">n</span><span class="p">]</span>
-  <span class="n">z</span> <span class="ow">=</span> <span class="kt">J</span><span class="ow">::</span><span class="n">x</span> <span class="o">+</span> <span class="mi">1</span>
+<span class="w">  </span><span class="n">z</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="p">[</span><span class="kt">J</span><span class="ow">::</span><span class="n">n</span><span class="p">]</span><span class="w"></span>
+<span class="w">  </span><span class="n">z</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="kt">J</span><span class="ow">::</span><span class="n">x</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">1</span><span class="w"></span>
 </pre></div>
 </div>
 </div>
-</div>
-<div class="section" id="interface-constraints">
-<h3>Interface Constraints<a class="headerlink" href="#interface-constraints" title="Permalink to this headline"></a></h3>
+</section>
+<section id="interface-constraints">
+<h3>Interface Constraints<a class="headerlink" href="#interface-constraints" title="Permalink to this heading"></a></h3>
 <p>When working with multiple interfaces, it is to useful
 to be able to impose additional constraints on the
 types imported from the interface.</p>
 <div class="literal-block-wrapper docutils container" id="id20">
 <div class="code-block-caption"><span class="caption-text">Adding constraints to interface parameters</span><a class="headerlink" href="#id20" title="Permalink to this code"></a></div>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">interface</span> <span class="kr">module</span> <span class="nn">I</span> <span class="kr">where</span>
-  <span class="kr">type</span> <span class="n">n</span> <span class="kt">:</span> <span class="o">#</span>
-  <span class="kr">type</span> <span class="n">constraint</span> <span class="p">(</span><span class="kr">fin</span> <span class="n">n</span><span class="p">,</span> <span class="n">n</span> <span class="o">&gt;=</span> <span class="mi">1</span><span class="p">)</span>
-  <span class="n">x</span> <span class="kt">:</span> <span class="p">[</span><span class="n">n</span><span class="p">]</span>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">interface</span><span class="w"> </span><span class="kr">module</span><span class="w"> </span><span class="nn">I</span><span class="w"> </span><span class="kr">where</span><span class="w"></span>
+<span class="w">  </span><span class="kr">type</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="o">#</span><span class="w"></span>
+<span class="w">  </span><span class="kr">type</span><span class="w"> </span><span class="n">constraint</span><span class="w"> </span><span class="p">(</span><span class="kr">fin</span><span class="w"> </span><span class="n">n</span><span class="p">,</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="o">&gt;=</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span><span class="w"></span>
+<span class="w">  </span><span class="n">x</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="p">[</span><span class="n">n</span><span class="p">]</span><span class="w"></span>
 
 
-<span class="kr">module</span> <span class="nn">F</span> <span class="kr">where</span>
-  <span class="kr">import</span> <span class="nn">interface</span> <span class="kt">I</span> <span class="n">as</span> <span class="kt">I</span>
-  <span class="kr">import</span> <span class="nn">interface</span> <span class="kt">I</span> <span class="n">as</span> <span class="kt">J</span>
+<span class="kr">module</span><span class="w"> </span><span class="nn">F</span><span class="w"> </span><span class="kr">where</span><span class="w"></span>
+<span class="w">  </span><span class="kr">import</span><span class="w"> </span><span class="nn">interface</span><span class="w"> </span><span class="kt">I</span><span class="w"> </span><span class="n">as</span><span class="w"> </span><span class="kt">I</span><span class="w"></span>
+<span class="w">  </span><span class="kr">import</span><span class="w"> </span><span class="nn">interface</span><span class="w"> </span><span class="kt">I</span><span class="w"> </span><span class="n">as</span><span class="w"> </span><span class="kt">J</span><span class="w"></span>
 
-  <span class="n">interface</span> <span class="n">constraint</span> <span class="p">(</span><span class="kt">I</span><span class="ow">::</span><span class="n">n</span> <span class="o">==</span> <span class="kt">J</span><span class="ow">::</span><span class="n">n</span><span class="p">)</span>
+<span class="w">  </span><span class="n">interface</span><span class="w"> </span><span class="n">constraint</span><span class="w"> </span><span class="p">(</span><span class="kt">I</span><span class="ow">::</span><span class="n">n</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="kt">J</span><span class="ow">::</span><span class="n">n</span><span class="p">)</span><span class="w"></span>
 
-  <span class="n">y</span> <span class="kt">:</span> <span class="p">[</span><span class="kt">I</span><span class="ow">::</span><span class="n">n</span><span class="p">]</span>
-  <span class="n">y</span> <span class="ow">=</span> <span class="kt">I</span><span class="ow">::</span><span class="n">x</span> <span class="o">+</span> <span class="kt">J</span><span class="ow">::</span><span class="n">x</span>
+<span class="w">  </span><span class="n">y</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="p">[</span><span class="kt">I</span><span class="ow">::</span><span class="n">n</span><span class="p">]</span><span class="w"></span>
+<span class="w">  </span><span class="n">y</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="kt">I</span><span class="ow">::</span><span class="n">x</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="kt">J</span><span class="ow">::</span><span class="n">x</span><span class="w"></span>
 </pre></div>
 </div>
 </div>
@@ -521,30 +523,30 @@ <h3>Interface Constraints<a class="headerlink" href="#interface-constraints" tit
 (the width of <code class="docutils literal notranslate"><span class="pre">x</span></code>) in both interfaces must be the
 same.  Note that, of course, the two instantiations
 may provide different values for <code class="docutils literal notranslate"><span class="pre">x</span></code>.</p>
-</div>
-<div class="section" id="instantiating-a-parameterized-module">
-<span id="instantiating-modules"></span><h3>Instantiating a Parameterized Module<a class="headerlink" href="#instantiating-a-parameterized-module" title="Permalink to this headline"></a></h3>
+</section>
+<section id="instantiating-a-parameterized-module">
+<span id="instantiating-modules"></span><h3>Instantiating a Parameterized Module<a class="headerlink" href="#instantiating-a-parameterized-module" title="Permalink to this heading"></a></h3>
 <p>To use a parameterized module we need to provide concrete
 implementations for the interfaces that it uses, and provide
 a name for the resulting module.  This is done as follows:</p>
 <div class="literal-block-wrapper docutils container" id="id21">
 <div class="code-block-caption"><span class="caption-text">Instantiating a parameterized module using a single interface.</span><a class="headerlink" href="#id21" title="Permalink to this code"></a></div>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">interface</span> <span class="kr">module</span> <span class="nn">I</span> <span class="kr">where</span>
-  <span class="kr">type</span> <span class="n">n</span> <span class="kt">:</span> <span class="o">#</span>
-  <span class="kr">type</span> <span class="n">constraint</span> <span class="p">(</span><span class="kr">fin</span> <span class="n">n</span><span class="p">,</span> <span class="n">n</span> <span class="o">&gt;=</span> <span class="mi">1</span><span class="p">)</span>
-  <span class="n">x</span> <span class="kt">:</span> <span class="p">[</span><span class="n">n</span><span class="p">]</span>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">interface</span><span class="w"> </span><span class="kr">module</span><span class="w"> </span><span class="nn">I</span><span class="w"> </span><span class="kr">where</span><span class="w"></span>
+<span class="w">  </span><span class="kr">type</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="o">#</span><span class="w"></span>
+<span class="w">  </span><span class="kr">type</span><span class="w"> </span><span class="n">constraint</span><span class="w"> </span><span class="p">(</span><span class="kr">fin</span><span class="w"> </span><span class="n">n</span><span class="p">,</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="o">&gt;=</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span><span class="w"></span>
+<span class="w">  </span><span class="n">x</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="p">[</span><span class="n">n</span><span class="p">]</span><span class="w"></span>
 
-<span class="kr">module</span> <span class="nn">F</span> <span class="kr">where</span>
-  <span class="kr">import</span> <span class="nn">interface</span> <span class="kt">I</span>
+<span class="kr">module</span><span class="w"> </span><span class="nn">F</span><span class="w"> </span><span class="kr">where</span><span class="w"></span>
+<span class="w">  </span><span class="kr">import</span><span class="w"> </span><span class="nn">interface</span><span class="w"> </span><span class="kt">I</span><span class="w"></span>
 
-  <span class="n">y</span> <span class="kt">:</span> <span class="p">[</span><span class="n">n</span><span class="p">]</span>
-  <span class="n">y</span> <span class="ow">=</span> <span class="n">x</span> <span class="o">+</span> <span class="mi">1</span>
+<span class="w">  </span><span class="n">y</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="p">[</span><span class="n">n</span><span class="p">]</span><span class="w"></span>
+<span class="w">  </span><span class="n">y</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">1</span><span class="w"></span>
 
-<span class="kr">module</span> <span class="nn">Impl</span> <span class="kr">where</span>
-  <span class="kr">type</span> <span class="n">n</span> <span class="ow">=</span> <span class="mi">8</span>
-  <span class="n">x</span> <span class="ow">=</span> <span class="mi">26</span>
+<span class="kr">module</span><span class="w"> </span><span class="nn">Impl</span><span class="w"> </span><span class="kr">where</span><span class="w"></span>
+<span class="w">  </span><span class="kr">type</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mi">8</span><span class="w"></span>
+<span class="w">  </span><span class="n">x</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mi">26</span><span class="w"></span>
 
-<span class="kr">module</span> <span class="nn">MyF</span> <span class="ow">=</span> <span class="kt">F</span> <span class="p">{</span> <span class="kt">Impl</span> <span class="p">}</span>
+<span class="kr">module</span><span class="w"> </span><span class="nn">MyF</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="kt">F</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="kt">Impl</span><span class="w"> </span><span class="p">}</span><span class="w"></span>
 </pre></div>
 </div>
 </div>
@@ -556,26 +558,26 @@ <h3>Interface Constraints<a class="headerlink" href="#interface-constraints" tit
 interface, using a slight variation on the previous notation.</p>
 <div class="literal-block-wrapper docutils container" id="id22">
 <div class="code-block-caption"><span class="caption-text">Instantiating a parameterized module by name.</span><a class="headerlink" href="#id22" title="Permalink to this code"></a></div>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="c1">// I is defined as above</span>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="c1">// I is defined as above</span><span class="w"></span>
 
-<span class="kr">module</span> <span class="nn">F</span> <span class="kr">where</span>
-  <span class="kr">import</span> <span class="nn">interface</span> <span class="kt">I</span> <span class="n">as</span> <span class="kt">I</span>
-  <span class="kr">import</span> <span class="nn">interface</span> <span class="kt">I</span> <span class="n">as</span> <span class="kt">J</span>
+<span class="kr">module</span><span class="w"> </span><span class="nn">F</span><span class="w"> </span><span class="kr">where</span><span class="w"></span>
+<span class="w">  </span><span class="kr">import</span><span class="w"> </span><span class="nn">interface</span><span class="w"> </span><span class="kt">I</span><span class="w"> </span><span class="n">as</span><span class="w"> </span><span class="kt">I</span><span class="w"></span>
+<span class="w">  </span><span class="kr">import</span><span class="w"> </span><span class="nn">interface</span><span class="w"> </span><span class="kt">I</span><span class="w"> </span><span class="n">as</span><span class="w"> </span><span class="kt">J</span><span class="w"></span>
 
-  <span class="n">interface</span> <span class="n">constraint</span> <span class="p">(</span><span class="kt">I</span><span class="ow">::</span><span class="n">n</span> <span class="o">==</span> <span class="kt">J</span><span class="ow">::</span><span class="n">n</span><span class="p">)</span>
+<span class="w">  </span><span class="n">interface</span><span class="w"> </span><span class="n">constraint</span><span class="w"> </span><span class="p">(</span><span class="kt">I</span><span class="ow">::</span><span class="n">n</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="kt">J</span><span class="ow">::</span><span class="n">n</span><span class="p">)</span><span class="w"></span>
 
-  <span class="n">y</span> <span class="kt">:</span> <span class="p">[</span><span class="kt">I</span><span class="ow">::</span><span class="n">n</span><span class="p">]</span>
-  <span class="n">y</span> <span class="ow">=</span> <span class="kt">I</span><span class="ow">::</span><span class="n">x</span> <span class="o">+</span> <span class="kt">J</span><span class="ow">::</span><span class="n">x</span>
+<span class="w">  </span><span class="n">y</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="p">[</span><span class="kt">I</span><span class="ow">::</span><span class="n">n</span><span class="p">]</span><span class="w"></span>
+<span class="w">  </span><span class="n">y</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="kt">I</span><span class="ow">::</span><span class="n">x</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="kt">J</span><span class="ow">::</span><span class="n">x</span><span class="w"></span>
 
-<span class="kr">module</span> <span class="nn">Impl1</span> <span class="kr">where</span>
-  <span class="kr">type</span> <span class="n">n</span> <span class="ow">=</span> <span class="mi">8</span>
-  <span class="n">x</span> <span class="ow">=</span> <span class="mi">26</span>
+<span class="kr">module</span><span class="w"> </span><span class="nn">Impl1</span><span class="w"> </span><span class="kr">where</span><span class="w"></span>
+<span class="w">  </span><span class="kr">type</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mi">8</span><span class="w"></span>
+<span class="w">  </span><span class="n">x</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mi">26</span><span class="w"></span>
 
-<span class="kr">module</span> <span class="nn">Impl2</span> <span class="kr">where</span>
-  <span class="kr">type</span> <span class="n">n</span> <span class="ow">=</span> <span class="mi">8</span>
-  <span class="n">x</span> <span class="ow">=</span> <span class="mi">30</span>
+<span class="kr">module</span><span class="w"> </span><span class="nn">Impl2</span><span class="w"> </span><span class="kr">where</span><span class="w"></span>
+<span class="w">  </span><span class="kr">type</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mi">8</span><span class="w"></span>
+<span class="w">  </span><span class="n">x</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mi">30</span><span class="w"></span>
 
-<span class="kr">module</span> <span class="nn">MyF</span> <span class="ow">=</span> <span class="kt">F</span> <span class="p">{</span> <span class="kt">I</span> <span class="ow">=</span> <span class="kt">Impl1</span><span class="p">,</span> <span class="kt">J</span> <span class="ow">=</span> <span class="kt">Impl</span> <span class="mi">2</span> <span class="p">}</span>
+<span class="kr">module</span><span class="w"> </span><span class="nn">MyF</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="kt">F</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="kt">I</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="kt">Impl1</span><span class="p">,</span><span class="w"> </span><span class="kt">J</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="kt">Impl</span><span class="w"> </span><span class="mi">2</span><span class="w"> </span><span class="p">}</span><span class="w"></span>
 </pre></div>
 </div>
 </div>
@@ -590,11 +592,11 @@ <h3>Interface Constraints<a class="headerlink" href="#interface-constraints" tit
 just like any other module:</p>
 <div class="literal-block-wrapper docutils container" id="id23">
 <div class="code-block-caption"><span class="caption-text">Nested module instantiation.</span><a class="headerlink" href="#id23" title="Permalink to this code"></a></div>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kr">module</span> <span class="nn">M</span> <span class="kr">where</span>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kr">module</span><span class="w"> </span><span class="nn">M</span><span class="w"> </span><span class="kr">where</span><span class="w"></span>
 
-  <span class="kr">import</span> <span class="nn">Somewhere</span> <span class="c1">// defines G</span>
+<span class="w">  </span><span class="kr">import</span><span class="w"> </span><span class="nn">Somewhere</span><span class="w"> </span><span class="c1">// defines G</span><span class="w"></span>
 
-  <span class="n">submodule</span> <span class="kt">F</span> <span class="ow">=</span> <span class="n">submodule</span> <span class="kt">G</span> <span class="p">{</span> <span class="kt">I</span> <span class="p">}</span>
+<span class="w">  </span><span class="n">submodule</span><span class="w"> </span><span class="kt">F</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="n">submodule</span><span class="w"> </span><span class="kt">G</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="kt">I</span><span class="w"> </span><span class="p">}</span><span class="w"></span>
 </pre></div>
 </div>
 </div>
@@ -608,82 +610,82 @@ <h3>Interface Constraints<a class="headerlink" href="#interface-constraints" tit
 use <code class="docutils literal notranslate"><span class="pre">submodule</span> <span class="pre">I</span></code> like this:</p>
 <div class="literal-block-wrapper docutils container" id="id24">
 <div class="code-block-caption"><span class="caption-text">Nested module instantiation.</span><a class="headerlink" href="#id24" title="Permalink to this code"></a></div>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kr">module</span> <span class="nn">M</span> <span class="kr">where</span>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kr">module</span><span class="w"> </span><span class="nn">M</span><span class="w"> </span><span class="kr">where</span><span class="w"></span>
 
-  <span class="kr">import</span> <span class="nn">Somewhere</span> <span class="c1">// defines G and I</span>
+<span class="w">  </span><span class="kr">import</span><span class="w"> </span><span class="nn">Somewhere</span><span class="w"> </span><span class="c1">// defines G and I</span><span class="w"></span>
 
-  <span class="n">submodule</span> <span class="kt">F</span> <span class="ow">=</span> <span class="n">submodule</span> <span class="kt">G</span> <span class="p">{</span> <span class="n">submodule</span> <span class="kt">I</span> <span class="p">}</span>
+<span class="w">  </span><span class="n">submodule</span><span class="w"> </span><span class="kt">F</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="n">submodule</span><span class="w"> </span><span class="kt">G</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="n">submodule</span><span class="w"> </span><span class="kt">I</span><span class="w"> </span><span class="p">}</span><span class="w"></span>
 </pre></div>
 </div>
 </div>
-</div>
-<div class="section" id="anonymous-interface-modules">
-<h3>Anonymous Interface Modules<a class="headerlink" href="#anonymous-interface-modules" title="Permalink to this headline"></a></h3>
+</section>
+<section id="anonymous-interface-modules">
+<h3>Anonymous Interface Modules<a class="headerlink" href="#anonymous-interface-modules" title="Permalink to this heading"></a></h3>
 <p>If we need to just parameterize a module by a couple of types/values,
 it is quite cumbersome to have to define a whole separate interface module.
 To make this more convenient we provide the following notation for defining
 an anonymous interface and using it straight away:</p>
 <div class="literal-block-wrapper docutils container" id="id25">
 <div class="code-block-caption"><span class="caption-text">Simple parameterized module.</span><a class="headerlink" href="#id25" title="Permalink to this code"></a></div>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kr">module</span> <span class="nn">M</span> <span class="kr">where</span>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kr">module</span><span class="w"> </span><span class="nn">M</span><span class="w"> </span><span class="kr">where</span><span class="w"></span>
 
-  <span class="n">parameter</span>
-    <span class="kr">type</span> <span class="n">n</span> <span class="kt">:</span> <span class="o">#</span>
-    <span class="kr">type</span> <span class="n">constraint</span> <span class="p">(</span><span class="kr">fin</span> <span class="n">n</span><span class="p">,</span> <span class="n">n</span> <span class="o">&gt;=</span> <span class="mi">1</span><span class="p">)</span>
-    <span class="n">x</span> <span class="kt">:</span> <span class="p">[</span><span class="n">n</span><span class="p">]</span>
+<span class="w">  </span><span class="n">parameter</span><span class="w"></span>
+<span class="w">    </span><span class="kr">type</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="o">#</span><span class="w"></span>
+<span class="w">    </span><span class="kr">type</span><span class="w"> </span><span class="n">constraint</span><span class="w"> </span><span class="p">(</span><span class="kr">fin</span><span class="w"> </span><span class="n">n</span><span class="p">,</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="o">&gt;=</span><span class="w"> </span><span class="mi">1</span><span class="p">)</span><span class="w"></span>
+<span class="w">    </span><span class="n">x</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="p">[</span><span class="n">n</span><span class="p">]</span><span class="w"></span>
 
-  <span class="n">f</span> <span class="kt">:</span> <span class="p">[</span><span class="n">n</span><span class="p">]</span>
-  <span class="n">f</span> <span class="ow">=</span> <span class="mi">1</span> <span class="o">+</span> <span class="n">x</span>
+<span class="w">  </span><span class="n">f</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="p">[</span><span class="n">n</span><span class="p">]</span><span class="w"></span>
+<span class="w">  </span><span class="n">f</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mi">1</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">x</span><span class="w"></span>
 </pre></div>
 </div>
 </div>
 <p>The <code class="docutils literal notranslate"><span class="pre">parameter</span></code> block defines an interface module and uses it.
 Note that the parameters may not use things defined in <code class="docutils literal notranslate"><span class="pre">M</span></code> as
 the interface is declared outside of <code class="docutils literal notranslate"><span class="pre">M</span></code>.</p>
-</div>
-<div class="section" id="anonymous-instantiation-arguments">
-<h3>Anonymous Instantiation Arguments<a class="headerlink" href="#anonymous-instantiation-arguments" title="Permalink to this headline"></a></h3>
+</section>
+<section id="anonymous-instantiation-arguments">
+<h3>Anonymous Instantiation Arguments<a class="headerlink" href="#anonymous-instantiation-arguments" title="Permalink to this heading"></a></h3>
 <p>Sometimes it is also a bit cumbersome to have to define a whole
 separate module just to pass it as an argument to some parameterized
 module.   To make this more convenient we support the following notion
 for instantiation a module:</p>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="c1">// A parameterized module</span>
-<span class="kr">module</span> <span class="nn">M</span> <span class="kr">where</span>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="c1">// A parameterized module</span><span class="w"></span>
+<span class="kr">module</span><span class="w"> </span><span class="nn">M</span><span class="w"> </span><span class="kr">where</span><span class="w"></span>
 
-  <span class="n">parameter</span>
-    <span class="kr">type</span> <span class="n">n</span> <span class="kt">:</span> <span class="o">#</span>
-    <span class="n">x</span>      <span class="kt">:</span> <span class="p">[</span><span class="n">n</span><span class="p">]</span>
-    <span class="n">y</span>      <span class="kt">:</span> <span class="p">[</span><span class="n">n</span><span class="p">]</span>
+<span class="w">  </span><span class="n">parameter</span><span class="w"></span>
+<span class="w">    </span><span class="kr">type</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="o">#</span><span class="w"></span>
+<span class="w">    </span><span class="n">x</span><span class="w">      </span><span class="kt">:</span><span class="w"> </span><span class="p">[</span><span class="n">n</span><span class="p">]</span><span class="w"></span>
+<span class="w">    </span><span class="n">y</span><span class="w">      </span><span class="kt">:</span><span class="w"> </span><span class="p">[</span><span class="n">n</span><span class="p">]</span><span class="w"></span>
 
-  <span class="n">f</span> <span class="kt">:</span> <span class="p">[</span><span class="n">n</span><span class="p">]</span>
-  <span class="n">f</span> <span class="ow">=</span> <span class="n">x</span> <span class="o">+</span> <span class="n">y</span>
+<span class="w">  </span><span class="n">f</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="p">[</span><span class="n">n</span><span class="p">]</span><span class="w"></span>
+<span class="w">  </span><span class="n">f</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">y</span><span class="w"></span>
 
 
-<span class="c1">// A module instantiation</span>
-<span class="kr">module</span> <span class="nn">N</span> <span class="ow">=</span> <span class="kt">M</span>
-  <span class="kr">where</span>
-  <span class="kr">type</span> <span class="n">n</span> <span class="ow">=</span> <span class="mi">32</span>
-  <span class="n">x</span>      <span class="ow">=</span> <span class="mi">11</span>
-  <span class="n">y</span>      <span class="ow">=</span> <span class="n">helper</span>
+<span class="c1">// A module instantiation</span><span class="w"></span>
+<span class="kr">module</span><span class="w"> </span><span class="nn">N</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="kt">M</span><span class="w"></span>
+<span class="w">  </span><span class="kr">where</span><span class="w"></span>
+<span class="w">  </span><span class="kr">type</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mi">32</span><span class="w"></span>
+<span class="w">  </span><span class="n">x</span><span class="w">      </span><span class="ow">=</span><span class="w"> </span><span class="mi">11</span><span class="w"></span>
+<span class="w">  </span><span class="n">y</span><span class="w">      </span><span class="ow">=</span><span class="w"> </span><span class="n">helper</span><span class="w"></span>
 
-  <span class="n">helper</span> <span class="ow">=</span> <span class="mi">12</span>
+<span class="w">  </span><span class="n">helper</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mi">12</span><span class="w"></span>
 </pre></div>
 </div>
 <p>The declarations in the <code class="docutils literal notranslate"><span class="pre">where</span></code> block are treated as the
 definition of an anonymous module which is passed as the argument
 to parameterized module <code class="docutils literal notranslate"><span class="pre">M</span></code>.</p>
-</div>
-<div class="section" id="anonymous-import-instantiations">
-<h3>Anonymous Import Instantiations<a class="headerlink" href="#anonymous-import-instantiations" title="Permalink to this headline"></a></h3>
+</section>
+<section id="anonymous-import-instantiations">
+<h3>Anonymous Import Instantiations<a class="headerlink" href="#anonymous-import-instantiations" title="Permalink to this heading"></a></h3>
 <p>We provide syntactic sugar for importing and instantiating a functor
 at the same time:</p>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">submodule</span> <span class="kt">F</span> <span class="kr">where</span>
-  <span class="n">parameter</span>
-    <span class="n">x</span> <span class="kt">:</span> <span class="p">[</span><span class="mi">8</span><span class="p">]</span>
-  <span class="n">y</span> <span class="ow">=</span> <span class="n">x</span> <span class="o">+</span> <span class="mi">1</span>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">submodule</span><span class="w"> </span><span class="kt">F</span><span class="w"> </span><span class="kr">where</span><span class="w"></span>
+<span class="w">  </span><span class="n">parameter</span><span class="w"></span>
+<span class="w">    </span><span class="n">x</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="p">[</span><span class="mi">8</span><span class="p">]</span><span class="w"></span>
+<span class="w">  </span><span class="n">y</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">1</span><span class="w"></span>
 
-<span class="kr">import</span> <span class="nn">submodule</span> <span class="kt">F</span> <span class="kr">where</span>
-  <span class="n">x</span> <span class="ow">=</span> <span class="mi">2</span>
+<span class="kr">import</span><span class="w"> </span><span class="nn">submodule</span><span class="w"> </span><span class="kt">F</span><span class="w"> </span><span class="kr">where</span><span class="w"></span>
+<span class="w">  </span><span class="n">x</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mi">2</span><span class="w"></span>
 </pre></div>
 </div>
 <p>The <code class="docutils literal notranslate"><span class="pre">where</span></code> block may is the same as the <code class="docutils literal notranslate"><span class="pre">where</span></code> block in
@@ -691,73 +693,73 @@ <h3>Anonymous Import Instantiations<a class="headerlink" href="#anonymous-import
 (e.g., no <code class="docutils literal notranslate"><span class="pre">newtype</span></code>).</p>
 <p>It is also possible to import and instantiate using an existing module
 like this:</p>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">submodule</span> <span class="kt">F</span> <span class="kr">where</span>
-  <span class="n">parameter</span>
-    <span class="n">x</span> <span class="kt">:</span> <span class="p">[</span><span class="mi">8</span><span class="p">]</span>
-  <span class="n">y</span> <span class="ow">=</span> <span class="n">x</span> <span class="o">+</span> <span class="mi">1</span>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">submodule</span><span class="w"> </span><span class="kt">F</span><span class="w"> </span><span class="kr">where</span><span class="w"></span>
+<span class="w">  </span><span class="n">parameter</span><span class="w"></span>
+<span class="w">    </span><span class="n">x</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="p">[</span><span class="mi">8</span><span class="p">]</span><span class="w"></span>
+<span class="w">  </span><span class="n">y</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">1</span><span class="w"></span>
 
-<span class="nf">submodule</span> <span class="kt">G</span> <span class="kr">where</span>
-  <span class="n">x</span> <span class="ow">=</span> <span class="mi">7</span>
+<span class="nf">submodule</span><span class="w"> </span><span class="kt">G</span><span class="w"> </span><span class="kr">where</span><span class="w"></span>
+<span class="w">  </span><span class="n">x</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mi">7</span><span class="w"></span>
 
-<span class="kr">import</span> <span class="nn">submodule</span> <span class="kt">F</span> <span class="p">{</span> <span class="n">submodule</span> <span class="kt">G</span> <span class="p">}</span>
+<span class="kr">import</span><span class="w"> </span><span class="nn">submodule</span><span class="w"> </span><span class="kt">F</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="n">submodule</span><span class="w"> </span><span class="kt">G</span><span class="w"> </span><span class="p">}</span><span class="w"></span>
 </pre></div>
 </div>
 <p>Semantically, instantiating imports declare a local nested module and
 import it.  For example, the <code class="docutils literal notranslate"><span class="pre">where</span></code> import from above is equivalent
 to the following declarations:</p>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">submodule</span> <span class="kt">F</span> <span class="kr">where</span>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">submodule</span><span class="w"> </span><span class="kt">F</span><span class="w"> </span><span class="kr">where</span><span class="w"></span>
 
-  <span class="n">parameter</span>
-    <span class="n">x</span> <span class="kt">:</span> <span class="p">[</span><span class="mi">8</span><span class="p">]</span>
+<span class="w">  </span><span class="n">parameter</span><span class="w"></span>
+<span class="w">    </span><span class="n">x</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="p">[</span><span class="mi">8</span><span class="p">]</span><span class="w"></span>
 
-  <span class="n">y</span> <span class="ow">=</span> <span class="n">x</span> <span class="o">+</span> <span class="mi">1</span>
+<span class="w">  </span><span class="n">y</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">1</span><span class="w"></span>
 
 
-<span class="nf">submodule</span> <span class="kt">M</span> <span class="kr">where</span>
-  <span class="n">x</span> <span class="ow">=</span> <span class="mi">2</span>
+<span class="nf">submodule</span><span class="w"> </span><span class="kt">M</span><span class="w"> </span><span class="kr">where</span><span class="w"></span>
+<span class="w">  </span><span class="n">x</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mi">2</span><span class="w"></span>
 
 
-<span class="nf">submodule</span> <span class="kt">N</span> <span class="ow">=</span> <span class="n">submodule</span> <span class="kt">F</span> <span class="p">{</span> <span class="n">submodule</span> <span class="kt">M</span> <span class="p">}</span>
+<span class="nf">submodule</span><span class="w"> </span><span class="kt">N</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="n">submodule</span><span class="w"> </span><span class="kt">F</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="n">submodule</span><span class="w"> </span><span class="kt">M</span><span class="w"> </span><span class="p">}</span><span class="w"></span>
 
 
-<span class="kr">import</span> <span class="nn">submodule</span> <span class="kt">N</span>
+<span class="kr">import</span><span class="w"> </span><span class="nn">submodule</span><span class="w"> </span><span class="kt">N</span><span class="w"></span>
 </pre></div>
 </div>
-</div>
-<div class="section" id="passing-through-module-parameters">
-<h3>Passing Through Module Parameters<a class="headerlink" href="#passing-through-module-parameters" title="Permalink to this headline"></a></h3>
+</section>
+<section id="passing-through-module-parameters">
+<h3>Passing Through Module Parameters<a class="headerlink" href="#passing-through-module-parameters" title="Permalink to this heading"></a></h3>
 <p>Occasionally it is useful to define a functor that instantiates <em>another</em>
 functor using the same parameters as the functor being defined
 (i.e., a functor parameter is passed on to another functor).  This can
 be done by using the keyword <code class="docutils literal notranslate"><span class="pre">interface</span></code> followed by the name of a parameter
 in an instantiation.  Here is an example:</p>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">interface</span> <span class="n">submodule</span> <span class="kt">S</span> <span class="kr">where</span>
-  <span class="n">x</span> <span class="kt">:</span> <span class="p">[</span><span class="mi">8</span><span class="p">]</span>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">interface</span><span class="w"> </span><span class="n">submodule</span><span class="w"> </span><span class="kt">S</span><span class="w"> </span><span class="kr">where</span><span class="w"></span>
+<span class="w">  </span><span class="n">x</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="p">[</span><span class="mi">8</span><span class="p">]</span><span class="w"></span>
 
-<span class="c1">// A functor, parameterized on S</span>
-<span class="nf">submodule</span> <span class="kt">G</span> <span class="kr">where</span>
-  <span class="kr">import</span> <span class="nn">interface</span> <span class="n">submodule</span> <span class="kt">S</span>
-  <span class="n">y</span> <span class="ow">=</span> <span class="n">x</span> <span class="o">+</span> <span class="mi">1</span>
+<span class="c1">// A functor, parameterized on S</span><span class="w"></span>
+<span class="nf">submodule</span><span class="w"> </span><span class="kt">G</span><span class="w"> </span><span class="kr">where</span><span class="w"></span>
+<span class="w">  </span><span class="kr">import</span><span class="w"> </span><span class="nn">interface</span><span class="w"> </span><span class="n">submodule</span><span class="w"> </span><span class="kt">S</span><span class="w"></span>
+<span class="w">  </span><span class="n">y</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">1</span><span class="w"></span>
 
-<span class="c1">// Another functor, also parameterize on S</span>
-<span class="nf">submodule</span> <span class="kt">F</span> <span class="kr">where</span>
-  <span class="kr">import</span> <span class="nn">interface</span> <span class="n">submodule</span> <span class="kt">S</span> <span class="n">as</span> <span class="kt">A</span>
+<span class="c1">// Another functor, also parameterize on S</span><span class="w"></span>
+<span class="nf">submodule</span><span class="w"> </span><span class="kt">F</span><span class="w"> </span><span class="kr">where</span><span class="w"></span>
+<span class="w">  </span><span class="kr">import</span><span class="w"> </span><span class="nn">interface</span><span class="w"> </span><span class="n">submodule</span><span class="w"> </span><span class="kt">S</span><span class="w"> </span><span class="n">as</span><span class="w"> </span><span class="kt">A</span><span class="w"></span>
 
-  <span class="c1">// Instantiate `G` using parameter `A` of `F`</span>
-  <span class="kr">import</span> <span class="nn">submodule</span> <span class="kt">G</span> <span class="p">{</span> <span class="n">interface</span> <span class="kt">A</span> <span class="p">}</span>    <span class="c1">// Brings `y` in scope</span>
+<span class="w">  </span><span class="c1">// Instantiate `G` using parameter `A` of `F`</span><span class="w"></span>
+<span class="w">  </span><span class="kr">import</span><span class="w"> </span><span class="nn">submodule</span><span class="w"> </span><span class="kt">G</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="n">interface</span><span class="w"> </span><span class="kt">A</span><span class="w"> </span><span class="p">}</span><span class="w">    </span><span class="c1">// Brings `y` in scope</span><span class="w"></span>
 
-  <span class="n">z</span> <span class="ow">=</span> <span class="kt">A</span><span class="ow">::</span><span class="n">x</span> <span class="o">+</span> <span class="n">y</span>
+<span class="w">  </span><span class="n">z</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="kt">A</span><span class="ow">::</span><span class="n">x</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">y</span><span class="w"></span>
 
-<span class="c1">// Brings `z` into scope: z = A::x + y</span>
-<span class="c1">//                          = 5    + (5 + 1)</span>
-<span class="c1">//                          = 11</span>
-<span class="kr">import</span> <span class="nn">submodule</span> <span class="kt">F</span> <span class="kr">where</span>
-  <span class="n">x</span> <span class="ow">=</span> <span class="mi">5</span>
+<span class="c1">// Brings `z` into scope: z = A::x + y</span><span class="w"></span>
+<span class="c1">//                          = 5    + (5 + 1)</span><span class="w"></span>
+<span class="c1">//                          = 11</span><span class="w"></span>
+<span class="kr">import</span><span class="w"> </span><span class="nn">submodule</span><span class="w"> </span><span class="kt">F</span><span class="w"> </span><span class="kr">where</span><span class="w"></span>
+<span class="w">  </span><span class="n">x</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="mi">5</span><span class="w"></span>
 </pre></div>
 </div>
-</div>
-</div>
-</div>
+</section>
+</section>
+</section>
 
 
            </div>
diff --git a/docs/RefMan/_build/html/OverloadedOperations.html b/docs/RefMan/_build/html/OverloadedOperations.html
index 5c1d42e44..c43fd8fb0 100644
--- a/docs/RefMan/_build/html/OverloadedOperations.html
+++ b/docs/RefMan/_build/html/OverloadedOperations.html
@@ -1,7 +1,8 @@
 <!DOCTYPE html>
 <html class="writer-html5" lang="en" >
 <head>
-  <meta charset="utf-8" />
+  <meta charset="utf-8" /><meta name="generator" content="Docutils 0.17.1: http://docutils.sourceforge.net/" />
+
   <meta name="viewport" content="width=device-width, initial-scale=1.0" />
   <title>Overloaded Operations &mdash; Cryptol 2.11.0 documentation</title>
       <link rel="stylesheet" href="_static/pygments.css" type="text/css" />
@@ -13,6 +14,7 @@
         <script data-url_root="./" id="documentation_options" src="_static/documentation_options.js"></script>
         <script src="_static/jquery.js"></script>
         <script src="_static/underscore.js"></script>
+        <script src="_static/_sphinx_javascript_frameworks_compat.js"></script>
         <script src="_static/doctools.js"></script>
     <script src="_static/js/theme.js"></script>
     <link rel="index" title="Index" href="genindex.html" />
@@ -81,102 +83,102 @@
           <div role="main" class="document" itemscope="itemscope" itemtype="http://schema.org/Article">
            <div itemprop="articleBody">
              
-  <div class="section" id="overloaded-operations">
-<h1>Overloaded Operations<a class="headerlink" href="#overloaded-operations" title="Permalink to this headline"></a></h1>
-<div class="section" id="equality">
-<h2>Equality<a class="headerlink" href="#equality" title="Permalink to this headline"></a></h2>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kt">Eq</span>
-  <span class="p">(</span><span class="o">==</span><span class="p">)</span>        <span class="kt">:</span> <span class="p">{</span><span class="n">a</span><span class="p">}</span>    <span class="p">(</span><span class="kt">Eq</span> <span class="n">a</span><span class="p">)</span> <span class="ow">=&gt;</span> <span class="n">a</span> <span class="ow">-&gt;</span> <span class="n">a</span> <span class="ow">-&gt;</span> <span class="kr">Bit</span>
-  <span class="p">(</span><span class="o">!=</span><span class="p">)</span>        <span class="kt">:</span> <span class="p">{</span><span class="n">a</span><span class="p">}</span>    <span class="p">(</span><span class="kt">Eq</span> <span class="n">a</span><span class="p">)</span> <span class="ow">=&gt;</span> <span class="n">a</span> <span class="ow">-&gt;</span> <span class="n">a</span> <span class="ow">-&gt;</span> <span class="kr">Bit</span>
-  <span class="p">(</span><span class="o">===</span><span class="p">)</span>       <span class="kt">:</span> <span class="p">{</span><span class="n">a</span><span class="p">,</span> <span class="n">b</span><span class="p">}</span> <span class="p">(</span><span class="kt">Eq</span> <span class="n">b</span><span class="p">)</span> <span class="ow">=&gt;</span> <span class="p">(</span><span class="n">a</span> <span class="ow">-&gt;</span> <span class="n">b</span><span class="p">)</span> <span class="ow">-&gt;</span> <span class="p">(</span><span class="n">a</span> <span class="ow">-&gt;</span> <span class="n">b</span><span class="p">)</span> <span class="ow">-&gt;</span> <span class="p">(</span><span class="n">a</span> <span class="ow">-&gt;</span> <span class="kr">Bit</span><span class="p">)</span>
-  <span class="p">(</span><span class="o">!==</span><span class="p">)</span>       <span class="kt">:</span> <span class="p">{</span><span class="n">a</span><span class="p">,</span> <span class="n">b</span><span class="p">}</span> <span class="p">(</span><span class="kt">Eq</span> <span class="n">b</span><span class="p">)</span> <span class="ow">=&gt;</span> <span class="p">(</span><span class="n">a</span> <span class="ow">-&gt;</span> <span class="n">b</span><span class="p">)</span> <span class="ow">-&gt;</span> <span class="p">(</span><span class="n">a</span> <span class="ow">-&gt;</span> <span class="n">b</span><span class="p">)</span> <span class="ow">-&gt;</span> <span class="p">(</span><span class="n">a</span> <span class="ow">-&gt;</span> <span class="kr">Bit</span><span class="p">)</span>
+  <section id="overloaded-operations">
+<h1>Overloaded Operations<a class="headerlink" href="#overloaded-operations" title="Permalink to this heading"></a></h1>
+<section id="equality">
+<h2>Equality<a class="headerlink" href="#equality" title="Permalink to this heading"></a></h2>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kt">Eq</span><span class="w"></span>
+<span class="w">  </span><span class="p">(</span><span class="o">==</span><span class="p">)</span><span class="w">        </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">a</span><span class="p">}</span><span class="w">    </span><span class="p">(</span><span class="kt">Eq</span><span class="w"> </span><span class="n">a</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="kr">Bit</span><span class="w"></span>
+<span class="w">  </span><span class="p">(</span><span class="o">!=</span><span class="p">)</span><span class="w">        </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">a</span><span class="p">}</span><span class="w">    </span><span class="p">(</span><span class="kt">Eq</span><span class="w"> </span><span class="n">a</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="kr">Bit</span><span class="w"></span>
+<span class="w">  </span><span class="p">(</span><span class="o">===</span><span class="p">)</span><span class="w">       </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">a</span><span class="p">,</span><span class="w"> </span><span class="n">b</span><span class="p">}</span><span class="w"> </span><span class="p">(</span><span class="kt">Eq</span><span class="w"> </span><span class="n">b</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="p">(</span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">b</span><span class="p">)</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="p">(</span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">b</span><span class="p">)</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="p">(</span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="kr">Bit</span><span class="p">)</span><span class="w"></span>
+<span class="w">  </span><span class="p">(</span><span class="o">!==</span><span class="p">)</span><span class="w">       </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">a</span><span class="p">,</span><span class="w"> </span><span class="n">b</span><span class="p">}</span><span class="w"> </span><span class="p">(</span><span class="kt">Eq</span><span class="w"> </span><span class="n">b</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="p">(</span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">b</span><span class="p">)</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="p">(</span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">b</span><span class="p">)</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="p">(</span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="kr">Bit</span><span class="p">)</span><span class="w"></span>
 </pre></div>
 </div>
-</div>
-<div class="section" id="comparisons">
-<h2>Comparisons<a class="headerlink" href="#comparisons" title="Permalink to this headline"></a></h2>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kr">Cmp</span>
-  <span class="p">(</span><span class="o">&lt;</span><span class="p">)</span>         <span class="kt">:</span> <span class="p">{</span><span class="n">a</span><span class="p">}</span> <span class="p">(</span><span class="kr">Cmp</span> <span class="n">a</span><span class="p">)</span> <span class="ow">=&gt;</span> <span class="n">a</span> <span class="ow">-&gt;</span> <span class="n">a</span> <span class="ow">-&gt;</span> <span class="kr">Bit</span>
-  <span class="p">(</span><span class="o">&gt;</span><span class="p">)</span>         <span class="kt">:</span> <span class="p">{</span><span class="n">a</span><span class="p">}</span> <span class="p">(</span><span class="kr">Cmp</span> <span class="n">a</span><span class="p">)</span> <span class="ow">=&gt;</span> <span class="n">a</span> <span class="ow">-&gt;</span> <span class="n">a</span> <span class="ow">-&gt;</span> <span class="kr">Bit</span>
-  <span class="p">(</span><span class="o">&lt;=</span><span class="p">)</span>        <span class="kt">:</span> <span class="p">{</span><span class="n">a</span><span class="p">}</span> <span class="p">(</span><span class="kr">Cmp</span> <span class="n">a</span><span class="p">)</span> <span class="ow">=&gt;</span> <span class="n">a</span> <span class="ow">-&gt;</span> <span class="n">a</span> <span class="ow">-&gt;</span> <span class="kr">Bit</span>
-  <span class="p">(</span><span class="o">&gt;=</span><span class="p">)</span>        <span class="kt">:</span> <span class="p">{</span><span class="n">a</span><span class="p">}</span> <span class="p">(</span><span class="kr">Cmp</span> <span class="n">a</span><span class="p">)</span> <span class="ow">=&gt;</span> <span class="n">a</span> <span class="ow">-&gt;</span> <span class="n">a</span> <span class="ow">-&gt;</span> <span class="kr">Bit</span>
-  <span class="kr">min</span>         <span class="kt">:</span> <span class="p">{</span><span class="n">a</span><span class="p">}</span> <span class="p">(</span><span class="kr">Cmp</span> <span class="n">a</span><span class="p">)</span> <span class="ow">=&gt;</span> <span class="n">a</span> <span class="ow">-&gt;</span> <span class="n">a</span> <span class="ow">-&gt;</span> <span class="n">a</span>
-  <span class="kr">max</span>         <span class="kt">:</span> <span class="p">{</span><span class="n">a</span><span class="p">}</span> <span class="p">(</span><span class="kr">Cmp</span> <span class="n">a</span><span class="p">)</span> <span class="ow">=&gt;</span> <span class="n">a</span> <span class="ow">-&gt;</span> <span class="n">a</span> <span class="ow">-&gt;</span> <span class="n">a</span>
-  <span class="n">abs</span>         <span class="kt">:</span> <span class="p">{</span><span class="n">a</span><span class="p">}</span> <span class="p">(</span><span class="kr">Cmp</span> <span class="n">a</span><span class="p">,</span> <span class="kt">Ring</span> <span class="n">a</span><span class="p">)</span> <span class="ow">=&gt;</span> <span class="n">a</span> <span class="ow">-&gt;</span> <span class="n">a</span>
+</section>
+<section id="comparisons">
+<h2>Comparisons<a class="headerlink" href="#comparisons" title="Permalink to this heading"></a></h2>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kr">Cmp</span><span class="w"></span>
+<span class="w">  </span><span class="p">(</span><span class="o">&lt;</span><span class="p">)</span><span class="w">         </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">a</span><span class="p">}</span><span class="w"> </span><span class="p">(</span><span class="kr">Cmp</span><span class="w"> </span><span class="n">a</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="kr">Bit</span><span class="w"></span>
+<span class="w">  </span><span class="p">(</span><span class="o">&gt;</span><span class="p">)</span><span class="w">         </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">a</span><span class="p">}</span><span class="w"> </span><span class="p">(</span><span class="kr">Cmp</span><span class="w"> </span><span class="n">a</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="kr">Bit</span><span class="w"></span>
+<span class="w">  </span><span class="p">(</span><span class="o">&lt;=</span><span class="p">)</span><span class="w">        </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">a</span><span class="p">}</span><span class="w"> </span><span class="p">(</span><span class="kr">Cmp</span><span class="w"> </span><span class="n">a</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="kr">Bit</span><span class="w"></span>
+<span class="w">  </span><span class="p">(</span><span class="o">&gt;=</span><span class="p">)</span><span class="w">        </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">a</span><span class="p">}</span><span class="w"> </span><span class="p">(</span><span class="kr">Cmp</span><span class="w"> </span><span class="n">a</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="kr">Bit</span><span class="w"></span>
+<span class="w">  </span><span class="kr">min</span><span class="w">         </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">a</span><span class="p">}</span><span class="w"> </span><span class="p">(</span><span class="kr">Cmp</span><span class="w"> </span><span class="n">a</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"></span>
+<span class="w">  </span><span class="kr">max</span><span class="w">         </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">a</span><span class="p">}</span><span class="w"> </span><span class="p">(</span><span class="kr">Cmp</span><span class="w"> </span><span class="n">a</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"></span>
+<span class="w">  </span><span class="n">abs</span><span class="w">         </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">a</span><span class="p">}</span><span class="w"> </span><span class="p">(</span><span class="kr">Cmp</span><span class="w"> </span><span class="n">a</span><span class="p">,</span><span class="w"> </span><span class="kt">Ring</span><span class="w"> </span><span class="n">a</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"></span>
 </pre></div>
 </div>
-</div>
-<div class="section" id="signed-comparisons">
-<h2>Signed Comparisons<a class="headerlink" href="#signed-comparisons" title="Permalink to this headline"></a></h2>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kt">SignedCmp</span>
-  <span class="p">(</span><span class="o">&lt;$</span><span class="p">)</span>        <span class="kt">:</span> <span class="p">{</span><span class="n">a</span><span class="p">}</span> <span class="p">(</span><span class="kt">SignedCmp</span> <span class="n">a</span><span class="p">)</span> <span class="ow">=&gt;</span> <span class="n">a</span> <span class="ow">-&gt;</span> <span class="n">a</span> <span class="ow">-&gt;</span> <span class="kr">Bit</span>
-  <span class="p">(</span><span class="o">&gt;$</span><span class="p">)</span>        <span class="kt">:</span> <span class="p">{</span><span class="n">a</span><span class="p">}</span> <span class="p">(</span><span class="kt">SignedCmp</span> <span class="n">a</span><span class="p">)</span> <span class="ow">=&gt;</span> <span class="n">a</span> <span class="ow">-&gt;</span> <span class="n">a</span> <span class="ow">-&gt;</span> <span class="kr">Bit</span>
-  <span class="p">(</span><span class="o">&lt;=$</span><span class="p">)</span>       <span class="kt">:</span> <span class="p">{</span><span class="n">a</span><span class="p">}</span> <span class="p">(</span><span class="kt">SignedCmp</span> <span class="n">a</span><span class="p">)</span> <span class="ow">=&gt;</span> <span class="n">a</span> <span class="ow">-&gt;</span> <span class="n">a</span> <span class="ow">-&gt;</span> <span class="kr">Bit</span>
-  <span class="p">(</span><span class="o">&gt;=$</span><span class="p">)</span>       <span class="kt">:</span> <span class="p">{</span><span class="n">a</span><span class="p">}</span> <span class="p">(</span><span class="kt">SignedCmp</span> <span class="n">a</span><span class="p">)</span> <span class="ow">=&gt;</span> <span class="n">a</span> <span class="ow">-&gt;</span> <span class="n">a</span> <span class="ow">-&gt;</span> <span class="kr">Bit</span>
+</section>
+<section id="signed-comparisons">
+<h2>Signed Comparisons<a class="headerlink" href="#signed-comparisons" title="Permalink to this heading"></a></h2>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kt">SignedCmp</span><span class="w"></span>
+<span class="w">  </span><span class="p">(</span><span class="o">&lt;$</span><span class="p">)</span><span class="w">        </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">a</span><span class="p">}</span><span class="w"> </span><span class="p">(</span><span class="kt">SignedCmp</span><span class="w"> </span><span class="n">a</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="kr">Bit</span><span class="w"></span>
+<span class="w">  </span><span class="p">(</span><span class="o">&gt;$</span><span class="p">)</span><span class="w">        </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">a</span><span class="p">}</span><span class="w"> </span><span class="p">(</span><span class="kt">SignedCmp</span><span class="w"> </span><span class="n">a</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="kr">Bit</span><span class="w"></span>
+<span class="w">  </span><span class="p">(</span><span class="o">&lt;=$</span><span class="p">)</span><span class="w">       </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">a</span><span class="p">}</span><span class="w"> </span><span class="p">(</span><span class="kt">SignedCmp</span><span class="w"> </span><span class="n">a</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="kr">Bit</span><span class="w"></span>
+<span class="w">  </span><span class="p">(</span><span class="o">&gt;=$</span><span class="p">)</span><span class="w">       </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">a</span><span class="p">}</span><span class="w"> </span><span class="p">(</span><span class="kt">SignedCmp</span><span class="w"> </span><span class="n">a</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="kr">Bit</span><span class="w"></span>
 </pre></div>
 </div>
-</div>
-<div class="section" id="zero">
-<h2>Zero<a class="headerlink" href="#zero" title="Permalink to this headline"></a></h2>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kt">Zero</span>
-  <span class="n">zero</span>        <span class="kt">:</span> <span class="p">{</span><span class="n">a</span><span class="p">}</span> <span class="p">(</span><span class="kt">Zero</span> <span class="n">a</span><span class="p">)</span> <span class="ow">=&gt;</span> <span class="n">a</span>
+</section>
+<section id="zero">
+<h2>Zero<a class="headerlink" href="#zero" title="Permalink to this heading"></a></h2>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kt">Zero</span><span class="w"></span>
+<span class="w">  </span><span class="n">zero</span><span class="w">        </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">a</span><span class="p">}</span><span class="w"> </span><span class="p">(</span><span class="kt">Zero</span><span class="w"> </span><span class="n">a</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"></span>
 </pre></div>
 </div>
-</div>
-<div class="section" id="logical-operations">
-<h2>Logical Operations<a class="headerlink" href="#logical-operations" title="Permalink to this headline"></a></h2>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kt">Logic</span>
-  <span class="p">(</span><span class="o">&amp;&amp;</span><span class="p">)</span>        <span class="kt">:</span> <span class="p">{</span><span class="n">a</span><span class="p">}</span> <span class="p">(</span><span class="kt">Logic</span> <span class="n">a</span><span class="p">)</span> <span class="ow">=&gt;</span> <span class="n">a</span> <span class="ow">-&gt;</span> <span class="n">a</span> <span class="ow">-&gt;</span> <span class="n">a</span>
-  <span class="p">(</span><span class="o">||</span><span class="p">)</span>        <span class="kt">:</span> <span class="p">{</span><span class="n">a</span><span class="p">}</span> <span class="p">(</span><span class="kt">Logic</span> <span class="n">a</span><span class="p">)</span> <span class="ow">=&gt;</span> <span class="n">a</span> <span class="ow">-&gt;</span> <span class="n">a</span> <span class="ow">-&gt;</span> <span class="n">a</span>
-  <span class="p">(</span><span class="o">^</span><span class="p">)</span>         <span class="kt">:</span> <span class="p">{</span><span class="n">a</span><span class="p">}</span> <span class="p">(</span><span class="kt">Logic</span> <span class="n">a</span><span class="p">)</span> <span class="ow">=&gt;</span> <span class="n">a</span> <span class="ow">-&gt;</span> <span class="n">a</span> <span class="ow">-&gt;</span> <span class="n">a</span>
-  <span class="n">complement</span>  <span class="kt">:</span> <span class="p">{</span><span class="n">a</span><span class="p">}</span> <span class="p">(</span><span class="kt">Logic</span> <span class="n">a</span><span class="p">)</span> <span class="ow">=&gt;</span> <span class="n">a</span> <span class="ow">-&gt;</span> <span class="n">a</span>
+</section>
+<section id="logical-operations">
+<h2>Logical Operations<a class="headerlink" href="#logical-operations" title="Permalink to this heading"></a></h2>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kt">Logic</span><span class="w"></span>
+<span class="w">  </span><span class="p">(</span><span class="o">&amp;&amp;</span><span class="p">)</span><span class="w">        </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">a</span><span class="p">}</span><span class="w"> </span><span class="p">(</span><span class="kt">Logic</span><span class="w"> </span><span class="n">a</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"></span>
+<span class="w">  </span><span class="p">(</span><span class="o">||</span><span class="p">)</span><span class="w">        </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">a</span><span class="p">}</span><span class="w"> </span><span class="p">(</span><span class="kt">Logic</span><span class="w"> </span><span class="n">a</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"></span>
+<span class="w">  </span><span class="p">(</span><span class="o">^</span><span class="p">)</span><span class="w">         </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">a</span><span class="p">}</span><span class="w"> </span><span class="p">(</span><span class="kt">Logic</span><span class="w"> </span><span class="n">a</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"></span>
+<span class="w">  </span><span class="n">complement</span><span class="w">  </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">a</span><span class="p">}</span><span class="w"> </span><span class="p">(</span><span class="kt">Logic</span><span class="w"> </span><span class="n">a</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"></span>
 </pre></div>
 </div>
-</div>
-<div class="section" id="basic-arithmetic">
-<h2>Basic Arithmetic<a class="headerlink" href="#basic-arithmetic" title="Permalink to this headline"></a></h2>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kt">Ring</span>
-  <span class="n">fromInteger</span> <span class="kt">:</span> <span class="p">{</span><span class="n">a</span><span class="p">}</span> <span class="p">(</span><span class="kt">Ring</span> <span class="n">a</span><span class="p">)</span> <span class="ow">=&gt;</span> <span class="kt">Integer</span> <span class="ow">-&gt;</span> <span class="n">a</span>
-  <span class="p">(</span><span class="o">+</span><span class="p">)</span>         <span class="kt">:</span> <span class="p">{</span><span class="n">a</span><span class="p">}</span> <span class="p">(</span><span class="kt">Ring</span> <span class="n">a</span><span class="p">)</span> <span class="ow">=&gt;</span> <span class="n">a</span> <span class="ow">-&gt;</span> <span class="n">a</span> <span class="ow">-&gt;</span> <span class="n">a</span>
-  <span class="p">(</span><span class="o">-</span><span class="p">)</span>         <span class="kt">:</span> <span class="p">{</span><span class="n">a</span><span class="p">}</span> <span class="p">(</span><span class="kt">Ring</span> <span class="n">a</span><span class="p">)</span> <span class="ow">=&gt;</span> <span class="n">a</span> <span class="ow">-&gt;</span> <span class="n">a</span> <span class="ow">-&gt;</span> <span class="n">a</span>
-  <span class="p">(</span><span class="o">*</span><span class="p">)</span>         <span class="kt">:</span> <span class="p">{</span><span class="n">a</span><span class="p">}</span> <span class="p">(</span><span class="kt">Ring</span> <span class="n">a</span><span class="p">)</span> <span class="ow">=&gt;</span> <span class="n">a</span> <span class="ow">-&gt;</span> <span class="n">a</span> <span class="ow">-&gt;</span> <span class="n">a</span>
-  <span class="n">negate</span>      <span class="kt">:</span> <span class="p">{</span><span class="n">a</span><span class="p">}</span> <span class="p">(</span><span class="kt">Ring</span> <span class="n">a</span><span class="p">)</span> <span class="ow">=&gt;</span> <span class="n">a</span> <span class="ow">-&gt;</span> <span class="n">a</span>
-  <span class="p">(</span><span class="o">^^</span><span class="p">)</span>        <span class="kt">:</span> <span class="p">{</span><span class="n">a</span><span class="p">,</span> <span class="n">e</span><span class="p">}</span> <span class="p">(</span><span class="kt">Ring</span> <span class="n">a</span><span class="p">,</span> <span class="kt">Integral</span> <span class="n">e</span><span class="p">)</span> <span class="ow">=&gt;</span> <span class="n">a</span> <span class="ow">-&gt;</span> <span class="n">e</span> <span class="ow">-&gt;</span> <span class="n">a</span>
+</section>
+<section id="basic-arithmetic">
+<h2>Basic Arithmetic<a class="headerlink" href="#basic-arithmetic" title="Permalink to this heading"></a></h2>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kt">Ring</span><span class="w"></span>
+<span class="w">  </span><span class="n">fromInteger</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">a</span><span class="p">}</span><span class="w"> </span><span class="p">(</span><span class="kt">Ring</span><span class="w"> </span><span class="n">a</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="kt">Integer</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"></span>
+<span class="w">  </span><span class="p">(</span><span class="o">+</span><span class="p">)</span><span class="w">         </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">a</span><span class="p">}</span><span class="w"> </span><span class="p">(</span><span class="kt">Ring</span><span class="w"> </span><span class="n">a</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"></span>
+<span class="w">  </span><span class="p">(</span><span class="o">-</span><span class="p">)</span><span class="w">         </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">a</span><span class="p">}</span><span class="w"> </span><span class="p">(</span><span class="kt">Ring</span><span class="w"> </span><span class="n">a</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"></span>
+<span class="w">  </span><span class="p">(</span><span class="o">*</span><span class="p">)</span><span class="w">         </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">a</span><span class="p">}</span><span class="w"> </span><span class="p">(</span><span class="kt">Ring</span><span class="w"> </span><span class="n">a</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"></span>
+<span class="w">  </span><span class="n">negate</span><span class="w">      </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">a</span><span class="p">}</span><span class="w"> </span><span class="p">(</span><span class="kt">Ring</span><span class="w"> </span><span class="n">a</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"></span>
+<span class="w">  </span><span class="p">(</span><span class="o">^^</span><span class="p">)</span><span class="w">        </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">a</span><span class="p">,</span><span class="w"> </span><span class="n">e</span><span class="p">}</span><span class="w"> </span><span class="p">(</span><span class="kt">Ring</span><span class="w"> </span><span class="n">a</span><span class="p">,</span><span class="w"> </span><span class="kt">Integral</span><span class="w"> </span><span class="n">e</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">e</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"></span>
 </pre></div>
 </div>
-</div>
-<div class="section" id="integral-operations">
-<h2>Integral Operations<a class="headerlink" href="#integral-operations" title="Permalink to this headline"></a></h2>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kt">Integral</span>
-  <span class="p">(</span><span class="o">/</span><span class="p">)</span>         <span class="kt">:</span> <span class="p">{</span><span class="n">a</span><span class="p">}</span> <span class="p">(</span><span class="kt">Integral</span> <span class="n">a</span><span class="p">)</span> <span class="ow">=&gt;</span> <span class="n">a</span> <span class="ow">-&gt;</span> <span class="n">a</span> <span class="ow">-&gt;</span> <span class="n">a</span>
-  <span class="p">(</span><span class="o">%</span><span class="p">)</span>         <span class="kt">:</span> <span class="p">{</span><span class="n">a</span><span class="p">}</span> <span class="p">(</span><span class="kt">Integral</span> <span class="n">a</span><span class="p">)</span> <span class="ow">=&gt;</span> <span class="n">a</span> <span class="ow">-&gt;</span> <span class="n">a</span> <span class="ow">-&gt;</span> <span class="n">a</span>
-  <span class="p">(</span><span class="o">^^</span><span class="p">)</span>        <span class="kt">:</span> <span class="p">{</span><span class="n">a</span><span class="p">,</span> <span class="n">e</span><span class="p">}</span> <span class="p">(</span><span class="kt">Ring</span> <span class="n">a</span><span class="p">,</span> <span class="kt">Integral</span> <span class="n">e</span><span class="p">)</span> <span class="ow">=&gt;</span> <span class="n">a</span> <span class="ow">-&gt;</span> <span class="n">e</span> <span class="ow">-&gt;</span> <span class="n">a</span>
-  <span class="n">toInteger</span>   <span class="kt">:</span> <span class="p">{</span><span class="n">a</span><span class="p">}</span> <span class="p">(</span><span class="kt">Integral</span> <span class="n">a</span><span class="p">)</span> <span class="ow">=&gt;</span> <span class="n">a</span> <span class="ow">-&gt;</span> <span class="kt">Integer</span>
-  <span class="n">infFrom</span>     <span class="kt">:</span> <span class="p">{</span><span class="n">a</span><span class="p">}</span> <span class="p">(</span><span class="kt">Integral</span> <span class="n">a</span><span class="p">)</span> <span class="ow">=&gt;</span> <span class="n">a</span> <span class="ow">-&gt;</span> <span class="p">[</span><span class="kr">inf</span><span class="p">]</span><span class="n">a</span>
-  <span class="n">infFromThen</span> <span class="kt">:</span> <span class="p">{</span><span class="n">a</span><span class="p">}</span> <span class="p">(</span><span class="kt">Integral</span> <span class="n">a</span><span class="p">)</span> <span class="ow">=&gt;</span> <span class="n">a</span> <span class="ow">-&gt;</span> <span class="n">a</span> <span class="ow">-&gt;</span> <span class="p">[</span><span class="kr">inf</span><span class="p">]</span><span class="n">a</span>
+</section>
+<section id="integral-operations">
+<h2>Integral Operations<a class="headerlink" href="#integral-operations" title="Permalink to this heading"></a></h2>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kt">Integral</span><span class="w"></span>
+<span class="w">  </span><span class="p">(</span><span class="o">/</span><span class="p">)</span><span class="w">         </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">a</span><span class="p">}</span><span class="w"> </span><span class="p">(</span><span class="kt">Integral</span><span class="w"> </span><span class="n">a</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"></span>
+<span class="w">  </span><span class="p">(</span><span class="o">%</span><span class="p">)</span><span class="w">         </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">a</span><span class="p">}</span><span class="w"> </span><span class="p">(</span><span class="kt">Integral</span><span class="w"> </span><span class="n">a</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"></span>
+<span class="w">  </span><span class="p">(</span><span class="o">^^</span><span class="p">)</span><span class="w">        </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">a</span><span class="p">,</span><span class="w"> </span><span class="n">e</span><span class="p">}</span><span class="w"> </span><span class="p">(</span><span class="kt">Ring</span><span class="w"> </span><span class="n">a</span><span class="p">,</span><span class="w"> </span><span class="kt">Integral</span><span class="w"> </span><span class="n">e</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">e</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"></span>
+<span class="w">  </span><span class="n">toInteger</span><span class="w">   </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">a</span><span class="p">}</span><span class="w"> </span><span class="p">(</span><span class="kt">Integral</span><span class="w"> </span><span class="n">a</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="kt">Integer</span><span class="w"></span>
+<span class="w">  </span><span class="n">infFrom</span><span class="w">     </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">a</span><span class="p">}</span><span class="w"> </span><span class="p">(</span><span class="kt">Integral</span><span class="w"> </span><span class="n">a</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="p">[</span><span class="kr">inf</span><span class="p">]</span><span class="n">a</span><span class="w"></span>
+<span class="w">  </span><span class="n">infFromThen</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">a</span><span class="p">}</span><span class="w"> </span><span class="p">(</span><span class="kt">Integral</span><span class="w"> </span><span class="n">a</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="p">[</span><span class="kr">inf</span><span class="p">]</span><span class="n">a</span><span class="w"></span>
 </pre></div>
 </div>
-</div>
-<div class="section" id="division">
-<h2>Division<a class="headerlink" href="#division" title="Permalink to this headline"></a></h2>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kt">Field</span>
-  <span class="n">recip</span>       <span class="kt">:</span> <span class="p">{</span><span class="n">a</span><span class="p">}</span> <span class="p">(</span><span class="kt">Field</span> <span class="n">a</span><span class="p">)</span> <span class="ow">=&gt;</span> <span class="n">a</span> <span class="ow">-&gt;</span> <span class="n">a</span>
-  <span class="p">(</span><span class="o">/.</span><span class="p">)</span>        <span class="kt">:</span> <span class="p">{</span><span class="n">a</span><span class="p">}</span> <span class="p">(</span><span class="kt">Field</span> <span class="n">a</span><span class="p">)</span> <span class="ow">=&gt;</span> <span class="n">a</span> <span class="ow">-&gt;</span> <span class="n">a</span> <span class="ow">-&gt;</span> <span class="n">a</span>
+</section>
+<section id="division">
+<h2>Division<a class="headerlink" href="#division" title="Permalink to this heading"></a></h2>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kt">Field</span><span class="w"></span>
+<span class="w">  </span><span class="n">recip</span><span class="w">       </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">a</span><span class="p">}</span><span class="w"> </span><span class="p">(</span><span class="kt">Field</span><span class="w"> </span><span class="n">a</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"></span>
+<span class="w">  </span><span class="p">(</span><span class="o">/.</span><span class="p">)</span><span class="w">        </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">a</span><span class="p">}</span><span class="w"> </span><span class="p">(</span><span class="kt">Field</span><span class="w"> </span><span class="n">a</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"></span>
 </pre></div>
 </div>
-</div>
-<div class="section" id="rounding">
-<h2>Rounding<a class="headerlink" href="#rounding" title="Permalink to this headline"></a></h2>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kt">Round</span>
-  <span class="n">ceiling</span>     <span class="kt">:</span> <span class="p">{</span><span class="n">a</span><span class="p">}</span> <span class="p">(</span><span class="kt">Round</span> <span class="n">a</span><span class="p">)</span> <span class="ow">=&gt;</span> <span class="n">a</span> <span class="ow">-&gt;</span> <span class="kt">Integer</span>
-  <span class="n">floor</span>       <span class="kt">:</span> <span class="p">{</span><span class="n">a</span><span class="p">}</span> <span class="p">(</span><span class="kt">Round</span> <span class="n">a</span><span class="p">)</span> <span class="ow">=&gt;</span> <span class="n">a</span> <span class="ow">-&gt;</span> <span class="kt">Integer</span>
-  <span class="n">trunc</span>       <span class="kt">:</span> <span class="p">{</span><span class="n">a</span><span class="p">}</span> <span class="p">(</span><span class="kt">Round</span> <span class="n">a</span><span class="p">)</span> <span class="ow">=&gt;</span> <span class="n">a</span> <span class="ow">-&gt;</span> <span class="kt">Integer</span>
-  <span class="n">roundAway</span>   <span class="kt">:</span> <span class="p">{</span><span class="n">a</span><span class="p">}</span> <span class="p">(</span><span class="kt">Round</span> <span class="n">a</span><span class="p">)</span> <span class="ow">=&gt;</span> <span class="n">a</span> <span class="ow">-&gt;</span> <span class="kt">Integer</span>
-  <span class="n">roundToEven</span> <span class="kt">:</span> <span class="p">{</span><span class="n">a</span><span class="p">}</span> <span class="p">(</span><span class="kt">Round</span> <span class="n">a</span><span class="p">)</span> <span class="ow">=&gt;</span> <span class="n">a</span> <span class="ow">-&gt;</span> <span class="kt">Integer</span>
+</section>
+<section id="rounding">
+<h2>Rounding<a class="headerlink" href="#rounding" title="Permalink to this heading"></a></h2>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kt">Round</span><span class="w"></span>
+<span class="w">  </span><span class="n">ceiling</span><span class="w">     </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">a</span><span class="p">}</span><span class="w"> </span><span class="p">(</span><span class="kt">Round</span><span class="w"> </span><span class="n">a</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="kt">Integer</span><span class="w"></span>
+<span class="w">  </span><span class="n">floor</span><span class="w">       </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">a</span><span class="p">}</span><span class="w"> </span><span class="p">(</span><span class="kt">Round</span><span class="w"> </span><span class="n">a</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="kt">Integer</span><span class="w"></span>
+<span class="w">  </span><span class="n">trunc</span><span class="w">       </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">a</span><span class="p">}</span><span class="w"> </span><span class="p">(</span><span class="kt">Round</span><span class="w"> </span><span class="n">a</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="kt">Integer</span><span class="w"></span>
+<span class="w">  </span><span class="n">roundAway</span><span class="w">   </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">a</span><span class="p">}</span><span class="w"> </span><span class="p">(</span><span class="kt">Round</span><span class="w"> </span><span class="n">a</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="kt">Integer</span><span class="w"></span>
+<span class="w">  </span><span class="n">roundToEven</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">a</span><span class="p">}</span><span class="w"> </span><span class="p">(</span><span class="kt">Round</span><span class="w"> </span><span class="n">a</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="kt">Integer</span><span class="w"></span>
 </pre></div>
 </div>
-</div>
-</div>
+</section>
+</section>
 
 
            </div>
diff --git a/docs/RefMan/_build/html/RefMan.html b/docs/RefMan/_build/html/RefMan.html
index 1bc5da77f..8fa591a1a 100644
--- a/docs/RefMan/_build/html/RefMan.html
+++ b/docs/RefMan/_build/html/RefMan.html
@@ -1,7 +1,8 @@
 <!DOCTYPE html>
 <html class="writer-html5" lang="en" >
 <head>
-  <meta charset="utf-8" />
+  <meta charset="utf-8" /><meta name="generator" content="Docutils 0.17.1: http://docutils.sourceforge.net/" />
+
   <meta name="viewport" content="width=device-width, initial-scale=1.0" />
   <title>Cryptol Reference Manual &mdash; Cryptol 2.11.0 documentation</title>
       <link rel="stylesheet" href="_static/pygments.css" type="text/css" />
@@ -13,6 +14,7 @@
         <script data-url_root="./" id="documentation_options" src="_static/documentation_options.js"></script>
         <script src="_static/jquery.js"></script>
         <script src="_static/underscore.js"></script>
+        <script src="_static/_sphinx_javascript_frameworks_compat.js"></script>
         <script src="_static/doctools.js"></script>
     <script src="_static/js/theme.js"></script>
     <link rel="index" title="Index" href="genindex.html" />
@@ -69,14 +71,15 @@
           <div role="main" class="document" itemscope="itemscope" itemtype="http://schema.org/Article">
            <div itemprop="articleBody">
              
-  <div class="section" id="cryptol-reference-manual">
-<h1>Cryptol Reference Manual<a class="headerlink" href="#cryptol-reference-manual" title="Permalink to this headline"></a></h1>
+  <section id="cryptol-reference-manual">
+<h1>Cryptol Reference Manual<a class="headerlink" href="#cryptol-reference-manual" title="Permalink to this heading"></a></h1>
 <div class="toctree-wrapper compound">
 <p class="caption" role="heading"><span class="caption-text">Cryptol Reference Manual</span></p>
 <ul>
 <li class="toctree-l1"><a class="reference internal" href="BasicSyntax.html">Basic Syntax</a><ul>
 <li class="toctree-l2"><a class="reference internal" href="BasicSyntax.html#declarations">Declarations</a></li>
 <li class="toctree-l2"><a class="reference internal" href="BasicSyntax.html#type-signatures">Type Signatures</a></li>
+<li class="toctree-l2"><a class="reference internal" href="BasicSyntax.html#numeric-constraint-guards">Numeric Constraint Guards</a></li>
 <li class="toctree-l2"><a class="reference internal" href="BasicSyntax.html#layout">Layout</a></li>
 <li class="toctree-l2"><a class="reference internal" href="BasicSyntax.html#comments">Comments</a></li>
 <li class="toctree-l2"><a class="reference internal" href="BasicSyntax.html#identifiers">Identifiers</a></li>
@@ -153,7 +156,7 @@ <h1>Cryptol Reference Manual<a class="headerlink" href="#cryptol-reference-manua
 </li>
 </ul>
 </div>
-</div>
+</section>
 
 
            </div>
diff --git a/docs/RefMan/_build/html/TypeDeclarations.html b/docs/RefMan/_build/html/TypeDeclarations.html
index a23564d10..566b0c207 100644
--- a/docs/RefMan/_build/html/TypeDeclarations.html
+++ b/docs/RefMan/_build/html/TypeDeclarations.html
@@ -1,7 +1,8 @@
 <!DOCTYPE html>
 <html class="writer-html5" lang="en" >
 <head>
-  <meta charset="utf-8" />
+  <meta charset="utf-8" /><meta name="generator" content="Docutils 0.17.1: http://docutils.sourceforge.net/" />
+
   <meta name="viewport" content="width=device-width, initial-scale=1.0" />
   <title>Type Declarations &mdash; Cryptol 2.11.0 documentation</title>
       <link rel="stylesheet" href="_static/pygments.css" type="text/css" />
@@ -13,6 +14,7 @@
         <script data-url_root="./" id="documentation_options" src="_static/documentation_options.js"></script>
         <script src="_static/jquery.js"></script>
         <script src="_static/underscore.js"></script>
+        <script src="_static/_sphinx_javascript_frameworks_compat.js"></script>
         <script src="_static/doctools.js"></script>
     <script src="_static/js/theme.js"></script>
     <link rel="index" title="Index" href="genindex.html" />
@@ -74,11 +76,11 @@
           <div role="main" class="document" itemscope="itemscope" itemtype="http://schema.org/Article">
            <div itemprop="articleBody">
              
-  <div class="section" id="type-declarations">
-<h1>Type Declarations<a class="headerlink" href="#type-declarations" title="Permalink to this headline"></a></h1>
-<div class="section" id="type-synonyms">
-<h2>Type Synonyms<a class="headerlink" href="#type-synonyms" title="Permalink to this headline"></a></h2>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kr">type</span> <span class="kt">T</span> <span class="n">a</span> <span class="n">b</span> <span class="ow">=</span> <span class="p">[</span><span class="n">a</span><span class="p">]</span> <span class="n">b</span>
+  <section id="type-declarations">
+<h1>Type Declarations<a class="headerlink" href="#type-declarations" title="Permalink to this heading"></a></h1>
+<section id="type-synonyms">
+<h2>Type Synonyms<a class="headerlink" href="#type-synonyms" title="Permalink to this heading"></a></h2>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kr">type</span><span class="w"> </span><span class="kt">T</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="n">b</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="p">[</span><span class="n">a</span><span class="p">]</span><span class="w"> </span><span class="n">b</span><span class="w"></span>
 </pre></div>
 </div>
 <p>A <code class="docutils literal notranslate"><span class="pre">type</span></code> declaration creates a synonym for a
@@ -88,10 +90,10 @@ <h2>Type Synonyms<a class="headerlink" href="#type-synonyms" title="Permalink to
 written the body of the type synonym in line.
 Type synonyms may mention other synonyms, but it is not
 allowed to create a recursive collection of type synonyms.</p>
-</div>
-<div class="section" id="newtypes">
-<h2>Newtypes<a class="headerlink" href="#newtypes" title="Permalink to this headline"></a></h2>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kr">newtype</span> <span class="kt">NewT</span> <span class="n">a</span> <span class="n">b</span> <span class="ow">=</span> <span class="p">{</span> <span class="nb">seq</span> <span class="kt">:</span> <span class="p">[</span><span class="n">a</span><span class="p">]</span><span class="n">b</span> <span class="p">}</span>
+</section>
+<section id="newtypes">
+<h2>Newtypes<a class="headerlink" href="#newtypes" title="Permalink to this heading"></a></h2>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kr">newtype</span><span class="w"> </span><span class="kt">NewT</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="n">b</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="nb">seq</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="p">[</span><span class="n">a</span><span class="p">]</span><span class="n">b</span><span class="w"> </span><span class="p">}</span><span class="w"></span>
 </pre></div>
 </div>
 <p>A <code class="docutils literal notranslate"><span class="pre">newtype</span></code> declaration declares a new named type which is defined by
@@ -107,8 +109,8 @@ <h2>Newtypes<a class="headerlink" href="#newtypes" title="Permalink to this head
 <p>Every <code class="docutils literal notranslate"><span class="pre">newtype</span></code> declaration brings into scope a new function with the
 same name as the type which can be used to create values of the
 newtype.</p>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">x</span> <span class="kt">:</span> <span class="kt">NewT</span> <span class="mi">3</span> <span class="kt">Integer</span>
-<span class="nf">x</span> <span class="ow">=</span> <span class="kt">NewT</span> <span class="p">{</span> <span class="nb">seq</span> <span class="ow">=</span> <span class="p">[</span><span class="mi">1</span><span class="p">,</span><span class="mi">2</span><span class="p">,</span><span class="mi">3</span><span class="p">]</span> <span class="p">}</span>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">x</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="kt">NewT</span><span class="w"> </span><span class="mi">3</span><span class="w"> </span><span class="kt">Integer</span><span class="w"></span>
+<span class="nf">x</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="kt">NewT</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="nb">seq</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="p">[</span><span class="mi">1</span><span class="p">,</span><span class="mi">2</span><span class="p">,</span><span class="mi">3</span><span class="p">]</span><span class="w"> </span><span class="p">}</span><span class="w"></span>
 </pre></div>
 </div>
 <p>Just as with records, field projections can be used directly on values
@@ -117,8 +119,8 @@ <h2>Newtypes<a class="headerlink" href="#newtypes" title="Permalink to this head
 6
 </pre></div>
 </div>
-</div>
-</div>
+</section>
+</section>
 
 
            </div>
diff --git a/docs/RefMan/_build/html/_sources/BasicSyntax.rst.txt b/docs/RefMan/_build/html/_sources/BasicSyntax.rst.txt
index 90e31090b..43acef714 100644
--- a/docs/RefMan/_build/html/_sources/BasicSyntax.rst.txt
+++ b/docs/RefMan/_build/html/_sources/BasicSyntax.rst.txt
@@ -19,6 +19,46 @@ Type Signatures
   f,g : {a,b} (fin a) => [a] b
 
 
+Numeric Constraint Guards
+-------------------------
+
+A declaration with a signature can use numeric constraint guards, which are like
+normal guards (such as in a multi-branch `if`` expression) except that the
+guarding conditions can be numeric constraints. For example:
+
+.. code-block:: cryptol
+
+  len : {n} (fin n) => [n]a -> Integer
+  len xs | n == 0 => 0
+         | n >  0 => 1 + len (drop `{1} xs)
+
+
+Note that this is importantly different from
+
+.. code-block:: cryptol
+  
+  len' : {n} (fin n) => [n]a -> Integer
+  len' xs = if `n == 0 => 0
+             | `n >  0 => 1 + len (drop `{1} xs)
+
+In `len'`, the type-checker cannot determine that `n >= 1` which is
+required to use the
+
+.. code-block:: cryptol
+
+  drop `{1} xs
+
+since the `if`'s condition is only on values, not types.
+
+However, in `len`, the type-checker locally-assumes the constraint `n > 0` in
+that constraint-guarded branch and so it can in fact determine that `n >= 1`.
+
+Requirements:
+  - Numeric constraint guards only support constraints over numeric literals,
+    such as `fin`, `<=`, `==`, etc. Type constraint aliases can also be used as
+    long as they only constraint numeric literals.
+  - The numeric constraint guards of a declaration must be exhaustive.
+
 
 Layout
 ------
diff --git a/docs/RefMan/_build/html/_static/_sphinx_javascript_frameworks_compat.js b/docs/RefMan/_build/html/_static/_sphinx_javascript_frameworks_compat.js
new file mode 100644
index 000000000..8549469dc
--- /dev/null
+++ b/docs/RefMan/_build/html/_static/_sphinx_javascript_frameworks_compat.js
@@ -0,0 +1,134 @@
+/*
+ * _sphinx_javascript_frameworks_compat.js
+ * ~~~~~~~~~~
+ *
+ * Compatability shim for jQuery and underscores.js.
+ *
+ * WILL BE REMOVED IN Sphinx 6.0
+ * xref RemovedInSphinx60Warning
+ *
+ */
+
+/**
+ * select a different prefix for underscore
+ */
+$u = _.noConflict();
+
+
+/**
+ * small helper function to urldecode strings
+ *
+ * See https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/decodeURIComponent#Decoding_query_parameters_from_a_URL
+ */
+jQuery.urldecode = function(x) {
+    if (!x) {
+        return x
+    }
+    return decodeURIComponent(x.replace(/\+/g, ' '));
+};
+
+/**
+ * small helper function to urlencode strings
+ */
+jQuery.urlencode = encodeURIComponent;
+
+/**
+ * This function returns the parsed url parameters of the
+ * current request. Multiple values per key are supported,
+ * it will always return arrays of strings for the value parts.
+ */
+jQuery.getQueryParameters = function(s) {
+    if (typeof s === 'undefined')
+        s = document.location.search;
+    var parts = s.substr(s.indexOf('?') + 1).split('&');
+    var result = {};
+    for (var i = 0; i < parts.length; i++) {
+        var tmp = parts[i].split('=', 2);
+        var key = jQuery.urldecode(tmp[0]);
+        var value = jQuery.urldecode(tmp[1]);
+        if (key in result)
+            result[key].push(value);
+        else
+            result[key] = [value];
+    }
+    return result;
+};
+
+/**
+ * highlight a given string on a jquery object by wrapping it in
+ * span elements with the given class name.
+ */
+jQuery.fn.highlightText = function(text, className) {
+    function highlight(node, addItems) {
+        if (node.nodeType === 3) {
+            var val = node.nodeValue;
+            var pos = val.toLowerCase().indexOf(text);
+            if (pos >= 0 &&
+                !jQuery(node.parentNode).hasClass(className) &&
+                !jQuery(node.parentNode).hasClass("nohighlight")) {
+                var span;
+                var isInSVG = jQuery(node).closest("body, svg, foreignObject").is("svg");
+                if (isInSVG) {
+                    span = document.createElementNS("http://www.w3.org/2000/svg", "tspan");
+                } else {
+                    span = document.createElement("span");
+                    span.className = className;
+                }
+                span.appendChild(document.createTextNode(val.substr(pos, text.length)));
+                node.parentNode.insertBefore(span, node.parentNode.insertBefore(
+                    document.createTextNode(val.substr(pos + text.length)),
+                    node.nextSibling));
+                node.nodeValue = val.substr(0, pos);
+                if (isInSVG) {
+                    var rect = document.createElementNS("http://www.w3.org/2000/svg", "rect");
+                    var bbox = node.parentElement.getBBox();
+                    rect.x.baseVal.value = bbox.x;
+                    rect.y.baseVal.value = bbox.y;
+                    rect.width.baseVal.value = bbox.width;
+                    rect.height.baseVal.value = bbox.height;
+                    rect.setAttribute('class', className);
+                    addItems.push({
+                        "parent": node.parentNode,
+                        "target": rect});
+                }
+            }
+        }
+        else if (!jQuery(node).is("button, select, textarea")) {
+            jQuery.each(node.childNodes, function() {
+                highlight(this, addItems);
+            });
+        }
+    }
+    var addItems = [];
+    var result = this.each(function() {
+        highlight(this, addItems);
+    });
+    for (var i = 0; i < addItems.length; ++i) {
+        jQuery(addItems[i].parent).before(addItems[i].target);
+    }
+    return result;
+};
+
+/*
+ * backward compatibility for jQuery.browser
+ * This will be supported until firefox bug is fixed.
+ */
+if (!jQuery.browser) {
+    jQuery.uaMatch = function(ua) {
+        ua = ua.toLowerCase();
+
+        var match = /(chrome)[ \/]([\w.]+)/.exec(ua) ||
+            /(webkit)[ \/]([\w.]+)/.exec(ua) ||
+            /(opera)(?:.*version|)[ \/]([\w.]+)/.exec(ua) ||
+            /(msie) ([\w.]+)/.exec(ua) ||
+            ua.indexOf("compatible") < 0 && /(mozilla)(?:.*? rv:([\w.]+)|)/.exec(ua) ||
+            [];
+
+        return {
+            browser: match[ 1 ] || "",
+            version: match[ 2 ] || "0"
+        };
+    };
+    jQuery.browser = {};
+    jQuery.browser[jQuery.uaMatch(navigator.userAgent).browser] = true;
+}
diff --git a/docs/RefMan/_build/html/_static/basic.css b/docs/RefMan/_build/html/_static/basic.css
index 912859b55..9039e027c 100644
--- a/docs/RefMan/_build/html/_static/basic.css
+++ b/docs/RefMan/_build/html/_static/basic.css
@@ -4,7 +4,7 @@
  *
  * Sphinx stylesheet -- basic theme.
  *
- * :copyright: Copyright 2007-2021 by the Sphinx team, see AUTHORS.
+ * :copyright: Copyright 2007-2022 by the Sphinx team, see AUTHORS.
  * :license: BSD, see LICENSE for details.
  *
  */
@@ -222,7 +222,7 @@ table.modindextable td {
 /* -- general body styles --------------------------------------------------- */
 
 div.body {
-    min-width: 450px;
+    min-width: 360px;
     max-width: 800px;
 }
 
@@ -335,13 +335,13 @@ p.sidebar-title {
     font-weight: bold;
 }
 
-div.admonition, div.topic, blockquote {
+div.admonition, div.topic, aside.topic, blockquote {
     clear: left;
 }
 
 /* -- topics ---------------------------------------------------------------- */
 
-div.topic {
+div.topic, aside.topic {
     border: 1px solid #ccc;
     padding: 7px;
     margin: 10px 0 10px 0;
@@ -380,6 +380,7 @@ div.body p.centered {
 div.sidebar > :last-child,
 aside.sidebar > :last-child,
 div.topic > :last-child,
+aside.topic > :last-child,
 div.admonition > :last-child {
     margin-bottom: 0;
 }
@@ -387,6 +388,7 @@ div.admonition > :last-child {
 div.sidebar::after,
 aside.sidebar::after,
 div.topic::after,
+aside.topic::after,
 div.admonition::after,
 blockquote::after {
     display: block;
@@ -428,10 +430,6 @@ table.docutils td, table.docutils th {
     border-bottom: 1px solid #aaa;
 }
 
-table.footnote td, table.footnote th {
-    border: 0 !important;
-}
-
 th {
     text-align: left;
     padding-right: 5px;
@@ -615,6 +613,7 @@ ul.simple p {
     margin-bottom: 0;
 }
 
+/* Docutils 0.17 and older (footnotes & citations) */
 dl.footnote > dt,
 dl.citation > dt {
     float: left;
@@ -632,6 +631,33 @@ dl.citation > dd:after {
     clear: both;
 }
 
+/* Docutils 0.18+ (footnotes & citations) */
+aside.footnote > span,
+div.citation > span {
+    float: left;
+}
+aside.footnote > span:last-of-type,
+div.citation > span:last-of-type {
+  padding-right: 0.5em;
+}
+aside.footnote > p {
+  margin-left: 2em;
+}
+div.citation > p {
+  margin-left: 4em;
+}
+aside.footnote > p:last-of-type,
+div.citation > p:last-of-type {
+    margin-bottom: 0em;
+}
+aside.footnote > p:last-of-type:after,
+div.citation > p:last-of-type:after {
+    content: "";
+    clear: both;
+}
+
+/* Footnotes & citations ends */
+
 dl.field-list {
     display: grid;
     grid-template-columns: fit-content(30%) auto;
@@ -731,8 +757,9 @@ dl.glossary dt {
 
 .classifier:before {
     font-style: normal;
-    margin: 0.5em;
+    margin: 0 0.5em;
     content: ":";
+    display: inline-block;
 }
 
 abbr, acronym {
@@ -756,6 +783,7 @@ span.pre {
     -ms-hyphens: none;
     -webkit-hyphens: none;
     hyphens: none;
+    white-space: nowrap;
 }
 
 div[class*="highlight-"] {
diff --git a/docs/RefMan/_build/html/_static/doctools.js b/docs/RefMan/_build/html/_static/doctools.js
index 8cbf1b161..c3db08d1c 100644
--- a/docs/RefMan/_build/html/_static/doctools.js
+++ b/docs/RefMan/_build/html/_static/doctools.js
@@ -2,322 +2,263 @@
  * doctools.js
  * ~~~~~~~~~~~
  *
- * Sphinx JavaScript utilities for all documentation.
+ * Base JavaScript utilities for all Sphinx HTML documentation.
  *
- * :copyright: Copyright 2007-2021 by the Sphinx team, see AUTHORS.
+ * :copyright: Copyright 2007-2022 by the Sphinx team, see AUTHORS.
  * :license: BSD, see LICENSE for details.
  *
  */
+"use strict";
 
-/**
- * select a different prefix for underscore
- */
-$u = _.noConflict();
-
-/**
- * make the code below compatible with browsers without
- * an installed firebug like debugger
-if (!window.console || !console.firebug) {
-  var names = ["log", "debug", "info", "warn", "error", "assert", "dir",
-    "dirxml", "group", "groupEnd", "time", "timeEnd", "count", "trace",
-    "profile", "profileEnd"];
-  window.console = {};
-  for (var i = 0; i < names.length; ++i)
-    window.console[names[i]] = function() {};
-}
- */
-
-/**
- * small helper function to urldecode strings
- *
- * See https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/decodeURIComponent#Decoding_query_parameters_from_a_URL
- */
-jQuery.urldecode = function(x) {
-  if (!x) {
-    return x
+const _ready = (callback) => {
+  if (document.readyState !== "loading") {
+    callback();
+  } else {
+    document.addEventListener("DOMContentLoaded", callback);
   }
-  return decodeURIComponent(x.replace(/\+/g, ' '));
 };
 
 /**
- * small helper function to urlencode strings
+ * highlight a given string on a node by wrapping it in
+ * span elements with the given class name.
  */
-jQuery.urlencode = encodeURIComponent;
+const _highlight = (node, addItems, text, className) => {
+  if (node.nodeType === Node.TEXT_NODE) {
+    const val = node.nodeValue;
+    const parent = node.parentNode;
+    const pos = val.toLowerCase().indexOf(text);
+    if (
+      pos >= 0 &&
+      !parent.classList.contains(className) &&
+      !parent.classList.contains("nohighlight")
+    ) {
+      let span;
 
-/**
- * This function returns the parsed url parameters of the
- * current request. Multiple values per key are supported,
- * it will always return arrays of strings for the value parts.
- */
-jQuery.getQueryParameters = function(s) {
-  if (typeof s === 'undefined')
-    s = document.location.search;
-  var parts = s.substr(s.indexOf('?') + 1).split('&');
-  var result = {};
-  for (var i = 0; i < parts.length; i++) {
-    var tmp = parts[i].split('=', 2);
-    var key = jQuery.urldecode(tmp[0]);
-    var value = jQuery.urldecode(tmp[1]);
-    if (key in result)
-      result[key].push(value);
-    else
-      result[key] = [value];
-  }
-  return result;
-};
+      const closestNode = parent.closest("body, svg, foreignObject");
+      const isInSVG = closestNode && closestNode.matches("svg");
+      if (isInSVG) {
+        span = document.createElementNS("http://www.w3.org/2000/svg", "tspan");
+      } else {
+        span = document.createElement("span");
+        span.classList.add(className);
+      }
 
-/**
- * highlight a given string on a jquery object by wrapping it in
- * span elements with the given class name.
- */
-jQuery.fn.highlightText = function(text, className) {
-  function highlight(node, addItems) {
-    if (node.nodeType === 3) {
-      var val = node.nodeValue;
-      var pos = val.toLowerCase().indexOf(text);
-      if (pos >= 0 &&
-          !jQuery(node.parentNode).hasClass(className) &&
-          !jQuery(node.parentNode).hasClass("nohighlight")) {
-        var span;
-        var isInSVG = jQuery(node).closest("body, svg, foreignObject").is("svg");
-        if (isInSVG) {
-          span = document.createElementNS("http://www.w3.org/2000/svg", "tspan");
-        } else {
-          span = document.createElement("span");
-          span.className = className;
-        }
-        span.appendChild(document.createTextNode(val.substr(pos, text.length)));
-        node.parentNode.insertBefore(span, node.parentNode.insertBefore(
+      span.appendChild(document.createTextNode(val.substr(pos, text.length)));
+      parent.insertBefore(
+        span,
+        parent.insertBefore(
           document.createTextNode(val.substr(pos + text.length)),
-          node.nextSibling));
-        node.nodeValue = val.substr(0, pos);
-        if (isInSVG) {
-          var rect = document.createElementNS("http://www.w3.org/2000/svg", "rect");
-          var bbox = node.parentElement.getBBox();
-          rect.x.baseVal.value = bbox.x;
-          rect.y.baseVal.value = bbox.y;
-          rect.width.baseVal.value = bbox.width;
-          rect.height.baseVal.value = bbox.height;
-          rect.setAttribute('class', className);
-          addItems.push({
-              "parent": node.parentNode,
-              "target": rect});
-        }
+          node.nextSibling
+        )
+      );
+      node.nodeValue = val.substr(0, pos);
+
+      if (isInSVG) {
+        const rect = document.createElementNS(
+          "http://www.w3.org/2000/svg",
+          "rect"
+        );
+        const bbox = parent.getBBox();
+        rect.x.baseVal.value = bbox.x;
+        rect.y.baseVal.value = bbox.y;
+        rect.width.baseVal.value = bbox.width;
+        rect.height.baseVal.value = bbox.height;
+        rect.setAttribute("class", className);
+        addItems.push({ parent: parent, target: rect });
       }
     }
-    else if (!jQuery(node).is("button, select, textarea")) {
-      jQuery.each(node.childNodes, function() {
-        highlight(this, addItems);
-      });
-    }
+  } else if (node.matches && !node.matches("button, select, textarea")) {
+    node.childNodes.forEach((el) => _highlight(el, addItems, text, className));
   }
-  var addItems = [];
-  var result = this.each(function() {
-    highlight(this, addItems);
-  });
-  for (var i = 0; i < addItems.length; ++i) {
-    jQuery(addItems[i].parent).before(addItems[i].target);
-  }
-  return result;
 };
-
-/*
- * backward compatibility for jQuery.browser
- * This will be supported until firefox bug is fixed.
- */
-if (!jQuery.browser) {
-  jQuery.uaMatch = function(ua) {
-    ua = ua.toLowerCase();
-
-    var match = /(chrome)[ \/]([\w.]+)/.exec(ua) ||
-      /(webkit)[ \/]([\w.]+)/.exec(ua) ||
-      /(opera)(?:.*version|)[ \/]([\w.]+)/.exec(ua) ||
-      /(msie) ([\w.]+)/.exec(ua) ||
-      ua.indexOf("compatible") < 0 && /(mozilla)(?:.*? rv:([\w.]+)|)/.exec(ua) ||
-      [];
-
-    return {
-      browser: match[ 1 ] || "",
-      version: match[ 2 ] || "0"
-    };
-  };
-  jQuery.browser = {};
-  jQuery.browser[jQuery.uaMatch(navigator.userAgent).browser] = true;
-}
+const _highlightText = (thisNode, text, className) => {
+  let addItems = [];
+  _highlight(thisNode, addItems, text, className);
+  addItems.forEach((obj) =>
+    obj.parent.insertAdjacentElement("beforebegin", obj.target)
+  );
+};
 
 /**
  * Small JavaScript module for the documentation.
  */
-var Documentation = {
-
-  init : function() {
-    this.fixFirefoxAnchorBug();
-    this.highlightSearchWords();
-    this.initIndexTable();
-    if (DOCUMENTATION_OPTIONS.NAVIGATION_WITH_KEYS) {
-      this.initOnKeyListeners();
-    }
+const Documentation = {
+  init: () => {
+    Documentation.highlightSearchWords();
+    Documentation.initDomainIndexTable();
+    Documentation.initOnKeyListeners();
   },
 
   /**
    * i18n support
    */
-  TRANSLATIONS : {},
-  PLURAL_EXPR : function(n) { return n === 1 ? 0 : 1; },
-  LOCALE : 'unknown',
+  TRANSLATIONS: {},
+  PLURAL_EXPR: (n) => (n === 1 ? 0 : 1),
+  LOCALE: "unknown",
 
   // gettext and ngettext don't access this so that the functions
   // can safely bound to a different name (_ = Documentation.gettext)
-  gettext : function(string) {
-    var translated = Documentation.TRANSLATIONS[string];
-    if (typeof translated === 'undefined')
-      return string;
-    return (typeof translated === 'string') ? translated : translated[0];
-  },
-
-  ngettext : function(singular, plural, n) {
-    var translated = Documentation.TRANSLATIONS[singular];
-    if (typeof translated === 'undefined')
-      return (n == 1) ? singular : plural;
-    return translated[Documentation.PLURALEXPR(n)];
-  },
-
-  addTranslations : function(catalog) {
-    for (var key in catalog.messages)
-      this.TRANSLATIONS[key] = catalog.messages[key];
-    this.PLURAL_EXPR = new Function('n', 'return +(' + catalog.plural_expr + ')');
-    this.LOCALE = catalog.locale;
+  gettext: (string) => {
+    const translated = Documentation.TRANSLATIONS[string];
+    switch (typeof translated) {
+      case "undefined":
+        return string; // no translation
+      case "string":
+        return translated; // translation exists
+      default:
+        return translated[0]; // (singular, plural) translation tuple exists
+    }
   },
 
-  /**
-   * add context elements like header anchor links
-   */
-  addContextElements : function() {
-    $('div[id] > :header:first').each(function() {
-      $('<a class="headerlink">\u00B6</a>').
-      attr('href', '#' + this.id).
-      attr('title', _('Permalink to this headline')).
-      appendTo(this);
-    });
-    $('dt[id]').each(function() {
-      $('<a class="headerlink">\u00B6</a>').
-      attr('href', '#' + this.id).
-      attr('title', _('Permalink to this definition')).
-      appendTo(this);
-    });
+  ngettext: (singular, plural, n) => {
+    const translated = Documentation.TRANSLATIONS[singular];
+    if (typeof translated !== "undefined")
+      return translated[Documentation.PLURAL_EXPR(n)];
+    return n === 1 ? singular : plural;
   },
 
-  /**
-   * workaround a firefox stupidity
-   * see: https://bugzilla.mozilla.org/show_bug.cgi?id=645075
-   */
-  fixFirefoxAnchorBug : function() {
-    if (document.location.hash && $.browser.mozilla)
-      window.setTimeout(function() {
-        document.location.href += '';
-      }, 10);
+  addTranslations: (catalog) => {
+    Object.assign(Documentation.TRANSLATIONS, catalog.messages);
+    Documentation.PLURAL_EXPR = new Function(
+      "n",
+      `return (${catalog.plural_expr})`
+    );
+    Documentation.LOCALE = catalog.locale;
   },
 
   /**
    * highlight the search words provided in the url in the text
    */
-  highlightSearchWords : function() {
-    var params = $.getQueryParameters();
-    var terms = (params.highlight) ? params.highlight[0].split(/\s+/) : [];
-    if (terms.length) {
-      var body = $('div.body');
-      if (!body.length) {
-        body = $('body');
-      }
-      window.setTimeout(function() {
-        $.each(terms, function() {
-          body.highlightText(this.toLowerCase(), 'highlighted');
-        });
-      }, 10);
-      $('<p class="highlight-link"><a href="javascript:Documentation.' +
-        'hideSearchWords()">' + _('Hide Search Matches') + '</a></p>')
-          .appendTo($('#searchbox'));
-    }
-  },
+  highlightSearchWords: () => {
+    const highlight =
+      new URLSearchParams(window.location.search).get("highlight") || "";
+    const terms = highlight.toLowerCase().split(/\s+/).filter(x => x);
+    if (terms.length === 0) return; // nothing to do
 
-  /**
-   * init the domain index toggle buttons
-   */
-  initIndexTable : function() {
-    var togglers = $('img.toggler').click(function() {
-      var src = $(this).attr('src');
-      var idnum = $(this).attr('id').substr(7);
-      $('tr.cg-' + idnum).toggle();
-      if (src.substr(-9) === 'minus.png')
-        $(this).attr('src', src.substr(0, src.length-9) + 'plus.png');
-      else
-        $(this).attr('src', src.substr(0, src.length-8) + 'minus.png');
-    }).css('display', '');
-    if (DOCUMENTATION_OPTIONS.COLLAPSE_INDEX) {
-        togglers.click();
-    }
+    // There should never be more than one element matching "div.body"
+    const divBody = document.querySelectorAll("div.body");
+    const body = divBody.length ? divBody[0] : document.querySelector("body");
+    window.setTimeout(() => {
+      terms.forEach((term) => _highlightText(body, term, "highlighted"));
+    }, 10);
+
+    const searchBox = document.getElementById("searchbox");
+    if (searchBox === null) return;
+    searchBox.appendChild(
+      document
+        .createRange()
+        .createContextualFragment(
+          '<p class="highlight-link">' +
+            '<a href="javascript:Documentation.hideSearchWords()">' +
+            Documentation.gettext("Hide Search Matches") +
+            "</a></p>"
+        )
+    );
   },
 
   /**
    * helper function to hide the search marks again
    */
-  hideSearchWords : function() {
-    $('#searchbox .highlight-link').fadeOut(300);
-    $('span.highlighted').removeClass('highlighted');
+  hideSearchWords: () => {
+    document
+      .querySelectorAll("#searchbox .highlight-link")
+      .forEach((el) => el.remove());
+    document
+      .querySelectorAll("span.highlighted")
+      .forEach((el) => el.classList.remove("highlighted"));
+    const url = new URL(window.location);
+    url.searchParams.delete("highlight");
+    window.history.replaceState({}, "", url);
   },
 
   /**
-   * make the url absolute
+   * helper function to focus on search bar
    */
-  makeURL : function(relativeURL) {
-    return DOCUMENTATION_OPTIONS.URL_ROOT + '/' + relativeURL;
+  focusSearchBar: () => {
+    document.querySelectorAll("input[name=q]")[0]?.focus();
   },
 
   /**
-   * get the current relative url
+   * Initialise the domain index toggle buttons
    */
-  getCurrentURL : function() {
-    var path = document.location.pathname;
-    var parts = path.split(/\//);
-    $.each(DOCUMENTATION_OPTIONS.URL_ROOT.split(/\//), function() {
-      if (this === '..')
-        parts.pop();
-    });
-    var url = parts.join('/');
-    return path.substring(url.lastIndexOf('/') + 1, path.length - 1);
+  initDomainIndexTable: () => {
+    const toggler = (el) => {
+      const idNumber = el.id.substr(7);
+      const toggledRows = document.querySelectorAll(`tr.cg-${idNumber}`);
+      if (el.src.substr(-9) === "minus.png") {
+        el.src = `${el.src.substr(0, el.src.length - 9)}plus.png`;
+        toggledRows.forEach((el) => (el.style.display = "none"));
+      } else {
+        el.src = `${el.src.substr(0, el.src.length - 8)}minus.png`;
+        toggledRows.forEach((el) => (el.style.display = ""));
+      }
+    };
+
+    const togglerElements = document.querySelectorAll("img.toggler");
+    togglerElements.forEach((el) =>
+      el.addEventListener("click", (event) => toggler(event.currentTarget))
+    );
+    togglerElements.forEach((el) => (el.style.display = ""));
+    if (DOCUMENTATION_OPTIONS.COLLAPSE_INDEX) togglerElements.forEach(toggler);
   },
 
-  initOnKeyListeners: function() {
-    $(document).keydown(function(event) {
-      var activeElementType = document.activeElement.tagName;
-      // don't navigate when in search box, textarea, dropdown or button
-      if (activeElementType !== 'TEXTAREA' && activeElementType !== 'INPUT' && activeElementType !== 'SELECT'
-          && activeElementType !== 'BUTTON' && !event.altKey && !event.ctrlKey && !event.metaKey
-          && !event.shiftKey) {
-        switch (event.keyCode) {
-          case 37: // left
-            var prevHref = $('link[rel="prev"]').prop('href');
-            if (prevHref) {
-              window.location.href = prevHref;
-              return false;
+  initOnKeyListeners: () => {
+    // only install a listener if it is really needed
+    if (
+      !DOCUMENTATION_OPTIONS.NAVIGATION_WITH_KEYS &&
+      !DOCUMENTATION_OPTIONS.ENABLE_SEARCH_SHORTCUTS
+    )
+      return;
+
+    const blacklistedElements = new Set([
+      "TEXTAREA",
+      "INPUT",
+      "SELECT",
+      "BUTTON",
+    ]);
+    document.addEventListener("keydown", (event) => {
+      if (blacklistedElements.has(document.activeElement.tagName)) return; // bail for input elements
+      if (event.altKey || event.ctrlKey || event.metaKey) return; // bail with special keys
+
+      if (!event.shiftKey) {
+        switch (event.key) {
+          case "ArrowLeft":
+            if (!DOCUMENTATION_OPTIONS.NAVIGATION_WITH_KEYS) break;
+
+            const prevLink = document.querySelector('link[rel="prev"]');
+            if (prevLink && prevLink.href) {
+              window.location.href = prevLink.href;
+              event.preventDefault();
             }
             break;
-          case 39: // right
-            var nextHref = $('link[rel="next"]').prop('href');
-            if (nextHref) {
-              window.location.href = nextHref;
-              return false;
+          case "ArrowRight":
+            if (!DOCUMENTATION_OPTIONS.NAVIGATION_WITH_KEYS) break;
+
+            const nextLink = document.querySelector('link[rel="next"]');
+            if (nextLink && nextLink.href) {
+              window.location.href = nextLink.href;
+              event.preventDefault();
             }
             break;
+          case "Escape":
+            if (!DOCUMENTATION_OPTIONS.ENABLE_SEARCH_SHORTCUTS) break;
+            Documentation.hideSearchWords();
+            event.preventDefault();
         }
       }
+
+      // some keyboard layouts may need Shift to get /
+      switch (event.key) {
+        case "/":
+          if (!DOCUMENTATION_OPTIONS.ENABLE_SEARCH_SHORTCUTS) break;
+          Documentation.focusSearchBar();
+          event.preventDefault();
+      }
     });
-  }
+  },
 };
 
 // quick alias for translations
-_ = Documentation.gettext;
+const _ = Documentation.gettext;
 
-$(document).ready(function() {
-  Documentation.init();
-});
+_ready(Documentation.init);
diff --git a/docs/RefMan/_build/html/_static/documentation_options.js b/docs/RefMan/_build/html/_static/documentation_options.js
index b6ad65f53..1d9c2211c 100644
--- a/docs/RefMan/_build/html/_static/documentation_options.js
+++ b/docs/RefMan/_build/html/_static/documentation_options.js
@@ -1,12 +1,14 @@
 var DOCUMENTATION_OPTIONS = {
     URL_ROOT: document.getElementById("documentation_options").getAttribute('data-url_root'),
     VERSION: '2.11.0',
-    LANGUAGE: 'None',
+    LANGUAGE: 'en',
     COLLAPSE_INDEX: false,
     BUILDER: 'html',
     FILE_SUFFIX: '.html',
     LINK_SUFFIX: '.html',
     HAS_SOURCE: true,
     SOURCELINK_SUFFIX: '.txt',
-    NAVIGATION_WITH_KEYS: false
+    NAVIGATION_WITH_KEYS: false,
+    SHOW_SEARCH_SUMMARY: true,
+    ENABLE_SEARCH_SHORTCUTS: false,
 };
\ No newline at end of file
diff --git a/docs/RefMan/_build/html/_static/jquery-3.6.0.js b/docs/RefMan/_build/html/_static/jquery-3.6.0.js
new file mode 100644
index 000000000..fc6c299b7
--- /dev/null
+++ b/docs/RefMan/_build/html/_static/jquery-3.6.0.js
@@ -0,0 +1,10881 @@
+/*!
+ * jQuery JavaScript Library v3.6.0
+ * https://jquery.com/
+ *
+ * Includes Sizzle.js
+ * https://sizzlejs.com/
+ *
+ * Copyright OpenJS Foundation and other contributors
+ * Released under the MIT license
+ * https://jquery.org/license
+ *
+ * Date: 2021-03-02T17:08Z
+ */
+( function( global, factory ) {
+
+	"use strict";
+
+	if ( typeof module === "object" && typeof module.exports === "object" ) {
+
+		// For CommonJS and CommonJS-like environments where a proper `window`
+		// is present, execute the factory and get jQuery.
+		// For environments that do not have a `window` with a `document`
+		// (such as Node.js), expose a factory as module.exports.
+		// This accentuates the need for the creation of a real `window`.
+		// e.g. var jQuery = require("jquery")(window);
+		// See ticket #14549 for more info.
+		module.exports = global.document ?
+			factory( global, true ) :
+			function( w ) {
+				if ( !w.document ) {
+					throw new Error( "jQuery requires a window with a document" );
+				}
+				return factory( w );
+			};
+	} else {
+		factory( global );
+	}
+
+// Pass this if window is not defined yet
+} )( typeof window !== "undefined" ? window : this, function( window, noGlobal ) {
+
+// Edge <= 12 - 13+, Firefox <=18 - 45+, IE 10 - 11, Safari 5.1 - 9+, iOS 6 - 9.1
+// throw exceptions when non-strict code (e.g., ASP.NET 4.5) accesses strict mode
+// arguments.callee.caller (trac-13335). But as of jQuery 3.0 (2016), strict mode should be common
+// enough that all such attempts are guarded in a try block.
+"use strict";
+
+var arr = [];
+
+var getProto = Object.getPrototypeOf;
+
+var slice = arr.slice;
+
+var flat = arr.flat ? function( array ) {
+	return arr.flat.call( array );
+} : function( array ) {
+	return arr.concat.apply( [], array );
+};
+
+
+var push = arr.push;
+
+var indexOf = arr.indexOf;
+
+var class2type = {};
+
+var toString = class2type.toString;
+
+var hasOwn = class2type.hasOwnProperty;
+
+var fnToString = hasOwn.toString;
+
+var ObjectFunctionString = fnToString.call( Object );
+
+var support = {};
+
+var isFunction = function isFunction( obj ) {
+
+		// Support: Chrome <=57, Firefox <=52
+		// In some browsers, typeof returns "function" for HTML <object> elements
+		// (i.e., `typeof document.createElement( "object" ) === "function"`).
+		// We don't want to classify *any* DOM node as a function.
+		// Support: QtWeb <=3.8.5, WebKit <=534.34, wkhtmltopdf tool <=0.12.5
+		// Plus for old WebKit, typeof returns "function" for HTML collections
+		// (e.g., `typeof document.getElementsByTagName("div") === "function"`). (gh-4756)
+		return typeof obj === "function" && typeof obj.nodeType !== "number" &&
+			typeof obj.item !== "function";
+	};
+
+
+var isWindow = function isWindow( obj ) {
+		return obj != null && obj === obj.window;
+	};
+
+
+var document = window.document;
+
+
+
+	var preservedScriptAttributes = {
+		type: true,
+		src: true,
+		nonce: true,
+		noModule: true
+	};
+
+	function DOMEval( code, node, doc ) {
+		doc = doc || document;
+
+		var i, val,
+			script = doc.createElement( "script" );
+
+		script.text = code;
+		if ( node ) {
+			for ( i in preservedScriptAttributes ) {
+
+				// Support: Firefox 64+, Edge 18+
+				// Some browsers don't support the "nonce" property on scripts.
+				// On the other hand, just using `getAttribute` is not enough as
+				// the `nonce` attribute is reset to an empty string whenever it
+				// becomes browsing-context connected.
+				// See https://github.com/whatwg/html/issues/2369
+				// See https://html.spec.whatwg.org/#nonce-attributes
+				// The `node.getAttribute` check was added for the sake of
+				// `jQuery.globalEval` so that it can fake a nonce-containing node
+				// via an object.
+				val = node[ i ] || node.getAttribute && node.getAttribute( i );
+				if ( val ) {
+					script.setAttribute( i, val );
+				}
+			}
+		}
+		doc.head.appendChild( script ).parentNode.removeChild( script );
+	}
+
+
+function toType( obj ) {
+	if ( obj == null ) {
+		return obj + "";
+	}
+
+	// Support: Android <=2.3 only (functionish RegExp)
+	return typeof obj === "object" || typeof obj === "function" ?
+		class2type[ toString.call( obj ) ] || "object" :
+		typeof obj;
+}
+/* global Symbol */
+// Defining this global in .eslintrc.json would create a danger of using the global
+// unguarded in another place, it seems safer to define global only for this module
+
+
+
+var
+	version = "3.6.0",
+
+	// Define a local copy of jQuery
+	jQuery = function( selector, context ) {
+
+		// The jQuery object is actually just the init constructor 'enhanced'
+		// Need init if jQuery is called (just allow error to be thrown if not included)
+		return new jQuery.fn.init( selector, context );
+	};
+
+jQuery.fn = jQuery.prototype = {
+
+	// The current version of jQuery being used
+	jquery: version,
+
+	constructor: jQuery,
+
+	// The default length of a jQuery object is 0
+	length: 0,
+
+	toArray: function() {
+		return slice.call( this );
+	},
+
+	// Get the Nth element in the matched element set OR
+	// Get the whole matched element set as a clean array
+	get: function( num ) {
+
+		// Return all the elements in a clean array
+		if ( num == null ) {
+			return slice.call( this );
+		}
+
+		// Return just the one element from the set
+		return num < 0 ? this[ num + this.length ] : this[ num ];
+	},
+
+	// Take an array of elements and push it onto the stack
+	// (returning the new matched element set)
+	pushStack: function( elems ) {
+
+		// Build a new jQuery matched element set
+		var ret = jQuery.merge( this.constructor(), elems );
+
+		// Add the old object onto the stack (as a reference)
+		ret.prevObject = this;
+
+		// Return the newly-formed element set
+		return ret;
+	},
+
+	// Execute a callback for every element in the matched set.
+	each: function( callback ) {
+		return jQuery.each( this, callback );
+	},
+
+	map: function( callback ) {
+		return this.pushStack( jQuery.map( this, function( elem, i ) {
+			return callback.call( elem, i, elem );
+		} ) );
+	},
+
+	slice: function() {
+		return this.pushStack( slice.apply( this, arguments ) );
+	},
+
+	first: function() {
+		return this.eq( 0 );
+	},
+
+	last: function() {
+		return this.eq( -1 );
+	},
+
+	even: function() {
+		return this.pushStack( jQuery.grep( this, function( _elem, i ) {
+			return ( i + 1 ) % 2;
+		} ) );
+	},
+
+	odd: function() {
+		return this.pushStack( jQuery.grep( this, function( _elem, i ) {
+			return i % 2;
+		} ) );
+	},
+
+	eq: function( i ) {
+		var len = this.length,
+			j = +i + ( i < 0 ? len : 0 );
+		return this.pushStack( j >= 0 && j < len ? [ this[ j ] ] : [] );
+	},
+
+	end: function() {
+		return this.prevObject || this.constructor();
+	},
+
+	// For internal use only.
+	// Behaves like an Array's method, not like a jQuery method.
+	push: push,
+	sort: arr.sort,
+	splice: arr.splice
+};
+
+jQuery.extend = jQuery.fn.extend = function() {
+	var options, name, src, copy, copyIsArray, clone,
+		target = arguments[ 0 ] || {},
+		i = 1,
+		length = arguments.length,
+		deep = false;
+
+	// Handle a deep copy situation
+	if ( typeof target === "boolean" ) {
+		deep = target;
+
+		// Skip the boolean and the target
+		target = arguments[ i ] || {};
+		i++;
+	}
+
+	// Handle case when target is a string or something (possible in deep copy)
+	if ( typeof target !== "object" && !isFunction( target ) ) {
+		target = {};
+	}
+
+	// Extend jQuery itself if only one argument is passed
+	if ( i === length ) {
+		target = this;
+		i--;
+	}
+
+	for ( ; i < length; i++ ) {
+
+		// Only deal with non-null/undefined values
+		if ( ( options = arguments[ i ] ) != null ) {
+
+			// Extend the base object
+			for ( name in options ) {
+				copy = options[ name ];
+
+				// Prevent Object.prototype pollution
+				// Prevent never-ending loop
+				if ( name === "__proto__" || target === copy ) {
+					continue;
+				}
+
+				// Recurse if we're merging plain objects or arrays
+				if ( deep && copy && ( jQuery.isPlainObject( copy ) ||
+					( copyIsArray = Array.isArray( copy ) ) ) ) {
+					src = target[ name ];
+
+					// Ensure proper type for the source value
+					if ( copyIsArray && !Array.isArray( src ) ) {
+						clone = [];
+					} else if ( !copyIsArray && !jQuery.isPlainObject( src ) ) {
+						clone = {};
+					} else {
+						clone = src;
+					}
+					copyIsArray = false;
+
+					// Never move original objects, clone them
+					target[ name ] = jQuery.extend( deep, clone, copy );
+
+				// Don't bring in undefined values
+				} else if ( copy !== undefined ) {
+					target[ name ] = copy;
+				}
+			}
+		}
+	}
+
+	// Return the modified object
+	return target;
+};
+
+jQuery.extend( {
+
+	// Unique for each copy of jQuery on the page
+	expando: "jQuery" + ( version + Math.random() ).replace( /\D/g, "" ),
+
+	// Assume jQuery is ready without the ready module
+	isReady: true,
+
+	error: function( msg ) {
+		throw new Error( msg );
+	},
+
+	noop: function() {},
+
+	isPlainObject: function( obj ) {
+		var proto, Ctor;
+
+		// Detect obvious negatives
+		// Use toString instead of jQuery.type to catch host objects
+		if ( !obj || toString.call( obj ) !== "[object Object]" ) {
+			return false;
+		}
+
+		proto = getProto( obj );
+
+		// Objects with no prototype (e.g., `Object.create( null )`) are plain
+		if ( !proto ) {
+			return true;
+		}
+
+		// Objects with prototype are plain iff they were constructed by a global Object function
+		Ctor = hasOwn.call( proto, "constructor" ) && proto.constructor;
+		return typeof Ctor === "function" && fnToString.call( Ctor ) === ObjectFunctionString;
+	},
+
+	isEmptyObject: function( obj ) {
+		var name;
+
+		for ( name in obj ) {
+			return false;
+		}
+		return true;
+	},
+
+	// Evaluates a script in a provided context; falls back to the global one
+	// if not specified.
+	globalEval: function( code, options, doc ) {
+		DOMEval( code, { nonce: options && options.nonce }, doc );
+	},
+
+	each: function( obj, callback ) {
+		var length, i = 0;
+
+		if ( isArrayLike( obj ) ) {
+			length = obj.length;
+			for ( ; i < length; i++ ) {
+				if ( callback.call( obj[ i ], i, obj[ i ] ) === false ) {
+					break;
+				}
+			}
+		} else {
+			for ( i in obj ) {
+				if ( callback.call( obj[ i ], i, obj[ i ] ) === false ) {
+					break;
+				}
+			}
+		}
+
+		return obj;
+	},
+
+	// results is for internal usage only
+	makeArray: function( arr, results ) {
+		var ret = results || [];
+
+		if ( arr != null ) {
+			if ( isArrayLike( Object( arr ) ) ) {
+				jQuery.merge( ret,
+					typeof arr === "string" ?
+						[ arr ] : arr
+				);
+			} else {
+				push.call( ret, arr );
+			}
+		}
+
+		return ret;
+	},
+
+	inArray: function( elem, arr, i ) {
+		return arr == null ? -1 : indexOf.call( arr, elem, i );
+	},
+
+	// Support: Android <=4.0 only, PhantomJS 1 only
+	// push.apply(_, arraylike) throws on ancient WebKit
+	merge: function( first, second ) {
+		var len = +second.length,
+			j = 0,
+			i = first.length;
+
+		for ( ; j < len; j++ ) {
+			first[ i++ ] = second[ j ];
+		}
+
+		first.length = i;
+
+		return first;
+	},
+
+	grep: function( elems, callback, invert ) {
+		var callbackInverse,
+			matches = [],
+			i = 0,
+			length = elems.length,
+			callbackExpect = !invert;
+
+		// Go through the array, only saving the items
+		// that pass the validator function
+		for ( ; i < length; i++ ) {
+			callbackInverse = !callback( elems[ i ], i );
+			if ( callbackInverse !== callbackExpect ) {
+				matches.push( elems[ i ] );
+			}
+		}
+
+		return matches;
+	},
+
+	// arg is for internal usage only
+	map: function( elems, callback, arg ) {
+		var length, value,
+			i = 0,
+			ret = [];
+
+		// Go through the array, translating each of the items to their new values
+		if ( isArrayLike( elems ) ) {
+			length = elems.length;
+			for ( ; i < length; i++ ) {
+				value = callback( elems[ i ], i, arg );
+
+				if ( value != null ) {
+					ret.push( value );
+				}
+			}
+
+		// Go through every key on the object,
+		} else {
+			for ( i in elems ) {
+				value = callback( elems[ i ], i, arg );
+
+				if ( value != null ) {
+					ret.push( value );
+				}
+			}
+		}
+
+		// Flatten any nested arrays
+		return flat( ret );
+	},
+
+	// A global GUID counter for objects
+	guid: 1,
+
+	// jQuery.support is not used in Core but other projects attach their
+	// properties to it so it needs to exist.
+	support: support
+} );
+
+if ( typeof Symbol === "function" ) {
+	jQuery.fn[ Symbol.iterator ] = arr[ Symbol.iterator ];
+}
+
+// Populate the class2type map
+jQuery.each( "Boolean Number String Function Array Date RegExp Object Error Symbol".split( " " ),
+	function( _i, name ) {
+		class2type[ "[object " + name + "]" ] = name.toLowerCase();
+	} );
+
+function isArrayLike( obj ) {
+
+	// Support: real iOS 8.2 only (not reproducible in simulator)
+	// `in` check used to prevent JIT error (gh-2145)
+	// hasOwn isn't used here due to false negatives
+	// regarding Nodelist length in IE
+	var length = !!obj && "length" in obj && obj.length,
+		type = toType( obj );
+
+	if ( isFunction( obj ) || isWindow( obj ) ) {
+		return false;
+	}
+
+	return type === "array" || length === 0 ||
+		typeof length === "number" && length > 0 && ( length - 1 ) in obj;
+}
+var Sizzle =
+/*!
+ * Sizzle CSS Selector Engine v2.3.6
+ * https://sizzlejs.com/
+ *
+ * Copyright JS Foundation and other contributors
+ * Released under the MIT license
+ * https://js.foundation/
+ *
+ * Date: 2021-02-16
+ */
+( function( window ) {
+var i,
+	support,
+	Expr,
+	getText,
+	isXML,
+	tokenize,
+	compile,
+	select,
+	outermostContext,
+	sortInput,
+	hasDuplicate,
+
+	// Local document vars
+	setDocument,
+	document,
+	docElem,
+	documentIsHTML,
+	rbuggyQSA,
+	rbuggyMatches,
+	matches,
+	contains,
+
+	// Instance-specific data
+	expando = "sizzle" + 1 * new Date(),
+	preferredDoc = window.document,
+	dirruns = 0,
+	done = 0,
+	classCache = createCache(),
+	tokenCache = createCache(),
+	compilerCache = createCache(),
+	nonnativeSelectorCache = createCache(),
+	sortOrder = function( a, b ) {
+		if ( a === b ) {
+			hasDuplicate = true;
+		}
+		return 0;
+	},
+
+	// Instance methods
+	hasOwn = ( {} ).hasOwnProperty,
+	arr = [],
+	pop = arr.pop,
+	pushNative = arr.push,
+	push = arr.push,
+	slice = arr.slice,
+
+	// Use a stripped-down indexOf as it's faster than native
+	// https://jsperf.com/thor-indexof-vs-for/5
+	indexOf = function( list, elem ) {
+		var i = 0,
+			len = list.length;
+		for ( ; i < len; i++ ) {
+			if ( list[ i ] === elem ) {
+				return i;
+			}
+		}
+		return -1;
+	},
+
+	booleans = "checked|selected|async|autofocus|autoplay|controls|defer|disabled|hidden|" +
+		"ismap|loop|multiple|open|readonly|required|scoped",
+
+	// Regular expressions
+
+	// http://www.w3.org/TR/css3-selectors/#whitespace
+	whitespace = "[\\x20\\t\\r\\n\\f]",
+
+	// https://www.w3.org/TR/css-syntax-3/#ident-token-diagram
+	identifier = "(?:\\\\[\\da-fA-F]{1,6}" + whitespace +
+		"?|\\\\[^\\r\\n\\f]|[\\w-]|[^\0-\\x7f])+",
+
+	// Attribute selectors: http://www.w3.org/TR/selectors/#attribute-selectors
+	attributes = "\\[" + whitespace + "*(" + identifier + ")(?:" + whitespace +
+
+		// Operator (capture 2)
+		"*([*^$|!~]?=)" + whitespace +
+
+		// "Attribute values must be CSS identifiers [capture 5]
+		// or strings [capture 3 or capture 4]"
+		"*(?:'((?:\\\\.|[^\\\\'])*)'|\"((?:\\\\.|[^\\\\\"])*)\"|(" + identifier + "))|)" +
+		whitespace + "*\\]",
+
+	pseudos = ":(" + identifier + ")(?:\\((" +
+
+		// To reduce the number of selectors needing tokenize in the preFilter, prefer arguments:
+		// 1. quoted (capture 3; capture 4 or capture 5)
+		"('((?:\\\\.|[^\\\\'])*)'|\"((?:\\\\.|[^\\\\\"])*)\")|" +
+
+		// 2. simple (capture 6)
+		"((?:\\\\.|[^\\\\()[\\]]|" + attributes + ")*)|" +
+
+		// 3. anything else (capture 2)
+		".*" +
+		")\\)|)",
+
+	// Leading and non-escaped trailing whitespace, capturing some non-whitespace characters preceding the latter
+	rwhitespace = new RegExp( whitespace + "+", "g" ),
+	rtrim = new RegExp( "^" + whitespace + "+|((?:^|[^\\\\])(?:\\\\.)*)" +
+		whitespace + "+$", "g" ),
+
+	rcomma = new RegExp( "^" + whitespace + "*," + whitespace + "*" ),
+	rcombinators = new RegExp( "^" + whitespace + "*([>+~]|" + whitespace + ")" + whitespace +
+		"*" ),
+	rdescend = new RegExp( whitespace + "|>" ),
+
+	rpseudo = new RegExp( pseudos ),
+	ridentifier = new RegExp( "^" + identifier + "$" ),
+
+	matchExpr = {
+		"ID": new RegExp( "^#(" + identifier + ")" ),
+		"CLASS": new RegExp( "^\\.(" + identifier + ")" ),
+		"TAG": new RegExp( "^(" + identifier + "|[*])" ),
+		"ATTR": new RegExp( "^" + attributes ),
+		"PSEUDO": new RegExp( "^" + pseudos ),
+		"CHILD": new RegExp( "^:(only|first|last|nth|nth-last)-(child|of-type)(?:\\(" +
+			whitespace + "*(even|odd|(([+-]|)(\\d*)n|)" + whitespace + "*(?:([+-]|)" +
+			whitespace + "*(\\d+)|))" + whitespace + "*\\)|)", "i" ),
+		"bool": new RegExp( "^(?:" + booleans + ")$", "i" ),
+
+		// For use in libraries implementing .is()
+		// We use this for POS matching in `select`
+		"needsContext": new RegExp( "^" + whitespace +
+			"*[>+~]|:(even|odd|eq|gt|lt|nth|first|last)(?:\\(" + whitespace +
+			"*((?:-\\d)?\\d*)" + whitespace + "*\\)|)(?=[^-]|$)", "i" )
+	},
+
+	rhtml = /HTML$/i,
+	rinputs = /^(?:input|select|textarea|button)$/i,
+	rheader = /^h\d$/i,
+
+	rnative = /^[^{]+\{\s*\[native \w/,
+
+	// Easily-parseable/retrievable ID or TAG or CLASS selectors
+	rquickExpr = /^(?:#([\w-]+)|(\w+)|\.([\w-]+))$/,
+
+	rsibling = /[+~]/,
+
+	// CSS escapes
+	// http://www.w3.org/TR/CSS21/syndata.html#escaped-characters
+	runescape = new RegExp( "\\\\[\\da-fA-F]{1,6}" + whitespace + "?|\\\\([^\\r\\n\\f])", "g" ),
+	funescape = function( escape, nonHex ) {
+		var high = "0x" + escape.slice( 1 ) - 0x10000;
+
+		return nonHex ?
+
+			// Strip the backslash prefix from a non-hex escape sequence
+			nonHex :
+
+			// Replace a hexadecimal escape sequence with the encoded Unicode code point
+			// Support: IE <=11+
+			// For values outside the Basic Multilingual Plane (BMP), manually construct a
+			// surrogate pair
+			high < 0 ?
+				String.fromCharCode( high + 0x10000 ) :
+				String.fromCharCode( high >> 10 | 0xD800, high & 0x3FF | 0xDC00 );
+	},
+
+	// CSS string/identifier serialization
+	// https://drafts.csswg.org/cssom/#common-serializing-idioms
+	rcssescape = /([\0-\x1f\x7f]|^-?\d)|^-$|[^\0-\x1f\x7f-\uFFFF\w-]/g,
+	fcssescape = function( ch, asCodePoint ) {
+		if ( asCodePoint ) {
+
+			// U+0000 NULL becomes U+FFFD REPLACEMENT CHARACTER
+			if ( ch === "\0" ) {
+				return "\uFFFD";
+			}
+
+			// Control characters and (dependent upon position) numbers get escaped as code points
+			return ch.slice( 0, -1 ) + "\\" +
+				ch.charCodeAt( ch.length - 1 ).toString( 16 ) + " ";
+		}
+
+		// Other potentially-special ASCII characters get backslash-escaped
+		return "\\" + ch;
+	},
+
+	// Used for iframes
+	// See setDocument()
+	// Removing the function wrapper causes a "Permission Denied"
+	// error in IE
+	unloadHandler = function() {
+		setDocument();
+	},
+
+	inDisabledFieldset = addCombinator(
+		function( elem ) {
+			return elem.disabled === true && elem.nodeName.toLowerCase() === "fieldset";
+		},
+		{ dir: "parentNode", next: "legend" }
+	);
+
+// Optimize for push.apply( _, NodeList )
+try {
+	push.apply(
+		( arr = slice.call( preferredDoc.childNodes ) ),
+		preferredDoc.childNodes
+	);
+
+	// Support: Android<4.0
+	// Detect silently failing push.apply
+	// eslint-disable-next-line no-unused-expressions
+	arr[ preferredDoc.childNodes.length ].nodeType;
+} catch ( e ) {
+	push = { apply: arr.length ?
+
+		// Leverage slice if possible
+		function( target, els ) {
+			pushNative.apply( target, slice.call( els ) );
+		} :
+
+		// Support: IE<9
+		// Otherwise append directly
+		function( target, els ) {
+			var j = target.length,
+				i = 0;
+
+			// Can't trust NodeList.length
+			while ( ( target[ j++ ] = els[ i++ ] ) ) {}
+			target.length = j - 1;
+		}
+	};
+}
+
+function Sizzle( selector, context, results, seed ) {
+	var m, i, elem, nid, match, groups, newSelector,
+		newContext = context && context.ownerDocument,
+
+		// nodeType defaults to 9, since context defaults to document
+		nodeType = context ? context.nodeType : 9;
+
+	results = results || [];
+
+	// Return early from calls with invalid selector or context
+	if ( typeof selector !== "string" || !selector ||
+		nodeType !== 1 && nodeType !== 9 && nodeType !== 11 ) {
+
+		return results;
+	}
+
+	// Try to shortcut find operations (as opposed to filters) in HTML documents
+	if ( !seed ) {
+		setDocument( context );
+		context = context || document;
+
+		if ( documentIsHTML ) {
+
+			// If the selector is sufficiently simple, try using a "get*By*" DOM method
+			// (excepting DocumentFragment context, where the methods don't exist)
+			if ( nodeType !== 11 && ( match = rquickExpr.exec( selector ) ) ) {
+
+				// ID selector
+				if ( ( m = match[ 1 ] ) ) {
+
+					// Document context
+					if ( nodeType === 9 ) {
+						if ( ( elem = context.getElementById( m ) ) ) {
+
+							// Support: IE, Opera, Webkit
+							// TODO: identify versions
+							// getElementById can match elements by name instead of ID
+							if ( elem.id === m ) {
+								results.push( elem );
+								return results;
+							}
+						} else {
+							return results;
+						}
+
+					// Element context
+					} else {
+
+						// Support: IE, Opera, Webkit
+						// TODO: identify versions
+						// getElementById can match elements by name instead of ID
+						if ( newContext && ( elem = newContext.getElementById( m ) ) &&
+							contains( context, elem ) &&
+							elem.id === m ) {
+
+							results.push( elem );
+							return results;
+						}
+					}
+
+				// Type selector
+				} else if ( match[ 2 ] ) {
+					push.apply( results, context.getElementsByTagName( selector ) );
+					return results;
+
+				// Class selector
+				} else if ( ( m = match[ 3 ] ) && support.getElementsByClassName &&
+					context.getElementsByClassName ) {
+
+					push.apply( results, context.getElementsByClassName( m ) );
+					return results;
+				}
+			}
+
+			// Take advantage of querySelectorAll
+			if ( support.qsa &&
+				!nonnativeSelectorCache[ selector + " " ] &&
+				( !rbuggyQSA || !rbuggyQSA.test( selector ) ) &&
+
+				// Support: IE 8 only
+				// Exclude object elements
+				( nodeType !== 1 || context.nodeName.toLowerCase() !== "object" ) ) {
+
+				newSelector = selector;
+				newContext = context;
+
+				// qSA considers elements outside a scoping root when evaluating child or
+				// descendant combinators, which is not what we want.
+				// In such cases, we work around the behavior by prefixing every selector in the
+				// list with an ID selector referencing the scope context.
+				// The technique has to be used as well when a leading combinator is used
+				// as such selectors are not recognized by querySelectorAll.
+				// Thanks to Andrew Dupont for this technique.
+				if ( nodeType === 1 &&
+					( rdescend.test( selector ) || rcombinators.test( selector ) ) ) {
+
+					// Expand context for sibling selectors
+					newContext = rsibling.test( selector ) && testContext( context.parentNode ) ||
+						context;
+
+					// We can use :scope instead of the ID hack if the browser
+					// supports it & if we're not changing the context.
+					if ( newContext !== context || !support.scope ) {
+
+						// Capture the context ID, setting it first if necessary
+						if ( ( nid = context.getAttribute( "id" ) ) ) {
+							nid = nid.replace( rcssescape, fcssescape );
+						} else {
+							context.setAttribute( "id", ( nid = expando ) );
+						}
+					}
+
+					// Prefix every selector in the list
+					groups = tokenize( selector );
+					i = groups.length;
+					while ( i-- ) {
+						groups[ i ] = ( nid ? "#" + nid : ":scope" ) + " " +
+							toSelector( groups[ i ] );
+					}
+					newSelector = groups.join( "," );
+				}
+
+				try {
+					push.apply( results,
+						newContext.querySelectorAll( newSelector )
+					);
+					return results;
+				} catch ( qsaError ) {
+					nonnativeSelectorCache( selector, true );
+				} finally {
+					if ( nid === expando ) {
+						context.removeAttribute( "id" );
+					}
+				}
+			}
+		}
+	}
+
+	// All others
+	return select( selector.replace( rtrim, "$1" ), context, results, seed );
+}
+
+/**
+ * Create key-value caches of limited size
+ * @returns {function(string, object)} Returns the Object data after storing it on itself with
+ *	property name the (space-suffixed) string and (if the cache is larger than Expr.cacheLength)
+ *	deleting the oldest entry
+ */
+function createCache() {
+	var keys = [];
+
+	function cache( key, value ) {
+
+		// Use (key + " ") to avoid collision with native prototype properties (see Issue #157)
+		if ( keys.push( key + " " ) > Expr.cacheLength ) {
+
+			// Only keep the most recent entries
+			delete cache[ keys.shift() ];
+		}
+		return ( cache[ key + " " ] = value );
+	}
+	return cache;
+}
+
+/**
+ * Mark a function for special use by Sizzle
+ * @param {Function} fn The function to mark
+ */
+function markFunction( fn ) {
+	fn[ expando ] = true;
+	return fn;
+}
+
+/**
+ * Support testing using an element
+ * @param {Function} fn Passed the created element and returns a boolean result
+ */
+function assert( fn ) {
+	var el = document.createElement( "fieldset" );
+
+	try {
+		return !!fn( el );
+	} catch ( e ) {
+		return false;
+	} finally {
+
+		// Remove from its parent by default
+		if ( el.parentNode ) {
+			el.parentNode.removeChild( el );
+		}
+
+		// release memory in IE
+		el = null;
+	}
+}
+
+/**
+ * Adds the same handler for all of the specified attrs
+ * @param {String} attrs Pipe-separated list of attributes
+ * @param {Function} handler The method that will be applied
+ */
+function addHandle( attrs, handler ) {
+	var arr = attrs.split( "|" ),
+		i = arr.length;
+
+	while ( i-- ) {
+		Expr.attrHandle[ arr[ i ] ] = handler;
+	}
+}
+
+/**
+ * Checks document order of two siblings
+ * @param {Element} a
+ * @param {Element} b
+ * @returns {Number} Returns less than 0 if a precedes b, greater than 0 if a follows b
+ */
+function siblingCheck( a, b ) {
+	var cur = b && a,
+		diff = cur && a.nodeType === 1 && b.nodeType === 1 &&
+			a.sourceIndex - b.sourceIndex;
+
+	// Use IE sourceIndex if available on both nodes
+	if ( diff ) {
+		return diff;
+	}
+
+	// Check if b follows a
+	if ( cur ) {
+		while ( ( cur = cur.nextSibling ) ) {
+			if ( cur === b ) {
+				return -1;
+			}
+		}
+	}
+
+	return a ? 1 : -1;
+}
+
+/**
+ * Returns a function to use in pseudos for input types
+ * @param {String} type
+ */
+function createInputPseudo( type ) {
+	return function( elem ) {
+		var name = elem.nodeName.toLowerCase();
+		return name === "input" && elem.type === type;
+	};
+}
+
+/**
+ * Returns a function to use in pseudos for buttons
+ * @param {String} type
+ */
+function createButtonPseudo( type ) {
+	return function( elem ) {
+		var name = elem.nodeName.toLowerCase();
+		return ( name === "input" || name === "button" ) && elem.type === type;
+	};
+}
+
+/**
+ * Returns a function to use in pseudos for :enabled/:disabled
+ * @param {Boolean} disabled true for :disabled; false for :enabled
+ */
+function createDisabledPseudo( disabled ) {
+
+	// Known :disabled false positives: fieldset[disabled] > legend:nth-of-type(n+2) :can-disable
+	return function( elem ) {
+
+		// Only certain elements can match :enabled or :disabled
+		// https://html.spec.whatwg.org/multipage/scripting.html#selector-enabled
+		// https://html.spec.whatwg.org/multipage/scripting.html#selector-disabled
+		if ( "form" in elem ) {
+
+			// Check for inherited disabledness on relevant non-disabled elements:
+			// * listed form-associated elements in a disabled fieldset
+			//   https://html.spec.whatwg.org/multipage/forms.html#category-listed
+			//   https://html.spec.whatwg.org/multipage/forms.html#concept-fe-disabled
+			// * option elements in a disabled optgroup
+			//   https://html.spec.whatwg.org/multipage/forms.html#concept-option-disabled
+			// All such elements have a "form" property.
+			if ( elem.parentNode && elem.disabled === false ) {
+
+				// Option elements defer to a parent optgroup if present
+				if ( "label" in elem ) {
+					if ( "label" in elem.parentNode ) {
+						return elem.parentNode.disabled === disabled;
+					} else {
+						return elem.disabled === disabled;
+					}
+				}
+
+				// Support: IE 6 - 11
+				// Use the isDisabled shortcut property to check for disabled fieldset ancestors
+				return elem.isDisabled === disabled ||
+
+					// Where there is no isDisabled, check manually
+					/* jshint -W018 */
+					elem.isDisabled !== !disabled &&
+					inDisabledFieldset( elem ) === disabled;
+			}
+
+			return elem.disabled === disabled;
+
+		// Try to winnow out elements that can't be disabled before trusting the disabled property.
+		// Some victims get caught in our net (label, legend, menu, track), but it shouldn't
+		// even exist on them, let alone have a boolean value.
+		} else if ( "label" in elem ) {
+			return elem.disabled === disabled;
+		}
+
+		// Remaining elements are neither :enabled nor :disabled
+		return false;
+	};
+}
+
+/**
+ * Returns a function to use in pseudos for positionals
+ * @param {Function} fn
+ */
+function createPositionalPseudo( fn ) {
+	return markFunction( function( argument ) {
+		argument = +argument;
+		return markFunction( function( seed, matches ) {
+			var j,
+				matchIndexes = fn( [], seed.length, argument ),
+				i = matchIndexes.length;
+
+			// Match elements found at the specified indexes
+			while ( i-- ) {
+				if ( seed[ ( j = matchIndexes[ i ] ) ] ) {
+					seed[ j ] = !( matches[ j ] = seed[ j ] );
+				}
+			}
+		} );
+	} );
+}
+
+/**
+ * Checks a node for validity as a Sizzle context
+ * @param {Element|Object=} context
+ * @returns {Element|Object|Boolean} The input node if acceptable, otherwise a falsy value
+ */
+function testContext( context ) {
+	return context && typeof context.getElementsByTagName !== "undefined" && context;
+}
+
+// Expose support vars for convenience
+support = Sizzle.support = {};
+
+/**
+ * Detects XML nodes
+ * @param {Element|Object} elem An element or a document
+ * @returns {Boolean} True iff elem is a non-HTML XML node
+ */
+isXML = Sizzle.isXML = function( elem ) {
+	var namespace = elem && elem.namespaceURI,
+		docElem = elem && ( elem.ownerDocument || elem ).documentElement;
+
+	// Support: IE <=8
+	// Assume HTML when documentElement doesn't yet exist, such as inside loading iframes
+	// https://bugs.jquery.com/ticket/4833
+	return !rhtml.test( namespace || docElem && docElem.nodeName || "HTML" );
+};
+
+/**
+ * Sets document-related variables once based on the current document
+ * @param {Element|Object} [doc] An element or document object to use to set the document
+ * @returns {Object} Returns the current document
+ */
+setDocument = Sizzle.setDocument = function( node ) {
+	var hasCompare, subWindow,
+		doc = node ? node.ownerDocument || node : preferredDoc;
+
+	// Return early if doc is invalid or already selected
+	// Support: IE 11+, Edge 17 - 18+
+	// IE/Edge sometimes throw a "Permission denied" error when strict-comparing
+	// two documents; shallow comparisons work.
+	// eslint-disable-next-line eqeqeq
+	if ( doc == document || doc.nodeType !== 9 || !doc.documentElement ) {
+		return document;
+	}
+
+	// Update global variables
+	document = doc;
+	docElem = document.documentElement;
+	documentIsHTML = !isXML( document );
+
+	// Support: IE 9 - 11+, Edge 12 - 18+
+	// Accessing iframe documents after unload throws "permission denied" errors (jQuery #13936)
+	// Support: IE 11+, Edge 17 - 18+
+	// IE/Edge sometimes throw a "Permission denied" error when strict-comparing
+	// two documents; shallow comparisons work.
+	// eslint-disable-next-line eqeqeq
+	if ( preferredDoc != document &&
+		( subWindow = document.defaultView ) && subWindow.top !== subWindow ) {
+
+		// Support: IE 11, Edge
+		if ( subWindow.addEventListener ) {
+			subWindow.addEventListener( "unload", unloadHandler, false );
+
+		// Support: IE 9 - 10 only
+		} else if ( subWindow.attachEvent ) {
+			subWindow.attachEvent( "onunload", unloadHandler );
+		}
+	}
+
+	// Support: IE 8 - 11+, Edge 12 - 18+, Chrome <=16 - 25 only, Firefox <=3.6 - 31 only,
+	// Safari 4 - 5 only, Opera <=11.6 - 12.x only
+	// IE/Edge & older browsers don't support the :scope pseudo-class.
+	// Support: Safari 6.0 only
+	// Safari 6.0 supports :scope but it's an alias of :root there.
+	support.scope = assert( function( el ) {
+		docElem.appendChild( el ).appendChild( document.createElement( "div" ) );
+		return typeof el.querySelectorAll !== "undefined" &&
+			!el.querySelectorAll( ":scope fieldset div" ).length;
+	} );
+
+	/* Attributes
+	---------------------------------------------------------------------- */
+
+	// Support: IE<8
+	// Verify that getAttribute really returns attributes and not properties
+	// (excepting IE8 booleans)
+	support.attributes = assert( function( el ) {
+		el.className = "i";
+		return !el.getAttribute( "className" );
+	} );
+
+	/* getElement(s)By*
+	---------------------------------------------------------------------- */
+
+	// Check if getElementsByTagName("*") returns only elements
+	support.getElementsByTagName = assert( function( el ) {
+		el.appendChild( document.createComment( "" ) );
+		return !el.getElementsByTagName( "*" ).length;
+	} );
+
+	// Support: IE<9
+	support.getElementsByClassName = rnative.test( document.getElementsByClassName );
+
+	// Support: IE<10
+	// Check if getElementById returns elements by name
+	// The broken getElementById methods don't pick up programmatically-set names,
+	// so use a roundabout getElementsByName test
+	support.getById = assert( function( el ) {
+		docElem.appendChild( el ).id = expando;
+		return !document.getElementsByName || !document.getElementsByName( expando ).length;
+	} );
+
+	// ID filter and find
+	if ( support.getById ) {
+		Expr.filter[ "ID" ] = function( id ) {
+			var attrId = id.replace( runescape, funescape );
+			return function( elem ) {
+				return elem.getAttribute( "id" ) === attrId;
+			};
+		};
+		Expr.find[ "ID" ] = function( id, context ) {
+			if ( typeof context.getElementById !== "undefined" && documentIsHTML ) {
+				var elem = context.getElementById( id );
+				return elem ? [ elem ] : [];
+			}
+		};
+	} else {
+		Expr.filter[ "ID" ] =  function( id ) {
+			var attrId = id.replace( runescape, funescape );
+			return function( elem ) {
+				var node = typeof elem.getAttributeNode !== "undefined" &&
+					elem.getAttributeNode( "id" );
+				return node && node.value === attrId;
+			};
+		};
+
+		// Support: IE 6 - 7 only
+		// getElementById is not reliable as a find shortcut
+		Expr.find[ "ID" ] = function( id, context ) {
+			if ( typeof context.getElementById !== "undefined" && documentIsHTML ) {
+				var node, i, elems,
+					elem = context.getElementById( id );
+
+				if ( elem ) {
+
+					// Verify the id attribute
+					node = elem.getAttributeNode( "id" );
+					if ( node && node.value === id ) {
+						return [ elem ];
+					}
+
+					// Fall back on getElementsByName
+					elems = context.getElementsByName( id );
+					i = 0;
+					while ( ( elem = elems[ i++ ] ) ) {
+						node = elem.getAttributeNode( "id" );
+						if ( node && node.value === id ) {
+							return [ elem ];
+						}
+					}
+				}
+
+				return [];
+			}
+		};
+	}
+
+	// Tag
+	Expr.find[ "TAG" ] = support.getElementsByTagName ?
+		function( tag, context ) {
+			if ( typeof context.getElementsByTagName !== "undefined" ) {
+				return context.getElementsByTagName( tag );
+
+			// DocumentFragment nodes don't have gEBTN
+			} else if ( support.qsa ) {
+				return context.querySelectorAll( tag );
+			}
+		} :
+
+		function( tag, context ) {
+			var elem,
+				tmp = [],
+				i = 0,
+
+				// By happy coincidence, a (broken) gEBTN appears on DocumentFragment nodes too
+				results = context.getElementsByTagName( tag );
+
+			// Filter out possible comments
+			if ( tag === "*" ) {
+				while ( ( elem = results[ i++ ] ) ) {
+					if ( elem.nodeType === 1 ) {
+						tmp.push( elem );
+					}
+				}
+
+				return tmp;
+			}
+			return results;
+		};
+
+	// Class
+	Expr.find[ "CLASS" ] = support.getElementsByClassName && function( className, context ) {
+		if ( typeof context.getElementsByClassName !== "undefined" && documentIsHTML ) {
+			return context.getElementsByClassName( className );
+		}
+	};
+
+	/* QSA/matchesSelector
+	---------------------------------------------------------------------- */
+
+	// QSA and matchesSelector support
+
+	// matchesSelector(:active) reports false when true (IE9/Opera 11.5)
+	rbuggyMatches = [];
+
+	// qSa(:focus) reports false when true (Chrome 21)
+	// We allow this because of a bug in IE8/9 that throws an error
+	// whenever `document.activeElement` is accessed on an iframe
+	// So, we allow :focus to pass through QSA all the time to avoid the IE error
+	// See https://bugs.jquery.com/ticket/13378
+	rbuggyQSA = [];
+
+	if ( ( support.qsa = rnative.test( document.querySelectorAll ) ) ) {
+
+		// Build QSA regex
+		// Regex strategy adopted from Diego Perini
+		assert( function( el ) {
+
+			var input;
+
+			// Select is set to empty string on purpose
+			// This is to test IE's treatment of not explicitly
+			// setting a boolean content attribute,
+			// since its presence should be enough
+			// https://bugs.jquery.com/ticket/12359
+			docElem.appendChild( el ).innerHTML = "<a id='" + expando + "'></a>" +
+				"<select id='" + expando + "-\r\\' msallowcapture=''>" +
+				"<option selected=''></option></select>";
+
+			// Support: IE8, Opera 11-12.16
+			// Nothing should be selected when empty strings follow ^= or $= or *=
+			// The test attribute must be unknown in Opera but "safe" for WinRT
+			// https://msdn.microsoft.com/en-us/library/ie/hh465388.aspx#attribute_section
+			if ( el.querySelectorAll( "[msallowcapture^='']" ).length ) {
+				rbuggyQSA.push( "[*^$]=" + whitespace + "*(?:''|\"\")" );
+			}
+
+			// Support: IE8
+			// Boolean attributes and "value" are not treated correctly
+			if ( !el.querySelectorAll( "[selected]" ).length ) {
+				rbuggyQSA.push( "\\[" + whitespace + "*(?:value|" + booleans + ")" );
+			}
+
+			// Support: Chrome<29, Android<4.4, Safari<7.0+, iOS<7.0+, PhantomJS<1.9.8+
+			if ( !el.querySelectorAll( "[id~=" + expando + "-]" ).length ) {
+				rbuggyQSA.push( "~=" );
+			}
+
+			// Support: IE 11+, Edge 15 - 18+
+			// IE 11/Edge don't find elements on a `[name='']` query in some cases.
+			// Adding a temporary attribute to the document before the selection works
+			// around the issue.
+			// Interestingly, IE 10 & older don't seem to have the issue.
+			input = document.createElement( "input" );
+			input.setAttribute( "name", "" );
+			el.appendChild( input );
+			if ( !el.querySelectorAll( "[name='']" ).length ) {
+				rbuggyQSA.push( "\\[" + whitespace + "*name" + whitespace + "*=" +
+					whitespace + "*(?:''|\"\")" );
+			}
+
+			// Webkit/Opera - :checked should return selected option elements
+			// http://www.w3.org/TR/2011/REC-css3-selectors-20110929/#checked
+			// IE8 throws error here and will not see later tests
+			if ( !el.querySelectorAll( ":checked" ).length ) {
+				rbuggyQSA.push( ":checked" );
+			}
+
+			// Support: Safari 8+, iOS 8+
+			// https://bugs.webkit.org/show_bug.cgi?id=136851
+			// In-page `selector#id sibling-combinator selector` fails
+			if ( !el.querySelectorAll( "a#" + expando + "+*" ).length ) {
+				rbuggyQSA.push( ".#.+[+~]" );
+			}
+
+			// Support: Firefox <=3.6 - 5 only
+			// Old Firefox doesn't throw on a badly-escaped identifier.
+			el.querySelectorAll( "\\\f" );
+			rbuggyQSA.push( "[\\r\\n\\f]" );
+		} );
+
+		assert( function( el ) {
+			el.innerHTML = "<a href='' disabled='disabled'></a>" +
+				"<select disabled='disabled'><option/></select>";
+
+			// Support: Windows 8 Native Apps
+			// The type and name attributes are restricted during .innerHTML assignment
+			var input = document.createElement( "input" );
+			input.setAttribute( "type", "hidden" );
+			el.appendChild( input ).setAttribute( "name", "D" );
+
+			// Support: IE8
+			// Enforce case-sensitivity of name attribute
+			if ( el.querySelectorAll( "[name=d]" ).length ) {
+				rbuggyQSA.push( "name" + whitespace + "*[*^$|!~]?=" );
+			}
+
+			// FF 3.5 - :enabled/:disabled and hidden elements (hidden elements are still enabled)
+			// IE8 throws error here and will not see later tests
+			if ( el.querySelectorAll( ":enabled" ).length !== 2 ) {
+				rbuggyQSA.push( ":enabled", ":disabled" );
+			}
+
+			// Support: IE9-11+
+			// IE's :disabled selector does not pick up the children of disabled fieldsets
+			docElem.appendChild( el ).disabled = true;
+			if ( el.querySelectorAll( ":disabled" ).length !== 2 ) {
+				rbuggyQSA.push( ":enabled", ":disabled" );
+			}
+
+			// Support: Opera 10 - 11 only
+			// Opera 10-11 does not throw on post-comma invalid pseudos
+			el.querySelectorAll( "*,:x" );
+			rbuggyQSA.push( ",.*:" );
+		} );
+	}
+
+	if ( ( support.matchesSelector = rnative.test( ( matches = docElem.matches ||
+		docElem.webkitMatchesSelector ||
+		docElem.mozMatchesSelector ||
+		docElem.oMatchesSelector ||
+		docElem.msMatchesSelector ) ) ) ) {
+
+		assert( function( el ) {
+
+			// Check to see if it's possible to do matchesSelector
+			// on a disconnected node (IE 9)
+			support.disconnectedMatch = matches.call( el, "*" );
+
+			// This should fail with an exception
+			// Gecko does not error, returns false instead
+			matches.call( el, "[s!='']:x" );
+			rbuggyMatches.push( "!=", pseudos );
+		} );
+	}
+
+	rbuggyQSA = rbuggyQSA.length && new RegExp( rbuggyQSA.join( "|" ) );
+	rbuggyMatches = rbuggyMatches.length && new RegExp( rbuggyMatches.join( "|" ) );
+
+	/* Contains
+	---------------------------------------------------------------------- */
+	hasCompare = rnative.test( docElem.compareDocumentPosition );
+
+	// Element contains another
+	// Purposefully self-exclusive
+	// As in, an element does not contain itself
+	contains = hasCompare || rnative.test( docElem.contains ) ?
+		function( a, b ) {
+			var adown = a.nodeType === 9 ? a.documentElement : a,
+				bup = b && b.parentNode;
+			return a === bup || !!( bup && bup.nodeType === 1 && (
+				adown.contains ?
+					adown.contains( bup ) :
+					a.compareDocumentPosition && a.compareDocumentPosition( bup ) & 16
+			) );
+		} :
+		function( a, b ) {
+			if ( b ) {
+				while ( ( b = b.parentNode ) ) {
+					if ( b === a ) {
+						return true;
+					}
+				}
+			}
+			return false;
+		};
+
+	/* Sorting
+	---------------------------------------------------------------------- */
+
+	// Document order sorting
+	sortOrder = hasCompare ?
+	function( a, b ) {
+
+		// Flag for duplicate removal
+		if ( a === b ) {
+			hasDuplicate = true;
+			return 0;
+		}
+
+		// Sort on method existence if only one input has compareDocumentPosition
+		var compare = !a.compareDocumentPosition - !b.compareDocumentPosition;
+		if ( compare ) {
+			return compare;
+		}
+
+		// Calculate position if both inputs belong to the same document
+		// Support: IE 11+, Edge 17 - 18+
+		// IE/Edge sometimes throw a "Permission denied" error when strict-comparing
+		// two documents; shallow comparisons work.
+		// eslint-disable-next-line eqeqeq
+		compare = ( a.ownerDocument || a ) == ( b.ownerDocument || b ) ?
+			a.compareDocumentPosition( b ) :
+
+			// Otherwise we know they are disconnected
+			1;
+
+		// Disconnected nodes
+		if ( compare & 1 ||
+			( !support.sortDetached && b.compareDocumentPosition( a ) === compare ) ) {
+
+			// Choose the first element that is related to our preferred document
+			// Support: IE 11+, Edge 17 - 18+
+			// IE/Edge sometimes throw a "Permission denied" error when strict-comparing
+			// two documents; shallow comparisons work.
+			// eslint-disable-next-line eqeqeq
+			if ( a == document || a.ownerDocument == preferredDoc &&
+				contains( preferredDoc, a ) ) {
+				return -1;
+			}
+
+			// Support: IE 11+, Edge 17 - 18+
+			// IE/Edge sometimes throw a "Permission denied" error when strict-comparing
+			// two documents; shallow comparisons work.
+			// eslint-disable-next-line eqeqeq
+			if ( b == document || b.ownerDocument == preferredDoc &&
+				contains( preferredDoc, b ) ) {
+				return 1;
+			}
+
+			// Maintain original order
+			return sortInput ?
+				( indexOf( sortInput, a ) - indexOf( sortInput, b ) ) :
+				0;
+		}
+
+		return compare & 4 ? -1 : 1;
+	} :
+	function( a, b ) {
+
+		// Exit early if the nodes are identical
+		if ( a === b ) {
+			hasDuplicate = true;
+			return 0;
+		}
+
+		var cur,
+			i = 0,
+			aup = a.parentNode,
+			bup = b.parentNode,
+			ap = [ a ],
+			bp = [ b ];
+
+		// Parentless nodes are either documents or disconnected
+		if ( !aup || !bup ) {
+
+			// Support: IE 11+, Edge 17 - 18+
+			// IE/Edge sometimes throw a "Permission denied" error when strict-comparing
+			// two documents; shallow comparisons work.
+			/* eslint-disable eqeqeq */
+			return a == document ? -1 :
+				b == document ? 1 :
+				/* eslint-enable eqeqeq */
+				aup ? -1 :
+				bup ? 1 :
+				sortInput ?
+				( indexOf( sortInput, a ) - indexOf( sortInput, b ) ) :
+				0;
+
+		// If the nodes are siblings, we can do a quick check
+		} else if ( aup === bup ) {
+			return siblingCheck( a, b );
+		}
+
+		// Otherwise we need full lists of their ancestors for comparison
+		cur = a;
+		while ( ( cur = cur.parentNode ) ) {
+			ap.unshift( cur );
+		}
+		cur = b;
+		while ( ( cur = cur.parentNode ) ) {
+			bp.unshift( cur );
+		}
+
+		// Walk down the tree looking for a discrepancy
+		while ( ap[ i ] === bp[ i ] ) {
+			i++;
+		}
+
+		return i ?
+
+			// Do a sibling check if the nodes have a common ancestor
+			siblingCheck( ap[ i ], bp[ i ] ) :
+
+			// Otherwise nodes in our document sort first
+			// Support: IE 11+, Edge 17 - 18+
+			// IE/Edge sometimes throw a "Permission denied" error when strict-comparing
+			// two documents; shallow comparisons work.
+			/* eslint-disable eqeqeq */
+			ap[ i ] == preferredDoc ? -1 :
+			bp[ i ] == preferredDoc ? 1 :
+			/* eslint-enable eqeqeq */
+			0;
+	};
+
+	return document;
+};
+
+Sizzle.matches = function( expr, elements ) {
+	return Sizzle( expr, null, null, elements );
+};
+
+Sizzle.matchesSelector = function( elem, expr ) {
+	setDocument( elem );
+
+	if ( support.matchesSelector && documentIsHTML &&
+		!nonnativeSelectorCache[ expr + " " ] &&
+		( !rbuggyMatches || !rbuggyMatches.test( expr ) ) &&
+		( !rbuggyQSA     || !rbuggyQSA.test( expr ) ) ) {
+
+		try {
+			var ret = matches.call( elem, expr );
+
+			// IE 9's matchesSelector returns false on disconnected nodes
+			if ( ret || support.disconnectedMatch ||
+
+				// As well, disconnected nodes are said to be in a document
+				// fragment in IE 9
+				elem.document && elem.document.nodeType !== 11 ) {
+				return ret;
+			}
+		} catch ( e ) {
+			nonnativeSelectorCache( expr, true );
+		}
+	}
+
+	return Sizzle( expr, document, null, [ elem ] ).length > 0;
+};
+
+Sizzle.contains = function( context, elem ) {
+
+	// Set document vars if needed
+	// Support: IE 11+, Edge 17 - 18+
+	// IE/Edge sometimes throw a "Permission denied" error when strict-comparing
+	// two documents; shallow comparisons work.
+	// eslint-disable-next-line eqeqeq
+	if ( ( context.ownerDocument || context ) != document ) {
+		setDocument( context );
+	}
+	return contains( context, elem );
+};
+
+Sizzle.attr = function( elem, name ) {
+
+	// Set document vars if needed
+	// Support: IE 11+, Edge 17 - 18+
+	// IE/Edge sometimes throw a "Permission denied" error when strict-comparing
+	// two documents; shallow comparisons work.
+	// eslint-disable-next-line eqeqeq
+	if ( ( elem.ownerDocument || elem ) != document ) {
+		setDocument( elem );
+	}
+
+	var fn = Expr.attrHandle[ name.toLowerCase() ],
+
+		// Don't get fooled by Object.prototype properties (jQuery #13807)
+		val = fn && hasOwn.call( Expr.attrHandle, name.toLowerCase() ) ?
+			fn( elem, name, !documentIsHTML ) :
+			undefined;
+
+	return val !== undefined ?
+		val :
+		support.attributes || !documentIsHTML ?
+			elem.getAttribute( name ) :
+			( val = elem.getAttributeNode( name ) ) && val.specified ?
+				val.value :
+				null;
+};
+
+Sizzle.escape = function( sel ) {
+	return ( sel + "" ).replace( rcssescape, fcssescape );
+};
+
+Sizzle.error = function( msg ) {
+	throw new Error( "Syntax error, unrecognized expression: " + msg );
+};
+
+/**
+ * Document sorting and removing duplicates
+ * @param {ArrayLike} results
+ */
+Sizzle.uniqueSort = function( results ) {
+	var elem,
+		duplicates = [],
+		j = 0,
+		i = 0;
+
+	// Unless we *know* we can detect duplicates, assume their presence
+	hasDuplicate = !support.detectDuplicates;
+	sortInput = !support.sortStable && results.slice( 0 );
+	results.sort( sortOrder );
+
+	if ( hasDuplicate ) {
+		while ( ( elem = results[ i++ ] ) ) {
+			if ( elem === results[ i ] ) {
+				j = duplicates.push( i );
+			}
+		}
+		while ( j-- ) {
+			results.splice( duplicates[ j ], 1 );
+		}
+	}
+
+	// Clear input after sorting to release objects
+	// See https://github.com/jquery/sizzle/pull/225
+	sortInput = null;
+
+	return results;
+};
+
+/**
+ * Utility function for retrieving the text value of an array of DOM nodes
+ * @param {Array|Element} elem
+ */
+getText = Sizzle.getText = function( elem ) {
+	var node,
+		ret = "",
+		i = 0,
+		nodeType = elem.nodeType;
+
+	if ( !nodeType ) {
+
+		// If no nodeType, this is expected to be an array
+		while ( ( node = elem[ i++ ] ) ) {
+
+			// Do not traverse comment nodes
+			ret += getText( node );
+		}
+	} else if ( nodeType === 1 || nodeType === 9 || nodeType === 11 ) {
+
+		// Use textContent for elements
+		// innerText usage removed for consistency of new lines (jQuery #11153)
+		if ( typeof elem.textContent === "string" ) {
+			return elem.textContent;
+		} else {
+
+			// Traverse its children
+			for ( elem = elem.firstChild; elem; elem = elem.nextSibling ) {
+				ret += getText( elem );
+			}
+		}
+	} else if ( nodeType === 3 || nodeType === 4 ) {
+		return elem.nodeValue;
+	}
+
+	// Do not include comment or processing instruction nodes
+
+	return ret;
+};
+
+Expr = Sizzle.selectors = {
+
+	// Can be adjusted by the user
+	cacheLength: 50,
+
+	createPseudo: markFunction,
+
+	match: matchExpr,
+
+	attrHandle: {},
+
+	find: {},
+
+	relative: {
+		">": { dir: "parentNode", first: true },
+		" ": { dir: "parentNode" },
+		"+": { dir: "previousSibling", first: true },
+		"~": { dir: "previousSibling" }
+	},
+
+	preFilter: {
+		"ATTR": function( match ) {
+			match[ 1 ] = match[ 1 ].replace( runescape, funescape );
+
+			// Move the given value to match[3] whether quoted or unquoted
+			match[ 3 ] = ( match[ 3 ] || match[ 4 ] ||
+				match[ 5 ] || "" ).replace( runescape, funescape );
+
+			if ( match[ 2 ] === "~=" ) {
+				match[ 3 ] = " " + match[ 3 ] + " ";
+			}
+
+			return match.slice( 0, 4 );
+		},
+
+		"CHILD": function( match ) {
+
+			/* matches from matchExpr["CHILD"]
+				1 type (only|nth|...)
+				2 what (child|of-type)
+				3 argument (even|odd|\d*|\d*n([+-]\d+)?|...)
+				4 xn-component of xn+y argument ([+-]?\d*n|)
+				5 sign of xn-component
+				6 x of xn-component
+				7 sign of y-component
+				8 y of y-component
+			*/
+			match[ 1 ] = match[ 1 ].toLowerCase();
+
+			if ( match[ 1 ].slice( 0, 3 ) === "nth" ) {
+
+				// nth-* requires argument
+				if ( !match[ 3 ] ) {
+					Sizzle.error( match[ 0 ] );
+				}
+
+				// numeric x and y parameters for Expr.filter.CHILD
+				// remember that false/true cast respectively to 0/1
+				match[ 4 ] = +( match[ 4 ] ?
+					match[ 5 ] + ( match[ 6 ] || 1 ) :
+					2 * ( match[ 3 ] === "even" || match[ 3 ] === "odd" ) );
+				match[ 5 ] = +( ( match[ 7 ] + match[ 8 ] ) || match[ 3 ] === "odd" );
+
+				// other types prohibit arguments
+			} else if ( match[ 3 ] ) {
+				Sizzle.error( match[ 0 ] );
+			}
+
+			return match;
+		},
+
+		"PSEUDO": function( match ) {
+			var excess,
+				unquoted = !match[ 6 ] && match[ 2 ];
+
+			if ( matchExpr[ "CHILD" ].test( match[ 0 ] ) ) {
+				return null;
+			}
+
+			// Accept quoted arguments as-is
+			if ( match[ 3 ] ) {
+				match[ 2 ] = match[ 4 ] || match[ 5 ] || "";
+
+			// Strip excess characters from unquoted arguments
+			} else if ( unquoted && rpseudo.test( unquoted ) &&
+
+				// Get excess from tokenize (recursively)
+				( excess = tokenize( unquoted, true ) ) &&
+
+				// advance to the next closing parenthesis
+				( excess = unquoted.indexOf( ")", unquoted.length - excess ) - unquoted.length ) ) {
+
+				// excess is a negative index
+				match[ 0 ] = match[ 0 ].slice( 0, excess );
+				match[ 2 ] = unquoted.slice( 0, excess );
+			}
+
+			// Return only captures needed by the pseudo filter method (type and argument)
+			return match.slice( 0, 3 );
+		}
+	},
+
+	filter: {
+
+		"TAG": function( nodeNameSelector ) {
+			var nodeName = nodeNameSelector.replace( runescape, funescape ).toLowerCase();
+			return nodeNameSelector === "*" ?
+				function() {
+					return true;
+				} :
+				function( elem ) {
+					return elem.nodeName && elem.nodeName.toLowerCase() === nodeName;
+				};
+		},
+
+		"CLASS": function( className ) {
+			var pattern = classCache[ className + " " ];
+
+			return pattern ||
+				( pattern = new RegExp( "(^|" + whitespace +
+					")" + className + "(" + whitespace + "|$)" ) ) && classCache(
+						className, function( elem ) {
+							return pattern.test(
+								typeof elem.className === "string" && elem.className ||
+								typeof elem.getAttribute !== "undefined" &&
+									elem.getAttribute( "class" ) ||
+								""
+							);
+				} );
+		},
+
+		"ATTR": function( name, operator, check ) {
+			return function( elem ) {
+				var result = Sizzle.attr( elem, name );
+
+				if ( result == null ) {
+					return operator === "!=";
+				}
+				if ( !operator ) {
+					return true;
+				}
+
+				result += "";
+
+				/* eslint-disable max-len */
+
+				return operator === "=" ? result === check :
+					operator === "!=" ? result !== check :
+					operator === "^=" ? check && result.indexOf( check ) === 0 :
+					operator === "*=" ? check && result.indexOf( check ) > -1 :
+					operator === "$=" ? check && result.slice( -check.length ) === check :
+					operator === "~=" ? ( " " + result.replace( rwhitespace, " " ) + " " ).indexOf( check ) > -1 :
+					operator === "|=" ? result === check || result.slice( 0, check.length + 1 ) === check + "-" :
+					false;
+				/* eslint-enable max-len */
+
+			};
+		},
+
+		"CHILD": function( type, what, _argument, first, last ) {
+			var simple = type.slice( 0, 3 ) !== "nth",
+				forward = type.slice( -4 ) !== "last",
+				ofType = what === "of-type";
+
+			return first === 1 && last === 0 ?
+
+				// Shortcut for :nth-*(n)
+				function( elem ) {
+					return !!elem.parentNode;
+				} :
+
+				function( elem, _context, xml ) {
+					var cache, uniqueCache, outerCache, node, nodeIndex, start,
+						dir = simple !== forward ? "nextSibling" : "previousSibling",
+						parent = elem.parentNode,
+						name = ofType && elem.nodeName.toLowerCase(),
+						useCache = !xml && !ofType,
+						diff = false;
+
+					if ( parent ) {
+
+						// :(first|last|only)-(child|of-type)
+						if ( simple ) {
+							while ( dir ) {
+								node = elem;
+								while ( ( node = node[ dir ] ) ) {
+									if ( ofType ?
+										node.nodeName.toLowerCase() === name :
+										node.nodeType === 1 ) {
+
+										return false;
+									}
+								}
+
+								// Reverse direction for :only-* (if we haven't yet done so)
+								start = dir = type === "only" && !start && "nextSibling";
+							}
+							return true;
+						}
+
+						start = [ forward ? parent.firstChild : parent.lastChild ];
+
+						// non-xml :nth-child(...) stores cache data on `parent`
+						if ( forward && useCache ) {
+
+							// Seek `elem` from a previously-cached index
+
+							// ...in a gzip-friendly way
+							node = parent;
+							outerCache = node[ expando ] || ( node[ expando ] = {} );
+
+							// Support: IE <9 only
+							// Defend against cloned attroperties (jQuery gh-1709)
+							uniqueCache = outerCache[ node.uniqueID ] ||
+								( outerCache[ node.uniqueID ] = {} );
+
+							cache = uniqueCache[ type ] || [];
+							nodeIndex = cache[ 0 ] === dirruns && cache[ 1 ];
+							diff = nodeIndex && cache[ 2 ];
+							node = nodeIndex && parent.childNodes[ nodeIndex ];
+
+							while ( ( node = ++nodeIndex && node && node[ dir ] ||
+
+								// Fallback to seeking `elem` from the start
+								( diff = nodeIndex = 0 ) || start.pop() ) ) {
+
+								// When found, cache indexes on `parent` and break
+								if ( node.nodeType === 1 && ++diff && node === elem ) {
+									uniqueCache[ type ] = [ dirruns, nodeIndex, diff ];
+									break;
+								}
+							}
+
+						} else {
+
+							// Use previously-cached element index if available
+							if ( useCache ) {
+
+								// ...in a gzip-friendly way
+								node = elem;
+								outerCache = node[ expando ] || ( node[ expando ] = {} );
+
+								// Support: IE <9 only
+								// Defend against cloned attroperties (jQuery gh-1709)
+								uniqueCache = outerCache[ node.uniqueID ] ||
+									( outerCache[ node.uniqueID ] = {} );
+
+								cache = uniqueCache[ type ] || [];
+								nodeIndex = cache[ 0 ] === dirruns && cache[ 1 ];
+								diff = nodeIndex;
+							}
+
+							// xml :nth-child(...)
+							// or :nth-last-child(...) or :nth(-last)?-of-type(...)
+							if ( diff === false ) {
+
+								// Use the same loop as above to seek `elem` from the start
+								while ( ( node = ++nodeIndex && node && node[ dir ] ||
+									( diff = nodeIndex = 0 ) || start.pop() ) ) {
+
+									if ( ( ofType ?
+										node.nodeName.toLowerCase() === name :
+										node.nodeType === 1 ) &&
+										++diff ) {
+
+										// Cache the index of each encountered element
+										if ( useCache ) {
+											outerCache = node[ expando ] ||
+												( node[ expando ] = {} );
+
+											// Support: IE <9 only
+											// Defend against cloned attroperties (jQuery gh-1709)
+											uniqueCache = outerCache[ node.uniqueID ] ||
+												( outerCache[ node.uniqueID ] = {} );
+
+											uniqueCache[ type ] = [ dirruns, diff ];
+										}
+
+										if ( node === elem ) {
+											break;
+										}
+									}
+								}
+							}
+						}
+
+						// Incorporate the offset, then check against cycle size
+						diff -= last;
+						return diff === first || ( diff % first === 0 && diff / first >= 0 );
+					}
+				};
+		},
+
+		"PSEUDO": function( pseudo, argument ) {
+
+			// pseudo-class names are case-insensitive
+			// http://www.w3.org/TR/selectors/#pseudo-classes
+			// Prioritize by case sensitivity in case custom pseudos are added with uppercase letters
+			// Remember that setFilters inherits from pseudos
+			var args,
+				fn = Expr.pseudos[ pseudo ] || Expr.setFilters[ pseudo.toLowerCase() ] ||
+					Sizzle.error( "unsupported pseudo: " + pseudo );
+
+			// The user may use createPseudo to indicate that
+			// arguments are needed to create the filter function
+			// just as Sizzle does
+			if ( fn[ expando ] ) {
+				return fn( argument );
+			}
+
+			// But maintain support for old signatures
+			if ( fn.length > 1 ) {
+				args = [ pseudo, pseudo, "", argument ];
+				return Expr.setFilters.hasOwnProperty( pseudo.toLowerCase() ) ?
+					markFunction( function( seed, matches ) {
+						var idx,
+							matched = fn( seed, argument ),
+							i = matched.length;
+						while ( i-- ) {
+							idx = indexOf( seed, matched[ i ] );
+							seed[ idx ] = !( matches[ idx ] = matched[ i ] );
+						}
+					} ) :
+					function( elem ) {
+						return fn( elem, 0, args );
+					};
+			}
+
+			return fn;
+		}
+	},
+
+	pseudos: {
+
+		// Potentially complex pseudos
+		"not": markFunction( function( selector ) {
+
+			// Trim the selector passed to compile
+			// to avoid treating leading and trailing
+			// spaces as combinators
+			var input = [],
+				results = [],
+				matcher = compile( selector.replace( rtrim, "$1" ) );
+
+			return matcher[ expando ] ?
+				markFunction( function( seed, matches, _context, xml ) {
+					var elem,
+						unmatched = matcher( seed, null, xml, [] ),
+						i = seed.length;
+
+					// Match elements unmatched by `matcher`
+					while ( i-- ) {
+						if ( ( elem = unmatched[ i ] ) ) {
+							seed[ i ] = !( matches[ i ] = elem );
+						}
+					}
+				} ) :
+				function( elem, _context, xml ) {
+					input[ 0 ] = elem;
+					matcher( input, null, xml, results );
+
+					// Don't keep the element (issue #299)
+					input[ 0 ] = null;
+					return !results.pop();
+				};
+		} ),
+
+		"has": markFunction( function( selector ) {
+			return function( elem ) {
+				return Sizzle( selector, elem ).length > 0;
+			};
+		} ),
+
+		"contains": markFunction( function( text ) {
+			text = text.replace( runescape, funescape );
+			return function( elem ) {
+				return ( elem.textContent || getText( elem ) ).indexOf( text ) > -1;
+			};
+		} ),
+
+		// "Whether an element is represented by a :lang() selector
+		// is based solely on the element's language value
+		// being equal to the identifier C,
+		// or beginning with the identifier C immediately followed by "-".
+		// The matching of C against the element's language value is performed case-insensitively.
+		// The identifier C does not have to be a valid language name."
+		// http://www.w3.org/TR/selectors/#lang-pseudo
+		"lang": markFunction( function( lang ) {
+
+			// lang value must be a valid identifier
+			if ( !ridentifier.test( lang || "" ) ) {
+				Sizzle.error( "unsupported lang: " + lang );
+			}
+			lang = lang.replace( runescape, funescape ).toLowerCase();
+			return function( elem ) {
+				var elemLang;
+				do {
+					if ( ( elemLang = documentIsHTML ?
+						elem.lang :
+						elem.getAttribute( "xml:lang" ) || elem.getAttribute( "lang" ) ) ) {
+
+						elemLang = elemLang.toLowerCase();
+						return elemLang === lang || elemLang.indexOf( lang + "-" ) === 0;
+					}
+				} while ( ( elem = elem.parentNode ) && elem.nodeType === 1 );
+				return false;
+			};
+		} ),
+
+		// Miscellaneous
+		"target": function( elem ) {
+			var hash = window.location && window.location.hash;
+			return hash && hash.slice( 1 ) === elem.id;
+		},
+
+		"root": function( elem ) {
+			return elem === docElem;
+		},
+
+		"focus": function( elem ) {
+			return elem === document.activeElement &&
+				( !document.hasFocus || document.hasFocus() ) &&
+				!!( elem.type || elem.href || ~elem.tabIndex );
+		},
+
+		// Boolean properties
+		"enabled": createDisabledPseudo( false ),
+		"disabled": createDisabledPseudo( true ),
+
+		"checked": function( elem ) {
+
+			// In CSS3, :checked should return both checked and selected elements
+			// http://www.w3.org/TR/2011/REC-css3-selectors-20110929/#checked
+			var nodeName = elem.nodeName.toLowerCase();
+			return ( nodeName === "input" && !!elem.checked ) ||
+				( nodeName === "option" && !!elem.selected );
+		},
+
+		"selected": function( elem ) {
+
+			// Accessing this property makes selected-by-default
+			// options in Safari work properly
+			if ( elem.parentNode ) {
+				// eslint-disable-next-line no-unused-expressions
+				elem.parentNode.selectedIndex;
+			}
+
+			return elem.selected === true;
+		},
+
+		// Contents
+		"empty": function( elem ) {
+
+			// http://www.w3.org/TR/selectors/#empty-pseudo
+			// :empty is negated by element (1) or content nodes (text: 3; cdata: 4; entity ref: 5),
+			//   but not by others (comment: 8; processing instruction: 7; etc.)
+			// nodeType < 6 works because attributes (2) do not appear as children
+			for ( elem = elem.firstChild; elem; elem = elem.nextSibling ) {
+				if ( elem.nodeType < 6 ) {
+					return false;
+				}
+			}
+			return true;
+		},
+
+		"parent": function( elem ) {
+			return !Expr.pseudos[ "empty" ]( elem );
+		},
+
+		// Element/input types
+		"header": function( elem ) {
+			return rheader.test( elem.nodeName );
+		},
+
+		"input": function( elem ) {
+			return rinputs.test( elem.nodeName );
+		},
+
+		"button": function( elem ) {
+			var name = elem.nodeName.toLowerCase();
+			return name === "input" && elem.type === "button" || name === "button";
+		},
+
+		"text": function( elem ) {
+			var attr;
+			return elem.nodeName.toLowerCase() === "input" &&
+				elem.type === "text" &&
+
+				// Support: IE<8
+				// New HTML5 attribute values (e.g., "search") appear with elem.type === "text"
+				( ( attr = elem.getAttribute( "type" ) ) == null ||
+					attr.toLowerCase() === "text" );
+		},
+
+		// Position-in-collection
+		"first": createPositionalPseudo( function() {
+			return [ 0 ];
+		} ),
+
+		"last": createPositionalPseudo( function( _matchIndexes, length ) {
+			return [ length - 1 ];
+		} ),
+
+		"eq": createPositionalPseudo( function( _matchIndexes, length, argument ) {
+			return [ argument < 0 ? argument + length : argument ];
+		} ),
+
+		"even": createPositionalPseudo( function( matchIndexes, length ) {
+			var i = 0;
+			for ( ; i < length; i += 2 ) {
+				matchIndexes.push( i );
+			}
+			return matchIndexes;
+		} ),
+
+		"odd": createPositionalPseudo( function( matchIndexes, length ) {
+			var i = 1;
+			for ( ; i < length; i += 2 ) {
+				matchIndexes.push( i );
+			}
+			return matchIndexes;
+		} ),
+
+		"lt": createPositionalPseudo( function( matchIndexes, length, argument ) {
+			var i = argument < 0 ?
+				argument + length :
+				argument > length ?
+					length :
+					argument;
+			for ( ; --i >= 0; ) {
+				matchIndexes.push( i );
+			}
+			return matchIndexes;
+		} ),
+
+		"gt": createPositionalPseudo( function( matchIndexes, length, argument ) {
+			var i = argument < 0 ? argument + length : argument;
+			for ( ; ++i < length; ) {
+				matchIndexes.push( i );
+			}
+			return matchIndexes;
+		} )
+	}
+};
+
+Expr.pseudos[ "nth" ] = Expr.pseudos[ "eq" ];
+
+// Add button/input type pseudos
+for ( i in { radio: true, checkbox: true, file: true, password: true, image: true } ) {
+	Expr.pseudos[ i ] = createInputPseudo( i );
+}
+for ( i in { submit: true, reset: true } ) {
+	Expr.pseudos[ i ] = createButtonPseudo( i );
+}
+
+// Easy API for creating new setFilters
+function setFilters() {}
+setFilters.prototype = Expr.filters = Expr.pseudos;
+Expr.setFilters = new setFilters();
+
+tokenize = Sizzle.tokenize = function( selector, parseOnly ) {
+	var matched, match, tokens, type,
+		soFar, groups, preFilters,
+		cached = tokenCache[ selector + " " ];
+
+	if ( cached ) {
+		return parseOnly ? 0 : cached.slice( 0 );
+	}
+
+	soFar = selector;
+	groups = [];
+	preFilters = Expr.preFilter;
+
+	while ( soFar ) {
+
+		// Comma and first run
+		if ( !matched || ( match = rcomma.exec( soFar ) ) ) {
+			if ( match ) {
+
+				// Don't consume trailing commas as valid
+				soFar = soFar.slice( match[ 0 ].length ) || soFar;
+			}
+			groups.push( ( tokens = [] ) );
+		}
+
+		matched = false;
+
+		// Combinators
+		if ( ( match = rcombinators.exec( soFar ) ) ) {
+			matched = match.shift();
+			tokens.push( {
+				value: matched,
+
+				// Cast descendant combinators to space
+				type: match[ 0 ].replace( rtrim, " " )
+			} );
+			soFar = soFar.slice( matched.length );
+		}
+
+		// Filters
+		for ( type in Expr.filter ) {
+			if ( ( match = matchExpr[ type ].exec( soFar ) ) && ( !preFilters[ type ] ||
+				( match = preFilters[ type ]( match ) ) ) ) {
+				matched = match.shift();
+				tokens.push( {
+					value: matched,
+					type: type,
+					matches: match
+				} );
+				soFar = soFar.slice( matched.length );
+			}
+		}
+
+		if ( !matched ) {
+			break;
+		}
+	}
+
+	// Return the length of the invalid excess
+	// if we're just parsing
+	// Otherwise, throw an error or return tokens
+	return parseOnly ?
+		soFar.length :
+		soFar ?
+			Sizzle.error( selector ) :
+
+			// Cache the tokens
+			tokenCache( selector, groups ).slice( 0 );
+};
+
+function toSelector( tokens ) {
+	var i = 0,
+		len = tokens.length,
+		selector = "";
+	for ( ; i < len; i++ ) {
+		selector += tokens[ i ].value;
+	}
+	return selector;
+}
+
+function addCombinator( matcher, combinator, base ) {
+	var dir = combinator.dir,
+		skip = combinator.next,
+		key = skip || dir,
+		checkNonElements = base && key === "parentNode",
+		doneName = done++;
+
+	return combinator.first ?
+
+		// Check against closest ancestor/preceding element
+		function( elem, context, xml ) {
+			while ( ( elem = elem[ dir ] ) ) {
+				if ( elem.nodeType === 1 || checkNonElements ) {
+					return matcher( elem, context, xml );
+				}
+			}
+			return false;
+		} :
+
+		// Check against all ancestor/preceding elements
+		function( elem, context, xml ) {
+			var oldCache, uniqueCache, outerCache,
+				newCache = [ dirruns, doneName ];
+
+			// We can't set arbitrary data on XML nodes, so they don't benefit from combinator caching
+			if ( xml ) {
+				while ( ( elem = elem[ dir ] ) ) {
+					if ( elem.nodeType === 1 || checkNonElements ) {
+						if ( matcher( elem, context, xml ) ) {
+							return true;
+						}
+					}
+				}
+			} else {
+				while ( ( elem = elem[ dir ] ) ) {
+					if ( elem.nodeType === 1 || checkNonElements ) {
+						outerCache = elem[ expando ] || ( elem[ expando ] = {} );
+
+						// Support: IE <9 only
+						// Defend against cloned attroperties (jQuery gh-1709)
+						uniqueCache = outerCache[ elem.uniqueID ] ||
+							( outerCache[ elem.uniqueID ] = {} );
+
+						if ( skip && skip === elem.nodeName.toLowerCase() ) {
+							elem = elem[ dir ] || elem;
+						} else if ( ( oldCache = uniqueCache[ key ] ) &&
+							oldCache[ 0 ] === dirruns && oldCache[ 1 ] === doneName ) {
+
+							// Assign to newCache so results back-propagate to previous elements
+							return ( newCache[ 2 ] = oldCache[ 2 ] );
+						} else {
+
+							// Reuse newcache so results back-propagate to previous elements
+							uniqueCache[ key ] = newCache;
+
+							// A match means we're done; a fail means we have to keep checking
+							if ( ( newCache[ 2 ] = matcher( elem, context, xml ) ) ) {
+								return true;
+							}
+						}
+					}
+				}
+			}
+			return false;
+		};
+}
+
+function elementMatcher( matchers ) {
+	return matchers.length > 1 ?
+		function( elem, context, xml ) {
+			var i = matchers.length;
+			while ( i-- ) {
+				if ( !matchers[ i ]( elem, context, xml ) ) {
+					return false;
+				}
+			}
+			return true;
+		} :
+		matchers[ 0 ];
+}
+
+function multipleContexts( selector, contexts, results ) {
+	var i = 0,
+		len = contexts.length;
+	for ( ; i < len; i++ ) {
+		Sizzle( selector, contexts[ i ], results );
+	}
+	return results;
+}
+
+function condense( unmatched, map, filter, context, xml ) {
+	var elem,
+		newUnmatched = [],
+		i = 0,
+		len = unmatched.length,
+		mapped = map != null;
+
+	for ( ; i < len; i++ ) {
+		if ( ( elem = unmatched[ i ] ) ) {
+			if ( !filter || filter( elem, context, xml ) ) {
+				newUnmatched.push( elem );
+				if ( mapped ) {
+					map.push( i );
+				}
+			}
+		}
+	}
+
+	return newUnmatched;
+}
+
+function setMatcher( preFilter, selector, matcher, postFilter, postFinder, postSelector ) {
+	if ( postFilter && !postFilter[ expando ] ) {
+		postFilter = setMatcher( postFilter );
+	}
+	if ( postFinder && !postFinder[ expando ] ) {
+		postFinder = setMatcher( postFinder, postSelector );
+	}
+	return markFunction( function( seed, results, context, xml ) {
+		var temp, i, elem,
+			preMap = [],
+			postMap = [],
+			preexisting = results.length,
+
+			// Get initial elements from seed or context
+			elems = seed || multipleContexts(
+				selector || "*",
+				context.nodeType ? [ context ] : context,
+				[]
+			),
+
+			// Prefilter to get matcher input, preserving a map for seed-results synchronization
+			matcherIn = preFilter && ( seed || !selector ) ?
+				condense( elems, preMap, preFilter, context, xml ) :
+				elems,
+
+			matcherOut = matcher ?
+
+				// If we have a postFinder, or filtered seed, or non-seed postFilter or preexisting results,
+				postFinder || ( seed ? preFilter : preexisting || postFilter ) ?
+
+					// ...intermediate processing is necessary
+					[] :
+
+					// ...otherwise use results directly
+					results :
+				matcherIn;
+
+		// Find primary matches
+		if ( matcher ) {
+			matcher( matcherIn, matcherOut, context, xml );
+		}
+
+		// Apply postFilter
+		if ( postFilter ) {
+			temp = condense( matcherOut, postMap );
+			postFilter( temp, [], context, xml );
+
+			// Un-match failing elements by moving them back to matcherIn
+			i = temp.length;
+			while ( i-- ) {
+				if ( ( elem = temp[ i ] ) ) {
+					matcherOut[ postMap[ i ] ] = !( matcherIn[ postMap[ i ] ] = elem );
+				}
+			}
+		}
+
+		if ( seed ) {
+			if ( postFinder || preFilter ) {
+				if ( postFinder ) {
+
+					// Get the final matcherOut by condensing this intermediate into postFinder contexts
+					temp = [];
+					i = matcherOut.length;
+					while ( i-- ) {
+						if ( ( elem = matcherOut[ i ] ) ) {
+
+							// Restore matcherIn since elem is not yet a final match
+							temp.push( ( matcherIn[ i ] = elem ) );
+						}
+					}
+					postFinder( null, ( matcherOut = [] ), temp, xml );
+				}
+
+				// Move matched elements from seed to results to keep them synchronized
+				i = matcherOut.length;
+				while ( i-- ) {
+					if ( ( elem = matcherOut[ i ] ) &&
+						( temp = postFinder ? indexOf( seed, elem ) : preMap[ i ] ) > -1 ) {
+
+						seed[ temp ] = !( results[ temp ] = elem );
+					}
+				}
+			}
+
+		// Add elements to results, through postFinder if defined
+		} else {
+			matcherOut = condense(
+				matcherOut === results ?
+					matcherOut.splice( preexisting, matcherOut.length ) :
+					matcherOut
+			);
+			if ( postFinder ) {
+				postFinder( null, results, matcherOut, xml );
+			} else {
+				push.apply( results, matcherOut );
+			}
+		}
+	} );
+}
+
+function matcherFromTokens( tokens ) {
+	var checkContext, matcher, j,
+		len = tokens.length,
+		leadingRelative = Expr.relative[ tokens[ 0 ].type ],
+		implicitRelative = leadingRelative || Expr.relative[ " " ],
+		i = leadingRelative ? 1 : 0,
+
+		// The foundational matcher ensures that elements are reachable from top-level context(s)
+		matchContext = addCombinator( function( elem ) {
+			return elem === checkContext;
+		}, implicitRelative, true ),
+		matchAnyContext = addCombinator( function( elem ) {
+			return indexOf( checkContext, elem ) > -1;
+		}, implicitRelative, true ),
+		matchers = [ function( elem, context, xml ) {
+			var ret = ( !leadingRelative && ( xml || context !== outermostContext ) ) || (
+				( checkContext = context ).nodeType ?
+					matchContext( elem, context, xml ) :
+					matchAnyContext( elem, context, xml ) );
+
+			// Avoid hanging onto element (issue #299)
+			checkContext = null;
+			return ret;
+		} ];
+
+	for ( ; i < len; i++ ) {
+		if ( ( matcher = Expr.relative[ tokens[ i ].type ] ) ) {
+			matchers = [ addCombinator( elementMatcher( matchers ), matcher ) ];
+		} else {
+			matcher = Expr.filter[ tokens[ i ].type ].apply( null, tokens[ i ].matches );
+
+			// Return special upon seeing a positional matcher
+			if ( matcher[ expando ] ) {
+
+				// Find the next relative operator (if any) for proper handling
+				j = ++i;
+				for ( ; j < len; j++ ) {
+					if ( Expr.relative[ tokens[ j ].type ] ) {
+						break;
+					}
+				}
+				return setMatcher(
+					i > 1 && elementMatcher( matchers ),
+					i > 1 && toSelector(
+
+					// If the preceding token was a descendant combinator, insert an implicit any-element `*`
+					tokens
+						.slice( 0, i - 1 )
+						.concat( { value: tokens[ i - 2 ].type === " " ? "*" : "" } )
+					).replace( rtrim, "$1" ),
+					matcher,
+					i < j && matcherFromTokens( tokens.slice( i, j ) ),
+					j < len && matcherFromTokens( ( tokens = tokens.slice( j ) ) ),
+					j < len && toSelector( tokens )
+				);
+			}
+			matchers.push( matcher );
+		}
+	}
+
+	return elementMatcher( matchers );
+}
+
+function matcherFromGroupMatchers( elementMatchers, setMatchers ) {
+	var bySet = setMatchers.length > 0,
+		byElement = elementMatchers.length > 0,
+		superMatcher = function( seed, context, xml, results, outermost ) {
+			var elem, j, matcher,
+				matchedCount = 0,
+				i = "0",
+				unmatched = seed && [],
+				setMatched = [],
+				contextBackup = outermostContext,
+
+				// We must always have either seed elements or outermost context
+				elems = seed || byElement && Expr.find[ "TAG" ]( "*", outermost ),
+
+				// Use integer dirruns iff this is the outermost matcher
+				dirrunsUnique = ( dirruns += contextBackup == null ? 1 : Math.random() || 0.1 ),
+				len = elems.length;
+
+			if ( outermost ) {
+
+				// Support: IE 11+, Edge 17 - 18+
+				// IE/Edge sometimes throw a "Permission denied" error when strict-comparing
+				// two documents; shallow comparisons work.
+				// eslint-disable-next-line eqeqeq
+				outermostContext = context == document || context || outermost;
+			}
+
+			// Add elements passing elementMatchers directly to results
+			// Support: IE<9, Safari
+			// Tolerate NodeList properties (IE: "length"; Safari: <number>) matching elements by id
+			for ( ; i !== len && ( elem = elems[ i ] ) != null; i++ ) {
+				if ( byElement && elem ) {
+					j = 0;
+
+					// Support: IE 11+, Edge 17 - 18+
+					// IE/Edge sometimes throw a "Permission denied" error when strict-comparing
+					// two documents; shallow comparisons work.
+					// eslint-disable-next-line eqeqeq
+					if ( !context && elem.ownerDocument != document ) {
+						setDocument( elem );
+						xml = !documentIsHTML;
+					}
+					while ( ( matcher = elementMatchers[ j++ ] ) ) {
+						if ( matcher( elem, context || document, xml ) ) {
+							results.push( elem );
+							break;
+						}
+					}
+					if ( outermost ) {
+						dirruns = dirrunsUnique;
+					}
+				}
+
+				// Track unmatched elements for set filters
+				if ( bySet ) {
+
+					// They will have gone through all possible matchers
+					if ( ( elem = !matcher && elem ) ) {
+						matchedCount--;
+					}
+
+					// Lengthen the array for every element, matched or not
+					if ( seed ) {
+						unmatched.push( elem );
+					}
+				}
+			}
+
+			// `i` is now the count of elements visited above, and adding it to `matchedCount`
+			// makes the latter nonnegative.
+			matchedCount += i;
+
+			// Apply set filters to unmatched elements
+			// NOTE: This can be skipped if there are no unmatched elements (i.e., `matchedCount`
+			// equals `i`), unless we didn't visit _any_ elements in the above loop because we have
+			// no element matchers and no seed.
+			// Incrementing an initially-string "0" `i` allows `i` to remain a string only in that
+			// case, which will result in a "00" `matchedCount` that differs from `i` but is also
+			// numerically zero.
+			if ( bySet && i !== matchedCount ) {
+				j = 0;
+				while ( ( matcher = setMatchers[ j++ ] ) ) {
+					matcher( unmatched, setMatched, context, xml );
+				}
+
+				if ( seed ) {
+
+					// Reintegrate element matches to eliminate the need for sorting
+					if ( matchedCount > 0 ) {
+						while ( i-- ) {
+							if ( !( unmatched[ i ] || setMatched[ i ] ) ) {
+								setMatched[ i ] = pop.call( results );
+							}
+						}
+					}
+
+					// Discard index placeholder values to get only actual matches
+					setMatched = condense( setMatched );
+				}
+
+				// Add matches to results
+				push.apply( results, setMatched );
+
+				// Seedless set matches succeeding multiple successful matchers stipulate sorting
+				if ( outermost && !seed && setMatched.length > 0 &&
+					( matchedCount + setMatchers.length ) > 1 ) {
+
+					Sizzle.uniqueSort( results );
+				}
+			}
+
+			// Override manipulation of globals by nested matchers
+			if ( outermost ) {
+				dirruns = dirrunsUnique;
+				outermostContext = contextBackup;
+			}
+
+			return unmatched;
+		};
+
+	return bySet ?
+		markFunction( superMatcher ) :
+		superMatcher;
+}
+
+compile = Sizzle.compile = function( selector, match /* Internal Use Only */ ) {
+	var i,
+		setMatchers = [],
+		elementMatchers = [],
+		cached = compilerCache[ selector + " " ];
+
+	if ( !cached ) {
+
+		// Generate a function of recursive functions that can be used to check each element
+		if ( !match ) {
+			match = tokenize( selector );
+		}
+		i = match.length;
+		while ( i-- ) {
+			cached = matcherFromTokens( match[ i ] );
+			if ( cached[ expando ] ) {
+				setMatchers.push( cached );
+			} else {
+				elementMatchers.push( cached );
+			}
+		}
+
+		// Cache the compiled function
+		cached = compilerCache(
+			selector,
+			matcherFromGroupMatchers( elementMatchers, setMatchers )
+		);
+
+		// Save selector and tokenization
+		cached.selector = selector;
+	}
+	return cached;
+};
+
+/**
+ * A low-level selection function that works with Sizzle's compiled
+ *  selector functions
+ * @param {String|Function} selector A selector or a pre-compiled
+ *  selector function built with Sizzle.compile
+ * @param {Element} context
+ * @param {Array} [results]
+ * @param {Array} [seed] A set of elements to match against
+ */
+select = Sizzle.select = function( selector, context, results, seed ) {
+	var i, tokens, token, type, find,
+		compiled = typeof selector === "function" && selector,
+		match = !seed && tokenize( ( selector = compiled.selector || selector ) );
+
+	results = results || [];
+
+	// Try to minimize operations if there is only one selector in the list and no seed
+	// (the latter of which guarantees us context)
+	if ( match.length === 1 ) {
+
+		// Reduce context if the leading compound selector is an ID
+		tokens = match[ 0 ] = match[ 0 ].slice( 0 );
+		if ( tokens.length > 2 && ( token = tokens[ 0 ] ).type === "ID" &&
+			context.nodeType === 9 && documentIsHTML && Expr.relative[ tokens[ 1 ].type ] ) {
+
+			context = ( Expr.find[ "ID" ]( token.matches[ 0 ]
+				.replace( runescape, funescape ), context ) || [] )[ 0 ];
+			if ( !context ) {
+				return results;
+
+			// Precompiled matchers will still verify ancestry, so step up a level
+			} else if ( compiled ) {
+				context = context.parentNode;
+			}
+
+			selector = selector.slice( tokens.shift().value.length );
+		}
+
+		// Fetch a seed set for right-to-left matching
+		i = matchExpr[ "needsContext" ].test( selector ) ? 0 : tokens.length;
+		while ( i-- ) {
+			token = tokens[ i ];
+
+			// Abort if we hit a combinator
+			if ( Expr.relative[ ( type = token.type ) ] ) {
+				break;
+			}
+			if ( ( find = Expr.find[ type ] ) ) {
+
+				// Search, expanding context for leading sibling combinators
+				if ( ( seed = find(
+					token.matches[ 0 ].replace( runescape, funescape ),
+					rsibling.test( tokens[ 0 ].type ) && testContext( context.parentNode ) ||
+						context
+				) ) ) {
+
+					// If seed is empty or no tokens remain, we can return early
+					tokens.splice( i, 1 );
+					selector = seed.length && toSelector( tokens );
+					if ( !selector ) {
+						push.apply( results, seed );
+						return results;
+					}
+
+					break;
+				}
+			}
+		}
+	}
+
+	// Compile and execute a filtering function if one is not provided
+	// Provide `match` to avoid retokenization if we modified the selector above
+	( compiled || compile( selector, match ) )(
+		seed,
+		context,
+		!documentIsHTML,
+		results,
+		!context || rsibling.test( selector ) && testContext( context.parentNode ) || context
+	);
+	return results;
+};
+
+// One-time assignments
+
+// Sort stability
+support.sortStable = expando.split( "" ).sort( sortOrder ).join( "" ) === expando;
+
+// Support: Chrome 14-35+
+// Always assume duplicates if they aren't passed to the comparison function
+support.detectDuplicates = !!hasDuplicate;
+
+// Initialize against the default document
+setDocument();
+
+// Support: Webkit<537.32 - Safari 6.0.3/Chrome 25 (fixed in Chrome 27)
+// Detached nodes confoundingly follow *each other*
+support.sortDetached = assert( function( el ) {
+
+	// Should return 1, but returns 4 (following)
+	return el.compareDocumentPosition( document.createElement( "fieldset" ) ) & 1;
+} );
+
+// Support: IE<8
+// Prevent attribute/property "interpolation"
+// https://msdn.microsoft.com/en-us/library/ms536429%28VS.85%29.aspx
+if ( !assert( function( el ) {
+	el.innerHTML = "<a href='#'></a>";
+	return el.firstChild.getAttribute( "href" ) === "#";
+} ) ) {
+	addHandle( "type|href|height|width", function( elem, name, isXML ) {
+		if ( !isXML ) {
+			return elem.getAttribute( name, name.toLowerCase() === "type" ? 1 : 2 );
+		}
+	} );
+}
+
+// Support: IE<9
+// Use defaultValue in place of getAttribute("value")
+if ( !support.attributes || !assert( function( el ) {
+	el.innerHTML = "<input/>";
+	el.firstChild.setAttribute( "value", "" );
+	return el.firstChild.getAttribute( "value" ) === "";
+} ) ) {
+	addHandle( "value", function( elem, _name, isXML ) {
+		if ( !isXML && elem.nodeName.toLowerCase() === "input" ) {
+			return elem.defaultValue;
+		}
+	} );
+}
+
+// Support: IE<9
+// Use getAttributeNode to fetch booleans when getAttribute lies
+if ( !assert( function( el ) {
+	return el.getAttribute( "disabled" ) == null;
+} ) ) {
+	addHandle( booleans, function( elem, name, isXML ) {
+		var val;
+		if ( !isXML ) {
+			return elem[ name ] === true ? name.toLowerCase() :
+				( val = elem.getAttributeNode( name ) ) && val.specified ?
+					val.value :
+					null;
+		}
+	} );
+}
+
+return Sizzle;
+
+} )( window );
+
+
+
+jQuery.find = Sizzle;
+jQuery.expr = Sizzle.selectors;
+
+// Deprecated
+jQuery.expr[ ":" ] = jQuery.expr.pseudos;
+jQuery.uniqueSort = jQuery.unique = Sizzle.uniqueSort;
+jQuery.text = Sizzle.getText;
+jQuery.isXMLDoc = Sizzle.isXML;
+jQuery.contains = Sizzle.contains;
+jQuery.escapeSelector = Sizzle.escape;
+
+
+
+
+var dir = function( elem, dir, until ) {
+	var matched = [],
+		truncate = until !== undefined;
+
+	while ( ( elem = elem[ dir ] ) && elem.nodeType !== 9 ) {
+		if ( elem.nodeType === 1 ) {
+			if ( truncate && jQuery( elem ).is( until ) ) {
+				break;
+			}
+			matched.push( elem );
+		}
+	}
+	return matched;
+};
+
+
+var siblings = function( n, elem ) {
+	var matched = [];
+
+	for ( ; n; n = n.nextSibling ) {
+		if ( n.nodeType === 1 && n !== elem ) {
+			matched.push( n );
+		}
+	}
+
+	return matched;
+};
+
+
+var rneedsContext = jQuery.expr.match.needsContext;
+
+
+
+function nodeName( elem, name ) {
+
+	return elem.nodeName && elem.nodeName.toLowerCase() === name.toLowerCase();
+
+}
+var rsingleTag = ( /^<([a-z][^\/\0>:\x20\t\r\n\f]*)[\x20\t\r\n\f]*\/?>(?:<\/\1>|)$/i );
+
+
+
+// Implement the identical functionality for filter and not
+function winnow( elements, qualifier, not ) {
+	if ( isFunction( qualifier ) ) {
+		return jQuery.grep( elements, function( elem, i ) {
+			return !!qualifier.call( elem, i, elem ) !== not;
+		} );
+	}
+
+	// Single element
+	if ( qualifier.nodeType ) {
+		return jQuery.grep( elements, function( elem ) {
+			return ( elem === qualifier ) !== not;
+		} );
+	}
+
+	// Arraylike of elements (jQuery, arguments, Array)
+	if ( typeof qualifier !== "string" ) {
+		return jQuery.grep( elements, function( elem ) {
+			return ( indexOf.call( qualifier, elem ) > -1 ) !== not;
+		} );
+	}
+
+	// Filtered directly for both simple and complex selectors
+	return jQuery.filter( qualifier, elements, not );
+}
+
+jQuery.filter = function( expr, elems, not ) {
+	var elem = elems[ 0 ];
+
+	if ( not ) {
+		expr = ":not(" + expr + ")";
+	}
+
+	if ( elems.length === 1 && elem.nodeType === 1 ) {
+		return jQuery.find.matchesSelector( elem, expr ) ? [ elem ] : [];
+	}
+
+	return jQuery.find.matches( expr, jQuery.grep( elems, function( elem ) {
+		return elem.nodeType === 1;
+	} ) );
+};
+
+jQuery.fn.extend( {
+	find: function( selector ) {
+		var i, ret,
+			len = this.length,
+			self = this;
+
+		if ( typeof selector !== "string" ) {
+			return this.pushStack( jQuery( selector ).filter( function() {
+				for ( i = 0; i < len; i++ ) {
+					if ( jQuery.contains( self[ i ], this ) ) {
+						return true;
+					}
+				}
+			} ) );
+		}
+
+		ret = this.pushStack( [] );
+
+		for ( i = 0; i < len; i++ ) {
+			jQuery.find( selector, self[ i ], ret );
+		}
+
+		return len > 1 ? jQuery.uniqueSort( ret ) : ret;
+	},
+	filter: function( selector ) {
+		return this.pushStack( winnow( this, selector || [], false ) );
+	},
+	not: function( selector ) {
+		return this.pushStack( winnow( this, selector || [], true ) );
+	},
+	is: function( selector ) {
+		return !!winnow(
+			this,
+
+			// If this is a positional/relative selector, check membership in the returned set
+			// so $("p:first").is("p:last") won't return true for a doc with two "p".
+			typeof selector === "string" && rneedsContext.test( selector ) ?
+				jQuery( selector ) :
+				selector || [],
+			false
+		).length;
+	}
+} );
+
+
+// Initialize a jQuery object
+
+
+// A central reference to the root jQuery(document)
+var rootjQuery,
+
+	// A simple way to check for HTML strings
+	// Prioritize #id over <tag> to avoid XSS via location.hash (#9521)
+	// Strict HTML recognition (#11290: must start with <)
+	// Shortcut simple #id case for speed
+	rquickExpr = /^(?:\s*(<[\w\W]+>)[^>]*|#([\w-]+))$/,
+
+	init = jQuery.fn.init = function( selector, context, root ) {
+		var match, elem;
+
+		// HANDLE: $(""), $(null), $(undefined), $(false)
+		if ( !selector ) {
+			return this;
+		}
+
+		// Method init() accepts an alternate rootjQuery
+		// so migrate can support jQuery.sub (gh-2101)
+		root = root || rootjQuery;
+
+		// Handle HTML strings
+		if ( typeof selector === "string" ) {
+			if ( selector[ 0 ] === "<" &&
+				selector[ selector.length - 1 ] === ">" &&
+				selector.length >= 3 ) {
+
+				// Assume that strings that start and end with <> are HTML and skip the regex check
+				match = [ null, selector, null ];
+
+			} else {
+				match = rquickExpr.exec( selector );
+			}
+
+			// Match html or make sure no context is specified for #id
+			if ( match && ( match[ 1 ] || !context ) ) {
+
+				// HANDLE: $(html) -> $(array)
+				if ( match[ 1 ] ) {
+					context = context instanceof jQuery ? context[ 0 ] : context;
+
+					// Option to run scripts is true for back-compat
+					// Intentionally let the error be thrown if parseHTML is not present
+					jQuery.merge( this, jQuery.parseHTML(
+						match[ 1 ],
+						context && context.nodeType ? context.ownerDocument || context : document,
+						true
+					) );
+
+					// HANDLE: $(html, props)
+					if ( rsingleTag.test( match[ 1 ] ) && jQuery.isPlainObject( context ) ) {
+						for ( match in context ) {
+
+							// Properties of context are called as methods if possible
+							if ( isFunction( this[ match ] ) ) {
+								this[ match ]( context[ match ] );
+
+							// ...and otherwise set as attributes
+							} else {
+								this.attr( match, context[ match ] );
+							}
+						}
+					}
+
+					return this;
+
+				// HANDLE: $(#id)
+				} else {
+					elem = document.getElementById( match[ 2 ] );
+
+					if ( elem ) {
+
+						// Inject the element directly into the jQuery object
+						this[ 0 ] = elem;
+						this.length = 1;
+					}
+					return this;
+				}
+
+			// HANDLE: $(expr, $(...))
+			} else if ( !context || context.jquery ) {
+				return ( context || root ).find( selector );
+
+			// HANDLE: $(expr, context)
+			// (which is just equivalent to: $(context).find(expr)
+			} else {
+				return this.constructor( context ).find( selector );
+			}
+
+		// HANDLE: $(DOMElement)
+		} else if ( selector.nodeType ) {
+			this[ 0 ] = selector;
+			this.length = 1;
+			return this;
+
+		// HANDLE: $(function)
+		// Shortcut for document ready
+		} else if ( isFunction( selector ) ) {
+			return root.ready !== undefined ?
+				root.ready( selector ) :
+
+				// Execute immediately if ready is not present
+				selector( jQuery );
+		}
+
+		return jQuery.makeArray( selector, this );
+	};
+
+// Give the init function the jQuery prototype for later instantiation
+init.prototype = jQuery.fn;
+
+// Initialize central reference
+rootjQuery = jQuery( document );
+
+
+var rparentsprev = /^(?:parents|prev(?:Until|All))/,
+
+	// Methods guaranteed to produce a unique set when starting from a unique set
+	guaranteedUnique = {
+		children: true,
+		contents: true,
+		next: true,
+		prev: true
+	};
+
+jQuery.fn.extend( {
+	has: function( target ) {
+		var targets = jQuery( target, this ),
+			l = targets.length;
+
+		return this.filter( function() {
+			var i = 0;
+			for ( ; i < l; i++ ) {
+				if ( jQuery.contains( this, targets[ i ] ) ) {
+					return true;
+				}
+			}
+		} );
+	},
+
+	closest: function( selectors, context ) {
+		var cur,
+			i = 0,
+			l = this.length,
+			matched = [],
+			targets = typeof selectors !== "string" && jQuery( selectors );
+
+		// Positional selectors never match, since there's no _selection_ context
+		if ( !rneedsContext.test( selectors ) ) {
+			for ( ; i < l; i++ ) {
+				for ( cur = this[ i ]; cur && cur !== context; cur = cur.parentNode ) {
+
+					// Always skip document fragments
+					if ( cur.nodeType < 11 && ( targets ?
+						targets.index( cur ) > -1 :
+
+						// Don't pass non-elements to Sizzle
+						cur.nodeType === 1 &&
+							jQuery.find.matchesSelector( cur, selectors ) ) ) {
+
+						matched.push( cur );
+						break;
+					}
+				}
+			}
+		}
+
+		return this.pushStack( matched.length > 1 ? jQuery.uniqueSort( matched ) : matched );
+	},
+
+	// Determine the position of an element within the set
+	index: function( elem ) {
+
+		// No argument, return index in parent
+		if ( !elem ) {
+			return ( this[ 0 ] && this[ 0 ].parentNode ) ? this.first().prevAll().length : -1;
+		}
+
+		// Index in selector
+		if ( typeof elem === "string" ) {
+			return indexOf.call( jQuery( elem ), this[ 0 ] );
+		}
+
+		// Locate the position of the desired element
+		return indexOf.call( this,
+
+			// If it receives a jQuery object, the first element is used
+			elem.jquery ? elem[ 0 ] : elem
+		);
+	},
+
+	add: function( selector, context ) {
+		return this.pushStack(
+			jQuery.uniqueSort(
+				jQuery.merge( this.get(), jQuery( selector, context ) )
+			)
+		);
+	},
+
+	addBack: function( selector ) {
+		return this.add( selector == null ?
+			this.prevObject : this.prevObject.filter( selector )
+		);
+	}
+} );
+
+function sibling( cur, dir ) {
+	while ( ( cur = cur[ dir ] ) && cur.nodeType !== 1 ) {}
+	return cur;
+}
+
+jQuery.each( {
+	parent: function( elem ) {
+		var parent = elem.parentNode;
+		return parent && parent.nodeType !== 11 ? parent : null;
+	},
+	parents: function( elem ) {
+		return dir( elem, "parentNode" );
+	},
+	parentsUntil: function( elem, _i, until ) {
+		return dir( elem, "parentNode", until );
+	},
+	next: function( elem ) {
+		return sibling( elem, "nextSibling" );
+	},
+	prev: function( elem ) {
+		return sibling( elem, "previousSibling" );
+	},
+	nextAll: function( elem ) {
+		return dir( elem, "nextSibling" );
+	},
+	prevAll: function( elem ) {
+		return dir( elem, "previousSibling" );
+	},
+	nextUntil: function( elem, _i, until ) {
+		return dir( elem, "nextSibling", until );
+	},
+	prevUntil: function( elem, _i, until ) {
+		return dir( elem, "previousSibling", until );
+	},
+	siblings: function( elem ) {
+		return siblings( ( elem.parentNode || {} ).firstChild, elem );
+	},
+	children: function( elem ) {
+		return siblings( elem.firstChild );
+	},
+	contents: function( elem ) {
+		if ( elem.contentDocument != null &&
+
+			// Support: IE 11+
+			// <object> elements with no `data` attribute has an object
+			// `contentDocument` with a `null` prototype.
+			getProto( elem.contentDocument ) ) {
+
+			return elem.contentDocument;
+		}
+
+		// Support: IE 9 - 11 only, iOS 7 only, Android Browser <=4.3 only
+		// Treat the template element as a regular one in browsers that
+		// don't support it.
+		if ( nodeName( elem, "template" ) ) {
+			elem = elem.content || elem;
+		}
+
+		return jQuery.merge( [], elem.childNodes );
+	}
+}, function( name, fn ) {
+	jQuery.fn[ name ] = function( until, selector ) {
+		var matched = jQuery.map( this, fn, until );
+
+		if ( name.slice( -5 ) !== "Until" ) {
+			selector = until;
+		}
+
+		if ( selector && typeof selector === "string" ) {
+			matched = jQuery.filter( selector, matched );
+		}
+
+		if ( this.length > 1 ) {
+
+			// Remove duplicates
+			if ( !guaranteedUnique[ name ] ) {
+				jQuery.uniqueSort( matched );
+			}
+
+			// Reverse order for parents* and prev-derivatives
+			if ( rparentsprev.test( name ) ) {
+				matched.reverse();
+			}
+		}
+
+		return this.pushStack( matched );
+	};
+} );
+var rnothtmlwhite = ( /[^\x20\t\r\n\f]+/g );
+
+
+
+// Convert String-formatted options into Object-formatted ones
+function createOptions( options ) {
+	var object = {};
+	jQuery.each( options.match( rnothtmlwhite ) || [], function( _, flag ) {
+		object[ flag ] = true;
+	} );
+	return object;
+}
+
+/*
+ * Create a callback list using the following parameters:
+ *
+ *	options: an optional list of space-separated options that will change how
+ *			the callback list behaves or a more traditional option object
+ *
+ * By default a callback list will act like an event callback list and can be
+ * "fired" multiple times.
+ *
+ * Possible options:
+ *
+ *	once:			will ensure the callback list can only be fired once (like a Deferred)
+ *
+ *	memory:			will keep track of previous values and will call any callback added
+ *					after the list has been fired right away with the latest "memorized"
+ *					values (like a Deferred)
+ *
+ *	unique:			will ensure a callback can only be added once (no duplicate in the list)
+ *
+ *	stopOnFalse:	interrupt callings when a callback returns false
+ *
+ */
+jQuery.Callbacks = function( options ) {
+
+	// Convert options from String-formatted to Object-formatted if needed
+	// (we check in cache first)
+	options = typeof options === "string" ?
+		createOptions( options ) :
+		jQuery.extend( {}, options );
+
+	var // Flag to know if list is currently firing
+		firing,
+
+		// Last fire value for non-forgettable lists
+		memory,
+
+		// Flag to know if list was already fired
+		fired,
+
+		// Flag to prevent firing
+		locked,
+
+		// Actual callback list
+		list = [],
+
+		// Queue of execution data for repeatable lists
+		queue = [],
+
+		// Index of currently firing callback (modified by add/remove as needed)
+		firingIndex = -1,
+
+		// Fire callbacks
+		fire = function() {
+
+			// Enforce single-firing
+			locked = locked || options.once;
+
+			// Execute callbacks for all pending executions,
+			// respecting firingIndex overrides and runtime changes
+			fired = firing = true;
+			for ( ; queue.length; firingIndex = -1 ) {
+				memory = queue.shift();
+				while ( ++firingIndex < list.length ) {
+
+					// Run callback and check for early termination
+					if ( list[ firingIndex ].apply( memory[ 0 ], memory[ 1 ] ) === false &&
+						options.stopOnFalse ) {
+
+						// Jump to end and forget the data so .add doesn't re-fire
+						firingIndex = list.length;
+						memory = false;
+					}
+				}
+			}
+
+			// Forget the data if we're done with it
+			if ( !options.memory ) {
+				memory = false;
+			}
+
+			firing = false;
+
+			// Clean up if we're done firing for good
+			if ( locked ) {
+
+				// Keep an empty list if we have data for future add calls
+				if ( memory ) {
+					list = [];
+
+				// Otherwise, this object is spent
+				} else {
+					list = "";
+				}
+			}
+		},
+
+		// Actual Callbacks object
+		self = {
+
+			// Add a callback or a collection of callbacks to the list
+			add: function() {
+				if ( list ) {
+
+					// If we have memory from a past run, we should fire after adding
+					if ( memory && !firing ) {
+						firingIndex = list.length - 1;
+						queue.push( memory );
+					}
+
+					( function add( args ) {
+						jQuery.each( args, function( _, arg ) {
+							if ( isFunction( arg ) ) {
+								if ( !options.unique || !self.has( arg ) ) {
+									list.push( arg );
+								}
+							} else if ( arg && arg.length && toType( arg ) !== "string" ) {
+
+								// Inspect recursively
+								add( arg );
+							}
+						} );
+					} )( arguments );
+
+					if ( memory && !firing ) {
+						fire();
+					}
+				}
+				return this;
+			},
+
+			// Remove a callback from the list
+			remove: function() {
+				jQuery.each( arguments, function( _, arg ) {
+					var index;
+					while ( ( index = jQuery.inArray( arg, list, index ) ) > -1 ) {
+						list.splice( index, 1 );
+
+						// Handle firing indexes
+						if ( index <= firingIndex ) {
+							firingIndex--;
+						}
+					}
+				} );
+				return this;
+			},
+
+			// Check if a given callback is in the list.
+			// If no argument is given, return whether or not list has callbacks attached.
+			has: function( fn ) {
+				return fn ?
+					jQuery.inArray( fn, list ) > -1 :
+					list.length > 0;
+			},
+
+			// Remove all callbacks from the list
+			empty: function() {
+				if ( list ) {
+					list = [];
+				}
+				return this;
+			},
+
+			// Disable .fire and .add
+			// Abort any current/pending executions
+			// Clear all callbacks and values
+			disable: function() {
+				locked = queue = [];
+				list = memory = "";
+				return this;
+			},
+			disabled: function() {
+				return !list;
+			},
+
+			// Disable .fire
+			// Also disable .add unless we have memory (since it would have no effect)
+			// Abort any pending executions
+			lock: function() {
+				locked = queue = [];
+				if ( !memory && !firing ) {
+					list = memory = "";
+				}
+				return this;
+			},
+			locked: function() {
+				return !!locked;
+			},
+
+			// Call all callbacks with the given context and arguments
+			fireWith: function( context, args ) {
+				if ( !locked ) {
+					args = args || [];
+					args = [ context, args.slice ? args.slice() : args ];
+					queue.push( args );
+					if ( !firing ) {
+						fire();
+					}
+				}
+				return this;
+			},
+
+			// Call all the callbacks with the given arguments
+			fire: function() {
+				self.fireWith( this, arguments );
+				return this;
+			},
+
+			// To know if the callbacks have already been called at least once
+			fired: function() {
+				return !!fired;
+			}
+		};
+
+	return self;
+};
+
+
+function Identity( v ) {
+	return v;
+}
+function Thrower( ex ) {
+	throw ex;
+}
+
+function adoptValue( value, resolve, reject, noValue ) {
+	var method;
+
+	try {
+
+		// Check for promise aspect first to privilege synchronous behavior
+		if ( value && isFunction( ( method = value.promise ) ) ) {
+			method.call( value ).done( resolve ).fail( reject );
+
+		// Other thenables
+		} else if ( value && isFunction( ( method = value.then ) ) ) {
+			method.call( value, resolve, reject );
+
+		// Other non-thenables
+		} else {
+
+			// Control `resolve` arguments by letting Array#slice cast boolean `noValue` to integer:
+			// * false: [ value ].slice( 0 ) => resolve( value )
+			// * true: [ value ].slice( 1 ) => resolve()
+			resolve.apply( undefined, [ value ].slice( noValue ) );
+		}
+
+	// For Promises/A+, convert exceptions into rejections
+	// Since jQuery.when doesn't unwrap thenables, we can skip the extra checks appearing in
+	// Deferred#then to conditionally suppress rejection.
+	} catch ( value ) {
+
+		// Support: Android 4.0 only
+		// Strict mode functions invoked without .call/.apply get global-object context
+		reject.apply( undefined, [ value ] );
+	}
+}
+
+jQuery.extend( {
+
+	Deferred: function( func ) {
+		var tuples = [
+
+				// action, add listener, callbacks,
+				// ... .then handlers, argument index, [final state]
+				[ "notify", "progress", jQuery.Callbacks( "memory" ),
+					jQuery.Callbacks( "memory" ), 2 ],
+				[ "resolve", "done", jQuery.Callbacks( "once memory" ),
+					jQuery.Callbacks( "once memory" ), 0, "resolved" ],
+				[ "reject", "fail", jQuery.Callbacks( "once memory" ),
+					jQuery.Callbacks( "once memory" ), 1, "rejected" ]
+			],
+			state = "pending",
+			promise = {
+				state: function() {
+					return state;
+				},
+				always: function() {
+					deferred.done( arguments ).fail( arguments );
+					return this;
+				},
+				"catch": function( fn ) {
+					return promise.then( null, fn );
+				},
+
+				// Keep pipe for back-compat
+				pipe: function( /* fnDone, fnFail, fnProgress */ ) {
+					var fns = arguments;
+
+					return jQuery.Deferred( function( newDefer ) {
+						jQuery.each( tuples, function( _i, tuple ) {
+
+							// Map tuples (progress, done, fail) to arguments (done, fail, progress)
+							var fn = isFunction( fns[ tuple[ 4 ] ] ) && fns[ tuple[ 4 ] ];
+
+							// deferred.progress(function() { bind to newDefer or newDefer.notify })
+							// deferred.done(function() { bind to newDefer or newDefer.resolve })
+							// deferred.fail(function() { bind to newDefer or newDefer.reject })
+							deferred[ tuple[ 1 ] ]( function() {
+								var returned = fn && fn.apply( this, arguments );
+								if ( returned && isFunction( returned.promise ) ) {
+									returned.promise()
+										.progress( newDefer.notify )
+										.done( newDefer.resolve )
+										.fail( newDefer.reject );
+								} else {
+									newDefer[ tuple[ 0 ] + "With" ](
+										this,
+										fn ? [ returned ] : arguments
+									);
+								}
+							} );
+						} );
+						fns = null;
+					} ).promise();
+				},
+				then: function( onFulfilled, onRejected, onProgress ) {
+					var maxDepth = 0;
+					function resolve( depth, deferred, handler, special ) {
+						return function() {
+							var that = this,
+								args = arguments,
+								mightThrow = function() {
+									var returned, then;
+
+									// Support: Promises/A+ section 2.3.3.3.3
+									// https://promisesaplus.com/#point-59
+									// Ignore double-resolution attempts
+									if ( depth < maxDepth ) {
+										return;
+									}
+
+									returned = handler.apply( that, args );
+
+									// Support: Promises/A+ section 2.3.1
+									// https://promisesaplus.com/#point-48
+									if ( returned === deferred.promise() ) {
+										throw new TypeError( "Thenable self-resolution" );
+									}
+
+									// Support: Promises/A+ sections 2.3.3.1, 3.5
+									// https://promisesaplus.com/#point-54
+									// https://promisesaplus.com/#point-75
+									// Retrieve `then` only once
+									then = returned &&
+
+										// Support: Promises/A+ section 2.3.4
+										// https://promisesaplus.com/#point-64
+										// Only check objects and functions for thenability
+										( typeof returned === "object" ||
+											typeof returned === "function" ) &&
+										returned.then;
+
+									// Handle a returned thenable
+									if ( isFunction( then ) ) {
+
+										// Special processors (notify) just wait for resolution
+										if ( special ) {
+											then.call(
+												returned,
+												resolve( maxDepth, deferred, Identity, special ),
+												resolve( maxDepth, deferred, Thrower, special )
+											);
+
+										// Normal processors (resolve) also hook into progress
+										} else {
+
+											// ...and disregard older resolution values
+											maxDepth++;
+
+											then.call(
+												returned,
+												resolve( maxDepth, deferred, Identity, special ),
+												resolve( maxDepth, deferred, Thrower, special ),
+												resolve( maxDepth, deferred, Identity,
+													deferred.notifyWith )
+											);
+										}
+
+									// Handle all other returned values
+									} else {
+
+										// Only substitute handlers pass on context
+										// and multiple values (non-spec behavior)
+										if ( handler !== Identity ) {
+											that = undefined;
+											args = [ returned ];
+										}
+
+										// Process the value(s)
+										// Default process is resolve
+										( special || deferred.resolveWith )( that, args );
+									}
+								},
+
+								// Only normal processors (resolve) catch and reject exceptions
+								process = special ?
+									mightThrow :
+									function() {
+										try {
+											mightThrow();
+										} catch ( e ) {
+
+											if ( jQuery.Deferred.exceptionHook ) {
+												jQuery.Deferred.exceptionHook( e,
+													process.stackTrace );
+											}
+
+											// Support: Promises/A+ section 2.3.3.3.4.1
+											// https://promisesaplus.com/#point-61
+											// Ignore post-resolution exceptions
+											if ( depth + 1 >= maxDepth ) {
+
+												// Only substitute handlers pass on context
+												// and multiple values (non-spec behavior)
+												if ( handler !== Thrower ) {
+													that = undefined;
+													args = [ e ];
+												}
+
+												deferred.rejectWith( that, args );
+											}
+										}
+									};
+
+							// Support: Promises/A+ section 2.3.3.3.1
+							// https://promisesaplus.com/#point-57
+							// Re-resolve promises immediately to dodge false rejection from
+							// subsequent errors
+							if ( depth ) {
+								process();
+							} else {
+
+								// Call an optional hook to record the stack, in case of exception
+								// since it's otherwise lost when execution goes async
+								if ( jQuery.Deferred.getStackHook ) {
+									process.stackTrace = jQuery.Deferred.getStackHook();
+								}
+								window.setTimeout( process );
+							}
+						};
+					}
+
+					return jQuery.Deferred( function( newDefer ) {
+
+						// progress_handlers.add( ... )
+						tuples[ 0 ][ 3 ].add(
+							resolve(
+								0,
+								newDefer,
+								isFunction( onProgress ) ?
+									onProgress :
+									Identity,
+								newDefer.notifyWith
+							)
+						);
+
+						// fulfilled_handlers.add( ... )
+						tuples[ 1 ][ 3 ].add(
+							resolve(
+								0,
+								newDefer,
+								isFunction( onFulfilled ) ?
+									onFulfilled :
+									Identity
+							)
+						);
+
+						// rejected_handlers.add( ... )
+						tuples[ 2 ][ 3 ].add(
+							resolve(
+								0,
+								newDefer,
+								isFunction( onRejected ) ?
+									onRejected :
+									Thrower
+							)
+						);
+					} ).promise();
+				},
+
+				// Get a promise for this deferred
+				// If obj is provided, the promise aspect is added to the object
+				promise: function( obj ) {
+					return obj != null ? jQuery.extend( obj, promise ) : promise;
+				}
+			},
+			deferred = {};
+
+		// Add list-specific methods
+		jQuery.each( tuples, function( i, tuple ) {
+			var list = tuple[ 2 ],
+				stateString = tuple[ 5 ];
+
+			// promise.progress = list.add
+			// promise.done = list.add
+			// promise.fail = list.add
+			promise[ tuple[ 1 ] ] = list.add;
+
+			// Handle state
+			if ( stateString ) {
+				list.add(
+					function() {
+
+						// state = "resolved" (i.e., fulfilled)
+						// state = "rejected"
+						state = stateString;
+					},
+
+					// rejected_callbacks.disable
+					// fulfilled_callbacks.disable
+					tuples[ 3 - i ][ 2 ].disable,
+
+					// rejected_handlers.disable
+					// fulfilled_handlers.disable
+					tuples[ 3 - i ][ 3 ].disable,
+
+					// progress_callbacks.lock
+					tuples[ 0 ][ 2 ].lock,
+
+					// progress_handlers.lock
+					tuples[ 0 ][ 3 ].lock
+				);
+			}
+
+			// progress_handlers.fire
+			// fulfilled_handlers.fire
+			// rejected_handlers.fire
+			list.add( tuple[ 3 ].fire );
+
+			// deferred.notify = function() { deferred.notifyWith(...) }
+			// deferred.resolve = function() { deferred.resolveWith(...) }
+			// deferred.reject = function() { deferred.rejectWith(...) }
+			deferred[ tuple[ 0 ] ] = function() {
+				deferred[ tuple[ 0 ] + "With" ]( this === deferred ? undefined : this, arguments );
+				return this;
+			};
+
+			// deferred.notifyWith = list.fireWith
+			// deferred.resolveWith = list.fireWith
+			// deferred.rejectWith = list.fireWith
+			deferred[ tuple[ 0 ] + "With" ] = list.fireWith;
+		} );
+
+		// Make the deferred a promise
+		promise.promise( deferred );
+
+		// Call given func if any
+		if ( func ) {
+			func.call( deferred, deferred );
+		}
+
+		// All done!
+		return deferred;
+	},
+
+	// Deferred helper
+	when: function( singleValue ) {
+		var
+
+			// count of uncompleted subordinates
+			remaining = arguments.length,
+
+			// count of unprocessed arguments
+			i = remaining,
+
+			// subordinate fulfillment data
+			resolveContexts = Array( i ),
+			resolveValues = slice.call( arguments ),
+
+			// the primary Deferred
+			primary = jQuery.Deferred(),
+
+			// subordinate callback factory
+			updateFunc = function( i ) {
+				return function( value ) {
+					resolveContexts[ i ] = this;
+					resolveValues[ i ] = arguments.length > 1 ? slice.call( arguments ) : value;
+					if ( !( --remaining ) ) {
+						primary.resolveWith( resolveContexts, resolveValues );
+					}
+				};
+			};
+
+		// Single- and empty arguments are adopted like Promise.resolve
+		if ( remaining <= 1 ) {
+			adoptValue( singleValue, primary.done( updateFunc( i ) ).resolve, primary.reject,
+				!remaining );
+
+			// Use .then() to unwrap secondary thenables (cf. gh-3000)
+			if ( primary.state() === "pending" ||
+				isFunction( resolveValues[ i ] && resolveValues[ i ].then ) ) {
+
+				return primary.then();
+			}
+		}
+
+		// Multiple arguments are aggregated like Promise.all array elements
+		while ( i-- ) {
+			adoptValue( resolveValues[ i ], updateFunc( i ), primary.reject );
+		}
+
+		return primary.promise();
+	}
+} );
+
+
+// These usually indicate a programmer mistake during development,
+// warn about them ASAP rather than swallowing them by default.
+var rerrorNames = /^(Eval|Internal|Range|Reference|Syntax|Type|URI)Error$/;
+
+jQuery.Deferred.exceptionHook = function( error, stack ) {
+
+	// Support: IE 8 - 9 only
+	// Console exists when dev tools are open, which can happen at any time
+	if ( window.console && window.console.warn && error && rerrorNames.test( error.name ) ) {
+		window.console.warn( "jQuery.Deferred exception: " + error.message, error.stack, stack );
+	}
+};
+
+
+
+
+jQuery.readyException = function( error ) {
+	window.setTimeout( function() {
+		throw error;
+	} );
+};
+
+
+
+
+// The deferred used on DOM ready
+var readyList = jQuery.Deferred();
+
+jQuery.fn.ready = function( fn ) {
+
+	readyList
+		.then( fn )
+
+		// Wrap jQuery.readyException in a function so that the lookup
+		// happens at the time of error handling instead of callback
+		// registration.
+		.catch( function( error ) {
+			jQuery.readyException( error );
+		} );
+
+	return this;
+};
+
+jQuery.extend( {
+
+	// Is the DOM ready to be used? Set to true once it occurs.
+	isReady: false,
+
+	// A counter to track how many items to wait for before
+	// the ready event fires. See #6781
+	readyWait: 1,
+
+	// Handle when the DOM is ready
+	ready: function( wait ) {
+
+		// Abort if there are pending holds or we're already ready
+		if ( wait === true ? --jQuery.readyWait : jQuery.isReady ) {
+			return;
+		}
+
+		// Remember that the DOM is ready
+		jQuery.isReady = true;
+
+		// If a normal DOM Ready event fired, decrement, and wait if need be
+		if ( wait !== true && --jQuery.readyWait > 0 ) {
+			return;
+		}
+
+		// If there are functions bound, to execute
+		readyList.resolveWith( document, [ jQuery ] );
+	}
+} );
+
+jQuery.ready.then = readyList.then;
+
+// The ready event handler and self cleanup method
+function completed() {
+	document.removeEventListener( "DOMContentLoaded", completed );
+	window.removeEventListener( "load", completed );
+	jQuery.ready();
+}
+
+// Catch cases where $(document).ready() is called
+// after the browser event has already occurred.
+// Support: IE <=9 - 10 only
+// Older IE sometimes signals "interactive" too soon
+if ( document.readyState === "complete" ||
+	( document.readyState !== "loading" && !document.documentElement.doScroll ) ) {
+
+	// Handle it asynchronously to allow scripts the opportunity to delay ready
+	window.setTimeout( jQuery.ready );
+
+} else {
+
+	// Use the handy event callback
+	document.addEventListener( "DOMContentLoaded", completed );
+
+	// A fallback to window.onload, that will always work
+	window.addEventListener( "load", completed );
+}
+
+
+
+
+// Multifunctional method to get and set values of a collection
+// The value/s can optionally be executed if it's a function
+var access = function( elems, fn, key, value, chainable, emptyGet, raw ) {
+	var i = 0,
+		len = elems.length,
+		bulk = key == null;
+
+	// Sets many values
+	if ( toType( key ) === "object" ) {
+		chainable = true;
+		for ( i in key ) {
+			access( elems, fn, i, key[ i ], true, emptyGet, raw );
+		}
+
+	// Sets one value
+	} else if ( value !== undefined ) {
+		chainable = true;
+
+		if ( !isFunction( value ) ) {
+			raw = true;
+		}
+
+		if ( bulk ) {
+
+			// Bulk operations run against the entire set
+			if ( raw ) {
+				fn.call( elems, value );
+				fn = null;
+
+			// ...except when executing function values
+			} else {
+				bulk = fn;
+				fn = function( elem, _key, value ) {
+					return bulk.call( jQuery( elem ), value );
+				};
+			}
+		}
+
+		if ( fn ) {
+			for ( ; i < len; i++ ) {
+				fn(
+					elems[ i ], key, raw ?
+						value :
+						value.call( elems[ i ], i, fn( elems[ i ], key ) )
+				);
+			}
+		}
+	}
+
+	if ( chainable ) {
+		return elems;
+	}
+
+	// Gets
+	if ( bulk ) {
+		return fn.call( elems );
+	}
+
+	return len ? fn( elems[ 0 ], key ) : emptyGet;
+};
+
+
+// Matches dashed string for camelizing
+var rmsPrefix = /^-ms-/,
+	rdashAlpha = /-([a-z])/g;
+
+// Used by camelCase as callback to replace()
+function fcamelCase( _all, letter ) {
+	return letter.toUpperCase();
+}
+
+// Convert dashed to camelCase; used by the css and data modules
+// Support: IE <=9 - 11, Edge 12 - 15
+// Microsoft forgot to hump their vendor prefix (#9572)
+function camelCase( string ) {
+	return string.replace( rmsPrefix, "ms-" ).replace( rdashAlpha, fcamelCase );
+}
+var acceptData = function( owner ) {
+
+	// Accepts only:
+	//  - Node
+	//    - Node.ELEMENT_NODE
+	//    - Node.DOCUMENT_NODE
+	//  - Object
+	//    - Any
+	return owner.nodeType === 1 || owner.nodeType === 9 || !( +owner.nodeType );
+};
+
+
+
+
+function Data() {
+	this.expando = jQuery.expando + Data.uid++;
+}
+
+Data.uid = 1;
+
+Data.prototype = {
+
+	cache: function( owner ) {
+
+		// Check if the owner object already has a cache
+		var value = owner[ this.expando ];
+
+		// If not, create one
+		if ( !value ) {
+			value = {};
+
+			// We can accept data for non-element nodes in modern browsers,
+			// but we should not, see #8335.
+			// Always return an empty object.
+			if ( acceptData( owner ) ) {
+
+				// If it is a node unlikely to be stringify-ed or looped over
+				// use plain assignment
+				if ( owner.nodeType ) {
+					owner[ this.expando ] = value;
+
+				// Otherwise secure it in a non-enumerable property
+				// configurable must be true to allow the property to be
+				// deleted when data is removed
+				} else {
+					Object.defineProperty( owner, this.expando, {
+						value: value,
+						configurable: true
+					} );
+				}
+			}
+		}
+
+		return value;
+	},
+	set: function( owner, data, value ) {
+		var prop,
+			cache = this.cache( owner );
+
+		// Handle: [ owner, key, value ] args
+		// Always use camelCase key (gh-2257)
+		if ( typeof data === "string" ) {
+			cache[ camelCase( data ) ] = value;
+
+		// Handle: [ owner, { properties } ] args
+		} else {
+
+			// Copy the properties one-by-one to the cache object
+			for ( prop in data ) {
+				cache[ camelCase( prop ) ] = data[ prop ];
+			}
+		}
+		return cache;
+	},
+	get: function( owner, key ) {
+		return key === undefined ?
+			this.cache( owner ) :
+
+			// Always use camelCase key (gh-2257)
+			owner[ this.expando ] && owner[ this.expando ][ camelCase( key ) ];
+	},
+	access: function( owner, key, value ) {
+
+		// In cases where either:
+		//
+		//   1. No key was specified
+		//   2. A string key was specified, but no value provided
+		//
+		// Take the "read" path and allow the get method to determine
+		// which value to return, respectively either:
+		//
+		//   1. The entire cache object
+		//   2. The data stored at the key
+		//
+		if ( key === undefined ||
+				( ( key && typeof key === "string" ) && value === undefined ) ) {
+
+			return this.get( owner, key );
+		}
+
+		// When the key is not a string, or both a key and value
+		// are specified, set or extend (existing objects) with either:
+		//
+		//   1. An object of properties
+		//   2. A key and value
+		//
+		this.set( owner, key, value );
+
+		// Since the "set" path can have two possible entry points
+		// return the expected data based on which path was taken[*]
+		return value !== undefined ? value : key;
+	},
+	remove: function( owner, key ) {
+		var i,
+			cache = owner[ this.expando ];
+
+		if ( cache === undefined ) {
+			return;
+		}
+
+		if ( key !== undefined ) {
+
+			// Support array or space separated string of keys
+			if ( Array.isArray( key ) ) {
+
+				// If key is an array of keys...
+				// We always set camelCase keys, so remove that.
+				key = key.map( camelCase );
+			} else {
+				key = camelCase( key );
+
+				// If a key with the spaces exists, use it.
+				// Otherwise, create an array by matching non-whitespace
+				key = key in cache ?
+					[ key ] :
+					( key.match( rnothtmlwhite ) || [] );
+			}
+
+			i = key.length;
+
+			while ( i-- ) {
+				delete cache[ key[ i ] ];
+			}
+		}
+
+		// Remove the expando if there's no more data
+		if ( key === undefined || jQuery.isEmptyObject( cache ) ) {
+
+			// Support: Chrome <=35 - 45
+			// Webkit & Blink performance suffers when deleting properties
+			// from DOM nodes, so set to undefined instead
+			// https://bugs.chromium.org/p/chromium/issues/detail?id=378607 (bug restricted)
+			if ( owner.nodeType ) {
+				owner[ this.expando ] = undefined;
+			} else {
+				delete owner[ this.expando ];
+			}
+		}
+	},
+	hasData: function( owner ) {
+		var cache = owner[ this.expando ];
+		return cache !== undefined && !jQuery.isEmptyObject( cache );
+	}
+};
+var dataPriv = new Data();
+
+var dataUser = new Data();
+
+
+
+//	Implementation Summary
+//
+//	1. Enforce API surface and semantic compatibility with 1.9.x branch
+//	2. Improve the module's maintainability by reducing the storage
+//		paths to a single mechanism.
+//	3. Use the same single mechanism to support "private" and "user" data.
+//	4. _Never_ expose "private" data to user code (TODO: Drop _data, _removeData)
+//	5. Avoid exposing implementation details on user objects (eg. expando properties)
+//	6. Provide a clear path for implementation upgrade to WeakMap in 2014
+
+var rbrace = /^(?:\{[\w\W]*\}|\[[\w\W]*\])$/,
+	rmultiDash = /[A-Z]/g;
+
+function getData( data ) {
+	if ( data === "true" ) {
+		return true;
+	}
+
+	if ( data === "false" ) {
+		return false;
+	}
+
+	if ( data === "null" ) {
+		return null;
+	}
+
+	// Only convert to a number if it doesn't change the string
+	if ( data === +data + "" ) {
+		return +data;
+	}
+
+	if ( rbrace.test( data ) ) {
+		return JSON.parse( data );
+	}
+
+	return data;
+}
+
+function dataAttr( elem, key, data ) {
+	var name;
+
+	// If nothing was found internally, try to fetch any
+	// data from the HTML5 data-* attribute
+	if ( data === undefined && elem.nodeType === 1 ) {
+		name = "data-" + key.replace( rmultiDash, "-$&" ).toLowerCase();
+		data = elem.getAttribute( name );
+
+		if ( typeof data === "string" ) {
+			try {
+				data = getData( data );
+			} catch ( e ) {}
+
+			// Make sure we set the data so it isn't changed later
+			dataUser.set( elem, key, data );
+		} else {
+			data = undefined;
+		}
+	}
+	return data;
+}
+
+jQuery.extend( {
+	hasData: function( elem ) {
+		return dataUser.hasData( elem ) || dataPriv.hasData( elem );
+	},
+
+	data: function( elem, name, data ) {
+		return dataUser.access( elem, name, data );
+	},
+
+	removeData: function( elem, name ) {
+		dataUser.remove( elem, name );
+	},
+
+	// TODO: Now that all calls to _data and _removeData have been replaced
+	// with direct calls to dataPriv methods, these can be deprecated.
+	_data: function( elem, name, data ) {
+		return dataPriv.access( elem, name, data );
+	},
+
+	_removeData: function( elem, name ) {
+		dataPriv.remove( elem, name );
+	}
+} );
+
+jQuery.fn.extend( {
+	data: function( key, value ) {
+		var i, name, data,
+			elem = this[ 0 ],
+			attrs = elem && elem.attributes;
+
+		// Gets all values
+		if ( key === undefined ) {
+			if ( this.length ) {
+				data = dataUser.get( elem );
+
+				if ( elem.nodeType === 1 && !dataPriv.get( elem, "hasDataAttrs" ) ) {
+					i = attrs.length;
+					while ( i-- ) {
+
+						// Support: IE 11 only
+						// The attrs elements can be null (#14894)
+						if ( attrs[ i ] ) {
+							name = attrs[ i ].name;
+							if ( name.indexOf( "data-" ) === 0 ) {
+								name = camelCase( name.slice( 5 ) );
+								dataAttr( elem, name, data[ name ] );
+							}
+						}
+					}
+					dataPriv.set( elem, "hasDataAttrs", true );
+				}
+			}
+
+			return data;
+		}
+
+		// Sets multiple values
+		if ( typeof key === "object" ) {
+			return this.each( function() {
+				dataUser.set( this, key );
+			} );
+		}
+
+		return access( this, function( value ) {
+			var data;
+
+			// The calling jQuery object (element matches) is not empty
+			// (and therefore has an element appears at this[ 0 ]) and the
+			// `value` parameter was not undefined. An empty jQuery object
+			// will result in `undefined` for elem = this[ 0 ] which will
+			// throw an exception if an attempt to read a data cache is made.
+			if ( elem && value === undefined ) {
+
+				// Attempt to get data from the cache
+				// The key will always be camelCased in Data
+				data = dataUser.get( elem, key );
+				if ( data !== undefined ) {
+					return data;
+				}
+
+				// Attempt to "discover" the data in
+				// HTML5 custom data-* attrs
+				data = dataAttr( elem, key );
+				if ( data !== undefined ) {
+					return data;
+				}
+
+				// We tried really hard, but the data doesn't exist.
+				return;
+			}
+
+			// Set the data...
+			this.each( function() {
+
+				// We always store the camelCased key
+				dataUser.set( this, key, value );
+			} );
+		}, null, value, arguments.length > 1, null, true );
+	},
+
+	removeData: function( key ) {
+		return this.each( function() {
+			dataUser.remove( this, key );
+		} );
+	}
+} );
+
+
+jQuery.extend( {
+	queue: function( elem, type, data ) {
+		var queue;
+
+		if ( elem ) {
+			type = ( type || "fx" ) + "queue";
+			queue = dataPriv.get( elem, type );
+
+			// Speed up dequeue by getting out quickly if this is just a lookup
+			if ( data ) {
+				if ( !queue || Array.isArray( data ) ) {
+					queue = dataPriv.access( elem, type, jQuery.makeArray( data ) );
+				} else {
+					queue.push( data );
+				}
+			}
+			return queue || [];
+		}
+	},
+
+	dequeue: function( elem, type ) {
+		type = type || "fx";
+
+		var queue = jQuery.queue( elem, type ),
+			startLength = queue.length,
+			fn = queue.shift(),
+			hooks = jQuery._queueHooks( elem, type ),
+			next = function() {
+				jQuery.dequeue( elem, type );
+			};
+
+		// If the fx queue is dequeued, always remove the progress sentinel
+		if ( fn === "inprogress" ) {
+			fn = queue.shift();
+			startLength--;
+		}
+
+		if ( fn ) {
+
+			// Add a progress sentinel to prevent the fx queue from being
+			// automatically dequeued
+			if ( type === "fx" ) {
+				queue.unshift( "inprogress" );
+			}
+
+			// Clear up the last queue stop function
+			delete hooks.stop;
+			fn.call( elem, next, hooks );
+		}
+
+		if ( !startLength && hooks ) {
+			hooks.empty.fire();
+		}
+	},
+
+	// Not public - generate a queueHooks object, or return the current one
+	_queueHooks: function( elem, type ) {
+		var key = type + "queueHooks";
+		return dataPriv.get( elem, key ) || dataPriv.access( elem, key, {
+			empty: jQuery.Callbacks( "once memory" ).add( function() {
+				dataPriv.remove( elem, [ type + "queue", key ] );
+			} )
+		} );
+	}
+} );
+
+jQuery.fn.extend( {
+	queue: function( type, data ) {
+		var setter = 2;
+
+		if ( typeof type !== "string" ) {
+			data = type;
+			type = "fx";
+			setter--;
+		}
+
+		if ( arguments.length < setter ) {
+			return jQuery.queue( this[ 0 ], type );
+		}
+
+		return data === undefined ?
+			this :
+			this.each( function() {
+				var queue = jQuery.queue( this, type, data );
+
+				// Ensure a hooks for this queue
+				jQuery._queueHooks( this, type );
+
+				if ( type === "fx" && queue[ 0 ] !== "inprogress" ) {
+					jQuery.dequeue( this, type );
+				}
+			} );
+	},
+	dequeue: function( type ) {
+		return this.each( function() {
+			jQuery.dequeue( this, type );
+		} );
+	},
+	clearQueue: function( type ) {
+		return this.queue( type || "fx", [] );
+	},
+
+	// Get a promise resolved when queues of a certain type
+	// are emptied (fx is the type by default)
+	promise: function( type, obj ) {
+		var tmp,
+			count = 1,
+			defer = jQuery.Deferred(),
+			elements = this,
+			i = this.length,
+			resolve = function() {
+				if ( !( --count ) ) {
+					defer.resolveWith( elements, [ elements ] );
+				}
+			};
+
+		if ( typeof type !== "string" ) {
+			obj = type;
+			type = undefined;
+		}
+		type = type || "fx";
+
+		while ( i-- ) {
+			tmp = dataPriv.get( elements[ i ], type + "queueHooks" );
+			if ( tmp && tmp.empty ) {
+				count++;
+				tmp.empty.add( resolve );
+			}
+		}
+		resolve();
+		return defer.promise( obj );
+	}
+} );
+var pnum = ( /[+-]?(?:\d*\.|)\d+(?:[eE][+-]?\d+|)/ ).source;
+
+var rcssNum = new RegExp( "^(?:([+-])=|)(" + pnum + ")([a-z%]*)$", "i" );
+
+
+var cssExpand = [ "Top", "Right", "Bottom", "Left" ];
+
+var documentElement = document.documentElement;
+
+
+
+	var isAttached = function( elem ) {
+			return jQuery.contains( elem.ownerDocument, elem );
+		},
+		composed = { composed: true };
+
+	// Support: IE 9 - 11+, Edge 12 - 18+, iOS 10.0 - 10.2 only
+	// Check attachment across shadow DOM boundaries when possible (gh-3504)
+	// Support: iOS 10.0-10.2 only
+	// Early iOS 10 versions support `attachShadow` but not `getRootNode`,
+	// leading to errors. We need to check for `getRootNode`.
+	if ( documentElement.getRootNode ) {
+		isAttached = function( elem ) {
+			return jQuery.contains( elem.ownerDocument, elem ) ||
+				elem.getRootNode( composed ) === elem.ownerDocument;
+		};
+	}
+var isHiddenWithinTree = function( elem, el ) {
+
+		// isHiddenWithinTree might be called from jQuery#filter function;
+		// in that case, element will be second argument
+		elem = el || elem;
+
+		// Inline style trumps all
+		return elem.style.display === "none" ||
+			elem.style.display === "" &&
+
+			// Otherwise, check computed style
+			// Support: Firefox <=43 - 45
+			// Disconnected elements can have computed display: none, so first confirm that elem is
+			// in the document.
+			isAttached( elem ) &&
+
+			jQuery.css( elem, "display" ) === "none";
+	};
+
+
+
+function adjustCSS( elem, prop, valueParts, tween ) {
+	var adjusted, scale,
+		maxIterations = 20,
+		currentValue = tween ?
+			function() {
+				return tween.cur();
+			} :
+			function() {
+				return jQuery.css( elem, prop, "" );
+			},
+		initial = currentValue(),
+		unit = valueParts && valueParts[ 3 ] || ( jQuery.cssNumber[ prop ] ? "" : "px" ),
+
+		// Starting value computation is required for potential unit mismatches
+		initialInUnit = elem.nodeType &&
+			( jQuery.cssNumber[ prop ] || unit !== "px" && +initial ) &&
+			rcssNum.exec( jQuery.css( elem, prop ) );
+
+	if ( initialInUnit && initialInUnit[ 3 ] !== unit ) {
+
+		// Support: Firefox <=54
+		// Halve the iteration target value to prevent interference from CSS upper bounds (gh-2144)
+		initial = initial / 2;
+
+		// Trust units reported by jQuery.css
+		unit = unit || initialInUnit[ 3 ];
+
+		// Iteratively approximate from a nonzero starting point
+		initialInUnit = +initial || 1;
+
+		while ( maxIterations-- ) {
+
+			// Evaluate and update our best guess (doubling guesses that zero out).
+			// Finish if the scale equals or crosses 1 (making the old*new product non-positive).
+			jQuery.style( elem, prop, initialInUnit + unit );
+			if ( ( 1 - scale ) * ( 1 - ( scale = currentValue() / initial || 0.5 ) ) <= 0 ) {
+				maxIterations = 0;
+			}
+			initialInUnit = initialInUnit / scale;
+
+		}
+
+		initialInUnit = initialInUnit * 2;
+		jQuery.style( elem, prop, initialInUnit + unit );
+
+		// Make sure we update the tween properties later on
+		valueParts = valueParts || [];
+	}
+
+	if ( valueParts ) {
+		initialInUnit = +initialInUnit || +initial || 0;
+
+		// Apply relative offset (+=/-=) if specified
+		adjusted = valueParts[ 1 ] ?
+			initialInUnit + ( valueParts[ 1 ] + 1 ) * valueParts[ 2 ] :
+			+valueParts[ 2 ];
+		if ( tween ) {
+			tween.unit = unit;
+			tween.start = initialInUnit;
+			tween.end = adjusted;
+		}
+	}
+	return adjusted;
+}
+
+
+var defaultDisplayMap = {};
+
+function getDefaultDisplay( elem ) {
+	var temp,
+		doc = elem.ownerDocument,
+		nodeName = elem.nodeName,
+		display = defaultDisplayMap[ nodeName ];
+
+	if ( display ) {
+		return display;
+	}
+
+	temp = doc.body.appendChild( doc.createElement( nodeName ) );
+	display = jQuery.css( temp, "display" );
+
+	temp.parentNode.removeChild( temp );
+
+	if ( display === "none" ) {
+		display = "block";
+	}
+	defaultDisplayMap[ nodeName ] = display;
+
+	return display;
+}
+
+function showHide( elements, show ) {
+	var display, elem,
+		values = [],
+		index = 0,
+		length = elements.length;
+
+	// Determine new display value for elements that need to change
+	for ( ; index < length; index++ ) {
+		elem = elements[ index ];
+		if ( !elem.style ) {
+			continue;
+		}
+
+		display = elem.style.display;
+		if ( show ) {
+
+			// Since we force visibility upon cascade-hidden elements, an immediate (and slow)
+			// check is required in this first loop unless we have a nonempty display value (either
+			// inline or about-to-be-restored)
+			if ( display === "none" ) {
+				values[ index ] = dataPriv.get( elem, "display" ) || null;
+				if ( !values[ index ] ) {
+					elem.style.display = "";
+				}
+			}
+			if ( elem.style.display === "" && isHiddenWithinTree( elem ) ) {
+				values[ index ] = getDefaultDisplay( elem );
+			}
+		} else {
+			if ( display !== "none" ) {
+				values[ index ] = "none";
+
+				// Remember what we're overwriting
+				dataPriv.set( elem, "display", display );
+			}
+		}
+	}
+
+	// Set the display of the elements in a second loop to avoid constant reflow
+	for ( index = 0; index < length; index++ ) {
+		if ( values[ index ] != null ) {
+			elements[ index ].style.display = values[ index ];
+		}
+	}
+
+	return elements;
+}
+
+jQuery.fn.extend( {
+	show: function() {
+		return showHide( this, true );
+	},
+	hide: function() {
+		return showHide( this );
+	},
+	toggle: function( state ) {
+		if ( typeof state === "boolean" ) {
+			return state ? this.show() : this.hide();
+		}
+
+		return this.each( function() {
+			if ( isHiddenWithinTree( this ) ) {
+				jQuery( this ).show();
+			} else {
+				jQuery( this ).hide();
+			}
+		} );
+	}
+} );
+var rcheckableType = ( /^(?:checkbox|radio)$/i );
+
+var rtagName = ( /<([a-z][^\/\0>\x20\t\r\n\f]*)/i );
+
+var rscriptType = ( /^$|^module$|\/(?:java|ecma)script/i );
+
+
+
+( function() {
+	var fragment = document.createDocumentFragment(),
+		div = fragment.appendChild( document.createElement( "div" ) ),
+		input = document.createElement( "input" );
+
+	// Support: Android 4.0 - 4.3 only
+	// Check state lost if the name is set (#11217)
+	// Support: Windows Web Apps (WWA)
+	// `name` and `type` must use .setAttribute for WWA (#14901)
+	input.setAttribute( "type", "radio" );
+	input.setAttribute( "checked", "checked" );
+	input.setAttribute( "name", "t" );
+
+	div.appendChild( input );
+
+	// Support: Android <=4.1 only
+	// Older WebKit doesn't clone checked state correctly in fragments
+	support.checkClone = div.cloneNode( true ).cloneNode( true ).lastChild.checked;
+
+	// Support: IE <=11 only
+	// Make sure textarea (and checkbox) defaultValue is properly cloned
+	div.innerHTML = "<textarea>x</textarea>";
+	support.noCloneChecked = !!div.cloneNode( true ).lastChild.defaultValue;
+
+	// Support: IE <=9 only
+	// IE <=9 replaces <option> tags with their contents when inserted outside of
+	// the select element.
+	div.innerHTML = "<option></option>";
+	support.option = !!div.lastChild;
+} )();
+
+
+// We have to close these tags to support XHTML (#13200)
+var wrapMap = {
+
+	// XHTML parsers do not magically insert elements in the
+	// same way that tag soup parsers do. So we cannot shorten
+	// this by omitting <tbody> or other required elements.
+	thead: [ 1, "<table>", "</table>" ],
+	col: [ 2, "<table><colgroup>", "</colgroup></table>" ],
+	tr: [ 2, "<table><tbody>", "</tbody></table>" ],
+	td: [ 3, "<table><tbody><tr>", "</tr></tbody></table>" ],
+
+	_default: [ 0, "", "" ]
+};
+
+wrapMap.tbody = wrapMap.tfoot = wrapMap.colgroup = wrapMap.caption = wrapMap.thead;
+wrapMap.th = wrapMap.td;
+
+// Support: IE <=9 only
+if ( !support.option ) {
+	wrapMap.optgroup = wrapMap.option = [ 1, "<select multiple='multiple'>", "</select>" ];
+}
+
+
+function getAll( context, tag ) {
+
+	// Support: IE <=9 - 11 only
+	// Use typeof to avoid zero-argument method invocation on host objects (#15151)
+	var ret;
+
+	if ( typeof context.getElementsByTagName !== "undefined" ) {
+		ret = context.getElementsByTagName( tag || "*" );
+
+	} else if ( typeof context.querySelectorAll !== "undefined" ) {
+		ret = context.querySelectorAll( tag || "*" );
+
+	} else {
+		ret = [];
+	}
+
+	if ( tag === undefined || tag && nodeName( context, tag ) ) {
+		return jQuery.merge( [ context ], ret );
+	}
+
+	return ret;
+}
+
+
+// Mark scripts as having already been evaluated
+function setGlobalEval( elems, refElements ) {
+	var i = 0,
+		l = elems.length;
+
+	for ( ; i < l; i++ ) {
+		dataPriv.set(
+			elems[ i ],
+			"globalEval",
+			!refElements || dataPriv.get( refElements[ i ], "globalEval" )
+		);
+	}
+}
+
+
+var rhtml = /<|&#?\w+;/;
+
+function buildFragment( elems, context, scripts, selection, ignored ) {
+	var elem, tmp, tag, wrap, attached, j,
+		fragment = context.createDocumentFragment(),
+		nodes = [],
+		i = 0,
+		l = elems.length;
+
+	for ( ; i < l; i++ ) {
+		elem = elems[ i ];
+
+		if ( elem || elem === 0 ) {
+
+			// Add nodes directly
+			if ( toType( elem ) === "object" ) {
+
+				// Support: Android <=4.0 only, PhantomJS 1 only
+				// push.apply(_, arraylike) throws on ancient WebKit
+				jQuery.merge( nodes, elem.nodeType ? [ elem ] : elem );
+
+			// Convert non-html into a text node
+			} else if ( !rhtml.test( elem ) ) {
+				nodes.push( context.createTextNode( elem ) );
+
+			// Convert html into DOM nodes
+			} else {
+				tmp = tmp || fragment.appendChild( context.createElement( "div" ) );
+
+				// Deserialize a standard representation
+				tag = ( rtagName.exec( elem ) || [ "", "" ] )[ 1 ].toLowerCase();
+				wrap = wrapMap[ tag ] || wrapMap._default;
+				tmp.innerHTML = wrap[ 1 ] + jQuery.htmlPrefilter( elem ) + wrap[ 2 ];
+
+				// Descend through wrappers to the right content
+				j = wrap[ 0 ];
+				while ( j-- ) {
+					tmp = tmp.lastChild;
+				}
+
+				// Support: Android <=4.0 only, PhantomJS 1 only
+				// push.apply(_, arraylike) throws on ancient WebKit
+				jQuery.merge( nodes, tmp.childNodes );
+
+				// Remember the top-level container
+				tmp = fragment.firstChild;
+
+				// Ensure the created nodes are orphaned (#12392)
+				tmp.textContent = "";
+			}
+		}
+	}
+
+	// Remove wrapper from fragment
+	fragment.textContent = "";
+
+	i = 0;
+	while ( ( elem = nodes[ i++ ] ) ) {
+
+		// Skip elements already in the context collection (trac-4087)
+		if ( selection && jQuery.inArray( elem, selection ) > -1 ) {
+			if ( ignored ) {
+				ignored.push( elem );
+			}
+			continue;
+		}
+
+		attached = isAttached( elem );
+
+		// Append to fragment
+		tmp = getAll( fragment.appendChild( elem ), "script" );
+
+		// Preserve script evaluation history
+		if ( attached ) {
+			setGlobalEval( tmp );
+		}
+
+		// Capture executables
+		if ( scripts ) {
+			j = 0;
+			while ( ( elem = tmp[ j++ ] ) ) {
+				if ( rscriptType.test( elem.type || "" ) ) {
+					scripts.push( elem );
+				}
+			}
+		}
+	}
+
+	return fragment;
+}
+
+
+var rtypenamespace = /^([^.]*)(?:\.(.+)|)/;
+
+function returnTrue() {
+	return true;
+}
+
+function returnFalse() {
+	return false;
+}
+
+// Support: IE <=9 - 11+
+// focus() and blur() are asynchronous, except when they are no-op.
+// So expect focus to be synchronous when the element is already active,
+// and blur to be synchronous when the element is not already active.
+// (focus and blur are always synchronous in other supported browsers,
+// this just defines when we can count on it).
+function expectSync( elem, type ) {
+	return ( elem === safeActiveElement() ) === ( type === "focus" );
+}
+
+// Support: IE <=9 only
+// Accessing document.activeElement can throw unexpectedly
+// https://bugs.jquery.com/ticket/13393
+function safeActiveElement() {
+	try {
+		return document.activeElement;
+	} catch ( err ) { }
+}
+
+function on( elem, types, selector, data, fn, one ) {
+	var origFn, type;
+
+	// Types can be a map of types/handlers
+	if ( typeof types === "object" ) {
+
+		// ( types-Object, selector, data )
+		if ( typeof selector !== "string" ) {
+
+			// ( types-Object, data )
+			data = data || selector;
+			selector = undefined;
+		}
+		for ( type in types ) {
+			on( elem, type, selector, data, types[ type ], one );
+		}
+		return elem;
+	}
+
+	if ( data == null && fn == null ) {
+
+		// ( types, fn )
+		fn = selector;
+		data = selector = undefined;
+	} else if ( fn == null ) {
+		if ( typeof selector === "string" ) {
+
+			// ( types, selector, fn )
+			fn = data;
+			data = undefined;
+		} else {
+
+			// ( types, data, fn )
+			fn = data;
+			data = selector;
+			selector = undefined;
+		}
+	}
+	if ( fn === false ) {
+		fn = returnFalse;
+	} else if ( !fn ) {
+		return elem;
+	}
+
+	if ( one === 1 ) {
+		origFn = fn;
+		fn = function( event ) {
+
+			// Can use an empty set, since event contains the info
+			jQuery().off( event );
+			return origFn.apply( this, arguments );
+		};
+
+		// Use same guid so caller can remove using origFn
+		fn.guid = origFn.guid || ( origFn.guid = jQuery.guid++ );
+	}
+	return elem.each( function() {
+		jQuery.event.add( this, types, fn, data, selector );
+	} );
+}
+
+/*
+ * Helper functions for managing events -- not part of the public interface.
+ * Props to Dean Edwards' addEvent library for many of the ideas.
+ */
+jQuery.event = {
+
+	global: {},
+
+	add: function( elem, types, handler, data, selector ) {
+
+		var handleObjIn, eventHandle, tmp,
+			events, t, handleObj,
+			special, handlers, type, namespaces, origType,
+			elemData = dataPriv.get( elem );
+
+		// Only attach events to objects that accept data
+		if ( !acceptData( elem ) ) {
+			return;
+		}
+
+		// Caller can pass in an object of custom data in lieu of the handler
+		if ( handler.handler ) {
+			handleObjIn = handler;
+			handler = handleObjIn.handler;
+			selector = handleObjIn.selector;
+		}
+
+		// Ensure that invalid selectors throw exceptions at attach time
+		// Evaluate against documentElement in case elem is a non-element node (e.g., document)
+		if ( selector ) {
+			jQuery.find.matchesSelector( documentElement, selector );
+		}
+
+		// Make sure that the handler has a unique ID, used to find/remove it later
+		if ( !handler.guid ) {
+			handler.guid = jQuery.guid++;
+		}
+
+		// Init the element's event structure and main handler, if this is the first
+		if ( !( events = elemData.events ) ) {
+			events = elemData.events = Object.create( null );
+		}
+		if ( !( eventHandle = elemData.handle ) ) {
+			eventHandle = elemData.handle = function( e ) {
+
+				// Discard the second event of a jQuery.event.trigger() and
+				// when an event is called after a page has unloaded
+				return typeof jQuery !== "undefined" && jQuery.event.triggered !== e.type ?
+					jQuery.event.dispatch.apply( elem, arguments ) : undefined;
+			};
+		}
+
+		// Handle multiple events separated by a space
+		types = ( types || "" ).match( rnothtmlwhite ) || [ "" ];
+		t = types.length;
+		while ( t-- ) {
+			tmp = rtypenamespace.exec( types[ t ] ) || [];
+			type = origType = tmp[ 1 ];
+			namespaces = ( tmp[ 2 ] || "" ).split( "." ).sort();
+
+			// There *must* be a type, no attaching namespace-only handlers
+			if ( !type ) {
+				continue;
+			}
+
+			// If event changes its type, use the special event handlers for the changed type
+			special = jQuery.event.special[ type ] || {};
+
+			// If selector defined, determine special event api type, otherwise given type
+			type = ( selector ? special.delegateType : special.bindType ) || type;
+
+			// Update special based on newly reset type
+			special = jQuery.event.special[ type ] || {};
+
+			// handleObj is passed to all event handlers
+			handleObj = jQuery.extend( {
+				type: type,
+				origType: origType,
+				data: data,
+				handler: handler,
+				guid: handler.guid,
+				selector: selector,
+				needsContext: selector && jQuery.expr.match.needsContext.test( selector ),
+				namespace: namespaces.join( "." )
+			}, handleObjIn );
+
+			// Init the event handler queue if we're the first
+			if ( !( handlers = events[ type ] ) ) {
+				handlers = events[ type ] = [];
+				handlers.delegateCount = 0;
+
+				// Only use addEventListener if the special events handler returns false
+				if ( !special.setup ||
+					special.setup.call( elem, data, namespaces, eventHandle ) === false ) {
+
+					if ( elem.addEventListener ) {
+						elem.addEventListener( type, eventHandle );
+					}
+				}
+			}
+
+			if ( special.add ) {
+				special.add.call( elem, handleObj );
+
+				if ( !handleObj.handler.guid ) {
+					handleObj.handler.guid = handler.guid;
+				}
+			}
+
+			// Add to the element's handler list, delegates in front
+			if ( selector ) {
+				handlers.splice( handlers.delegateCount++, 0, handleObj );
+			} else {
+				handlers.push( handleObj );
+			}
+
+			// Keep track of which events have ever been used, for event optimization
+			jQuery.event.global[ type ] = true;
+		}
+
+	},
+
+	// Detach an event or set of events from an element
+	remove: function( elem, types, handler, selector, mappedTypes ) {
+
+		var j, origCount, tmp,
+			events, t, handleObj,
+			special, handlers, type, namespaces, origType,
+			elemData = dataPriv.hasData( elem ) && dataPriv.get( elem );
+
+		if ( !elemData || !( events = elemData.events ) ) {
+			return;
+		}
+
+		// Once for each type.namespace in types; type may be omitted
+		types = ( types || "" ).match( rnothtmlwhite ) || [ "" ];
+		t = types.length;
+		while ( t-- ) {
+			tmp = rtypenamespace.exec( types[ t ] ) || [];
+			type = origType = tmp[ 1 ];
+			namespaces = ( tmp[ 2 ] || "" ).split( "." ).sort();
+
+			// Unbind all events (on this namespace, if provided) for the element
+			if ( !type ) {
+				for ( type in events ) {
+					jQuery.event.remove( elem, type + types[ t ], handler, selector, true );
+				}
+				continue;
+			}
+
+			special = jQuery.event.special[ type ] || {};
+			type = ( selector ? special.delegateType : special.bindType ) || type;
+			handlers = events[ type ] || [];
+			tmp = tmp[ 2 ] &&
+				new RegExp( "(^|\\.)" + namespaces.join( "\\.(?:.*\\.|)" ) + "(\\.|$)" );
+
+			// Remove matching events
+			origCount = j = handlers.length;
+			while ( j-- ) {
+				handleObj = handlers[ j ];
+
+				if ( ( mappedTypes || origType === handleObj.origType ) &&
+					( !handler || handler.guid === handleObj.guid ) &&
+					( !tmp || tmp.test( handleObj.namespace ) ) &&
+					( !selector || selector === handleObj.selector ||
+						selector === "**" && handleObj.selector ) ) {
+					handlers.splice( j, 1 );
+
+					if ( handleObj.selector ) {
+						handlers.delegateCount--;
+					}
+					if ( special.remove ) {
+						special.remove.call( elem, handleObj );
+					}
+				}
+			}
+
+			// Remove generic event handler if we removed something and no more handlers exist
+			// (avoids potential for endless recursion during removal of special event handlers)
+			if ( origCount && !handlers.length ) {
+				if ( !special.teardown ||
+					special.teardown.call( elem, namespaces, elemData.handle ) === false ) {
+
+					jQuery.removeEvent( elem, type, elemData.handle );
+				}
+
+				delete events[ type ];
+			}
+		}
+
+		// Remove data and the expando if it's no longer used
+		if ( jQuery.isEmptyObject( events ) ) {
+			dataPriv.remove( elem, "handle events" );
+		}
+	},
+
+	dispatch: function( nativeEvent ) {
+
+		var i, j, ret, matched, handleObj, handlerQueue,
+			args = new Array( arguments.length ),
+
+			// Make a writable jQuery.Event from the native event object
+			event = jQuery.event.fix( nativeEvent ),
+
+			handlers = (
+				dataPriv.get( this, "events" ) || Object.create( null )
+			)[ event.type ] || [],
+			special = jQuery.event.special[ event.type ] || {};
+
+		// Use the fix-ed jQuery.Event rather than the (read-only) native event
+		args[ 0 ] = event;
+
+		for ( i = 1; i < arguments.length; i++ ) {
+			args[ i ] = arguments[ i ];
+		}
+
+		event.delegateTarget = this;
+
+		// Call the preDispatch hook for the mapped type, and let it bail if desired
+		if ( special.preDispatch && special.preDispatch.call( this, event ) === false ) {
+			return;
+		}
+
+		// Determine handlers
+		handlerQueue = jQuery.event.handlers.call( this, event, handlers );
+
+		// Run delegates first; they may want to stop propagation beneath us
+		i = 0;
+		while ( ( matched = handlerQueue[ i++ ] ) && !event.isPropagationStopped() ) {
+			event.currentTarget = matched.elem;
+
+			j = 0;
+			while ( ( handleObj = matched.handlers[ j++ ] ) &&
+				!event.isImmediatePropagationStopped() ) {
+
+				// If the event is namespaced, then each handler is only invoked if it is
+				// specially universal or its namespaces are a superset of the event's.
+				if ( !event.rnamespace || handleObj.namespace === false ||
+					event.rnamespace.test( handleObj.namespace ) ) {
+
+					event.handleObj = handleObj;
+					event.data = handleObj.data;
+
+					ret = ( ( jQuery.event.special[ handleObj.origType ] || {} ).handle ||
+						handleObj.handler ).apply( matched.elem, args );
+
+					if ( ret !== undefined ) {
+						if ( ( event.result = ret ) === false ) {
+							event.preventDefault();
+							event.stopPropagation();
+						}
+					}
+				}
+			}
+		}
+
+		// Call the postDispatch hook for the mapped type
+		if ( special.postDispatch ) {
+			special.postDispatch.call( this, event );
+		}
+
+		return event.result;
+	},
+
+	handlers: function( event, handlers ) {
+		var i, handleObj, sel, matchedHandlers, matchedSelectors,
+			handlerQueue = [],
+			delegateCount = handlers.delegateCount,
+			cur = event.target;
+
+		// Find delegate handlers
+		if ( delegateCount &&
+
+			// Support: IE <=9
+			// Black-hole SVG <use> instance trees (trac-13180)
+			cur.nodeType &&
+
+			// Support: Firefox <=42
+			// Suppress spec-violating clicks indicating a non-primary pointer button (trac-3861)
+			// https://www.w3.org/TR/DOM-Level-3-Events/#event-type-click
+			// Support: IE 11 only
+			// ...but not arrow key "clicks" of radio inputs, which can have `button` -1 (gh-2343)
+			!( event.type === "click" && event.button >= 1 ) ) {
+
+			for ( ; cur !== this; cur = cur.parentNode || this ) {
+
+				// Don't check non-elements (#13208)
+				// Don't process clicks on disabled elements (#6911, #8165, #11382, #11764)
+				if ( cur.nodeType === 1 && !( event.type === "click" && cur.disabled === true ) ) {
+					matchedHandlers = [];
+					matchedSelectors = {};
+					for ( i = 0; i < delegateCount; i++ ) {
+						handleObj = handlers[ i ];
+
+						// Don't conflict with Object.prototype properties (#13203)
+						sel = handleObj.selector + " ";
+
+						if ( matchedSelectors[ sel ] === undefined ) {
+							matchedSelectors[ sel ] = handleObj.needsContext ?
+								jQuery( sel, this ).index( cur ) > -1 :
+								jQuery.find( sel, this, null, [ cur ] ).length;
+						}
+						if ( matchedSelectors[ sel ] ) {
+							matchedHandlers.push( handleObj );
+						}
+					}
+					if ( matchedHandlers.length ) {
+						handlerQueue.push( { elem: cur, handlers: matchedHandlers } );
+					}
+				}
+			}
+		}
+
+		// Add the remaining (directly-bound) handlers
+		cur = this;
+		if ( delegateCount < handlers.length ) {
+			handlerQueue.push( { elem: cur, handlers: handlers.slice( delegateCount ) } );
+		}
+
+		return handlerQueue;
+	},
+
+	addProp: function( name, hook ) {
+		Object.defineProperty( jQuery.Event.prototype, name, {
+			enumerable: true,
+			configurable: true,
+
+			get: isFunction( hook ) ?
+				function() {
+					if ( this.originalEvent ) {
+						return hook( this.originalEvent );
+					}
+				} :
+				function() {
+					if ( this.originalEvent ) {
+						return this.originalEvent[ name ];
+					}
+				},
+
+			set: function( value ) {
+				Object.defineProperty( this, name, {
+					enumerable: true,
+					configurable: true,
+					writable: true,
+					value: value
+				} );
+			}
+		} );
+	},
+
+	fix: function( originalEvent ) {
+		return originalEvent[ jQuery.expando ] ?
+			originalEvent :
+			new jQuery.Event( originalEvent );
+	},
+
+	special: {
+		load: {
+
+			// Prevent triggered image.load events from bubbling to window.load
+			noBubble: true
+		},
+		click: {
+
+			// Utilize native event to ensure correct state for checkable inputs
+			setup: function( data ) {
+
+				// For mutual compressibility with _default, replace `this` access with a local var.
+				// `|| data` is dead code meant only to preserve the variable through minification.
+				var el = this || data;
+
+				// Claim the first handler
+				if ( rcheckableType.test( el.type ) &&
+					el.click && nodeName( el, "input" ) ) {
+
+					// dataPriv.set( el, "click", ... )
+					leverageNative( el, "click", returnTrue );
+				}
+
+				// Return false to allow normal processing in the caller
+				return false;
+			},
+			trigger: function( data ) {
+
+				// For mutual compressibility with _default, replace `this` access with a local var.
+				// `|| data` is dead code meant only to preserve the variable through minification.
+				var el = this || data;
+
+				// Force setup before triggering a click
+				if ( rcheckableType.test( el.type ) &&
+					el.click && nodeName( el, "input" ) ) {
+
+					leverageNative( el, "click" );
+				}
+
+				// Return non-false to allow normal event-path propagation
+				return true;
+			},
+
+			// For cross-browser consistency, suppress native .click() on links
+			// Also prevent it if we're currently inside a leveraged native-event stack
+			_default: function( event ) {
+				var target = event.target;
+				return rcheckableType.test( target.type ) &&
+					target.click && nodeName( target, "input" ) &&
+					dataPriv.get( target, "click" ) ||
+					nodeName( target, "a" );
+			}
+		},
+
+		beforeunload: {
+			postDispatch: function( event ) {
+
+				// Support: Firefox 20+
+				// Firefox doesn't alert if the returnValue field is not set.
+				if ( event.result !== undefined && event.originalEvent ) {
+					event.originalEvent.returnValue = event.result;
+				}
+			}
+		}
+	}
+};
+
+// Ensure the presence of an event listener that handles manually-triggered
+// synthetic events by interrupting progress until reinvoked in response to
+// *native* events that it fires directly, ensuring that state changes have
+// already occurred before other listeners are invoked.
+function leverageNative( el, type, expectSync ) {
+
+	// Missing expectSync indicates a trigger call, which must force setup through jQuery.event.add
+	if ( !expectSync ) {
+		if ( dataPriv.get( el, type ) === undefined ) {
+			jQuery.event.add( el, type, returnTrue );
+		}
+		return;
+	}
+
+	// Register the controller as a special universal handler for all event namespaces
+	dataPriv.set( el, type, false );
+	jQuery.event.add( el, type, {
+		namespace: false,
+		handler: function( event ) {
+			var notAsync, result,
+				saved = dataPriv.get( this, type );
+
+			if ( ( event.isTrigger & 1 ) && this[ type ] ) {
+
+				// Interrupt processing of the outer synthetic .trigger()ed event
+				// Saved data should be false in such cases, but might be a leftover capture object
+				// from an async native handler (gh-4350)
+				if ( !saved.length ) {
+
+					// Store arguments for use when handling the inner native event
+					// There will always be at least one argument (an event object), so this array
+					// will not be confused with a leftover capture object.
+					saved = slice.call( arguments );
+					dataPriv.set( this, type, saved );
+
+					// Trigger the native event and capture its result
+					// Support: IE <=9 - 11+
+					// focus() and blur() are asynchronous
+					notAsync = expectSync( this, type );
+					this[ type ]();
+					result = dataPriv.get( this, type );
+					if ( saved !== result || notAsync ) {
+						dataPriv.set( this, type, false );
+					} else {
+						result = {};
+					}
+					if ( saved !== result ) {
+
+						// Cancel the outer synthetic event
+						event.stopImmediatePropagation();
+						event.preventDefault();
+
+						// Support: Chrome 86+
+						// In Chrome, if an element having a focusout handler is blurred by
+						// clicking outside of it, it invokes the handler synchronously. If
+						// that handler calls `.remove()` on the element, the data is cleared,
+						// leaving `result` undefined. We need to guard against this.
+						return result && result.value;
+					}
+
+				// If this is an inner synthetic event for an event with a bubbling surrogate
+				// (focus or blur), assume that the surrogate already propagated from triggering the
+				// native event and prevent that from happening again here.
+				// This technically gets the ordering wrong w.r.t. to `.trigger()` (in which the
+				// bubbling surrogate propagates *after* the non-bubbling base), but that seems
+				// less bad than duplication.
+				} else if ( ( jQuery.event.special[ type ] || {} ).delegateType ) {
+					event.stopPropagation();
+				}
+
+			// If this is a native event triggered above, everything is now in order
+			// Fire an inner synthetic event with the original arguments
+			} else if ( saved.length ) {
+
+				// ...and capture the result
+				dataPriv.set( this, type, {
+					value: jQuery.event.trigger(
+
+						// Support: IE <=9 - 11+
+						// Extend with the prototype to reset the above stopImmediatePropagation()
+						jQuery.extend( saved[ 0 ], jQuery.Event.prototype ),
+						saved.slice( 1 ),
+						this
+					)
+				} );
+
+				// Abort handling of the native event
+				event.stopImmediatePropagation();
+			}
+		}
+	} );
+}
+
+jQuery.removeEvent = function( elem, type, handle ) {
+
+	// This "if" is needed for plain objects
+	if ( elem.removeEventListener ) {
+		elem.removeEventListener( type, handle );
+	}
+};
+
+jQuery.Event = function( src, props ) {
+
+	// Allow instantiation without the 'new' keyword
+	if ( !( this instanceof jQuery.Event ) ) {
+		return new jQuery.Event( src, props );
+	}
+
+	// Event object
+	if ( src && src.type ) {
+		this.originalEvent = src;
+		this.type = src.type;
+
+		// Events bubbling up the document may have been marked as prevented
+		// by a handler lower down the tree; reflect the correct value.
+		this.isDefaultPrevented = src.defaultPrevented ||
+				src.defaultPrevented === undefined &&
+
+				// Support: Android <=2.3 only
+				src.returnValue === false ?
+			returnTrue :
+			returnFalse;
+
+		// Create target properties
+		// Support: Safari <=6 - 7 only
+		// Target should not be a text node (#504, #13143)
+		this.target = ( src.target && src.target.nodeType === 3 ) ?
+			src.target.parentNode :
+			src.target;
+
+		this.currentTarget = src.currentTarget;
+		this.relatedTarget = src.relatedTarget;
+
+	// Event type
+	} else {
+		this.type = src;
+	}
+
+	// Put explicitly provided properties onto the event object
+	if ( props ) {
+		jQuery.extend( this, props );
+	}
+
+	// Create a timestamp if incoming event doesn't have one
+	this.timeStamp = src && src.timeStamp || Date.now();
+
+	// Mark it as fixed
+	this[ jQuery.expando ] = true;
+};
+
+// jQuery.Event is based on DOM3 Events as specified by the ECMAScript Language Binding
+// https://www.w3.org/TR/2003/WD-DOM-Level-3-Events-20030331/ecma-script-binding.html
+jQuery.Event.prototype = {
+	constructor: jQuery.Event,
+	isDefaultPrevented: returnFalse,
+	isPropagationStopped: returnFalse,
+	isImmediatePropagationStopped: returnFalse,
+	isSimulated: false,
+
+	preventDefault: function() {
+		var e = this.originalEvent;
+
+		this.isDefaultPrevented = returnTrue;
+
+		if ( e && !this.isSimulated ) {
+			e.preventDefault();
+		}
+	},
+	stopPropagation: function() {
+		var e = this.originalEvent;
+
+		this.isPropagationStopped = returnTrue;
+
+		if ( e && !this.isSimulated ) {
+			e.stopPropagation();
+		}
+	},
+	stopImmediatePropagation: function() {
+		var e = this.originalEvent;
+
+		this.isImmediatePropagationStopped = returnTrue;
+
+		if ( e && !this.isSimulated ) {
+			e.stopImmediatePropagation();
+		}
+
+		this.stopPropagation();
+	}
+};
+
+// Includes all common event props including KeyEvent and MouseEvent specific props
+jQuery.each( {
+	altKey: true,
+	bubbles: true,
+	cancelable: true,
+	changedTouches: true,
+	ctrlKey: true,
+	detail: true,
+	eventPhase: true,
+	metaKey: true,
+	pageX: true,
+	pageY: true,
+	shiftKey: true,
+	view: true,
+	"char": true,
+	code: true,
+	charCode: true,
+	key: true,
+	keyCode: true,
+	button: true,
+	buttons: true,
+	clientX: true,
+	clientY: true,
+	offsetX: true,
+	offsetY: true,
+	pointerId: true,
+	pointerType: true,
+	screenX: true,
+	screenY: true,
+	targetTouches: true,
+	toElement: true,
+	touches: true,
+	which: true
+}, jQuery.event.addProp );
+
+jQuery.each( { focus: "focusin", blur: "focusout" }, function( type, delegateType ) {
+	jQuery.event.special[ type ] = {
+
+		// Utilize native event if possible so blur/focus sequence is correct
+		setup: function() {
+
+			// Claim the first handler
+			// dataPriv.set( this, "focus", ... )
+			// dataPriv.set( this, "blur", ... )
+			leverageNative( this, type, expectSync );
+
+			// Return false to allow normal processing in the caller
+			return false;
+		},
+		trigger: function() {
+
+			// Force setup before trigger
+			leverageNative( this, type );
+
+			// Return non-false to allow normal event-path propagation
+			return true;
+		},
+
+		// Suppress native focus or blur as it's already being fired
+		// in leverageNative.
+		_default: function() {
+			return true;
+		},
+
+		delegateType: delegateType
+	};
+} );
+
+// Create mouseenter/leave events using mouseover/out and event-time checks
+// so that event delegation works in jQuery.
+// Do the same for pointerenter/pointerleave and pointerover/pointerout
+//
+// Support: Safari 7 only
+// Safari sends mouseenter too often; see:
+// https://bugs.chromium.org/p/chromium/issues/detail?id=470258
+// for the description of the bug (it existed in older Chrome versions as well).
+jQuery.each( {
+	mouseenter: "mouseover",
+	mouseleave: "mouseout",
+	pointerenter: "pointerover",
+	pointerleave: "pointerout"
+}, function( orig, fix ) {
+	jQuery.event.special[ orig ] = {
+		delegateType: fix,
+		bindType: fix,
+
+		handle: function( event ) {
+			var ret,
+				target = this,
+				related = event.relatedTarget,
+				handleObj = event.handleObj;
+
+			// For mouseenter/leave call the handler if related is outside the target.
+			// NB: No relatedTarget if the mouse left/entered the browser window
+			if ( !related || ( related !== target && !jQuery.contains( target, related ) ) ) {
+				event.type = handleObj.origType;
+				ret = handleObj.handler.apply( this, arguments );
+				event.type = fix;
+			}
+			return ret;
+		}
+	};
+} );
+
+jQuery.fn.extend( {
+
+	on: function( types, selector, data, fn ) {
+		return on( this, types, selector, data, fn );
+	},
+	one: function( types, selector, data, fn ) {
+		return on( this, types, selector, data, fn, 1 );
+	},
+	off: function( types, selector, fn ) {
+		var handleObj, type;
+		if ( types && types.preventDefault && types.handleObj ) {
+
+			// ( event )  dispatched jQuery.Event
+			handleObj = types.handleObj;
+			jQuery( types.delegateTarget ).off(
+				handleObj.namespace ?
+					handleObj.origType + "." + handleObj.namespace :
+					handleObj.origType,
+				handleObj.selector,
+				handleObj.handler
+			);
+			return this;
+		}
+		if ( typeof types === "object" ) {
+
+			// ( types-object [, selector] )
+			for ( type in types ) {
+				this.off( type, selector, types[ type ] );
+			}
+			return this;
+		}
+		if ( selector === false || typeof selector === "function" ) {
+
+			// ( types [, fn] )
+			fn = selector;
+			selector = undefined;
+		}
+		if ( fn === false ) {
+			fn = returnFalse;
+		}
+		return this.each( function() {
+			jQuery.event.remove( this, types, fn, selector );
+		} );
+	}
+} );
+
+
+var
+
+	// Support: IE <=10 - 11, Edge 12 - 13 only
+	// In IE/Edge using regex groups here causes severe slowdowns.
+	// See https://connect.microsoft.com/IE/feedback/details/1736512/
+	rnoInnerhtml = /<script|<style|<link/i,
+
+	// checked="checked" or checked
+	rchecked = /checked\s*(?:[^=]|=\s*.checked.)/i,
+	rcleanScript = /^\s*<!(?:\[CDATA\[|--)|(?:\]\]|--)>\s*$/g;
+
+// Prefer a tbody over its parent table for containing new rows
+function manipulationTarget( elem, content ) {
+	if ( nodeName( elem, "table" ) &&
+		nodeName( content.nodeType !== 11 ? content : content.firstChild, "tr" ) ) {
+
+		return jQuery( elem ).children( "tbody" )[ 0 ] || elem;
+	}
+
+	return elem;
+}
+
+// Replace/restore the type attribute of script elements for safe DOM manipulation
+function disableScript( elem ) {
+	elem.type = ( elem.getAttribute( "type" ) !== null ) + "/" + elem.type;
+	return elem;
+}
+function restoreScript( elem ) {
+	if ( ( elem.type || "" ).slice( 0, 5 ) === "true/" ) {
+		elem.type = elem.type.slice( 5 );
+	} else {
+		elem.removeAttribute( "type" );
+	}
+
+	return elem;
+}
+
+function cloneCopyEvent( src, dest ) {
+	var i, l, type, pdataOld, udataOld, udataCur, events;
+
+	if ( dest.nodeType !== 1 ) {
+		return;
+	}
+
+	// 1. Copy private data: events, handlers, etc.
+	if ( dataPriv.hasData( src ) ) {
+		pdataOld = dataPriv.get( src );
+		events = pdataOld.events;
+
+		if ( events ) {
+			dataPriv.remove( dest, "handle events" );
+
+			for ( type in events ) {
+				for ( i = 0, l = events[ type ].length; i < l; i++ ) {
+					jQuery.event.add( dest, type, events[ type ][ i ] );
+				}
+			}
+		}
+	}
+
+	// 2. Copy user data
+	if ( dataUser.hasData( src ) ) {
+		udataOld = dataUser.access( src );
+		udataCur = jQuery.extend( {}, udataOld );
+
+		dataUser.set( dest, udataCur );
+	}
+}
+
+// Fix IE bugs, see support tests
+function fixInput( src, dest ) {
+	var nodeName = dest.nodeName.toLowerCase();
+
+	// Fails to persist the checked state of a cloned checkbox or radio button.
+	if ( nodeName === "input" && rcheckableType.test( src.type ) ) {
+		dest.checked = src.checked;
+
+	// Fails to return the selected option to the default selected state when cloning options
+	} else if ( nodeName === "input" || nodeName === "textarea" ) {
+		dest.defaultValue = src.defaultValue;
+	}
+}
+
+function domManip( collection, args, callback, ignored ) {
+
+	// Flatten any nested arrays
+	args = flat( args );
+
+	var fragment, first, scripts, hasScripts, node, doc,
+		i = 0,
+		l = collection.length,
+		iNoClone = l - 1,
+		value = args[ 0 ],
+		valueIsFunction = isFunction( value );
+
+	// We can't cloneNode fragments that contain checked, in WebKit
+	if ( valueIsFunction ||
+			( l > 1 && typeof value === "string" &&
+				!support.checkClone && rchecked.test( value ) ) ) {
+		return collection.each( function( index ) {
+			var self = collection.eq( index );
+			if ( valueIsFunction ) {
+				args[ 0 ] = value.call( this, index, self.html() );
+			}
+			domManip( self, args, callback, ignored );
+		} );
+	}
+
+	if ( l ) {
+		fragment = buildFragment( args, collection[ 0 ].ownerDocument, false, collection, ignored );
+		first = fragment.firstChild;
+
+		if ( fragment.childNodes.length === 1 ) {
+			fragment = first;
+		}
+
+		// Require either new content or an interest in ignored elements to invoke the callback
+		if ( first || ignored ) {
+			scripts = jQuery.map( getAll( fragment, "script" ), disableScript );
+			hasScripts = scripts.length;
+
+			// Use the original fragment for the last item
+			// instead of the first because it can end up
+			// being emptied incorrectly in certain situations (#8070).
+			for ( ; i < l; i++ ) {
+				node = fragment;
+
+				if ( i !== iNoClone ) {
+					node = jQuery.clone( node, true, true );
+
+					// Keep references to cloned scripts for later restoration
+					if ( hasScripts ) {
+
+						// Support: Android <=4.0 only, PhantomJS 1 only
+						// push.apply(_, arraylike) throws on ancient WebKit
+						jQuery.merge( scripts, getAll( node, "script" ) );
+					}
+				}
+
+				callback.call( collection[ i ], node, i );
+			}
+
+			if ( hasScripts ) {
+				doc = scripts[ scripts.length - 1 ].ownerDocument;
+
+				// Reenable scripts
+				jQuery.map( scripts, restoreScript );
+
+				// Evaluate executable scripts on first document insertion
+				for ( i = 0; i < hasScripts; i++ ) {
+					node = scripts[ i ];
+					if ( rscriptType.test( node.type || "" ) &&
+						!dataPriv.access( node, "globalEval" ) &&
+						jQuery.contains( doc, node ) ) {
+
+						if ( node.src && ( node.type || "" ).toLowerCase()  !== "module" ) {
+
+							// Optional AJAX dependency, but won't run scripts if not present
+							if ( jQuery._evalUrl && !node.noModule ) {
+								jQuery._evalUrl( node.src, {
+									nonce: node.nonce || node.getAttribute( "nonce" )
+								}, doc );
+							}
+						} else {
+							DOMEval( node.textContent.replace( rcleanScript, "" ), node, doc );
+						}
+					}
+				}
+			}
+		}
+	}
+
+	return collection;
+}
+
+function remove( elem, selector, keepData ) {
+	var node,
+		nodes = selector ? jQuery.filter( selector, elem ) : elem,
+		i = 0;
+
+	for ( ; ( node = nodes[ i ] ) != null; i++ ) {
+		if ( !keepData && node.nodeType === 1 ) {
+			jQuery.cleanData( getAll( node ) );
+		}
+
+		if ( node.parentNode ) {
+			if ( keepData && isAttached( node ) ) {
+				setGlobalEval( getAll( node, "script" ) );
+			}
+			node.parentNode.removeChild( node );
+		}
+	}
+
+	return elem;
+}
+
+jQuery.extend( {
+	htmlPrefilter: function( html ) {
+		return html;
+	},
+
+	clone: function( elem, dataAndEvents, deepDataAndEvents ) {
+		var i, l, srcElements, destElements,
+			clone = elem.cloneNode( true ),
+			inPage = isAttached( elem );
+
+		// Fix IE cloning issues
+		if ( !support.noCloneChecked && ( elem.nodeType === 1 || elem.nodeType === 11 ) &&
+				!jQuery.isXMLDoc( elem ) ) {
+
+			// We eschew Sizzle here for performance reasons: https://jsperf.com/getall-vs-sizzle/2
+			destElements = getAll( clone );
+			srcElements = getAll( elem );
+
+			for ( i = 0, l = srcElements.length; i < l; i++ ) {
+				fixInput( srcElements[ i ], destElements[ i ] );
+			}
+		}
+
+		// Copy the events from the original to the clone
+		if ( dataAndEvents ) {
+			if ( deepDataAndEvents ) {
+				srcElements = srcElements || getAll( elem );
+				destElements = destElements || getAll( clone );
+
+				for ( i = 0, l = srcElements.length; i < l; i++ ) {
+					cloneCopyEvent( srcElements[ i ], destElements[ i ] );
+				}
+			} else {
+				cloneCopyEvent( elem, clone );
+			}
+		}
+
+		// Preserve script evaluation history
+		destElements = getAll( clone, "script" );
+		if ( destElements.length > 0 ) {
+			setGlobalEval( destElements, !inPage && getAll( elem, "script" ) );
+		}
+
+		// Return the cloned set
+		return clone;
+	},
+
+	cleanData: function( elems ) {
+		var data, elem, type,
+			special = jQuery.event.special,
+			i = 0;
+
+		for ( ; ( elem = elems[ i ] ) !== undefined; i++ ) {
+			if ( acceptData( elem ) ) {
+				if ( ( data = elem[ dataPriv.expando ] ) ) {
+					if ( data.events ) {
+						for ( type in data.events ) {
+							if ( special[ type ] ) {
+								jQuery.event.remove( elem, type );
+
+							// This is a shortcut to avoid jQuery.event.remove's overhead
+							} else {
+								jQuery.removeEvent( elem, type, data.handle );
+							}
+						}
+					}
+
+					// Support: Chrome <=35 - 45+
+					// Assign undefined instead of using delete, see Data#remove
+					elem[ dataPriv.expando ] = undefined;
+				}
+				if ( elem[ dataUser.expando ] ) {
+
+					// Support: Chrome <=35 - 45+
+					// Assign undefined instead of using delete, see Data#remove
+					elem[ dataUser.expando ] = undefined;
+				}
+			}
+		}
+	}
+} );
+
+jQuery.fn.extend( {
+	detach: function( selector ) {
+		return remove( this, selector, true );
+	},
+
+	remove: function( selector ) {
+		return remove( this, selector );
+	},
+
+	text: function( value ) {
+		return access( this, function( value ) {
+			return value === undefined ?
+				jQuery.text( this ) :
+				this.empty().each( function() {
+					if ( this.nodeType === 1 || this.nodeType === 11 || this.nodeType === 9 ) {
+						this.textContent = value;
+					}
+				} );
+		}, null, value, arguments.length );
+	},
+
+	append: function() {
+		return domManip( this, arguments, function( elem ) {
+			if ( this.nodeType === 1 || this.nodeType === 11 || this.nodeType === 9 ) {
+				var target = manipulationTarget( this, elem );
+				target.appendChild( elem );
+			}
+		} );
+	},
+
+	prepend: function() {
+		return domManip( this, arguments, function( elem ) {
+			if ( this.nodeType === 1 || this.nodeType === 11 || this.nodeType === 9 ) {
+				var target = manipulationTarget( this, elem );
+				target.insertBefore( elem, target.firstChild );
+			}
+		} );
+	},
+
+	before: function() {
+		return domManip( this, arguments, function( elem ) {
+			if ( this.parentNode ) {
+				this.parentNode.insertBefore( elem, this );
+			}
+		} );
+	},
+
+	after: function() {
+		return domManip( this, arguments, function( elem ) {
+			if ( this.parentNode ) {
+				this.parentNode.insertBefore( elem, this.nextSibling );
+			}
+		} );
+	},
+
+	empty: function() {
+		var elem,
+			i = 0;
+
+		for ( ; ( elem = this[ i ] ) != null; i++ ) {
+			if ( elem.nodeType === 1 ) {
+
+				// Prevent memory leaks
+				jQuery.cleanData( getAll( elem, false ) );
+
+				// Remove any remaining nodes
+				elem.textContent = "";
+			}
+		}
+
+		return this;
+	},
+
+	clone: function( dataAndEvents, deepDataAndEvents ) {
+		dataAndEvents = dataAndEvents == null ? false : dataAndEvents;
+		deepDataAndEvents = deepDataAndEvents == null ? dataAndEvents : deepDataAndEvents;
+
+		return this.map( function() {
+			return jQuery.clone( this, dataAndEvents, deepDataAndEvents );
+		} );
+	},
+
+	html: function( value ) {
+		return access( this, function( value ) {
+			var elem = this[ 0 ] || {},
+				i = 0,
+				l = this.length;
+
+			if ( value === undefined && elem.nodeType === 1 ) {
+				return elem.innerHTML;
+			}
+
+			// See if we can take a shortcut and just use innerHTML
+			if ( typeof value === "string" && !rnoInnerhtml.test( value ) &&
+				!wrapMap[ ( rtagName.exec( value ) || [ "", "" ] )[ 1 ].toLowerCase() ] ) {
+
+				value = jQuery.htmlPrefilter( value );
+
+				try {
+					for ( ; i < l; i++ ) {
+						elem = this[ i ] || {};
+
+						// Remove element nodes and prevent memory leaks
+						if ( elem.nodeType === 1 ) {
+							jQuery.cleanData( getAll( elem, false ) );
+							elem.innerHTML = value;
+						}
+					}
+
+					elem = 0;
+
+				// If using innerHTML throws an exception, use the fallback method
+				} catch ( e ) {}
+			}
+
+			if ( elem ) {
+				this.empty().append( value );
+			}
+		}, null, value, arguments.length );
+	},
+
+	replaceWith: function() {
+		var ignored = [];
+
+		// Make the changes, replacing each non-ignored context element with the new content
+		return domManip( this, arguments, function( elem ) {
+			var parent = this.parentNode;
+
+			if ( jQuery.inArray( this, ignored ) < 0 ) {
+				jQuery.cleanData( getAll( this ) );
+				if ( parent ) {
+					parent.replaceChild( elem, this );
+				}
+			}
+
+		// Force callback invocation
+		}, ignored );
+	}
+} );
+
+jQuery.each( {
+	appendTo: "append",
+	prependTo: "prepend",
+	insertBefore: "before",
+	insertAfter: "after",
+	replaceAll: "replaceWith"
+}, function( name, original ) {
+	jQuery.fn[ name ] = function( selector ) {
+		var elems,
+			ret = [],
+			insert = jQuery( selector ),
+			last = insert.length - 1,
+			i = 0;
+
+		for ( ; i <= last; i++ ) {
+			elems = i === last ? this : this.clone( true );
+			jQuery( insert[ i ] )[ original ]( elems );
+
+			// Support: Android <=4.0 only, PhantomJS 1 only
+			// .get() because push.apply(_, arraylike) throws on ancient WebKit
+			push.apply( ret, elems.get() );
+		}
+
+		return this.pushStack( ret );
+	};
+} );
+var rnumnonpx = new RegExp( "^(" + pnum + ")(?!px)[a-z%]+$", "i" );
+
+var getStyles = function( elem ) {
+
+		// Support: IE <=11 only, Firefox <=30 (#15098, #14150)
+		// IE throws on elements created in popups
+		// FF meanwhile throws on frame elements through "defaultView.getComputedStyle"
+		var view = elem.ownerDocument.defaultView;
+
+		if ( !view || !view.opener ) {
+			view = window;
+		}
+
+		return view.getComputedStyle( elem );
+	};
+
+var swap = function( elem, options, callback ) {
+	var ret, name,
+		old = {};
+
+	// Remember the old values, and insert the new ones
+	for ( name in options ) {
+		old[ name ] = elem.style[ name ];
+		elem.style[ name ] = options[ name ];
+	}
+
+	ret = callback.call( elem );
+
+	// Revert the old values
+	for ( name in options ) {
+		elem.style[ name ] = old[ name ];
+	}
+
+	return ret;
+};
+
+
+var rboxStyle = new RegExp( cssExpand.join( "|" ), "i" );
+
+
+
+( function() {
+
+	// Executing both pixelPosition & boxSizingReliable tests require only one layout
+	// so they're executed at the same time to save the second computation.
+	function computeStyleTests() {
+
+		// This is a singleton, we need to execute it only once
+		if ( !div ) {
+			return;
+		}
+
+		container.style.cssText = "position:absolute;left:-11111px;width:60px;" +
+			"margin-top:1px;padding:0;border:0";
+		div.style.cssText =
+			"position:relative;display:block;box-sizing:border-box;overflow:scroll;" +
+			"margin:auto;border:1px;padding:1px;" +
+			"width:60%;top:1%";
+		documentElement.appendChild( container ).appendChild( div );
+
+		var divStyle = window.getComputedStyle( div );
+		pixelPositionVal = divStyle.top !== "1%";
+
+		// Support: Android 4.0 - 4.3 only, Firefox <=3 - 44
+		reliableMarginLeftVal = roundPixelMeasures( divStyle.marginLeft ) === 12;
+
+		// Support: Android 4.0 - 4.3 only, Safari <=9.1 - 10.1, iOS <=7.0 - 9.3
+		// Some styles come back with percentage values, even though they shouldn't
+		div.style.right = "60%";
+		pixelBoxStylesVal = roundPixelMeasures( divStyle.right ) === 36;
+
+		// Support: IE 9 - 11 only
+		// Detect misreporting of content dimensions for box-sizing:border-box elements
+		boxSizingReliableVal = roundPixelMeasures( divStyle.width ) === 36;
+
+		// Support: IE 9 only
+		// Detect overflow:scroll screwiness (gh-3699)
+		// Support: Chrome <=64
+		// Don't get tricked when zoom affects offsetWidth (gh-4029)
+		div.style.position = "absolute";
+		scrollboxSizeVal = roundPixelMeasures( div.offsetWidth / 3 ) === 12;
+
+		documentElement.removeChild( container );
+
+		// Nullify the div so it wouldn't be stored in the memory and
+		// it will also be a sign that checks already performed
+		div = null;
+	}
+
+	function roundPixelMeasures( measure ) {
+		return Math.round( parseFloat( measure ) );
+	}
+
+	var pixelPositionVal, boxSizingReliableVal, scrollboxSizeVal, pixelBoxStylesVal,
+		reliableTrDimensionsVal, reliableMarginLeftVal,
+		container = document.createElement( "div" ),
+		div = document.createElement( "div" );
+
+	// Finish early in limited (non-browser) environments
+	if ( !div.style ) {
+		return;
+	}
+
+	// Support: IE <=9 - 11 only
+	// Style of cloned element affects source element cloned (#8908)
+	div.style.backgroundClip = "content-box";
+	div.cloneNode( true ).style.backgroundClip = "";
+	support.clearCloneStyle = div.style.backgroundClip === "content-box";
+
+	jQuery.extend( support, {
+		boxSizingReliable: function() {
+			computeStyleTests();
+			return boxSizingReliableVal;
+		},
+		pixelBoxStyles: function() {
+			computeStyleTests();
+			return pixelBoxStylesVal;
+		},
+		pixelPosition: function() {
+			computeStyleTests();
+			return pixelPositionVal;
+		},
+		reliableMarginLeft: function() {
+			computeStyleTests();
+			return reliableMarginLeftVal;
+		},
+		scrollboxSize: function() {
+			computeStyleTests();
+			return scrollboxSizeVal;
+		},
+
+		// Support: IE 9 - 11+, Edge 15 - 18+
+		// IE/Edge misreport `getComputedStyle` of table rows with width/height
+		// set in CSS while `offset*` properties report correct values.
+		// Behavior in IE 9 is more subtle than in newer versions & it passes
+		// some versions of this test; make sure not to make it pass there!
+		//
+		// Support: Firefox 70+
+		// Only Firefox includes border widths
+		// in computed dimensions. (gh-4529)
+		reliableTrDimensions: function() {
+			var table, tr, trChild, trStyle;
+			if ( reliableTrDimensionsVal == null ) {
+				table = document.createElement( "table" );
+				tr = document.createElement( "tr" );
+				trChild = document.createElement( "div" );
+
+				table.style.cssText = "position:absolute;left:-11111px;border-collapse:separate";
+				tr.style.cssText = "border:1px solid";
+
+				// Support: Chrome 86+
+				// Height set through cssText does not get applied.
+				// Computed height then comes back as 0.
+				tr.style.height = "1px";
+				trChild.style.height = "9px";
+
+				// Support: Android 8 Chrome 86+
+				// In our bodyBackground.html iframe,
+				// display for all div elements is set to "inline",
+				// which causes a problem only in Android 8 Chrome 86.
+				// Ensuring the div is display: block
+				// gets around this issue.
+				trChild.style.display = "block";
+
+				documentElement
+					.appendChild( table )
+					.appendChild( tr )
+					.appendChild( trChild );
+
+				trStyle = window.getComputedStyle( tr );
+				reliableTrDimensionsVal = ( parseInt( trStyle.height, 10 ) +
+					parseInt( trStyle.borderTopWidth, 10 ) +
+					parseInt( trStyle.borderBottomWidth, 10 ) ) === tr.offsetHeight;
+
+				documentElement.removeChild( table );
+			}
+			return reliableTrDimensionsVal;
+		}
+	} );
+} )();
+
+
+function curCSS( elem, name, computed ) {
+	var width, minWidth, maxWidth, ret,
+
+		// Support: Firefox 51+
+		// Retrieving style before computed somehow
+		// fixes an issue with getting wrong values
+		// on detached elements
+		style = elem.style;
+
+	computed = computed || getStyles( elem );
+
+	// getPropertyValue is needed for:
+	//   .css('filter') (IE 9 only, #12537)
+	//   .css('--customProperty) (#3144)
+	if ( computed ) {
+		ret = computed.getPropertyValue( name ) || computed[ name ];
+
+		if ( ret === "" && !isAttached( elem ) ) {
+			ret = jQuery.style( elem, name );
+		}
+
+		// A tribute to the "awesome hack by Dean Edwards"
+		// Android Browser returns percentage for some values,
+		// but width seems to be reliably pixels.
+		// This is against the CSSOM draft spec:
+		// https://drafts.csswg.org/cssom/#resolved-values
+		if ( !support.pixelBoxStyles() && rnumnonpx.test( ret ) && rboxStyle.test( name ) ) {
+
+			// Remember the original values
+			width = style.width;
+			minWidth = style.minWidth;
+			maxWidth = style.maxWidth;
+
+			// Put in the new values to get a computed value out
+			style.minWidth = style.maxWidth = style.width = ret;
+			ret = computed.width;
+
+			// Revert the changed values
+			style.width = width;
+			style.minWidth = minWidth;
+			style.maxWidth = maxWidth;
+		}
+	}
+
+	return ret !== undefined ?
+
+		// Support: IE <=9 - 11 only
+		// IE returns zIndex value as an integer.
+		ret + "" :
+		ret;
+}
+
+
+function addGetHookIf( conditionFn, hookFn ) {
+
+	// Define the hook, we'll check on the first run if it's really needed.
+	return {
+		get: function() {
+			if ( conditionFn() ) {
+
+				// Hook not needed (or it's not possible to use it due
+				// to missing dependency), remove it.
+				delete this.get;
+				return;
+			}
+
+			// Hook needed; redefine it so that the support test is not executed again.
+			return ( this.get = hookFn ).apply( this, arguments );
+		}
+	};
+}
+
+
+var cssPrefixes = [ "Webkit", "Moz", "ms" ],
+	emptyStyle = document.createElement( "div" ).style,
+	vendorProps = {};
+
+// Return a vendor-prefixed property or undefined
+function vendorPropName( name ) {
+
+	// Check for vendor prefixed names
+	var capName = name[ 0 ].toUpperCase() + name.slice( 1 ),
+		i = cssPrefixes.length;
+
+	while ( i-- ) {
+		name = cssPrefixes[ i ] + capName;
+		if ( name in emptyStyle ) {
+			return name;
+		}
+	}
+}
+
+// Return a potentially-mapped jQuery.cssProps or vendor prefixed property
+function finalPropName( name ) {
+	var final = jQuery.cssProps[ name ] || vendorProps[ name ];
+
+	if ( final ) {
+		return final;
+	}
+	if ( name in emptyStyle ) {
+		return name;
+	}
+	return vendorProps[ name ] = vendorPropName( name ) || name;
+}
+
+
+var
+
+	// Swappable if display is none or starts with table
+	// except "table", "table-cell", or "table-caption"
+	// See here for display values: https://developer.mozilla.org/en-US/docs/CSS/display
+	rdisplayswap = /^(none|table(?!-c[ea]).+)/,
+	rcustomProp = /^--/,
+	cssShow = { position: "absolute", visibility: "hidden", display: "block" },
+	cssNormalTransform = {
+		letterSpacing: "0",
+		fontWeight: "400"
+	};
+
+function setPositiveNumber( _elem, value, subtract ) {
+
+	// Any relative (+/-) values have already been
+	// normalized at this point
+	var matches = rcssNum.exec( value );
+	return matches ?
+
+		// Guard against undefined "subtract", e.g., when used as in cssHooks
+		Math.max( 0, matches[ 2 ] - ( subtract || 0 ) ) + ( matches[ 3 ] || "px" ) :
+		value;
+}
+
+function boxModelAdjustment( elem, dimension, box, isBorderBox, styles, computedVal ) {
+	var i = dimension === "width" ? 1 : 0,
+		extra = 0,
+		delta = 0;
+
+	// Adjustment may not be necessary
+	if ( box === ( isBorderBox ? "border" : "content" ) ) {
+		return 0;
+	}
+
+	for ( ; i < 4; i += 2 ) {
+
+		// Both box models exclude margin
+		if ( box === "margin" ) {
+			delta += jQuery.css( elem, box + cssExpand[ i ], true, styles );
+		}
+
+		// If we get here with a content-box, we're seeking "padding" or "border" or "margin"
+		if ( !isBorderBox ) {
+
+			// Add padding
+			delta += jQuery.css( elem, "padding" + cssExpand[ i ], true, styles );
+
+			// For "border" or "margin", add border
+			if ( box !== "padding" ) {
+				delta += jQuery.css( elem, "border" + cssExpand[ i ] + "Width", true, styles );
+
+			// But still keep track of it otherwise
+			} else {
+				extra += jQuery.css( elem, "border" + cssExpand[ i ] + "Width", true, styles );
+			}
+
+		// If we get here with a border-box (content + padding + border), we're seeking "content" or
+		// "padding" or "margin"
+		} else {
+
+			// For "content", subtract padding
+			if ( box === "content" ) {
+				delta -= jQuery.css( elem, "padding" + cssExpand[ i ], true, styles );
+			}
+
+			// For "content" or "padding", subtract border
+			if ( box !== "margin" ) {
+				delta -= jQuery.css( elem, "border" + cssExpand[ i ] + "Width", true, styles );
+			}
+		}
+	}
+
+	// Account for positive content-box scroll gutter when requested by providing computedVal
+	if ( !isBorderBox && computedVal >= 0 ) {
+
+		// offsetWidth/offsetHeight is a rounded sum of content, padding, scroll gutter, and border
+		// Assuming integer scroll gutter, subtract the rest and round down
+		delta += Math.max( 0, Math.ceil(
+			elem[ "offset" + dimension[ 0 ].toUpperCase() + dimension.slice( 1 ) ] -
+			computedVal -
+			delta -
+			extra -
+			0.5
+
+		// If offsetWidth/offsetHeight is unknown, then we can't determine content-box scroll gutter
+		// Use an explicit zero to avoid NaN (gh-3964)
+		) ) || 0;
+	}
+
+	return delta;
+}
+
+function getWidthOrHeight( elem, dimension, extra ) {
+
+	// Start with computed style
+	var styles = getStyles( elem ),
+
+		// To avoid forcing a reflow, only fetch boxSizing if we need it (gh-4322).
+		// Fake content-box until we know it's needed to know the true value.
+		boxSizingNeeded = !support.boxSizingReliable() || extra,
+		isBorderBox = boxSizingNeeded &&
+			jQuery.css( elem, "boxSizing", false, styles ) === "border-box",
+		valueIsBorderBox = isBorderBox,
+
+		val = curCSS( elem, dimension, styles ),
+		offsetProp = "offset" + dimension[ 0 ].toUpperCase() + dimension.slice( 1 );
+
+	// Support: Firefox <=54
+	// Return a confounding non-pixel value or feign ignorance, as appropriate.
+	if ( rnumnonpx.test( val ) ) {
+		if ( !extra ) {
+			return val;
+		}
+		val = "auto";
+	}
+
+
+	// Support: IE 9 - 11 only
+	// Use offsetWidth/offsetHeight for when box sizing is unreliable.
+	// In those cases, the computed value can be trusted to be border-box.
+	if ( ( !support.boxSizingReliable() && isBorderBox ||
+
+		// Support: IE 10 - 11+, Edge 15 - 18+
+		// IE/Edge misreport `getComputedStyle` of table rows with width/height
+		// set in CSS while `offset*` properties report correct values.
+		// Interestingly, in some cases IE 9 doesn't suffer from this issue.
+		!support.reliableTrDimensions() && nodeName( elem, "tr" ) ||
+
+		// Fall back to offsetWidth/offsetHeight when value is "auto"
+		// This happens for inline elements with no explicit setting (gh-3571)
+		val === "auto" ||
+
+		// Support: Android <=4.1 - 4.3 only
+		// Also use offsetWidth/offsetHeight for misreported inline dimensions (gh-3602)
+		!parseFloat( val ) && jQuery.css( elem, "display", false, styles ) === "inline" ) &&
+
+		// Make sure the element is visible & connected
+		elem.getClientRects().length ) {
+
+		isBorderBox = jQuery.css( elem, "boxSizing", false, styles ) === "border-box";
+
+		// Where available, offsetWidth/offsetHeight approximate border box dimensions.
+		// Where not available (e.g., SVG), assume unreliable box-sizing and interpret the
+		// retrieved value as a content box dimension.
+		valueIsBorderBox = offsetProp in elem;
+		if ( valueIsBorderBox ) {
+			val = elem[ offsetProp ];
+		}
+	}
+
+	// Normalize "" and auto
+	val = parseFloat( val ) || 0;
+
+	// Adjust for the element's box model
+	return ( val +
+		boxModelAdjustment(
+			elem,
+			dimension,
+			extra || ( isBorderBox ? "border" : "content" ),
+			valueIsBorderBox,
+			styles,
+
+			// Provide the current computed size to request scroll gutter calculation (gh-3589)
+			val
+		)
+	) + "px";
+}
+
+jQuery.extend( {
+
+	// Add in style property hooks for overriding the default
+	// behavior of getting and setting a style property
+	cssHooks: {
+		opacity: {
+			get: function( elem, computed ) {
+				if ( computed ) {
+
+					// We should always get a number back from opacity
+					var ret = curCSS( elem, "opacity" );
+					return ret === "" ? "1" : ret;
+				}
+			}
+		}
+	},
+
+	// Don't automatically add "px" to these possibly-unitless properties
+	cssNumber: {
+		"animationIterationCount": true,
+		"columnCount": true,
+		"fillOpacity": true,
+		"flexGrow": true,
+		"flexShrink": true,
+		"fontWeight": true,
+		"gridArea": true,
+		"gridColumn": true,
+		"gridColumnEnd": true,
+		"gridColumnStart": true,
+		"gridRow": true,
+		"gridRowEnd": true,
+		"gridRowStart": true,
+		"lineHeight": true,
+		"opacity": true,
+		"order": true,
+		"orphans": true,
+		"widows": true,
+		"zIndex": true,
+		"zoom": true
+	},
+
+	// Add in properties whose names you wish to fix before
+	// setting or getting the value
+	cssProps: {},
+
+	// Get and set the style property on a DOM Node
+	style: function( elem, name, value, extra ) {
+
+		// Don't set styles on text and comment nodes
+		if ( !elem || elem.nodeType === 3 || elem.nodeType === 8 || !elem.style ) {
+			return;
+		}
+
+		// Make sure that we're working with the right name
+		var ret, type, hooks,
+			origName = camelCase( name ),
+			isCustomProp = rcustomProp.test( name ),
+			style = elem.style;
+
+		// Make sure that we're working with the right name. We don't
+		// want to query the value if it is a CSS custom property
+		// since they are user-defined.
+		if ( !isCustomProp ) {
+			name = finalPropName( origName );
+		}
+
+		// Gets hook for the prefixed version, then unprefixed version
+		hooks = jQuery.cssHooks[ name ] || jQuery.cssHooks[ origName ];
+
+		// Check if we're setting a value
+		if ( value !== undefined ) {
+			type = typeof value;
+
+			// Convert "+=" or "-=" to relative numbers (#7345)
+			if ( type === "string" && ( ret = rcssNum.exec( value ) ) && ret[ 1 ] ) {
+				value = adjustCSS( elem, name, ret );
+
+				// Fixes bug #9237
+				type = "number";
+			}
+
+			// Make sure that null and NaN values aren't set (#7116)
+			if ( value == null || value !== value ) {
+				return;
+			}
+
+			// If a number was passed in, add the unit (except for certain CSS properties)
+			// The isCustomProp check can be removed in jQuery 4.0 when we only auto-append
+			// "px" to a few hardcoded values.
+			if ( type === "number" && !isCustomProp ) {
+				value += ret && ret[ 3 ] || ( jQuery.cssNumber[ origName ] ? "" : "px" );
+			}
+
+			// background-* props affect original clone's values
+			if ( !support.clearCloneStyle && value === "" && name.indexOf( "background" ) === 0 ) {
+				style[ name ] = "inherit";
+			}
+
+			// If a hook was provided, use that value, otherwise just set the specified value
+			if ( !hooks || !( "set" in hooks ) ||
+				( value = hooks.set( elem, value, extra ) ) !== undefined ) {
+
+				if ( isCustomProp ) {
+					style.setProperty( name, value );
+				} else {
+					style[ name ] = value;
+				}
+			}
+
+		} else {
+
+			// If a hook was provided get the non-computed value from there
+			if ( hooks && "get" in hooks &&
+				( ret = hooks.get( elem, false, extra ) ) !== undefined ) {
+
+				return ret;
+			}
+
+			// Otherwise just get the value from the style object
+			return style[ name ];
+		}
+	},
+
+	css: function( elem, name, extra, styles ) {
+		var val, num, hooks,
+			origName = camelCase( name ),
+			isCustomProp = rcustomProp.test( name );
+
+		// Make sure that we're working with the right name. We don't
+		// want to modify the value if it is a CSS custom property
+		// since they are user-defined.
+		if ( !isCustomProp ) {
+			name = finalPropName( origName );
+		}
+
+		// Try prefixed name followed by the unprefixed name
+		hooks = jQuery.cssHooks[ name ] || jQuery.cssHooks[ origName ];
+
+		// If a hook was provided get the computed value from there
+		if ( hooks && "get" in hooks ) {
+			val = hooks.get( elem, true, extra );
+		}
+
+		// Otherwise, if a way to get the computed value exists, use that
+		if ( val === undefined ) {
+			val = curCSS( elem, name, styles );
+		}
+
+		// Convert "normal" to computed value
+		if ( val === "normal" && name in cssNormalTransform ) {
+			val = cssNormalTransform[ name ];
+		}
+
+		// Make numeric if forced or a qualifier was provided and val looks numeric
+		if ( extra === "" || extra ) {
+			num = parseFloat( val );
+			return extra === true || isFinite( num ) ? num || 0 : val;
+		}
+
+		return val;
+	}
+} );
+
+jQuery.each( [ "height", "width" ], function( _i, dimension ) {
+	jQuery.cssHooks[ dimension ] = {
+		get: function( elem, computed, extra ) {
+			if ( computed ) {
+
+				// Certain elements can have dimension info if we invisibly show them
+				// but it must have a current display style that would benefit
+				return rdisplayswap.test( jQuery.css( elem, "display" ) ) &&
+
+					// Support: Safari 8+
+					// Table columns in Safari have non-zero offsetWidth & zero
+					// getBoundingClientRect().width unless display is changed.
+					// Support: IE <=11 only
+					// Running getBoundingClientRect on a disconnected node
+					// in IE throws an error.
+					( !elem.getClientRects().length || !elem.getBoundingClientRect().width ) ?
+					swap( elem, cssShow, function() {
+						return getWidthOrHeight( elem, dimension, extra );
+					} ) :
+					getWidthOrHeight( elem, dimension, extra );
+			}
+		},
+
+		set: function( elem, value, extra ) {
+			var matches,
+				styles = getStyles( elem ),
+
+				// Only read styles.position if the test has a chance to fail
+				// to avoid forcing a reflow.
+				scrollboxSizeBuggy = !support.scrollboxSize() &&
+					styles.position === "absolute",
+
+				// To avoid forcing a reflow, only fetch boxSizing if we need it (gh-3991)
+				boxSizingNeeded = scrollboxSizeBuggy || extra,
+				isBorderBox = boxSizingNeeded &&
+					jQuery.css( elem, "boxSizing", false, styles ) === "border-box",
+				subtract = extra ?
+					boxModelAdjustment(
+						elem,
+						dimension,
+						extra,
+						isBorderBox,
+						styles
+					) :
+					0;
+
+			// Account for unreliable border-box dimensions by comparing offset* to computed and
+			// faking a content-box to get border and padding (gh-3699)
+			if ( isBorderBox && scrollboxSizeBuggy ) {
+				subtract -= Math.ceil(
+					elem[ "offset" + dimension[ 0 ].toUpperCase() + dimension.slice( 1 ) ] -
+					parseFloat( styles[ dimension ] ) -
+					boxModelAdjustment( elem, dimension, "border", false, styles ) -
+					0.5
+				);
+			}
+
+			// Convert to pixels if value adjustment is needed
+			if ( subtract && ( matches = rcssNum.exec( value ) ) &&
+				( matches[ 3 ] || "px" ) !== "px" ) {
+
+				elem.style[ dimension ] = value;
+				value = jQuery.css( elem, dimension );
+			}
+
+			return setPositiveNumber( elem, value, subtract );
+		}
+	};
+} );
+
+jQuery.cssHooks.marginLeft = addGetHookIf( support.reliableMarginLeft,
+	function( elem, computed ) {
+		if ( computed ) {
+			return ( parseFloat( curCSS( elem, "marginLeft" ) ) ||
+				elem.getBoundingClientRect().left -
+					swap( elem, { marginLeft: 0 }, function() {
+						return elem.getBoundingClientRect().left;
+					} )
+			) + "px";
+		}
+	}
+);
+
+// These hooks are used by animate to expand properties
+jQuery.each( {
+	margin: "",
+	padding: "",
+	border: "Width"
+}, function( prefix, suffix ) {
+	jQuery.cssHooks[ prefix + suffix ] = {
+		expand: function( value ) {
+			var i = 0,
+				expanded = {},
+
+				// Assumes a single number if not a string
+				parts = typeof value === "string" ? value.split( " " ) : [ value ];
+
+			for ( ; i < 4; i++ ) {
+				expanded[ prefix + cssExpand[ i ] + suffix ] =
+					parts[ i ] || parts[ i - 2 ] || parts[ 0 ];
+			}
+
+			return expanded;
+		}
+	};
+
+	if ( prefix !== "margin" ) {
+		jQuery.cssHooks[ prefix + suffix ].set = setPositiveNumber;
+	}
+} );
+
+jQuery.fn.extend( {
+	css: function( name, value ) {
+		return access( this, function( elem, name, value ) {
+			var styles, len,
+				map = {},
+				i = 0;
+
+			if ( Array.isArray( name ) ) {
+				styles = getStyles( elem );
+				len = name.length;
+
+				for ( ; i < len; i++ ) {
+					map[ name[ i ] ] = jQuery.css( elem, name[ i ], false, styles );
+				}
+
+				return map;
+			}
+
+			return value !== undefined ?
+				jQuery.style( elem, name, value ) :
+				jQuery.css( elem, name );
+		}, name, value, arguments.length > 1 );
+	}
+} );
+
+
+function Tween( elem, options, prop, end, easing ) {
+	return new Tween.prototype.init( elem, options, prop, end, easing );
+}
+jQuery.Tween = Tween;
+
+Tween.prototype = {
+	constructor: Tween,
+	init: function( elem, options, prop, end, easing, unit ) {
+		this.elem = elem;
+		this.prop = prop;
+		this.easing = easing || jQuery.easing._default;
+		this.options = options;
+		this.start = this.now = this.cur();
+		this.end = end;
+		this.unit = unit || ( jQuery.cssNumber[ prop ] ? "" : "px" );
+	},
+	cur: function() {
+		var hooks = Tween.propHooks[ this.prop ];
+
+		return hooks && hooks.get ?
+			hooks.get( this ) :
+			Tween.propHooks._default.get( this );
+	},
+	run: function( percent ) {
+		var eased,
+			hooks = Tween.propHooks[ this.prop ];
+
+		if ( this.options.duration ) {
+			this.pos = eased = jQuery.easing[ this.easing ](
+				percent, this.options.duration * percent, 0, 1, this.options.duration
+			);
+		} else {
+			this.pos = eased = percent;
+		}
+		this.now = ( this.end - this.start ) * eased + this.start;
+
+		if ( this.options.step ) {
+			this.options.step.call( this.elem, this.now, this );
+		}
+
+		if ( hooks && hooks.set ) {
+			hooks.set( this );
+		} else {
+			Tween.propHooks._default.set( this );
+		}
+		return this;
+	}
+};
+
+Tween.prototype.init.prototype = Tween.prototype;
+
+Tween.propHooks = {
+	_default: {
+		get: function( tween ) {
+			var result;
+
+			// Use a property on the element directly when it is not a DOM element,
+			// or when there is no matching style property that exists.
+			if ( tween.elem.nodeType !== 1 ||
+				tween.elem[ tween.prop ] != null && tween.elem.style[ tween.prop ] == null ) {
+				return tween.elem[ tween.prop ];
+			}
+
+			// Passing an empty string as a 3rd parameter to .css will automatically
+			// attempt a parseFloat and fallback to a string if the parse fails.
+			// Simple values such as "10px" are parsed to Float;
+			// complex values such as "rotate(1rad)" are returned as-is.
+			result = jQuery.css( tween.elem, tween.prop, "" );
+
+			// Empty strings, null, undefined and "auto" are converted to 0.
+			return !result || result === "auto" ? 0 : result;
+		},
+		set: function( tween ) {
+
+			// Use step hook for back compat.
+			// Use cssHook if its there.
+			// Use .style if available and use plain properties where available.
+			if ( jQuery.fx.step[ tween.prop ] ) {
+				jQuery.fx.step[ tween.prop ]( tween );
+			} else if ( tween.elem.nodeType === 1 && (
+				jQuery.cssHooks[ tween.prop ] ||
+					tween.elem.style[ finalPropName( tween.prop ) ] != null ) ) {
+				jQuery.style( tween.elem, tween.prop, tween.now + tween.unit );
+			} else {
+				tween.elem[ tween.prop ] = tween.now;
+			}
+		}
+	}
+};
+
+// Support: IE <=9 only
+// Panic based approach to setting things on disconnected nodes
+Tween.propHooks.scrollTop = Tween.propHooks.scrollLeft = {
+	set: function( tween ) {
+		if ( tween.elem.nodeType && tween.elem.parentNode ) {
+			tween.elem[ tween.prop ] = tween.now;
+		}
+	}
+};
+
+jQuery.easing = {
+	linear: function( p ) {
+		return p;
+	},
+	swing: function( p ) {
+		return 0.5 - Math.cos( p * Math.PI ) / 2;
+	},
+	_default: "swing"
+};
+
+jQuery.fx = Tween.prototype.init;
+
+// Back compat <1.8 extension point
+jQuery.fx.step = {};
+
+
+
+
+var
+	fxNow, inProgress,
+	rfxtypes = /^(?:toggle|show|hide)$/,
+	rrun = /queueHooks$/;
+
+function schedule() {
+	if ( inProgress ) {
+		if ( document.hidden === false && window.requestAnimationFrame ) {
+			window.requestAnimationFrame( schedule );
+		} else {
+			window.setTimeout( schedule, jQuery.fx.interval );
+		}
+
+		jQuery.fx.tick();
+	}
+}
+
+// Animations created synchronously will run synchronously
+function createFxNow() {
+	window.setTimeout( function() {
+		fxNow = undefined;
+	} );
+	return ( fxNow = Date.now() );
+}
+
+// Generate parameters to create a standard animation
+function genFx( type, includeWidth ) {
+	var which,
+		i = 0,
+		attrs = { height: type };
+
+	// If we include width, step value is 1 to do all cssExpand values,
+	// otherwise step value is 2 to skip over Left and Right
+	includeWidth = includeWidth ? 1 : 0;
+	for ( ; i < 4; i += 2 - includeWidth ) {
+		which = cssExpand[ i ];
+		attrs[ "margin" + which ] = attrs[ "padding" + which ] = type;
+	}
+
+	if ( includeWidth ) {
+		attrs.opacity = attrs.width = type;
+	}
+
+	return attrs;
+}
+
+function createTween( value, prop, animation ) {
+	var tween,
+		collection = ( Animation.tweeners[ prop ] || [] ).concat( Animation.tweeners[ "*" ] ),
+		index = 0,
+		length = collection.length;
+	for ( ; index < length; index++ ) {
+		if ( ( tween = collection[ index ].call( animation, prop, value ) ) ) {
+
+			// We're done with this property
+			return tween;
+		}
+	}
+}
+
+function defaultPrefilter( elem, props, opts ) {
+	var prop, value, toggle, hooks, oldfire, propTween, restoreDisplay, display,
+		isBox = "width" in props || "height" in props,
+		anim = this,
+		orig = {},
+		style = elem.style,
+		hidden = elem.nodeType && isHiddenWithinTree( elem ),
+		dataShow = dataPriv.get( elem, "fxshow" );
+
+	// Queue-skipping animations hijack the fx hooks
+	if ( !opts.queue ) {
+		hooks = jQuery._queueHooks( elem, "fx" );
+		if ( hooks.unqueued == null ) {
+			hooks.unqueued = 0;
+			oldfire = hooks.empty.fire;
+			hooks.empty.fire = function() {
+				if ( !hooks.unqueued ) {
+					oldfire();
+				}
+			};
+		}
+		hooks.unqueued++;
+
+		anim.always( function() {
+
+			// Ensure the complete handler is called before this completes
+			anim.always( function() {
+				hooks.unqueued--;
+				if ( !jQuery.queue( elem, "fx" ).length ) {
+					hooks.empty.fire();
+				}
+			} );
+		} );
+	}
+
+	// Detect show/hide animations
+	for ( prop in props ) {
+		value = props[ prop ];
+		if ( rfxtypes.test( value ) ) {
+			delete props[ prop ];
+			toggle = toggle || value === "toggle";
+			if ( value === ( hidden ? "hide" : "show" ) ) {
+
+				// Pretend to be hidden if this is a "show" and
+				// there is still data from a stopped show/hide
+				if ( value === "show" && dataShow && dataShow[ prop ] !== undefined ) {
+					hidden = true;
+
+				// Ignore all other no-op show/hide data
+				} else {
+					continue;
+				}
+			}
+			orig[ prop ] = dataShow && dataShow[ prop ] || jQuery.style( elem, prop );
+		}
+	}
+
+	// Bail out if this is a no-op like .hide().hide()
+	propTween = !jQuery.isEmptyObject( props );
+	if ( !propTween && jQuery.isEmptyObject( orig ) ) {
+		return;
+	}
+
+	// Restrict "overflow" and "display" styles during box animations
+	if ( isBox && elem.nodeType === 1 ) {
+
+		// Support: IE <=9 - 11, Edge 12 - 15
+		// Record all 3 overflow attributes because IE does not infer the shorthand
+		// from identically-valued overflowX and overflowY and Edge just mirrors
+		// the overflowX value there.
+		opts.overflow = [ style.overflow, style.overflowX, style.overflowY ];
+
+		// Identify a display type, preferring old show/hide data over the CSS cascade
+		restoreDisplay = dataShow && dataShow.display;
+		if ( restoreDisplay == null ) {
+			restoreDisplay = dataPriv.get( elem, "display" );
+		}
+		display = jQuery.css( elem, "display" );
+		if ( display === "none" ) {
+			if ( restoreDisplay ) {
+				display = restoreDisplay;
+			} else {
+
+				// Get nonempty value(s) by temporarily forcing visibility
+				showHide( [ elem ], true );
+				restoreDisplay = elem.style.display || restoreDisplay;
+				display = jQuery.css( elem, "display" );
+				showHide( [ elem ] );
+			}
+		}
+
+		// Animate inline elements as inline-block
+		if ( display === "inline" || display === "inline-block" && restoreDisplay != null ) {
+			if ( jQuery.css( elem, "float" ) === "none" ) {
+
+				// Restore the original display value at the end of pure show/hide animations
+				if ( !propTween ) {
+					anim.done( function() {
+						style.display = restoreDisplay;
+					} );
+					if ( restoreDisplay == null ) {
+						display = style.display;
+						restoreDisplay = display === "none" ? "" : display;
+					}
+				}
+				style.display = "inline-block";
+			}
+		}
+	}
+
+	if ( opts.overflow ) {
+		style.overflow = "hidden";
+		anim.always( function() {
+			style.overflow = opts.overflow[ 0 ];
+			style.overflowX = opts.overflow[ 1 ];
+			style.overflowY = opts.overflow[ 2 ];
+		} );
+	}
+
+	// Implement show/hide animations
+	propTween = false;
+	for ( prop in orig ) {
+
+		// General show/hide setup for this element animation
+		if ( !propTween ) {
+			if ( dataShow ) {
+				if ( "hidden" in dataShow ) {
+					hidden = dataShow.hidden;
+				}
+			} else {
+				dataShow = dataPriv.access( elem, "fxshow", { display: restoreDisplay } );
+			}
+
+			// Store hidden/visible for toggle so `.stop().toggle()` "reverses"
+			if ( toggle ) {
+				dataShow.hidden = !hidden;
+			}
+
+			// Show elements before animating them
+			if ( hidden ) {
+				showHide( [ elem ], true );
+			}
+
+			/* eslint-disable no-loop-func */
+
+			anim.done( function() {
+
+				/* eslint-enable no-loop-func */
+
+				// The final step of a "hide" animation is actually hiding the element
+				if ( !hidden ) {
+					showHide( [ elem ] );
+				}
+				dataPriv.remove( elem, "fxshow" );
+				for ( prop in orig ) {
+					jQuery.style( elem, prop, orig[ prop ] );
+				}
+			} );
+		}
+
+		// Per-property setup
+		propTween = createTween( hidden ? dataShow[ prop ] : 0, prop, anim );
+		if ( !( prop in dataShow ) ) {
+			dataShow[ prop ] = propTween.start;
+			if ( hidden ) {
+				propTween.end = propTween.start;
+				propTween.start = 0;
+			}
+		}
+	}
+}
+
+function propFilter( props, specialEasing ) {
+	var index, name, easing, value, hooks;
+
+	// camelCase, specialEasing and expand cssHook pass
+	for ( index in props ) {
+		name = camelCase( index );
+		easing = specialEasing[ name ];
+		value = props[ index ];
+		if ( Array.isArray( value ) ) {
+			easing = value[ 1 ];
+			value = props[ index ] = value[ 0 ];
+		}
+
+		if ( index !== name ) {
+			props[ name ] = value;
+			delete props[ index ];
+		}
+
+		hooks = jQuery.cssHooks[ name ];
+		if ( hooks && "expand" in hooks ) {
+			value = hooks.expand( value );
+			delete props[ name ];
+
+			// Not quite $.extend, this won't overwrite existing keys.
+			// Reusing 'index' because we have the correct "name"
+			for ( index in value ) {
+				if ( !( index in props ) ) {
+					props[ index ] = value[ index ];
+					specialEasing[ index ] = easing;
+				}
+			}
+		} else {
+			specialEasing[ name ] = easing;
+		}
+	}
+}
+
+function Animation( elem, properties, options ) {
+	var result,
+		stopped,
+		index = 0,
+		length = Animation.prefilters.length,
+		deferred = jQuery.Deferred().always( function() {
+
+			// Don't match elem in the :animated selector
+			delete tick.elem;
+		} ),
+		tick = function() {
+			if ( stopped ) {
+				return false;
+			}
+			var currentTime = fxNow || createFxNow(),
+				remaining = Math.max( 0, animation.startTime + animation.duration - currentTime ),
+
+				// Support: Android 2.3 only
+				// Archaic crash bug won't allow us to use `1 - ( 0.5 || 0 )` (#12497)
+				temp = remaining / animation.duration || 0,
+				percent = 1 - temp,
+				index = 0,
+				length = animation.tweens.length;
+
+			for ( ; index < length; index++ ) {
+				animation.tweens[ index ].run( percent );
+			}
+
+			deferred.notifyWith( elem, [ animation, percent, remaining ] );
+
+			// If there's more to do, yield
+			if ( percent < 1 && length ) {
+				return remaining;
+			}
+
+			// If this was an empty animation, synthesize a final progress notification
+			if ( !length ) {
+				deferred.notifyWith( elem, [ animation, 1, 0 ] );
+			}
+
+			// Resolve the animation and report its conclusion
+			deferred.resolveWith( elem, [ animation ] );
+			return false;
+		},
+		animation = deferred.promise( {
+			elem: elem,
+			props: jQuery.extend( {}, properties ),
+			opts: jQuery.extend( true, {
+				specialEasing: {},
+				easing: jQuery.easing._default
+			}, options ),
+			originalProperties: properties,
+			originalOptions: options,
+			startTime: fxNow || createFxNow(),
+			duration: options.duration,
+			tweens: [],
+			createTween: function( prop, end ) {
+				var tween = jQuery.Tween( elem, animation.opts, prop, end,
+					animation.opts.specialEasing[ prop ] || animation.opts.easing );
+				animation.tweens.push( tween );
+				return tween;
+			},
+			stop: function( gotoEnd ) {
+				var index = 0,
+
+					// If we are going to the end, we want to run all the tweens
+					// otherwise we skip this part
+					length = gotoEnd ? animation.tweens.length : 0;
+				if ( stopped ) {
+					return this;
+				}
+				stopped = true;
+				for ( ; index < length; index++ ) {
+					animation.tweens[ index ].run( 1 );
+				}
+
+				// Resolve when we played the last frame; otherwise, reject
+				if ( gotoEnd ) {
+					deferred.notifyWith( elem, [ animation, 1, 0 ] );
+					deferred.resolveWith( elem, [ animation, gotoEnd ] );
+				} else {
+					deferred.rejectWith( elem, [ animation, gotoEnd ] );
+				}
+				return this;
+			}
+		} ),
+		props = animation.props;
+
+	propFilter( props, animation.opts.specialEasing );
+
+	for ( ; index < length; index++ ) {
+		result = Animation.prefilters[ index ].call( animation, elem, props, animation.opts );
+		if ( result ) {
+			if ( isFunction( result.stop ) ) {
+				jQuery._queueHooks( animation.elem, animation.opts.queue ).stop =
+					result.stop.bind( result );
+			}
+			return result;
+		}
+	}
+
+	jQuery.map( props, createTween, animation );
+
+	if ( isFunction( animation.opts.start ) ) {
+		animation.opts.start.call( elem, animation );
+	}
+
+	// Attach callbacks from options
+	animation
+		.progress( animation.opts.progress )
+		.done( animation.opts.done, animation.opts.complete )
+		.fail( animation.opts.fail )
+		.always( animation.opts.always );
+
+	jQuery.fx.timer(
+		jQuery.extend( tick, {
+			elem: elem,
+			anim: animation,
+			queue: animation.opts.queue
+		} )
+	);
+
+	return animation;
+}
+
+jQuery.Animation = jQuery.extend( Animation, {
+
+	tweeners: {
+		"*": [ function( prop, value ) {
+			var tween = this.createTween( prop, value );
+			adjustCSS( tween.elem, prop, rcssNum.exec( value ), tween );
+			return tween;
+		} ]
+	},
+
+	tweener: function( props, callback ) {
+		if ( isFunction( props ) ) {
+			callback = props;
+			props = [ "*" ];
+		} else {
+			props = props.match( rnothtmlwhite );
+		}
+
+		var prop,
+			index = 0,
+			length = props.length;
+
+		for ( ; index < length; index++ ) {
+			prop = props[ index ];
+			Animation.tweeners[ prop ] = Animation.tweeners[ prop ] || [];
+			Animation.tweeners[ prop ].unshift( callback );
+		}
+	},
+
+	prefilters: [ defaultPrefilter ],
+
+	prefilter: function( callback, prepend ) {
+		if ( prepend ) {
+			Animation.prefilters.unshift( callback );
+		} else {
+			Animation.prefilters.push( callback );
+		}
+	}
+} );
+
+jQuery.speed = function( speed, easing, fn ) {
+	var opt = speed && typeof speed === "object" ? jQuery.extend( {}, speed ) : {
+		complete: fn || !fn && easing ||
+			isFunction( speed ) && speed,
+		duration: speed,
+		easing: fn && easing || easing && !isFunction( easing ) && easing
+	};
+
+	// Go to the end state if fx are off
+	if ( jQuery.fx.off ) {
+		opt.duration = 0;
+
+	} else {
+		if ( typeof opt.duration !== "number" ) {
+			if ( opt.duration in jQuery.fx.speeds ) {
+				opt.duration = jQuery.fx.speeds[ opt.duration ];
+
+			} else {
+				opt.duration = jQuery.fx.speeds._default;
+			}
+		}
+	}
+
+	// Normalize opt.queue - true/undefined/null -> "fx"
+	if ( opt.queue == null || opt.queue === true ) {
+		opt.queue = "fx";
+	}
+
+	// Queueing
+	opt.old = opt.complete;
+
+	opt.complete = function() {
+		if ( isFunction( opt.old ) ) {
+			opt.old.call( this );
+		}
+
+		if ( opt.queue ) {
+			jQuery.dequeue( this, opt.queue );
+		}
+	};
+
+	return opt;
+};
+
+jQuery.fn.extend( {
+	fadeTo: function( speed, to, easing, callback ) {
+
+		// Show any hidden elements after setting opacity to 0
+		return this.filter( isHiddenWithinTree ).css( "opacity", 0 ).show()
+
+			// Animate to the value specified
+			.end().animate( { opacity: to }, speed, easing, callback );
+	},
+	animate: function( prop, speed, easing, callback ) {
+		var empty = jQuery.isEmptyObject( prop ),
+			optall = jQuery.speed( speed, easing, callback ),
+			doAnimation = function() {
+
+				// Operate on a copy of prop so per-property easing won't be lost
+				var anim = Animation( this, jQuery.extend( {}, prop ), optall );
+
+				// Empty animations, or finishing resolves immediately
+				if ( empty || dataPriv.get( this, "finish" ) ) {
+					anim.stop( true );
+				}
+			};
+
+		doAnimation.finish = doAnimation;
+
+		return empty || optall.queue === false ?
+			this.each( doAnimation ) :
+			this.queue( optall.queue, doAnimation );
+	},
+	stop: function( type, clearQueue, gotoEnd ) {
+		var stopQueue = function( hooks ) {
+			var stop = hooks.stop;
+			delete hooks.stop;
+			stop( gotoEnd );
+		};
+
+		if ( typeof type !== "string" ) {
+			gotoEnd = clearQueue;
+			clearQueue = type;
+			type = undefined;
+		}
+		if ( clearQueue ) {
+			this.queue( type || "fx", [] );
+		}
+
+		return this.each( function() {
+			var dequeue = true,
+				index = type != null && type + "queueHooks",
+				timers = jQuery.timers,
+				data = dataPriv.get( this );
+
+			if ( index ) {
+				if ( data[ index ] && data[ index ].stop ) {
+					stopQueue( data[ index ] );
+				}
+			} else {
+				for ( index in data ) {
+					if ( data[ index ] && data[ index ].stop && rrun.test( index ) ) {
+						stopQueue( data[ index ] );
+					}
+				}
+			}
+
+			for ( index = timers.length; index--; ) {
+				if ( timers[ index ].elem === this &&
+					( type == null || timers[ index ].queue === type ) ) {
+
+					timers[ index ].anim.stop( gotoEnd );
+					dequeue = false;
+					timers.splice( index, 1 );
+				}
+			}
+
+			// Start the next in the queue if the last step wasn't forced.
+			// Timers currently will call their complete callbacks, which
+			// will dequeue but only if they were gotoEnd.
+			if ( dequeue || !gotoEnd ) {
+				jQuery.dequeue( this, type );
+			}
+		} );
+	},
+	finish: function( type ) {
+		if ( type !== false ) {
+			type = type || "fx";
+		}
+		return this.each( function() {
+			var index,
+				data = dataPriv.get( this ),
+				queue = data[ type + "queue" ],
+				hooks = data[ type + "queueHooks" ],
+				timers = jQuery.timers,
+				length = queue ? queue.length : 0;
+
+			// Enable finishing flag on private data
+			data.finish = true;
+
+			// Empty the queue first
+			jQuery.queue( this, type, [] );
+
+			if ( hooks && hooks.stop ) {
+				hooks.stop.call( this, true );
+			}
+
+			// Look for any active animations, and finish them
+			for ( index = timers.length; index--; ) {
+				if ( timers[ index ].elem === this && timers[ index ].queue === type ) {
+					timers[ index ].anim.stop( true );
+					timers.splice( index, 1 );
+				}
+			}
+
+			// Look for any animations in the old queue and finish them
+			for ( index = 0; index < length; index++ ) {
+				if ( queue[ index ] && queue[ index ].finish ) {
+					queue[ index ].finish.call( this );
+				}
+			}
+
+			// Turn off finishing flag
+			delete data.finish;
+		} );
+	}
+} );
+
+jQuery.each( [ "toggle", "show", "hide" ], function( _i, name ) {
+	var cssFn = jQuery.fn[ name ];
+	jQuery.fn[ name ] = function( speed, easing, callback ) {
+		return speed == null || typeof speed === "boolean" ?
+			cssFn.apply( this, arguments ) :
+			this.animate( genFx( name, true ), speed, easing, callback );
+	};
+} );
+
+// Generate shortcuts for custom animations
+jQuery.each( {
+	slideDown: genFx( "show" ),
+	slideUp: genFx( "hide" ),
+	slideToggle: genFx( "toggle" ),
+	fadeIn: { opacity: "show" },
+	fadeOut: { opacity: "hide" },
+	fadeToggle: { opacity: "toggle" }
+}, function( name, props ) {
+	jQuery.fn[ name ] = function( speed, easing, callback ) {
+		return this.animate( props, speed, easing, callback );
+	};
+} );
+
+jQuery.timers = [];
+jQuery.fx.tick = function() {
+	var timer,
+		i = 0,
+		timers = jQuery.timers;
+
+	fxNow = Date.now();
+
+	for ( ; i < timers.length; i++ ) {
+		timer = timers[ i ];
+
+		// Run the timer and safely remove it when done (allowing for external removal)
+		if ( !timer() && timers[ i ] === timer ) {
+			timers.splice( i--, 1 );
+		}
+	}
+
+	if ( !timers.length ) {
+		jQuery.fx.stop();
+	}
+	fxNow = undefined;
+};
+
+jQuery.fx.timer = function( timer ) {
+	jQuery.timers.push( timer );
+	jQuery.fx.start();
+};
+
+jQuery.fx.interval = 13;
+jQuery.fx.start = function() {
+	if ( inProgress ) {
+		return;
+	}
+
+	inProgress = true;
+	schedule();
+};
+
+jQuery.fx.stop = function() {
+	inProgress = null;
+};
+
+jQuery.fx.speeds = {
+	slow: 600,
+	fast: 200,
+
+	// Default speed
+	_default: 400
+};
+
+
+// Based off of the plugin by Clint Helfers, with permission.
+// https://web.archive.org/web/20100324014747/http://blindsignals.com/index.php/2009/07/jquery-delay/
+jQuery.fn.delay = function( time, type ) {
+	time = jQuery.fx ? jQuery.fx.speeds[ time ] || time : time;
+	type = type || "fx";
+
+	return this.queue( type, function( next, hooks ) {
+		var timeout = window.setTimeout( next, time );
+		hooks.stop = function() {
+			window.clearTimeout( timeout );
+		};
+	} );
+};
+
+
+( function() {
+	var input = document.createElement( "input" ),
+		select = document.createElement( "select" ),
+		opt = select.appendChild( document.createElement( "option" ) );
+
+	input.type = "checkbox";
+
+	// Support: Android <=4.3 only
+	// Default value for a checkbox should be "on"
+	support.checkOn = input.value !== "";
+
+	// Support: IE <=11 only
+	// Must access selectedIndex to make default options select
+	support.optSelected = opt.selected;
+
+	// Support: IE <=11 only
+	// An input loses its value after becoming a radio
+	input = document.createElement( "input" );
+	input.value = "t";
+	input.type = "radio";
+	support.radioValue = input.value === "t";
+} )();
+
+
+var boolHook,
+	attrHandle = jQuery.expr.attrHandle;
+
+jQuery.fn.extend( {
+	attr: function( name, value ) {
+		return access( this, jQuery.attr, name, value, arguments.length > 1 );
+	},
+
+	removeAttr: function( name ) {
+		return this.each( function() {
+			jQuery.removeAttr( this, name );
+		} );
+	}
+} );
+
+jQuery.extend( {
+	attr: function( elem, name, value ) {
+		var ret, hooks,
+			nType = elem.nodeType;
+
+		// Don't get/set attributes on text, comment and attribute nodes
+		if ( nType === 3 || nType === 8 || nType === 2 ) {
+			return;
+		}
+
+		// Fallback to prop when attributes are not supported
+		if ( typeof elem.getAttribute === "undefined" ) {
+			return jQuery.prop( elem, name, value );
+		}
+
+		// Attribute hooks are determined by the lowercase version
+		// Grab necessary hook if one is defined
+		if ( nType !== 1 || !jQuery.isXMLDoc( elem ) ) {
+			hooks = jQuery.attrHooks[ name.toLowerCase() ] ||
+				( jQuery.expr.match.bool.test( name ) ? boolHook : undefined );
+		}
+
+		if ( value !== undefined ) {
+			if ( value === null ) {
+				jQuery.removeAttr( elem, name );
+				return;
+			}
+
+			if ( hooks && "set" in hooks &&
+				( ret = hooks.set( elem, value, name ) ) !== undefined ) {
+				return ret;
+			}
+
+			elem.setAttribute( name, value + "" );
+			return value;
+		}
+
+		if ( hooks && "get" in hooks && ( ret = hooks.get( elem, name ) ) !== null ) {
+			return ret;
+		}
+
+		ret = jQuery.find.attr( elem, name );
+
+		// Non-existent attributes return null, we normalize to undefined
+		return ret == null ? undefined : ret;
+	},
+
+	attrHooks: {
+		type: {
+			set: function( elem, value ) {
+				if ( !support.radioValue && value === "radio" &&
+					nodeName( elem, "input" ) ) {
+					var val = elem.value;
+					elem.setAttribute( "type", value );
+					if ( val ) {
+						elem.value = val;
+					}
+					return value;
+				}
+			}
+		}
+	},
+
+	removeAttr: function( elem, value ) {
+		var name,
+			i = 0,
+
+			// Attribute names can contain non-HTML whitespace characters
+			// https://html.spec.whatwg.org/multipage/syntax.html#attributes-2
+			attrNames = value && value.match( rnothtmlwhite );
+
+		if ( attrNames && elem.nodeType === 1 ) {
+			while ( ( name = attrNames[ i++ ] ) ) {
+				elem.removeAttribute( name );
+			}
+		}
+	}
+} );
+
+// Hooks for boolean attributes
+boolHook = {
+	set: function( elem, value, name ) {
+		if ( value === false ) {
+
+			// Remove boolean attributes when set to false
+			jQuery.removeAttr( elem, name );
+		} else {
+			elem.setAttribute( name, name );
+		}
+		return name;
+	}
+};
+
+jQuery.each( jQuery.expr.match.bool.source.match( /\w+/g ), function( _i, name ) {
+	var getter = attrHandle[ name ] || jQuery.find.attr;
+
+	attrHandle[ name ] = function( elem, name, isXML ) {
+		var ret, handle,
+			lowercaseName = name.toLowerCase();
+
+		if ( !isXML ) {
+
+			// Avoid an infinite loop by temporarily removing this function from the getter
+			handle = attrHandle[ lowercaseName ];
+			attrHandle[ lowercaseName ] = ret;
+			ret = getter( elem, name, isXML ) != null ?
+				lowercaseName :
+				null;
+			attrHandle[ lowercaseName ] = handle;
+		}
+		return ret;
+	};
+} );
+
+
+
+
+var rfocusable = /^(?:input|select|textarea|button)$/i,
+	rclickable = /^(?:a|area)$/i;
+
+jQuery.fn.extend( {
+	prop: function( name, value ) {
+		return access( this, jQuery.prop, name, value, arguments.length > 1 );
+	},
+
+	removeProp: function( name ) {
+		return this.each( function() {
+			delete this[ jQuery.propFix[ name ] || name ];
+		} );
+	}
+} );
+
+jQuery.extend( {
+	prop: function( elem, name, value ) {
+		var ret, hooks,
+			nType = elem.nodeType;
+
+		// Don't get/set properties on text, comment and attribute nodes
+		if ( nType === 3 || nType === 8 || nType === 2 ) {
+			return;
+		}
+
+		if ( nType !== 1 || !jQuery.isXMLDoc( elem ) ) {
+
+			// Fix name and attach hooks
+			name = jQuery.propFix[ name ] || name;
+			hooks = jQuery.propHooks[ name ];
+		}
+
+		if ( value !== undefined ) {
+			if ( hooks && "set" in hooks &&
+				( ret = hooks.set( elem, value, name ) ) !== undefined ) {
+				return ret;
+			}
+
+			return ( elem[ name ] = value );
+		}
+
+		if ( hooks && "get" in hooks && ( ret = hooks.get( elem, name ) ) !== null ) {
+			return ret;
+		}
+
+		return elem[ name ];
+	},
+
+	propHooks: {
+		tabIndex: {
+			get: function( elem ) {
+
+				// Support: IE <=9 - 11 only
+				// elem.tabIndex doesn't always return the
+				// correct value when it hasn't been explicitly set
+				// https://web.archive.org/web/20141116233347/http://fluidproject.org/blog/2008/01/09/getting-setting-and-removing-tabindex-values-with-javascript/
+				// Use proper attribute retrieval(#12072)
+				var tabindex = jQuery.find.attr( elem, "tabindex" );
+
+				if ( tabindex ) {
+					return parseInt( tabindex, 10 );
+				}
+
+				if (
+					rfocusable.test( elem.nodeName ) ||
+					rclickable.test( elem.nodeName ) &&
+					elem.href
+				) {
+					return 0;
+				}
+
+				return -1;
+			}
+		}
+	},
+
+	propFix: {
+		"for": "htmlFor",
+		"class": "className"
+	}
+} );
+
+// Support: IE <=11 only
+// Accessing the selectedIndex property
+// forces the browser to respect setting selected
+// on the option
+// The getter ensures a default option is selected
+// when in an optgroup
+// eslint rule "no-unused-expressions" is disabled for this code
+// since it considers such accessions noop
+if ( !support.optSelected ) {
+	jQuery.propHooks.selected = {
+		get: function( elem ) {
+
+			/* eslint no-unused-expressions: "off" */
+
+			var parent = elem.parentNode;
+			if ( parent && parent.parentNode ) {
+				parent.parentNode.selectedIndex;
+			}
+			return null;
+		},
+		set: function( elem ) {
+
+			/* eslint no-unused-expressions: "off" */
+
+			var parent = elem.parentNode;
+			if ( parent ) {
+				parent.selectedIndex;
+
+				if ( parent.parentNode ) {
+					parent.parentNode.selectedIndex;
+				}
+			}
+		}
+	};
+}
+
+jQuery.each( [
+	"tabIndex",
+	"readOnly",
+	"maxLength",
+	"cellSpacing",
+	"cellPadding",
+	"rowSpan",
+	"colSpan",
+	"useMap",
+	"frameBorder",
+	"contentEditable"
+], function() {
+	jQuery.propFix[ this.toLowerCase() ] = this;
+} );
+
+
+
+
+	// Strip and collapse whitespace according to HTML spec
+	// https://infra.spec.whatwg.org/#strip-and-collapse-ascii-whitespace
+	function stripAndCollapse( value ) {
+		var tokens = value.match( rnothtmlwhite ) || [];
+		return tokens.join( " " );
+	}
+
+
+function getClass( elem ) {
+	return elem.getAttribute && elem.getAttribute( "class" ) || "";
+}
+
+function classesToArray( value ) {
+	if ( Array.isArray( value ) ) {
+		return value;
+	}
+	if ( typeof value === "string" ) {
+		return value.match( rnothtmlwhite ) || [];
+	}
+	return [];
+}
+
+jQuery.fn.extend( {
+	addClass: function( value ) {
+		var classes, elem, cur, curValue, clazz, j, finalValue,
+			i = 0;
+
+		if ( isFunction( value ) ) {
+			return this.each( function( j ) {
+				jQuery( this ).addClass( value.call( this, j, getClass( this ) ) );
+			} );
+		}
+
+		classes = classesToArray( value );
+
+		if ( classes.length ) {
+			while ( ( elem = this[ i++ ] ) ) {
+				curValue = getClass( elem );
+				cur = elem.nodeType === 1 && ( " " + stripAndCollapse( curValue ) + " " );
+
+				if ( cur ) {
+					j = 0;
+					while ( ( clazz = classes[ j++ ] ) ) {
+						if ( cur.indexOf( " " + clazz + " " ) < 0 ) {
+							cur += clazz + " ";
+						}
+					}
+
+					// Only assign if different to avoid unneeded rendering.
+					finalValue = stripAndCollapse( cur );
+					if ( curValue !== finalValue ) {
+						elem.setAttribute( "class", finalValue );
+					}
+				}
+			}
+		}
+
+		return this;
+	},
+
+	removeClass: function( value ) {
+		var classes, elem, cur, curValue, clazz, j, finalValue,
+			i = 0;
+
+		if ( isFunction( value ) ) {
+			return this.each( function( j ) {
+				jQuery( this ).removeClass( value.call( this, j, getClass( this ) ) );
+			} );
+		}
+
+		if ( !arguments.length ) {
+			return this.attr( "class", "" );
+		}
+
+		classes = classesToArray( value );
+
+		if ( classes.length ) {
+			while ( ( elem = this[ i++ ] ) ) {
+				curValue = getClass( elem );
+
+				// This expression is here for better compressibility (see addClass)
+				cur = elem.nodeType === 1 && ( " " + stripAndCollapse( curValue ) + " " );
+
+				if ( cur ) {
+					j = 0;
+					while ( ( clazz = classes[ j++ ] ) ) {
+
+						// Remove *all* instances
+						while ( cur.indexOf( " " + clazz + " " ) > -1 ) {
+							cur = cur.replace( " " + clazz + " ", " " );
+						}
+					}
+
+					// Only assign if different to avoid unneeded rendering.
+					finalValue = stripAndCollapse( cur );
+					if ( curValue !== finalValue ) {
+						elem.setAttribute( "class", finalValue );
+					}
+				}
+			}
+		}
+
+		return this;
+	},
+
+	toggleClass: function( value, stateVal ) {
+		var type = typeof value,
+			isValidValue = type === "string" || Array.isArray( value );
+
+		if ( typeof stateVal === "boolean" && isValidValue ) {
+			return stateVal ? this.addClass( value ) : this.removeClass( value );
+		}
+
+		if ( isFunction( value ) ) {
+			return this.each( function( i ) {
+				jQuery( this ).toggleClass(
+					value.call( this, i, getClass( this ), stateVal ),
+					stateVal
+				);
+			} );
+		}
+
+		return this.each( function() {
+			var className, i, self, classNames;
+
+			if ( isValidValue ) {
+
+				// Toggle individual class names
+				i = 0;
+				self = jQuery( this );
+				classNames = classesToArray( value );
+
+				while ( ( className = classNames[ i++ ] ) ) {
+
+					// Check each className given, space separated list
+					if ( self.hasClass( className ) ) {
+						self.removeClass( className );
+					} else {
+						self.addClass( className );
+					}
+				}
+
+			// Toggle whole class name
+			} else if ( value === undefined || type === "boolean" ) {
+				className = getClass( this );
+				if ( className ) {
+
+					// Store className if set
+					dataPriv.set( this, "__className__", className );
+				}
+
+				// If the element has a class name or if we're passed `false`,
+				// then remove the whole classname (if there was one, the above saved it).
+				// Otherwise bring back whatever was previously saved (if anything),
+				// falling back to the empty string if nothing was stored.
+				if ( this.setAttribute ) {
+					this.setAttribute( "class",
+						className || value === false ?
+							"" :
+							dataPriv.get( this, "__className__" ) || ""
+					);
+				}
+			}
+		} );
+	},
+
+	hasClass: function( selector ) {
+		var className, elem,
+			i = 0;
+
+		className = " " + selector + " ";
+		while ( ( elem = this[ i++ ] ) ) {
+			if ( elem.nodeType === 1 &&
+				( " " + stripAndCollapse( getClass( elem ) ) + " " ).indexOf( className ) > -1 ) {
+				return true;
+			}
+		}
+
+		return false;
+	}
+} );
+
+
+
+
+var rreturn = /\r/g;
+
+jQuery.fn.extend( {
+	val: function( value ) {
+		var hooks, ret, valueIsFunction,
+			elem = this[ 0 ];
+
+		if ( !arguments.length ) {
+			if ( elem ) {
+				hooks = jQuery.valHooks[ elem.type ] ||
+					jQuery.valHooks[ elem.nodeName.toLowerCase() ];
+
+				if ( hooks &&
+					"get" in hooks &&
+					( ret = hooks.get( elem, "value" ) ) !== undefined
+				) {
+					return ret;
+				}
+
+				ret = elem.value;
+
+				// Handle most common string cases
+				if ( typeof ret === "string" ) {
+					return ret.replace( rreturn, "" );
+				}
+
+				// Handle cases where value is null/undef or number
+				return ret == null ? "" : ret;
+			}
+
+			return;
+		}
+
+		valueIsFunction = isFunction( value );
+
+		return this.each( function( i ) {
+			var val;
+
+			if ( this.nodeType !== 1 ) {
+				return;
+			}
+
+			if ( valueIsFunction ) {
+				val = value.call( this, i, jQuery( this ).val() );
+			} else {
+				val = value;
+			}
+
+			// Treat null/undefined as ""; convert numbers to string
+			if ( val == null ) {
+				val = "";
+
+			} else if ( typeof val === "number" ) {
+				val += "";
+
+			} else if ( Array.isArray( val ) ) {
+				val = jQuery.map( val, function( value ) {
+					return value == null ? "" : value + "";
+				} );
+			}
+
+			hooks = jQuery.valHooks[ this.type ] || jQuery.valHooks[ this.nodeName.toLowerCase() ];
+
+			// If set returns undefined, fall back to normal setting
+			if ( !hooks || !( "set" in hooks ) || hooks.set( this, val, "value" ) === undefined ) {
+				this.value = val;
+			}
+		} );
+	}
+} );
+
+jQuery.extend( {
+	valHooks: {
+		option: {
+			get: function( elem ) {
+
+				var val = jQuery.find.attr( elem, "value" );
+				return val != null ?
+					val :
+
+					// Support: IE <=10 - 11 only
+					// option.text throws exceptions (#14686, #14858)
+					// Strip and collapse whitespace
+					// https://html.spec.whatwg.org/#strip-and-collapse-whitespace
+					stripAndCollapse( jQuery.text( elem ) );
+			}
+		},
+		select: {
+			get: function( elem ) {
+				var value, option, i,
+					options = elem.options,
+					index = elem.selectedIndex,
+					one = elem.type === "select-one",
+					values = one ? null : [],
+					max = one ? index + 1 : options.length;
+
+				if ( index < 0 ) {
+					i = max;
+
+				} else {
+					i = one ? index : 0;
+				}
+
+				// Loop through all the selected options
+				for ( ; i < max; i++ ) {
+					option = options[ i ];
+
+					// Support: IE <=9 only
+					// IE8-9 doesn't update selected after form reset (#2551)
+					if ( ( option.selected || i === index ) &&
+
+							// Don't return options that are disabled or in a disabled optgroup
+							!option.disabled &&
+							( !option.parentNode.disabled ||
+								!nodeName( option.parentNode, "optgroup" ) ) ) {
+
+						// Get the specific value for the option
+						value = jQuery( option ).val();
+
+						// We don't need an array for one selects
+						if ( one ) {
+							return value;
+						}
+
+						// Multi-Selects return an array
+						values.push( value );
+					}
+				}
+
+				return values;
+			},
+
+			set: function( elem, value ) {
+				var optionSet, option,
+					options = elem.options,
+					values = jQuery.makeArray( value ),
+					i = options.length;
+
+				while ( i-- ) {
+					option = options[ i ];
+
+					/* eslint-disable no-cond-assign */
+
+					if ( option.selected =
+						jQuery.inArray( jQuery.valHooks.option.get( option ), values ) > -1
+					) {
+						optionSet = true;
+					}
+
+					/* eslint-enable no-cond-assign */
+				}
+
+				// Force browsers to behave consistently when non-matching value is set
+				if ( !optionSet ) {
+					elem.selectedIndex = -1;
+				}
+				return values;
+			}
+		}
+	}
+} );
+
+// Radios and checkboxes getter/setter
+jQuery.each( [ "radio", "checkbox" ], function() {
+	jQuery.valHooks[ this ] = {
+		set: function( elem, value ) {
+			if ( Array.isArray( value ) ) {
+				return ( elem.checked = jQuery.inArray( jQuery( elem ).val(), value ) > -1 );
+			}
+		}
+	};
+	if ( !support.checkOn ) {
+		jQuery.valHooks[ this ].get = function( elem ) {
+			return elem.getAttribute( "value" ) === null ? "on" : elem.value;
+		};
+	}
+} );
+
+
+
+
+// Return jQuery for attributes-only inclusion
+
+
+support.focusin = "onfocusin" in window;
+
+
+var rfocusMorph = /^(?:focusinfocus|focusoutblur)$/,
+	stopPropagationCallback = function( e ) {
+		e.stopPropagation();
+	};
+
+jQuery.extend( jQuery.event, {
+
+	trigger: function( event, data, elem, onlyHandlers ) {
+
+		var i, cur, tmp, bubbleType, ontype, handle, special, lastElement,
+			eventPath = [ elem || document ],
+			type = hasOwn.call( event, "type" ) ? event.type : event,
+			namespaces = hasOwn.call( event, "namespace" ) ? event.namespace.split( "." ) : [];
+
+		cur = lastElement = tmp = elem = elem || document;
+
+		// Don't do events on text and comment nodes
+		if ( elem.nodeType === 3 || elem.nodeType === 8 ) {
+			return;
+		}
+
+		// focus/blur morphs to focusin/out; ensure we're not firing them right now
+		if ( rfocusMorph.test( type + jQuery.event.triggered ) ) {
+			return;
+		}
+
+		if ( type.indexOf( "." ) > -1 ) {
+
+			// Namespaced trigger; create a regexp to match event type in handle()
+			namespaces = type.split( "." );
+			type = namespaces.shift();
+			namespaces.sort();
+		}
+		ontype = type.indexOf( ":" ) < 0 && "on" + type;
+
+		// Caller can pass in a jQuery.Event object, Object, or just an event type string
+		event = event[ jQuery.expando ] ?
+			event :
+			new jQuery.Event( type, typeof event === "object" && event );
+
+		// Trigger bitmask: & 1 for native handlers; & 2 for jQuery (always true)
+		event.isTrigger = onlyHandlers ? 2 : 3;
+		event.namespace = namespaces.join( "." );
+		event.rnamespace = event.namespace ?
+			new RegExp( "(^|\\.)" + namespaces.join( "\\.(?:.*\\.|)" ) + "(\\.|$)" ) :
+			null;
+
+		// Clean up the event in case it is being reused
+		event.result = undefined;
+		if ( !event.target ) {
+			event.target = elem;
+		}
+
+		// Clone any incoming data and prepend the event, creating the handler arg list
+		data = data == null ?
+			[ event ] :
+			jQuery.makeArray( data, [ event ] );
+
+		// Allow special events to draw outside the lines
+		special = jQuery.event.special[ type ] || {};
+		if ( !onlyHandlers && special.trigger && special.trigger.apply( elem, data ) === false ) {
+			return;
+		}
+
+		// Determine event propagation path in advance, per W3C events spec (#9951)
+		// Bubble up to document, then to window; watch for a global ownerDocument var (#9724)
+		if ( !onlyHandlers && !special.noBubble && !isWindow( elem ) ) {
+
+			bubbleType = special.delegateType || type;
+			if ( !rfocusMorph.test( bubbleType + type ) ) {
+				cur = cur.parentNode;
+			}
+			for ( ; cur; cur = cur.parentNode ) {
+				eventPath.push( cur );
+				tmp = cur;
+			}
+
+			// Only add window if we got to document (e.g., not plain obj or detached DOM)
+			if ( tmp === ( elem.ownerDocument || document ) ) {
+				eventPath.push( tmp.defaultView || tmp.parentWindow || window );
+			}
+		}
+
+		// Fire handlers on the event path
+		i = 0;
+		while ( ( cur = eventPath[ i++ ] ) && !event.isPropagationStopped() ) {
+			lastElement = cur;
+			event.type = i > 1 ?
+				bubbleType :
+				special.bindType || type;
+
+			// jQuery handler
+			handle = ( dataPriv.get( cur, "events" ) || Object.create( null ) )[ event.type ] &&
+				dataPriv.get( cur, "handle" );
+			if ( handle ) {
+				handle.apply( cur, data );
+			}
+
+			// Native handler
+			handle = ontype && cur[ ontype ];
+			if ( handle && handle.apply && acceptData( cur ) ) {
+				event.result = handle.apply( cur, data );
+				if ( event.result === false ) {
+					event.preventDefault();
+				}
+			}
+		}
+		event.type = type;
+
+		// If nobody prevented the default action, do it now
+		if ( !onlyHandlers && !event.isDefaultPrevented() ) {
+
+			if ( ( !special._default ||
+				special._default.apply( eventPath.pop(), data ) === false ) &&
+				acceptData( elem ) ) {
+
+				// Call a native DOM method on the target with the same name as the event.
+				// Don't do default actions on window, that's where global variables be (#6170)
+				if ( ontype && isFunction( elem[ type ] ) && !isWindow( elem ) ) {
+
+					// Don't re-trigger an onFOO event when we call its FOO() method
+					tmp = elem[ ontype ];
+
+					if ( tmp ) {
+						elem[ ontype ] = null;
+					}
+
+					// Prevent re-triggering of the same event, since we already bubbled it above
+					jQuery.event.triggered = type;
+
+					if ( event.isPropagationStopped() ) {
+						lastElement.addEventListener( type, stopPropagationCallback );
+					}
+
+					elem[ type ]();
+
+					if ( event.isPropagationStopped() ) {
+						lastElement.removeEventListener( type, stopPropagationCallback );
+					}
+
+					jQuery.event.triggered = undefined;
+
+					if ( tmp ) {
+						elem[ ontype ] = tmp;
+					}
+				}
+			}
+		}
+
+		return event.result;
+	},
+
+	// Piggyback on a donor event to simulate a different one
+	// Used only for `focus(in | out)` events
+	simulate: function( type, elem, event ) {
+		var e = jQuery.extend(
+			new jQuery.Event(),
+			event,
+			{
+				type: type,
+				isSimulated: true
+			}
+		);
+
+		jQuery.event.trigger( e, null, elem );
+	}
+
+} );
+
+jQuery.fn.extend( {
+
+	trigger: function( type, data ) {
+		return this.each( function() {
+			jQuery.event.trigger( type, data, this );
+		} );
+	},
+	triggerHandler: function( type, data ) {
+		var elem = this[ 0 ];
+		if ( elem ) {
+			return jQuery.event.trigger( type, data, elem, true );
+		}
+	}
+} );
+
+
+// Support: Firefox <=44
+// Firefox doesn't have focus(in | out) events
+// Related ticket - https://bugzilla.mozilla.org/show_bug.cgi?id=687787
+//
+// Support: Chrome <=48 - 49, Safari <=9.0 - 9.1
+// focus(in | out) events fire after focus & blur events,
+// which is spec violation - http://www.w3.org/TR/DOM-Level-3-Events/#events-focusevent-event-order
+// Related ticket - https://bugs.chromium.org/p/chromium/issues/detail?id=449857
+if ( !support.focusin ) {
+	jQuery.each( { focus: "focusin", blur: "focusout" }, function( orig, fix ) {
+
+		// Attach a single capturing handler on the document while someone wants focusin/focusout
+		var handler = function( event ) {
+			jQuery.event.simulate( fix, event.target, jQuery.event.fix( event ) );
+		};
+
+		jQuery.event.special[ fix ] = {
+			setup: function() {
+
+				// Handle: regular nodes (via `this.ownerDocument`), window
+				// (via `this.document`) & document (via `this`).
+				var doc = this.ownerDocument || this.document || this,
+					attaches = dataPriv.access( doc, fix );
+
+				if ( !attaches ) {
+					doc.addEventListener( orig, handler, true );
+				}
+				dataPriv.access( doc, fix, ( attaches || 0 ) + 1 );
+			},
+			teardown: function() {
+				var doc = this.ownerDocument || this.document || this,
+					attaches = dataPriv.access( doc, fix ) - 1;
+
+				if ( !attaches ) {
+					doc.removeEventListener( orig, handler, true );
+					dataPriv.remove( doc, fix );
+
+				} else {
+					dataPriv.access( doc, fix, attaches );
+				}
+			}
+		};
+	} );
+}
+var location = window.location;
+
+var nonce = { guid: Date.now() };
+
+var rquery = ( /\?/ );
+
+
+
+// Cross-browser xml parsing
+jQuery.parseXML = function( data ) {
+	var xml, parserErrorElem;
+	if ( !data || typeof data !== "string" ) {
+		return null;
+	}
+
+	// Support: IE 9 - 11 only
+	// IE throws on parseFromString with invalid input.
+	try {
+		xml = ( new window.DOMParser() ).parseFromString( data, "text/xml" );
+	} catch ( e ) {}
+
+	parserErrorElem = xml && xml.getElementsByTagName( "parsererror" )[ 0 ];
+	if ( !xml || parserErrorElem ) {
+		jQuery.error( "Invalid XML: " + (
+			parserErrorElem ?
+				jQuery.map( parserErrorElem.childNodes, function( el ) {
+					return el.textContent;
+				} ).join( "\n" ) :
+				data
+		) );
+	}
+	return xml;
+};
+
+
+var
+	rbracket = /\[\]$/,
+	rCRLF = /\r?\n/g,
+	rsubmitterTypes = /^(?:submit|button|image|reset|file)$/i,
+	rsubmittable = /^(?:input|select|textarea|keygen)/i;
+
+function buildParams( prefix, obj, traditional, add ) {
+	var name;
+
+	if ( Array.isArray( obj ) ) {
+
+		// Serialize array item.
+		jQuery.each( obj, function( i, v ) {
+			if ( traditional || rbracket.test( prefix ) ) {
+
+				// Treat each array item as a scalar.
+				add( prefix, v );
+
+			} else {
+
+				// Item is non-scalar (array or object), encode its numeric index.
+				buildParams(
+					prefix + "[" + ( typeof v === "object" && v != null ? i : "" ) + "]",
+					v,
+					traditional,
+					add
+				);
+			}
+		} );
+
+	} else if ( !traditional && toType( obj ) === "object" ) {
+
+		// Serialize object item.
+		for ( name in obj ) {
+			buildParams( prefix + "[" + name + "]", obj[ name ], traditional, add );
+		}
+
+	} else {
+
+		// Serialize scalar item.
+		add( prefix, obj );
+	}
+}
+
+// Serialize an array of form elements or a set of
+// key/values into a query string
+jQuery.param = function( a, traditional ) {
+	var prefix,
+		s = [],
+		add = function( key, valueOrFunction ) {
+
+			// If value is a function, invoke it and use its return value
+			var value = isFunction( valueOrFunction ) ?
+				valueOrFunction() :
+				valueOrFunction;
+
+			s[ s.length ] = encodeURIComponent( key ) + "=" +
+				encodeURIComponent( value == null ? "" : value );
+		};
+
+	if ( a == null ) {
+		return "";
+	}
+
+	// If an array was passed in, assume that it is an array of form elements.
+	if ( Array.isArray( a ) || ( a.jquery && !jQuery.isPlainObject( a ) ) ) {
+
+		// Serialize the form elements
+		jQuery.each( a, function() {
+			add( this.name, this.value );
+		} );
+
+	} else {
+
+		// If traditional, encode the "old" way (the way 1.3.2 or older
+		// did it), otherwise encode params recursively.
+		for ( prefix in a ) {
+			buildParams( prefix, a[ prefix ], traditional, add );
+		}
+	}
+
+	// Return the resulting serialization
+	return s.join( "&" );
+};
+
+jQuery.fn.extend( {
+	serialize: function() {
+		return jQuery.param( this.serializeArray() );
+	},
+	serializeArray: function() {
+		return this.map( function() {
+
+			// Can add propHook for "elements" to filter or add form elements
+			var elements = jQuery.prop( this, "elements" );
+			return elements ? jQuery.makeArray( elements ) : this;
+		} ).filter( function() {
+			var type = this.type;
+
+			// Use .is( ":disabled" ) so that fieldset[disabled] works
+			return this.name && !jQuery( this ).is( ":disabled" ) &&
+				rsubmittable.test( this.nodeName ) && !rsubmitterTypes.test( type ) &&
+				( this.checked || !rcheckableType.test( type ) );
+		} ).map( function( _i, elem ) {
+			var val = jQuery( this ).val();
+
+			if ( val == null ) {
+				return null;
+			}
+
+			if ( Array.isArray( val ) ) {
+				return jQuery.map( val, function( val ) {
+					return { name: elem.name, value: val.replace( rCRLF, "\r\n" ) };
+				} );
+			}
+
+			return { name: elem.name, value: val.replace( rCRLF, "\r\n" ) };
+		} ).get();
+	}
+} );
+
+
+var
+	r20 = /%20/g,
+	rhash = /#.*$/,
+	rantiCache = /([?&])_=[^&]*/,
+	rheaders = /^(.*?):[ \t]*([^\r\n]*)$/mg,
+
+	// #7653, #8125, #8152: local protocol detection
+	rlocalProtocol = /^(?:about|app|app-storage|.+-extension|file|res|widget):$/,
+	rnoContent = /^(?:GET|HEAD)$/,
+	rprotocol = /^\/\//,
+
+	/* Prefilters
+	 * 1) They are useful to introduce custom dataTypes (see ajax/jsonp.js for an example)
+	 * 2) These are called:
+	 *    - BEFORE asking for a transport
+	 *    - AFTER param serialization (s.data is a string if s.processData is true)
+	 * 3) key is the dataType
+	 * 4) the catchall symbol "*" can be used
+	 * 5) execution will start with transport dataType and THEN continue down to "*" if needed
+	 */
+	prefilters = {},
+
+	/* Transports bindings
+	 * 1) key is the dataType
+	 * 2) the catchall symbol "*" can be used
+	 * 3) selection will start with transport dataType and THEN go to "*" if needed
+	 */
+	transports = {},
+
+	// Avoid comment-prolog char sequence (#10098); must appease lint and evade compression
+	allTypes = "*/".concat( "*" ),
+
+	// Anchor tag for parsing the document origin
+	originAnchor = document.createElement( "a" );
+
+originAnchor.href = location.href;
+
+// Base "constructor" for jQuery.ajaxPrefilter and jQuery.ajaxTransport
+function addToPrefiltersOrTransports( structure ) {
+
+	// dataTypeExpression is optional and defaults to "*"
+	return function( dataTypeExpression, func ) {
+
+		if ( typeof dataTypeExpression !== "string" ) {
+			func = dataTypeExpression;
+			dataTypeExpression = "*";
+		}
+
+		var dataType,
+			i = 0,
+			dataTypes = dataTypeExpression.toLowerCase().match( rnothtmlwhite ) || [];
+
+		if ( isFunction( func ) ) {
+
+			// For each dataType in the dataTypeExpression
+			while ( ( dataType = dataTypes[ i++ ] ) ) {
+
+				// Prepend if requested
+				if ( dataType[ 0 ] === "+" ) {
+					dataType = dataType.slice( 1 ) || "*";
+					( structure[ dataType ] = structure[ dataType ] || [] ).unshift( func );
+
+				// Otherwise append
+				} else {
+					( structure[ dataType ] = structure[ dataType ] || [] ).push( func );
+				}
+			}
+		}
+	};
+}
+
+// Base inspection function for prefilters and transports
+function inspectPrefiltersOrTransports( structure, options, originalOptions, jqXHR ) {
+
+	var inspected = {},
+		seekingTransport = ( structure === transports );
+
+	function inspect( dataType ) {
+		var selected;
+		inspected[ dataType ] = true;
+		jQuery.each( structure[ dataType ] || [], function( _, prefilterOrFactory ) {
+			var dataTypeOrTransport = prefilterOrFactory( options, originalOptions, jqXHR );
+			if ( typeof dataTypeOrTransport === "string" &&
+				!seekingTransport && !inspected[ dataTypeOrTransport ] ) {
+
+				options.dataTypes.unshift( dataTypeOrTransport );
+				inspect( dataTypeOrTransport );
+				return false;
+			} else if ( seekingTransport ) {
+				return !( selected = dataTypeOrTransport );
+			}
+		} );
+		return selected;
+	}
+
+	return inspect( options.dataTypes[ 0 ] ) || !inspected[ "*" ] && inspect( "*" );
+}
+
+// A special extend for ajax options
+// that takes "flat" options (not to be deep extended)
+// Fixes #9887
+function ajaxExtend( target, src ) {
+	var key, deep,
+		flatOptions = jQuery.ajaxSettings.flatOptions || {};
+
+	for ( key in src ) {
+		if ( src[ key ] !== undefined ) {
+			( flatOptions[ key ] ? target : ( deep || ( deep = {} ) ) )[ key ] = src[ key ];
+		}
+	}
+	if ( deep ) {
+		jQuery.extend( true, target, deep );
+	}
+
+	return target;
+}
+
+/* Handles responses to an ajax request:
+ * - finds the right dataType (mediates between content-type and expected dataType)
+ * - returns the corresponding response
+ */
+function ajaxHandleResponses( s, jqXHR, responses ) {
+
+	var ct, type, finalDataType, firstDataType,
+		contents = s.contents,
+		dataTypes = s.dataTypes;
+
+	// Remove auto dataType and get content-type in the process
+	while ( dataTypes[ 0 ] === "*" ) {
+		dataTypes.shift();
+		if ( ct === undefined ) {
+			ct = s.mimeType || jqXHR.getResponseHeader( "Content-Type" );
+		}
+	}
+
+	// Check if we're dealing with a known content-type
+	if ( ct ) {
+		for ( type in contents ) {
+			if ( contents[ type ] && contents[ type ].test( ct ) ) {
+				dataTypes.unshift( type );
+				break;
+			}
+		}
+	}
+
+	// Check to see if we have a response for the expected dataType
+	if ( dataTypes[ 0 ] in responses ) {
+		finalDataType = dataTypes[ 0 ];
+	} else {
+
+		// Try convertible dataTypes
+		for ( type in responses ) {
+			if ( !dataTypes[ 0 ] || s.converters[ type + " " + dataTypes[ 0 ] ] ) {
+				finalDataType = type;
+				break;
+			}
+			if ( !firstDataType ) {
+				firstDataType = type;
+			}
+		}
+
+		// Or just use first one
+		finalDataType = finalDataType || firstDataType;
+	}
+
+	// If we found a dataType
+	// We add the dataType to the list if needed
+	// and return the corresponding response
+	if ( finalDataType ) {
+		if ( finalDataType !== dataTypes[ 0 ] ) {
+			dataTypes.unshift( finalDataType );
+		}
+		return responses[ finalDataType ];
+	}
+}
+
+/* Chain conversions given the request and the original response
+ * Also sets the responseXXX fields on the jqXHR instance
+ */
+function ajaxConvert( s, response, jqXHR, isSuccess ) {
+	var conv2, current, conv, tmp, prev,
+		converters = {},
+
+		// Work with a copy of dataTypes in case we need to modify it for conversion
+		dataTypes = s.dataTypes.slice();
+
+	// Create converters map with lowercased keys
+	if ( dataTypes[ 1 ] ) {
+		for ( conv in s.converters ) {
+			converters[ conv.toLowerCase() ] = s.converters[ conv ];
+		}
+	}
+
+	current = dataTypes.shift();
+
+	// Convert to each sequential dataType
+	while ( current ) {
+
+		if ( s.responseFields[ current ] ) {
+			jqXHR[ s.responseFields[ current ] ] = response;
+		}
+
+		// Apply the dataFilter if provided
+		if ( !prev && isSuccess && s.dataFilter ) {
+			response = s.dataFilter( response, s.dataType );
+		}
+
+		prev = current;
+		current = dataTypes.shift();
+
+		if ( current ) {
+
+			// There's only work to do if current dataType is non-auto
+			if ( current === "*" ) {
+
+				current = prev;
+
+			// Convert response if prev dataType is non-auto and differs from current
+			} else if ( prev !== "*" && prev !== current ) {
+
+				// Seek a direct converter
+				conv = converters[ prev + " " + current ] || converters[ "* " + current ];
+
+				// If none found, seek a pair
+				if ( !conv ) {
+					for ( conv2 in converters ) {
+
+						// If conv2 outputs current
+						tmp = conv2.split( " " );
+						if ( tmp[ 1 ] === current ) {
+
+							// If prev can be converted to accepted input
+							conv = converters[ prev + " " + tmp[ 0 ] ] ||
+								converters[ "* " + tmp[ 0 ] ];
+							if ( conv ) {
+
+								// Condense equivalence converters
+								if ( conv === true ) {
+									conv = converters[ conv2 ];
+
+								// Otherwise, insert the intermediate dataType
+								} else if ( converters[ conv2 ] !== true ) {
+									current = tmp[ 0 ];
+									dataTypes.unshift( tmp[ 1 ] );
+								}
+								break;
+							}
+						}
+					}
+				}
+
+				// Apply converter (if not an equivalence)
+				if ( conv !== true ) {
+
+					// Unless errors are allowed to bubble, catch and return them
+					if ( conv && s.throws ) {
+						response = conv( response );
+					} else {
+						try {
+							response = conv( response );
+						} catch ( e ) {
+							return {
+								state: "parsererror",
+								error: conv ? e : "No conversion from " + prev + " to " + current
+							};
+						}
+					}
+				}
+			}
+		}
+	}
+
+	return { state: "success", data: response };
+}
+
+jQuery.extend( {
+
+	// Counter for holding the number of active queries
+	active: 0,
+
+	// Last-Modified header cache for next request
+	lastModified: {},
+	etag: {},
+
+	ajaxSettings: {
+		url: location.href,
+		type: "GET",
+		isLocal: rlocalProtocol.test( location.protocol ),
+		global: true,
+		processData: true,
+		async: true,
+		contentType: "application/x-www-form-urlencoded; charset=UTF-8",
+
+		/*
+		timeout: 0,
+		data: null,
+		dataType: null,
+		username: null,
+		password: null,
+		cache: null,
+		throws: false,
+		traditional: false,
+		headers: {},
+		*/
+
+		accepts: {
+			"*": allTypes,
+			text: "text/plain",
+			html: "text/html",
+			xml: "application/xml, text/xml",
+			json: "application/json, text/javascript"
+		},
+
+		contents: {
+			xml: /\bxml\b/,
+			html: /\bhtml/,
+			json: /\bjson\b/
+		},
+
+		responseFields: {
+			xml: "responseXML",
+			text: "responseText",
+			json: "responseJSON"
+		},
+
+		// Data converters
+		// Keys separate source (or catchall "*") and destination types with a single space
+		converters: {
+
+			// Convert anything to text
+			"* text": String,
+
+			// Text to html (true = no transformation)
+			"text html": true,
+
+			// Evaluate text as a json expression
+			"text json": JSON.parse,
+
+			// Parse text as xml
+			"text xml": jQuery.parseXML
+		},
+
+		// For options that shouldn't be deep extended:
+		// you can add your own custom options here if
+		// and when you create one that shouldn't be
+		// deep extended (see ajaxExtend)
+		flatOptions: {
+			url: true,
+			context: true
+		}
+	},
+
+	// Creates a full fledged settings object into target
+	// with both ajaxSettings and settings fields.
+	// If target is omitted, writes into ajaxSettings.
+	ajaxSetup: function( target, settings ) {
+		return settings ?
+
+			// Building a settings object
+			ajaxExtend( ajaxExtend( target, jQuery.ajaxSettings ), settings ) :
+
+			// Extending ajaxSettings
+			ajaxExtend( jQuery.ajaxSettings, target );
+	},
+
+	ajaxPrefilter: addToPrefiltersOrTransports( prefilters ),
+	ajaxTransport: addToPrefiltersOrTransports( transports ),
+
+	// Main method
+	ajax: function( url, options ) {
+
+		// If url is an object, simulate pre-1.5 signature
+		if ( typeof url === "object" ) {
+			options = url;
+			url = undefined;
+		}
+
+		// Force options to be an object
+		options = options || {};
+
+		var transport,
+
+			// URL without anti-cache param
+			cacheURL,
+
+			// Response headers
+			responseHeadersString,
+			responseHeaders,
+
+			// timeout handle
+			timeoutTimer,
+
+			// Url cleanup var
+			urlAnchor,
+
+			// Request state (becomes false upon send and true upon completion)
+			completed,
+
+			// To know if global events are to be dispatched
+			fireGlobals,
+
+			// Loop variable
+			i,
+
+			// uncached part of the url
+			uncached,
+
+			// Create the final options object
+			s = jQuery.ajaxSetup( {}, options ),
+
+			// Callbacks context
+			callbackContext = s.context || s,
+
+			// Context for global events is callbackContext if it is a DOM node or jQuery collection
+			globalEventContext = s.context &&
+				( callbackContext.nodeType || callbackContext.jquery ) ?
+				jQuery( callbackContext ) :
+				jQuery.event,
+
+			// Deferreds
+			deferred = jQuery.Deferred(),
+			completeDeferred = jQuery.Callbacks( "once memory" ),
+
+			// Status-dependent callbacks
+			statusCode = s.statusCode || {},
+
+			// Headers (they are sent all at once)
+			requestHeaders = {},
+			requestHeadersNames = {},
+
+			// Default abort message
+			strAbort = "canceled",
+
+			// Fake xhr
+			jqXHR = {
+				readyState: 0,
+
+				// Builds headers hashtable if needed
+				getResponseHeader: function( key ) {
+					var match;
+					if ( completed ) {
+						if ( !responseHeaders ) {
+							responseHeaders = {};
+							while ( ( match = rheaders.exec( responseHeadersString ) ) ) {
+								responseHeaders[ match[ 1 ].toLowerCase() + " " ] =
+									( responseHeaders[ match[ 1 ].toLowerCase() + " " ] || [] )
+										.concat( match[ 2 ] );
+							}
+						}
+						match = responseHeaders[ key.toLowerCase() + " " ];
+					}
+					return match == null ? null : match.join( ", " );
+				},
+
+				// Raw string
+				getAllResponseHeaders: function() {
+					return completed ? responseHeadersString : null;
+				},
+
+				// Caches the header
+				setRequestHeader: function( name, value ) {
+					if ( completed == null ) {
+						name = requestHeadersNames[ name.toLowerCase() ] =
+							requestHeadersNames[ name.toLowerCase() ] || name;
+						requestHeaders[ name ] = value;
+					}
+					return this;
+				},
+
+				// Overrides response content-type header
+				overrideMimeType: function( type ) {
+					if ( completed == null ) {
+						s.mimeType = type;
+					}
+					return this;
+				},
+
+				// Status-dependent callbacks
+				statusCode: function( map ) {
+					var code;
+					if ( map ) {
+						if ( completed ) {
+
+							// Execute the appropriate callbacks
+							jqXHR.always( map[ jqXHR.status ] );
+						} else {
+
+							// Lazy-add the new callbacks in a way that preserves old ones
+							for ( code in map ) {
+								statusCode[ code ] = [ statusCode[ code ], map[ code ] ];
+							}
+						}
+					}
+					return this;
+				},
+
+				// Cancel the request
+				abort: function( statusText ) {
+					var finalText = statusText || strAbort;
+					if ( transport ) {
+						transport.abort( finalText );
+					}
+					done( 0, finalText );
+					return this;
+				}
+			};
+
+		// Attach deferreds
+		deferred.promise( jqXHR );
+
+		// Add protocol if not provided (prefilters might expect it)
+		// Handle falsy url in the settings object (#10093: consistency with old signature)
+		// We also use the url parameter if available
+		s.url = ( ( url || s.url || location.href ) + "" )
+			.replace( rprotocol, location.protocol + "//" );
+
+		// Alias method option to type as per ticket #12004
+		s.type = options.method || options.type || s.method || s.type;
+
+		// Extract dataTypes list
+		s.dataTypes = ( s.dataType || "*" ).toLowerCase().match( rnothtmlwhite ) || [ "" ];
+
+		// A cross-domain request is in order when the origin doesn't match the current origin.
+		if ( s.crossDomain == null ) {
+			urlAnchor = document.createElement( "a" );
+
+			// Support: IE <=8 - 11, Edge 12 - 15
+			// IE throws exception on accessing the href property if url is malformed,
+			// e.g. http://example.com:80x/
+			try {
+				urlAnchor.href = s.url;
+
+				// Support: IE <=8 - 11 only
+				// Anchor's host property isn't correctly set when s.url is relative
+				urlAnchor.href = urlAnchor.href;
+				s.crossDomain = originAnchor.protocol + "//" + originAnchor.host !==
+					urlAnchor.protocol + "//" + urlAnchor.host;
+			} catch ( e ) {
+
+				// If there is an error parsing the URL, assume it is crossDomain,
+				// it can be rejected by the transport if it is invalid
+				s.crossDomain = true;
+			}
+		}
+
+		// Convert data if not already a string
+		if ( s.data && s.processData && typeof s.data !== "string" ) {
+			s.data = jQuery.param( s.data, s.traditional );
+		}
+
+		// Apply prefilters
+		inspectPrefiltersOrTransports( prefilters, s, options, jqXHR );
+
+		// If request was aborted inside a prefilter, stop there
+		if ( completed ) {
+			return jqXHR;
+		}
+
+		// We can fire global events as of now if asked to
+		// Don't fire events if jQuery.event is undefined in an AMD-usage scenario (#15118)
+		fireGlobals = jQuery.event && s.global;
+
+		// Watch for a new set of requests
+		if ( fireGlobals && jQuery.active++ === 0 ) {
+			jQuery.event.trigger( "ajaxStart" );
+		}
+
+		// Uppercase the type
+		s.type = s.type.toUpperCase();
+
+		// Determine if request has content
+		s.hasContent = !rnoContent.test( s.type );
+
+		// Save the URL in case we're toying with the If-Modified-Since
+		// and/or If-None-Match header later on
+		// Remove hash to simplify url manipulation
+		cacheURL = s.url.replace( rhash, "" );
+
+		// More options handling for requests with no content
+		if ( !s.hasContent ) {
+
+			// Remember the hash so we can put it back
+			uncached = s.url.slice( cacheURL.length );
+
+			// If data is available and should be processed, append data to url
+			if ( s.data && ( s.processData || typeof s.data === "string" ) ) {
+				cacheURL += ( rquery.test( cacheURL ) ? "&" : "?" ) + s.data;
+
+				// #9682: remove data so that it's not used in an eventual retry
+				delete s.data;
+			}
+
+			// Add or update anti-cache param if needed
+			if ( s.cache === false ) {
+				cacheURL = cacheURL.replace( rantiCache, "$1" );
+				uncached = ( rquery.test( cacheURL ) ? "&" : "?" ) + "_=" + ( nonce.guid++ ) +
+					uncached;
+			}
+
+			// Put hash and anti-cache on the URL that will be requested (gh-1732)
+			s.url = cacheURL + uncached;
+
+		// Change '%20' to '+' if this is encoded form body content (gh-2658)
+		} else if ( s.data && s.processData &&
+			( s.contentType || "" ).indexOf( "application/x-www-form-urlencoded" ) === 0 ) {
+			s.data = s.data.replace( r20, "+" );
+		}
+
+		// Set the If-Modified-Since and/or If-None-Match header, if in ifModified mode.
+		if ( s.ifModified ) {
+			if ( jQuery.lastModified[ cacheURL ] ) {
+				jqXHR.setRequestHeader( "If-Modified-Since", jQuery.lastModified[ cacheURL ] );
+			}
+			if ( jQuery.etag[ cacheURL ] ) {
+				jqXHR.setRequestHeader( "If-None-Match", jQuery.etag[ cacheURL ] );
+			}
+		}
+
+		// Set the correct header, if data is being sent
+		if ( s.data && s.hasContent && s.contentType !== false || options.contentType ) {
+			jqXHR.setRequestHeader( "Content-Type", s.contentType );
+		}
+
+		// Set the Accepts header for the server, depending on the dataType
+		jqXHR.setRequestHeader(
+			"Accept",
+			s.dataTypes[ 0 ] && s.accepts[ s.dataTypes[ 0 ] ] ?
+				s.accepts[ s.dataTypes[ 0 ] ] +
+					( s.dataTypes[ 0 ] !== "*" ? ", " + allTypes + "; q=0.01" : "" ) :
+				s.accepts[ "*" ]
+		);
+
+		// Check for headers option
+		for ( i in s.headers ) {
+			jqXHR.setRequestHeader( i, s.headers[ i ] );
+		}
+
+		// Allow custom headers/mimetypes and early abort
+		if ( s.beforeSend &&
+			( s.beforeSend.call( callbackContext, jqXHR, s ) === false || completed ) ) {
+
+			// Abort if not done already and return
+			return jqXHR.abort();
+		}
+
+		// Aborting is no longer a cancellation
+		strAbort = "abort";
+
+		// Install callbacks on deferreds
+		completeDeferred.add( s.complete );
+		jqXHR.done( s.success );
+		jqXHR.fail( s.error );
+
+		// Get transport
+		transport = inspectPrefiltersOrTransports( transports, s, options, jqXHR );
+
+		// If no transport, we auto-abort
+		if ( !transport ) {
+			done( -1, "No Transport" );
+		} else {
+			jqXHR.readyState = 1;
+
+			// Send global event
+			if ( fireGlobals ) {
+				globalEventContext.trigger( "ajaxSend", [ jqXHR, s ] );
+			}
+
+			// If request was aborted inside ajaxSend, stop there
+			if ( completed ) {
+				return jqXHR;
+			}
+
+			// Timeout
+			if ( s.async && s.timeout > 0 ) {
+				timeoutTimer = window.setTimeout( function() {
+					jqXHR.abort( "timeout" );
+				}, s.timeout );
+			}
+
+			try {
+				completed = false;
+				transport.send( requestHeaders, done );
+			} catch ( e ) {
+
+				// Rethrow post-completion exceptions
+				if ( completed ) {
+					throw e;
+				}
+
+				// Propagate others as results
+				done( -1, e );
+			}
+		}
+
+		// Callback for when everything is done
+		function done( status, nativeStatusText, responses, headers ) {
+			var isSuccess, success, error, response, modified,
+				statusText = nativeStatusText;
+
+			// Ignore repeat invocations
+			if ( completed ) {
+				return;
+			}
+
+			completed = true;
+
+			// Clear timeout if it exists
+			if ( timeoutTimer ) {
+				window.clearTimeout( timeoutTimer );
+			}
+
+			// Dereference transport for early garbage collection
+			// (no matter how long the jqXHR object will be used)
+			transport = undefined;
+
+			// Cache response headers
+			responseHeadersString = headers || "";
+
+			// Set readyState
+			jqXHR.readyState = status > 0 ? 4 : 0;
+
+			// Determine if successful
+			isSuccess = status >= 200 && status < 300 || status === 304;
+
+			// Get response data
+			if ( responses ) {
+				response = ajaxHandleResponses( s, jqXHR, responses );
+			}
+
+			// Use a noop converter for missing script but not if jsonp
+			if ( !isSuccess &&
+				jQuery.inArray( "script", s.dataTypes ) > -1 &&
+				jQuery.inArray( "json", s.dataTypes ) < 0 ) {
+				s.converters[ "text script" ] = function() {};
+			}
+
+			// Convert no matter what (that way responseXXX fields are always set)
+			response = ajaxConvert( s, response, jqXHR, isSuccess );
+
+			// If successful, handle type chaining
+			if ( isSuccess ) {
+
+				// Set the If-Modified-Since and/or If-None-Match header, if in ifModified mode.
+				if ( s.ifModified ) {
+					modified = jqXHR.getResponseHeader( "Last-Modified" );
+					if ( modified ) {
+						jQuery.lastModified[ cacheURL ] = modified;
+					}
+					modified = jqXHR.getResponseHeader( "etag" );
+					if ( modified ) {
+						jQuery.etag[ cacheURL ] = modified;
+					}
+				}
+
+				// if no content
+				if ( status === 204 || s.type === "HEAD" ) {
+					statusText = "nocontent";
+
+				// if not modified
+				} else if ( status === 304 ) {
+					statusText = "notmodified";
+
+				// If we have data, let's convert it
+				} else {
+					statusText = response.state;
+					success = response.data;
+					error = response.error;
+					isSuccess = !error;
+				}
+			} else {
+
+				// Extract error from statusText and normalize for non-aborts
+				error = statusText;
+				if ( status || !statusText ) {
+					statusText = "error";
+					if ( status < 0 ) {
+						status = 0;
+					}
+				}
+			}
+
+			// Set data for the fake xhr object
+			jqXHR.status = status;
+			jqXHR.statusText = ( nativeStatusText || statusText ) + "";
+
+			// Success/Error
+			if ( isSuccess ) {
+				deferred.resolveWith( callbackContext, [ success, statusText, jqXHR ] );
+			} else {
+				deferred.rejectWith( callbackContext, [ jqXHR, statusText, error ] );
+			}
+
+			// Status-dependent callbacks
+			jqXHR.statusCode( statusCode );
+			statusCode = undefined;
+
+			if ( fireGlobals ) {
+				globalEventContext.trigger( isSuccess ? "ajaxSuccess" : "ajaxError",
+					[ jqXHR, s, isSuccess ? success : error ] );
+			}
+
+			// Complete
+			completeDeferred.fireWith( callbackContext, [ jqXHR, statusText ] );
+
+			if ( fireGlobals ) {
+				globalEventContext.trigger( "ajaxComplete", [ jqXHR, s ] );
+
+				// Handle the global AJAX counter
+				if ( !( --jQuery.active ) ) {
+					jQuery.event.trigger( "ajaxStop" );
+				}
+			}
+		}
+
+		return jqXHR;
+	},
+
+	getJSON: function( url, data, callback ) {
+		return jQuery.get( url, data, callback, "json" );
+	},
+
+	getScript: function( url, callback ) {
+		return jQuery.get( url, undefined, callback, "script" );
+	}
+} );
+
+jQuery.each( [ "get", "post" ], function( _i, method ) {
+	jQuery[ method ] = function( url, data, callback, type ) {
+
+		// Shift arguments if data argument was omitted
+		if ( isFunction( data ) ) {
+			type = type || callback;
+			callback = data;
+			data = undefined;
+		}
+
+		// The url can be an options object (which then must have .url)
+		return jQuery.ajax( jQuery.extend( {
+			url: url,
+			type: method,
+			dataType: type,
+			data: data,
+			success: callback
+		}, jQuery.isPlainObject( url ) && url ) );
+	};
+} );
+
+jQuery.ajaxPrefilter( function( s ) {
+	var i;
+	for ( i in s.headers ) {
+		if ( i.toLowerCase() === "content-type" ) {
+			s.contentType = s.headers[ i ] || "";
+		}
+	}
+} );
+
+
+jQuery._evalUrl = function( url, options, doc ) {
+	return jQuery.ajax( {
+		url: url,
+
+		// Make this explicit, since user can override this through ajaxSetup (#11264)
+		type: "GET",
+		dataType: "script",
+		cache: true,
+		async: false,
+		global: false,
+
+		// Only evaluate the response if it is successful (gh-4126)
+		// dataFilter is not invoked for failure responses, so using it instead
+		// of the default converter is kludgy but it works.
+		converters: {
+			"text script": function() {}
+		},
+		dataFilter: function( response ) {
+			jQuery.globalEval( response, options, doc );
+		}
+	} );
+};
+
+
+jQuery.fn.extend( {
+	wrapAll: function( html ) {
+		var wrap;
+
+		if ( this[ 0 ] ) {
+			if ( isFunction( html ) ) {
+				html = html.call( this[ 0 ] );
+			}
+
+			// The elements to wrap the target around
+			wrap = jQuery( html, this[ 0 ].ownerDocument ).eq( 0 ).clone( true );
+
+			if ( this[ 0 ].parentNode ) {
+				wrap.insertBefore( this[ 0 ] );
+			}
+
+			wrap.map( function() {
+				var elem = this;
+
+				while ( elem.firstElementChild ) {
+					elem = elem.firstElementChild;
+				}
+
+				return elem;
+			} ).append( this );
+		}
+
+		return this;
+	},
+
+	wrapInner: function( html ) {
+		if ( isFunction( html ) ) {
+			return this.each( function( i ) {
+				jQuery( this ).wrapInner( html.call( this, i ) );
+			} );
+		}
+
+		return this.each( function() {
+			var self = jQuery( this ),
+				contents = self.contents();
+
+			if ( contents.length ) {
+				contents.wrapAll( html );
+
+			} else {
+				self.append( html );
+			}
+		} );
+	},
+
+	wrap: function( html ) {
+		var htmlIsFunction = isFunction( html );
+
+		return this.each( function( i ) {
+			jQuery( this ).wrapAll( htmlIsFunction ? html.call( this, i ) : html );
+		} );
+	},
+
+	unwrap: function( selector ) {
+		this.parent( selector ).not( "body" ).each( function() {
+			jQuery( this ).replaceWith( this.childNodes );
+		} );
+		return this;
+	}
+} );
+
+
+jQuery.expr.pseudos.hidden = function( elem ) {
+	return !jQuery.expr.pseudos.visible( elem );
+};
+jQuery.expr.pseudos.visible = function( elem ) {
+	return !!( elem.offsetWidth || elem.offsetHeight || elem.getClientRects().length );
+};
+
+
+
+
+jQuery.ajaxSettings.xhr = function() {
+	try {
+		return new window.XMLHttpRequest();
+	} catch ( e ) {}
+};
+
+var xhrSuccessStatus = {
+
+		// File protocol always yields status code 0, assume 200
+		0: 200,
+
+		// Support: IE <=9 only
+		// #1450: sometimes IE returns 1223 when it should be 204
+		1223: 204
+	},
+	xhrSupported = jQuery.ajaxSettings.xhr();
+
+support.cors = !!xhrSupported && ( "withCredentials" in xhrSupported );
+support.ajax = xhrSupported = !!xhrSupported;
+
+jQuery.ajaxTransport( function( options ) {
+	var callback, errorCallback;
+
+	// Cross domain only allowed if supported through XMLHttpRequest
+	if ( support.cors || xhrSupported && !options.crossDomain ) {
+		return {
+			send: function( headers, complete ) {
+				var i,
+					xhr = options.xhr();
+
+				xhr.open(
+					options.type,
+					options.url,
+					options.async,
+					options.username,
+					options.password
+				);
+
+				// Apply custom fields if provided
+				if ( options.xhrFields ) {
+					for ( i in options.xhrFields ) {
+						xhr[ i ] = options.xhrFields[ i ];
+					}
+				}
+
+				// Override mime type if needed
+				if ( options.mimeType && xhr.overrideMimeType ) {
+					xhr.overrideMimeType( options.mimeType );
+				}
+
+				// X-Requested-With header
+				// For cross-domain requests, seeing as conditions for a preflight are
+				// akin to a jigsaw puzzle, we simply never set it to be sure.
+				// (it can always be set on a per-request basis or even using ajaxSetup)
+				// For same-domain requests, won't change header if already provided.
+				if ( !options.crossDomain && !headers[ "X-Requested-With" ] ) {
+					headers[ "X-Requested-With" ] = "XMLHttpRequest";
+				}
+
+				// Set headers
+				for ( i in headers ) {
+					xhr.setRequestHeader( i, headers[ i ] );
+				}
+
+				// Callback
+				callback = function( type ) {
+					return function() {
+						if ( callback ) {
+							callback = errorCallback = xhr.onload =
+								xhr.onerror = xhr.onabort = xhr.ontimeout =
+									xhr.onreadystatechange = null;
+
+							if ( type === "abort" ) {
+								xhr.abort();
+							} else if ( type === "error" ) {
+
+								// Support: IE <=9 only
+								// On a manual native abort, IE9 throws
+								// errors on any property access that is not readyState
+								if ( typeof xhr.status !== "number" ) {
+									complete( 0, "error" );
+								} else {
+									complete(
+
+										// File: protocol always yields status 0; see #8605, #14207
+										xhr.status,
+										xhr.statusText
+									);
+								}
+							} else {
+								complete(
+									xhrSuccessStatus[ xhr.status ] || xhr.status,
+									xhr.statusText,
+
+									// Support: IE <=9 only
+									// IE9 has no XHR2 but throws on binary (trac-11426)
+									// For XHR2 non-text, let the caller handle it (gh-2498)
+									( xhr.responseType || "text" ) !== "text"  ||
+									typeof xhr.responseText !== "string" ?
+										{ binary: xhr.response } :
+										{ text: xhr.responseText },
+									xhr.getAllResponseHeaders()
+								);
+							}
+						}
+					};
+				};
+
+				// Listen to events
+				xhr.onload = callback();
+				errorCallback = xhr.onerror = xhr.ontimeout = callback( "error" );
+
+				// Support: IE 9 only
+				// Use onreadystatechange to replace onabort
+				// to handle uncaught aborts
+				if ( xhr.onabort !== undefined ) {
+					xhr.onabort = errorCallback;
+				} else {
+					xhr.onreadystatechange = function() {
+
+						// Check readyState before timeout as it changes
+						if ( xhr.readyState === 4 ) {
+
+							// Allow onerror to be called first,
+							// but that will not handle a native abort
+							// Also, save errorCallback to a variable
+							// as xhr.onerror cannot be accessed
+							window.setTimeout( function() {
+								if ( callback ) {
+									errorCallback();
+								}
+							} );
+						}
+					};
+				}
+
+				// Create the abort callback
+				callback = callback( "abort" );
+
+				try {
+
+					// Do send the request (this may raise an exception)
+					xhr.send( options.hasContent && options.data || null );
+				} catch ( e ) {
+
+					// #14683: Only rethrow if this hasn't been notified as an error yet
+					if ( callback ) {
+						throw e;
+					}
+				}
+			},
+
+			abort: function() {
+				if ( callback ) {
+					callback();
+				}
+			}
+		};
+	}
+} );
+
+
+
+
+// Prevent auto-execution of scripts when no explicit dataType was provided (See gh-2432)
+jQuery.ajaxPrefilter( function( s ) {
+	if ( s.crossDomain ) {
+		s.contents.script = false;
+	}
+} );
+
+// Install script dataType
+jQuery.ajaxSetup( {
+	accepts: {
+		script: "text/javascript, application/javascript, " +
+			"application/ecmascript, application/x-ecmascript"
+	},
+	contents: {
+		script: /\b(?:java|ecma)script\b/
+	},
+	converters: {
+		"text script": function( text ) {
+			jQuery.globalEval( text );
+			return text;
+		}
+	}
+} );
+
+// Handle cache's special case and crossDomain
+jQuery.ajaxPrefilter( "script", function( s ) {
+	if ( s.cache === undefined ) {
+		s.cache = false;
+	}
+	if ( s.crossDomain ) {
+		s.type = "GET";
+	}
+} );
+
+// Bind script tag hack transport
+jQuery.ajaxTransport( "script", function( s ) {
+
+	// This transport only deals with cross domain or forced-by-attrs requests
+	if ( s.crossDomain || s.scriptAttrs ) {
+		var script, callback;
+		return {
+			send: function( _, complete ) {
+				script = jQuery( "<script>" )
+					.attr( s.scriptAttrs || {} )
+					.prop( { charset: s.scriptCharset, src: s.url } )
+					.on( "load error", callback = function( evt ) {
+						script.remove();
+						callback = null;
+						if ( evt ) {
+							complete( evt.type === "error" ? 404 : 200, evt.type );
+						}
+					} );
+
+				// Use native DOM manipulation to avoid our domManip AJAX trickery
+				document.head.appendChild( script[ 0 ] );
+			},
+			abort: function() {
+				if ( callback ) {
+					callback();
+				}
+			}
+		};
+	}
+} );
+
+
+
+
+var oldCallbacks = [],
+	rjsonp = /(=)\?(?=&|$)|\?\?/;
+
+// Default jsonp settings
+jQuery.ajaxSetup( {
+	jsonp: "callback",
+	jsonpCallback: function() {
+		var callback = oldCallbacks.pop() || ( jQuery.expando + "_" + ( nonce.guid++ ) );
+		this[ callback ] = true;
+		return callback;
+	}
+} );
+
+// Detect, normalize options and install callbacks for jsonp requests
+jQuery.ajaxPrefilter( "json jsonp", function( s, originalSettings, jqXHR ) {
+
+	var callbackName, overwritten, responseContainer,
+		jsonProp = s.jsonp !== false && ( rjsonp.test( s.url ) ?
+			"url" :
+			typeof s.data === "string" &&
+				( s.contentType || "" )
+					.indexOf( "application/x-www-form-urlencoded" ) === 0 &&
+				rjsonp.test( s.data ) && "data"
+		);
+
+	// Handle iff the expected data type is "jsonp" or we have a parameter to set
+	if ( jsonProp || s.dataTypes[ 0 ] === "jsonp" ) {
+
+		// Get callback name, remembering preexisting value associated with it
+		callbackName = s.jsonpCallback = isFunction( s.jsonpCallback ) ?
+			s.jsonpCallback() :
+			s.jsonpCallback;
+
+		// Insert callback into url or form data
+		if ( jsonProp ) {
+			s[ jsonProp ] = s[ jsonProp ].replace( rjsonp, "$1" + callbackName );
+		} else if ( s.jsonp !== false ) {
+			s.url += ( rquery.test( s.url ) ? "&" : "?" ) + s.jsonp + "=" + callbackName;
+		}
+
+		// Use data converter to retrieve json after script execution
+		s.converters[ "script json" ] = function() {
+			if ( !responseContainer ) {
+				jQuery.error( callbackName + " was not called" );
+			}
+			return responseContainer[ 0 ];
+		};
+
+		// Force json dataType
+		s.dataTypes[ 0 ] = "json";
+
+		// Install callback
+		overwritten = window[ callbackName ];
+		window[ callbackName ] = function() {
+			responseContainer = arguments;
+		};
+
+		// Clean-up function (fires after converters)
+		jqXHR.always( function() {
+
+			// If previous value didn't exist - remove it
+			if ( overwritten === undefined ) {
+				jQuery( window ).removeProp( callbackName );
+
+			// Otherwise restore preexisting value
+			} else {
+				window[ callbackName ] = overwritten;
+			}
+
+			// Save back as free
+			if ( s[ callbackName ] ) {
+
+				// Make sure that re-using the options doesn't screw things around
+				s.jsonpCallback = originalSettings.jsonpCallback;
+
+				// Save the callback name for future use
+				oldCallbacks.push( callbackName );
+			}
+
+			// Call if it was a function and we have a response
+			if ( responseContainer && isFunction( overwritten ) ) {
+				overwritten( responseContainer[ 0 ] );
+			}
+
+			responseContainer = overwritten = undefined;
+		} );
+
+		// Delegate to script
+		return "script";
+	}
+} );
+
+
+
+
+// Support: Safari 8 only
+// In Safari 8 documents created via document.implementation.createHTMLDocument
+// collapse sibling forms: the second one becomes a child of the first one.
+// Because of that, this security measure has to be disabled in Safari 8.
+// https://bugs.webkit.org/show_bug.cgi?id=137337
+support.createHTMLDocument = ( function() {
+	var body = document.implementation.createHTMLDocument( "" ).body;
+	body.innerHTML = "<form></form><form></form>";
+	return body.childNodes.length === 2;
+} )();
+
+
+// Argument "data" should be string of html
+// context (optional): If specified, the fragment will be created in this context,
+// defaults to document
+// keepScripts (optional): If true, will include scripts passed in the html string
+jQuery.parseHTML = function( data, context, keepScripts ) {
+	if ( typeof data !== "string" ) {
+		return [];
+	}
+	if ( typeof context === "boolean" ) {
+		keepScripts = context;
+		context = false;
+	}
+
+	var base, parsed, scripts;
+
+	if ( !context ) {
+
+		// Stop scripts or inline event handlers from being executed immediately
+		// by using document.implementation
+		if ( support.createHTMLDocument ) {
+			context = document.implementation.createHTMLDocument( "" );
+
+			// Set the base href for the created document
+			// so any parsed elements with URLs
+			// are based on the document's URL (gh-2965)
+			base = context.createElement( "base" );
+			base.href = document.location.href;
+			context.head.appendChild( base );
+		} else {
+			context = document;
+		}
+	}
+
+	parsed = rsingleTag.exec( data );
+	scripts = !keepScripts && [];
+
+	// Single tag
+	if ( parsed ) {
+		return [ context.createElement( parsed[ 1 ] ) ];
+	}
+
+	parsed = buildFragment( [ data ], context, scripts );
+
+	if ( scripts && scripts.length ) {
+		jQuery( scripts ).remove();
+	}
+
+	return jQuery.merge( [], parsed.childNodes );
+};
+
+
+/**
+ * Load a url into a page
+ */
+jQuery.fn.load = function( url, params, callback ) {
+	var selector, type, response,
+		self = this,
+		off = url.indexOf( " " );
+
+	if ( off > -1 ) {
+		selector = stripAndCollapse( url.slice( off ) );
+		url = url.slice( 0, off );
+	}
+
+	// If it's a function
+	if ( isFunction( params ) ) {
+
+		// We assume that it's the callback
+		callback = params;
+		params = undefined;
+
+	// Otherwise, build a param string
+	} else if ( params && typeof params === "object" ) {
+		type = "POST";
+	}
+
+	// If we have elements to modify, make the request
+	if ( self.length > 0 ) {
+		jQuery.ajax( {
+			url: url,
+
+			// If "type" variable is undefined, then "GET" method will be used.
+			// Make value of this field explicit since
+			// user can override it through ajaxSetup method
+			type: type || "GET",
+			dataType: "html",
+			data: params
+		} ).done( function( responseText ) {
+
+			// Save response for use in complete callback
+			response = arguments;
+
+			self.html( selector ?
+
+				// If a selector was specified, locate the right elements in a dummy div
+				// Exclude scripts to avoid IE 'Permission Denied' errors
+				jQuery( "<div>" ).append( jQuery.parseHTML( responseText ) ).find( selector ) :
+
+				// Otherwise use the full result
+				responseText );
+
+		// If the request succeeds, this function gets "data", "status", "jqXHR"
+		// but they are ignored because response was set above.
+		// If it fails, this function gets "jqXHR", "status", "error"
+		} ).always( callback && function( jqXHR, status ) {
+			self.each( function() {
+				callback.apply( this, response || [ jqXHR.responseText, status, jqXHR ] );
+			} );
+		} );
+	}
+
+	return this;
+};
+
+
+
+
+jQuery.expr.pseudos.animated = function( elem ) {
+	return jQuery.grep( jQuery.timers, function( fn ) {
+		return elem === fn.elem;
+	} ).length;
+};
+
+
+
+
+jQuery.offset = {
+	setOffset: function( elem, options, i ) {
+		var curPosition, curLeft, curCSSTop, curTop, curOffset, curCSSLeft, calculatePosition,
+			position = jQuery.css( elem, "position" ),
+			curElem = jQuery( elem ),
+			props = {};
+
+		// Set position first, in-case top/left are set even on static elem
+		if ( position === "static" ) {
+			elem.style.position = "relative";
+		}
+
+		curOffset = curElem.offset();
+		curCSSTop = jQuery.css( elem, "top" );
+		curCSSLeft = jQuery.css( elem, "left" );
+		calculatePosition = ( position === "absolute" || position === "fixed" ) &&
+			( curCSSTop + curCSSLeft ).indexOf( "auto" ) > -1;
+
+		// Need to be able to calculate position if either
+		// top or left is auto and position is either absolute or fixed
+		if ( calculatePosition ) {
+			curPosition = curElem.position();
+			curTop = curPosition.top;
+			curLeft = curPosition.left;
+
+		} else {
+			curTop = parseFloat( curCSSTop ) || 0;
+			curLeft = parseFloat( curCSSLeft ) || 0;
+		}
+
+		if ( isFunction( options ) ) {
+
+			// Use jQuery.extend here to allow modification of coordinates argument (gh-1848)
+			options = options.call( elem, i, jQuery.extend( {}, curOffset ) );
+		}
+
+		if ( options.top != null ) {
+			props.top = ( options.top - curOffset.top ) + curTop;
+		}
+		if ( options.left != null ) {
+			props.left = ( options.left - curOffset.left ) + curLeft;
+		}
+
+		if ( "using" in options ) {
+			options.using.call( elem, props );
+
+		} else {
+			curElem.css( props );
+		}
+	}
+};
+
+jQuery.fn.extend( {
+
+	// offset() relates an element's border box to the document origin
+	offset: function( options ) {
+
+		// Preserve chaining for setter
+		if ( arguments.length ) {
+			return options === undefined ?
+				this :
+				this.each( function( i ) {
+					jQuery.offset.setOffset( this, options, i );
+				} );
+		}
+
+		var rect, win,
+			elem = this[ 0 ];
+
+		if ( !elem ) {
+			return;
+		}
+
+		// Return zeros for disconnected and hidden (display: none) elements (gh-2310)
+		// Support: IE <=11 only
+		// Running getBoundingClientRect on a
+		// disconnected node in IE throws an error
+		if ( !elem.getClientRects().length ) {
+			return { top: 0, left: 0 };
+		}
+
+		// Get document-relative position by adding viewport scroll to viewport-relative gBCR
+		rect = elem.getBoundingClientRect();
+		win = elem.ownerDocument.defaultView;
+		return {
+			top: rect.top + win.pageYOffset,
+			left: rect.left + win.pageXOffset
+		};
+	},
+
+	// position() relates an element's margin box to its offset parent's padding box
+	// This corresponds to the behavior of CSS absolute positioning
+	position: function() {
+		if ( !this[ 0 ] ) {
+			return;
+		}
+
+		var offsetParent, offset, doc,
+			elem = this[ 0 ],
+			parentOffset = { top: 0, left: 0 };
+
+		// position:fixed elements are offset from the viewport, which itself always has zero offset
+		if ( jQuery.css( elem, "position" ) === "fixed" ) {
+
+			// Assume position:fixed implies availability of getBoundingClientRect
+			offset = elem.getBoundingClientRect();
+
+		} else {
+			offset = this.offset();
+
+			// Account for the *real* offset parent, which can be the document or its root element
+			// when a statically positioned element is identified
+			doc = elem.ownerDocument;
+			offsetParent = elem.offsetParent || doc.documentElement;
+			while ( offsetParent &&
+				( offsetParent === doc.body || offsetParent === doc.documentElement ) &&
+				jQuery.css( offsetParent, "position" ) === "static" ) {
+
+				offsetParent = offsetParent.parentNode;
+			}
+			if ( offsetParent && offsetParent !== elem && offsetParent.nodeType === 1 ) {
+
+				// Incorporate borders into its offset, since they are outside its content origin
+				parentOffset = jQuery( offsetParent ).offset();
+				parentOffset.top += jQuery.css( offsetParent, "borderTopWidth", true );
+				parentOffset.left += jQuery.css( offsetParent, "borderLeftWidth", true );
+			}
+		}
+
+		// Subtract parent offsets and element margins
+		return {
+			top: offset.top - parentOffset.top - jQuery.css( elem, "marginTop", true ),
+			left: offset.left - parentOffset.left - jQuery.css( elem, "marginLeft", true )
+		};
+	},
+
+	// This method will return documentElement in the following cases:
+	// 1) For the element inside the iframe without offsetParent, this method will return
+	//    documentElement of the parent window
+	// 2) For the hidden or detached element
+	// 3) For body or html element, i.e. in case of the html node - it will return itself
+	//
+	// but those exceptions were never presented as a real life use-cases
+	// and might be considered as more preferable results.
+	//
+	// This logic, however, is not guaranteed and can change at any point in the future
+	offsetParent: function() {
+		return this.map( function() {
+			var offsetParent = this.offsetParent;
+
+			while ( offsetParent && jQuery.css( offsetParent, "position" ) === "static" ) {
+				offsetParent = offsetParent.offsetParent;
+			}
+
+			return offsetParent || documentElement;
+		} );
+	}
+} );
+
+// Create scrollLeft and scrollTop methods
+jQuery.each( { scrollLeft: "pageXOffset", scrollTop: "pageYOffset" }, function( method, prop ) {
+	var top = "pageYOffset" === prop;
+
+	jQuery.fn[ method ] = function( val ) {
+		return access( this, function( elem, method, val ) {
+
+			// Coalesce documents and windows
+			var win;
+			if ( isWindow( elem ) ) {
+				win = elem;
+			} else if ( elem.nodeType === 9 ) {
+				win = elem.defaultView;
+			}
+
+			if ( val === undefined ) {
+				return win ? win[ prop ] : elem[ method ];
+			}
+
+			if ( win ) {
+				win.scrollTo(
+					!top ? val : win.pageXOffset,
+					top ? val : win.pageYOffset
+				);
+
+			} else {
+				elem[ method ] = val;
+			}
+		}, method, val, arguments.length );
+	};
+} );
+
+// Support: Safari <=7 - 9.1, Chrome <=37 - 49
+// Add the top/left cssHooks using jQuery.fn.position
+// Webkit bug: https://bugs.webkit.org/show_bug.cgi?id=29084
+// Blink bug: https://bugs.chromium.org/p/chromium/issues/detail?id=589347
+// getComputedStyle returns percent when specified for top/left/bottom/right;
+// rather than make the css module depend on the offset module, just check for it here
+jQuery.each( [ "top", "left" ], function( _i, prop ) {
+	jQuery.cssHooks[ prop ] = addGetHookIf( support.pixelPosition,
+		function( elem, computed ) {
+			if ( computed ) {
+				computed = curCSS( elem, prop );
+
+				// If curCSS returns percentage, fallback to offset
+				return rnumnonpx.test( computed ) ?
+					jQuery( elem ).position()[ prop ] + "px" :
+					computed;
+			}
+		}
+	);
+} );
+
+
+// Create innerHeight, innerWidth, height, width, outerHeight and outerWidth methods
+jQuery.each( { Height: "height", Width: "width" }, function( name, type ) {
+	jQuery.each( {
+		padding: "inner" + name,
+		content: type,
+		"": "outer" + name
+	}, function( defaultExtra, funcName ) {
+
+		// Margin is only for outerHeight, outerWidth
+		jQuery.fn[ funcName ] = function( margin, value ) {
+			var chainable = arguments.length && ( defaultExtra || typeof margin !== "boolean" ),
+				extra = defaultExtra || ( margin === true || value === true ? "margin" : "border" );
+
+			return access( this, function( elem, type, value ) {
+				var doc;
+
+				if ( isWindow( elem ) ) {
+
+					// $( window ).outerWidth/Height return w/h including scrollbars (gh-1729)
+					return funcName.indexOf( "outer" ) === 0 ?
+						elem[ "inner" + name ] :
+						elem.document.documentElement[ "client" + name ];
+				}
+
+				// Get document width or height
+				if ( elem.nodeType === 9 ) {
+					doc = elem.documentElement;
+
+					// Either scroll[Width/Height] or offset[Width/Height] or client[Width/Height],
+					// whichever is greatest
+					return Math.max(
+						elem.body[ "scroll" + name ], doc[ "scroll" + name ],
+						elem.body[ "offset" + name ], doc[ "offset" + name ],
+						doc[ "client" + name ]
+					);
+				}
+
+				return value === undefined ?
+
+					// Get width or height on the element, requesting but not forcing parseFloat
+					jQuery.css( elem, type, extra ) :
+
+					// Set width or height on the element
+					jQuery.style( elem, type, value, extra );
+			}, type, chainable ? margin : undefined, chainable );
+		};
+	} );
+} );
+
+
+jQuery.each( [
+	"ajaxStart",
+	"ajaxStop",
+	"ajaxComplete",
+	"ajaxError",
+	"ajaxSuccess",
+	"ajaxSend"
+], function( _i, type ) {
+	jQuery.fn[ type ] = function( fn ) {
+		return this.on( type, fn );
+	};
+} );
+
+
+
+
+jQuery.fn.extend( {
+
+	bind: function( types, data, fn ) {
+		return this.on( types, null, data, fn );
+	},
+	unbind: function( types, fn ) {
+		return this.off( types, null, fn );
+	},
+
+	delegate: function( selector, types, data, fn ) {
+		return this.on( types, selector, data, fn );
+	},
+	undelegate: function( selector, types, fn ) {
+
+		// ( namespace ) or ( selector, types [, fn] )
+		return arguments.length === 1 ?
+			this.off( selector, "**" ) :
+			this.off( types, selector || "**", fn );
+	},
+
+	hover: function( fnOver, fnOut ) {
+		return this.mouseenter( fnOver ).mouseleave( fnOut || fnOver );
+	}
+} );
+
+jQuery.each(
+	( "blur focus focusin focusout resize scroll click dblclick " +
+	"mousedown mouseup mousemove mouseover mouseout mouseenter mouseleave " +
+	"change select submit keydown keypress keyup contextmenu" ).split( " " ),
+	function( _i, name ) {
+
+		// Handle event binding
+		jQuery.fn[ name ] = function( data, fn ) {
+			return arguments.length > 0 ?
+				this.on( name, null, data, fn ) :
+				this.trigger( name );
+		};
+	}
+);
+
+
+
+
+// Support: Android <=4.0 only
+// Make sure we trim BOM and NBSP
+var rtrim = /^[\s\uFEFF\xA0]+|[\s\uFEFF\xA0]+$/g;
+
+// Bind a function to a context, optionally partially applying any
+// arguments.
+// jQuery.proxy is deprecated to promote standards (specifically Function#bind)
+// However, it is not slated for removal any time soon
+jQuery.proxy = function( fn, context ) {
+	var tmp, args, proxy;
+
+	if ( typeof context === "string" ) {
+		tmp = fn[ context ];
+		context = fn;
+		fn = tmp;
+	}
+
+	// Quick check to determine if target is callable, in the spec
+	// this throws a TypeError, but we will just return undefined.
+	if ( !isFunction( fn ) ) {
+		return undefined;
+	}
+
+	// Simulated bind
+	args = slice.call( arguments, 2 );
+	proxy = function() {
+		return fn.apply( context || this, args.concat( slice.call( arguments ) ) );
+	};
+
+	// Set the guid of unique handler to the same of original handler, so it can be removed
+	proxy.guid = fn.guid = fn.guid || jQuery.guid++;
+
+	return proxy;
+};
+
+jQuery.holdReady = function( hold ) {
+	if ( hold ) {
+		jQuery.readyWait++;
+	} else {
+		jQuery.ready( true );
+	}
+};
+jQuery.isArray = Array.isArray;
+jQuery.parseJSON = JSON.parse;
+jQuery.nodeName = nodeName;
+jQuery.isFunction = isFunction;
+jQuery.isWindow = isWindow;
+jQuery.camelCase = camelCase;
+jQuery.type = toType;
+
+jQuery.now = Date.now;
+
+jQuery.isNumeric = function( obj ) {
+
+	// As of jQuery 3.0, isNumeric is limited to
+	// strings and numbers (primitives or objects)
+	// that can be coerced to finite numbers (gh-2662)
+	var type = jQuery.type( obj );
+	return ( type === "number" || type === "string" ) &&
+
+		// parseFloat NaNs numeric-cast false positives ("")
+		// ...but misinterprets leading-number strings, particularly hex literals ("0x...")
+		// subtraction forces infinities to NaN
+		!isNaN( obj - parseFloat( obj ) );
+};
+
+jQuery.trim = function( text ) {
+	return text == null ?
+		"" :
+		( text + "" ).replace( rtrim, "" );
+};
+
+
+
+// Register as a named AMD module, since jQuery can be concatenated with other
+// files that may use define, but not via a proper concatenation script that
+// understands anonymous AMD modules. A named AMD is safest and most robust
+// way to register. Lowercase jquery is used because AMD module names are
+// derived from file names, and jQuery is normally delivered in a lowercase
+// file name. Do this after creating the global so that if an AMD module wants
+// to call noConflict to hide this version of jQuery, it will work.
+
+// Note that for maximum portability, libraries that are not jQuery should
+// declare themselves as anonymous modules, and avoid setting a global if an
+// AMD loader is present. jQuery is a special case. For more information, see
+// https://github.com/jrburke/requirejs/wiki/Updating-existing-libraries#wiki-anon
+
+if ( typeof define === "function" && define.amd ) {
+	define( "jquery", [], function() {
+		return jQuery;
+	} );
+}
+
+
+
+
+var
+
+	// Map over jQuery in case of overwrite
+	_jQuery = window.jQuery,
+
+	// Map over the $ in case of overwrite
+	_$ = window.$;
+
+jQuery.noConflict = function( deep ) {
+	if ( window.$ === jQuery ) {
+		window.$ = _$;
+	}
+
+	if ( deep && window.jQuery === jQuery ) {
+		window.jQuery = _jQuery;
+	}
+
+	return jQuery;
+};
+
+// Expose jQuery and $ identifiers, even in AMD
+// (#7102#comment:10, https://github.com/jquery/jquery/pull/557)
+// and CommonJS for browser emulators (#13566)
+if ( typeof noGlobal === "undefined" ) {
+	window.jQuery = window.$ = jQuery;
+}
+
+
+
+
+return jQuery;
+} );
diff --git a/docs/RefMan/_build/html/_static/jquery.js b/docs/RefMan/_build/html/_static/jquery.js
index b0614034a..c4c6022f2 100644
--- a/docs/RefMan/_build/html/_static/jquery.js
+++ b/docs/RefMan/_build/html/_static/jquery.js
@@ -1,2 +1,2 @@
-/*! jQuery v3.5.1 | (c) JS Foundation and other contributors | jquery.org/license */
-!function(e,t){"use strict";"object"==typeof module&&"object"==typeof module.exports?module.exports=e.document?t(e,!0):function(e){if(!e.document)throw new Error("jQuery requires a window with a document");return t(e)}:t(e)}("undefined"!=typeof window?window:this,function(C,e){"use strict";var t=[],r=Object.getPrototypeOf,s=t.slice,g=t.flat?function(e){return t.flat.call(e)}:function(e){return t.concat.apply([],e)},u=t.push,i=t.indexOf,n={},o=n.toString,v=n.hasOwnProperty,a=v.toString,l=a.call(Object),y={},m=function(e){return"function"==typeof e&&"number"!=typeof e.nodeType},x=function(e){return null!=e&&e===e.window},E=C.document,c={type:!0,src:!0,nonce:!0,noModule:!0};function b(e,t,n){var r,i,o=(n=n||E).createElement("script");if(o.text=e,t)for(r in c)(i=t[r]||t.getAttribute&&t.getAttribute(r))&&o.setAttribute(r,i);n.head.appendChild(o).parentNode.removeChild(o)}function w(e){return null==e?e+"":"object"==typeof e||"function"==typeof e?n[o.call(e)]||"object":typeof e}var f="3.5.1",S=function(e,t){return new S.fn.init(e,t)};function p(e){var t=!!e&&"length"in e&&e.length,n=w(e);return!m(e)&&!x(e)&&("array"===n||0===t||"number"==typeof t&&0<t&&t-1 in e)}S.fn=S.prototype={jquery:f,constructor:S,length:0,toArray:function(){return s.call(this)},get:function(e){return null==e?s.call(this):e<0?this[e+this.length]:this[e]},pushStack:function(e){var t=S.merge(this.constructor(),e);return t.prevObject=this,t},each:function(e){return S.each(this,e)},map:function(n){return this.pushStack(S.map(this,function(e,t){return n.call(e,t,e)}))},slice:function(){return this.pushStack(s.apply(this,arguments))},first:function(){return this.eq(0)},last:function(){return this.eq(-1)},even:function(){return this.pushStack(S.grep(this,function(e,t){return(t+1)%2}))},odd:function(){return this.pushStack(S.grep(this,function(e,t){return t%2}))},eq:function(e){var t=this.length,n=+e+(e<0?t:0);return this.pushStack(0<=n&&n<t?[this[n]]:[])},end:function(){return this.prevObject||this.constructor()},push:u,sort:t.sort,splice:t.splice},S.extend=S.fn.extend=function(){var e,t,n,r,i,o,a=arguments[0]||{},s=1,u=arguments.length,l=!1;for("boolean"==typeof a&&(l=a,a=arguments[s]||{},s++),"object"==typeof a||m(a)||(a={}),s===u&&(a=this,s--);s<u;s++)if(null!=(e=arguments[s]))for(t in e)r=e[t],"__proto__"!==t&&a!==r&&(l&&r&&(S.isPlainObject(r)||(i=Array.isArray(r)))?(n=a[t],o=i&&!Array.isArray(n)?[]:i||S.isPlainObject(n)?n:{},i=!1,a[t]=S.extend(l,o,r)):void 0!==r&&(a[t]=r));return a},S.extend({expando:"jQuery"+(f+Math.random()).replace(/\D/g,""),isReady:!0,error:function(e){throw new Error(e)},noop:function(){},isPlainObject:function(e){var t,n;return!(!e||"[object Object]"!==o.call(e))&&(!(t=r(e))||"function"==typeof(n=v.call(t,"constructor")&&t.constructor)&&a.call(n)===l)},isEmptyObject:function(e){var t;for(t in e)return!1;return!0},globalEval:function(e,t,n){b(e,{nonce:t&&t.nonce},n)},each:function(e,t){var n,r=0;if(p(e)){for(n=e.length;r<n;r++)if(!1===t.call(e[r],r,e[r]))break}else for(r in e)if(!1===t.call(e[r],r,e[r]))break;return e},makeArray:function(e,t){var n=t||[];return null!=e&&(p(Object(e))?S.merge(n,"string"==typeof e?[e]:e):u.call(n,e)),n},inArray:function(e,t,n){return null==t?-1:i.call(t,e,n)},merge:function(e,t){for(var n=+t.length,r=0,i=e.length;r<n;r++)e[i++]=t[r];return e.length=i,e},grep:function(e,t,n){for(var r=[],i=0,o=e.length,a=!n;i<o;i++)!t(e[i],i)!==a&&r.push(e[i]);return r},map:function(e,t,n){var r,i,o=0,a=[];if(p(e))for(r=e.length;o<r;o++)null!=(i=t(e[o],o,n))&&a.push(i);else for(o in e)null!=(i=t(e[o],o,n))&&a.push(i);return g(a)},guid:1,support:y}),"function"==typeof Symbol&&(S.fn[Symbol.iterator]=t[Symbol.iterator]),S.each("Boolean Number String Function Array Date RegExp Object Error Symbol".split(" "),function(e,t){n["[object "+t+"]"]=t.toLowerCase()});var d=function(n){var e,d,b,o,i,h,f,g,w,u,l,T,C,a,E,v,s,c,y,S="sizzle"+1*new Date,p=n.document,k=0,r=0,m=ue(),x=ue(),A=ue(),N=ue(),D=function(e,t){return e===t&&(l=!0),0},j={}.hasOwnProperty,t=[],q=t.pop,L=t.push,H=t.push,O=t.slice,P=function(e,t){for(var n=0,r=e.length;n<r;n++)if(e[n]===t)return n;return-1},R="checked|selected|async|autofocus|autoplay|controls|defer|disabled|hidden|ismap|loop|multiple|open|readonly|required|scoped",M="[\\x20\\t\\r\\n\\f]",I="(?:\\\\[\\da-fA-F]{1,6}"+M+"?|\\\\[^\\r\\n\\f]|[\\w-]|[^\0-\\x7f])+",W="\\["+M+"*("+I+")(?:"+M+"*([*^$|!~]?=)"+M+"*(?:'((?:\\\\.|[^\\\\'])*)'|\"((?:\\\\.|[^\\\\\"])*)\"|("+I+"))|)"+M+"*\\]",F=":("+I+")(?:\\((('((?:\\\\.|[^\\\\'])*)'|\"((?:\\\\.|[^\\\\\"])*)\")|((?:\\\\.|[^\\\\()[\\]]|"+W+")*)|.*)\\)|)",B=new RegExp(M+"+","g"),$=new RegExp("^"+M+"+|((?:^|[^\\\\])(?:\\\\.)*)"+M+"+$","g"),_=new RegExp("^"+M+"*,"+M+"*"),z=new RegExp("^"+M+"*([>+~]|"+M+")"+M+"*"),U=new RegExp(M+"|>"),X=new RegExp(F),V=new RegExp("^"+I+"$"),G={ID:new RegExp("^#("+I+")"),CLASS:new RegExp("^\\.("+I+")"),TAG:new RegExp("^("+I+"|[*])"),ATTR:new RegExp("^"+W),PSEUDO:new RegExp("^"+F),CHILD:new RegExp("^:(only|first|last|nth|nth-last)-(child|of-type)(?:\\("+M+"*(even|odd|(([+-]|)(\\d*)n|)"+M+"*(?:([+-]|)"+M+"*(\\d+)|))"+M+"*\\)|)","i"),bool:new RegExp("^(?:"+R+")$","i"),needsContext:new RegExp("^"+M+"*[>+~]|:(even|odd|eq|gt|lt|nth|first|last)(?:\\("+M+"*((?:-\\d)?\\d*)"+M+"*\\)|)(?=[^-]|$)","i")},Y=/HTML$/i,Q=/^(?:input|select|textarea|button)$/i,J=/^h\d$/i,K=/^[^{]+\{\s*\[native \w/,Z=/^(?:#([\w-]+)|(\w+)|\.([\w-]+))$/,ee=/[+~]/,te=new RegExp("\\\\[\\da-fA-F]{1,6}"+M+"?|\\\\([^\\r\\n\\f])","g"),ne=function(e,t){var n="0x"+e.slice(1)-65536;return t||(n<0?String.fromCharCode(n+65536):String.fromCharCode(n>>10|55296,1023&n|56320))},re=/([\0-\x1f\x7f]|^-?\d)|^-$|[^\0-\x1f\x7f-\uFFFF\w-]/g,ie=function(e,t){return t?"\0"===e?"\ufffd":e.slice(0,-1)+"\\"+e.charCodeAt(e.length-1).toString(16)+" ":"\\"+e},oe=function(){T()},ae=be(function(e){return!0===e.disabled&&"fieldset"===e.nodeName.toLowerCase()},{dir:"parentNode",next:"legend"});try{H.apply(t=O.call(p.childNodes),p.childNodes),t[p.childNodes.length].nodeType}catch(e){H={apply:t.length?function(e,t){L.apply(e,O.call(t))}:function(e,t){var n=e.length,r=0;while(e[n++]=t[r++]);e.length=n-1}}}function se(t,e,n,r){var i,o,a,s,u,l,c,f=e&&e.ownerDocument,p=e?e.nodeType:9;if(n=n||[],"string"!=typeof t||!t||1!==p&&9!==p&&11!==p)return n;if(!r&&(T(e),e=e||C,E)){if(11!==p&&(u=Z.exec(t)))if(i=u[1]){if(9===p){if(!(a=e.getElementById(i)))return n;if(a.id===i)return n.push(a),n}else if(f&&(a=f.getElementById(i))&&y(e,a)&&a.id===i)return n.push(a),n}else{if(u[2])return H.apply(n,e.getElementsByTagName(t)),n;if((i=u[3])&&d.getElementsByClassName&&e.getElementsByClassName)return H.apply(n,e.getElementsByClassName(i)),n}if(d.qsa&&!N[t+" "]&&(!v||!v.test(t))&&(1!==p||"object"!==e.nodeName.toLowerCase())){if(c=t,f=e,1===p&&(U.test(t)||z.test(t))){(f=ee.test(t)&&ye(e.parentNode)||e)===e&&d.scope||((s=e.getAttribute("id"))?s=s.replace(re,ie):e.setAttribute("id",s=S)),o=(l=h(t)).length;while(o--)l[o]=(s?"#"+s:":scope")+" "+xe(l[o]);c=l.join(",")}try{return H.apply(n,f.querySelectorAll(c)),n}catch(e){N(t,!0)}finally{s===S&&e.removeAttribute("id")}}}return g(t.replace($,"$1"),e,n,r)}function ue(){var r=[];return function e(t,n){return r.push(t+" ")>b.cacheLength&&delete e[r.shift()],e[t+" "]=n}}function le(e){return e[S]=!0,e}function ce(e){var t=C.createElement("fieldset");try{return!!e(t)}catch(e){return!1}finally{t.parentNode&&t.parentNode.removeChild(t),t=null}}function fe(e,t){var n=e.split("|"),r=n.length;while(r--)b.attrHandle[n[r]]=t}function pe(e,t){var n=t&&e,r=n&&1===e.nodeType&&1===t.nodeType&&e.sourceIndex-t.sourceIndex;if(r)return r;if(n)while(n=n.nextSibling)if(n===t)return-1;return e?1:-1}function de(t){return function(e){return"input"===e.nodeName.toLowerCase()&&e.type===t}}function he(n){return function(e){var t=e.nodeName.toLowerCase();return("input"===t||"button"===t)&&e.type===n}}function ge(t){return function(e){return"form"in e?e.parentNode&&!1===e.disabled?"label"in e?"label"in e.parentNode?e.parentNode.disabled===t:e.disabled===t:e.isDisabled===t||e.isDisabled!==!t&&ae(e)===t:e.disabled===t:"label"in e&&e.disabled===t}}function ve(a){return le(function(o){return o=+o,le(function(e,t){var n,r=a([],e.length,o),i=r.length;while(i--)e[n=r[i]]&&(e[n]=!(t[n]=e[n]))})})}function ye(e){return e&&"undefined"!=typeof e.getElementsByTagName&&e}for(e in d=se.support={},i=se.isXML=function(e){var t=e.namespaceURI,n=(e.ownerDocument||e).documentElement;return!Y.test(t||n&&n.nodeName||"HTML")},T=se.setDocument=function(e){var t,n,r=e?e.ownerDocument||e:p;return r!=C&&9===r.nodeType&&r.documentElement&&(a=(C=r).documentElement,E=!i(C),p!=C&&(n=C.defaultView)&&n.top!==n&&(n.addEventListener?n.addEventListener("unload",oe,!1):n.attachEvent&&n.attachEvent("onunload",oe)),d.scope=ce(function(e){return a.appendChild(e).appendChild(C.createElement("div")),"undefined"!=typeof e.querySelectorAll&&!e.querySelectorAll(":scope fieldset div").length}),d.attributes=ce(function(e){return e.className="i",!e.getAttribute("className")}),d.getElementsByTagName=ce(function(e){return e.appendChild(C.createComment("")),!e.getElementsByTagName("*").length}),d.getElementsByClassName=K.test(C.getElementsByClassName),d.getById=ce(function(e){return a.appendChild(e).id=S,!C.getElementsByName||!C.getElementsByName(S).length}),d.getById?(b.filter.ID=function(e){var t=e.replace(te,ne);return function(e){return e.getAttribute("id")===t}},b.find.ID=function(e,t){if("undefined"!=typeof t.getElementById&&E){var n=t.getElementById(e);return n?[n]:[]}}):(b.filter.ID=function(e){var n=e.replace(te,ne);return function(e){var t="undefined"!=typeof e.getAttributeNode&&e.getAttributeNode("id");return t&&t.value===n}},b.find.ID=function(e,t){if("undefined"!=typeof t.getElementById&&E){var n,r,i,o=t.getElementById(e);if(o){if((n=o.getAttributeNode("id"))&&n.value===e)return[o];i=t.getElementsByName(e),r=0;while(o=i[r++])if((n=o.getAttributeNode("id"))&&n.value===e)return[o]}return[]}}),b.find.TAG=d.getElementsByTagName?function(e,t){return"undefined"!=typeof t.getElementsByTagName?t.getElementsByTagName(e):d.qsa?t.querySelectorAll(e):void 0}:function(e,t){var n,r=[],i=0,o=t.getElementsByTagName(e);if("*"===e){while(n=o[i++])1===n.nodeType&&r.push(n);return r}return o},b.find.CLASS=d.getElementsByClassName&&function(e,t){if("undefined"!=typeof t.getElementsByClassName&&E)return t.getElementsByClassName(e)},s=[],v=[],(d.qsa=K.test(C.querySelectorAll))&&(ce(function(e){var t;a.appendChild(e).innerHTML="<a id='"+S+"'></a><select id='"+S+"-\r\\' msallowcapture=''><option selected=''></option></select>",e.querySelectorAll("[msallowcapture^='']").length&&v.push("[*^$]="+M+"*(?:''|\"\")"),e.querySelectorAll("[selected]").length||v.push("\\["+M+"*(?:value|"+R+")"),e.querySelectorAll("[id~="+S+"-]").length||v.push("~="),(t=C.createElement("input")).setAttribute("name",""),e.appendChild(t),e.querySelectorAll("[name='']").length||v.push("\\["+M+"*name"+M+"*="+M+"*(?:''|\"\")"),e.querySelectorAll(":checked").length||v.push(":checked"),e.querySelectorAll("a#"+S+"+*").length||v.push(".#.+[+~]"),e.querySelectorAll("\\\f"),v.push("[\\r\\n\\f]")}),ce(function(e){e.innerHTML="<a href='' disabled='disabled'></a><select disabled='disabled'><option/></select>";var t=C.createElement("input");t.setAttribute("type","hidden"),e.appendChild(t).setAttribute("name","D"),e.querySelectorAll("[name=d]").length&&v.push("name"+M+"*[*^$|!~]?="),2!==e.querySelectorAll(":enabled").length&&v.push(":enabled",":disabled"),a.appendChild(e).disabled=!0,2!==e.querySelectorAll(":disabled").length&&v.push(":enabled",":disabled"),e.querySelectorAll("*,:x"),v.push(",.*:")})),(d.matchesSelector=K.test(c=a.matches||a.webkitMatchesSelector||a.mozMatchesSelector||a.oMatchesSelector||a.msMatchesSelector))&&ce(function(e){d.disconnectedMatch=c.call(e,"*"),c.call(e,"[s!='']:x"),s.push("!=",F)}),v=v.length&&new RegExp(v.join("|")),s=s.length&&new RegExp(s.join("|")),t=K.test(a.compareDocumentPosition),y=t||K.test(a.contains)?function(e,t){var n=9===e.nodeType?e.documentElement:e,r=t&&t.parentNode;return e===r||!(!r||1!==r.nodeType||!(n.contains?n.contains(r):e.compareDocumentPosition&&16&e.compareDocumentPosition(r)))}:function(e,t){if(t)while(t=t.parentNode)if(t===e)return!0;return!1},D=t?function(e,t){if(e===t)return l=!0,0;var n=!e.compareDocumentPosition-!t.compareDocumentPosition;return n||(1&(n=(e.ownerDocument||e)==(t.ownerDocument||t)?e.compareDocumentPosition(t):1)||!d.sortDetached&&t.compareDocumentPosition(e)===n?e==C||e.ownerDocument==p&&y(p,e)?-1:t==C||t.ownerDocument==p&&y(p,t)?1:u?P(u,e)-P(u,t):0:4&n?-1:1)}:function(e,t){if(e===t)return l=!0,0;var n,r=0,i=e.parentNode,o=t.parentNode,a=[e],s=[t];if(!i||!o)return e==C?-1:t==C?1:i?-1:o?1:u?P(u,e)-P(u,t):0;if(i===o)return pe(e,t);n=e;while(n=n.parentNode)a.unshift(n);n=t;while(n=n.parentNode)s.unshift(n);while(a[r]===s[r])r++;return r?pe(a[r],s[r]):a[r]==p?-1:s[r]==p?1:0}),C},se.matches=function(e,t){return se(e,null,null,t)},se.matchesSelector=function(e,t){if(T(e),d.matchesSelector&&E&&!N[t+" "]&&(!s||!s.test(t))&&(!v||!v.test(t)))try{var n=c.call(e,t);if(n||d.disconnectedMatch||e.document&&11!==e.document.nodeType)return n}catch(e){N(t,!0)}return 0<se(t,C,null,[e]).length},se.contains=function(e,t){return(e.ownerDocument||e)!=C&&T(e),y(e,t)},se.attr=function(e,t){(e.ownerDocument||e)!=C&&T(e);var n=b.attrHandle[t.toLowerCase()],r=n&&j.call(b.attrHandle,t.toLowerCase())?n(e,t,!E):void 0;return void 0!==r?r:d.attributes||!E?e.getAttribute(t):(r=e.getAttributeNode(t))&&r.specified?r.value:null},se.escape=function(e){return(e+"").replace(re,ie)},se.error=function(e){throw new Error("Syntax error, unrecognized expression: "+e)},se.uniqueSort=function(e){var t,n=[],r=0,i=0;if(l=!d.detectDuplicates,u=!d.sortStable&&e.slice(0),e.sort(D),l){while(t=e[i++])t===e[i]&&(r=n.push(i));while(r--)e.splice(n[r],1)}return u=null,e},o=se.getText=function(e){var t,n="",r=0,i=e.nodeType;if(i){if(1===i||9===i||11===i){if("string"==typeof e.textContent)return e.textContent;for(e=e.firstChild;e;e=e.nextSibling)n+=o(e)}else if(3===i||4===i)return e.nodeValue}else while(t=e[r++])n+=o(t);return n},(b=se.selectors={cacheLength:50,createPseudo:le,match:G,attrHandle:{},find:{},relative:{">":{dir:"parentNode",first:!0}," ":{dir:"parentNode"},"+":{dir:"previousSibling",first:!0},"~":{dir:"previousSibling"}},preFilter:{ATTR:function(e){return e[1]=e[1].replace(te,ne),e[3]=(e[3]||e[4]||e[5]||"").replace(te,ne),"~="===e[2]&&(e[3]=" "+e[3]+" "),e.slice(0,4)},CHILD:function(e){return e[1]=e[1].toLowerCase(),"nth"===e[1].slice(0,3)?(e[3]||se.error(e[0]),e[4]=+(e[4]?e[5]+(e[6]||1):2*("even"===e[3]||"odd"===e[3])),e[5]=+(e[7]+e[8]||"odd"===e[3])):e[3]&&se.error(e[0]),e},PSEUDO:function(e){var t,n=!e[6]&&e[2];return G.CHILD.test(e[0])?null:(e[3]?e[2]=e[4]||e[5]||"":n&&X.test(n)&&(t=h(n,!0))&&(t=n.indexOf(")",n.length-t)-n.length)&&(e[0]=e[0].slice(0,t),e[2]=n.slice(0,t)),e.slice(0,3))}},filter:{TAG:function(e){var t=e.replace(te,ne).toLowerCase();return"*"===e?function(){return!0}:function(e){return e.nodeName&&e.nodeName.toLowerCase()===t}},CLASS:function(e){var t=m[e+" "];return t||(t=new RegExp("(^|"+M+")"+e+"("+M+"|$)"))&&m(e,function(e){return t.test("string"==typeof e.className&&e.className||"undefined"!=typeof e.getAttribute&&e.getAttribute("class")||"")})},ATTR:function(n,r,i){return function(e){var t=se.attr(e,n);return null==t?"!="===r:!r||(t+="","="===r?t===i:"!="===r?t!==i:"^="===r?i&&0===t.indexOf(i):"*="===r?i&&-1<t.indexOf(i):"$="===r?i&&t.slice(-i.length)===i:"~="===r?-1<(" "+t.replace(B," ")+" ").indexOf(i):"|="===r&&(t===i||t.slice(0,i.length+1)===i+"-"))}},CHILD:function(h,e,t,g,v){var y="nth"!==h.slice(0,3),m="last"!==h.slice(-4),x="of-type"===e;return 1===g&&0===v?function(e){return!!e.parentNode}:function(e,t,n){var r,i,o,a,s,u,l=y!==m?"nextSibling":"previousSibling",c=e.parentNode,f=x&&e.nodeName.toLowerCase(),p=!n&&!x,d=!1;if(c){if(y){while(l){a=e;while(a=a[l])if(x?a.nodeName.toLowerCase()===f:1===a.nodeType)return!1;u=l="only"===h&&!u&&"nextSibling"}return!0}if(u=[m?c.firstChild:c.lastChild],m&&p){d=(s=(r=(i=(o=(a=c)[S]||(a[S]={}))[a.uniqueID]||(o[a.uniqueID]={}))[h]||[])[0]===k&&r[1])&&r[2],a=s&&c.childNodes[s];while(a=++s&&a&&a[l]||(d=s=0)||u.pop())if(1===a.nodeType&&++d&&a===e){i[h]=[k,s,d];break}}else if(p&&(d=s=(r=(i=(o=(a=e)[S]||(a[S]={}))[a.uniqueID]||(o[a.uniqueID]={}))[h]||[])[0]===k&&r[1]),!1===d)while(a=++s&&a&&a[l]||(d=s=0)||u.pop())if((x?a.nodeName.toLowerCase()===f:1===a.nodeType)&&++d&&(p&&((i=(o=a[S]||(a[S]={}))[a.uniqueID]||(o[a.uniqueID]={}))[h]=[k,d]),a===e))break;return(d-=v)===g||d%g==0&&0<=d/g}}},PSEUDO:function(e,o){var t,a=b.pseudos[e]||b.setFilters[e.toLowerCase()]||se.error("unsupported pseudo: "+e);return a[S]?a(o):1<a.length?(t=[e,e,"",o],b.setFilters.hasOwnProperty(e.toLowerCase())?le(function(e,t){var n,r=a(e,o),i=r.length;while(i--)e[n=P(e,r[i])]=!(t[n]=r[i])}):function(e){return a(e,0,t)}):a}},pseudos:{not:le(function(e){var r=[],i=[],s=f(e.replace($,"$1"));return s[S]?le(function(e,t,n,r){var i,o=s(e,null,r,[]),a=e.length;while(a--)(i=o[a])&&(e[a]=!(t[a]=i))}):function(e,t,n){return r[0]=e,s(r,null,n,i),r[0]=null,!i.pop()}}),has:le(function(t){return function(e){return 0<se(t,e).length}}),contains:le(function(t){return t=t.replace(te,ne),function(e){return-1<(e.textContent||o(e)).indexOf(t)}}),lang:le(function(n){return V.test(n||"")||se.error("unsupported lang: "+n),n=n.replace(te,ne).toLowerCase(),function(e){var t;do{if(t=E?e.lang:e.getAttribute("xml:lang")||e.getAttribute("lang"))return(t=t.toLowerCase())===n||0===t.indexOf(n+"-")}while((e=e.parentNode)&&1===e.nodeType);return!1}}),target:function(e){var t=n.location&&n.location.hash;return t&&t.slice(1)===e.id},root:function(e){return e===a},focus:function(e){return e===C.activeElement&&(!C.hasFocus||C.hasFocus())&&!!(e.type||e.href||~e.tabIndex)},enabled:ge(!1),disabled:ge(!0),checked:function(e){var t=e.nodeName.toLowerCase();return"input"===t&&!!e.checked||"option"===t&&!!e.selected},selected:function(e){return e.parentNode&&e.parentNode.selectedIndex,!0===e.selected},empty:function(e){for(e=e.firstChild;e;e=e.nextSibling)if(e.nodeType<6)return!1;return!0},parent:function(e){return!b.pseudos.empty(e)},header:function(e){return J.test(e.nodeName)},input:function(e){return Q.test(e.nodeName)},button:function(e){var t=e.nodeName.toLowerCase();return"input"===t&&"button"===e.type||"button"===t},text:function(e){var t;return"input"===e.nodeName.toLowerCase()&&"text"===e.type&&(null==(t=e.getAttribute("type"))||"text"===t.toLowerCase())},first:ve(function(){return[0]}),last:ve(function(e,t){return[t-1]}),eq:ve(function(e,t,n){return[n<0?n+t:n]}),even:ve(function(e,t){for(var n=0;n<t;n+=2)e.push(n);return e}),odd:ve(function(e,t){for(var n=1;n<t;n+=2)e.push(n);return e}),lt:ve(function(e,t,n){for(var r=n<0?n+t:t<n?t:n;0<=--r;)e.push(r);return e}),gt:ve(function(e,t,n){for(var r=n<0?n+t:n;++r<t;)e.push(r);return e})}}).pseudos.nth=b.pseudos.eq,{radio:!0,checkbox:!0,file:!0,password:!0,image:!0})b.pseudos[e]=de(e);for(e in{submit:!0,reset:!0})b.pseudos[e]=he(e);function me(){}function xe(e){for(var t=0,n=e.length,r="";t<n;t++)r+=e[t].value;return r}function be(s,e,t){var u=e.dir,l=e.next,c=l||u,f=t&&"parentNode"===c,p=r++;return e.first?function(e,t,n){while(e=e[u])if(1===e.nodeType||f)return s(e,t,n);return!1}:function(e,t,n){var r,i,o,a=[k,p];if(n){while(e=e[u])if((1===e.nodeType||f)&&s(e,t,n))return!0}else while(e=e[u])if(1===e.nodeType||f)if(i=(o=e[S]||(e[S]={}))[e.uniqueID]||(o[e.uniqueID]={}),l&&l===e.nodeName.toLowerCase())e=e[u]||e;else{if((r=i[c])&&r[0]===k&&r[1]===p)return a[2]=r[2];if((i[c]=a)[2]=s(e,t,n))return!0}return!1}}function we(i){return 1<i.length?function(e,t,n){var r=i.length;while(r--)if(!i[r](e,t,n))return!1;return!0}:i[0]}function Te(e,t,n,r,i){for(var o,a=[],s=0,u=e.length,l=null!=t;s<u;s++)(o=e[s])&&(n&&!n(o,r,i)||(a.push(o),l&&t.push(s)));return a}function Ce(d,h,g,v,y,e){return v&&!v[S]&&(v=Ce(v)),y&&!y[S]&&(y=Ce(y,e)),le(function(e,t,n,r){var i,o,a,s=[],u=[],l=t.length,c=e||function(e,t,n){for(var r=0,i=t.length;r<i;r++)se(e,t[r],n);return n}(h||"*",n.nodeType?[n]:n,[]),f=!d||!e&&h?c:Te(c,s,d,n,r),p=g?y||(e?d:l||v)?[]:t:f;if(g&&g(f,p,n,r),v){i=Te(p,u),v(i,[],n,r),o=i.length;while(o--)(a=i[o])&&(p[u[o]]=!(f[u[o]]=a))}if(e){if(y||d){if(y){i=[],o=p.length;while(o--)(a=p[o])&&i.push(f[o]=a);y(null,p=[],i,r)}o=p.length;while(o--)(a=p[o])&&-1<(i=y?P(e,a):s[o])&&(e[i]=!(t[i]=a))}}else p=Te(p===t?p.splice(l,p.length):p),y?y(null,t,p,r):H.apply(t,p)})}function Ee(e){for(var i,t,n,r=e.length,o=b.relative[e[0].type],a=o||b.relative[" "],s=o?1:0,u=be(function(e){return e===i},a,!0),l=be(function(e){return-1<P(i,e)},a,!0),c=[function(e,t,n){var r=!o&&(n||t!==w)||((i=t).nodeType?u(e,t,n):l(e,t,n));return i=null,r}];s<r;s++)if(t=b.relative[e[s].type])c=[be(we(c),t)];else{if((t=b.filter[e[s].type].apply(null,e[s].matches))[S]){for(n=++s;n<r;n++)if(b.relative[e[n].type])break;return Ce(1<s&&we(c),1<s&&xe(e.slice(0,s-1).concat({value:" "===e[s-2].type?"*":""})).replace($,"$1"),t,s<n&&Ee(e.slice(s,n)),n<r&&Ee(e=e.slice(n)),n<r&&xe(e))}c.push(t)}return we(c)}return me.prototype=b.filters=b.pseudos,b.setFilters=new me,h=se.tokenize=function(e,t){var n,r,i,o,a,s,u,l=x[e+" "];if(l)return t?0:l.slice(0);a=e,s=[],u=b.preFilter;while(a){for(o in n&&!(r=_.exec(a))||(r&&(a=a.slice(r[0].length)||a),s.push(i=[])),n=!1,(r=z.exec(a))&&(n=r.shift(),i.push({value:n,type:r[0].replace($," ")}),a=a.slice(n.length)),b.filter)!(r=G[o].exec(a))||u[o]&&!(r=u[o](r))||(n=r.shift(),i.push({value:n,type:o,matches:r}),a=a.slice(n.length));if(!n)break}return t?a.length:a?se.error(e):x(e,s).slice(0)},f=se.compile=function(e,t){var n,v,y,m,x,r,i=[],o=[],a=A[e+" "];if(!a){t||(t=h(e)),n=t.length;while(n--)(a=Ee(t[n]))[S]?i.push(a):o.push(a);(a=A(e,(v=o,m=0<(y=i).length,x=0<v.length,r=function(e,t,n,r,i){var o,a,s,u=0,l="0",c=e&&[],f=[],p=w,d=e||x&&b.find.TAG("*",i),h=k+=null==p?1:Math.random()||.1,g=d.length;for(i&&(w=t==C||t||i);l!==g&&null!=(o=d[l]);l++){if(x&&o){a=0,t||o.ownerDocument==C||(T(o),n=!E);while(s=v[a++])if(s(o,t||C,n)){r.push(o);break}i&&(k=h)}m&&((o=!s&&o)&&u--,e&&c.push(o))}if(u+=l,m&&l!==u){a=0;while(s=y[a++])s(c,f,t,n);if(e){if(0<u)while(l--)c[l]||f[l]||(f[l]=q.call(r));f=Te(f)}H.apply(r,f),i&&!e&&0<f.length&&1<u+y.length&&se.uniqueSort(r)}return i&&(k=h,w=p),c},m?le(r):r))).selector=e}return a},g=se.select=function(e,t,n,r){var i,o,a,s,u,l="function"==typeof e&&e,c=!r&&h(e=l.selector||e);if(n=n||[],1===c.length){if(2<(o=c[0]=c[0].slice(0)).length&&"ID"===(a=o[0]).type&&9===t.nodeType&&E&&b.relative[o[1].type]){if(!(t=(b.find.ID(a.matches[0].replace(te,ne),t)||[])[0]))return n;l&&(t=t.parentNode),e=e.slice(o.shift().value.length)}i=G.needsContext.test(e)?0:o.length;while(i--){if(a=o[i],b.relative[s=a.type])break;if((u=b.find[s])&&(r=u(a.matches[0].replace(te,ne),ee.test(o[0].type)&&ye(t.parentNode)||t))){if(o.splice(i,1),!(e=r.length&&xe(o)))return H.apply(n,r),n;break}}}return(l||f(e,c))(r,t,!E,n,!t||ee.test(e)&&ye(t.parentNode)||t),n},d.sortStable=S.split("").sort(D).join("")===S,d.detectDuplicates=!!l,T(),d.sortDetached=ce(function(e){return 1&e.compareDocumentPosition(C.createElement("fieldset"))}),ce(function(e){return e.innerHTML="<a href='#'></a>","#"===e.firstChild.getAttribute("href")})||fe("type|href|height|width",function(e,t,n){if(!n)return e.getAttribute(t,"type"===t.toLowerCase()?1:2)}),d.attributes&&ce(function(e){return e.innerHTML="<input/>",e.firstChild.setAttribute("value",""),""===e.firstChild.getAttribute("value")})||fe("value",function(e,t,n){if(!n&&"input"===e.nodeName.toLowerCase())return e.defaultValue}),ce(function(e){return null==e.getAttribute("disabled")})||fe(R,function(e,t,n){var r;if(!n)return!0===e[t]?t.toLowerCase():(r=e.getAttributeNode(t))&&r.specified?r.value:null}),se}(C);S.find=d,S.expr=d.selectors,S.expr[":"]=S.expr.pseudos,S.uniqueSort=S.unique=d.uniqueSort,S.text=d.getText,S.isXMLDoc=d.isXML,S.contains=d.contains,S.escapeSelector=d.escape;var h=function(e,t,n){var r=[],i=void 0!==n;while((e=e[t])&&9!==e.nodeType)if(1===e.nodeType){if(i&&S(e).is(n))break;r.push(e)}return r},T=function(e,t){for(var n=[];e;e=e.nextSibling)1===e.nodeType&&e!==t&&n.push(e);return n},k=S.expr.match.needsContext;function A(e,t){return e.nodeName&&e.nodeName.toLowerCase()===t.toLowerCase()}var N=/^<([a-z][^\/\0>:\x20\t\r\n\f]*)[\x20\t\r\n\f]*\/?>(?:<\/\1>|)$/i;function D(e,n,r){return m(n)?S.grep(e,function(e,t){return!!n.call(e,t,e)!==r}):n.nodeType?S.grep(e,function(e){return e===n!==r}):"string"!=typeof n?S.grep(e,function(e){return-1<i.call(n,e)!==r}):S.filter(n,e,r)}S.filter=function(e,t,n){var r=t[0];return n&&(e=":not("+e+")"),1===t.length&&1===r.nodeType?S.find.matchesSelector(r,e)?[r]:[]:S.find.matches(e,S.grep(t,function(e){return 1===e.nodeType}))},S.fn.extend({find:function(e){var t,n,r=this.length,i=this;if("string"!=typeof e)return this.pushStack(S(e).filter(function(){for(t=0;t<r;t++)if(S.contains(i[t],this))return!0}));for(n=this.pushStack([]),t=0;t<r;t++)S.find(e,i[t],n);return 1<r?S.uniqueSort(n):n},filter:function(e){return this.pushStack(D(this,e||[],!1))},not:function(e){return this.pushStack(D(this,e||[],!0))},is:function(e){return!!D(this,"string"==typeof e&&k.test(e)?S(e):e||[],!1).length}});var j,q=/^(?:\s*(<[\w\W]+>)[^>]*|#([\w-]+))$/;(S.fn.init=function(e,t,n){var r,i;if(!e)return this;if(n=n||j,"string"==typeof e){if(!(r="<"===e[0]&&">"===e[e.length-1]&&3<=e.length?[null,e,null]:q.exec(e))||!r[1]&&t)return!t||t.jquery?(t||n).find(e):this.constructor(t).find(e);if(r[1]){if(t=t instanceof S?t[0]:t,S.merge(this,S.parseHTML(r[1],t&&t.nodeType?t.ownerDocument||t:E,!0)),N.test(r[1])&&S.isPlainObject(t))for(r in t)m(this[r])?this[r](t[r]):this.attr(r,t[r]);return this}return(i=E.getElementById(r[2]))&&(this[0]=i,this.length=1),this}return e.nodeType?(this[0]=e,this.length=1,this):m(e)?void 0!==n.ready?n.ready(e):e(S):S.makeArray(e,this)}).prototype=S.fn,j=S(E);var L=/^(?:parents|prev(?:Until|All))/,H={children:!0,contents:!0,next:!0,prev:!0};function O(e,t){while((e=e[t])&&1!==e.nodeType);return e}S.fn.extend({has:function(e){var t=S(e,this),n=t.length;return this.filter(function(){for(var e=0;e<n;e++)if(S.contains(this,t[e]))return!0})},closest:function(e,t){var n,r=0,i=this.length,o=[],a="string"!=typeof e&&S(e);if(!k.test(e))for(;r<i;r++)for(n=this[r];n&&n!==t;n=n.parentNode)if(n.nodeType<11&&(a?-1<a.index(n):1===n.nodeType&&S.find.matchesSelector(n,e))){o.push(n);break}return this.pushStack(1<o.length?S.uniqueSort(o):o)},index:function(e){return e?"string"==typeof e?i.call(S(e),this[0]):i.call(this,e.jquery?e[0]:e):this[0]&&this[0].parentNode?this.first().prevAll().length:-1},add:function(e,t){return this.pushStack(S.uniqueSort(S.merge(this.get(),S(e,t))))},addBack:function(e){return this.add(null==e?this.prevObject:this.prevObject.filter(e))}}),S.each({parent:function(e){var t=e.parentNode;return t&&11!==t.nodeType?t:null},parents:function(e){return h(e,"parentNode")},parentsUntil:function(e,t,n){return h(e,"parentNode",n)},next:function(e){return O(e,"nextSibling")},prev:function(e){return O(e,"previousSibling")},nextAll:function(e){return h(e,"nextSibling")},prevAll:function(e){return h(e,"previousSibling")},nextUntil:function(e,t,n){return h(e,"nextSibling",n)},prevUntil:function(e,t,n){return h(e,"previousSibling",n)},siblings:function(e){return T((e.parentNode||{}).firstChild,e)},children:function(e){return T(e.firstChild)},contents:function(e){return null!=e.contentDocument&&r(e.contentDocument)?e.contentDocument:(A(e,"template")&&(e=e.content||e),S.merge([],e.childNodes))}},function(r,i){S.fn[r]=function(e,t){var n=S.map(this,i,e);return"Until"!==r.slice(-5)&&(t=e),t&&"string"==typeof t&&(n=S.filter(t,n)),1<this.length&&(H[r]||S.uniqueSort(n),L.test(r)&&n.reverse()),this.pushStack(n)}});var P=/[^\x20\t\r\n\f]+/g;function R(e){return e}function M(e){throw e}function I(e,t,n,r){var i;try{e&&m(i=e.promise)?i.call(e).done(t).fail(n):e&&m(i=e.then)?i.call(e,t,n):t.apply(void 0,[e].slice(r))}catch(e){n.apply(void 0,[e])}}S.Callbacks=function(r){var e,n;r="string"==typeof r?(e=r,n={},S.each(e.match(P)||[],function(e,t){n[t]=!0}),n):S.extend({},r);var i,t,o,a,s=[],u=[],l=-1,c=function(){for(a=a||r.once,o=i=!0;u.length;l=-1){t=u.shift();while(++l<s.length)!1===s[l].apply(t[0],t[1])&&r.stopOnFalse&&(l=s.length,t=!1)}r.memory||(t=!1),i=!1,a&&(s=t?[]:"")},f={add:function(){return s&&(t&&!i&&(l=s.length-1,u.push(t)),function n(e){S.each(e,function(e,t){m(t)?r.unique&&f.has(t)||s.push(t):t&&t.length&&"string"!==w(t)&&n(t)})}(arguments),t&&!i&&c()),this},remove:function(){return S.each(arguments,function(e,t){var n;while(-1<(n=S.inArray(t,s,n)))s.splice(n,1),n<=l&&l--}),this},has:function(e){return e?-1<S.inArray(e,s):0<s.length},empty:function(){return s&&(s=[]),this},disable:function(){return a=u=[],s=t="",this},disabled:function(){return!s},lock:function(){return a=u=[],t||i||(s=t=""),this},locked:function(){return!!a},fireWith:function(e,t){return a||(t=[e,(t=t||[]).slice?t.slice():t],u.push(t),i||c()),this},fire:function(){return f.fireWith(this,arguments),this},fired:function(){return!!o}};return f},S.extend({Deferred:function(e){var o=[["notify","progress",S.Callbacks("memory"),S.Callbacks("memory"),2],["resolve","done",S.Callbacks("once memory"),S.Callbacks("once memory"),0,"resolved"],["reject","fail",S.Callbacks("once memory"),S.Callbacks("once memory"),1,"rejected"]],i="pending",a={state:function(){return i},always:function(){return s.done(arguments).fail(arguments),this},"catch":function(e){return a.then(null,e)},pipe:function(){var i=arguments;return S.Deferred(function(r){S.each(o,function(e,t){var n=m(i[t[4]])&&i[t[4]];s[t[1]](function(){var e=n&&n.apply(this,arguments);e&&m(e.promise)?e.promise().progress(r.notify).done(r.resolve).fail(r.reject):r[t[0]+"With"](this,n?[e]:arguments)})}),i=null}).promise()},then:function(t,n,r){var u=0;function l(i,o,a,s){return function(){var n=this,r=arguments,e=function(){var e,t;if(!(i<u)){if((e=a.apply(n,r))===o.promise())throw new TypeError("Thenable self-resolution");t=e&&("object"==typeof e||"function"==typeof e)&&e.then,m(t)?s?t.call(e,l(u,o,R,s),l(u,o,M,s)):(u++,t.call(e,l(u,o,R,s),l(u,o,M,s),l(u,o,R,o.notifyWith))):(a!==R&&(n=void 0,r=[e]),(s||o.resolveWith)(n,r))}},t=s?e:function(){try{e()}catch(e){S.Deferred.exceptionHook&&S.Deferred.exceptionHook(e,t.stackTrace),u<=i+1&&(a!==M&&(n=void 0,r=[e]),o.rejectWith(n,r))}};i?t():(S.Deferred.getStackHook&&(t.stackTrace=S.Deferred.getStackHook()),C.setTimeout(t))}}return S.Deferred(function(e){o[0][3].add(l(0,e,m(r)?r:R,e.notifyWith)),o[1][3].add(l(0,e,m(t)?t:R)),o[2][3].add(l(0,e,m(n)?n:M))}).promise()},promise:function(e){return null!=e?S.extend(e,a):a}},s={};return S.each(o,function(e,t){var n=t[2],r=t[5];a[t[1]]=n.add,r&&n.add(function(){i=r},o[3-e][2].disable,o[3-e][3].disable,o[0][2].lock,o[0][3].lock),n.add(t[3].fire),s[t[0]]=function(){return s[t[0]+"With"](this===s?void 0:this,arguments),this},s[t[0]+"With"]=n.fireWith}),a.promise(s),e&&e.call(s,s),s},when:function(e){var n=arguments.length,t=n,r=Array(t),i=s.call(arguments),o=S.Deferred(),a=function(t){return function(e){r[t]=this,i[t]=1<arguments.length?s.call(arguments):e,--n||o.resolveWith(r,i)}};if(n<=1&&(I(e,o.done(a(t)).resolve,o.reject,!n),"pending"===o.state()||m(i[t]&&i[t].then)))return o.then();while(t--)I(i[t],a(t),o.reject);return o.promise()}});var W=/^(Eval|Internal|Range|Reference|Syntax|Type|URI)Error$/;S.Deferred.exceptionHook=function(e,t){C.console&&C.console.warn&&e&&W.test(e.name)&&C.console.warn("jQuery.Deferred exception: "+e.message,e.stack,t)},S.readyException=function(e){C.setTimeout(function(){throw e})};var F=S.Deferred();function B(){E.removeEventListener("DOMContentLoaded",B),C.removeEventListener("load",B),S.ready()}S.fn.ready=function(e){return F.then(e)["catch"](function(e){S.readyException(e)}),this},S.extend({isReady:!1,readyWait:1,ready:function(e){(!0===e?--S.readyWait:S.isReady)||(S.isReady=!0)!==e&&0<--S.readyWait||F.resolveWith(E,[S])}}),S.ready.then=F.then,"complete"===E.readyState||"loading"!==E.readyState&&!E.documentElement.doScroll?C.setTimeout(S.ready):(E.addEventListener("DOMContentLoaded",B),C.addEventListener("load",B));var $=function(e,t,n,r,i,o,a){var s=0,u=e.length,l=null==n;if("object"===w(n))for(s in i=!0,n)$(e,t,s,n[s],!0,o,a);else if(void 0!==r&&(i=!0,m(r)||(a=!0),l&&(a?(t.call(e,r),t=null):(l=t,t=function(e,t,n){return l.call(S(e),n)})),t))for(;s<u;s++)t(e[s],n,a?r:r.call(e[s],s,t(e[s],n)));return i?e:l?t.call(e):u?t(e[0],n):o},_=/^-ms-/,z=/-([a-z])/g;function U(e,t){return t.toUpperCase()}function X(e){return e.replace(_,"ms-").replace(z,U)}var V=function(e){return 1===e.nodeType||9===e.nodeType||!+e.nodeType};function G(){this.expando=S.expando+G.uid++}G.uid=1,G.prototype={cache:function(e){var t=e[this.expando];return t||(t={},V(e)&&(e.nodeType?e[this.expando]=t:Object.defineProperty(e,this.expando,{value:t,configurable:!0}))),t},set:function(e,t,n){var r,i=this.cache(e);if("string"==typeof t)i[X(t)]=n;else for(r in t)i[X(r)]=t[r];return i},get:function(e,t){return void 0===t?this.cache(e):e[this.expando]&&e[this.expando][X(t)]},access:function(e,t,n){return void 0===t||t&&"string"==typeof t&&void 0===n?this.get(e,t):(this.set(e,t,n),void 0!==n?n:t)},remove:function(e,t){var n,r=e[this.expando];if(void 0!==r){if(void 0!==t){n=(t=Array.isArray(t)?t.map(X):(t=X(t))in r?[t]:t.match(P)||[]).length;while(n--)delete r[t[n]]}(void 0===t||S.isEmptyObject(r))&&(e.nodeType?e[this.expando]=void 0:delete e[this.expando])}},hasData:function(e){var t=e[this.expando];return void 0!==t&&!S.isEmptyObject(t)}};var Y=new G,Q=new G,J=/^(?:\{[\w\W]*\}|\[[\w\W]*\])$/,K=/[A-Z]/g;function Z(e,t,n){var r,i;if(void 0===n&&1===e.nodeType)if(r="data-"+t.replace(K,"-$&").toLowerCase(),"string"==typeof(n=e.getAttribute(r))){try{n="true"===(i=n)||"false"!==i&&("null"===i?null:i===+i+""?+i:J.test(i)?JSON.parse(i):i)}catch(e){}Q.set(e,t,n)}else n=void 0;return n}S.extend({hasData:function(e){return Q.hasData(e)||Y.hasData(e)},data:function(e,t,n){return Q.access(e,t,n)},removeData:function(e,t){Q.remove(e,t)},_data:function(e,t,n){return Y.access(e,t,n)},_removeData:function(e,t){Y.remove(e,t)}}),S.fn.extend({data:function(n,e){var t,r,i,o=this[0],a=o&&o.attributes;if(void 0===n){if(this.length&&(i=Q.get(o),1===o.nodeType&&!Y.get(o,"hasDataAttrs"))){t=a.length;while(t--)a[t]&&0===(r=a[t].name).indexOf("data-")&&(r=X(r.slice(5)),Z(o,r,i[r]));Y.set(o,"hasDataAttrs",!0)}return i}return"object"==typeof n?this.each(function(){Q.set(this,n)}):$(this,function(e){var t;if(o&&void 0===e)return void 0!==(t=Q.get(o,n))?t:void 0!==(t=Z(o,n))?t:void 0;this.each(function(){Q.set(this,n,e)})},null,e,1<arguments.length,null,!0)},removeData:function(e){return this.each(function(){Q.remove(this,e)})}}),S.extend({queue:function(e,t,n){var r;if(e)return t=(t||"fx")+"queue",r=Y.get(e,t),n&&(!r||Array.isArray(n)?r=Y.access(e,t,S.makeArray(n)):r.push(n)),r||[]},dequeue:function(e,t){t=t||"fx";var n=S.queue(e,t),r=n.length,i=n.shift(),o=S._queueHooks(e,t);"inprogress"===i&&(i=n.shift(),r--),i&&("fx"===t&&n.unshift("inprogress"),delete o.stop,i.call(e,function(){S.dequeue(e,t)},o)),!r&&o&&o.empty.fire()},_queueHooks:function(e,t){var n=t+"queueHooks";return Y.get(e,n)||Y.access(e,n,{empty:S.Callbacks("once memory").add(function(){Y.remove(e,[t+"queue",n])})})}}),S.fn.extend({queue:function(t,n){var e=2;return"string"!=typeof t&&(n=t,t="fx",e--),arguments.length<e?S.queue(this[0],t):void 0===n?this:this.each(function(){var e=S.queue(this,t,n);S._queueHooks(this,t),"fx"===t&&"inprogress"!==e[0]&&S.dequeue(this,t)})},dequeue:function(e){return this.each(function(){S.dequeue(this,e)})},clearQueue:function(e){return this.queue(e||"fx",[])},promise:function(e,t){var n,r=1,i=S.Deferred(),o=this,a=this.length,s=function(){--r||i.resolveWith(o,[o])};"string"!=typeof e&&(t=e,e=void 0),e=e||"fx";while(a--)(n=Y.get(o[a],e+"queueHooks"))&&n.empty&&(r++,n.empty.add(s));return s(),i.promise(t)}});var ee=/[+-]?(?:\d*\.|)\d+(?:[eE][+-]?\d+|)/.source,te=new RegExp("^(?:([+-])=|)("+ee+")([a-z%]*)$","i"),ne=["Top","Right","Bottom","Left"],re=E.documentElement,ie=function(e){return S.contains(e.ownerDocument,e)},oe={composed:!0};re.getRootNode&&(ie=function(e){return S.contains(e.ownerDocument,e)||e.getRootNode(oe)===e.ownerDocument});var ae=function(e,t){return"none"===(e=t||e).style.display||""===e.style.display&&ie(e)&&"none"===S.css(e,"display")};function se(e,t,n,r){var i,o,a=20,s=r?function(){return r.cur()}:function(){return S.css(e,t,"")},u=s(),l=n&&n[3]||(S.cssNumber[t]?"":"px"),c=e.nodeType&&(S.cssNumber[t]||"px"!==l&&+u)&&te.exec(S.css(e,t));if(c&&c[3]!==l){u/=2,l=l||c[3],c=+u||1;while(a--)S.style(e,t,c+l),(1-o)*(1-(o=s()/u||.5))<=0&&(a=0),c/=o;c*=2,S.style(e,t,c+l),n=n||[]}return n&&(c=+c||+u||0,i=n[1]?c+(n[1]+1)*n[2]:+n[2],r&&(r.unit=l,r.start=c,r.end=i)),i}var ue={};function le(e,t){for(var n,r,i,o,a,s,u,l=[],c=0,f=e.length;c<f;c++)(r=e[c]).style&&(n=r.style.display,t?("none"===n&&(l[c]=Y.get(r,"display")||null,l[c]||(r.style.display="")),""===r.style.display&&ae(r)&&(l[c]=(u=a=o=void 0,a=(i=r).ownerDocument,s=i.nodeName,(u=ue[s])||(o=a.body.appendChild(a.createElement(s)),u=S.css(o,"display"),o.parentNode.removeChild(o),"none"===u&&(u="block"),ue[s]=u)))):"none"!==n&&(l[c]="none",Y.set(r,"display",n)));for(c=0;c<f;c++)null!=l[c]&&(e[c].style.display=l[c]);return e}S.fn.extend({show:function(){return le(this,!0)},hide:function(){return le(this)},toggle:function(e){return"boolean"==typeof e?e?this.show():this.hide():this.each(function(){ae(this)?S(this).show():S(this).hide()})}});var ce,fe,pe=/^(?:checkbox|radio)$/i,de=/<([a-z][^\/\0>\x20\t\r\n\f]*)/i,he=/^$|^module$|\/(?:java|ecma)script/i;ce=E.createDocumentFragment().appendChild(E.createElement("div")),(fe=E.createElement("input")).setAttribute("type","radio"),fe.setAttribute("checked","checked"),fe.setAttribute("name","t"),ce.appendChild(fe),y.checkClone=ce.cloneNode(!0).cloneNode(!0).lastChild.checked,ce.innerHTML="<textarea>x</textarea>",y.noCloneChecked=!!ce.cloneNode(!0).lastChild.defaultValue,ce.innerHTML="<option></option>",y.option=!!ce.lastChild;var ge={thead:[1,"<table>","</table>"],col:[2,"<table><colgroup>","</colgroup></table>"],tr:[2,"<table><tbody>","</tbody></table>"],td:[3,"<table><tbody><tr>","</tr></tbody></table>"],_default:[0,"",""]};function ve(e,t){var n;return n="undefined"!=typeof e.getElementsByTagName?e.getElementsByTagName(t||"*"):"undefined"!=typeof e.querySelectorAll?e.querySelectorAll(t||"*"):[],void 0===t||t&&A(e,t)?S.merge([e],n):n}function ye(e,t){for(var n=0,r=e.length;n<r;n++)Y.set(e[n],"globalEval",!t||Y.get(t[n],"globalEval"))}ge.tbody=ge.tfoot=ge.colgroup=ge.caption=ge.thead,ge.th=ge.td,y.option||(ge.optgroup=ge.option=[1,"<select multiple='multiple'>","</select>"]);var me=/<|&#?\w+;/;function xe(e,t,n,r,i){for(var o,a,s,u,l,c,f=t.createDocumentFragment(),p=[],d=0,h=e.length;d<h;d++)if((o=e[d])||0===o)if("object"===w(o))S.merge(p,o.nodeType?[o]:o);else if(me.test(o)){a=a||f.appendChild(t.createElement("div")),s=(de.exec(o)||["",""])[1].toLowerCase(),u=ge[s]||ge._default,a.innerHTML=u[1]+S.htmlPrefilter(o)+u[2],c=u[0];while(c--)a=a.lastChild;S.merge(p,a.childNodes),(a=f.firstChild).textContent=""}else p.push(t.createTextNode(o));f.textContent="",d=0;while(o=p[d++])if(r&&-1<S.inArray(o,r))i&&i.push(o);else if(l=ie(o),a=ve(f.appendChild(o),"script"),l&&ye(a),n){c=0;while(o=a[c++])he.test(o.type||"")&&n.push(o)}return f}var be=/^key/,we=/^(?:mouse|pointer|contextmenu|drag|drop)|click/,Te=/^([^.]*)(?:\.(.+)|)/;function Ce(){return!0}function Ee(){return!1}function Se(e,t){return e===function(){try{return E.activeElement}catch(e){}}()==("focus"===t)}function ke(e,t,n,r,i,o){var a,s;if("object"==typeof t){for(s in"string"!=typeof n&&(r=r||n,n=void 0),t)ke(e,s,n,r,t[s],o);return e}if(null==r&&null==i?(i=n,r=n=void 0):null==i&&("string"==typeof n?(i=r,r=void 0):(i=r,r=n,n=void 0)),!1===i)i=Ee;else if(!i)return e;return 1===o&&(a=i,(i=function(e){return S().off(e),a.apply(this,arguments)}).guid=a.guid||(a.guid=S.guid++)),e.each(function(){S.event.add(this,t,i,r,n)})}function Ae(e,i,o){o?(Y.set(e,i,!1),S.event.add(e,i,{namespace:!1,handler:function(e){var t,n,r=Y.get(this,i);if(1&e.isTrigger&&this[i]){if(r.length)(S.event.special[i]||{}).delegateType&&e.stopPropagation();else if(r=s.call(arguments),Y.set(this,i,r),t=o(this,i),this[i](),r!==(n=Y.get(this,i))||t?Y.set(this,i,!1):n={},r!==n)return e.stopImmediatePropagation(),e.preventDefault(),n.value}else r.length&&(Y.set(this,i,{value:S.event.trigger(S.extend(r[0],S.Event.prototype),r.slice(1),this)}),e.stopImmediatePropagation())}})):void 0===Y.get(e,i)&&S.event.add(e,i,Ce)}S.event={global:{},add:function(t,e,n,r,i){var o,a,s,u,l,c,f,p,d,h,g,v=Y.get(t);if(V(t)){n.handler&&(n=(o=n).handler,i=o.selector),i&&S.find.matchesSelector(re,i),n.guid||(n.guid=S.guid++),(u=v.events)||(u=v.events=Object.create(null)),(a=v.handle)||(a=v.handle=function(e){return"undefined"!=typeof S&&S.event.triggered!==e.type?S.event.dispatch.apply(t,arguments):void 0}),l=(e=(e||"").match(P)||[""]).length;while(l--)d=g=(s=Te.exec(e[l])||[])[1],h=(s[2]||"").split(".").sort(),d&&(f=S.event.special[d]||{},d=(i?f.delegateType:f.bindType)||d,f=S.event.special[d]||{},c=S.extend({type:d,origType:g,data:r,handler:n,guid:n.guid,selector:i,needsContext:i&&S.expr.match.needsContext.test(i),namespace:h.join(".")},o),(p=u[d])||((p=u[d]=[]).delegateCount=0,f.setup&&!1!==f.setup.call(t,r,h,a)||t.addEventListener&&t.addEventListener(d,a)),f.add&&(f.add.call(t,c),c.handler.guid||(c.handler.guid=n.guid)),i?p.splice(p.delegateCount++,0,c):p.push(c),S.event.global[d]=!0)}},remove:function(e,t,n,r,i){var o,a,s,u,l,c,f,p,d,h,g,v=Y.hasData(e)&&Y.get(e);if(v&&(u=v.events)){l=(t=(t||"").match(P)||[""]).length;while(l--)if(d=g=(s=Te.exec(t[l])||[])[1],h=(s[2]||"").split(".").sort(),d){f=S.event.special[d]||{},p=u[d=(r?f.delegateType:f.bindType)||d]||[],s=s[2]&&new RegExp("(^|\\.)"+h.join("\\.(?:.*\\.|)")+"(\\.|$)"),a=o=p.length;while(o--)c=p[o],!i&&g!==c.origType||n&&n.guid!==c.guid||s&&!s.test(c.namespace)||r&&r!==c.selector&&("**"!==r||!c.selector)||(p.splice(o,1),c.selector&&p.delegateCount--,f.remove&&f.remove.call(e,c));a&&!p.length&&(f.teardown&&!1!==f.teardown.call(e,h,v.handle)||S.removeEvent(e,d,v.handle),delete u[d])}else for(d in u)S.event.remove(e,d+t[l],n,r,!0);S.isEmptyObject(u)&&Y.remove(e,"handle events")}},dispatch:function(e){var t,n,r,i,o,a,s=new Array(arguments.length),u=S.event.fix(e),l=(Y.get(this,"events")||Object.create(null))[u.type]||[],c=S.event.special[u.type]||{};for(s[0]=u,t=1;t<arguments.length;t++)s[t]=arguments[t];if(u.delegateTarget=this,!c.preDispatch||!1!==c.preDispatch.call(this,u)){a=S.event.handlers.call(this,u,l),t=0;while((i=a[t++])&&!u.isPropagationStopped()){u.currentTarget=i.elem,n=0;while((o=i.handlers[n++])&&!u.isImmediatePropagationStopped())u.rnamespace&&!1!==o.namespace&&!u.rnamespace.test(o.namespace)||(u.handleObj=o,u.data=o.data,void 0!==(r=((S.event.special[o.origType]||{}).handle||o.handler).apply(i.elem,s))&&!1===(u.result=r)&&(u.preventDefault(),u.stopPropagation()))}return c.postDispatch&&c.postDispatch.call(this,u),u.result}},handlers:function(e,t){var n,r,i,o,a,s=[],u=t.delegateCount,l=e.target;if(u&&l.nodeType&&!("click"===e.type&&1<=e.button))for(;l!==this;l=l.parentNode||this)if(1===l.nodeType&&("click"!==e.type||!0!==l.disabled)){for(o=[],a={},n=0;n<u;n++)void 0===a[i=(r=t[n]).selector+" "]&&(a[i]=r.needsContext?-1<S(i,this).index(l):S.find(i,this,null,[l]).length),a[i]&&o.push(r);o.length&&s.push({elem:l,handlers:o})}return l=this,u<t.length&&s.push({elem:l,handlers:t.slice(u)}),s},addProp:function(t,e){Object.defineProperty(S.Event.prototype,t,{enumerable:!0,configurable:!0,get:m(e)?function(){if(this.originalEvent)return e(this.originalEvent)}:function(){if(this.originalEvent)return this.originalEvent[t]},set:function(e){Object.defineProperty(this,t,{enumerable:!0,configurable:!0,writable:!0,value:e})}})},fix:function(e){return e[S.expando]?e:new S.Event(e)},special:{load:{noBubble:!0},click:{setup:function(e){var t=this||e;return pe.test(t.type)&&t.click&&A(t,"input")&&Ae(t,"click",Ce),!1},trigger:function(e){var t=this||e;return pe.test(t.type)&&t.click&&A(t,"input")&&Ae(t,"click"),!0},_default:function(e){var t=e.target;return pe.test(t.type)&&t.click&&A(t,"input")&&Y.get(t,"click")||A(t,"a")}},beforeunload:{postDispatch:function(e){void 0!==e.result&&e.originalEvent&&(e.originalEvent.returnValue=e.result)}}}},S.removeEvent=function(e,t,n){e.removeEventListener&&e.removeEventListener(t,n)},S.Event=function(e,t){if(!(this instanceof S.Event))return new S.Event(e,t);e&&e.type?(this.originalEvent=e,this.type=e.type,this.isDefaultPrevented=e.defaultPrevented||void 0===e.defaultPrevented&&!1===e.returnValue?Ce:Ee,this.target=e.target&&3===e.target.nodeType?e.target.parentNode:e.target,this.currentTarget=e.currentTarget,this.relatedTarget=e.relatedTarget):this.type=e,t&&S.extend(this,t),this.timeStamp=e&&e.timeStamp||Date.now(),this[S.expando]=!0},S.Event.prototype={constructor:S.Event,isDefaultPrevented:Ee,isPropagationStopped:Ee,isImmediatePropagationStopped:Ee,isSimulated:!1,preventDefault:function(){var e=this.originalEvent;this.isDefaultPrevented=Ce,e&&!this.isSimulated&&e.preventDefault()},stopPropagation:function(){var e=this.originalEvent;this.isPropagationStopped=Ce,e&&!this.isSimulated&&e.stopPropagation()},stopImmediatePropagation:function(){var e=this.originalEvent;this.isImmediatePropagationStopped=Ce,e&&!this.isSimulated&&e.stopImmediatePropagation(),this.stopPropagation()}},S.each({altKey:!0,bubbles:!0,cancelable:!0,changedTouches:!0,ctrlKey:!0,detail:!0,eventPhase:!0,metaKey:!0,pageX:!0,pageY:!0,shiftKey:!0,view:!0,"char":!0,code:!0,charCode:!0,key:!0,keyCode:!0,button:!0,buttons:!0,clientX:!0,clientY:!0,offsetX:!0,offsetY:!0,pointerId:!0,pointerType:!0,screenX:!0,screenY:!0,targetTouches:!0,toElement:!0,touches:!0,which:function(e){var t=e.button;return null==e.which&&be.test(e.type)?null!=e.charCode?e.charCode:e.keyCode:!e.which&&void 0!==t&&we.test(e.type)?1&t?1:2&t?3:4&t?2:0:e.which}},S.event.addProp),S.each({focus:"focusin",blur:"focusout"},function(e,t){S.event.special[e]={setup:function(){return Ae(this,e,Se),!1},trigger:function(){return Ae(this,e),!0},delegateType:t}}),S.each({mouseenter:"mouseover",mouseleave:"mouseout",pointerenter:"pointerover",pointerleave:"pointerout"},function(e,i){S.event.special[e]={delegateType:i,bindType:i,handle:function(e){var t,n=e.relatedTarget,r=e.handleObj;return n&&(n===this||S.contains(this,n))||(e.type=r.origType,t=r.handler.apply(this,arguments),e.type=i),t}}}),S.fn.extend({on:function(e,t,n,r){return ke(this,e,t,n,r)},one:function(e,t,n,r){return ke(this,e,t,n,r,1)},off:function(e,t,n){var r,i;if(e&&e.preventDefault&&e.handleObj)return r=e.handleObj,S(e.delegateTarget).off(r.namespace?r.origType+"."+r.namespace:r.origType,r.selector,r.handler),this;if("object"==typeof e){for(i in e)this.off(i,t,e[i]);return this}return!1!==t&&"function"!=typeof t||(n=t,t=void 0),!1===n&&(n=Ee),this.each(function(){S.event.remove(this,e,n,t)})}});var Ne=/<script|<style|<link/i,De=/checked\s*(?:[^=]|=\s*.checked.)/i,je=/^\s*<!(?:\[CDATA\[|--)|(?:\]\]|--)>\s*$/g;function qe(e,t){return A(e,"table")&&A(11!==t.nodeType?t:t.firstChild,"tr")&&S(e).children("tbody")[0]||e}function Le(e){return e.type=(null!==e.getAttribute("type"))+"/"+e.type,e}function He(e){return"true/"===(e.type||"").slice(0,5)?e.type=e.type.slice(5):e.removeAttribute("type"),e}function Oe(e,t){var n,r,i,o,a,s;if(1===t.nodeType){if(Y.hasData(e)&&(s=Y.get(e).events))for(i in Y.remove(t,"handle events"),s)for(n=0,r=s[i].length;n<r;n++)S.event.add(t,i,s[i][n]);Q.hasData(e)&&(o=Q.access(e),a=S.extend({},o),Q.set(t,a))}}function Pe(n,r,i,o){r=g(r);var e,t,a,s,u,l,c=0,f=n.length,p=f-1,d=r[0],h=m(d);if(h||1<f&&"string"==typeof d&&!y.checkClone&&De.test(d))return n.each(function(e){var t=n.eq(e);h&&(r[0]=d.call(this,e,t.html())),Pe(t,r,i,o)});if(f&&(t=(e=xe(r,n[0].ownerDocument,!1,n,o)).firstChild,1===e.childNodes.length&&(e=t),t||o)){for(s=(a=S.map(ve(e,"script"),Le)).length;c<f;c++)u=e,c!==p&&(u=S.clone(u,!0,!0),s&&S.merge(a,ve(u,"script"))),i.call(n[c],u,c);if(s)for(l=a[a.length-1].ownerDocument,S.map(a,He),c=0;c<s;c++)u=a[c],he.test(u.type||"")&&!Y.access(u,"globalEval")&&S.contains(l,u)&&(u.src&&"module"!==(u.type||"").toLowerCase()?S._evalUrl&&!u.noModule&&S._evalUrl(u.src,{nonce:u.nonce||u.getAttribute("nonce")},l):b(u.textContent.replace(je,""),u,l))}return n}function Re(e,t,n){for(var r,i=t?S.filter(t,e):e,o=0;null!=(r=i[o]);o++)n||1!==r.nodeType||S.cleanData(ve(r)),r.parentNode&&(n&&ie(r)&&ye(ve(r,"script")),r.parentNode.removeChild(r));return e}S.extend({htmlPrefilter:function(e){return e},clone:function(e,t,n){var r,i,o,a,s,u,l,c=e.cloneNode(!0),f=ie(e);if(!(y.noCloneChecked||1!==e.nodeType&&11!==e.nodeType||S.isXMLDoc(e)))for(a=ve(c),r=0,i=(o=ve(e)).length;r<i;r++)s=o[r],u=a[r],void 0,"input"===(l=u.nodeName.toLowerCase())&&pe.test(s.type)?u.checked=s.checked:"input"!==l&&"textarea"!==l||(u.defaultValue=s.defaultValue);if(t)if(n)for(o=o||ve(e),a=a||ve(c),r=0,i=o.length;r<i;r++)Oe(o[r],a[r]);else Oe(e,c);return 0<(a=ve(c,"script")).length&&ye(a,!f&&ve(e,"script")),c},cleanData:function(e){for(var t,n,r,i=S.event.special,o=0;void 0!==(n=e[o]);o++)if(V(n)){if(t=n[Y.expando]){if(t.events)for(r in t.events)i[r]?S.event.remove(n,r):S.removeEvent(n,r,t.handle);n[Y.expando]=void 0}n[Q.expando]&&(n[Q.expando]=void 0)}}}),S.fn.extend({detach:function(e){return Re(this,e,!0)},remove:function(e){return Re(this,e)},text:function(e){return $(this,function(e){return void 0===e?S.text(this):this.empty().each(function(){1!==this.nodeType&&11!==this.nodeType&&9!==this.nodeType||(this.textContent=e)})},null,e,arguments.length)},append:function(){return Pe(this,arguments,function(e){1!==this.nodeType&&11!==this.nodeType&&9!==this.nodeType||qe(this,e).appendChild(e)})},prepend:function(){return Pe(this,arguments,function(e){if(1===this.nodeType||11===this.nodeType||9===this.nodeType){var t=qe(this,e);t.insertBefore(e,t.firstChild)}})},before:function(){return Pe(this,arguments,function(e){this.parentNode&&this.parentNode.insertBefore(e,this)})},after:function(){return Pe(this,arguments,function(e){this.parentNode&&this.parentNode.insertBefore(e,this.nextSibling)})},empty:function(){for(var e,t=0;null!=(e=this[t]);t++)1===e.nodeType&&(S.cleanData(ve(e,!1)),e.textContent="");return this},clone:function(e,t){return e=null!=e&&e,t=null==t?e:t,this.map(function(){return S.clone(this,e,t)})},html:function(e){return $(this,function(e){var t=this[0]||{},n=0,r=this.length;if(void 0===e&&1===t.nodeType)return t.innerHTML;if("string"==typeof e&&!Ne.test(e)&&!ge[(de.exec(e)||["",""])[1].toLowerCase()]){e=S.htmlPrefilter(e);try{for(;n<r;n++)1===(t=this[n]||{}).nodeType&&(S.cleanData(ve(t,!1)),t.innerHTML=e);t=0}catch(e){}}t&&this.empty().append(e)},null,e,arguments.length)},replaceWith:function(){var n=[];return Pe(this,arguments,function(e){var t=this.parentNode;S.inArray(this,n)<0&&(S.cleanData(ve(this)),t&&t.replaceChild(e,this))},n)}}),S.each({appendTo:"append",prependTo:"prepend",insertBefore:"before",insertAfter:"after",replaceAll:"replaceWith"},function(e,a){S.fn[e]=function(e){for(var t,n=[],r=S(e),i=r.length-1,o=0;o<=i;o++)t=o===i?this:this.clone(!0),S(r[o])[a](t),u.apply(n,t.get());return this.pushStack(n)}});var Me=new RegExp("^("+ee+")(?!px)[a-z%]+$","i"),Ie=function(e){var t=e.ownerDocument.defaultView;return t&&t.opener||(t=C),t.getComputedStyle(e)},We=function(e,t,n){var r,i,o={};for(i in t)o[i]=e.style[i],e.style[i]=t[i];for(i in r=n.call(e),t)e.style[i]=o[i];return r},Fe=new RegExp(ne.join("|"),"i");function Be(e,t,n){var r,i,o,a,s=e.style;return(n=n||Ie(e))&&(""!==(a=n.getPropertyValue(t)||n[t])||ie(e)||(a=S.style(e,t)),!y.pixelBoxStyles()&&Me.test(a)&&Fe.test(t)&&(r=s.width,i=s.minWidth,o=s.maxWidth,s.minWidth=s.maxWidth=s.width=a,a=n.width,s.width=r,s.minWidth=i,s.maxWidth=o)),void 0!==a?a+"":a}function $e(e,t){return{get:function(){if(!e())return(this.get=t).apply(this,arguments);delete this.get}}}!function(){function e(){if(l){u.style.cssText="position:absolute;left:-11111px;width:60px;margin-top:1px;padding:0;border:0",l.style.cssText="position:relative;display:block;box-sizing:border-box;overflow:scroll;margin:auto;border:1px;padding:1px;width:60%;top:1%",re.appendChild(u).appendChild(l);var e=C.getComputedStyle(l);n="1%"!==e.top,s=12===t(e.marginLeft),l.style.right="60%",o=36===t(e.right),r=36===t(e.width),l.style.position="absolute",i=12===t(l.offsetWidth/3),re.removeChild(u),l=null}}function t(e){return Math.round(parseFloat(e))}var n,r,i,o,a,s,u=E.createElement("div"),l=E.createElement("div");l.style&&(l.style.backgroundClip="content-box",l.cloneNode(!0).style.backgroundClip="",y.clearCloneStyle="content-box"===l.style.backgroundClip,S.extend(y,{boxSizingReliable:function(){return e(),r},pixelBoxStyles:function(){return e(),o},pixelPosition:function(){return e(),n},reliableMarginLeft:function(){return e(),s},scrollboxSize:function(){return e(),i},reliableTrDimensions:function(){var e,t,n,r;return null==a&&(e=E.createElement("table"),t=E.createElement("tr"),n=E.createElement("div"),e.style.cssText="position:absolute;left:-11111px",t.style.height="1px",n.style.height="9px",re.appendChild(e).appendChild(t).appendChild(n),r=C.getComputedStyle(t),a=3<parseInt(r.height),re.removeChild(e)),a}}))}();var _e=["Webkit","Moz","ms"],ze=E.createElement("div").style,Ue={};function Xe(e){var t=S.cssProps[e]||Ue[e];return t||(e in ze?e:Ue[e]=function(e){var t=e[0].toUpperCase()+e.slice(1),n=_e.length;while(n--)if((e=_e[n]+t)in ze)return e}(e)||e)}var Ve=/^(none|table(?!-c[ea]).+)/,Ge=/^--/,Ye={position:"absolute",visibility:"hidden",display:"block"},Qe={letterSpacing:"0",fontWeight:"400"};function Je(e,t,n){var r=te.exec(t);return r?Math.max(0,r[2]-(n||0))+(r[3]||"px"):t}function Ke(e,t,n,r,i,o){var a="width"===t?1:0,s=0,u=0;if(n===(r?"border":"content"))return 0;for(;a<4;a+=2)"margin"===n&&(u+=S.css(e,n+ne[a],!0,i)),r?("content"===n&&(u-=S.css(e,"padding"+ne[a],!0,i)),"margin"!==n&&(u-=S.css(e,"border"+ne[a]+"Width",!0,i))):(u+=S.css(e,"padding"+ne[a],!0,i),"padding"!==n?u+=S.css(e,"border"+ne[a]+"Width",!0,i):s+=S.css(e,"border"+ne[a]+"Width",!0,i));return!r&&0<=o&&(u+=Math.max(0,Math.ceil(e["offset"+t[0].toUpperCase()+t.slice(1)]-o-u-s-.5))||0),u}function Ze(e,t,n){var r=Ie(e),i=(!y.boxSizingReliable()||n)&&"border-box"===S.css(e,"boxSizing",!1,r),o=i,a=Be(e,t,r),s="offset"+t[0].toUpperCase()+t.slice(1);if(Me.test(a)){if(!n)return a;a="auto"}return(!y.boxSizingReliable()&&i||!y.reliableTrDimensions()&&A(e,"tr")||"auto"===a||!parseFloat(a)&&"inline"===S.css(e,"display",!1,r))&&e.getClientRects().length&&(i="border-box"===S.css(e,"boxSizing",!1,r),(o=s in e)&&(a=e[s])),(a=parseFloat(a)||0)+Ke(e,t,n||(i?"border":"content"),o,r,a)+"px"}function et(e,t,n,r,i){return new et.prototype.init(e,t,n,r,i)}S.extend({cssHooks:{opacity:{get:function(e,t){if(t){var n=Be(e,"opacity");return""===n?"1":n}}}},cssNumber:{animationIterationCount:!0,columnCount:!0,fillOpacity:!0,flexGrow:!0,flexShrink:!0,fontWeight:!0,gridArea:!0,gridColumn:!0,gridColumnEnd:!0,gridColumnStart:!0,gridRow:!0,gridRowEnd:!0,gridRowStart:!0,lineHeight:!0,opacity:!0,order:!0,orphans:!0,widows:!0,zIndex:!0,zoom:!0},cssProps:{},style:function(e,t,n,r){if(e&&3!==e.nodeType&&8!==e.nodeType&&e.style){var i,o,a,s=X(t),u=Ge.test(t),l=e.style;if(u||(t=Xe(s)),a=S.cssHooks[t]||S.cssHooks[s],void 0===n)return a&&"get"in a&&void 0!==(i=a.get(e,!1,r))?i:l[t];"string"===(o=typeof n)&&(i=te.exec(n))&&i[1]&&(n=se(e,t,i),o="number"),null!=n&&n==n&&("number"!==o||u||(n+=i&&i[3]||(S.cssNumber[s]?"":"px")),y.clearCloneStyle||""!==n||0!==t.indexOf("background")||(l[t]="inherit"),a&&"set"in a&&void 0===(n=a.set(e,n,r))||(u?l.setProperty(t,n):l[t]=n))}},css:function(e,t,n,r){var i,o,a,s=X(t);return Ge.test(t)||(t=Xe(s)),(a=S.cssHooks[t]||S.cssHooks[s])&&"get"in a&&(i=a.get(e,!0,n)),void 0===i&&(i=Be(e,t,r)),"normal"===i&&t in Qe&&(i=Qe[t]),""===n||n?(o=parseFloat(i),!0===n||isFinite(o)?o||0:i):i}}),S.each(["height","width"],function(e,u){S.cssHooks[u]={get:function(e,t,n){if(t)return!Ve.test(S.css(e,"display"))||e.getClientRects().length&&e.getBoundingClientRect().width?Ze(e,u,n):We(e,Ye,function(){return Ze(e,u,n)})},set:function(e,t,n){var r,i=Ie(e),o=!y.scrollboxSize()&&"absolute"===i.position,a=(o||n)&&"border-box"===S.css(e,"boxSizing",!1,i),s=n?Ke(e,u,n,a,i):0;return a&&o&&(s-=Math.ceil(e["offset"+u[0].toUpperCase()+u.slice(1)]-parseFloat(i[u])-Ke(e,u,"border",!1,i)-.5)),s&&(r=te.exec(t))&&"px"!==(r[3]||"px")&&(e.style[u]=t,t=S.css(e,u)),Je(0,t,s)}}}),S.cssHooks.marginLeft=$e(y.reliableMarginLeft,function(e,t){if(t)return(parseFloat(Be(e,"marginLeft"))||e.getBoundingClientRect().left-We(e,{marginLeft:0},function(){return e.getBoundingClientRect().left}))+"px"}),S.each({margin:"",padding:"",border:"Width"},function(i,o){S.cssHooks[i+o]={expand:function(e){for(var t=0,n={},r="string"==typeof e?e.split(" "):[e];t<4;t++)n[i+ne[t]+o]=r[t]||r[t-2]||r[0];return n}},"margin"!==i&&(S.cssHooks[i+o].set=Je)}),S.fn.extend({css:function(e,t){return $(this,function(e,t,n){var r,i,o={},a=0;if(Array.isArray(t)){for(r=Ie(e),i=t.length;a<i;a++)o[t[a]]=S.css(e,t[a],!1,r);return o}return void 0!==n?S.style(e,t,n):S.css(e,t)},e,t,1<arguments.length)}}),((S.Tween=et).prototype={constructor:et,init:function(e,t,n,r,i,o){this.elem=e,this.prop=n,this.easing=i||S.easing._default,this.options=t,this.start=this.now=this.cur(),this.end=r,this.unit=o||(S.cssNumber[n]?"":"px")},cur:function(){var e=et.propHooks[this.prop];return e&&e.get?e.get(this):et.propHooks._default.get(this)},run:function(e){var t,n=et.propHooks[this.prop];return this.options.duration?this.pos=t=S.easing[this.easing](e,this.options.duration*e,0,1,this.options.duration):this.pos=t=e,this.now=(this.end-this.start)*t+this.start,this.options.step&&this.options.step.call(this.elem,this.now,this),n&&n.set?n.set(this):et.propHooks._default.set(this),this}}).init.prototype=et.prototype,(et.propHooks={_default:{get:function(e){var t;return 1!==e.elem.nodeType||null!=e.elem[e.prop]&&null==e.elem.style[e.prop]?e.elem[e.prop]:(t=S.css(e.elem,e.prop,""))&&"auto"!==t?t:0},set:function(e){S.fx.step[e.prop]?S.fx.step[e.prop](e):1!==e.elem.nodeType||!S.cssHooks[e.prop]&&null==e.elem.style[Xe(e.prop)]?e.elem[e.prop]=e.now:S.style(e.elem,e.prop,e.now+e.unit)}}}).scrollTop=et.propHooks.scrollLeft={set:function(e){e.elem.nodeType&&e.elem.parentNode&&(e.elem[e.prop]=e.now)}},S.easing={linear:function(e){return e},swing:function(e){return.5-Math.cos(e*Math.PI)/2},_default:"swing"},S.fx=et.prototype.init,S.fx.step={};var tt,nt,rt,it,ot=/^(?:toggle|show|hide)$/,at=/queueHooks$/;function st(){nt&&(!1===E.hidden&&C.requestAnimationFrame?C.requestAnimationFrame(st):C.setTimeout(st,S.fx.interval),S.fx.tick())}function ut(){return C.setTimeout(function(){tt=void 0}),tt=Date.now()}function lt(e,t){var n,r=0,i={height:e};for(t=t?1:0;r<4;r+=2-t)i["margin"+(n=ne[r])]=i["padding"+n]=e;return t&&(i.opacity=i.width=e),i}function ct(e,t,n){for(var r,i=(ft.tweeners[t]||[]).concat(ft.tweeners["*"]),o=0,a=i.length;o<a;o++)if(r=i[o].call(n,t,e))return r}function ft(o,e,t){var n,a,r=0,i=ft.prefilters.length,s=S.Deferred().always(function(){delete u.elem}),u=function(){if(a)return!1;for(var e=tt||ut(),t=Math.max(0,l.startTime+l.duration-e),n=1-(t/l.duration||0),r=0,i=l.tweens.length;r<i;r++)l.tweens[r].run(n);return s.notifyWith(o,[l,n,t]),n<1&&i?t:(i||s.notifyWith(o,[l,1,0]),s.resolveWith(o,[l]),!1)},l=s.promise({elem:o,props:S.extend({},e),opts:S.extend(!0,{specialEasing:{},easing:S.easing._default},t),originalProperties:e,originalOptions:t,startTime:tt||ut(),duration:t.duration,tweens:[],createTween:function(e,t){var n=S.Tween(o,l.opts,e,t,l.opts.specialEasing[e]||l.opts.easing);return l.tweens.push(n),n},stop:function(e){var t=0,n=e?l.tweens.length:0;if(a)return this;for(a=!0;t<n;t++)l.tweens[t].run(1);return e?(s.notifyWith(o,[l,1,0]),s.resolveWith(o,[l,e])):s.rejectWith(o,[l,e]),this}}),c=l.props;for(!function(e,t){var n,r,i,o,a;for(n in e)if(i=t[r=X(n)],o=e[n],Array.isArray(o)&&(i=o[1],o=e[n]=o[0]),n!==r&&(e[r]=o,delete e[n]),(a=S.cssHooks[r])&&"expand"in a)for(n in o=a.expand(o),delete e[r],o)n in e||(e[n]=o[n],t[n]=i);else t[r]=i}(c,l.opts.specialEasing);r<i;r++)if(n=ft.prefilters[r].call(l,o,c,l.opts))return m(n.stop)&&(S._queueHooks(l.elem,l.opts.queue).stop=n.stop.bind(n)),n;return S.map(c,ct,l),m(l.opts.start)&&l.opts.start.call(o,l),l.progress(l.opts.progress).done(l.opts.done,l.opts.complete).fail(l.opts.fail).always(l.opts.always),S.fx.timer(S.extend(u,{elem:o,anim:l,queue:l.opts.queue})),l}S.Animation=S.extend(ft,{tweeners:{"*":[function(e,t){var n=this.createTween(e,t);return se(n.elem,e,te.exec(t),n),n}]},tweener:function(e,t){m(e)?(t=e,e=["*"]):e=e.match(P);for(var n,r=0,i=e.length;r<i;r++)n=e[r],ft.tweeners[n]=ft.tweeners[n]||[],ft.tweeners[n].unshift(t)},prefilters:[function(e,t,n){var r,i,o,a,s,u,l,c,f="width"in t||"height"in t,p=this,d={},h=e.style,g=e.nodeType&&ae(e),v=Y.get(e,"fxshow");for(r in n.queue||(null==(a=S._queueHooks(e,"fx")).unqueued&&(a.unqueued=0,s=a.empty.fire,a.empty.fire=function(){a.unqueued||s()}),a.unqueued++,p.always(function(){p.always(function(){a.unqueued--,S.queue(e,"fx").length||a.empty.fire()})})),t)if(i=t[r],ot.test(i)){if(delete t[r],o=o||"toggle"===i,i===(g?"hide":"show")){if("show"!==i||!v||void 0===v[r])continue;g=!0}d[r]=v&&v[r]||S.style(e,r)}if((u=!S.isEmptyObject(t))||!S.isEmptyObject(d))for(r in f&&1===e.nodeType&&(n.overflow=[h.overflow,h.overflowX,h.overflowY],null==(l=v&&v.display)&&(l=Y.get(e,"display")),"none"===(c=S.css(e,"display"))&&(l?c=l:(le([e],!0),l=e.style.display||l,c=S.css(e,"display"),le([e]))),("inline"===c||"inline-block"===c&&null!=l)&&"none"===S.css(e,"float")&&(u||(p.done(function(){h.display=l}),null==l&&(c=h.display,l="none"===c?"":c)),h.display="inline-block")),n.overflow&&(h.overflow="hidden",p.always(function(){h.overflow=n.overflow[0],h.overflowX=n.overflow[1],h.overflowY=n.overflow[2]})),u=!1,d)u||(v?"hidden"in v&&(g=v.hidden):v=Y.access(e,"fxshow",{display:l}),o&&(v.hidden=!g),g&&le([e],!0),p.done(function(){for(r in g||le([e]),Y.remove(e,"fxshow"),d)S.style(e,r,d[r])})),u=ct(g?v[r]:0,r,p),r in v||(v[r]=u.start,g&&(u.end=u.start,u.start=0))}],prefilter:function(e,t){t?ft.prefilters.unshift(e):ft.prefilters.push(e)}}),S.speed=function(e,t,n){var r=e&&"object"==typeof e?S.extend({},e):{complete:n||!n&&t||m(e)&&e,duration:e,easing:n&&t||t&&!m(t)&&t};return S.fx.off?r.duration=0:"number"!=typeof r.duration&&(r.duration in S.fx.speeds?r.duration=S.fx.speeds[r.duration]:r.duration=S.fx.speeds._default),null!=r.queue&&!0!==r.queue||(r.queue="fx"),r.old=r.complete,r.complete=function(){m(r.old)&&r.old.call(this),r.queue&&S.dequeue(this,r.queue)},r},S.fn.extend({fadeTo:function(e,t,n,r){return this.filter(ae).css("opacity",0).show().end().animate({opacity:t},e,n,r)},animate:function(t,e,n,r){var i=S.isEmptyObject(t),o=S.speed(e,n,r),a=function(){var e=ft(this,S.extend({},t),o);(i||Y.get(this,"finish"))&&e.stop(!0)};return a.finish=a,i||!1===o.queue?this.each(a):this.queue(o.queue,a)},stop:function(i,e,o){var a=function(e){var t=e.stop;delete e.stop,t(o)};return"string"!=typeof i&&(o=e,e=i,i=void 0),e&&this.queue(i||"fx",[]),this.each(function(){var e=!0,t=null!=i&&i+"queueHooks",n=S.timers,r=Y.get(this);if(t)r[t]&&r[t].stop&&a(r[t]);else for(t in r)r[t]&&r[t].stop&&at.test(t)&&a(r[t]);for(t=n.length;t--;)n[t].elem!==this||null!=i&&n[t].queue!==i||(n[t].anim.stop(o),e=!1,n.splice(t,1));!e&&o||S.dequeue(this,i)})},finish:function(a){return!1!==a&&(a=a||"fx"),this.each(function(){var e,t=Y.get(this),n=t[a+"queue"],r=t[a+"queueHooks"],i=S.timers,o=n?n.length:0;for(t.finish=!0,S.queue(this,a,[]),r&&r.stop&&r.stop.call(this,!0),e=i.length;e--;)i[e].elem===this&&i[e].queue===a&&(i[e].anim.stop(!0),i.splice(e,1));for(e=0;e<o;e++)n[e]&&n[e].finish&&n[e].finish.call(this);delete t.finish})}}),S.each(["toggle","show","hide"],function(e,r){var i=S.fn[r];S.fn[r]=function(e,t,n){return null==e||"boolean"==typeof e?i.apply(this,arguments):this.animate(lt(r,!0),e,t,n)}}),S.each({slideDown:lt("show"),slideUp:lt("hide"),slideToggle:lt("toggle"),fadeIn:{opacity:"show"},fadeOut:{opacity:"hide"},fadeToggle:{opacity:"toggle"}},function(e,r){S.fn[e]=function(e,t,n){return this.animate(r,e,t,n)}}),S.timers=[],S.fx.tick=function(){var e,t=0,n=S.timers;for(tt=Date.now();t<n.length;t++)(e=n[t])()||n[t]!==e||n.splice(t--,1);n.length||S.fx.stop(),tt=void 0},S.fx.timer=function(e){S.timers.push(e),S.fx.start()},S.fx.interval=13,S.fx.start=function(){nt||(nt=!0,st())},S.fx.stop=function(){nt=null},S.fx.speeds={slow:600,fast:200,_default:400},S.fn.delay=function(r,e){return r=S.fx&&S.fx.speeds[r]||r,e=e||"fx",this.queue(e,function(e,t){var n=C.setTimeout(e,r);t.stop=function(){C.clearTimeout(n)}})},rt=E.createElement("input"),it=E.createElement("select").appendChild(E.createElement("option")),rt.type="checkbox",y.checkOn=""!==rt.value,y.optSelected=it.selected,(rt=E.createElement("input")).value="t",rt.type="radio",y.radioValue="t"===rt.value;var pt,dt=S.expr.attrHandle;S.fn.extend({attr:function(e,t){return $(this,S.attr,e,t,1<arguments.length)},removeAttr:function(e){return this.each(function(){S.removeAttr(this,e)})}}),S.extend({attr:function(e,t,n){var r,i,o=e.nodeType;if(3!==o&&8!==o&&2!==o)return"undefined"==typeof e.getAttribute?S.prop(e,t,n):(1===o&&S.isXMLDoc(e)||(i=S.attrHooks[t.toLowerCase()]||(S.expr.match.bool.test(t)?pt:void 0)),void 0!==n?null===n?void S.removeAttr(e,t):i&&"set"in i&&void 0!==(r=i.set(e,n,t))?r:(e.setAttribute(t,n+""),n):i&&"get"in i&&null!==(r=i.get(e,t))?r:null==(r=S.find.attr(e,t))?void 0:r)},attrHooks:{type:{set:function(e,t){if(!y.radioValue&&"radio"===t&&A(e,"input")){var n=e.value;return e.setAttribute("type",t),n&&(e.value=n),t}}}},removeAttr:function(e,t){var n,r=0,i=t&&t.match(P);if(i&&1===e.nodeType)while(n=i[r++])e.removeAttribute(n)}}),pt={set:function(e,t,n){return!1===t?S.removeAttr(e,n):e.setAttribute(n,n),n}},S.each(S.expr.match.bool.source.match(/\w+/g),function(e,t){var a=dt[t]||S.find.attr;dt[t]=function(e,t,n){var r,i,o=t.toLowerCase();return n||(i=dt[o],dt[o]=r,r=null!=a(e,t,n)?o:null,dt[o]=i),r}});var ht=/^(?:input|select|textarea|button)$/i,gt=/^(?:a|area)$/i;function vt(e){return(e.match(P)||[]).join(" ")}function yt(e){return e.getAttribute&&e.getAttribute("class")||""}function mt(e){return Array.isArray(e)?e:"string"==typeof e&&e.match(P)||[]}S.fn.extend({prop:function(e,t){return $(this,S.prop,e,t,1<arguments.length)},removeProp:function(e){return this.each(function(){delete this[S.propFix[e]||e]})}}),S.extend({prop:function(e,t,n){var r,i,o=e.nodeType;if(3!==o&&8!==o&&2!==o)return 1===o&&S.isXMLDoc(e)||(t=S.propFix[t]||t,i=S.propHooks[t]),void 0!==n?i&&"set"in i&&void 0!==(r=i.set(e,n,t))?r:e[t]=n:i&&"get"in i&&null!==(r=i.get(e,t))?r:e[t]},propHooks:{tabIndex:{get:function(e){var t=S.find.attr(e,"tabindex");return t?parseInt(t,10):ht.test(e.nodeName)||gt.test(e.nodeName)&&e.href?0:-1}}},propFix:{"for":"htmlFor","class":"className"}}),y.optSelected||(S.propHooks.selected={get:function(e){var t=e.parentNode;return t&&t.parentNode&&t.parentNode.selectedIndex,null},set:function(e){var t=e.parentNode;t&&(t.selectedIndex,t.parentNode&&t.parentNode.selectedIndex)}}),S.each(["tabIndex","readOnly","maxLength","cellSpacing","cellPadding","rowSpan","colSpan","useMap","frameBorder","contentEditable"],function(){S.propFix[this.toLowerCase()]=this}),S.fn.extend({addClass:function(t){var e,n,r,i,o,a,s,u=0;if(m(t))return this.each(function(e){S(this).addClass(t.call(this,e,yt(this)))});if((e=mt(t)).length)while(n=this[u++])if(i=yt(n),r=1===n.nodeType&&" "+vt(i)+" "){a=0;while(o=e[a++])r.indexOf(" "+o+" ")<0&&(r+=o+" ");i!==(s=vt(r))&&n.setAttribute("class",s)}return this},removeClass:function(t){var e,n,r,i,o,a,s,u=0;if(m(t))return this.each(function(e){S(this).removeClass(t.call(this,e,yt(this)))});if(!arguments.length)return this.attr("class","");if((e=mt(t)).length)while(n=this[u++])if(i=yt(n),r=1===n.nodeType&&" "+vt(i)+" "){a=0;while(o=e[a++])while(-1<r.indexOf(" "+o+" "))r=r.replace(" "+o+" "," ");i!==(s=vt(r))&&n.setAttribute("class",s)}return this},toggleClass:function(i,t){var o=typeof i,a="string"===o||Array.isArray(i);return"boolean"==typeof t&&a?t?this.addClass(i):this.removeClass(i):m(i)?this.each(function(e){S(this).toggleClass(i.call(this,e,yt(this),t),t)}):this.each(function(){var e,t,n,r;if(a){t=0,n=S(this),r=mt(i);while(e=r[t++])n.hasClass(e)?n.removeClass(e):n.addClass(e)}else void 0!==i&&"boolean"!==o||((e=yt(this))&&Y.set(this,"__className__",e),this.setAttribute&&this.setAttribute("class",e||!1===i?"":Y.get(this,"__className__")||""))})},hasClass:function(e){var t,n,r=0;t=" "+e+" ";while(n=this[r++])if(1===n.nodeType&&-1<(" "+vt(yt(n))+" ").indexOf(t))return!0;return!1}});var xt=/\r/g;S.fn.extend({val:function(n){var r,e,i,t=this[0];return arguments.length?(i=m(n),this.each(function(e){var t;1===this.nodeType&&(null==(t=i?n.call(this,e,S(this).val()):n)?t="":"number"==typeof t?t+="":Array.isArray(t)&&(t=S.map(t,function(e){return null==e?"":e+""})),(r=S.valHooks[this.type]||S.valHooks[this.nodeName.toLowerCase()])&&"set"in r&&void 0!==r.set(this,t,"value")||(this.value=t))})):t?(r=S.valHooks[t.type]||S.valHooks[t.nodeName.toLowerCase()])&&"get"in r&&void 0!==(e=r.get(t,"value"))?e:"string"==typeof(e=t.value)?e.replace(xt,""):null==e?"":e:void 0}}),S.extend({valHooks:{option:{get:function(e){var t=S.find.attr(e,"value");return null!=t?t:vt(S.text(e))}},select:{get:function(e){var t,n,r,i=e.options,o=e.selectedIndex,a="select-one"===e.type,s=a?null:[],u=a?o+1:i.length;for(r=o<0?u:a?o:0;r<u;r++)if(((n=i[r]).selected||r===o)&&!n.disabled&&(!n.parentNode.disabled||!A(n.parentNode,"optgroup"))){if(t=S(n).val(),a)return t;s.push(t)}return s},set:function(e,t){var n,r,i=e.options,o=S.makeArray(t),a=i.length;while(a--)((r=i[a]).selected=-1<S.inArray(S.valHooks.option.get(r),o))&&(n=!0);return n||(e.selectedIndex=-1),o}}}}),S.each(["radio","checkbox"],function(){S.valHooks[this]={set:function(e,t){if(Array.isArray(t))return e.checked=-1<S.inArray(S(e).val(),t)}},y.checkOn||(S.valHooks[this].get=function(e){return null===e.getAttribute("value")?"on":e.value})}),y.focusin="onfocusin"in C;var bt=/^(?:focusinfocus|focusoutblur)$/,wt=function(e){e.stopPropagation()};S.extend(S.event,{trigger:function(e,t,n,r){var i,o,a,s,u,l,c,f,p=[n||E],d=v.call(e,"type")?e.type:e,h=v.call(e,"namespace")?e.namespace.split("."):[];if(o=f=a=n=n||E,3!==n.nodeType&&8!==n.nodeType&&!bt.test(d+S.event.triggered)&&(-1<d.indexOf(".")&&(d=(h=d.split(".")).shift(),h.sort()),u=d.indexOf(":")<0&&"on"+d,(e=e[S.expando]?e:new S.Event(d,"object"==typeof e&&e)).isTrigger=r?2:3,e.namespace=h.join("."),e.rnamespace=e.namespace?new RegExp("(^|\\.)"+h.join("\\.(?:.*\\.|)")+"(\\.|$)"):null,e.result=void 0,e.target||(e.target=n),t=null==t?[e]:S.makeArray(t,[e]),c=S.event.special[d]||{},r||!c.trigger||!1!==c.trigger.apply(n,t))){if(!r&&!c.noBubble&&!x(n)){for(s=c.delegateType||d,bt.test(s+d)||(o=o.parentNode);o;o=o.parentNode)p.push(o),a=o;a===(n.ownerDocument||E)&&p.push(a.defaultView||a.parentWindow||C)}i=0;while((o=p[i++])&&!e.isPropagationStopped())f=o,e.type=1<i?s:c.bindType||d,(l=(Y.get(o,"events")||Object.create(null))[e.type]&&Y.get(o,"handle"))&&l.apply(o,t),(l=u&&o[u])&&l.apply&&V(o)&&(e.result=l.apply(o,t),!1===e.result&&e.preventDefault());return e.type=d,r||e.isDefaultPrevented()||c._default&&!1!==c._default.apply(p.pop(),t)||!V(n)||u&&m(n[d])&&!x(n)&&((a=n[u])&&(n[u]=null),S.event.triggered=d,e.isPropagationStopped()&&f.addEventListener(d,wt),n[d](),e.isPropagationStopped()&&f.removeEventListener(d,wt),S.event.triggered=void 0,a&&(n[u]=a)),e.result}},simulate:function(e,t,n){var r=S.extend(new S.Event,n,{type:e,isSimulated:!0});S.event.trigger(r,null,t)}}),S.fn.extend({trigger:function(e,t){return this.each(function(){S.event.trigger(e,t,this)})},triggerHandler:function(e,t){var n=this[0];if(n)return S.event.trigger(e,t,n,!0)}}),y.focusin||S.each({focus:"focusin",blur:"focusout"},function(n,r){var i=function(e){S.event.simulate(r,e.target,S.event.fix(e))};S.event.special[r]={setup:function(){var e=this.ownerDocument||this.document||this,t=Y.access(e,r);t||e.addEventListener(n,i,!0),Y.access(e,r,(t||0)+1)},teardown:function(){var e=this.ownerDocument||this.document||this,t=Y.access(e,r)-1;t?Y.access(e,r,t):(e.removeEventListener(n,i,!0),Y.remove(e,r))}}});var Tt=C.location,Ct={guid:Date.now()},Et=/\?/;S.parseXML=function(e){var t;if(!e||"string"!=typeof e)return null;try{t=(new C.DOMParser).parseFromString(e,"text/xml")}catch(e){t=void 0}return t&&!t.getElementsByTagName("parsererror").length||S.error("Invalid XML: "+e),t};var St=/\[\]$/,kt=/\r?\n/g,At=/^(?:submit|button|image|reset|file)$/i,Nt=/^(?:input|select|textarea|keygen)/i;function Dt(n,e,r,i){var t;if(Array.isArray(e))S.each(e,function(e,t){r||St.test(n)?i(n,t):Dt(n+"["+("object"==typeof t&&null!=t?e:"")+"]",t,r,i)});else if(r||"object"!==w(e))i(n,e);else for(t in e)Dt(n+"["+t+"]",e[t],r,i)}S.param=function(e,t){var n,r=[],i=function(e,t){var n=m(t)?t():t;r[r.length]=encodeURIComponent(e)+"="+encodeURIComponent(null==n?"":n)};if(null==e)return"";if(Array.isArray(e)||e.jquery&&!S.isPlainObject(e))S.each(e,function(){i(this.name,this.value)});else for(n in e)Dt(n,e[n],t,i);return r.join("&")},S.fn.extend({serialize:function(){return S.param(this.serializeArray())},serializeArray:function(){return this.map(function(){var e=S.prop(this,"elements");return e?S.makeArray(e):this}).filter(function(){var e=this.type;return this.name&&!S(this).is(":disabled")&&Nt.test(this.nodeName)&&!At.test(e)&&(this.checked||!pe.test(e))}).map(function(e,t){var n=S(this).val();return null==n?null:Array.isArray(n)?S.map(n,function(e){return{name:t.name,value:e.replace(kt,"\r\n")}}):{name:t.name,value:n.replace(kt,"\r\n")}}).get()}});var jt=/%20/g,qt=/#.*$/,Lt=/([?&])_=[^&]*/,Ht=/^(.*?):[ \t]*([^\r\n]*)$/gm,Ot=/^(?:GET|HEAD)$/,Pt=/^\/\//,Rt={},Mt={},It="*/".concat("*"),Wt=E.createElement("a");function Ft(o){return function(e,t){"string"!=typeof e&&(t=e,e="*");var n,r=0,i=e.toLowerCase().match(P)||[];if(m(t))while(n=i[r++])"+"===n[0]?(n=n.slice(1)||"*",(o[n]=o[n]||[]).unshift(t)):(o[n]=o[n]||[]).push(t)}}function Bt(t,i,o,a){var s={},u=t===Mt;function l(e){var r;return s[e]=!0,S.each(t[e]||[],function(e,t){var n=t(i,o,a);return"string"!=typeof n||u||s[n]?u?!(r=n):void 0:(i.dataTypes.unshift(n),l(n),!1)}),r}return l(i.dataTypes[0])||!s["*"]&&l("*")}function $t(e,t){var n,r,i=S.ajaxSettings.flatOptions||{};for(n in t)void 0!==t[n]&&((i[n]?e:r||(r={}))[n]=t[n]);return r&&S.extend(!0,e,r),e}Wt.href=Tt.href,S.extend({active:0,lastModified:{},etag:{},ajaxSettings:{url:Tt.href,type:"GET",isLocal:/^(?:about|app|app-storage|.+-extension|file|res|widget):$/.test(Tt.protocol),global:!0,processData:!0,async:!0,contentType:"application/x-www-form-urlencoded; charset=UTF-8",accepts:{"*":It,text:"text/plain",html:"text/html",xml:"application/xml, text/xml",json:"application/json, text/javascript"},contents:{xml:/\bxml\b/,html:/\bhtml/,json:/\bjson\b/},responseFields:{xml:"responseXML",text:"responseText",json:"responseJSON"},converters:{"* text":String,"text html":!0,"text json":JSON.parse,"text xml":S.parseXML},flatOptions:{url:!0,context:!0}},ajaxSetup:function(e,t){return t?$t($t(e,S.ajaxSettings),t):$t(S.ajaxSettings,e)},ajaxPrefilter:Ft(Rt),ajaxTransport:Ft(Mt),ajax:function(e,t){"object"==typeof e&&(t=e,e=void 0),t=t||{};var c,f,p,n,d,r,h,g,i,o,v=S.ajaxSetup({},t),y=v.context||v,m=v.context&&(y.nodeType||y.jquery)?S(y):S.event,x=S.Deferred(),b=S.Callbacks("once memory"),w=v.statusCode||{},a={},s={},u="canceled",T={readyState:0,getResponseHeader:function(e){var t;if(h){if(!n){n={};while(t=Ht.exec(p))n[t[1].toLowerCase()+" "]=(n[t[1].toLowerCase()+" "]||[]).concat(t[2])}t=n[e.toLowerCase()+" "]}return null==t?null:t.join(", ")},getAllResponseHeaders:function(){return h?p:null},setRequestHeader:function(e,t){return null==h&&(e=s[e.toLowerCase()]=s[e.toLowerCase()]||e,a[e]=t),this},overrideMimeType:function(e){return null==h&&(v.mimeType=e),this},statusCode:function(e){var t;if(e)if(h)T.always(e[T.status]);else for(t in e)w[t]=[w[t],e[t]];return this},abort:function(e){var t=e||u;return c&&c.abort(t),l(0,t),this}};if(x.promise(T),v.url=((e||v.url||Tt.href)+"").replace(Pt,Tt.protocol+"//"),v.type=t.method||t.type||v.method||v.type,v.dataTypes=(v.dataType||"*").toLowerCase().match(P)||[""],null==v.crossDomain){r=E.createElement("a");try{r.href=v.url,r.href=r.href,v.crossDomain=Wt.protocol+"//"+Wt.host!=r.protocol+"//"+r.host}catch(e){v.crossDomain=!0}}if(v.data&&v.processData&&"string"!=typeof v.data&&(v.data=S.param(v.data,v.traditional)),Bt(Rt,v,t,T),h)return T;for(i in(g=S.event&&v.global)&&0==S.active++&&S.event.trigger("ajaxStart"),v.type=v.type.toUpperCase(),v.hasContent=!Ot.test(v.type),f=v.url.replace(qt,""),v.hasContent?v.data&&v.processData&&0===(v.contentType||"").indexOf("application/x-www-form-urlencoded")&&(v.data=v.data.replace(jt,"+")):(o=v.url.slice(f.length),v.data&&(v.processData||"string"==typeof v.data)&&(f+=(Et.test(f)?"&":"?")+v.data,delete v.data),!1===v.cache&&(f=f.replace(Lt,"$1"),o=(Et.test(f)?"&":"?")+"_="+Ct.guid+++o),v.url=f+o),v.ifModified&&(S.lastModified[f]&&T.setRequestHeader("If-Modified-Since",S.lastModified[f]),S.etag[f]&&T.setRequestHeader("If-None-Match",S.etag[f])),(v.data&&v.hasContent&&!1!==v.contentType||t.contentType)&&T.setRequestHeader("Content-Type",v.contentType),T.setRequestHeader("Accept",v.dataTypes[0]&&v.accepts[v.dataTypes[0]]?v.accepts[v.dataTypes[0]]+("*"!==v.dataTypes[0]?", "+It+"; q=0.01":""):v.accepts["*"]),v.headers)T.setRequestHeader(i,v.headers[i]);if(v.beforeSend&&(!1===v.beforeSend.call(y,T,v)||h))return T.abort();if(u="abort",b.add(v.complete),T.done(v.success),T.fail(v.error),c=Bt(Mt,v,t,T)){if(T.readyState=1,g&&m.trigger("ajaxSend",[T,v]),h)return T;v.async&&0<v.timeout&&(d=C.setTimeout(function(){T.abort("timeout")},v.timeout));try{h=!1,c.send(a,l)}catch(e){if(h)throw e;l(-1,e)}}else l(-1,"No Transport");function l(e,t,n,r){var i,o,a,s,u,l=t;h||(h=!0,d&&C.clearTimeout(d),c=void 0,p=r||"",T.readyState=0<e?4:0,i=200<=e&&e<300||304===e,n&&(s=function(e,t,n){var r,i,o,a,s=e.contents,u=e.dataTypes;while("*"===u[0])u.shift(),void 0===r&&(r=e.mimeType||t.getResponseHeader("Content-Type"));if(r)for(i in s)if(s[i]&&s[i].test(r)){u.unshift(i);break}if(u[0]in n)o=u[0];else{for(i in n){if(!u[0]||e.converters[i+" "+u[0]]){o=i;break}a||(a=i)}o=o||a}if(o)return o!==u[0]&&u.unshift(o),n[o]}(v,T,n)),!i&&-1<S.inArray("script",v.dataTypes)&&(v.converters["text script"]=function(){}),s=function(e,t,n,r){var i,o,a,s,u,l={},c=e.dataTypes.slice();if(c[1])for(a in e.converters)l[a.toLowerCase()]=e.converters[a];o=c.shift();while(o)if(e.responseFields[o]&&(n[e.responseFields[o]]=t),!u&&r&&e.dataFilter&&(t=e.dataFilter(t,e.dataType)),u=o,o=c.shift())if("*"===o)o=u;else if("*"!==u&&u!==o){if(!(a=l[u+" "+o]||l["* "+o]))for(i in l)if((s=i.split(" "))[1]===o&&(a=l[u+" "+s[0]]||l["* "+s[0]])){!0===a?a=l[i]:!0!==l[i]&&(o=s[0],c.unshift(s[1]));break}if(!0!==a)if(a&&e["throws"])t=a(t);else try{t=a(t)}catch(e){return{state:"parsererror",error:a?e:"No conversion from "+u+" to "+o}}}return{state:"success",data:t}}(v,s,T,i),i?(v.ifModified&&((u=T.getResponseHeader("Last-Modified"))&&(S.lastModified[f]=u),(u=T.getResponseHeader("etag"))&&(S.etag[f]=u)),204===e||"HEAD"===v.type?l="nocontent":304===e?l="notmodified":(l=s.state,o=s.data,i=!(a=s.error))):(a=l,!e&&l||(l="error",e<0&&(e=0))),T.status=e,T.statusText=(t||l)+"",i?x.resolveWith(y,[o,l,T]):x.rejectWith(y,[T,l,a]),T.statusCode(w),w=void 0,g&&m.trigger(i?"ajaxSuccess":"ajaxError",[T,v,i?o:a]),b.fireWith(y,[T,l]),g&&(m.trigger("ajaxComplete",[T,v]),--S.active||S.event.trigger("ajaxStop")))}return T},getJSON:function(e,t,n){return S.get(e,t,n,"json")},getScript:function(e,t){return S.get(e,void 0,t,"script")}}),S.each(["get","post"],function(e,i){S[i]=function(e,t,n,r){return m(t)&&(r=r||n,n=t,t=void 0),S.ajax(S.extend({url:e,type:i,dataType:r,data:t,success:n},S.isPlainObject(e)&&e))}}),S.ajaxPrefilter(function(e){var t;for(t in e.headers)"content-type"===t.toLowerCase()&&(e.contentType=e.headers[t]||"")}),S._evalUrl=function(e,t,n){return S.ajax({url:e,type:"GET",dataType:"script",cache:!0,async:!1,global:!1,converters:{"text script":function(){}},dataFilter:function(e){S.globalEval(e,t,n)}})},S.fn.extend({wrapAll:function(e){var t;return this[0]&&(m(e)&&(e=e.call(this[0])),t=S(e,this[0].ownerDocument).eq(0).clone(!0),this[0].parentNode&&t.insertBefore(this[0]),t.map(function(){var e=this;while(e.firstElementChild)e=e.firstElementChild;return e}).append(this)),this},wrapInner:function(n){return m(n)?this.each(function(e){S(this).wrapInner(n.call(this,e))}):this.each(function(){var e=S(this),t=e.contents();t.length?t.wrapAll(n):e.append(n)})},wrap:function(t){var n=m(t);return this.each(function(e){S(this).wrapAll(n?t.call(this,e):t)})},unwrap:function(e){return this.parent(e).not("body").each(function(){S(this).replaceWith(this.childNodes)}),this}}),S.expr.pseudos.hidden=function(e){return!S.expr.pseudos.visible(e)},S.expr.pseudos.visible=function(e){return!!(e.offsetWidth||e.offsetHeight||e.getClientRects().length)},S.ajaxSettings.xhr=function(){try{return new C.XMLHttpRequest}catch(e){}};var _t={0:200,1223:204},zt=S.ajaxSettings.xhr();y.cors=!!zt&&"withCredentials"in zt,y.ajax=zt=!!zt,S.ajaxTransport(function(i){var o,a;if(y.cors||zt&&!i.crossDomain)return{send:function(e,t){var n,r=i.xhr();if(r.open(i.type,i.url,i.async,i.username,i.password),i.xhrFields)for(n in i.xhrFields)r[n]=i.xhrFields[n];for(n in i.mimeType&&r.overrideMimeType&&r.overrideMimeType(i.mimeType),i.crossDomain||e["X-Requested-With"]||(e["X-Requested-With"]="XMLHttpRequest"),e)r.setRequestHeader(n,e[n]);o=function(e){return function(){o&&(o=a=r.onload=r.onerror=r.onabort=r.ontimeout=r.onreadystatechange=null,"abort"===e?r.abort():"error"===e?"number"!=typeof r.status?t(0,"error"):t(r.status,r.statusText):t(_t[r.status]||r.status,r.statusText,"text"!==(r.responseType||"text")||"string"!=typeof r.responseText?{binary:r.response}:{text:r.responseText},r.getAllResponseHeaders()))}},r.onload=o(),a=r.onerror=r.ontimeout=o("error"),void 0!==r.onabort?r.onabort=a:r.onreadystatechange=function(){4===r.readyState&&C.setTimeout(function(){o&&a()})},o=o("abort");try{r.send(i.hasContent&&i.data||null)}catch(e){if(o)throw e}},abort:function(){o&&o()}}}),S.ajaxPrefilter(function(e){e.crossDomain&&(e.contents.script=!1)}),S.ajaxSetup({accepts:{script:"text/javascript, application/javascript, application/ecmascript, application/x-ecmascript"},contents:{script:/\b(?:java|ecma)script\b/},converters:{"text script":function(e){return S.globalEval(e),e}}}),S.ajaxPrefilter("script",function(e){void 0===e.cache&&(e.cache=!1),e.crossDomain&&(e.type="GET")}),S.ajaxTransport("script",function(n){var r,i;if(n.crossDomain||n.scriptAttrs)return{send:function(e,t){r=S("<script>").attr(n.scriptAttrs||{}).prop({charset:n.scriptCharset,src:n.url}).on("load error",i=function(e){r.remove(),i=null,e&&t("error"===e.type?404:200,e.type)}),E.head.appendChild(r[0])},abort:function(){i&&i()}}});var Ut,Xt=[],Vt=/(=)\?(?=&|$)|\?\?/;S.ajaxSetup({jsonp:"callback",jsonpCallback:function(){var e=Xt.pop()||S.expando+"_"+Ct.guid++;return this[e]=!0,e}}),S.ajaxPrefilter("json jsonp",function(e,t,n){var r,i,o,a=!1!==e.jsonp&&(Vt.test(e.url)?"url":"string"==typeof e.data&&0===(e.contentType||"").indexOf("application/x-www-form-urlencoded")&&Vt.test(e.data)&&"data");if(a||"jsonp"===e.dataTypes[0])return r=e.jsonpCallback=m(e.jsonpCallback)?e.jsonpCallback():e.jsonpCallback,a?e[a]=e[a].replace(Vt,"$1"+r):!1!==e.jsonp&&(e.url+=(Et.test(e.url)?"&":"?")+e.jsonp+"="+r),e.converters["script json"]=function(){return o||S.error(r+" was not called"),o[0]},e.dataTypes[0]="json",i=C[r],C[r]=function(){o=arguments},n.always(function(){void 0===i?S(C).removeProp(r):C[r]=i,e[r]&&(e.jsonpCallback=t.jsonpCallback,Xt.push(r)),o&&m(i)&&i(o[0]),o=i=void 0}),"script"}),y.createHTMLDocument=((Ut=E.implementation.createHTMLDocument("").body).innerHTML="<form></form><form></form>",2===Ut.childNodes.length),S.parseHTML=function(e,t,n){return"string"!=typeof e?[]:("boolean"==typeof t&&(n=t,t=!1),t||(y.createHTMLDocument?((r=(t=E.implementation.createHTMLDocument("")).createElement("base")).href=E.location.href,t.head.appendChild(r)):t=E),o=!n&&[],(i=N.exec(e))?[t.createElement(i[1])]:(i=xe([e],t,o),o&&o.length&&S(o).remove(),S.merge([],i.childNodes)));var r,i,o},S.fn.load=function(e,t,n){var r,i,o,a=this,s=e.indexOf(" ");return-1<s&&(r=vt(e.slice(s)),e=e.slice(0,s)),m(t)?(n=t,t=void 0):t&&"object"==typeof t&&(i="POST"),0<a.length&&S.ajax({url:e,type:i||"GET",dataType:"html",data:t}).done(function(e){o=arguments,a.html(r?S("<div>").append(S.parseHTML(e)).find(r):e)}).always(n&&function(e,t){a.each(function(){n.apply(this,o||[e.responseText,t,e])})}),this},S.expr.pseudos.animated=function(t){return S.grep(S.timers,function(e){return t===e.elem}).length},S.offset={setOffset:function(e,t,n){var r,i,o,a,s,u,l=S.css(e,"position"),c=S(e),f={};"static"===l&&(e.style.position="relative"),s=c.offset(),o=S.css(e,"top"),u=S.css(e,"left"),("absolute"===l||"fixed"===l)&&-1<(o+u).indexOf("auto")?(a=(r=c.position()).top,i=r.left):(a=parseFloat(o)||0,i=parseFloat(u)||0),m(t)&&(t=t.call(e,n,S.extend({},s))),null!=t.top&&(f.top=t.top-s.top+a),null!=t.left&&(f.left=t.left-s.left+i),"using"in t?t.using.call(e,f):("number"==typeof f.top&&(f.top+="px"),"number"==typeof f.left&&(f.left+="px"),c.css(f))}},S.fn.extend({offset:function(t){if(arguments.length)return void 0===t?this:this.each(function(e){S.offset.setOffset(this,t,e)});var e,n,r=this[0];return r?r.getClientRects().length?(e=r.getBoundingClientRect(),n=r.ownerDocument.defaultView,{top:e.top+n.pageYOffset,left:e.left+n.pageXOffset}):{top:0,left:0}:void 0},position:function(){if(this[0]){var e,t,n,r=this[0],i={top:0,left:0};if("fixed"===S.css(r,"position"))t=r.getBoundingClientRect();else{t=this.offset(),n=r.ownerDocument,e=r.offsetParent||n.documentElement;while(e&&(e===n.body||e===n.documentElement)&&"static"===S.css(e,"position"))e=e.parentNode;e&&e!==r&&1===e.nodeType&&((i=S(e).offset()).top+=S.css(e,"borderTopWidth",!0),i.left+=S.css(e,"borderLeftWidth",!0))}return{top:t.top-i.top-S.css(r,"marginTop",!0),left:t.left-i.left-S.css(r,"marginLeft",!0)}}},offsetParent:function(){return this.map(function(){var e=this.offsetParent;while(e&&"static"===S.css(e,"position"))e=e.offsetParent;return e||re})}}),S.each({scrollLeft:"pageXOffset",scrollTop:"pageYOffset"},function(t,i){var o="pageYOffset"===i;S.fn[t]=function(e){return $(this,function(e,t,n){var r;if(x(e)?r=e:9===e.nodeType&&(r=e.defaultView),void 0===n)return r?r[i]:e[t];r?r.scrollTo(o?r.pageXOffset:n,o?n:r.pageYOffset):e[t]=n},t,e,arguments.length)}}),S.each(["top","left"],function(e,n){S.cssHooks[n]=$e(y.pixelPosition,function(e,t){if(t)return t=Be(e,n),Me.test(t)?S(e).position()[n]+"px":t})}),S.each({Height:"height",Width:"width"},function(a,s){S.each({padding:"inner"+a,content:s,"":"outer"+a},function(r,o){S.fn[o]=function(e,t){var n=arguments.length&&(r||"boolean"!=typeof e),i=r||(!0===e||!0===t?"margin":"border");return $(this,function(e,t,n){var r;return x(e)?0===o.indexOf("outer")?e["inner"+a]:e.document.documentElement["client"+a]:9===e.nodeType?(r=e.documentElement,Math.max(e.body["scroll"+a],r["scroll"+a],e.body["offset"+a],r["offset"+a],r["client"+a])):void 0===n?S.css(e,t,i):S.style(e,t,n,i)},s,n?e:void 0,n)}})}),S.each(["ajaxStart","ajaxStop","ajaxComplete","ajaxError","ajaxSuccess","ajaxSend"],function(e,t){S.fn[t]=function(e){return this.on(t,e)}}),S.fn.extend({bind:function(e,t,n){return this.on(e,null,t,n)},unbind:function(e,t){return this.off(e,null,t)},delegate:function(e,t,n,r){return this.on(t,e,n,r)},undelegate:function(e,t,n){return 1===arguments.length?this.off(e,"**"):this.off(t,e||"**",n)},hover:function(e,t){return this.mouseenter(e).mouseleave(t||e)}}),S.each("blur focus focusin focusout resize scroll click dblclick mousedown mouseup mousemove mouseover mouseout mouseenter mouseleave change select submit keydown keypress keyup contextmenu".split(" "),function(e,n){S.fn[n]=function(e,t){return 0<arguments.length?this.on(n,null,e,t):this.trigger(n)}});var Gt=/^[\s\uFEFF\xA0]+|[\s\uFEFF\xA0]+$/g;S.proxy=function(e,t){var n,r,i;if("string"==typeof t&&(n=e[t],t=e,e=n),m(e))return r=s.call(arguments,2),(i=function(){return e.apply(t||this,r.concat(s.call(arguments)))}).guid=e.guid=e.guid||S.guid++,i},S.holdReady=function(e){e?S.readyWait++:S.ready(!0)},S.isArray=Array.isArray,S.parseJSON=JSON.parse,S.nodeName=A,S.isFunction=m,S.isWindow=x,S.camelCase=X,S.type=w,S.now=Date.now,S.isNumeric=function(e){var t=S.type(e);return("number"===t||"string"===t)&&!isNaN(e-parseFloat(e))},S.trim=function(e){return null==e?"":(e+"").replace(Gt,"")},"function"==typeof define&&define.amd&&define("jquery",[],function(){return S});var Yt=C.jQuery,Qt=C.$;return S.noConflict=function(e){return C.$===S&&(C.$=Qt),e&&C.jQuery===S&&(C.jQuery=Yt),S},"undefined"==typeof e&&(C.jQuery=C.$=S),S});
+/*! jQuery v3.6.0 | (c) OpenJS Foundation and other contributors | jquery.org/license */
+!function(e,t){"use strict";"object"==typeof module&&"object"==typeof module.exports?module.exports=e.document?t(e,!0):function(e){if(!e.document)throw new Error("jQuery requires a window with a document");return t(e)}:t(e)}("undefined"!=typeof window?window:this,function(C,e){"use strict";var t=[],r=Object.getPrototypeOf,s=t.slice,g=t.flat?function(e){return t.flat.call(e)}:function(e){return t.concat.apply([],e)},u=t.push,i=t.indexOf,n={},o=n.toString,v=n.hasOwnProperty,a=v.toString,l=a.call(Object),y={},m=function(e){return"function"==typeof e&&"number"!=typeof e.nodeType&&"function"!=typeof e.item},x=function(e){return null!=e&&e===e.window},E=C.document,c={type:!0,src:!0,nonce:!0,noModule:!0};function b(e,t,n){var r,i,o=(n=n||E).createElement("script");if(o.text=e,t)for(r in c)(i=t[r]||t.getAttribute&&t.getAttribute(r))&&o.setAttribute(r,i);n.head.appendChild(o).parentNode.removeChild(o)}function w(e){return null==e?e+"":"object"==typeof e||"function"==typeof e?n[o.call(e)]||"object":typeof e}var f="3.6.0",S=function(e,t){return new S.fn.init(e,t)};function p(e){var t=!!e&&"length"in e&&e.length,n=w(e);return!m(e)&&!x(e)&&("array"===n||0===t||"number"==typeof t&&0<t&&t-1 in e)}S.fn=S.prototype={jquery:f,constructor:S,length:0,toArray:function(){return s.call(this)},get:function(e){return null==e?s.call(this):e<0?this[e+this.length]:this[e]},pushStack:function(e){var t=S.merge(this.constructor(),e);return t.prevObject=this,t},each:function(e){return S.each(this,e)},map:function(n){return this.pushStack(S.map(this,function(e,t){return n.call(e,t,e)}))},slice:function(){return this.pushStack(s.apply(this,arguments))},first:function(){return this.eq(0)},last:function(){return this.eq(-1)},even:function(){return this.pushStack(S.grep(this,function(e,t){return(t+1)%2}))},odd:function(){return this.pushStack(S.grep(this,function(e,t){return t%2}))},eq:function(e){var t=this.length,n=+e+(e<0?t:0);return this.pushStack(0<=n&&n<t?[this[n]]:[])},end:function(){return this.prevObject||this.constructor()},push:u,sort:t.sort,splice:t.splice},S.extend=S.fn.extend=function(){var e,t,n,r,i,o,a=arguments[0]||{},s=1,u=arguments.length,l=!1;for("boolean"==typeof a&&(l=a,a=arguments[s]||{},s++),"object"==typeof a||m(a)||(a={}),s===u&&(a=this,s--);s<u;s++)if(null!=(e=arguments[s]))for(t in e)r=e[t],"__proto__"!==t&&a!==r&&(l&&r&&(S.isPlainObject(r)||(i=Array.isArray(r)))?(n=a[t],o=i&&!Array.isArray(n)?[]:i||S.isPlainObject(n)?n:{},i=!1,a[t]=S.extend(l,o,r)):void 0!==r&&(a[t]=r));return a},S.extend({expando:"jQuery"+(f+Math.random()).replace(/\D/g,""),isReady:!0,error:function(e){throw new Error(e)},noop:function(){},isPlainObject:function(e){var t,n;return!(!e||"[object Object]"!==o.call(e))&&(!(t=r(e))||"function"==typeof(n=v.call(t,"constructor")&&t.constructor)&&a.call(n)===l)},isEmptyObject:function(e){var t;for(t in e)return!1;return!0},globalEval:function(e,t,n){b(e,{nonce:t&&t.nonce},n)},each:function(e,t){var n,r=0;if(p(e)){for(n=e.length;r<n;r++)if(!1===t.call(e[r],r,e[r]))break}else for(r in e)if(!1===t.call(e[r],r,e[r]))break;return e},makeArray:function(e,t){var n=t||[];return null!=e&&(p(Object(e))?S.merge(n,"string"==typeof e?[e]:e):u.call(n,e)),n},inArray:function(e,t,n){return null==t?-1:i.call(t,e,n)},merge:function(e,t){for(var n=+t.length,r=0,i=e.length;r<n;r++)e[i++]=t[r];return e.length=i,e},grep:function(e,t,n){for(var r=[],i=0,o=e.length,a=!n;i<o;i++)!t(e[i],i)!==a&&r.push(e[i]);return r},map:function(e,t,n){var r,i,o=0,a=[];if(p(e))for(r=e.length;o<r;o++)null!=(i=t(e[o],o,n))&&a.push(i);else for(o in e)null!=(i=t(e[o],o,n))&&a.push(i);return g(a)},guid:1,support:y}),"function"==typeof Symbol&&(S.fn[Symbol.iterator]=t[Symbol.iterator]),S.each("Boolean Number String Function Array Date RegExp Object Error Symbol".split(" "),function(e,t){n["[object "+t+"]"]=t.toLowerCase()});var d=function(n){var e,d,b,o,i,h,f,g,w,u,l,T,C,a,E,v,s,c,y,S="sizzle"+1*new Date,p=n.document,k=0,r=0,m=ue(),x=ue(),A=ue(),N=ue(),j=function(e,t){return e===t&&(l=!0),0},D={}.hasOwnProperty,t=[],q=t.pop,L=t.push,H=t.push,O=t.slice,P=function(e,t){for(var n=0,r=e.length;n<r;n++)if(e[n]===t)return n;return-1},R="checked|selected|async|autofocus|autoplay|controls|defer|disabled|hidden|ismap|loop|multiple|open|readonly|required|scoped",M="[\\x20\\t\\r\\n\\f]",I="(?:\\\\[\\da-fA-F]{1,6}"+M+"?|\\\\[^\\r\\n\\f]|[\\w-]|[^\0-\\x7f])+",W="\\["+M+"*("+I+")(?:"+M+"*([*^$|!~]?=)"+M+"*(?:'((?:\\\\.|[^\\\\'])*)'|\"((?:\\\\.|[^\\\\\"])*)\"|("+I+"))|)"+M+"*\\]",F=":("+I+")(?:\\((('((?:\\\\.|[^\\\\'])*)'|\"((?:\\\\.|[^\\\\\"])*)\")|((?:\\\\.|[^\\\\()[\\]]|"+W+")*)|.*)\\)|)",B=new RegExp(M+"+","g"),$=new RegExp("^"+M+"+|((?:^|[^\\\\])(?:\\\\.)*)"+M+"+$","g"),_=new RegExp("^"+M+"*,"+M+"*"),z=new RegExp("^"+M+"*([>+~]|"+M+")"+M+"*"),U=new RegExp(M+"|>"),X=new RegExp(F),V=new RegExp("^"+I+"$"),G={ID:new RegExp("^#("+I+")"),CLASS:new RegExp("^\\.("+I+")"),TAG:new RegExp("^("+I+"|[*])"),ATTR:new RegExp("^"+W),PSEUDO:new RegExp("^"+F),CHILD:new RegExp("^:(only|first|last|nth|nth-last)-(child|of-type)(?:\\("+M+"*(even|odd|(([+-]|)(\\d*)n|)"+M+"*(?:([+-]|)"+M+"*(\\d+)|))"+M+"*\\)|)","i"),bool:new RegExp("^(?:"+R+")$","i"),needsContext:new RegExp("^"+M+"*[>+~]|:(even|odd|eq|gt|lt|nth|first|last)(?:\\("+M+"*((?:-\\d)?\\d*)"+M+"*\\)|)(?=[^-]|$)","i")},Y=/HTML$/i,Q=/^(?:input|select|textarea|button)$/i,J=/^h\d$/i,K=/^[^{]+\{\s*\[native \w/,Z=/^(?:#([\w-]+)|(\w+)|\.([\w-]+))$/,ee=/[+~]/,te=new RegExp("\\\\[\\da-fA-F]{1,6}"+M+"?|\\\\([^\\r\\n\\f])","g"),ne=function(e,t){var n="0x"+e.slice(1)-65536;return t||(n<0?String.fromCharCode(n+65536):String.fromCharCode(n>>10|55296,1023&n|56320))},re=/([\0-\x1f\x7f]|^-?\d)|^-$|[^\0-\x1f\x7f-\uFFFF\w-]/g,ie=function(e,t){return t?"\0"===e?"\ufffd":e.slice(0,-1)+"\\"+e.charCodeAt(e.length-1).toString(16)+" ":"\\"+e},oe=function(){T()},ae=be(function(e){return!0===e.disabled&&"fieldset"===e.nodeName.toLowerCase()},{dir:"parentNode",next:"legend"});try{H.apply(t=O.call(p.childNodes),p.childNodes),t[p.childNodes.length].nodeType}catch(e){H={apply:t.length?function(e,t){L.apply(e,O.call(t))}:function(e,t){var n=e.length,r=0;while(e[n++]=t[r++]);e.length=n-1}}}function se(t,e,n,r){var i,o,a,s,u,l,c,f=e&&e.ownerDocument,p=e?e.nodeType:9;if(n=n||[],"string"!=typeof t||!t||1!==p&&9!==p&&11!==p)return n;if(!r&&(T(e),e=e||C,E)){if(11!==p&&(u=Z.exec(t)))if(i=u[1]){if(9===p){if(!(a=e.getElementById(i)))return n;if(a.id===i)return n.push(a),n}else if(f&&(a=f.getElementById(i))&&y(e,a)&&a.id===i)return n.push(a),n}else{if(u[2])return H.apply(n,e.getElementsByTagName(t)),n;if((i=u[3])&&d.getElementsByClassName&&e.getElementsByClassName)return H.apply(n,e.getElementsByClassName(i)),n}if(d.qsa&&!N[t+" "]&&(!v||!v.test(t))&&(1!==p||"object"!==e.nodeName.toLowerCase())){if(c=t,f=e,1===p&&(U.test(t)||z.test(t))){(f=ee.test(t)&&ye(e.parentNode)||e)===e&&d.scope||((s=e.getAttribute("id"))?s=s.replace(re,ie):e.setAttribute("id",s=S)),o=(l=h(t)).length;while(o--)l[o]=(s?"#"+s:":scope")+" "+xe(l[o]);c=l.join(",")}try{return H.apply(n,f.querySelectorAll(c)),n}catch(e){N(t,!0)}finally{s===S&&e.removeAttribute("id")}}}return g(t.replace($,"$1"),e,n,r)}function ue(){var r=[];return function e(t,n){return r.push(t+" ")>b.cacheLength&&delete e[r.shift()],e[t+" "]=n}}function le(e){return e[S]=!0,e}function ce(e){var t=C.createElement("fieldset");try{return!!e(t)}catch(e){return!1}finally{t.parentNode&&t.parentNode.removeChild(t),t=null}}function fe(e,t){var n=e.split("|"),r=n.length;while(r--)b.attrHandle[n[r]]=t}function pe(e,t){var n=t&&e,r=n&&1===e.nodeType&&1===t.nodeType&&e.sourceIndex-t.sourceIndex;if(r)return r;if(n)while(n=n.nextSibling)if(n===t)return-1;return e?1:-1}function de(t){return function(e){return"input"===e.nodeName.toLowerCase()&&e.type===t}}function he(n){return function(e){var t=e.nodeName.toLowerCase();return("input"===t||"button"===t)&&e.type===n}}function ge(t){return function(e){return"form"in e?e.parentNode&&!1===e.disabled?"label"in e?"label"in e.parentNode?e.parentNode.disabled===t:e.disabled===t:e.isDisabled===t||e.isDisabled!==!t&&ae(e)===t:e.disabled===t:"label"in e&&e.disabled===t}}function ve(a){return le(function(o){return o=+o,le(function(e,t){var n,r=a([],e.length,o),i=r.length;while(i--)e[n=r[i]]&&(e[n]=!(t[n]=e[n]))})})}function ye(e){return e&&"undefined"!=typeof e.getElementsByTagName&&e}for(e in d=se.support={},i=se.isXML=function(e){var t=e&&e.namespaceURI,n=e&&(e.ownerDocument||e).documentElement;return!Y.test(t||n&&n.nodeName||"HTML")},T=se.setDocument=function(e){var t,n,r=e?e.ownerDocument||e:p;return r!=C&&9===r.nodeType&&r.documentElement&&(a=(C=r).documentElement,E=!i(C),p!=C&&(n=C.defaultView)&&n.top!==n&&(n.addEventListener?n.addEventListener("unload",oe,!1):n.attachEvent&&n.attachEvent("onunload",oe)),d.scope=ce(function(e){return a.appendChild(e).appendChild(C.createElement("div")),"undefined"!=typeof e.querySelectorAll&&!e.querySelectorAll(":scope fieldset div").length}),d.attributes=ce(function(e){return e.className="i",!e.getAttribute("className")}),d.getElementsByTagName=ce(function(e){return e.appendChild(C.createComment("")),!e.getElementsByTagName("*").length}),d.getElementsByClassName=K.test(C.getElementsByClassName),d.getById=ce(function(e){return a.appendChild(e).id=S,!C.getElementsByName||!C.getElementsByName(S).length}),d.getById?(b.filter.ID=function(e){var t=e.replace(te,ne);return function(e){return e.getAttribute("id")===t}},b.find.ID=function(e,t){if("undefined"!=typeof t.getElementById&&E){var n=t.getElementById(e);return n?[n]:[]}}):(b.filter.ID=function(e){var n=e.replace(te,ne);return function(e){var t="undefined"!=typeof e.getAttributeNode&&e.getAttributeNode("id");return t&&t.value===n}},b.find.ID=function(e,t){if("undefined"!=typeof t.getElementById&&E){var n,r,i,o=t.getElementById(e);if(o){if((n=o.getAttributeNode("id"))&&n.value===e)return[o];i=t.getElementsByName(e),r=0;while(o=i[r++])if((n=o.getAttributeNode("id"))&&n.value===e)return[o]}return[]}}),b.find.TAG=d.getElementsByTagName?function(e,t){return"undefined"!=typeof t.getElementsByTagName?t.getElementsByTagName(e):d.qsa?t.querySelectorAll(e):void 0}:function(e,t){var n,r=[],i=0,o=t.getElementsByTagName(e);if("*"===e){while(n=o[i++])1===n.nodeType&&r.push(n);return r}return o},b.find.CLASS=d.getElementsByClassName&&function(e,t){if("undefined"!=typeof t.getElementsByClassName&&E)return t.getElementsByClassName(e)},s=[],v=[],(d.qsa=K.test(C.querySelectorAll))&&(ce(function(e){var t;a.appendChild(e).innerHTML="<a id='"+S+"'></a><select id='"+S+"-\r\\' msallowcapture=''><option selected=''></option></select>",e.querySelectorAll("[msallowcapture^='']").length&&v.push("[*^$]="+M+"*(?:''|\"\")"),e.querySelectorAll("[selected]").length||v.push("\\["+M+"*(?:value|"+R+")"),e.querySelectorAll("[id~="+S+"-]").length||v.push("~="),(t=C.createElement("input")).setAttribute("name",""),e.appendChild(t),e.querySelectorAll("[name='']").length||v.push("\\["+M+"*name"+M+"*="+M+"*(?:''|\"\")"),e.querySelectorAll(":checked").length||v.push(":checked"),e.querySelectorAll("a#"+S+"+*").length||v.push(".#.+[+~]"),e.querySelectorAll("\\\f"),v.push("[\\r\\n\\f]")}),ce(function(e){e.innerHTML="<a href='' disabled='disabled'></a><select disabled='disabled'><option/></select>";var t=C.createElement("input");t.setAttribute("type","hidden"),e.appendChild(t).setAttribute("name","D"),e.querySelectorAll("[name=d]").length&&v.push("name"+M+"*[*^$|!~]?="),2!==e.querySelectorAll(":enabled").length&&v.push(":enabled",":disabled"),a.appendChild(e).disabled=!0,2!==e.querySelectorAll(":disabled").length&&v.push(":enabled",":disabled"),e.querySelectorAll("*,:x"),v.push(",.*:")})),(d.matchesSelector=K.test(c=a.matches||a.webkitMatchesSelector||a.mozMatchesSelector||a.oMatchesSelector||a.msMatchesSelector))&&ce(function(e){d.disconnectedMatch=c.call(e,"*"),c.call(e,"[s!='']:x"),s.push("!=",F)}),v=v.length&&new RegExp(v.join("|")),s=s.length&&new RegExp(s.join("|")),t=K.test(a.compareDocumentPosition),y=t||K.test(a.contains)?function(e,t){var n=9===e.nodeType?e.documentElement:e,r=t&&t.parentNode;return e===r||!(!r||1!==r.nodeType||!(n.contains?n.contains(r):e.compareDocumentPosition&&16&e.compareDocumentPosition(r)))}:function(e,t){if(t)while(t=t.parentNode)if(t===e)return!0;return!1},j=t?function(e,t){if(e===t)return l=!0,0;var n=!e.compareDocumentPosition-!t.compareDocumentPosition;return n||(1&(n=(e.ownerDocument||e)==(t.ownerDocument||t)?e.compareDocumentPosition(t):1)||!d.sortDetached&&t.compareDocumentPosition(e)===n?e==C||e.ownerDocument==p&&y(p,e)?-1:t==C||t.ownerDocument==p&&y(p,t)?1:u?P(u,e)-P(u,t):0:4&n?-1:1)}:function(e,t){if(e===t)return l=!0,0;var n,r=0,i=e.parentNode,o=t.parentNode,a=[e],s=[t];if(!i||!o)return e==C?-1:t==C?1:i?-1:o?1:u?P(u,e)-P(u,t):0;if(i===o)return pe(e,t);n=e;while(n=n.parentNode)a.unshift(n);n=t;while(n=n.parentNode)s.unshift(n);while(a[r]===s[r])r++;return r?pe(a[r],s[r]):a[r]==p?-1:s[r]==p?1:0}),C},se.matches=function(e,t){return se(e,null,null,t)},se.matchesSelector=function(e,t){if(T(e),d.matchesSelector&&E&&!N[t+" "]&&(!s||!s.test(t))&&(!v||!v.test(t)))try{var n=c.call(e,t);if(n||d.disconnectedMatch||e.document&&11!==e.document.nodeType)return n}catch(e){N(t,!0)}return 0<se(t,C,null,[e]).length},se.contains=function(e,t){return(e.ownerDocument||e)!=C&&T(e),y(e,t)},se.attr=function(e,t){(e.ownerDocument||e)!=C&&T(e);var n=b.attrHandle[t.toLowerCase()],r=n&&D.call(b.attrHandle,t.toLowerCase())?n(e,t,!E):void 0;return void 0!==r?r:d.attributes||!E?e.getAttribute(t):(r=e.getAttributeNode(t))&&r.specified?r.value:null},se.escape=function(e){return(e+"").replace(re,ie)},se.error=function(e){throw new Error("Syntax error, unrecognized expression: "+e)},se.uniqueSort=function(e){var t,n=[],r=0,i=0;if(l=!d.detectDuplicates,u=!d.sortStable&&e.slice(0),e.sort(j),l){while(t=e[i++])t===e[i]&&(r=n.push(i));while(r--)e.splice(n[r],1)}return u=null,e},o=se.getText=function(e){var t,n="",r=0,i=e.nodeType;if(i){if(1===i||9===i||11===i){if("string"==typeof e.textContent)return e.textContent;for(e=e.firstChild;e;e=e.nextSibling)n+=o(e)}else if(3===i||4===i)return e.nodeValue}else while(t=e[r++])n+=o(t);return n},(b=se.selectors={cacheLength:50,createPseudo:le,match:G,attrHandle:{},find:{},relative:{">":{dir:"parentNode",first:!0}," ":{dir:"parentNode"},"+":{dir:"previousSibling",first:!0},"~":{dir:"previousSibling"}},preFilter:{ATTR:function(e){return e[1]=e[1].replace(te,ne),e[3]=(e[3]||e[4]||e[5]||"").replace(te,ne),"~="===e[2]&&(e[3]=" "+e[3]+" "),e.slice(0,4)},CHILD:function(e){return e[1]=e[1].toLowerCase(),"nth"===e[1].slice(0,3)?(e[3]||se.error(e[0]),e[4]=+(e[4]?e[5]+(e[6]||1):2*("even"===e[3]||"odd"===e[3])),e[5]=+(e[7]+e[8]||"odd"===e[3])):e[3]&&se.error(e[0]),e},PSEUDO:function(e){var t,n=!e[6]&&e[2];return G.CHILD.test(e[0])?null:(e[3]?e[2]=e[4]||e[5]||"":n&&X.test(n)&&(t=h(n,!0))&&(t=n.indexOf(")",n.length-t)-n.length)&&(e[0]=e[0].slice(0,t),e[2]=n.slice(0,t)),e.slice(0,3))}},filter:{TAG:function(e){var t=e.replace(te,ne).toLowerCase();return"*"===e?function(){return!0}:function(e){return e.nodeName&&e.nodeName.toLowerCase()===t}},CLASS:function(e){var t=m[e+" "];return t||(t=new RegExp("(^|"+M+")"+e+"("+M+"|$)"))&&m(e,function(e){return t.test("string"==typeof e.className&&e.className||"undefined"!=typeof e.getAttribute&&e.getAttribute("class")||"")})},ATTR:function(n,r,i){return function(e){var t=se.attr(e,n);return null==t?"!="===r:!r||(t+="","="===r?t===i:"!="===r?t!==i:"^="===r?i&&0===t.indexOf(i):"*="===r?i&&-1<t.indexOf(i):"$="===r?i&&t.slice(-i.length)===i:"~="===r?-1<(" "+t.replace(B," ")+" ").indexOf(i):"|="===r&&(t===i||t.slice(0,i.length+1)===i+"-"))}},CHILD:function(h,e,t,g,v){var y="nth"!==h.slice(0,3),m="last"!==h.slice(-4),x="of-type"===e;return 1===g&&0===v?function(e){return!!e.parentNode}:function(e,t,n){var r,i,o,a,s,u,l=y!==m?"nextSibling":"previousSibling",c=e.parentNode,f=x&&e.nodeName.toLowerCase(),p=!n&&!x,d=!1;if(c){if(y){while(l){a=e;while(a=a[l])if(x?a.nodeName.toLowerCase()===f:1===a.nodeType)return!1;u=l="only"===h&&!u&&"nextSibling"}return!0}if(u=[m?c.firstChild:c.lastChild],m&&p){d=(s=(r=(i=(o=(a=c)[S]||(a[S]={}))[a.uniqueID]||(o[a.uniqueID]={}))[h]||[])[0]===k&&r[1])&&r[2],a=s&&c.childNodes[s];while(a=++s&&a&&a[l]||(d=s=0)||u.pop())if(1===a.nodeType&&++d&&a===e){i[h]=[k,s,d];break}}else if(p&&(d=s=(r=(i=(o=(a=e)[S]||(a[S]={}))[a.uniqueID]||(o[a.uniqueID]={}))[h]||[])[0]===k&&r[1]),!1===d)while(a=++s&&a&&a[l]||(d=s=0)||u.pop())if((x?a.nodeName.toLowerCase()===f:1===a.nodeType)&&++d&&(p&&((i=(o=a[S]||(a[S]={}))[a.uniqueID]||(o[a.uniqueID]={}))[h]=[k,d]),a===e))break;return(d-=v)===g||d%g==0&&0<=d/g}}},PSEUDO:function(e,o){var t,a=b.pseudos[e]||b.setFilters[e.toLowerCase()]||se.error("unsupported pseudo: "+e);return a[S]?a(o):1<a.length?(t=[e,e,"",o],b.setFilters.hasOwnProperty(e.toLowerCase())?le(function(e,t){var n,r=a(e,o),i=r.length;while(i--)e[n=P(e,r[i])]=!(t[n]=r[i])}):function(e){return a(e,0,t)}):a}},pseudos:{not:le(function(e){var r=[],i=[],s=f(e.replace($,"$1"));return s[S]?le(function(e,t,n,r){var i,o=s(e,null,r,[]),a=e.length;while(a--)(i=o[a])&&(e[a]=!(t[a]=i))}):function(e,t,n){return r[0]=e,s(r,null,n,i),r[0]=null,!i.pop()}}),has:le(function(t){return function(e){return 0<se(t,e).length}}),contains:le(function(t){return t=t.replace(te,ne),function(e){return-1<(e.textContent||o(e)).indexOf(t)}}),lang:le(function(n){return V.test(n||"")||se.error("unsupported lang: "+n),n=n.replace(te,ne).toLowerCase(),function(e){var t;do{if(t=E?e.lang:e.getAttribute("xml:lang")||e.getAttribute("lang"))return(t=t.toLowerCase())===n||0===t.indexOf(n+"-")}while((e=e.parentNode)&&1===e.nodeType);return!1}}),target:function(e){var t=n.location&&n.location.hash;return t&&t.slice(1)===e.id},root:function(e){return e===a},focus:function(e){return e===C.activeElement&&(!C.hasFocus||C.hasFocus())&&!!(e.type||e.href||~e.tabIndex)},enabled:ge(!1),disabled:ge(!0),checked:function(e){var t=e.nodeName.toLowerCase();return"input"===t&&!!e.checked||"option"===t&&!!e.selected},selected:function(e){return e.parentNode&&e.parentNode.selectedIndex,!0===e.selected},empty:function(e){for(e=e.firstChild;e;e=e.nextSibling)if(e.nodeType<6)return!1;return!0},parent:function(e){return!b.pseudos.empty(e)},header:function(e){return J.test(e.nodeName)},input:function(e){return Q.test(e.nodeName)},button:function(e){var t=e.nodeName.toLowerCase();return"input"===t&&"button"===e.type||"button"===t},text:function(e){var t;return"input"===e.nodeName.toLowerCase()&&"text"===e.type&&(null==(t=e.getAttribute("type"))||"text"===t.toLowerCase())},first:ve(function(){return[0]}),last:ve(function(e,t){return[t-1]}),eq:ve(function(e,t,n){return[n<0?n+t:n]}),even:ve(function(e,t){for(var n=0;n<t;n+=2)e.push(n);return e}),odd:ve(function(e,t){for(var n=1;n<t;n+=2)e.push(n);return e}),lt:ve(function(e,t,n){for(var r=n<0?n+t:t<n?t:n;0<=--r;)e.push(r);return e}),gt:ve(function(e,t,n){for(var r=n<0?n+t:n;++r<t;)e.push(r);return e})}}).pseudos.nth=b.pseudos.eq,{radio:!0,checkbox:!0,file:!0,password:!0,image:!0})b.pseudos[e]=de(e);for(e in{submit:!0,reset:!0})b.pseudos[e]=he(e);function me(){}function xe(e){for(var t=0,n=e.length,r="";t<n;t++)r+=e[t].value;return r}function be(s,e,t){var u=e.dir,l=e.next,c=l||u,f=t&&"parentNode"===c,p=r++;return e.first?function(e,t,n){while(e=e[u])if(1===e.nodeType||f)return s(e,t,n);return!1}:function(e,t,n){var r,i,o,a=[k,p];if(n){while(e=e[u])if((1===e.nodeType||f)&&s(e,t,n))return!0}else while(e=e[u])if(1===e.nodeType||f)if(i=(o=e[S]||(e[S]={}))[e.uniqueID]||(o[e.uniqueID]={}),l&&l===e.nodeName.toLowerCase())e=e[u]||e;else{if((r=i[c])&&r[0]===k&&r[1]===p)return a[2]=r[2];if((i[c]=a)[2]=s(e,t,n))return!0}return!1}}function we(i){return 1<i.length?function(e,t,n){var r=i.length;while(r--)if(!i[r](e,t,n))return!1;return!0}:i[0]}function Te(e,t,n,r,i){for(var o,a=[],s=0,u=e.length,l=null!=t;s<u;s++)(o=e[s])&&(n&&!n(o,r,i)||(a.push(o),l&&t.push(s)));return a}function Ce(d,h,g,v,y,e){return v&&!v[S]&&(v=Ce(v)),y&&!y[S]&&(y=Ce(y,e)),le(function(e,t,n,r){var i,o,a,s=[],u=[],l=t.length,c=e||function(e,t,n){for(var r=0,i=t.length;r<i;r++)se(e,t[r],n);return n}(h||"*",n.nodeType?[n]:n,[]),f=!d||!e&&h?c:Te(c,s,d,n,r),p=g?y||(e?d:l||v)?[]:t:f;if(g&&g(f,p,n,r),v){i=Te(p,u),v(i,[],n,r),o=i.length;while(o--)(a=i[o])&&(p[u[o]]=!(f[u[o]]=a))}if(e){if(y||d){if(y){i=[],o=p.length;while(o--)(a=p[o])&&i.push(f[o]=a);y(null,p=[],i,r)}o=p.length;while(o--)(a=p[o])&&-1<(i=y?P(e,a):s[o])&&(e[i]=!(t[i]=a))}}else p=Te(p===t?p.splice(l,p.length):p),y?y(null,t,p,r):H.apply(t,p)})}function Ee(e){for(var i,t,n,r=e.length,o=b.relative[e[0].type],a=o||b.relative[" "],s=o?1:0,u=be(function(e){return e===i},a,!0),l=be(function(e){return-1<P(i,e)},a,!0),c=[function(e,t,n){var r=!o&&(n||t!==w)||((i=t).nodeType?u(e,t,n):l(e,t,n));return i=null,r}];s<r;s++)if(t=b.relative[e[s].type])c=[be(we(c),t)];else{if((t=b.filter[e[s].type].apply(null,e[s].matches))[S]){for(n=++s;n<r;n++)if(b.relative[e[n].type])break;return Ce(1<s&&we(c),1<s&&xe(e.slice(0,s-1).concat({value:" "===e[s-2].type?"*":""})).replace($,"$1"),t,s<n&&Ee(e.slice(s,n)),n<r&&Ee(e=e.slice(n)),n<r&&xe(e))}c.push(t)}return we(c)}return me.prototype=b.filters=b.pseudos,b.setFilters=new me,h=se.tokenize=function(e,t){var n,r,i,o,a,s,u,l=x[e+" "];if(l)return t?0:l.slice(0);a=e,s=[],u=b.preFilter;while(a){for(o in n&&!(r=_.exec(a))||(r&&(a=a.slice(r[0].length)||a),s.push(i=[])),n=!1,(r=z.exec(a))&&(n=r.shift(),i.push({value:n,type:r[0].replace($," ")}),a=a.slice(n.length)),b.filter)!(r=G[o].exec(a))||u[o]&&!(r=u[o](r))||(n=r.shift(),i.push({value:n,type:o,matches:r}),a=a.slice(n.length));if(!n)break}return t?a.length:a?se.error(e):x(e,s).slice(0)},f=se.compile=function(e,t){var n,v,y,m,x,r,i=[],o=[],a=A[e+" "];if(!a){t||(t=h(e)),n=t.length;while(n--)(a=Ee(t[n]))[S]?i.push(a):o.push(a);(a=A(e,(v=o,m=0<(y=i).length,x=0<v.length,r=function(e,t,n,r,i){var o,a,s,u=0,l="0",c=e&&[],f=[],p=w,d=e||x&&b.find.TAG("*",i),h=k+=null==p?1:Math.random()||.1,g=d.length;for(i&&(w=t==C||t||i);l!==g&&null!=(o=d[l]);l++){if(x&&o){a=0,t||o.ownerDocument==C||(T(o),n=!E);while(s=v[a++])if(s(o,t||C,n)){r.push(o);break}i&&(k=h)}m&&((o=!s&&o)&&u--,e&&c.push(o))}if(u+=l,m&&l!==u){a=0;while(s=y[a++])s(c,f,t,n);if(e){if(0<u)while(l--)c[l]||f[l]||(f[l]=q.call(r));f=Te(f)}H.apply(r,f),i&&!e&&0<f.length&&1<u+y.length&&se.uniqueSort(r)}return i&&(k=h,w=p),c},m?le(r):r))).selector=e}return a},g=se.select=function(e,t,n,r){var i,o,a,s,u,l="function"==typeof e&&e,c=!r&&h(e=l.selector||e);if(n=n||[],1===c.length){if(2<(o=c[0]=c[0].slice(0)).length&&"ID"===(a=o[0]).type&&9===t.nodeType&&E&&b.relative[o[1].type]){if(!(t=(b.find.ID(a.matches[0].replace(te,ne),t)||[])[0]))return n;l&&(t=t.parentNode),e=e.slice(o.shift().value.length)}i=G.needsContext.test(e)?0:o.length;while(i--){if(a=o[i],b.relative[s=a.type])break;if((u=b.find[s])&&(r=u(a.matches[0].replace(te,ne),ee.test(o[0].type)&&ye(t.parentNode)||t))){if(o.splice(i,1),!(e=r.length&&xe(o)))return H.apply(n,r),n;break}}}return(l||f(e,c))(r,t,!E,n,!t||ee.test(e)&&ye(t.parentNode)||t),n},d.sortStable=S.split("").sort(j).join("")===S,d.detectDuplicates=!!l,T(),d.sortDetached=ce(function(e){return 1&e.compareDocumentPosition(C.createElement("fieldset"))}),ce(function(e){return e.innerHTML="<a href='#'></a>","#"===e.firstChild.getAttribute("href")})||fe("type|href|height|width",function(e,t,n){if(!n)return e.getAttribute(t,"type"===t.toLowerCase()?1:2)}),d.attributes&&ce(function(e){return e.innerHTML="<input/>",e.firstChild.setAttribute("value",""),""===e.firstChild.getAttribute("value")})||fe("value",function(e,t,n){if(!n&&"input"===e.nodeName.toLowerCase())return e.defaultValue}),ce(function(e){return null==e.getAttribute("disabled")})||fe(R,function(e,t,n){var r;if(!n)return!0===e[t]?t.toLowerCase():(r=e.getAttributeNode(t))&&r.specified?r.value:null}),se}(C);S.find=d,S.expr=d.selectors,S.expr[":"]=S.expr.pseudos,S.uniqueSort=S.unique=d.uniqueSort,S.text=d.getText,S.isXMLDoc=d.isXML,S.contains=d.contains,S.escapeSelector=d.escape;var h=function(e,t,n){var r=[],i=void 0!==n;while((e=e[t])&&9!==e.nodeType)if(1===e.nodeType){if(i&&S(e).is(n))break;r.push(e)}return r},T=function(e,t){for(var n=[];e;e=e.nextSibling)1===e.nodeType&&e!==t&&n.push(e);return n},k=S.expr.match.needsContext;function A(e,t){return e.nodeName&&e.nodeName.toLowerCase()===t.toLowerCase()}var N=/^<([a-z][^\/\0>:\x20\t\r\n\f]*)[\x20\t\r\n\f]*\/?>(?:<\/\1>|)$/i;function j(e,n,r){return m(n)?S.grep(e,function(e,t){return!!n.call(e,t,e)!==r}):n.nodeType?S.grep(e,function(e){return e===n!==r}):"string"!=typeof n?S.grep(e,function(e){return-1<i.call(n,e)!==r}):S.filter(n,e,r)}S.filter=function(e,t,n){var r=t[0];return n&&(e=":not("+e+")"),1===t.length&&1===r.nodeType?S.find.matchesSelector(r,e)?[r]:[]:S.find.matches(e,S.grep(t,function(e){return 1===e.nodeType}))},S.fn.extend({find:function(e){var t,n,r=this.length,i=this;if("string"!=typeof e)return this.pushStack(S(e).filter(function(){for(t=0;t<r;t++)if(S.contains(i[t],this))return!0}));for(n=this.pushStack([]),t=0;t<r;t++)S.find(e,i[t],n);return 1<r?S.uniqueSort(n):n},filter:function(e){return this.pushStack(j(this,e||[],!1))},not:function(e){return this.pushStack(j(this,e||[],!0))},is:function(e){return!!j(this,"string"==typeof e&&k.test(e)?S(e):e||[],!1).length}});var D,q=/^(?:\s*(<[\w\W]+>)[^>]*|#([\w-]+))$/;(S.fn.init=function(e,t,n){var r,i;if(!e)return this;if(n=n||D,"string"==typeof e){if(!(r="<"===e[0]&&">"===e[e.length-1]&&3<=e.length?[null,e,null]:q.exec(e))||!r[1]&&t)return!t||t.jquery?(t||n).find(e):this.constructor(t).find(e);if(r[1]){if(t=t instanceof S?t[0]:t,S.merge(this,S.parseHTML(r[1],t&&t.nodeType?t.ownerDocument||t:E,!0)),N.test(r[1])&&S.isPlainObject(t))for(r in t)m(this[r])?this[r](t[r]):this.attr(r,t[r]);return this}return(i=E.getElementById(r[2]))&&(this[0]=i,this.length=1),this}return e.nodeType?(this[0]=e,this.length=1,this):m(e)?void 0!==n.ready?n.ready(e):e(S):S.makeArray(e,this)}).prototype=S.fn,D=S(E);var L=/^(?:parents|prev(?:Until|All))/,H={children:!0,contents:!0,next:!0,prev:!0};function O(e,t){while((e=e[t])&&1!==e.nodeType);return e}S.fn.extend({has:function(e){var t=S(e,this),n=t.length;return this.filter(function(){for(var e=0;e<n;e++)if(S.contains(this,t[e]))return!0})},closest:function(e,t){var n,r=0,i=this.length,o=[],a="string"!=typeof e&&S(e);if(!k.test(e))for(;r<i;r++)for(n=this[r];n&&n!==t;n=n.parentNode)if(n.nodeType<11&&(a?-1<a.index(n):1===n.nodeType&&S.find.matchesSelector(n,e))){o.push(n);break}return this.pushStack(1<o.length?S.uniqueSort(o):o)},index:function(e){return e?"string"==typeof e?i.call(S(e),this[0]):i.call(this,e.jquery?e[0]:e):this[0]&&this[0].parentNode?this.first().prevAll().length:-1},add:function(e,t){return this.pushStack(S.uniqueSort(S.merge(this.get(),S(e,t))))},addBack:function(e){return this.add(null==e?this.prevObject:this.prevObject.filter(e))}}),S.each({parent:function(e){var t=e.parentNode;return t&&11!==t.nodeType?t:null},parents:function(e){return h(e,"parentNode")},parentsUntil:function(e,t,n){return h(e,"parentNode",n)},next:function(e){return O(e,"nextSibling")},prev:function(e){return O(e,"previousSibling")},nextAll:function(e){return h(e,"nextSibling")},prevAll:function(e){return h(e,"previousSibling")},nextUntil:function(e,t,n){return h(e,"nextSibling",n)},prevUntil:function(e,t,n){return h(e,"previousSibling",n)},siblings:function(e){return T((e.parentNode||{}).firstChild,e)},children:function(e){return T(e.firstChild)},contents:function(e){return null!=e.contentDocument&&r(e.contentDocument)?e.contentDocument:(A(e,"template")&&(e=e.content||e),S.merge([],e.childNodes))}},function(r,i){S.fn[r]=function(e,t){var n=S.map(this,i,e);return"Until"!==r.slice(-5)&&(t=e),t&&"string"==typeof t&&(n=S.filter(t,n)),1<this.length&&(H[r]||S.uniqueSort(n),L.test(r)&&n.reverse()),this.pushStack(n)}});var P=/[^\x20\t\r\n\f]+/g;function R(e){return e}function M(e){throw e}function I(e,t,n,r){var i;try{e&&m(i=e.promise)?i.call(e).done(t).fail(n):e&&m(i=e.then)?i.call(e,t,n):t.apply(void 0,[e].slice(r))}catch(e){n.apply(void 0,[e])}}S.Callbacks=function(r){var e,n;r="string"==typeof r?(e=r,n={},S.each(e.match(P)||[],function(e,t){n[t]=!0}),n):S.extend({},r);var i,t,o,a,s=[],u=[],l=-1,c=function(){for(a=a||r.once,o=i=!0;u.length;l=-1){t=u.shift();while(++l<s.length)!1===s[l].apply(t[0],t[1])&&r.stopOnFalse&&(l=s.length,t=!1)}r.memory||(t=!1),i=!1,a&&(s=t?[]:"")},f={add:function(){return s&&(t&&!i&&(l=s.length-1,u.push(t)),function n(e){S.each(e,function(e,t){m(t)?r.unique&&f.has(t)||s.push(t):t&&t.length&&"string"!==w(t)&&n(t)})}(arguments),t&&!i&&c()),this},remove:function(){return S.each(arguments,function(e,t){var n;while(-1<(n=S.inArray(t,s,n)))s.splice(n,1),n<=l&&l--}),this},has:function(e){return e?-1<S.inArray(e,s):0<s.length},empty:function(){return s&&(s=[]),this},disable:function(){return a=u=[],s=t="",this},disabled:function(){return!s},lock:function(){return a=u=[],t||i||(s=t=""),this},locked:function(){return!!a},fireWith:function(e,t){return a||(t=[e,(t=t||[]).slice?t.slice():t],u.push(t),i||c()),this},fire:function(){return f.fireWith(this,arguments),this},fired:function(){return!!o}};return f},S.extend({Deferred:function(e){var o=[["notify","progress",S.Callbacks("memory"),S.Callbacks("memory"),2],["resolve","done",S.Callbacks("once memory"),S.Callbacks("once memory"),0,"resolved"],["reject","fail",S.Callbacks("once memory"),S.Callbacks("once memory"),1,"rejected"]],i="pending",a={state:function(){return i},always:function(){return s.done(arguments).fail(arguments),this},"catch":function(e){return a.then(null,e)},pipe:function(){var i=arguments;return S.Deferred(function(r){S.each(o,function(e,t){var n=m(i[t[4]])&&i[t[4]];s[t[1]](function(){var e=n&&n.apply(this,arguments);e&&m(e.promise)?e.promise().progress(r.notify).done(r.resolve).fail(r.reject):r[t[0]+"With"](this,n?[e]:arguments)})}),i=null}).promise()},then:function(t,n,r){var u=0;function l(i,o,a,s){return function(){var n=this,r=arguments,e=function(){var e,t;if(!(i<u)){if((e=a.apply(n,r))===o.promise())throw new TypeError("Thenable self-resolution");t=e&&("object"==typeof e||"function"==typeof e)&&e.then,m(t)?s?t.call(e,l(u,o,R,s),l(u,o,M,s)):(u++,t.call(e,l(u,o,R,s),l(u,o,M,s),l(u,o,R,o.notifyWith))):(a!==R&&(n=void 0,r=[e]),(s||o.resolveWith)(n,r))}},t=s?e:function(){try{e()}catch(e){S.Deferred.exceptionHook&&S.Deferred.exceptionHook(e,t.stackTrace),u<=i+1&&(a!==M&&(n=void 0,r=[e]),o.rejectWith(n,r))}};i?t():(S.Deferred.getStackHook&&(t.stackTrace=S.Deferred.getStackHook()),C.setTimeout(t))}}return S.Deferred(function(e){o[0][3].add(l(0,e,m(r)?r:R,e.notifyWith)),o[1][3].add(l(0,e,m(t)?t:R)),o[2][3].add(l(0,e,m(n)?n:M))}).promise()},promise:function(e){return null!=e?S.extend(e,a):a}},s={};return S.each(o,function(e,t){var n=t[2],r=t[5];a[t[1]]=n.add,r&&n.add(function(){i=r},o[3-e][2].disable,o[3-e][3].disable,o[0][2].lock,o[0][3].lock),n.add(t[3].fire),s[t[0]]=function(){return s[t[0]+"With"](this===s?void 0:this,arguments),this},s[t[0]+"With"]=n.fireWith}),a.promise(s),e&&e.call(s,s),s},when:function(e){var n=arguments.length,t=n,r=Array(t),i=s.call(arguments),o=S.Deferred(),a=function(t){return function(e){r[t]=this,i[t]=1<arguments.length?s.call(arguments):e,--n||o.resolveWith(r,i)}};if(n<=1&&(I(e,o.done(a(t)).resolve,o.reject,!n),"pending"===o.state()||m(i[t]&&i[t].then)))return o.then();while(t--)I(i[t],a(t),o.reject);return o.promise()}});var W=/^(Eval|Internal|Range|Reference|Syntax|Type|URI)Error$/;S.Deferred.exceptionHook=function(e,t){C.console&&C.console.warn&&e&&W.test(e.name)&&C.console.warn("jQuery.Deferred exception: "+e.message,e.stack,t)},S.readyException=function(e){C.setTimeout(function(){throw e})};var F=S.Deferred();function B(){E.removeEventListener("DOMContentLoaded",B),C.removeEventListener("load",B),S.ready()}S.fn.ready=function(e){return F.then(e)["catch"](function(e){S.readyException(e)}),this},S.extend({isReady:!1,readyWait:1,ready:function(e){(!0===e?--S.readyWait:S.isReady)||(S.isReady=!0)!==e&&0<--S.readyWait||F.resolveWith(E,[S])}}),S.ready.then=F.then,"complete"===E.readyState||"loading"!==E.readyState&&!E.documentElement.doScroll?C.setTimeout(S.ready):(E.addEventListener("DOMContentLoaded",B),C.addEventListener("load",B));var $=function(e,t,n,r,i,o,a){var s=0,u=e.length,l=null==n;if("object"===w(n))for(s in i=!0,n)$(e,t,s,n[s],!0,o,a);else if(void 0!==r&&(i=!0,m(r)||(a=!0),l&&(a?(t.call(e,r),t=null):(l=t,t=function(e,t,n){return l.call(S(e),n)})),t))for(;s<u;s++)t(e[s],n,a?r:r.call(e[s],s,t(e[s],n)));return i?e:l?t.call(e):u?t(e[0],n):o},_=/^-ms-/,z=/-([a-z])/g;function U(e,t){return t.toUpperCase()}function X(e){return e.replace(_,"ms-").replace(z,U)}var V=function(e){return 1===e.nodeType||9===e.nodeType||!+e.nodeType};function G(){this.expando=S.expando+G.uid++}G.uid=1,G.prototype={cache:function(e){var t=e[this.expando];return t||(t={},V(e)&&(e.nodeType?e[this.expando]=t:Object.defineProperty(e,this.expando,{value:t,configurable:!0}))),t},set:function(e,t,n){var r,i=this.cache(e);if("string"==typeof t)i[X(t)]=n;else for(r in t)i[X(r)]=t[r];return i},get:function(e,t){return void 0===t?this.cache(e):e[this.expando]&&e[this.expando][X(t)]},access:function(e,t,n){return void 0===t||t&&"string"==typeof t&&void 0===n?this.get(e,t):(this.set(e,t,n),void 0!==n?n:t)},remove:function(e,t){var n,r=e[this.expando];if(void 0!==r){if(void 0!==t){n=(t=Array.isArray(t)?t.map(X):(t=X(t))in r?[t]:t.match(P)||[]).length;while(n--)delete r[t[n]]}(void 0===t||S.isEmptyObject(r))&&(e.nodeType?e[this.expando]=void 0:delete e[this.expando])}},hasData:function(e){var t=e[this.expando];return void 0!==t&&!S.isEmptyObject(t)}};var Y=new G,Q=new G,J=/^(?:\{[\w\W]*\}|\[[\w\W]*\])$/,K=/[A-Z]/g;function Z(e,t,n){var r,i;if(void 0===n&&1===e.nodeType)if(r="data-"+t.replace(K,"-$&").toLowerCase(),"string"==typeof(n=e.getAttribute(r))){try{n="true"===(i=n)||"false"!==i&&("null"===i?null:i===+i+""?+i:J.test(i)?JSON.parse(i):i)}catch(e){}Q.set(e,t,n)}else n=void 0;return n}S.extend({hasData:function(e){return Q.hasData(e)||Y.hasData(e)},data:function(e,t,n){return Q.access(e,t,n)},removeData:function(e,t){Q.remove(e,t)},_data:function(e,t,n){return Y.access(e,t,n)},_removeData:function(e,t){Y.remove(e,t)}}),S.fn.extend({data:function(n,e){var t,r,i,o=this[0],a=o&&o.attributes;if(void 0===n){if(this.length&&(i=Q.get(o),1===o.nodeType&&!Y.get(o,"hasDataAttrs"))){t=a.length;while(t--)a[t]&&0===(r=a[t].name).indexOf("data-")&&(r=X(r.slice(5)),Z(o,r,i[r]));Y.set(o,"hasDataAttrs",!0)}return i}return"object"==typeof n?this.each(function(){Q.set(this,n)}):$(this,function(e){var t;if(o&&void 0===e)return void 0!==(t=Q.get(o,n))?t:void 0!==(t=Z(o,n))?t:void 0;this.each(function(){Q.set(this,n,e)})},null,e,1<arguments.length,null,!0)},removeData:function(e){return this.each(function(){Q.remove(this,e)})}}),S.extend({queue:function(e,t,n){var r;if(e)return t=(t||"fx")+"queue",r=Y.get(e,t),n&&(!r||Array.isArray(n)?r=Y.access(e,t,S.makeArray(n)):r.push(n)),r||[]},dequeue:function(e,t){t=t||"fx";var n=S.queue(e,t),r=n.length,i=n.shift(),o=S._queueHooks(e,t);"inprogress"===i&&(i=n.shift(),r--),i&&("fx"===t&&n.unshift("inprogress"),delete o.stop,i.call(e,function(){S.dequeue(e,t)},o)),!r&&o&&o.empty.fire()},_queueHooks:function(e,t){var n=t+"queueHooks";return Y.get(e,n)||Y.access(e,n,{empty:S.Callbacks("once memory").add(function(){Y.remove(e,[t+"queue",n])})})}}),S.fn.extend({queue:function(t,n){var e=2;return"string"!=typeof t&&(n=t,t="fx",e--),arguments.length<e?S.queue(this[0],t):void 0===n?this:this.each(function(){var e=S.queue(this,t,n);S._queueHooks(this,t),"fx"===t&&"inprogress"!==e[0]&&S.dequeue(this,t)})},dequeue:function(e){return this.each(function(){S.dequeue(this,e)})},clearQueue:function(e){return this.queue(e||"fx",[])},promise:function(e,t){var n,r=1,i=S.Deferred(),o=this,a=this.length,s=function(){--r||i.resolveWith(o,[o])};"string"!=typeof e&&(t=e,e=void 0),e=e||"fx";while(a--)(n=Y.get(o[a],e+"queueHooks"))&&n.empty&&(r++,n.empty.add(s));return s(),i.promise(t)}});var ee=/[+-]?(?:\d*\.|)\d+(?:[eE][+-]?\d+|)/.source,te=new RegExp("^(?:([+-])=|)("+ee+")([a-z%]*)$","i"),ne=["Top","Right","Bottom","Left"],re=E.documentElement,ie=function(e){return S.contains(e.ownerDocument,e)},oe={composed:!0};re.getRootNode&&(ie=function(e){return S.contains(e.ownerDocument,e)||e.getRootNode(oe)===e.ownerDocument});var ae=function(e,t){return"none"===(e=t||e).style.display||""===e.style.display&&ie(e)&&"none"===S.css(e,"display")};function se(e,t,n,r){var i,o,a=20,s=r?function(){return r.cur()}:function(){return S.css(e,t,"")},u=s(),l=n&&n[3]||(S.cssNumber[t]?"":"px"),c=e.nodeType&&(S.cssNumber[t]||"px"!==l&&+u)&&te.exec(S.css(e,t));if(c&&c[3]!==l){u/=2,l=l||c[3],c=+u||1;while(a--)S.style(e,t,c+l),(1-o)*(1-(o=s()/u||.5))<=0&&(a=0),c/=o;c*=2,S.style(e,t,c+l),n=n||[]}return n&&(c=+c||+u||0,i=n[1]?c+(n[1]+1)*n[2]:+n[2],r&&(r.unit=l,r.start=c,r.end=i)),i}var ue={};function le(e,t){for(var n,r,i,o,a,s,u,l=[],c=0,f=e.length;c<f;c++)(r=e[c]).style&&(n=r.style.display,t?("none"===n&&(l[c]=Y.get(r,"display")||null,l[c]||(r.style.display="")),""===r.style.display&&ae(r)&&(l[c]=(u=a=o=void 0,a=(i=r).ownerDocument,s=i.nodeName,(u=ue[s])||(o=a.body.appendChild(a.createElement(s)),u=S.css(o,"display"),o.parentNode.removeChild(o),"none"===u&&(u="block"),ue[s]=u)))):"none"!==n&&(l[c]="none",Y.set(r,"display",n)));for(c=0;c<f;c++)null!=l[c]&&(e[c].style.display=l[c]);return e}S.fn.extend({show:function(){return le(this,!0)},hide:function(){return le(this)},toggle:function(e){return"boolean"==typeof e?e?this.show():this.hide():this.each(function(){ae(this)?S(this).show():S(this).hide()})}});var ce,fe,pe=/^(?:checkbox|radio)$/i,de=/<([a-z][^\/\0>\x20\t\r\n\f]*)/i,he=/^$|^module$|\/(?:java|ecma)script/i;ce=E.createDocumentFragment().appendChild(E.createElement("div")),(fe=E.createElement("input")).setAttribute("type","radio"),fe.setAttribute("checked","checked"),fe.setAttribute("name","t"),ce.appendChild(fe),y.checkClone=ce.cloneNode(!0).cloneNode(!0).lastChild.checked,ce.innerHTML="<textarea>x</textarea>",y.noCloneChecked=!!ce.cloneNode(!0).lastChild.defaultValue,ce.innerHTML="<option></option>",y.option=!!ce.lastChild;var ge={thead:[1,"<table>","</table>"],col:[2,"<table><colgroup>","</colgroup></table>"],tr:[2,"<table><tbody>","</tbody></table>"],td:[3,"<table><tbody><tr>","</tr></tbody></table>"],_default:[0,"",""]};function ve(e,t){var n;return n="undefined"!=typeof e.getElementsByTagName?e.getElementsByTagName(t||"*"):"undefined"!=typeof e.querySelectorAll?e.querySelectorAll(t||"*"):[],void 0===t||t&&A(e,t)?S.merge([e],n):n}function ye(e,t){for(var n=0,r=e.length;n<r;n++)Y.set(e[n],"globalEval",!t||Y.get(t[n],"globalEval"))}ge.tbody=ge.tfoot=ge.colgroup=ge.caption=ge.thead,ge.th=ge.td,y.option||(ge.optgroup=ge.option=[1,"<select multiple='multiple'>","</select>"]);var me=/<|&#?\w+;/;function xe(e,t,n,r,i){for(var o,a,s,u,l,c,f=t.createDocumentFragment(),p=[],d=0,h=e.length;d<h;d++)if((o=e[d])||0===o)if("object"===w(o))S.merge(p,o.nodeType?[o]:o);else if(me.test(o)){a=a||f.appendChild(t.createElement("div")),s=(de.exec(o)||["",""])[1].toLowerCase(),u=ge[s]||ge._default,a.innerHTML=u[1]+S.htmlPrefilter(o)+u[2],c=u[0];while(c--)a=a.lastChild;S.merge(p,a.childNodes),(a=f.firstChild).textContent=""}else p.push(t.createTextNode(o));f.textContent="",d=0;while(o=p[d++])if(r&&-1<S.inArray(o,r))i&&i.push(o);else if(l=ie(o),a=ve(f.appendChild(o),"script"),l&&ye(a),n){c=0;while(o=a[c++])he.test(o.type||"")&&n.push(o)}return f}var be=/^([^.]*)(?:\.(.+)|)/;function we(){return!0}function Te(){return!1}function Ce(e,t){return e===function(){try{return E.activeElement}catch(e){}}()==("focus"===t)}function Ee(e,t,n,r,i,o){var a,s;if("object"==typeof t){for(s in"string"!=typeof n&&(r=r||n,n=void 0),t)Ee(e,s,n,r,t[s],o);return e}if(null==r&&null==i?(i=n,r=n=void 0):null==i&&("string"==typeof n?(i=r,r=void 0):(i=r,r=n,n=void 0)),!1===i)i=Te;else if(!i)return e;return 1===o&&(a=i,(i=function(e){return S().off(e),a.apply(this,arguments)}).guid=a.guid||(a.guid=S.guid++)),e.each(function(){S.event.add(this,t,i,r,n)})}function Se(e,i,o){o?(Y.set(e,i,!1),S.event.add(e,i,{namespace:!1,handler:function(e){var t,n,r=Y.get(this,i);if(1&e.isTrigger&&this[i]){if(r.length)(S.event.special[i]||{}).delegateType&&e.stopPropagation();else if(r=s.call(arguments),Y.set(this,i,r),t=o(this,i),this[i](),r!==(n=Y.get(this,i))||t?Y.set(this,i,!1):n={},r!==n)return e.stopImmediatePropagation(),e.preventDefault(),n&&n.value}else r.length&&(Y.set(this,i,{value:S.event.trigger(S.extend(r[0],S.Event.prototype),r.slice(1),this)}),e.stopImmediatePropagation())}})):void 0===Y.get(e,i)&&S.event.add(e,i,we)}S.event={global:{},add:function(t,e,n,r,i){var o,a,s,u,l,c,f,p,d,h,g,v=Y.get(t);if(V(t)){n.handler&&(n=(o=n).handler,i=o.selector),i&&S.find.matchesSelector(re,i),n.guid||(n.guid=S.guid++),(u=v.events)||(u=v.events=Object.create(null)),(a=v.handle)||(a=v.handle=function(e){return"undefined"!=typeof S&&S.event.triggered!==e.type?S.event.dispatch.apply(t,arguments):void 0}),l=(e=(e||"").match(P)||[""]).length;while(l--)d=g=(s=be.exec(e[l])||[])[1],h=(s[2]||"").split(".").sort(),d&&(f=S.event.special[d]||{},d=(i?f.delegateType:f.bindType)||d,f=S.event.special[d]||{},c=S.extend({type:d,origType:g,data:r,handler:n,guid:n.guid,selector:i,needsContext:i&&S.expr.match.needsContext.test(i),namespace:h.join(".")},o),(p=u[d])||((p=u[d]=[]).delegateCount=0,f.setup&&!1!==f.setup.call(t,r,h,a)||t.addEventListener&&t.addEventListener(d,a)),f.add&&(f.add.call(t,c),c.handler.guid||(c.handler.guid=n.guid)),i?p.splice(p.delegateCount++,0,c):p.push(c),S.event.global[d]=!0)}},remove:function(e,t,n,r,i){var o,a,s,u,l,c,f,p,d,h,g,v=Y.hasData(e)&&Y.get(e);if(v&&(u=v.events)){l=(t=(t||"").match(P)||[""]).length;while(l--)if(d=g=(s=be.exec(t[l])||[])[1],h=(s[2]||"").split(".").sort(),d){f=S.event.special[d]||{},p=u[d=(r?f.delegateType:f.bindType)||d]||[],s=s[2]&&new RegExp("(^|\\.)"+h.join("\\.(?:.*\\.|)")+"(\\.|$)"),a=o=p.length;while(o--)c=p[o],!i&&g!==c.origType||n&&n.guid!==c.guid||s&&!s.test(c.namespace)||r&&r!==c.selector&&("**"!==r||!c.selector)||(p.splice(o,1),c.selector&&p.delegateCount--,f.remove&&f.remove.call(e,c));a&&!p.length&&(f.teardown&&!1!==f.teardown.call(e,h,v.handle)||S.removeEvent(e,d,v.handle),delete u[d])}else for(d in u)S.event.remove(e,d+t[l],n,r,!0);S.isEmptyObject(u)&&Y.remove(e,"handle events")}},dispatch:function(e){var t,n,r,i,o,a,s=new Array(arguments.length),u=S.event.fix(e),l=(Y.get(this,"events")||Object.create(null))[u.type]||[],c=S.event.special[u.type]||{};for(s[0]=u,t=1;t<arguments.length;t++)s[t]=arguments[t];if(u.delegateTarget=this,!c.preDispatch||!1!==c.preDispatch.call(this,u)){a=S.event.handlers.call(this,u,l),t=0;while((i=a[t++])&&!u.isPropagationStopped()){u.currentTarget=i.elem,n=0;while((o=i.handlers[n++])&&!u.isImmediatePropagationStopped())u.rnamespace&&!1!==o.namespace&&!u.rnamespace.test(o.namespace)||(u.handleObj=o,u.data=o.data,void 0!==(r=((S.event.special[o.origType]||{}).handle||o.handler).apply(i.elem,s))&&!1===(u.result=r)&&(u.preventDefault(),u.stopPropagation()))}return c.postDispatch&&c.postDispatch.call(this,u),u.result}},handlers:function(e,t){var n,r,i,o,a,s=[],u=t.delegateCount,l=e.target;if(u&&l.nodeType&&!("click"===e.type&&1<=e.button))for(;l!==this;l=l.parentNode||this)if(1===l.nodeType&&("click"!==e.type||!0!==l.disabled)){for(o=[],a={},n=0;n<u;n++)void 0===a[i=(r=t[n]).selector+" "]&&(a[i]=r.needsContext?-1<S(i,this).index(l):S.find(i,this,null,[l]).length),a[i]&&o.push(r);o.length&&s.push({elem:l,handlers:o})}return l=this,u<t.length&&s.push({elem:l,handlers:t.slice(u)}),s},addProp:function(t,e){Object.defineProperty(S.Event.prototype,t,{enumerable:!0,configurable:!0,get:m(e)?function(){if(this.originalEvent)return e(this.originalEvent)}:function(){if(this.originalEvent)return this.originalEvent[t]},set:function(e){Object.defineProperty(this,t,{enumerable:!0,configurable:!0,writable:!0,value:e})}})},fix:function(e){return e[S.expando]?e:new S.Event(e)},special:{load:{noBubble:!0},click:{setup:function(e){var t=this||e;return pe.test(t.type)&&t.click&&A(t,"input")&&Se(t,"click",we),!1},trigger:function(e){var t=this||e;return pe.test(t.type)&&t.click&&A(t,"input")&&Se(t,"click"),!0},_default:function(e){var t=e.target;return pe.test(t.type)&&t.click&&A(t,"input")&&Y.get(t,"click")||A(t,"a")}},beforeunload:{postDispatch:function(e){void 0!==e.result&&e.originalEvent&&(e.originalEvent.returnValue=e.result)}}}},S.removeEvent=function(e,t,n){e.removeEventListener&&e.removeEventListener(t,n)},S.Event=function(e,t){if(!(this instanceof S.Event))return new S.Event(e,t);e&&e.type?(this.originalEvent=e,this.type=e.type,this.isDefaultPrevented=e.defaultPrevented||void 0===e.defaultPrevented&&!1===e.returnValue?we:Te,this.target=e.target&&3===e.target.nodeType?e.target.parentNode:e.target,this.currentTarget=e.currentTarget,this.relatedTarget=e.relatedTarget):this.type=e,t&&S.extend(this,t),this.timeStamp=e&&e.timeStamp||Date.now(),this[S.expando]=!0},S.Event.prototype={constructor:S.Event,isDefaultPrevented:Te,isPropagationStopped:Te,isImmediatePropagationStopped:Te,isSimulated:!1,preventDefault:function(){var e=this.originalEvent;this.isDefaultPrevented=we,e&&!this.isSimulated&&e.preventDefault()},stopPropagation:function(){var e=this.originalEvent;this.isPropagationStopped=we,e&&!this.isSimulated&&e.stopPropagation()},stopImmediatePropagation:function(){var e=this.originalEvent;this.isImmediatePropagationStopped=we,e&&!this.isSimulated&&e.stopImmediatePropagation(),this.stopPropagation()}},S.each({altKey:!0,bubbles:!0,cancelable:!0,changedTouches:!0,ctrlKey:!0,detail:!0,eventPhase:!0,metaKey:!0,pageX:!0,pageY:!0,shiftKey:!0,view:!0,"char":!0,code:!0,charCode:!0,key:!0,keyCode:!0,button:!0,buttons:!0,clientX:!0,clientY:!0,offsetX:!0,offsetY:!0,pointerId:!0,pointerType:!0,screenX:!0,screenY:!0,targetTouches:!0,toElement:!0,touches:!0,which:!0},S.event.addProp),S.each({focus:"focusin",blur:"focusout"},function(e,t){S.event.special[e]={setup:function(){return Se(this,e,Ce),!1},trigger:function(){return Se(this,e),!0},_default:function(){return!0},delegateType:t}}),S.each({mouseenter:"mouseover",mouseleave:"mouseout",pointerenter:"pointerover",pointerleave:"pointerout"},function(e,i){S.event.special[e]={delegateType:i,bindType:i,handle:function(e){var t,n=e.relatedTarget,r=e.handleObj;return n&&(n===this||S.contains(this,n))||(e.type=r.origType,t=r.handler.apply(this,arguments),e.type=i),t}}}),S.fn.extend({on:function(e,t,n,r){return Ee(this,e,t,n,r)},one:function(e,t,n,r){return Ee(this,e,t,n,r,1)},off:function(e,t,n){var r,i;if(e&&e.preventDefault&&e.handleObj)return r=e.handleObj,S(e.delegateTarget).off(r.namespace?r.origType+"."+r.namespace:r.origType,r.selector,r.handler),this;if("object"==typeof e){for(i in e)this.off(i,t,e[i]);return this}return!1!==t&&"function"!=typeof t||(n=t,t=void 0),!1===n&&(n=Te),this.each(function(){S.event.remove(this,e,n,t)})}});var ke=/<script|<style|<link/i,Ae=/checked\s*(?:[^=]|=\s*.checked.)/i,Ne=/^\s*<!(?:\[CDATA\[|--)|(?:\]\]|--)>\s*$/g;function je(e,t){return A(e,"table")&&A(11!==t.nodeType?t:t.firstChild,"tr")&&S(e).children("tbody")[0]||e}function De(e){return e.type=(null!==e.getAttribute("type"))+"/"+e.type,e}function qe(e){return"true/"===(e.type||"").slice(0,5)?e.type=e.type.slice(5):e.removeAttribute("type"),e}function Le(e,t){var n,r,i,o,a,s;if(1===t.nodeType){if(Y.hasData(e)&&(s=Y.get(e).events))for(i in Y.remove(t,"handle events"),s)for(n=0,r=s[i].length;n<r;n++)S.event.add(t,i,s[i][n]);Q.hasData(e)&&(o=Q.access(e),a=S.extend({},o),Q.set(t,a))}}function He(n,r,i,o){r=g(r);var e,t,a,s,u,l,c=0,f=n.length,p=f-1,d=r[0],h=m(d);if(h||1<f&&"string"==typeof d&&!y.checkClone&&Ae.test(d))return n.each(function(e){var t=n.eq(e);h&&(r[0]=d.call(this,e,t.html())),He(t,r,i,o)});if(f&&(t=(e=xe(r,n[0].ownerDocument,!1,n,o)).firstChild,1===e.childNodes.length&&(e=t),t||o)){for(s=(a=S.map(ve(e,"script"),De)).length;c<f;c++)u=e,c!==p&&(u=S.clone(u,!0,!0),s&&S.merge(a,ve(u,"script"))),i.call(n[c],u,c);if(s)for(l=a[a.length-1].ownerDocument,S.map(a,qe),c=0;c<s;c++)u=a[c],he.test(u.type||"")&&!Y.access(u,"globalEval")&&S.contains(l,u)&&(u.src&&"module"!==(u.type||"").toLowerCase()?S._evalUrl&&!u.noModule&&S._evalUrl(u.src,{nonce:u.nonce||u.getAttribute("nonce")},l):b(u.textContent.replace(Ne,""),u,l))}return n}function Oe(e,t,n){for(var r,i=t?S.filter(t,e):e,o=0;null!=(r=i[o]);o++)n||1!==r.nodeType||S.cleanData(ve(r)),r.parentNode&&(n&&ie(r)&&ye(ve(r,"script")),r.parentNode.removeChild(r));return e}S.extend({htmlPrefilter:function(e){return e},clone:function(e,t,n){var r,i,o,a,s,u,l,c=e.cloneNode(!0),f=ie(e);if(!(y.noCloneChecked||1!==e.nodeType&&11!==e.nodeType||S.isXMLDoc(e)))for(a=ve(c),r=0,i=(o=ve(e)).length;r<i;r++)s=o[r],u=a[r],void 0,"input"===(l=u.nodeName.toLowerCase())&&pe.test(s.type)?u.checked=s.checked:"input"!==l&&"textarea"!==l||(u.defaultValue=s.defaultValue);if(t)if(n)for(o=o||ve(e),a=a||ve(c),r=0,i=o.length;r<i;r++)Le(o[r],a[r]);else Le(e,c);return 0<(a=ve(c,"script")).length&&ye(a,!f&&ve(e,"script")),c},cleanData:function(e){for(var t,n,r,i=S.event.special,o=0;void 0!==(n=e[o]);o++)if(V(n)){if(t=n[Y.expando]){if(t.events)for(r in t.events)i[r]?S.event.remove(n,r):S.removeEvent(n,r,t.handle);n[Y.expando]=void 0}n[Q.expando]&&(n[Q.expando]=void 0)}}}),S.fn.extend({detach:function(e){return Oe(this,e,!0)},remove:function(e){return Oe(this,e)},text:function(e){return $(this,function(e){return void 0===e?S.text(this):this.empty().each(function(){1!==this.nodeType&&11!==this.nodeType&&9!==this.nodeType||(this.textContent=e)})},null,e,arguments.length)},append:function(){return He(this,arguments,function(e){1!==this.nodeType&&11!==this.nodeType&&9!==this.nodeType||je(this,e).appendChild(e)})},prepend:function(){return He(this,arguments,function(e){if(1===this.nodeType||11===this.nodeType||9===this.nodeType){var t=je(this,e);t.insertBefore(e,t.firstChild)}})},before:function(){return He(this,arguments,function(e){this.parentNode&&this.parentNode.insertBefore(e,this)})},after:function(){return He(this,arguments,function(e){this.parentNode&&this.parentNode.insertBefore(e,this.nextSibling)})},empty:function(){for(var e,t=0;null!=(e=this[t]);t++)1===e.nodeType&&(S.cleanData(ve(e,!1)),e.textContent="");return this},clone:function(e,t){return e=null!=e&&e,t=null==t?e:t,this.map(function(){return S.clone(this,e,t)})},html:function(e){return $(this,function(e){var t=this[0]||{},n=0,r=this.length;if(void 0===e&&1===t.nodeType)return t.innerHTML;if("string"==typeof e&&!ke.test(e)&&!ge[(de.exec(e)||["",""])[1].toLowerCase()]){e=S.htmlPrefilter(e);try{for(;n<r;n++)1===(t=this[n]||{}).nodeType&&(S.cleanData(ve(t,!1)),t.innerHTML=e);t=0}catch(e){}}t&&this.empty().append(e)},null,e,arguments.length)},replaceWith:function(){var n=[];return He(this,arguments,function(e){var t=this.parentNode;S.inArray(this,n)<0&&(S.cleanData(ve(this)),t&&t.replaceChild(e,this))},n)}}),S.each({appendTo:"append",prependTo:"prepend",insertBefore:"before",insertAfter:"after",replaceAll:"replaceWith"},function(e,a){S.fn[e]=function(e){for(var t,n=[],r=S(e),i=r.length-1,o=0;o<=i;o++)t=o===i?this:this.clone(!0),S(r[o])[a](t),u.apply(n,t.get());return this.pushStack(n)}});var Pe=new RegExp("^("+ee+")(?!px)[a-z%]+$","i"),Re=function(e){var t=e.ownerDocument.defaultView;return t&&t.opener||(t=C),t.getComputedStyle(e)},Me=function(e,t,n){var r,i,o={};for(i in t)o[i]=e.style[i],e.style[i]=t[i];for(i in r=n.call(e),t)e.style[i]=o[i];return r},Ie=new RegExp(ne.join("|"),"i");function We(e,t,n){var r,i,o,a,s=e.style;return(n=n||Re(e))&&(""!==(a=n.getPropertyValue(t)||n[t])||ie(e)||(a=S.style(e,t)),!y.pixelBoxStyles()&&Pe.test(a)&&Ie.test(t)&&(r=s.width,i=s.minWidth,o=s.maxWidth,s.minWidth=s.maxWidth=s.width=a,a=n.width,s.width=r,s.minWidth=i,s.maxWidth=o)),void 0!==a?a+"":a}function Fe(e,t){return{get:function(){if(!e())return(this.get=t).apply(this,arguments);delete this.get}}}!function(){function e(){if(l){u.style.cssText="position:absolute;left:-11111px;width:60px;margin-top:1px;padding:0;border:0",l.style.cssText="position:relative;display:block;box-sizing:border-box;overflow:scroll;margin:auto;border:1px;padding:1px;width:60%;top:1%",re.appendChild(u).appendChild(l);var e=C.getComputedStyle(l);n="1%"!==e.top,s=12===t(e.marginLeft),l.style.right="60%",o=36===t(e.right),r=36===t(e.width),l.style.position="absolute",i=12===t(l.offsetWidth/3),re.removeChild(u),l=null}}function t(e){return Math.round(parseFloat(e))}var n,r,i,o,a,s,u=E.createElement("div"),l=E.createElement("div");l.style&&(l.style.backgroundClip="content-box",l.cloneNode(!0).style.backgroundClip="",y.clearCloneStyle="content-box"===l.style.backgroundClip,S.extend(y,{boxSizingReliable:function(){return e(),r},pixelBoxStyles:function(){return e(),o},pixelPosition:function(){return e(),n},reliableMarginLeft:function(){return e(),s},scrollboxSize:function(){return e(),i},reliableTrDimensions:function(){var e,t,n,r;return null==a&&(e=E.createElement("table"),t=E.createElement("tr"),n=E.createElement("div"),e.style.cssText="position:absolute;left:-11111px;border-collapse:separate",t.style.cssText="border:1px solid",t.style.height="1px",n.style.height="9px",n.style.display="block",re.appendChild(e).appendChild(t).appendChild(n),r=C.getComputedStyle(t),a=parseInt(r.height,10)+parseInt(r.borderTopWidth,10)+parseInt(r.borderBottomWidth,10)===t.offsetHeight,re.removeChild(e)),a}}))}();var Be=["Webkit","Moz","ms"],$e=E.createElement("div").style,_e={};function ze(e){var t=S.cssProps[e]||_e[e];return t||(e in $e?e:_e[e]=function(e){var t=e[0].toUpperCase()+e.slice(1),n=Be.length;while(n--)if((e=Be[n]+t)in $e)return e}(e)||e)}var Ue=/^(none|table(?!-c[ea]).+)/,Xe=/^--/,Ve={position:"absolute",visibility:"hidden",display:"block"},Ge={letterSpacing:"0",fontWeight:"400"};function Ye(e,t,n){var r=te.exec(t);return r?Math.max(0,r[2]-(n||0))+(r[3]||"px"):t}function Qe(e,t,n,r,i,o){var a="width"===t?1:0,s=0,u=0;if(n===(r?"border":"content"))return 0;for(;a<4;a+=2)"margin"===n&&(u+=S.css(e,n+ne[a],!0,i)),r?("content"===n&&(u-=S.css(e,"padding"+ne[a],!0,i)),"margin"!==n&&(u-=S.css(e,"border"+ne[a]+"Width",!0,i))):(u+=S.css(e,"padding"+ne[a],!0,i),"padding"!==n?u+=S.css(e,"border"+ne[a]+"Width",!0,i):s+=S.css(e,"border"+ne[a]+"Width",!0,i));return!r&&0<=o&&(u+=Math.max(0,Math.ceil(e["offset"+t[0].toUpperCase()+t.slice(1)]-o-u-s-.5))||0),u}function Je(e,t,n){var r=Re(e),i=(!y.boxSizingReliable()||n)&&"border-box"===S.css(e,"boxSizing",!1,r),o=i,a=We(e,t,r),s="offset"+t[0].toUpperCase()+t.slice(1);if(Pe.test(a)){if(!n)return a;a="auto"}return(!y.boxSizingReliable()&&i||!y.reliableTrDimensions()&&A(e,"tr")||"auto"===a||!parseFloat(a)&&"inline"===S.css(e,"display",!1,r))&&e.getClientRects().length&&(i="border-box"===S.css(e,"boxSizing",!1,r),(o=s in e)&&(a=e[s])),(a=parseFloat(a)||0)+Qe(e,t,n||(i?"border":"content"),o,r,a)+"px"}function Ke(e,t,n,r,i){return new Ke.prototype.init(e,t,n,r,i)}S.extend({cssHooks:{opacity:{get:function(e,t){if(t){var n=We(e,"opacity");return""===n?"1":n}}}},cssNumber:{animationIterationCount:!0,columnCount:!0,fillOpacity:!0,flexGrow:!0,flexShrink:!0,fontWeight:!0,gridArea:!0,gridColumn:!0,gridColumnEnd:!0,gridColumnStart:!0,gridRow:!0,gridRowEnd:!0,gridRowStart:!0,lineHeight:!0,opacity:!0,order:!0,orphans:!0,widows:!0,zIndex:!0,zoom:!0},cssProps:{},style:function(e,t,n,r){if(e&&3!==e.nodeType&&8!==e.nodeType&&e.style){var i,o,a,s=X(t),u=Xe.test(t),l=e.style;if(u||(t=ze(s)),a=S.cssHooks[t]||S.cssHooks[s],void 0===n)return a&&"get"in a&&void 0!==(i=a.get(e,!1,r))?i:l[t];"string"===(o=typeof n)&&(i=te.exec(n))&&i[1]&&(n=se(e,t,i),o="number"),null!=n&&n==n&&("number"!==o||u||(n+=i&&i[3]||(S.cssNumber[s]?"":"px")),y.clearCloneStyle||""!==n||0!==t.indexOf("background")||(l[t]="inherit"),a&&"set"in a&&void 0===(n=a.set(e,n,r))||(u?l.setProperty(t,n):l[t]=n))}},css:function(e,t,n,r){var i,o,a,s=X(t);return Xe.test(t)||(t=ze(s)),(a=S.cssHooks[t]||S.cssHooks[s])&&"get"in a&&(i=a.get(e,!0,n)),void 0===i&&(i=We(e,t,r)),"normal"===i&&t in Ge&&(i=Ge[t]),""===n||n?(o=parseFloat(i),!0===n||isFinite(o)?o||0:i):i}}),S.each(["height","width"],function(e,u){S.cssHooks[u]={get:function(e,t,n){if(t)return!Ue.test(S.css(e,"display"))||e.getClientRects().length&&e.getBoundingClientRect().width?Je(e,u,n):Me(e,Ve,function(){return Je(e,u,n)})},set:function(e,t,n){var r,i=Re(e),o=!y.scrollboxSize()&&"absolute"===i.position,a=(o||n)&&"border-box"===S.css(e,"boxSizing",!1,i),s=n?Qe(e,u,n,a,i):0;return a&&o&&(s-=Math.ceil(e["offset"+u[0].toUpperCase()+u.slice(1)]-parseFloat(i[u])-Qe(e,u,"border",!1,i)-.5)),s&&(r=te.exec(t))&&"px"!==(r[3]||"px")&&(e.style[u]=t,t=S.css(e,u)),Ye(0,t,s)}}}),S.cssHooks.marginLeft=Fe(y.reliableMarginLeft,function(e,t){if(t)return(parseFloat(We(e,"marginLeft"))||e.getBoundingClientRect().left-Me(e,{marginLeft:0},function(){return e.getBoundingClientRect().left}))+"px"}),S.each({margin:"",padding:"",border:"Width"},function(i,o){S.cssHooks[i+o]={expand:function(e){for(var t=0,n={},r="string"==typeof e?e.split(" "):[e];t<4;t++)n[i+ne[t]+o]=r[t]||r[t-2]||r[0];return n}},"margin"!==i&&(S.cssHooks[i+o].set=Ye)}),S.fn.extend({css:function(e,t){return $(this,function(e,t,n){var r,i,o={},a=0;if(Array.isArray(t)){for(r=Re(e),i=t.length;a<i;a++)o[t[a]]=S.css(e,t[a],!1,r);return o}return void 0!==n?S.style(e,t,n):S.css(e,t)},e,t,1<arguments.length)}}),((S.Tween=Ke).prototype={constructor:Ke,init:function(e,t,n,r,i,o){this.elem=e,this.prop=n,this.easing=i||S.easing._default,this.options=t,this.start=this.now=this.cur(),this.end=r,this.unit=o||(S.cssNumber[n]?"":"px")},cur:function(){var e=Ke.propHooks[this.prop];return e&&e.get?e.get(this):Ke.propHooks._default.get(this)},run:function(e){var t,n=Ke.propHooks[this.prop];return this.options.duration?this.pos=t=S.easing[this.easing](e,this.options.duration*e,0,1,this.options.duration):this.pos=t=e,this.now=(this.end-this.start)*t+this.start,this.options.step&&this.options.step.call(this.elem,this.now,this),n&&n.set?n.set(this):Ke.propHooks._default.set(this),this}}).init.prototype=Ke.prototype,(Ke.propHooks={_default:{get:function(e){var t;return 1!==e.elem.nodeType||null!=e.elem[e.prop]&&null==e.elem.style[e.prop]?e.elem[e.prop]:(t=S.css(e.elem,e.prop,""))&&"auto"!==t?t:0},set:function(e){S.fx.step[e.prop]?S.fx.step[e.prop](e):1!==e.elem.nodeType||!S.cssHooks[e.prop]&&null==e.elem.style[ze(e.prop)]?e.elem[e.prop]=e.now:S.style(e.elem,e.prop,e.now+e.unit)}}}).scrollTop=Ke.propHooks.scrollLeft={set:function(e){e.elem.nodeType&&e.elem.parentNode&&(e.elem[e.prop]=e.now)}},S.easing={linear:function(e){return e},swing:function(e){return.5-Math.cos(e*Math.PI)/2},_default:"swing"},S.fx=Ke.prototype.init,S.fx.step={};var Ze,et,tt,nt,rt=/^(?:toggle|show|hide)$/,it=/queueHooks$/;function ot(){et&&(!1===E.hidden&&C.requestAnimationFrame?C.requestAnimationFrame(ot):C.setTimeout(ot,S.fx.interval),S.fx.tick())}function at(){return C.setTimeout(function(){Ze=void 0}),Ze=Date.now()}function st(e,t){var n,r=0,i={height:e};for(t=t?1:0;r<4;r+=2-t)i["margin"+(n=ne[r])]=i["padding"+n]=e;return t&&(i.opacity=i.width=e),i}function ut(e,t,n){for(var r,i=(lt.tweeners[t]||[]).concat(lt.tweeners["*"]),o=0,a=i.length;o<a;o++)if(r=i[o].call(n,t,e))return r}function lt(o,e,t){var n,a,r=0,i=lt.prefilters.length,s=S.Deferred().always(function(){delete u.elem}),u=function(){if(a)return!1;for(var e=Ze||at(),t=Math.max(0,l.startTime+l.duration-e),n=1-(t/l.duration||0),r=0,i=l.tweens.length;r<i;r++)l.tweens[r].run(n);return s.notifyWith(o,[l,n,t]),n<1&&i?t:(i||s.notifyWith(o,[l,1,0]),s.resolveWith(o,[l]),!1)},l=s.promise({elem:o,props:S.extend({},e),opts:S.extend(!0,{specialEasing:{},easing:S.easing._default},t),originalProperties:e,originalOptions:t,startTime:Ze||at(),duration:t.duration,tweens:[],createTween:function(e,t){var n=S.Tween(o,l.opts,e,t,l.opts.specialEasing[e]||l.opts.easing);return l.tweens.push(n),n},stop:function(e){var t=0,n=e?l.tweens.length:0;if(a)return this;for(a=!0;t<n;t++)l.tweens[t].run(1);return e?(s.notifyWith(o,[l,1,0]),s.resolveWith(o,[l,e])):s.rejectWith(o,[l,e]),this}}),c=l.props;for(!function(e,t){var n,r,i,o,a;for(n in e)if(i=t[r=X(n)],o=e[n],Array.isArray(o)&&(i=o[1],o=e[n]=o[0]),n!==r&&(e[r]=o,delete e[n]),(a=S.cssHooks[r])&&"expand"in a)for(n in o=a.expand(o),delete e[r],o)n in e||(e[n]=o[n],t[n]=i);else t[r]=i}(c,l.opts.specialEasing);r<i;r++)if(n=lt.prefilters[r].call(l,o,c,l.opts))return m(n.stop)&&(S._queueHooks(l.elem,l.opts.queue).stop=n.stop.bind(n)),n;return S.map(c,ut,l),m(l.opts.start)&&l.opts.start.call(o,l),l.progress(l.opts.progress).done(l.opts.done,l.opts.complete).fail(l.opts.fail).always(l.opts.always),S.fx.timer(S.extend(u,{elem:o,anim:l,queue:l.opts.queue})),l}S.Animation=S.extend(lt,{tweeners:{"*":[function(e,t){var n=this.createTween(e,t);return se(n.elem,e,te.exec(t),n),n}]},tweener:function(e,t){m(e)?(t=e,e=["*"]):e=e.match(P);for(var n,r=0,i=e.length;r<i;r++)n=e[r],lt.tweeners[n]=lt.tweeners[n]||[],lt.tweeners[n].unshift(t)},prefilters:[function(e,t,n){var r,i,o,a,s,u,l,c,f="width"in t||"height"in t,p=this,d={},h=e.style,g=e.nodeType&&ae(e),v=Y.get(e,"fxshow");for(r in n.queue||(null==(a=S._queueHooks(e,"fx")).unqueued&&(a.unqueued=0,s=a.empty.fire,a.empty.fire=function(){a.unqueued||s()}),a.unqueued++,p.always(function(){p.always(function(){a.unqueued--,S.queue(e,"fx").length||a.empty.fire()})})),t)if(i=t[r],rt.test(i)){if(delete t[r],o=o||"toggle"===i,i===(g?"hide":"show")){if("show"!==i||!v||void 0===v[r])continue;g=!0}d[r]=v&&v[r]||S.style(e,r)}if((u=!S.isEmptyObject(t))||!S.isEmptyObject(d))for(r in f&&1===e.nodeType&&(n.overflow=[h.overflow,h.overflowX,h.overflowY],null==(l=v&&v.display)&&(l=Y.get(e,"display")),"none"===(c=S.css(e,"display"))&&(l?c=l:(le([e],!0),l=e.style.display||l,c=S.css(e,"display"),le([e]))),("inline"===c||"inline-block"===c&&null!=l)&&"none"===S.css(e,"float")&&(u||(p.done(function(){h.display=l}),null==l&&(c=h.display,l="none"===c?"":c)),h.display="inline-block")),n.overflow&&(h.overflow="hidden",p.always(function(){h.overflow=n.overflow[0],h.overflowX=n.overflow[1],h.overflowY=n.overflow[2]})),u=!1,d)u||(v?"hidden"in v&&(g=v.hidden):v=Y.access(e,"fxshow",{display:l}),o&&(v.hidden=!g),g&&le([e],!0),p.done(function(){for(r in g||le([e]),Y.remove(e,"fxshow"),d)S.style(e,r,d[r])})),u=ut(g?v[r]:0,r,p),r in v||(v[r]=u.start,g&&(u.end=u.start,u.start=0))}],prefilter:function(e,t){t?lt.prefilters.unshift(e):lt.prefilters.push(e)}}),S.speed=function(e,t,n){var r=e&&"object"==typeof e?S.extend({},e):{complete:n||!n&&t||m(e)&&e,duration:e,easing:n&&t||t&&!m(t)&&t};return S.fx.off?r.duration=0:"number"!=typeof r.duration&&(r.duration in S.fx.speeds?r.duration=S.fx.speeds[r.duration]:r.duration=S.fx.speeds._default),null!=r.queue&&!0!==r.queue||(r.queue="fx"),r.old=r.complete,r.complete=function(){m(r.old)&&r.old.call(this),r.queue&&S.dequeue(this,r.queue)},r},S.fn.extend({fadeTo:function(e,t,n,r){return this.filter(ae).css("opacity",0).show().end().animate({opacity:t},e,n,r)},animate:function(t,e,n,r){var i=S.isEmptyObject(t),o=S.speed(e,n,r),a=function(){var e=lt(this,S.extend({},t),o);(i||Y.get(this,"finish"))&&e.stop(!0)};return a.finish=a,i||!1===o.queue?this.each(a):this.queue(o.queue,a)},stop:function(i,e,o){var a=function(e){var t=e.stop;delete e.stop,t(o)};return"string"!=typeof i&&(o=e,e=i,i=void 0),e&&this.queue(i||"fx",[]),this.each(function(){var e=!0,t=null!=i&&i+"queueHooks",n=S.timers,r=Y.get(this);if(t)r[t]&&r[t].stop&&a(r[t]);else for(t in r)r[t]&&r[t].stop&&it.test(t)&&a(r[t]);for(t=n.length;t--;)n[t].elem!==this||null!=i&&n[t].queue!==i||(n[t].anim.stop(o),e=!1,n.splice(t,1));!e&&o||S.dequeue(this,i)})},finish:function(a){return!1!==a&&(a=a||"fx"),this.each(function(){var e,t=Y.get(this),n=t[a+"queue"],r=t[a+"queueHooks"],i=S.timers,o=n?n.length:0;for(t.finish=!0,S.queue(this,a,[]),r&&r.stop&&r.stop.call(this,!0),e=i.length;e--;)i[e].elem===this&&i[e].queue===a&&(i[e].anim.stop(!0),i.splice(e,1));for(e=0;e<o;e++)n[e]&&n[e].finish&&n[e].finish.call(this);delete t.finish})}}),S.each(["toggle","show","hide"],function(e,r){var i=S.fn[r];S.fn[r]=function(e,t,n){return null==e||"boolean"==typeof e?i.apply(this,arguments):this.animate(st(r,!0),e,t,n)}}),S.each({slideDown:st("show"),slideUp:st("hide"),slideToggle:st("toggle"),fadeIn:{opacity:"show"},fadeOut:{opacity:"hide"},fadeToggle:{opacity:"toggle"}},function(e,r){S.fn[e]=function(e,t,n){return this.animate(r,e,t,n)}}),S.timers=[],S.fx.tick=function(){var e,t=0,n=S.timers;for(Ze=Date.now();t<n.length;t++)(e=n[t])()||n[t]!==e||n.splice(t--,1);n.length||S.fx.stop(),Ze=void 0},S.fx.timer=function(e){S.timers.push(e),S.fx.start()},S.fx.interval=13,S.fx.start=function(){et||(et=!0,ot())},S.fx.stop=function(){et=null},S.fx.speeds={slow:600,fast:200,_default:400},S.fn.delay=function(r,e){return r=S.fx&&S.fx.speeds[r]||r,e=e||"fx",this.queue(e,function(e,t){var n=C.setTimeout(e,r);t.stop=function(){C.clearTimeout(n)}})},tt=E.createElement("input"),nt=E.createElement("select").appendChild(E.createElement("option")),tt.type="checkbox",y.checkOn=""!==tt.value,y.optSelected=nt.selected,(tt=E.createElement("input")).value="t",tt.type="radio",y.radioValue="t"===tt.value;var ct,ft=S.expr.attrHandle;S.fn.extend({attr:function(e,t){return $(this,S.attr,e,t,1<arguments.length)},removeAttr:function(e){return this.each(function(){S.removeAttr(this,e)})}}),S.extend({attr:function(e,t,n){var r,i,o=e.nodeType;if(3!==o&&8!==o&&2!==o)return"undefined"==typeof e.getAttribute?S.prop(e,t,n):(1===o&&S.isXMLDoc(e)||(i=S.attrHooks[t.toLowerCase()]||(S.expr.match.bool.test(t)?ct:void 0)),void 0!==n?null===n?void S.removeAttr(e,t):i&&"set"in i&&void 0!==(r=i.set(e,n,t))?r:(e.setAttribute(t,n+""),n):i&&"get"in i&&null!==(r=i.get(e,t))?r:null==(r=S.find.attr(e,t))?void 0:r)},attrHooks:{type:{set:function(e,t){if(!y.radioValue&&"radio"===t&&A(e,"input")){var n=e.value;return e.setAttribute("type",t),n&&(e.value=n),t}}}},removeAttr:function(e,t){var n,r=0,i=t&&t.match(P);if(i&&1===e.nodeType)while(n=i[r++])e.removeAttribute(n)}}),ct={set:function(e,t,n){return!1===t?S.removeAttr(e,n):e.setAttribute(n,n),n}},S.each(S.expr.match.bool.source.match(/\w+/g),function(e,t){var a=ft[t]||S.find.attr;ft[t]=function(e,t,n){var r,i,o=t.toLowerCase();return n||(i=ft[o],ft[o]=r,r=null!=a(e,t,n)?o:null,ft[o]=i),r}});var pt=/^(?:input|select|textarea|button)$/i,dt=/^(?:a|area)$/i;function ht(e){return(e.match(P)||[]).join(" ")}function gt(e){return e.getAttribute&&e.getAttribute("class")||""}function vt(e){return Array.isArray(e)?e:"string"==typeof e&&e.match(P)||[]}S.fn.extend({prop:function(e,t){return $(this,S.prop,e,t,1<arguments.length)},removeProp:function(e){return this.each(function(){delete this[S.propFix[e]||e]})}}),S.extend({prop:function(e,t,n){var r,i,o=e.nodeType;if(3!==o&&8!==o&&2!==o)return 1===o&&S.isXMLDoc(e)||(t=S.propFix[t]||t,i=S.propHooks[t]),void 0!==n?i&&"set"in i&&void 0!==(r=i.set(e,n,t))?r:e[t]=n:i&&"get"in i&&null!==(r=i.get(e,t))?r:e[t]},propHooks:{tabIndex:{get:function(e){var t=S.find.attr(e,"tabindex");return t?parseInt(t,10):pt.test(e.nodeName)||dt.test(e.nodeName)&&e.href?0:-1}}},propFix:{"for":"htmlFor","class":"className"}}),y.optSelected||(S.propHooks.selected={get:function(e){var t=e.parentNode;return t&&t.parentNode&&t.parentNode.selectedIndex,null},set:function(e){var t=e.parentNode;t&&(t.selectedIndex,t.parentNode&&t.parentNode.selectedIndex)}}),S.each(["tabIndex","readOnly","maxLength","cellSpacing","cellPadding","rowSpan","colSpan","useMap","frameBorder","contentEditable"],function(){S.propFix[this.toLowerCase()]=this}),S.fn.extend({addClass:function(t){var e,n,r,i,o,a,s,u=0;if(m(t))return this.each(function(e){S(this).addClass(t.call(this,e,gt(this)))});if((e=vt(t)).length)while(n=this[u++])if(i=gt(n),r=1===n.nodeType&&" "+ht(i)+" "){a=0;while(o=e[a++])r.indexOf(" "+o+" ")<0&&(r+=o+" ");i!==(s=ht(r))&&n.setAttribute("class",s)}return this},removeClass:function(t){var e,n,r,i,o,a,s,u=0;if(m(t))return this.each(function(e){S(this).removeClass(t.call(this,e,gt(this)))});if(!arguments.length)return this.attr("class","");if((e=vt(t)).length)while(n=this[u++])if(i=gt(n),r=1===n.nodeType&&" "+ht(i)+" "){a=0;while(o=e[a++])while(-1<r.indexOf(" "+o+" "))r=r.replace(" "+o+" "," ");i!==(s=ht(r))&&n.setAttribute("class",s)}return this},toggleClass:function(i,t){var o=typeof i,a="string"===o||Array.isArray(i);return"boolean"==typeof t&&a?t?this.addClass(i):this.removeClass(i):m(i)?this.each(function(e){S(this).toggleClass(i.call(this,e,gt(this),t),t)}):this.each(function(){var e,t,n,r;if(a){t=0,n=S(this),r=vt(i);while(e=r[t++])n.hasClass(e)?n.removeClass(e):n.addClass(e)}else void 0!==i&&"boolean"!==o||((e=gt(this))&&Y.set(this,"__className__",e),this.setAttribute&&this.setAttribute("class",e||!1===i?"":Y.get(this,"__className__")||""))})},hasClass:function(e){var t,n,r=0;t=" "+e+" ";while(n=this[r++])if(1===n.nodeType&&-1<(" "+ht(gt(n))+" ").indexOf(t))return!0;return!1}});var yt=/\r/g;S.fn.extend({val:function(n){var r,e,i,t=this[0];return arguments.length?(i=m(n),this.each(function(e){var t;1===this.nodeType&&(null==(t=i?n.call(this,e,S(this).val()):n)?t="":"number"==typeof t?t+="":Array.isArray(t)&&(t=S.map(t,function(e){return null==e?"":e+""})),(r=S.valHooks[this.type]||S.valHooks[this.nodeName.toLowerCase()])&&"set"in r&&void 0!==r.set(this,t,"value")||(this.value=t))})):t?(r=S.valHooks[t.type]||S.valHooks[t.nodeName.toLowerCase()])&&"get"in r&&void 0!==(e=r.get(t,"value"))?e:"string"==typeof(e=t.value)?e.replace(yt,""):null==e?"":e:void 0}}),S.extend({valHooks:{option:{get:function(e){var t=S.find.attr(e,"value");return null!=t?t:ht(S.text(e))}},select:{get:function(e){var t,n,r,i=e.options,o=e.selectedIndex,a="select-one"===e.type,s=a?null:[],u=a?o+1:i.length;for(r=o<0?u:a?o:0;r<u;r++)if(((n=i[r]).selected||r===o)&&!n.disabled&&(!n.parentNode.disabled||!A(n.parentNode,"optgroup"))){if(t=S(n).val(),a)return t;s.push(t)}return s},set:function(e,t){var n,r,i=e.options,o=S.makeArray(t),a=i.length;while(a--)((r=i[a]).selected=-1<S.inArray(S.valHooks.option.get(r),o))&&(n=!0);return n||(e.selectedIndex=-1),o}}}}),S.each(["radio","checkbox"],function(){S.valHooks[this]={set:function(e,t){if(Array.isArray(t))return e.checked=-1<S.inArray(S(e).val(),t)}},y.checkOn||(S.valHooks[this].get=function(e){return null===e.getAttribute("value")?"on":e.value})}),y.focusin="onfocusin"in C;var mt=/^(?:focusinfocus|focusoutblur)$/,xt=function(e){e.stopPropagation()};S.extend(S.event,{trigger:function(e,t,n,r){var i,o,a,s,u,l,c,f,p=[n||E],d=v.call(e,"type")?e.type:e,h=v.call(e,"namespace")?e.namespace.split("."):[];if(o=f=a=n=n||E,3!==n.nodeType&&8!==n.nodeType&&!mt.test(d+S.event.triggered)&&(-1<d.indexOf(".")&&(d=(h=d.split(".")).shift(),h.sort()),u=d.indexOf(":")<0&&"on"+d,(e=e[S.expando]?e:new S.Event(d,"object"==typeof e&&e)).isTrigger=r?2:3,e.namespace=h.join("."),e.rnamespace=e.namespace?new RegExp("(^|\\.)"+h.join("\\.(?:.*\\.|)")+"(\\.|$)"):null,e.result=void 0,e.target||(e.target=n),t=null==t?[e]:S.makeArray(t,[e]),c=S.event.special[d]||{},r||!c.trigger||!1!==c.trigger.apply(n,t))){if(!r&&!c.noBubble&&!x(n)){for(s=c.delegateType||d,mt.test(s+d)||(o=o.parentNode);o;o=o.parentNode)p.push(o),a=o;a===(n.ownerDocument||E)&&p.push(a.defaultView||a.parentWindow||C)}i=0;while((o=p[i++])&&!e.isPropagationStopped())f=o,e.type=1<i?s:c.bindType||d,(l=(Y.get(o,"events")||Object.create(null))[e.type]&&Y.get(o,"handle"))&&l.apply(o,t),(l=u&&o[u])&&l.apply&&V(o)&&(e.result=l.apply(o,t),!1===e.result&&e.preventDefault());return e.type=d,r||e.isDefaultPrevented()||c._default&&!1!==c._default.apply(p.pop(),t)||!V(n)||u&&m(n[d])&&!x(n)&&((a=n[u])&&(n[u]=null),S.event.triggered=d,e.isPropagationStopped()&&f.addEventListener(d,xt),n[d](),e.isPropagationStopped()&&f.removeEventListener(d,xt),S.event.triggered=void 0,a&&(n[u]=a)),e.result}},simulate:function(e,t,n){var r=S.extend(new S.Event,n,{type:e,isSimulated:!0});S.event.trigger(r,null,t)}}),S.fn.extend({trigger:function(e,t){return this.each(function(){S.event.trigger(e,t,this)})},triggerHandler:function(e,t){var n=this[0];if(n)return S.event.trigger(e,t,n,!0)}}),y.focusin||S.each({focus:"focusin",blur:"focusout"},function(n,r){var i=function(e){S.event.simulate(r,e.target,S.event.fix(e))};S.event.special[r]={setup:function(){var e=this.ownerDocument||this.document||this,t=Y.access(e,r);t||e.addEventListener(n,i,!0),Y.access(e,r,(t||0)+1)},teardown:function(){var e=this.ownerDocument||this.document||this,t=Y.access(e,r)-1;t?Y.access(e,r,t):(e.removeEventListener(n,i,!0),Y.remove(e,r))}}});var bt=C.location,wt={guid:Date.now()},Tt=/\?/;S.parseXML=function(e){var t,n;if(!e||"string"!=typeof e)return null;try{t=(new C.DOMParser).parseFromString(e,"text/xml")}catch(e){}return n=t&&t.getElementsByTagName("parsererror")[0],t&&!n||S.error("Invalid XML: "+(n?S.map(n.childNodes,function(e){return e.textContent}).join("\n"):e)),t};var Ct=/\[\]$/,Et=/\r?\n/g,St=/^(?:submit|button|image|reset|file)$/i,kt=/^(?:input|select|textarea|keygen)/i;function At(n,e,r,i){var t;if(Array.isArray(e))S.each(e,function(e,t){r||Ct.test(n)?i(n,t):At(n+"["+("object"==typeof t&&null!=t?e:"")+"]",t,r,i)});else if(r||"object"!==w(e))i(n,e);else for(t in e)At(n+"["+t+"]",e[t],r,i)}S.param=function(e,t){var n,r=[],i=function(e,t){var n=m(t)?t():t;r[r.length]=encodeURIComponent(e)+"="+encodeURIComponent(null==n?"":n)};if(null==e)return"";if(Array.isArray(e)||e.jquery&&!S.isPlainObject(e))S.each(e,function(){i(this.name,this.value)});else for(n in e)At(n,e[n],t,i);return r.join("&")},S.fn.extend({serialize:function(){return S.param(this.serializeArray())},serializeArray:function(){return this.map(function(){var e=S.prop(this,"elements");return e?S.makeArray(e):this}).filter(function(){var e=this.type;return this.name&&!S(this).is(":disabled")&&kt.test(this.nodeName)&&!St.test(e)&&(this.checked||!pe.test(e))}).map(function(e,t){var n=S(this).val();return null==n?null:Array.isArray(n)?S.map(n,function(e){return{name:t.name,value:e.replace(Et,"\r\n")}}):{name:t.name,value:n.replace(Et,"\r\n")}}).get()}});var Nt=/%20/g,jt=/#.*$/,Dt=/([?&])_=[^&]*/,qt=/^(.*?):[ \t]*([^\r\n]*)$/gm,Lt=/^(?:GET|HEAD)$/,Ht=/^\/\//,Ot={},Pt={},Rt="*/".concat("*"),Mt=E.createElement("a");function It(o){return function(e,t){"string"!=typeof e&&(t=e,e="*");var n,r=0,i=e.toLowerCase().match(P)||[];if(m(t))while(n=i[r++])"+"===n[0]?(n=n.slice(1)||"*",(o[n]=o[n]||[]).unshift(t)):(o[n]=o[n]||[]).push(t)}}function Wt(t,i,o,a){var s={},u=t===Pt;function l(e){var r;return s[e]=!0,S.each(t[e]||[],function(e,t){var n=t(i,o,a);return"string"!=typeof n||u||s[n]?u?!(r=n):void 0:(i.dataTypes.unshift(n),l(n),!1)}),r}return l(i.dataTypes[0])||!s["*"]&&l("*")}function Ft(e,t){var n,r,i=S.ajaxSettings.flatOptions||{};for(n in t)void 0!==t[n]&&((i[n]?e:r||(r={}))[n]=t[n]);return r&&S.extend(!0,e,r),e}Mt.href=bt.href,S.extend({active:0,lastModified:{},etag:{},ajaxSettings:{url:bt.href,type:"GET",isLocal:/^(?:about|app|app-storage|.+-extension|file|res|widget):$/.test(bt.protocol),global:!0,processData:!0,async:!0,contentType:"application/x-www-form-urlencoded; charset=UTF-8",accepts:{"*":Rt,text:"text/plain",html:"text/html",xml:"application/xml, text/xml",json:"application/json, text/javascript"},contents:{xml:/\bxml\b/,html:/\bhtml/,json:/\bjson\b/},responseFields:{xml:"responseXML",text:"responseText",json:"responseJSON"},converters:{"* text":String,"text html":!0,"text json":JSON.parse,"text xml":S.parseXML},flatOptions:{url:!0,context:!0}},ajaxSetup:function(e,t){return t?Ft(Ft(e,S.ajaxSettings),t):Ft(S.ajaxSettings,e)},ajaxPrefilter:It(Ot),ajaxTransport:It(Pt),ajax:function(e,t){"object"==typeof e&&(t=e,e=void 0),t=t||{};var c,f,p,n,d,r,h,g,i,o,v=S.ajaxSetup({},t),y=v.context||v,m=v.context&&(y.nodeType||y.jquery)?S(y):S.event,x=S.Deferred(),b=S.Callbacks("once memory"),w=v.statusCode||{},a={},s={},u="canceled",T={readyState:0,getResponseHeader:function(e){var t;if(h){if(!n){n={};while(t=qt.exec(p))n[t[1].toLowerCase()+" "]=(n[t[1].toLowerCase()+" "]||[]).concat(t[2])}t=n[e.toLowerCase()+" "]}return null==t?null:t.join(", ")},getAllResponseHeaders:function(){return h?p:null},setRequestHeader:function(e,t){return null==h&&(e=s[e.toLowerCase()]=s[e.toLowerCase()]||e,a[e]=t),this},overrideMimeType:function(e){return null==h&&(v.mimeType=e),this},statusCode:function(e){var t;if(e)if(h)T.always(e[T.status]);else for(t in e)w[t]=[w[t],e[t]];return this},abort:function(e){var t=e||u;return c&&c.abort(t),l(0,t),this}};if(x.promise(T),v.url=((e||v.url||bt.href)+"").replace(Ht,bt.protocol+"//"),v.type=t.method||t.type||v.method||v.type,v.dataTypes=(v.dataType||"*").toLowerCase().match(P)||[""],null==v.crossDomain){r=E.createElement("a");try{r.href=v.url,r.href=r.href,v.crossDomain=Mt.protocol+"//"+Mt.host!=r.protocol+"//"+r.host}catch(e){v.crossDomain=!0}}if(v.data&&v.processData&&"string"!=typeof v.data&&(v.data=S.param(v.data,v.traditional)),Wt(Ot,v,t,T),h)return T;for(i in(g=S.event&&v.global)&&0==S.active++&&S.event.trigger("ajaxStart"),v.type=v.type.toUpperCase(),v.hasContent=!Lt.test(v.type),f=v.url.replace(jt,""),v.hasContent?v.data&&v.processData&&0===(v.contentType||"").indexOf("application/x-www-form-urlencoded")&&(v.data=v.data.replace(Nt,"+")):(o=v.url.slice(f.length),v.data&&(v.processData||"string"==typeof v.data)&&(f+=(Tt.test(f)?"&":"?")+v.data,delete v.data),!1===v.cache&&(f=f.replace(Dt,"$1"),o=(Tt.test(f)?"&":"?")+"_="+wt.guid+++o),v.url=f+o),v.ifModified&&(S.lastModified[f]&&T.setRequestHeader("If-Modified-Since",S.lastModified[f]),S.etag[f]&&T.setRequestHeader("If-None-Match",S.etag[f])),(v.data&&v.hasContent&&!1!==v.contentType||t.contentType)&&T.setRequestHeader("Content-Type",v.contentType),T.setRequestHeader("Accept",v.dataTypes[0]&&v.accepts[v.dataTypes[0]]?v.accepts[v.dataTypes[0]]+("*"!==v.dataTypes[0]?", "+Rt+"; q=0.01":""):v.accepts["*"]),v.headers)T.setRequestHeader(i,v.headers[i]);if(v.beforeSend&&(!1===v.beforeSend.call(y,T,v)||h))return T.abort();if(u="abort",b.add(v.complete),T.done(v.success),T.fail(v.error),c=Wt(Pt,v,t,T)){if(T.readyState=1,g&&m.trigger("ajaxSend",[T,v]),h)return T;v.async&&0<v.timeout&&(d=C.setTimeout(function(){T.abort("timeout")},v.timeout));try{h=!1,c.send(a,l)}catch(e){if(h)throw e;l(-1,e)}}else l(-1,"No Transport");function l(e,t,n,r){var i,o,a,s,u,l=t;h||(h=!0,d&&C.clearTimeout(d),c=void 0,p=r||"",T.readyState=0<e?4:0,i=200<=e&&e<300||304===e,n&&(s=function(e,t,n){var r,i,o,a,s=e.contents,u=e.dataTypes;while("*"===u[0])u.shift(),void 0===r&&(r=e.mimeType||t.getResponseHeader("Content-Type"));if(r)for(i in s)if(s[i]&&s[i].test(r)){u.unshift(i);break}if(u[0]in n)o=u[0];else{for(i in n){if(!u[0]||e.converters[i+" "+u[0]]){o=i;break}a||(a=i)}o=o||a}if(o)return o!==u[0]&&u.unshift(o),n[o]}(v,T,n)),!i&&-1<S.inArray("script",v.dataTypes)&&S.inArray("json",v.dataTypes)<0&&(v.converters["text script"]=function(){}),s=function(e,t,n,r){var i,o,a,s,u,l={},c=e.dataTypes.slice();if(c[1])for(a in e.converters)l[a.toLowerCase()]=e.converters[a];o=c.shift();while(o)if(e.responseFields[o]&&(n[e.responseFields[o]]=t),!u&&r&&e.dataFilter&&(t=e.dataFilter(t,e.dataType)),u=o,o=c.shift())if("*"===o)o=u;else if("*"!==u&&u!==o){if(!(a=l[u+" "+o]||l["* "+o]))for(i in l)if((s=i.split(" "))[1]===o&&(a=l[u+" "+s[0]]||l["* "+s[0]])){!0===a?a=l[i]:!0!==l[i]&&(o=s[0],c.unshift(s[1]));break}if(!0!==a)if(a&&e["throws"])t=a(t);else try{t=a(t)}catch(e){return{state:"parsererror",error:a?e:"No conversion from "+u+" to "+o}}}return{state:"success",data:t}}(v,s,T,i),i?(v.ifModified&&((u=T.getResponseHeader("Last-Modified"))&&(S.lastModified[f]=u),(u=T.getResponseHeader("etag"))&&(S.etag[f]=u)),204===e||"HEAD"===v.type?l="nocontent":304===e?l="notmodified":(l=s.state,o=s.data,i=!(a=s.error))):(a=l,!e&&l||(l="error",e<0&&(e=0))),T.status=e,T.statusText=(t||l)+"",i?x.resolveWith(y,[o,l,T]):x.rejectWith(y,[T,l,a]),T.statusCode(w),w=void 0,g&&m.trigger(i?"ajaxSuccess":"ajaxError",[T,v,i?o:a]),b.fireWith(y,[T,l]),g&&(m.trigger("ajaxComplete",[T,v]),--S.active||S.event.trigger("ajaxStop")))}return T},getJSON:function(e,t,n){return S.get(e,t,n,"json")},getScript:function(e,t){return S.get(e,void 0,t,"script")}}),S.each(["get","post"],function(e,i){S[i]=function(e,t,n,r){return m(t)&&(r=r||n,n=t,t=void 0),S.ajax(S.extend({url:e,type:i,dataType:r,data:t,success:n},S.isPlainObject(e)&&e))}}),S.ajaxPrefilter(function(e){var t;for(t in e.headers)"content-type"===t.toLowerCase()&&(e.contentType=e.headers[t]||"")}),S._evalUrl=function(e,t,n){return S.ajax({url:e,type:"GET",dataType:"script",cache:!0,async:!1,global:!1,converters:{"text script":function(){}},dataFilter:function(e){S.globalEval(e,t,n)}})},S.fn.extend({wrapAll:function(e){var t;return this[0]&&(m(e)&&(e=e.call(this[0])),t=S(e,this[0].ownerDocument).eq(0).clone(!0),this[0].parentNode&&t.insertBefore(this[0]),t.map(function(){var e=this;while(e.firstElementChild)e=e.firstElementChild;return e}).append(this)),this},wrapInner:function(n){return m(n)?this.each(function(e){S(this).wrapInner(n.call(this,e))}):this.each(function(){var e=S(this),t=e.contents();t.length?t.wrapAll(n):e.append(n)})},wrap:function(t){var n=m(t);return this.each(function(e){S(this).wrapAll(n?t.call(this,e):t)})},unwrap:function(e){return this.parent(e).not("body").each(function(){S(this).replaceWith(this.childNodes)}),this}}),S.expr.pseudos.hidden=function(e){return!S.expr.pseudos.visible(e)},S.expr.pseudos.visible=function(e){return!!(e.offsetWidth||e.offsetHeight||e.getClientRects().length)},S.ajaxSettings.xhr=function(){try{return new C.XMLHttpRequest}catch(e){}};var Bt={0:200,1223:204},$t=S.ajaxSettings.xhr();y.cors=!!$t&&"withCredentials"in $t,y.ajax=$t=!!$t,S.ajaxTransport(function(i){var o,a;if(y.cors||$t&&!i.crossDomain)return{send:function(e,t){var n,r=i.xhr();if(r.open(i.type,i.url,i.async,i.username,i.password),i.xhrFields)for(n in i.xhrFields)r[n]=i.xhrFields[n];for(n in i.mimeType&&r.overrideMimeType&&r.overrideMimeType(i.mimeType),i.crossDomain||e["X-Requested-With"]||(e["X-Requested-With"]="XMLHttpRequest"),e)r.setRequestHeader(n,e[n]);o=function(e){return function(){o&&(o=a=r.onload=r.onerror=r.onabort=r.ontimeout=r.onreadystatechange=null,"abort"===e?r.abort():"error"===e?"number"!=typeof r.status?t(0,"error"):t(r.status,r.statusText):t(Bt[r.status]||r.status,r.statusText,"text"!==(r.responseType||"text")||"string"!=typeof r.responseText?{binary:r.response}:{text:r.responseText},r.getAllResponseHeaders()))}},r.onload=o(),a=r.onerror=r.ontimeout=o("error"),void 0!==r.onabort?r.onabort=a:r.onreadystatechange=function(){4===r.readyState&&C.setTimeout(function(){o&&a()})},o=o("abort");try{r.send(i.hasContent&&i.data||null)}catch(e){if(o)throw e}},abort:function(){o&&o()}}}),S.ajaxPrefilter(function(e){e.crossDomain&&(e.contents.script=!1)}),S.ajaxSetup({accepts:{script:"text/javascript, application/javascript, application/ecmascript, application/x-ecmascript"},contents:{script:/\b(?:java|ecma)script\b/},converters:{"text script":function(e){return S.globalEval(e),e}}}),S.ajaxPrefilter("script",function(e){void 0===e.cache&&(e.cache=!1),e.crossDomain&&(e.type="GET")}),S.ajaxTransport("script",function(n){var r,i;if(n.crossDomain||n.scriptAttrs)return{send:function(e,t){r=S("<script>").attr(n.scriptAttrs||{}).prop({charset:n.scriptCharset,src:n.url}).on("load error",i=function(e){r.remove(),i=null,e&&t("error"===e.type?404:200,e.type)}),E.head.appendChild(r[0])},abort:function(){i&&i()}}});var _t,zt=[],Ut=/(=)\?(?=&|$)|\?\?/;S.ajaxSetup({jsonp:"callback",jsonpCallback:function(){var e=zt.pop()||S.expando+"_"+wt.guid++;return this[e]=!0,e}}),S.ajaxPrefilter("json jsonp",function(e,t,n){var r,i,o,a=!1!==e.jsonp&&(Ut.test(e.url)?"url":"string"==typeof e.data&&0===(e.contentType||"").indexOf("application/x-www-form-urlencoded")&&Ut.test(e.data)&&"data");if(a||"jsonp"===e.dataTypes[0])return r=e.jsonpCallback=m(e.jsonpCallback)?e.jsonpCallback():e.jsonpCallback,a?e[a]=e[a].replace(Ut,"$1"+r):!1!==e.jsonp&&(e.url+=(Tt.test(e.url)?"&":"?")+e.jsonp+"="+r),e.converters["script json"]=function(){return o||S.error(r+" was not called"),o[0]},e.dataTypes[0]="json",i=C[r],C[r]=function(){o=arguments},n.always(function(){void 0===i?S(C).removeProp(r):C[r]=i,e[r]&&(e.jsonpCallback=t.jsonpCallback,zt.push(r)),o&&m(i)&&i(o[0]),o=i=void 0}),"script"}),y.createHTMLDocument=((_t=E.implementation.createHTMLDocument("").body).innerHTML="<form></form><form></form>",2===_t.childNodes.length),S.parseHTML=function(e,t,n){return"string"!=typeof e?[]:("boolean"==typeof t&&(n=t,t=!1),t||(y.createHTMLDocument?((r=(t=E.implementation.createHTMLDocument("")).createElement("base")).href=E.location.href,t.head.appendChild(r)):t=E),o=!n&&[],(i=N.exec(e))?[t.createElement(i[1])]:(i=xe([e],t,o),o&&o.length&&S(o).remove(),S.merge([],i.childNodes)));var r,i,o},S.fn.load=function(e,t,n){var r,i,o,a=this,s=e.indexOf(" ");return-1<s&&(r=ht(e.slice(s)),e=e.slice(0,s)),m(t)?(n=t,t=void 0):t&&"object"==typeof t&&(i="POST"),0<a.length&&S.ajax({url:e,type:i||"GET",dataType:"html",data:t}).done(function(e){o=arguments,a.html(r?S("<div>").append(S.parseHTML(e)).find(r):e)}).always(n&&function(e,t){a.each(function(){n.apply(this,o||[e.responseText,t,e])})}),this},S.expr.pseudos.animated=function(t){return S.grep(S.timers,function(e){return t===e.elem}).length},S.offset={setOffset:function(e,t,n){var r,i,o,a,s,u,l=S.css(e,"position"),c=S(e),f={};"static"===l&&(e.style.position="relative"),s=c.offset(),o=S.css(e,"top"),u=S.css(e,"left"),("absolute"===l||"fixed"===l)&&-1<(o+u).indexOf("auto")?(a=(r=c.position()).top,i=r.left):(a=parseFloat(o)||0,i=parseFloat(u)||0),m(t)&&(t=t.call(e,n,S.extend({},s))),null!=t.top&&(f.top=t.top-s.top+a),null!=t.left&&(f.left=t.left-s.left+i),"using"in t?t.using.call(e,f):c.css(f)}},S.fn.extend({offset:function(t){if(arguments.length)return void 0===t?this:this.each(function(e){S.offset.setOffset(this,t,e)});var e,n,r=this[0];return r?r.getClientRects().length?(e=r.getBoundingClientRect(),n=r.ownerDocument.defaultView,{top:e.top+n.pageYOffset,left:e.left+n.pageXOffset}):{top:0,left:0}:void 0},position:function(){if(this[0]){var e,t,n,r=this[0],i={top:0,left:0};if("fixed"===S.css(r,"position"))t=r.getBoundingClientRect();else{t=this.offset(),n=r.ownerDocument,e=r.offsetParent||n.documentElement;while(e&&(e===n.body||e===n.documentElement)&&"static"===S.css(e,"position"))e=e.parentNode;e&&e!==r&&1===e.nodeType&&((i=S(e).offset()).top+=S.css(e,"borderTopWidth",!0),i.left+=S.css(e,"borderLeftWidth",!0))}return{top:t.top-i.top-S.css(r,"marginTop",!0),left:t.left-i.left-S.css(r,"marginLeft",!0)}}},offsetParent:function(){return this.map(function(){var e=this.offsetParent;while(e&&"static"===S.css(e,"position"))e=e.offsetParent;return e||re})}}),S.each({scrollLeft:"pageXOffset",scrollTop:"pageYOffset"},function(t,i){var o="pageYOffset"===i;S.fn[t]=function(e){return $(this,function(e,t,n){var r;if(x(e)?r=e:9===e.nodeType&&(r=e.defaultView),void 0===n)return r?r[i]:e[t];r?r.scrollTo(o?r.pageXOffset:n,o?n:r.pageYOffset):e[t]=n},t,e,arguments.length)}}),S.each(["top","left"],function(e,n){S.cssHooks[n]=Fe(y.pixelPosition,function(e,t){if(t)return t=We(e,n),Pe.test(t)?S(e).position()[n]+"px":t})}),S.each({Height:"height",Width:"width"},function(a,s){S.each({padding:"inner"+a,content:s,"":"outer"+a},function(r,o){S.fn[o]=function(e,t){var n=arguments.length&&(r||"boolean"!=typeof e),i=r||(!0===e||!0===t?"margin":"border");return $(this,function(e,t,n){var r;return x(e)?0===o.indexOf("outer")?e["inner"+a]:e.document.documentElement["client"+a]:9===e.nodeType?(r=e.documentElement,Math.max(e.body["scroll"+a],r["scroll"+a],e.body["offset"+a],r["offset"+a],r["client"+a])):void 0===n?S.css(e,t,i):S.style(e,t,n,i)},s,n?e:void 0,n)}})}),S.each(["ajaxStart","ajaxStop","ajaxComplete","ajaxError","ajaxSuccess","ajaxSend"],function(e,t){S.fn[t]=function(e){return this.on(t,e)}}),S.fn.extend({bind:function(e,t,n){return this.on(e,null,t,n)},unbind:function(e,t){return this.off(e,null,t)},delegate:function(e,t,n,r){return this.on(t,e,n,r)},undelegate:function(e,t,n){return 1===arguments.length?this.off(e,"**"):this.off(t,e||"**",n)},hover:function(e,t){return this.mouseenter(e).mouseleave(t||e)}}),S.each("blur focus focusin focusout resize scroll click dblclick mousedown mouseup mousemove mouseover mouseout mouseenter mouseleave change select submit keydown keypress keyup contextmenu".split(" "),function(e,n){S.fn[n]=function(e,t){return 0<arguments.length?this.on(n,null,e,t):this.trigger(n)}});var Xt=/^[\s\uFEFF\xA0]+|[\s\uFEFF\xA0]+$/g;S.proxy=function(e,t){var n,r,i;if("string"==typeof t&&(n=e[t],t=e,e=n),m(e))return r=s.call(arguments,2),(i=function(){return e.apply(t||this,r.concat(s.call(arguments)))}).guid=e.guid=e.guid||S.guid++,i},S.holdReady=function(e){e?S.readyWait++:S.ready(!0)},S.isArray=Array.isArray,S.parseJSON=JSON.parse,S.nodeName=A,S.isFunction=m,S.isWindow=x,S.camelCase=X,S.type=w,S.now=Date.now,S.isNumeric=function(e){var t=S.type(e);return("number"===t||"string"===t)&&!isNaN(e-parseFloat(e))},S.trim=function(e){return null==e?"":(e+"").replace(Xt,"")},"function"==typeof define&&define.amd&&define("jquery",[],function(){return S});var Vt=C.jQuery,Gt=C.$;return S.noConflict=function(e){return C.$===S&&(C.$=Gt),e&&C.jQuery===S&&(C.jQuery=Vt),S},"undefined"==typeof e&&(C.jQuery=C.$=S),S});
diff --git a/docs/RefMan/_build/html/_static/language_data.js b/docs/RefMan/_build/html/_static/language_data.js
index 863704b31..2e22b06ab 100644
--- a/docs/RefMan/_build/html/_static/language_data.js
+++ b/docs/RefMan/_build/html/_static/language_data.js
@@ -5,12 +5,12 @@
  * This script contains the language-specific data used by searchtools.js,
  * namely the list of stopwords, stemmer, scorer and splitter.
  *
- * :copyright: Copyright 2007-2021 by the Sphinx team, see AUTHORS.
+ * :copyright: Copyright 2007-2022 by the Sphinx team, see AUTHORS.
  * :license: BSD, see LICENSE for details.
  *
  */
 
-var stopwords = ["a","and","are","as","at","be","but","by","for","if","in","into","is","it","near","no","not","of","on","or","such","that","the","their","then","there","these","they","this","to","was","will","with"];
+var stopwords = ["a", "and", "are", "as", "at", "be", "but", "by", "for", "if", "in", "into", "is", "it", "near", "no", "not", "of", "on", "or", "such", "that", "the", "their", "then", "there", "these", "they", "this", "to", "was", "will", "with"];
 
 
 /* Non-minified version is copied as a separate JS file, is available */
@@ -197,101 +197,3 @@ var Stemmer = function() {
   }
 }
 
-
-
-
-var splitChars = (function() {
-    var result = {};
-    var singles = [96, 180, 187, 191, 215, 247, 749, 885, 903, 907, 909, 930, 1014, 1648,
-         1748, 1809, 2416, 2473, 2481, 2526, 2601, 2609, 2612, 2615, 2653, 2702,
-         2706, 2729, 2737, 2740, 2857, 2865, 2868, 2910, 2928, 2948, 2961, 2971,
-         2973, 3085, 3089, 3113, 3124, 3213, 3217, 3241, 3252, 3295, 3341, 3345,
-         3369, 3506, 3516, 3633, 3715, 3721, 3736, 3744, 3748, 3750, 3756, 3761,
-         3781, 3912, 4239, 4347, 4681, 4695, 4697, 4745, 4785, 4799, 4801, 4823,
-         4881, 5760, 5901, 5997, 6313, 7405, 8024, 8026, 8028, 8030, 8117, 8125,
-         8133, 8181, 8468, 8485, 8487, 8489, 8494, 8527, 11311, 11359, 11687, 11695,
-         11703, 11711, 11719, 11727, 11735, 12448, 12539, 43010, 43014, 43019, 43587,
-         43696, 43713, 64286, 64297, 64311, 64317, 64319, 64322, 64325, 65141];
-    var i, j, start, end;
-    for (i = 0; i < singles.length; i++) {
-        result[singles[i]] = true;
-    }
-    var ranges = [[0, 47], [58, 64], [91, 94], [123, 169], [171, 177], [182, 184], [706, 709],
-         [722, 735], [741, 747], [751, 879], [888, 889], [894, 901], [1154, 1161],
-         [1318, 1328], [1367, 1368], [1370, 1376], [1416, 1487], [1515, 1519], [1523, 1568],
-         [1611, 1631], [1642, 1645], [1750, 1764], [1767, 1773], [1789, 1790], [1792, 1807],
-         [1840, 1868], [1958, 1968], [1970, 1983], [2027, 2035], [2038, 2041], [2043, 2047],
-         [2070, 2073], [2075, 2083], [2085, 2087], [2089, 2307], [2362, 2364], [2366, 2383],
-         [2385, 2391], [2402, 2405], [2419, 2424], [2432, 2436], [2445, 2446], [2449, 2450],
-         [2483, 2485], [2490, 2492], [2494, 2509], [2511, 2523], [2530, 2533], [2546, 2547],
-         [2554, 2564], [2571, 2574], [2577, 2578], [2618, 2648], [2655, 2661], [2672, 2673],
-         [2677, 2692], [2746, 2748], [2750, 2767], [2769, 2783], [2786, 2789], [2800, 2820],
-         [2829, 2830], [2833, 2834], [2874, 2876], [2878, 2907], [2914, 2917], [2930, 2946],
-         [2955, 2957], [2966, 2968], [2976, 2978], [2981, 2983], [2987, 2989], [3002, 3023],
-         [3025, 3045], [3059, 3076], [3130, 3132], [3134, 3159], [3162, 3167], [3170, 3173],
-         [3184, 3191], [3199, 3204], [3258, 3260], [3262, 3293], [3298, 3301], [3312, 3332],
-         [3386, 3388], [3390, 3423], [3426, 3429], [3446, 3449], [3456, 3460], [3479, 3481],
-         [3518, 3519], [3527, 3584], [3636, 3647], [3655, 3663], [3674, 3712], [3717, 3718],
-         [3723, 3724], [3726, 3731], [3752, 3753], [3764, 3772], [3774, 3775], [3783, 3791],
-         [3802, 3803], [3806, 3839], [3841, 3871], [3892, 3903], [3949, 3975], [3980, 4095],
-         [4139, 4158], [4170, 4175], [4182, 4185], [4190, 4192], [4194, 4196], [4199, 4205],
-         [4209, 4212], [4226, 4237], [4250, 4255], [4294, 4303], [4349, 4351], [4686, 4687],
-         [4702, 4703], [4750, 4751], [4790, 4791], [4806, 4807], [4886, 4887], [4955, 4968],
-         [4989, 4991], [5008, 5023], [5109, 5120], [5741, 5742], [5787, 5791], [5867, 5869],
-         [5873, 5887], [5906, 5919], [5938, 5951], [5970, 5983], [6001, 6015], [6068, 6102],
-         [6104, 6107], [6109, 6111], [6122, 6127], [6138, 6159], [6170, 6175], [6264, 6271],
-         [6315, 6319], [6390, 6399], [6429, 6469], [6510, 6511], [6517, 6527], [6572, 6592],
-         [6600, 6607], [6619, 6655], [6679, 6687], [6741, 6783], [6794, 6799], [6810, 6822],
-         [6824, 6916], [6964, 6980], [6988, 6991], [7002, 7042], [7073, 7085], [7098, 7167],
-         [7204, 7231], [7242, 7244], [7294, 7400], [7410, 7423], [7616, 7679], [7958, 7959],
-         [7966, 7967], [8006, 8007], [8014, 8015], [8062, 8063], [8127, 8129], [8141, 8143],
-         [8148, 8149], [8156, 8159], [8173, 8177], [8189, 8303], [8306, 8307], [8314, 8318],
-         [8330, 8335], [8341, 8449], [8451, 8454], [8456, 8457], [8470, 8472], [8478, 8483],
-         [8506, 8507], [8512, 8516], [8522, 8525], [8586, 9311], [9372, 9449], [9472, 10101],
-         [10132, 11263], [11493, 11498], [11503, 11516], [11518, 11519], [11558, 11567],
-         [11622, 11630], [11632, 11647], [11671, 11679], [11743, 11822], [11824, 12292],
-         [12296, 12320], [12330, 12336], [12342, 12343], [12349, 12352], [12439, 12444],
-         [12544, 12548], [12590, 12592], [12687, 12689], [12694, 12703], [12728, 12783],
-         [12800, 12831], [12842, 12880], [12896, 12927], [12938, 12976], [12992, 13311],
-         [19894, 19967], [40908, 40959], [42125, 42191], [42238, 42239], [42509, 42511],
-         [42540, 42559], [42592, 42593], [42607, 42622], [42648, 42655], [42736, 42774],
-         [42784, 42785], [42889, 42890], [42893, 43002], [43043, 43055], [43062, 43071],
-         [43124, 43137], [43188, 43215], [43226, 43249], [43256, 43258], [43260, 43263],
-         [43302, 43311], [43335, 43359], [43389, 43395], [43443, 43470], [43482, 43519],
-         [43561, 43583], [43596, 43599], [43610, 43615], [43639, 43641], [43643, 43647],
-         [43698, 43700], [43703, 43704], [43710, 43711], [43715, 43738], [43742, 43967],
-         [44003, 44015], [44026, 44031], [55204, 55215], [55239, 55242], [55292, 55295],
-         [57344, 63743], [64046, 64047], [64110, 64111], [64218, 64255], [64263, 64274],
-         [64280, 64284], [64434, 64466], [64830, 64847], [64912, 64913], [64968, 65007],
-         [65020, 65135], [65277, 65295], [65306, 65312], [65339, 65344], [65371, 65381],
-         [65471, 65473], [65480, 65481], [65488, 65489], [65496, 65497]];
-    for (i = 0; i < ranges.length; i++) {
-        start = ranges[i][0];
-        end = ranges[i][1];
-        for (j = start; j <= end; j++) {
-            result[j] = true;
-        }
-    }
-    return result;
-})();
-
-function splitQuery(query) {
-    var result = [];
-    var start = -1;
-    for (var i = 0; i < query.length; i++) {
-        if (splitChars[query.charCodeAt(i)]) {
-            if (start !== -1) {
-                result.push(query.slice(start, i));
-                start = -1;
-            }
-        } else if (start === -1) {
-            start = i;
-        }
-    }
-    if (start !== -1) {
-        result.push(query.slice(start));
-    }
-    return result;
-}
-
-
diff --git a/docs/RefMan/_build/html/_static/pygments.css b/docs/RefMan/_build/html/_static/pygments.css
index 631bc92ff..08bec689d 100644
--- a/docs/RefMan/_build/html/_static/pygments.css
+++ b/docs/RefMan/_build/html/_static/pygments.css
@@ -1,21 +1,26 @@
+pre { line-height: 125%; }
+td.linenos .normal { color: inherit; background-color: transparent; padding-left: 5px; padding-right: 5px; }
+span.linenos { color: inherit; background-color: transparent; padding-left: 5px; padding-right: 5px; }
+td.linenos .special { color: #000000; background-color: #ffffc0; padding-left: 5px; padding-right: 5px; }
+span.linenos.special { color: #000000; background-color: #ffffc0; padding-left: 5px; padding-right: 5px; }
 .highlight .hll { background-color: #ffffcc }
-.highlight  { background: #f8f8f8; }
-.highlight .c { color: #408080; font-style: italic } /* Comment */
+.highlight { background: #f8f8f8; }
+.highlight .c { color: #3D7B7B; font-style: italic } /* Comment */
 .highlight .err { border: 1px solid #FF0000 } /* Error */
 .highlight .k { color: #008000; font-weight: bold } /* Keyword */
 .highlight .o { color: #666666 } /* Operator */
-.highlight .ch { color: #408080; font-style: italic } /* Comment.Hashbang */
-.highlight .cm { color: #408080; font-style: italic } /* Comment.Multiline */
-.highlight .cp { color: #BC7A00 } /* Comment.Preproc */
-.highlight .cpf { color: #408080; font-style: italic } /* Comment.PreprocFile */
-.highlight .c1 { color: #408080; font-style: italic } /* Comment.Single */
-.highlight .cs { color: #408080; font-style: italic } /* Comment.Special */
+.highlight .ch { color: #3D7B7B; font-style: italic } /* Comment.Hashbang */
+.highlight .cm { color: #3D7B7B; font-style: italic } /* Comment.Multiline */
+.highlight .cp { color: #9C6500 } /* Comment.Preproc */
+.highlight .cpf { color: #3D7B7B; font-style: italic } /* Comment.PreprocFile */
+.highlight .c1 { color: #3D7B7B; font-style: italic } /* Comment.Single */
+.highlight .cs { color: #3D7B7B; font-style: italic } /* Comment.Special */
 .highlight .gd { color: #A00000 } /* Generic.Deleted */
 .highlight .ge { font-style: italic } /* Generic.Emph */
-.highlight .gr { color: #FF0000 } /* Generic.Error */
+.highlight .gr { color: #E40000 } /* Generic.Error */
 .highlight .gh { color: #000080; font-weight: bold } /* Generic.Heading */
-.highlight .gi { color: #00A000 } /* Generic.Inserted */
-.highlight .go { color: #888888 } /* Generic.Output */
+.highlight .gi { color: #008400 } /* Generic.Inserted */
+.highlight .go { color: #717171 } /* Generic.Output */
 .highlight .gp { color: #000080; font-weight: bold } /* Generic.Prompt */
 .highlight .gs { font-weight: bold } /* Generic.Strong */
 .highlight .gu { color: #800080; font-weight: bold } /* Generic.Subheading */
@@ -28,15 +33,15 @@
 .highlight .kt { color: #B00040 } /* Keyword.Type */
 .highlight .m { color: #666666 } /* Literal.Number */
 .highlight .s { color: #BA2121 } /* Literal.String */
-.highlight .na { color: #7D9029 } /* Name.Attribute */
+.highlight .na { color: #687822 } /* Name.Attribute */
 .highlight .nb { color: #008000 } /* Name.Builtin */
 .highlight .nc { color: #0000FF; font-weight: bold } /* Name.Class */
 .highlight .no { color: #880000 } /* Name.Constant */
 .highlight .nd { color: #AA22FF } /* Name.Decorator */
-.highlight .ni { color: #999999; font-weight: bold } /* Name.Entity */
-.highlight .ne { color: #D2413A; font-weight: bold } /* Name.Exception */
+.highlight .ni { color: #717171; font-weight: bold } /* Name.Entity */
+.highlight .ne { color: #CB3F38; font-weight: bold } /* Name.Exception */
 .highlight .nf { color: #0000FF } /* Name.Function */
-.highlight .nl { color: #A0A000 } /* Name.Label */
+.highlight .nl { color: #767600 } /* Name.Label */
 .highlight .nn { color: #0000FF; font-weight: bold } /* Name.Namespace */
 .highlight .nt { color: #008000; font-weight: bold } /* Name.Tag */
 .highlight .nv { color: #19177C } /* Name.Variable */
@@ -53,11 +58,11 @@
 .highlight .dl { color: #BA2121 } /* Literal.String.Delimiter */
 .highlight .sd { color: #BA2121; font-style: italic } /* Literal.String.Doc */
 .highlight .s2 { color: #BA2121 } /* Literal.String.Double */
-.highlight .se { color: #BB6622; font-weight: bold } /* Literal.String.Escape */
+.highlight .se { color: #AA5D1F; font-weight: bold } /* Literal.String.Escape */
 .highlight .sh { color: #BA2121 } /* Literal.String.Heredoc */
-.highlight .si { color: #BB6688; font-weight: bold } /* Literal.String.Interpol */
+.highlight .si { color: #A45A77; font-weight: bold } /* Literal.String.Interpol */
 .highlight .sx { color: #008000 } /* Literal.String.Other */
-.highlight .sr { color: #BB6688 } /* Literal.String.Regex */
+.highlight .sr { color: #A45A77 } /* Literal.String.Regex */
 .highlight .s1 { color: #BA2121 } /* Literal.String.Single */
 .highlight .ss { color: #19177C } /* Literal.String.Symbol */
 .highlight .bp { color: #008000 } /* Name.Builtin.Pseudo */
diff --git a/docs/RefMan/_build/html/_static/searchtools.js b/docs/RefMan/_build/html/_static/searchtools.js
index 58ff35c43..ac4d5861f 100644
--- a/docs/RefMan/_build/html/_static/searchtools.js
+++ b/docs/RefMan/_build/html/_static/searchtools.js
@@ -4,22 +4,24 @@
  *
  * Sphinx JavaScript utilities for the full-text search.
  *
- * :copyright: Copyright 2007-2021 by the Sphinx team, see AUTHORS.
+ * :copyright: Copyright 2007-2022 by the Sphinx team, see AUTHORS.
  * :license: BSD, see LICENSE for details.
  *
  */
+"use strict";
 
-if (!Scorer) {
-  /**
-   * Simple result scoring code.
-   */
+/**
+ * Simple result scoring code.
+ */
+if (typeof Scorer === "undefined") {
   var Scorer = {
     // Implement the following function to further tweak the score for each result
-    // The function takes a result array [filename, title, anchor, descr, score]
+    // The function takes a result array [docname, title, anchor, descr, score, filename]
     // and returns the new score.
     /*
-    score: function(result) {
-      return result[4];
+    score: result => {
+      const [docname, title, anchor, descr, score, filename] = result
+      return score
     },
     */
 
@@ -28,9 +30,11 @@ if (!Scorer) {
     // or matches in the last dotted part of the object name
     objPartialMatch: 6,
     // Additive scores depending on the priority of the object
-    objPrio: {0:  15,   // used to be importantResults
-              1:  5,   // used to be objectResults
-              2: -5},  // used to be unimportantResults
+    objPrio: {
+      0: 15, // used to be importantResults
+      1: 5, // used to be objectResults
+      2: -5, // used to be unimportantResults
+    },
     //  Used when the priority is not in the mapping.
     objPrioDefault: 0,
 
@@ -39,455 +43,455 @@ if (!Scorer) {
     partialTitle: 7,
     // query found in terms
     term: 5,
-    partialTerm: 2
+    partialTerm: 2,
   };
 }
 
-if (!splitQuery) {
-  function splitQuery(query) {
-    return query.split(/\s+/);
+const _removeChildren = (element) => {
+  while (element && element.lastChild) element.removeChild(element.lastChild);
+};
+
+/**
+ * See https://developer.mozilla.org/en-US/docs/Web/JavaScript/Guide/Regular_Expressions#escaping
+ */
+const _escapeRegExp = (string) =>
+  string.replace(/[.*+\-?^${}()|[\]\\]/g, "\\$&"); // $& means the whole matched string
+
+const _displayItem = (item, highlightTerms, searchTerms) => {
+  const docBuilder = DOCUMENTATION_OPTIONS.BUILDER;
+  const docUrlRoot = DOCUMENTATION_OPTIONS.URL_ROOT;
+  const docFileSuffix = DOCUMENTATION_OPTIONS.FILE_SUFFIX;
+  const docLinkSuffix = DOCUMENTATION_OPTIONS.LINK_SUFFIX;
+  const showSearchSummary = DOCUMENTATION_OPTIONS.SHOW_SEARCH_SUMMARY;
+
+  const [docName, title, anchor, descr] = item;
+
+  let listItem = document.createElement("li");
+  let requestUrl;
+  let linkUrl;
+  if (docBuilder === "dirhtml") {
+    // dirhtml builder
+    let dirname = docName + "/";
+    if (dirname.match(/\/index\/$/))
+      dirname = dirname.substring(0, dirname.length - 6);
+    else if (dirname === "index/") dirname = "";
+    requestUrl = docUrlRoot + dirname;
+    linkUrl = requestUrl;
+  } else {
+    // normal html builders
+    requestUrl = docUrlRoot + docName + docFileSuffix;
+    linkUrl = docName + docLinkSuffix;
+  }
+  const params = new URLSearchParams();
+  params.set("highlight", [...highlightTerms].join(" "));
+  let linkEl = listItem.appendChild(document.createElement("a"));
+  linkEl.href = linkUrl + "?" + params.toString() + anchor;
+  linkEl.innerHTML = title;
+  if (descr)
+    listItem.appendChild(document.createElement("span")).innerText =
+      " (" + descr + ")";
+  else if (showSearchSummary)
+    fetch(requestUrl)
+      .then((responseData) => responseData.text())
+      .then((data) => {
+        if (data)
+          listItem.appendChild(
+            Search.makeSearchSummary(data, searchTerms, highlightTerms)
+          );
+      });
+  Search.output.appendChild(listItem);
+};
+const _finishSearch = (resultCount) => {
+  Search.stopPulse();
+  Search.title.innerText = _("Search Results");
+  if (!resultCount)
+    Search.status.innerText = Documentation.gettext(
+      "Your search did not match any documents. Please make sure that all words are spelled correctly and that you've selected enough categories."
+    );
+  else
+    Search.status.innerText = _(
+      `Search finished, found ${resultCount} page(s) matching the search query.`
+    );
+};
+const _displayNextItem = (
+  results,
+  resultCount,
+  highlightTerms,
+  searchTerms
+) => {
+  // results left, load the summary and display it
+  // this is intended to be dynamic (don't sub resultsCount)
+  if (results.length) {
+    _displayItem(results.pop(), highlightTerms, searchTerms);
+    setTimeout(
+      () => _displayNextItem(results, resultCount, highlightTerms, searchTerms),
+      5
+    );
   }
+  // search finished, update title and status message
+  else _finishSearch(resultCount);
+};
+
+/**
+ * Default splitQuery function. Can be overridden in ``sphinx.search`` with a
+ * custom function per language.
+ *
+ * The regular expression works by splitting the string on consecutive characters
+ * that are not Unicode letters, numbers, underscores, or emoji characters.
+ * This is the same as ``\W+`` in Python, preserving the surrogate pair area.
+ */
+if (typeof splitQuery === "undefined") {
+  var splitQuery = (query) => query
+      .split(/[^\p{Letter}\p{Number}_\p{Emoji_Presentation}]+/gu)
+      .filter(term => term)  // remove remaining empty strings
 }
 
 /**
  * Search Module
  */
-var Search = {
-
-  _index : null,
-  _queued_query : null,
-  _pulse_status : -1,
-
-  htmlToText : function(htmlString) {
-      var virtualDocument = document.implementation.createHTMLDocument('virtual');
-      var htmlElement = $(htmlString, virtualDocument);
-      htmlElement.find('.headerlink').remove();
-      docContent = htmlElement.find('[role=main]')[0];
-      if(docContent === undefined) {
-          console.warn("Content block not found. Sphinx search tries to obtain it " +
-                       "via '[role=main]'. Could you check your theme or template.");
-          return "";
-      }
-      return docContent.textContent || docContent.innerText;
+const Search = {
+  _index: null,
+  _queued_query: null,
+  _pulse_status: -1,
+
+  htmlToText: (htmlString) => {
+    const htmlElement = document
+      .createRange()
+      .createContextualFragment(htmlString);
+    _removeChildren(htmlElement.querySelectorAll(".headerlink"));
+    const docContent = htmlElement.querySelector('[role="main"]');
+    if (docContent !== undefined) return docContent.textContent;
+    console.warn(
+      "Content block not found. Sphinx search tries to obtain it via '[role=main]'. Could you check your theme or template."
+    );
+    return "";
   },
 
-  init : function() {
-      var params = $.getQueryParameters();
-      if (params.q) {
-          var query = params.q[0];
-          $('input[name="q"]')[0].value = query;
-          this.performSearch(query);
-      }
+  init: () => {
+    const query = new URLSearchParams(window.location.search).get("q");
+    document
+      .querySelectorAll('input[name="q"]')
+      .forEach((el) => (el.value = query));
+    if (query) Search.performSearch(query);
   },
 
-  loadIndex : function(url) {
-    $.ajax({type: "GET", url: url, data: null,
-            dataType: "script", cache: true,
-            complete: function(jqxhr, textstatus) {
-              if (textstatus != "success") {
-                document.getElementById("searchindexloader").src = url;
-              }
-            }});
-  },
+  loadIndex: (url) =>
+    (document.body.appendChild(document.createElement("script")).src = url),
 
-  setIndex : function(index) {
-    var q;
-    this._index = index;
-    if ((q = this._queued_query) !== null) {
-      this._queued_query = null;
-      Search.query(q);
+  setIndex: (index) => {
+    Search._index = index;
+    if (Search._queued_query !== null) {
+      const query = Search._queued_query;
+      Search._queued_query = null;
+      Search.query(query);
     }
   },
 
-  hasIndex : function() {
-      return this._index !== null;
-  },
+  hasIndex: () => Search._index !== null,
 
-  deferQuery : function(query) {
-      this._queued_query = query;
-  },
+  deferQuery: (query) => (Search._queued_query = query),
 
-  stopPulse : function() {
-      this._pulse_status = 0;
-  },
+  stopPulse: () => (Search._pulse_status = -1),
 
-  startPulse : function() {
-    if (this._pulse_status >= 0)
-        return;
-    function pulse() {
-      var i;
+  startPulse: () => {
+    if (Search._pulse_status >= 0) return;
+
+    const pulse = () => {
       Search._pulse_status = (Search._pulse_status + 1) % 4;
-      var dotString = '';
-      for (i = 0; i < Search._pulse_status; i++)
-        dotString += '.';
-      Search.dots.text(dotString);
-      if (Search._pulse_status > -1)
-        window.setTimeout(pulse, 500);
-    }
+      Search.dots.innerText = ".".repeat(Search._pulse_status);
+      if (Search._pulse_status >= 0) window.setTimeout(pulse, 500);
+    };
     pulse();
   },
 
   /**
    * perform a search for something (or wait until index is loaded)
    */
-  performSearch : function(query) {
+  performSearch: (query) => {
     // create the required interface elements
-    this.out = $('#search-results');
-    this.title = $('<h2>' + _('Searching') + '</h2>').appendTo(this.out);
-    this.dots = $('<span></span>').appendTo(this.title);
-    this.status = $('<p class="search-summary">&nbsp;</p>').appendTo(this.out);
-    this.output = $('<ul class="search"/>').appendTo(this.out);
-
-    $('#search-progress').text(_('Preparing search...'));
-    this.startPulse();
+    const searchText = document.createElement("h2");
+    searchText.textContent = _("Searching");
+    const searchSummary = document.createElement("p");
+    searchSummary.classList.add("search-summary");
+    searchSummary.innerText = "";
+    const searchList = document.createElement("ul");
+    searchList.classList.add("search");
+
+    const out = document.getElementById("search-results");
+    Search.title = out.appendChild(searchText);
+    Search.dots = Search.title.appendChild(document.createElement("span"));
+    Search.status = out.appendChild(searchSummary);
+    Search.output = out.appendChild(searchList);
+
+    const searchProgress = document.getElementById("search-progress");
+    // Some themes don't use the search progress node
+    if (searchProgress) {
+      searchProgress.innerText = _("Preparing search...");
+    }
+    Search.startPulse();
 
     // index already loaded, the browser was quick!
-    if (this.hasIndex())
-      this.query(query);
-    else
-      this.deferQuery(query);
+    if (Search.hasIndex()) Search.query(query);
+    else Search.deferQuery(query);
   },
 
   /**
    * execute search (requires search index to be loaded)
    */
-  query : function(query) {
-    var i;
-
-    // stem the searchterms and add them to the correct list
-    var stemmer = new Stemmer();
-    var searchterms = [];
-    var excluded = [];
-    var hlterms = [];
-    var tmp = splitQuery(query);
-    var objectterms = [];
-    for (i = 0; i < tmp.length; i++) {
-      if (tmp[i] !== "") {
-          objectterms.push(tmp[i].toLowerCase());
-      }
+  query: (query) => {
+    // stem the search terms and add them to the correct list
+    const stemmer = new Stemmer();
+    const searchTerms = new Set();
+    const excludedTerms = new Set();
+    const highlightTerms = new Set();
+    const objectTerms = new Set(splitQuery(query.toLowerCase().trim()));
+    splitQuery(query.trim()).forEach((queryTerm) => {
+      const queryTermLower = queryTerm.toLowerCase();
+
+      // maybe skip this "word"
+      // stopwords array is from language_data.js
+      if (
+        stopwords.indexOf(queryTermLower) !== -1 ||
+        queryTerm.match(/^\d+$/)
+      )
+        return;
 
-      if ($u.indexOf(stopwords, tmp[i].toLowerCase()) != -1 || tmp[i] === "") {
-        // skip this "word"
-        continue;
-      }
       // stem the word
-      var word = stemmer.stemWord(tmp[i].toLowerCase());
-      // prevent stemmer from cutting word smaller than two chars
-      if(word.length < 3 && tmp[i].length >= 3) {
-        word = tmp[i];
-      }
-      var toAppend;
+      let word = stemmer.stemWord(queryTermLower);
       // select the correct list
-      if (word[0] == '-') {
-        toAppend = excluded;
-        word = word.substr(1);
-      }
+      if (word[0] === "-") excludedTerms.add(word.substr(1));
       else {
-        toAppend = searchterms;
-        hlterms.push(tmp[i].toLowerCase());
+        searchTerms.add(word);
+        highlightTerms.add(queryTermLower);
       }
-      // only add if not already in the list
-      if (!$u.contains(toAppend, word))
-        toAppend.push(word);
-    }
-    var highlightstring = '?highlight=' + $.urlencode(hlterms.join(" "));
-
-    // console.debug('SEARCH: searching for:');
-    // console.info('required: ', searchterms);
-    // console.info('excluded: ', excluded);
+    });
 
-    // prepare search
-    var terms = this._index.terms;
-    var titleterms = this._index.titleterms;
+    // console.debug("SEARCH: searching for:");
+    // console.info("required: ", [...searchTerms]);
+    // console.info("excluded: ", [...excludedTerms]);
 
-    // array of [filename, title, anchor, descr, score]
-    var results = [];
-    $('#search-progress').empty();
+    // array of [docname, title, anchor, descr, score, filename]
+    let results = [];
+    _removeChildren(document.getElementById("search-progress"));
 
     // lookup as object
-    for (i = 0; i < objectterms.length; i++) {
-      var others = [].concat(objectterms.slice(0, i),
-                             objectterms.slice(i+1, objectterms.length));
-      results = results.concat(this.performObjectSearch(objectterms[i], others));
-    }
+    objectTerms.forEach((term) =>
+      results.push(...Search.performObjectSearch(term, objectTerms))
+    );
 
     // lookup as search terms in fulltext
-    results = results.concat(this.performTermsSearch(searchterms, excluded, terms, titleterms));
+    results.push(...Search.performTermsSearch(searchTerms, excludedTerms));
 
     // let the scorer override scores with a custom scoring function
-    if (Scorer.score) {
-      for (i = 0; i < results.length; i++)
-        results[i][4] = Scorer.score(results[i]);
-    }
+    if (Scorer.score) results.forEach((item) => (item[4] = Scorer.score(item)));
 
     // now sort the results by score (in opposite order of appearance, since the
     // display function below uses pop() to retrieve items) and then
     // alphabetically
-    results.sort(function(a, b) {
-      var left = a[4];
-      var right = b[4];
-      if (left > right) {
-        return 1;
-      } else if (left < right) {
-        return -1;
-      } else {
+    results.sort((a, b) => {
+      const leftScore = a[4];
+      const rightScore = b[4];
+      if (leftScore === rightScore) {
         // same score: sort alphabetically
-        left = a[1].toLowerCase();
-        right = b[1].toLowerCase();
-        return (left > right) ? -1 : ((left < right) ? 1 : 0);
+        const leftTitle = a[1].toLowerCase();
+        const rightTitle = b[1].toLowerCase();
+        if (leftTitle === rightTitle) return 0;
+        return leftTitle > rightTitle ? -1 : 1; // inverted is intentional
       }
+      return leftScore > rightScore ? 1 : -1;
     });
 
+    // remove duplicate search results
+    // note the reversing of results, so that in the case of duplicates, the highest-scoring entry is kept
+    let seen = new Set();
+    results = results.reverse().reduce((acc, result) => {
+      let resultStr = result.slice(0, 4).concat([result[5]]).map(v => String(v)).join(',');
+      if (!seen.has(resultStr)) {
+        acc.push(result);
+        seen.add(resultStr);
+      }
+      return acc;
+    }, []);
+
+    results = results.reverse();
+
     // for debugging
     //Search.lastresults = results.slice();  // a copy
-    //console.info('search results:', Search.lastresults);
+    // console.info("search results:", Search.lastresults);
 
     // print the results
-    var resultCount = results.length;
-    function displayNextItem() {
-      // results left, load the summary and display it
-      if (results.length) {
-        var item = results.pop();
-        var listItem = $('<li></li>');
-        var requestUrl = "";
-        var linkUrl = "";
-        if (DOCUMENTATION_OPTIONS.BUILDER === 'dirhtml') {
-          // dirhtml builder
-          var dirname = item[0] + '/';
-          if (dirname.match(/\/index\/$/)) {
-            dirname = dirname.substring(0, dirname.length-6);
-          } else if (dirname == 'index/') {
-            dirname = '';
-          }
-          requestUrl = DOCUMENTATION_OPTIONS.URL_ROOT + dirname;
-          linkUrl = requestUrl;
-
-        } else {
-          // normal html builders
-          requestUrl = DOCUMENTATION_OPTIONS.URL_ROOT + item[0] + DOCUMENTATION_OPTIONS.FILE_SUFFIX;
-          linkUrl = item[0] + DOCUMENTATION_OPTIONS.LINK_SUFFIX;
-        }
-        listItem.append($('<a/>').attr('href',
-            linkUrl +
-            highlightstring + item[2]).html(item[1]));
-        if (item[3]) {
-          listItem.append($('<span> (' + item[3] + ')</span>'));
-          Search.output.append(listItem);
-          setTimeout(function() {
-            displayNextItem();
-          }, 5);
-        } else if (DOCUMENTATION_OPTIONS.HAS_SOURCE) {
-          $.ajax({url: requestUrl,
-                  dataType: "text",
-                  complete: function(jqxhr, textstatus) {
-                    var data = jqxhr.responseText;
-                    if (data !== '' && data !== undefined) {
-                      var summary = Search.makeSearchSummary(data, searchterms, hlterms);
-                      if (summary) {
-                        listItem.append(summary);
-                      }
-                    }
-                    Search.output.append(listItem);
-                    setTimeout(function() {
-                      displayNextItem();
-                    }, 5);
-                  }});
-        } else {
-          // no source available, just display title
-          Search.output.append(listItem);
-          setTimeout(function() {
-            displayNextItem();
-          }, 5);
-        }
-      }
-      // search finished, update title and status message
-      else {
-        Search.stopPulse();
-        Search.title.text(_('Search Results'));
-        if (!resultCount)
-          Search.status.text(_('Your search did not match any documents. Please make sure that all words are spelled correctly and that you\'ve selected enough categories.'));
-        else
-            Search.status.text(_('Search finished, found %s page(s) matching the search query.').replace('%s', resultCount));
-        Search.status.fadeIn(500);
-      }
-    }
-    displayNextItem();
+    _displayNextItem(results, results.length, highlightTerms, searchTerms);
   },
 
   /**
    * search for object names
    */
-  performObjectSearch : function(object, otherterms) {
-    var filenames = this._index.filenames;
-    var docnames = this._index.docnames;
-    var objects = this._index.objects;
-    var objnames = this._index.objnames;
-    var titles = this._index.titles;
-
-    var i;
-    var results = [];
-
-    for (var prefix in objects) {
-      for (var name in objects[prefix]) {
-        var fullname = (prefix ? prefix + '.' : '') + name;
-        var fullnameLower = fullname.toLowerCase()
-        if (fullnameLower.indexOf(object) > -1) {
-          var score = 0;
-          var parts = fullnameLower.split('.');
-          // check for different match types: exact matches of full name or
-          // "last name" (i.e. last dotted part)
-          if (fullnameLower == object || parts[parts.length - 1] == object) {
-            score += Scorer.objNameMatch;
-          // matches in last name
-          } else if (parts[parts.length - 1].indexOf(object) > -1) {
-            score += Scorer.objPartialMatch;
-          }
-          var match = objects[prefix][name];
-          var objname = objnames[match[1]][2];
-          var title = titles[match[0]];
-          // If more than one term searched for, we require other words to be
-          // found in the name/title/description
-          if (otherterms.length > 0) {
-            var haystack = (prefix + ' ' + name + ' ' +
-                            objname + ' ' + title).toLowerCase();
-            var allfound = true;
-            for (i = 0; i < otherterms.length; i++) {
-              if (haystack.indexOf(otherterms[i]) == -1) {
-                allfound = false;
-                break;
-              }
-            }
-            if (!allfound) {
-              continue;
-            }
-          }
-          var descr = objname + _(', in ') + title;
-
-          var anchor = match[3];
-          if (anchor === '')
-            anchor = fullname;
-          else if (anchor == '-')
-            anchor = objnames[match[1]][1] + '-' + fullname;
-          // add custom score for some objects according to scorer
-          if (Scorer.objPrio.hasOwnProperty(match[2])) {
-            score += Scorer.objPrio[match[2]];
-          } else {
-            score += Scorer.objPrioDefault;
-          }
-          results.push([docnames[match[0]], fullname, '#'+anchor, descr, score, filenames[match[0]]]);
-        }
+  performObjectSearch: (object, objectTerms) => {
+    const filenames = Search._index.filenames;
+    const docNames = Search._index.docnames;
+    const objects = Search._index.objects;
+    const objNames = Search._index.objnames;
+    const titles = Search._index.titles;
+
+    const results = [];
+
+    const objectSearchCallback = (prefix, match) => {
+      const name = match[4]
+      const fullname = (prefix ? prefix + "." : "") + name;
+      const fullnameLower = fullname.toLowerCase();
+      if (fullnameLower.indexOf(object) < 0) return;
+
+      let score = 0;
+      const parts = fullnameLower.split(".");
+
+      // check for different match types: exact matches of full name or
+      // "last name" (i.e. last dotted part)
+      if (fullnameLower === object || parts.slice(-1)[0] === object)
+        score += Scorer.objNameMatch;
+      else if (parts.slice(-1)[0].indexOf(object) > -1)
+        score += Scorer.objPartialMatch; // matches in last name
+
+      const objName = objNames[match[1]][2];
+      const title = titles[match[0]];
+
+      // If more than one term searched for, we require other words to be
+      // found in the name/title/description
+      const otherTerms = new Set(objectTerms);
+      otherTerms.delete(object);
+      if (otherTerms.size > 0) {
+        const haystack = `${prefix} ${name} ${objName} ${title}`.toLowerCase();
+        if (
+          [...otherTerms].some((otherTerm) => haystack.indexOf(otherTerm) < 0)
+        )
+          return;
       }
-    }
 
+      let anchor = match[3];
+      if (anchor === "") anchor = fullname;
+      else if (anchor === "-") anchor = objNames[match[1]][1] + "-" + fullname;
+
+      const descr = objName + _(", in ") + title;
+
+      // add custom score for some objects according to scorer
+      if (Scorer.objPrio.hasOwnProperty(match[2]))
+        score += Scorer.objPrio[match[2]];
+      else score += Scorer.objPrioDefault;
+
+      results.push([
+        docNames[match[0]],
+        fullname,
+        "#" + anchor,
+        descr,
+        score,
+        filenames[match[0]],
+      ]);
+    };
+    Object.keys(objects).forEach((prefix) =>
+      objects[prefix].forEach((array) =>
+        objectSearchCallback(prefix, array)
+      )
+    );
     return results;
   },
 
-  /**
-   * See https://developer.mozilla.org/en-US/docs/Web/JavaScript/Guide/Regular_Expressions
-   */
-  escapeRegExp : function(string) {
-    return string.replace(/[.*+\-?^${}()|[\]\\]/g, '\\$&'); // $& means the whole matched string
-  },
-
   /**
    * search for full-text terms in the index
    */
-  performTermsSearch : function(searchterms, excluded, terms, titleterms) {
-    var docnames = this._index.docnames;
-    var filenames = this._index.filenames;
-    var titles = this._index.titles;
+  performTermsSearch: (searchTerms, excludedTerms) => {
+    // prepare search
+    const terms = Search._index.terms;
+    const titleTerms = Search._index.titleterms;
+    const docNames = Search._index.docnames;
+    const filenames = Search._index.filenames;
+    const titles = Search._index.titles;
 
-    var i, j, file;
-    var fileMap = {};
-    var scoreMap = {};
-    var results = [];
+    const scoreMap = new Map();
+    const fileMap = new Map();
 
     // perform the search on the required terms
-    for (i = 0; i < searchterms.length; i++) {
-      var word = searchterms[i];
-      var files = [];
-      var _o = [
-        {files: terms[word], score: Scorer.term},
-        {files: titleterms[word], score: Scorer.title}
+    searchTerms.forEach((word) => {
+      const files = [];
+      const arr = [
+        { files: terms[word], score: Scorer.term },
+        { files: titleTerms[word], score: Scorer.title },
       ];
       // add support for partial matches
       if (word.length > 2) {
-        var word_regex = this.escapeRegExp(word);
-        for (var w in terms) {
-          if (w.match(word_regex) && !terms[word]) {
-            _o.push({files: terms[w], score: Scorer.partialTerm})
-          }
-        }
-        for (var w in titleterms) {
-          if (w.match(word_regex) && !titleterms[word]) {
-              _o.push({files: titleterms[w], score: Scorer.partialTitle})
-          }
-        }
+        const escapedWord = _escapeRegExp(word);
+        Object.keys(terms).forEach((term) => {
+          if (term.match(escapedWord) && !terms[word])
+            arr.push({ files: terms[term], score: Scorer.partialTerm });
+        });
+        Object.keys(titleTerms).forEach((term) => {
+          if (term.match(escapedWord) && !titleTerms[word])
+            arr.push({ files: titleTerms[word], score: Scorer.partialTitle });
+        });
       }
 
       // no match but word was a required one
-      if ($u.every(_o, function(o){return o.files === undefined;})) {
-        break;
-      }
+      if (arr.every((record) => record.files === undefined)) return;
+
       // found search word in contents
-      $u.each(_o, function(o) {
-        var _files = o.files;
-        if (_files === undefined)
-          return
-
-        if (_files.length === undefined)
-          _files = [_files];
-        files = files.concat(_files);
-
-        // set score for the word in each file to Scorer.term
-        for (j = 0; j < _files.length; j++) {
-          file = _files[j];
-          if (!(file in scoreMap))
-            scoreMap[file] = {};
-          scoreMap[file][word] = o.score;
-        }
+      arr.forEach((record) => {
+        if (record.files === undefined) return;
+
+        let recordFiles = record.files;
+        if (recordFiles.length === undefined) recordFiles = [recordFiles];
+        files.push(...recordFiles);
+
+        // set score for the word in each file
+        recordFiles.forEach((file) => {
+          if (!scoreMap.has(file)) scoreMap.set(file, {});
+          scoreMap.get(file)[word] = record.score;
+        });
       });
 
       // create the mapping
-      for (j = 0; j < files.length; j++) {
-        file = files[j];
-        if (file in fileMap && fileMap[file].indexOf(word) === -1)
-          fileMap[file].push(word);
-        else
-          fileMap[file] = [word];
-      }
-    }
+      files.forEach((file) => {
+        if (fileMap.has(file) && fileMap.get(file).indexOf(word) === -1)
+          fileMap.get(file).push(word);
+        else fileMap.set(file, [word]);
+      });
+    });
 
     // now check if the files don't contain excluded terms
-    for (file in fileMap) {
-      var valid = true;
-
+    const results = [];
+    for (const [file, wordList] of fileMap) {
       // check if all requirements are matched
-      var filteredTermCount = // as search terms with length < 3 are discarded: ignore
-        searchterms.filter(function(term){return term.length > 2}).length
+
+      // as search terms with length < 3 are discarded
+      const filteredTermCount = [...searchTerms].filter(
+        (term) => term.length > 2
+      ).length;
       if (
-        fileMap[file].length != searchterms.length &&
-        fileMap[file].length != filteredTermCount
-      ) continue;
+        wordList.length !== searchTerms.size &&
+        wordList.length !== filteredTermCount
+      )
+        continue;
 
       // ensure that none of the excluded terms is in the search result
-      for (i = 0; i < excluded.length; i++) {
-        if (terms[excluded[i]] == file ||
-            titleterms[excluded[i]] == file ||
-            $u.contains(terms[excluded[i]] || [], file) ||
-            $u.contains(titleterms[excluded[i]] || [], file)) {
-          valid = false;
-          break;
-        }
-      }
+      if (
+        [...excludedTerms].some(
+          (term) =>
+            terms[term] === file ||
+            titleTerms[term] === file ||
+            (terms[term] || []).includes(file) ||
+            (titleTerms[term] || []).includes(file)
+        )
+      )
+        break;
 
-      // if we have still a valid result we can add it to the result list
-      if (valid) {
-        // select one (max) score for the file.
-        // for better ranking, we should calculate ranking by using words statistics like basic tf-idf...
-        var score = $u.max($u.map(fileMap[file], function(w){return scoreMap[file][w]}));
-        results.push([docnames[file], titles[file], '', null, score, filenames[file]]);
-      }
+      // select one (max) score for the file.
+      const score = Math.max(...wordList.map((w) => scoreMap.get(file)[w]));
+      // add result to the result list
+      results.push([
+        docNames[file],
+        titles[file],
+        "",
+        null,
+        score,
+        filenames[file],
+      ]);
     }
     return results;
   },
@@ -495,34 +499,33 @@ var Search = {
   /**
    * helper function to return a node containing the
    * search summary for a given text. keywords is a list
-   * of stemmed words, hlwords is the list of normal, unstemmed
+   * of stemmed words, highlightWords is the list of normal, unstemmed
    * words. the first one is used to find the occurrence, the
    * latter for highlighting it.
    */
-  makeSearchSummary : function(htmlText, keywords, hlwords) {
-    var text = Search.htmlToText(htmlText);
-    if (text == "") {
-      return null;
-    }
-    var textLower = text.toLowerCase();
-    var start = 0;
-    $.each(keywords, function() {
-      var i = textLower.indexOf(this.toLowerCase());
-      if (i > -1)
-        start = i;
-    });
-    start = Math.max(start - 120, 0);
-    var excerpt = ((start > 0) ? '...' : '') +
-      $.trim(text.substr(start, 240)) +
-      ((start + 240 - text.length) ? '...' : '');
-    var rv = $('<p class="context"></p>').text(excerpt);
-    $.each(hlwords, function() {
-      rv = rv.highlightText(this, 'highlighted');
-    });
-    return rv;
-  }
+  makeSearchSummary: (htmlText, keywords, highlightWords) => {
+    const text = Search.htmlToText(htmlText).toLowerCase();
+    if (text === "") return null;
+
+    const actualStartPosition = [...keywords]
+      .map((k) => text.indexOf(k.toLowerCase()))
+      .filter((i) => i > -1)
+      .slice(-1)[0];
+    const startWithContext = Math.max(actualStartPosition - 120, 0);
+
+    const top = startWithContext === 0 ? "" : "...";
+    const tail = startWithContext + 240 < text.length ? "..." : "";
+
+    let summary = document.createElement("div");
+    summary.classList.add("context");
+    summary.innerText = top + text.substr(startWithContext, 240).trim() + tail;
+
+    highlightWords.forEach((highlightWord) =>
+      _highlightText(summary, highlightWord, "highlighted")
+    );
+
+    return summary;
+  },
 };
 
-$(document).ready(function() {
-  Search.init();
-});
+_ready(Search.init);
diff --git a/docs/RefMan/_build/html/genindex.html b/docs/RefMan/_build/html/genindex.html
index 4627583b8..346a6300d 100644
--- a/docs/RefMan/_build/html/genindex.html
+++ b/docs/RefMan/_build/html/genindex.html
@@ -13,6 +13,7 @@
         <script data-url_root="./" id="documentation_options" src="_static/documentation_options.js"></script>
         <script src="_static/jquery.js"></script>
         <script src="_static/underscore.js"></script>
+        <script src="_static/_sphinx_javascript_frameworks_compat.js"></script>
         <script src="_static/doctools.js"></script>
     <script src="_static/js/theme.js"></script>
     <link rel="index" title="Index" href="#" />
diff --git a/docs/RefMan/_build/html/search.html b/docs/RefMan/_build/html/search.html
index 7e61ed64b..dc89fa01c 100644
--- a/docs/RefMan/_build/html/search.html
+++ b/docs/RefMan/_build/html/search.html
@@ -14,6 +14,7 @@
         <script data-url_root="./" id="documentation_options" src="_static/documentation_options.js"></script>
         <script src="_static/jquery.js"></script>
         <script src="_static/underscore.js"></script>
+        <script src="_static/_sphinx_javascript_frameworks_compat.js"></script>
         <script src="_static/doctools.js"></script>
     <script src="_static/js/theme.js"></script>
     <script src="_static/searchtools.js"></script>
diff --git a/docs/RefMan/_build/html/searchindex.js b/docs/RefMan/_build/html/searchindex.js
index 1d5f1b10c..2249ca005 100644
--- a/docs/RefMan/_build/html/searchindex.js
+++ b/docs/RefMan/_build/html/searchindex.js
@@ -1 +1 @@
-Search.setIndex({docnames:["BasicSyntax","BasicTypes","Expressions","Modules","OverloadedOperations","RefMan","TypeDeclarations"],envversion:{"sphinx.domains.c":2,"sphinx.domains.changeset":1,"sphinx.domains.citation":1,"sphinx.domains.cpp":4,"sphinx.domains.index":1,"sphinx.domains.javascript":2,"sphinx.domains.math":2,"sphinx.domains.python":3,"sphinx.domains.rst":2,"sphinx.domains.std":2,"sphinx.ext.todo":2,sphinx:56},filenames:["BasicSyntax.rst","BasicTypes.rst","Expressions.rst","Modules.rst","OverloadedOperations.rst","RefMan.rst","TypeDeclarations.rst"],objects:{},objnames:{},objtypes:{},terms:{"0":[1,2],"0254":0,"0b":0,"0b1010":0,"0b1010111":0,"0b11010":0,"0b11111110":0,"0b_0000_0010":0,"0o":0,"0o1234":0,"0o376":0,"0x":0,"0x01":3,"0x02":3,"0x03":3,"0x04":3,"0x1234":0,"0x30":0,"0x_ffff_ffea":0,"0xfe":0,"1":[0,1,2,3,6],"10":[0,1,3],"100":1,"11":3,"12":[0,3],"13":2,"15":1,"16":0,"1p4":0,"2":[0,1,2,3,6],"20":1,"22":2,"25":1,"254":0,"26":3,"2e3":0,"3":[0,1,2,3,6],"30":[1,3],"32":3,"33":2,"4":0,"5":[0,1,2,3],"6":[0,6],"64":0,"7":[0,2,3],"8":[2,3],"9":2,"case":3,"do":[2,3,6],"float":0,"function":[3,5,6],"import":[0,1,2,5],"new":[3,6],"public":3,"static":0,"true":1,"try":3,"while":[0,1],A:[0,1,3,6],For:[1,2,3,6],If:[2,3],In:3,It:3,Such:[0,3],The:[0,1,2,3],Then:3,There:1,To:3,_:[0,1],ab:4,abbrevi:1,abl:3,about:3,abov:[2,3],access:[2,5],accommod:2,across:3,ad:[2,3],add:3,addit:[0,3],all:[0,2,3,6],allow:[0,3,6],alphabet:1,also:[0,1,3],an:[0,1,2,5],ani:[3,6],annot:5,anonym:5,anoth:3,appear:[1,6],appli:0,applic:2,ar:[0,1,2,3,6],arbitrarili:0,argument:[5,6],arithmet:[1,5],arr:1,associ:0,assumpt:3,automat:2,avoid:3,awai:3,b:[0,3,4,6],back:1,backtick:2,baddef:1,base:[0,2],basic:5,becaus:3,befor:3,begin:0,behavior:1,being:3,belong:0,between:0,binari:0,bind:1,bit:[0,1,2,3,4],bitvector:1,block:[0,5],bodi:6,both:[1,3],bound:1,brace:1,branch:2,bring:[3,6],built:5,call:[1,3,5],can:[1,2,3,6],cannot:[0,2],ceil:[0,4],charact:0,checker:6,chosen:2,clash:3,claus:3,close:0,closest:0,cmp:4,code:3,collect:[1,6],collis:3,combin:3,comma:1,comment:5,compar:1,comparison:5,complement:4,complex:1,compon:1,comprehens:1,comput:[0,1],concaten:1,concret:3,condit:5,consid:[0,3,6],consist:0,constant:3,constraint:[0,5],construct:[1,2,3],contain:[0,1,3],content:3,context:[0,2],conveni:3,correspond:2,coupl:3,cours:3,creat:6,cry:3,cryptol:[0,2,3],cryptolpath:3,cumbersom:3,curli:1,data:1,decim:0,declar:[3,5],defin:[0,1,3,6],definit:[1,2,3],defint:2,degre:0,demot:5,deriv:3,describ:3,descript:1,desrib:3,determin:[0,1],differ:3,digit:0,dimension:1,directli:6,directori:3,distance2:1,distinct:6,divis:[0,5],document:[0,3],done:3,down:[0,1],downward:1,e11:1,e12:1,e1:1,e21:1,e22:1,e2:1,e3:1,e:[0,1,3,4],each:[3,6],easi:3,easier:3,effect:0,either:[0,3],element:[1,2],els:[0,2,3],enclos:[1,3],end:[0,3],english:0,entri:1,enumer:1,eq:4,equal:[0,1,5,6],equat:1,equival:3,error:3,evalu:2,even:[0,6],everi:6,everyth:3,ex:1,examin:1,exampl:[0,1,2,3],except:3,exclus:1,exist:[3,6],explicit:[1,3,5],expon:0,exponenti:0,express:[0,1,3,5,6],extend:3,extern:0,extract:6,f:[0,1,2,3],fals:1,famili:0,featur:3,few:3,field:[4,5,6],file:3,fill:3,fin:[0,3],finit:[1,2],first:[0,1,3],fix:[0,1],floor:4,follow:[0,1,2,3],form:6,fraction:0,from:[0,1,2,3],frominteg:4,front:1,functor:3,g:[0,2,3],gener:1,get:1,getfst:1,glu:3,good:3,group:[0,3,6],h:[2,3],ha:[0,1,2],had:6,handi:1,happen:3,hash:3,have:[0,1,2,3,6],help:3,helper1:3,helper2:3,helper:3,here:[0,2,3],hexadecim:0,hide:[0,5],hierarch:5,highest:0,hold:1,i:[0,1,3],identifi:[1,3,5],impl1:3,impl2:3,impl:3,implement:3,implicit:5,impos:3,improv:0,includ:0,indent:[0,3],index:1,inf:[1,4],infer:[0,2],inffrom:4,inffromthen:4,infinit:1,infix:[0,5],infixl:0,infixr:0,inform:1,instanti:5,instead:[3,6],insuffici:1,integ:[0,2,4,6],integr:5,intend:3,interfac:[0,5],introduc:3,invalid:1,irrelev:6,isposit:1,its:[0,3],itself:3,j:[1,3],just:[3,6],keword:3,keyword:[3,5],kind:2,known:1,l:1,label:1,lambda:[1,2],languag:0,larg:2,last:[0,2],layout:[3,5],left:[0,1],length:[0,1],less:0,let:0,letter:0,level:[3,5],lexicograph:1,lg2:0,lift:1,like:[3,6],line:[0,3,6],link:3,list:5,liter:[2,5],local:[0,3,5],locat:[1,3],logarithm:0,logic:5,longer_nam:0,longernam:0,look:3,lowest:0,m:3,mai:[0,1,2,3,6],main:3,make:3,manag:5,mani:3,mark:0,match:1,max:[0,4],maximum:0,mayb:3,mean:0,member:6,mention:6,might:3,min:[0,4],minimum:0,mirror:1,modul:[0,5],modulu:0,more:[0,3],moreov:6,most:[1,3],multipl:[0,1,2,3],must:[0,3],my:3,myf:3,n:[0,1,3],name1:0,name2:0,name:[0,1,5,6],need:[2,3],negat:4,nest:[0,1,5],newt:6,newtyp:[0,3,5],notat:[0,1,2,3],note:[1,3],noth:3,notion:3,number:[0,1,2],numer:[3,5],obtain:[1,3],occasion:3,octal:0,often:1,old:1,onc:3,one:[0,2,3],onli:[1,3,6],open:0,oper:5,option:[0,6],order:[1,3],ordinari:3,organ:0,other:[3,6],otherwis:6,outer:3,outsid:3,overload:[0,5],overview:2,ox:0,p11:1,p12:1,p1:1,p21:1,p22:1,p2:1,p3:1,p4:1,p:[0,1,3],packag:1,pad:0,pair:2,paramet:[0,2,5],parameter:5,paren:2,parenthes:1,parmaet:3,part:3,pass:[2,5],pattern:[1,2],place:3,point:1,pointwis:1,polymorph:2,polynomi:0,posit:1,possibl:[2,3],practic:3,pragma:0,pre:6,preced:[2,3],precis:0,prefix:[0,3,5],presum:3,previou:3,prime:0,primit:0,primtiv:2,principl:0,privat:[0,5],program:1,programm:0,project:6,properti:0,provid:[2,3],pt:1,purpos:[1,6],qualifi:5,quickli:1,quit:[1,3],r:1,ration:0,readabl:0,recip:4,record:[5,6],recurs:[3,6],reduc:3,refer:3,reject:0,rel:1,relat:3,remain:3,repl:1,repres:0,represent:0,requir:3,result:[0,1,2,3],right:[0,1],ring:4,rotat:1,round:[0,5],roundawai:4,roundtoeven:4,s:[0,2,3],same:[0,1,3,6],scope:[2,3,6],search:3,section:[2,3],see:[0,3],selector:1,semant:3,separ:[1,3],seq:6,sequenc:[0,5],set:1,sha256:3,shadow:3,shape:1,shift:1,should:[1,2],sign:[1,5],signatur:5,signedcmp:4,similarli:1,simpl:3,sinc:3,singl:3,site:6,situat:3,size:[0,1],slight:3,so:[0,1,2,3],some:[0,3],sometim:3,somewher:3,sourc:3,special:0,specifi:[0,2,3],split:1,start:[0,1],step:[1,3],straight:3,stream:1,stride:1,structur:3,sub:[1,3],submdul:3,submodul:[0,3],submould:3,subtract:0,suffici:[1,2],sugar:[2,3],suitabl:2,sum:6,sumbodul:3,support:[0,3],sure:3,symbol:[0,3],synonym:[3,5],syntact:3,syntax:[1,2,5],system:3,t1:1,t2:1,t3:1,t:[1,2,3,6],tabl:0,tend:3,term:0,termin:0,text:0,than:[0,3],thei:[0,1,3,6],them:3,thi:[0,1,2,3],thing:3,those:[1,3],though:6,three:1,through:[1,5],thu:[1,3],time:3,togeth:[1,3],tointeg:4,top:3,transpar:6,treat:[3,6],trunc:4,tupl:5,two:[0,1,2,3,6],typaram:2,type:[3,5],typecheck:6,typeclass:6,unari:[0,2],underscor:0,understand:3,unfold:6,unlik:6,up:0,upcom:3,updat:5,updateend:1,updatesend:1,us:[0,1,2,3,6],user:6,usual:2,valid:1,valu:[0,1,3,5,6],variabl:2,variant:3,variat:3,varieti:0,via:1,wa:3,wai:[1,3],want:3,we:[1,3],weakest:2,when:[0,1,2,3],where:[0,1,2,3],wherea:1,which:[0,2,3,6],whole:[2,3],width:[0,3],wise:1,withing:3,without:3,word:1,work:3,would:[3,6],write:[0,1],written:[0,1,2,6],x:[0,1,2,3,6],xpo:1,xs:1,y:[0,1,2,3],yet:3,you:[2,3],ypo:1,z:[0,2,3],zero:[2,5]},titles:["Basic Syntax","Basic Types","Expressions","Modules","Overloaded Operations","Cryptol Reference Manual","Type Declarations"],titleterms:{"function":[1,2],"import":3,access:1,an:3,annot:2,anonym:3,argument:[2,3],arithmet:4,basic:[0,1,4],block:[2,3],built:0,call:2,comment:0,comparison:4,condit:2,constraint:3,cryptol:5,declar:[0,2,6],demot:2,divis:4,equal:4,explicit:2,express:2,field:1,hide:3,hierarch:3,identifi:0,implicit:3,infix:2,instanti:[2,3],integr:4,interfac:3,keyword:0,layout:0,level:0,list:3,liter:0,local:2,logic:4,manag:3,manual:5,modul:3,name:3,nest:3,newtyp:6,numer:[0,2],oper:[0,1,2,4],overload:4,paramet:3,parameter:3,pass:3,preced:0,prefix:2,privat:3,qualifi:3,record:1,refer:5,round:4,sequenc:1,sign:4,signatur:0,synonym:6,syntax:0,through:3,todo:[0,2],tupl:1,type:[0,1,2,6],updat:1,valu:2,zero:4}})
\ No newline at end of file
+Search.setIndex({"docnames": ["BasicSyntax", "BasicTypes", "Expressions", "Modules", "OverloadedOperations", "RefMan", "TypeDeclarations"], "filenames": ["BasicSyntax.rst", "BasicTypes.rst", "Expressions.rst", "Modules.rst", "OverloadedOperations.rst", "RefMan.rst", "TypeDeclarations.rst"], "titles": ["Basic Syntax", "Basic Types", "Expressions", "Modules", "Overloaded Operations", "Cryptol Reference Manual", "Type Declarations"], "terms": {"f": [0, 1, 2, 3], "x": [0, 1, 2, 3, 6], "y": [0, 1, 2, 3], "z": [0, 2, 3], "g": [0, 2, 3], "b": [0, 3, 4, 6], "fin": [0, 3], "A": [0, 1, 3, 6], "can": [0, 1, 2, 3, 6], "us": [0, 1, 2, 3, 6], "which": [0, 2, 3, 6], "ar": [0, 1, 2, 3, 6], "like": [0, 3, 6], "normal": 0, "multi": 0, "branch": [0, 2], "express": [0, 1, 3, 5, 6], "except": [0, 3], "condit": [0, 5], "For": [0, 1, 2, 3, 6], "exampl": [0, 1, 2, 3], "len": 0, "n": [0, 1, 3], "integ": [0, 2, 4, 6], "xs": [0, 1], "0": [0, 1, 2], "1": [0, 1, 2, 3, 6], "drop": 0, "note": [0, 1, 3], "thi": [0, 1, 2, 3], "importantli": 0, "differ": [0, 3], "from": [0, 1, 2, 3], "In": [0, 3], "checker": [0, 6], "cannot": [0, 2], "determin": [0, 1], "requir": [0, 3], "sinc": [0, 3], "s": [0, 2, 3], "onli": [0, 1, 3, 6], "valu": [0, 1, 3, 5, 6], "howev": 0, "local": [0, 3, 5], "assum": 0, "so": [0, 1, 2, 3], "fact": 0, "support": [0, 3], "over": 0, "etc": 0, "alias": 0, "also": [0, 1, 3], "long": 0, "thei": [0, 1, 3, 6], "group": [0, 3, 6], "organ": 0, "base": [0, 2], "indent": [0, 3], "same": [0, 1, 3, 6], "belong": 0, "line": [0, 3, 6], "text": 0, "more": [0, 3], "than": [0, 3], "begin": 0, "while": [0, 1], "less": 0, "termin": 0, "consid": [0, 3, 6], "follow": [0, 1, 2, 3], "cryptol": [0, 2, 3], "where": [0, 1, 2, 3], "ha": [0, 1, 2], "two": [0, 1, 2, 3, 6], "one": [0, 2, 3], "all": [0, 2, 3, 6], "between": 0, "The": [0, 1, 2, 3], "principl": 0, "appli": 0, "block": [0, 5], "defin": [0, 1, 3, 6], "name": [0, 1, 5, 6], "start": [0, 1], "end": [0, 3], "mai": [0, 1, 2, 3, 6], "nest": [0, 1, 5], "arbitrarili": 0, "document": [0, 3], "consist": 0, "charact": 0, "first": [0, 1, 3], "must": [0, 3], "either": [0, 3], "an": [0, 1, 2, 5], "english": 0, "letter": 0, "underscor": 0, "_": [0, 1], "decim": 0, "digit": 0, "prime": 0, "some": [0, 3], "have": [0, 1, 2, 3, 6], "special": 0, "mean": 0, "languag": 0, "programm": 0, "see": [0, 3], "name1": 0, "longer_nam": 0, "name2": 0, "longernam": 0, "extern": 0, "includ": 0, "interfac": [0, 5], "paramet": [0, 2, 5], "properti": 0, "hide": [0, 5], "infix": [0, 5], "let": 0, "pragma": 0, "submodul": [0, 3], "els": [0, 2, 3], "infixl": 0, "modul": [0, 5], "primit": 0, "down": [0, 1], "import": [0, 1, 2, 5], "infixr": 0, "newtyp": [0, 3, 5], "privat": [0, 5], "tabl": 0, "contain": [0, 1, 3], "associ": 0, "lowest": 0, "highest": 0, "last": [0, 2], "right": [0, 1], "left": [0, 1], "unari": [0, 2], "varieti": 0, "allow": [0, 3, 6], "comput": [0, 1], "specifi": [0, 2, 3], "size": [0, 1], "sequenc": [0, 5], "addit": [0, 3], "subtract": 0, "multipl": [0, 1, 2, 3], "divis": [0, 5], "ceil": [0, 4], "round": [0, 5], "up": 0, "modulu": 0, "pad": 0, "exponenti": 0, "lg2": 0, "logarithm": 0, "2": [0, 1, 2, 3, 6], "width": [0, 3], "bit": [0, 1, 2, 3, 4], "equal": [0, 1, 5, 6], "max": [0, 4], "maximum": 0, "min": [0, 4], "minimum": 0, "written": [0, 1, 2, 6], "binari": 0, "octal": 0, "hexadecim": 0, "notat": [0, 1, 2, 3], "its": [0, 3], "prefix": [0, 3, 5], "0b": 0, "0o": 0, "0x": 0, "254": 0, "0254": 0, "0b11111110": 0, "0o376": 0, "0xfe": 0, "result": [0, 1, 2, 3], "fix": [0, 1], "length": [0, 1], "i": [0, 1, 3], "e": [0, 1, 3, 4], "number": [0, 1, 2], "overload": [0, 5], "infer": [0, 2], "context": [0, 2], "0b1010": 0, "4": 0, "0o1234": 0, "12": [0, 3], "3": [0, 1, 2, 3, 6], "0x1234": 0, "16": 0, "10": [0, 1, 3], "polynomi": 0, "write": [0, 1], "term": 0, "open": 0, "close": 0, "degre": 0, "6": [0, 6], "7": [0, 2, 3], "0b1010111": 0, "5": [0, 1, 2, 3], "0b11010": 0, "fraction": 0, "ox": 0, "option": [0, 6], "expon": 0, "mark": 0, "symbol": [0, 3], "p": [0, 1, 3], "2e3": 0, "0x30": 0, "64": 0, "1p4": 0, "ration": 0, "float": 0, "famili": 0, "repres": 0, "precis": 0, "Such": [0, 3], "reject": 0, "static": 0, "when": [0, 1, 2, 3], "closest": 0, "represent": 0, "even": [0, 6], "effect": 0, "improv": 0, "readabl": 0, "here": [0, 2, 3], "0b_0000_0010": 0, "0x_ffff_ffea": 0, "packag": 1, "togeth": [1, 3], "enclos": [1, 3], "parenthes": 1, "curli": 1, "brace": 1, "compon": 1, "both": [1, 3], "separ": [1, 3], "comma": 1, "label": 1, "sign": [1, 5], "identifi": [1, 3, 5], "posit": 1, "order": [1, 3], "most": [1, 3], "purpos": [1, 6], "true": 1, "fals": 1, "lexicograph": 1, "compar": 1, "appear": [1, 6], "wherea": 1, "alphabet": 1, "wai": [1, 3], "via": 1, "pattern": [1, 2], "match": 1, "explicit": [1, 3, 5], "selector": 1, "15": 1, "20": 1, "program": 1, "suffici": [1, 2], "inform": 1, "shape": 1, "t": [1, 2, 3, 6], "valid": 1, "definit": [1, 2, 3], "known": 1, "isposit": 1, "invalid": 1, "insuffici": 1, "baddef": 1, "mirror": 1, "syntax": [1, 2, 5], "construct": [1, 2, 3], "getfst": 1, "distance2": 1, "xpo": 1, "ypo": 1, "lift": 1, "through": [1, 5], "point": 1, "wise": 1, "equat": 1, "should": [1, 2], "hold": 1, "l": 1, "thu": [1, 3], "we": [1, 3], "quickli": 1, "obtain": [1, 3], "similarli": 1, "get": 1, "entri": 1, "behavior": 1, "quit": [1, 3], "handi": 1, "examin": 1, "complex": 1, "data": 1, "repl": 1, "r": 1, "pt": 1, "100": 1, "set": 1, "30": [1, 3], "rel": 1, "old": 1, "25": 1, "collect": [1, 6], "element": [1, 2], "finit": [1, 2], "often": 1, "call": [1, 3, 5], "word": 1, "abbrevi": 1, "infinit": 1, "inf": [1, 4], "stream": 1, "e1": 1, "e2": 1, "e3": 1, "three": 1, "t1": 1, "t2": 1, "enumer": 1, "exclus": 1, "bound": 1, "stride": 1, "ex": 1, "downward": 1, "t3": 1, "step": [1, 3], "p11": 1, "e11": 1, "p12": 1, "e12": 1, "comprehens": 1, "p21": 1, "e21": 1, "p22": 1, "e22": 1, "gener": 1, "index": 1, "bind": 1, "arr": 1, "j": [1, 3], "dimension": 1, "those": [1, 3], "descript": 1, "concaten": 1, "shift": 1, "rotat": 1, "arithmet": [1, 5], "bitvector": 1, "front": 1, "back": 1, "sub": [1, 3], "updateend": 1, "locat": [1, 3], "updatesend": 1, "There": 1, "pointwis": 1, "p1": 1, "p2": 1, "p3": 1, "p4": 1, "split": 1, "lambda": [1, 2], "section": [2, 3], "provid": [2, 3], "overview": 2, "h": [2, 3], "pair": 2, "paren": 2, "ad": [2, 3], "8": [2, 3], "whole": [2, 3], "9": 2, "variabl": 2, "If": [2, 3], "polymorph": 2, "typaram": 2, "zero": [2, 5], "you": [2, 3], "evalu": 2, "pass": [2, 5], "13": 2, "weakest": 2, "preced": [2, 3], "scope": [2, 3, 6], "defint": 2, "do": [2, 3, 6], "need": [2, 3], "22": 2, "33": 2, "correspond": 2, "access": [2, 5], "kind": 2, "larg": 2, "accommod": 2, "liter": [2, 5], "backtick": 2, "sugar": [2, 3], "applic": 2, "primtiv": 2, "abov": [2, 3], "suitabl": 2, "automat": 2, "chosen": 2, "possibl": [2, 3], "usual": 2, "relat": 3, "each": [3, 6], "file": 3, "top": 3, "level": [3, 5], "m": 3, "type": [3, 5], "simpl": 3, "glu": 3, "ordinari": 3, "hash": 3, "sha256": 3, "structur": 3, "implement": 3, "search": 3, "look": 3, "cry": 3, "directori": 3, "cryptolpath": 3, "To": 3, "anoth": 3, "declar": [3, 5], "wa": 3, "sometim": 3, "want": 3, "0x02": 3, "0x03": 3, "0x04": 3, "help": 3, "reduc": 3, "collis": 3, "It": 3, "tend": 3, "make": 3, "code": 3, "easier": 3, "understand": 3, "becaus": 3, "easi": 3, "sourc": 3, "mani": 3, "them": 3, "few": 3, "would": [3, 6], "clash": 3, "situat": 3, "conveni": 3, "everyth": 3, "avoid": 3, "work": 3, "happen": 3, "combin": 3, "claus": 3, "introduc": 3, "case": 3, "might": 3, "helper": 3, "function": [3, 5, 6], "intend": 3, "outsid": 3, "good": 3, "practic": 3, "place": 3, "0x01": 3, "helper1": 3, "helper2": 3, "public": 3, "remain": 3, "extend": 3, "keyword": [3, 5], "new": [3, 6], "layout": [3, 5], "singl": 3, "equival": 3, "previou": 3, "withing": 3, "other": [3, 6], "keword": 3, "refer": 3, "shadow": 3, "outer": 3, "submdul": 3, "just": [3, 6], "recurs": [3, 6], "across": 3, "error": 3, "try": 3, "add": 3, "submould": 3, "system": 3, "ani": [3, 6], "befor": 3, "bring": [3, 6], "Then": 3, "upcom": 3, "variant": 3, "featur": 3, "yet": 3, "part": 3, "main": 3, "describ": 3, "content": 3, "without": 3, "concret": 3, "numer": [3, 5], "assumpt": 3, "about": 3, "constant": 3, "instead": [3, 6], "desrib": 3, "parmaet": 3, "sumbodul": 3, "sure": 3, "onc": 3, "mayb": 3, "link": 3, "abl": 3, "impos": 3, "cours": 3, "done": 3, "impl": 3, "26": 3, "myf": 3, "fill": 3, "my": 3, "slight": 3, "variat": 3, "impl1": 3, "impl2": 3, "deriv": 3, "itself": 3, "somewher": 3, "presum": 3, "coupl": 3, "cumbersom": 3, "straight": 3, "awai": 3, "thing": 3, "notion": 3, "32": 3, "11": 3, "treat": [3, 6], "syntact": 3, "functor": 3, "time": 3, "synonym": [3, 5], "noth": 3, "exist": [3, 6], "semant": 3, "occasion": 3, "being": 3, "eq": 4, "cmp": 4, "ab": 4, "ring": 4, "signedcmp": 4, "complement": 4, "frominteg": 4, "negat": 4, "tointeg": 4, "inffrom": 4, "inffromthen": 4, "field": [4, 5, 6], "recip": 4, "floor": 4, "trunc": 4, "roundawai": 4, "roundtoeven": 4, "basic": 5, "signatur": 5, "constraint": 5, "guard": 5, "comment": 5, "built": 5, "oper": 5, "annot": 5, "instanti": 5, "argument": [5, 6], "demot": 5, "tupl": 5, "record": [5, 6], "updat": 5, "comparison": 5, "logic": 5, "integr": 5, "hierarch": 5, "list": 5, "qualifi": 5, "implicit": 5, "manag": 5, "parameter": 5, "anonym": 5, "creat": 6, "pre": 6, "transpar": 6, "unfold": 6, "site": 6, "though": 6, "user": 6, "had": 6, "bodi": 6, "mention": 6, "newt": 6, "seq": 6, "unlik": 6, "distinct": 6, "moreov": 6, "member": 6, "typeclass": 6, "typecheck": 6, "otherwis": 6, "irrelev": 6, "form": 6, "everi": 6, "project": 6, "directli": 6, "extract": 6, "sum": 6, "exhaust": 0}, "objects": {}, "objtypes": {}, "objnames": {}, "titleterms": {"basic": [0, 1, 4], "syntax": 0, "declar": [0, 2, 6], "type": [0, 1, 2, 6], "signatur": 0, "numer": [0, 2], "constraint": [0, 3], "guard": 0, "layout": 0, "comment": 0, "todo": [0, 2], "identifi": 0, "keyword": 0, "built": 0, "oper": [0, 1, 2, 4], "preced": 0, "level": 0, "liter": 0, "tupl": 1, "record": 1, "access": 1, "field": 1, "updat": 1, "sequenc": 1, "function": [1, 2], "express": 2, "call": 2, "prefix": 2, "infix": 2, "annot": 2, "explicit": 2, "instanti": [2, 3], "local": 2, "block": [2, 3], "argument": [2, 3], "condit": 2, "demot": 2, "valu": 2, "modul": 3, "hierarch": 3, "name": 3, "import": 3, "list": 3, "hide": 3, "qualifi": 3, "privat": 3, "nest": 3, "implicit": 3, "manag": 3, "parameter": 3, "interfac": 3, "an": 3, "anonym": 3, "pass": 3, "through": 3, "paramet": 3, "overload": 4, "equal": 4, "comparison": 4, "sign": 4, "zero": 4, "logic": 4, "arithmet": 4, "integr": 4, "divis": 4, "round": 4, "cryptol": 5, "refer": 5, "manual": 5, "synonym": 6, "newtyp": 6}, "envversion": {"sphinx.domains.c": 2, "sphinx.domains.changeset": 1, "sphinx.domains.citation": 1, "sphinx.domains.cpp": 6, "sphinx.domains.index": 1, "sphinx.domains.javascript": 2, "sphinx.domains.math": 2, "sphinx.domains.python": 3, "sphinx.domains.rst": 2, "sphinx.domains.std": 2, "sphinx.ext.todo": 2, "sphinx": 56}})
\ No newline at end of file

From 369ebfbd56986ddbc8563903b3577c54200041a2 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Thu, 11 Aug 2022 14:20:30 -0700
Subject: [PATCH 046/125] tryProveImplication

---
 src/Cryptol/TypeCheck/Solve.hs | 25 +++++++++++++++++++++++++
 1 file changed, 25 insertions(+)

diff --git a/src/Cryptol/TypeCheck/Solve.hs b/src/Cryptol/TypeCheck/Solve.hs
index d79764546..6c0b717d9 100644
--- a/src/Cryptol/TypeCheck/Solve.hs
+++ b/src/Cryptol/TypeCheck/Solve.hs
@@ -11,6 +11,7 @@
 module Cryptol.TypeCheck.Solve
   ( simplifyAllConstraints
   , proveImplication
+  , tryProveImplication
   , proveModuleTopLevel
   , defaultAndSimplify
   , defaultReplExpr
@@ -285,6 +286,30 @@ proveImplication lnam as ps gs =
        Left errs -> mapM_ recordError errs
      return su
 
+-- | Tries to prove an implication. If proved, then returns `Right (m_su ::
+-- InferM Subst)` where `m_su` is an `InferM` computation that results in the
+-- solution substitution, and records any warning invoked during proving. If not
+-- proved, then returns `Left (m_err :: InferM ())`, which records all errors
+-- invoked during proving.
+tryProveImplication :: 
+  Maybe Name -> [TParam] -> [Prop] -> [Goal] ->
+  InferM (Either (InferM ()) (InferM Subst))
+tryProveImplication lnam as ps gs =
+  do evars <- varsWithAsmps
+     solver <- getSolver
+
+     extraAs <- (map mtpParam . Map.elems) <$> getParamTypes
+     extra   <- map thing <$> getParamConstraints
+
+     (mbErr,su) <- io (proveImplicationIO solver lnam evars
+                            (extraAs ++ as) (extra ++ ps) gs)
+     case mbErr of
+       Left errs -> pure . Left $ do
+         mapM_ recordError errs
+       Right ws  -> pure . Right $ do
+         mapM_ recordWarning ws
+         return su
+
 proveImplicationIO :: Solver
                    -> Maybe Name     -- ^ Checking this function
                    -> Set TVar -- ^ These appear in the env., and we should

From 795eb2865206f17b1c2c9b1ca238e8ba9f765cc0 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Thu, 11 Aug 2022 15:35:42 -0700
Subject: [PATCH 047/125] warnings for non-exhaustive constraint guards

---
 src/Cryptol/REPL/Monad.hs           |   2 +
 src/Cryptol/TypeCheck/Error.hs      |   7 ++
 src/Cryptol/TypeCheck/Infer.hs      | 123 +++++++++++++++++-----------
 src/Cryptol/TypeCheck/InferTypes.hs |   3 +
 tests/constraint-guards/Len.cry     |   2 +
 5 files changed, 89 insertions(+), 48 deletions(-)

diff --git a/src/Cryptol/REPL/Monad.hs b/src/Cryptol/REPL/Monad.hs
index f77cc6d70..12cb99e13 100644
--- a/src/Cryptol/REPL/Monad.hs
+++ b/src/Cryptol/REPL/Monad.hs
@@ -902,6 +902,8 @@ userOptions  = mkOptionMap
     "Choose whether to display warnings when expression association has changed due to new prefix operator fixities."
   , simpleOpt "warnUninterp" ["warn-uninterp"] (EnvBool True) noCheck
     "Choose whether to issue a warning when uninterpreted functions are used to implement primitives in the symbolic simulator."
+  , simpleOpt "warnNonExhaustiveConstraintGuards" ["warn-nonexhaustive-constraintguards"] (EnvBool True) noCheck
+    "Choose whether to issue a warning when a use of constraint guards is not determined to be exhaustive."
   , simpleOpt "smtFile" ["smt-file"] (EnvString "-") noCheck
     "The file to use for SMT-Lib scripts (for debugging or offline proving).\nUse \"-\" for stdout."
   , OptionDescr "path" [] (EnvString "") noCheck
diff --git a/src/Cryptol/TypeCheck/Error.hs b/src/Cryptol/TypeCheck/Error.hs
index cdb542596..71e8e4903 100644
--- a/src/Cryptol/TypeCheck/Error.hs
+++ b/src/Cryptol/TypeCheck/Error.hs
@@ -65,6 +65,7 @@ subsumes _ _ = False
 data Warning  = DefaultingKind (P.TParam Name) P.Kind
               | DefaultingWildType P.Kind
               | DefaultingTo !TVarInfo Type
+              | NonExhaustivePropGuards Name
                 deriving (Show, Generic, NFData)
 
 -- | Various errors that might happen during type checking/inference
@@ -208,6 +209,7 @@ instance TVars Warning where
       DefaultingKind {}     -> warn
       DefaultingWildType {} -> warn
       DefaultingTo d ty     -> DefaultingTo d $! (apSubst su ty)
+      NonExhaustivePropGuards {} -> warn
 
 instance FVS Warning where
   fvs warn =
@@ -215,6 +217,7 @@ instance FVS Warning where
       DefaultingKind {}     -> Set.empty
       DefaultingWildType {} -> Set.empty
       DefaultingTo _ ty     -> fvs ty
+      NonExhaustivePropGuards {} -> Set.empty
 
 instance TVars Error where
   apSubst su err =
@@ -307,6 +310,10 @@ instance PP (WithNames Warning) where
         text "Defaulting" <+> pp (tvarDesc d) <+> text "to"
                                               <+> ppWithNames names ty
 
+      NonExhaustivePropGuards n ->
+        text "Could not prove that the constraint guards used in defining" <+> 
+        pp n <+> text "were exhaustive."
+
 instance PP (WithNames Error) where
   ppPrec _ (WithNames err names) =
     case err of
diff --git a/src/Cryptol/TypeCheck/Infer.hs b/src/Cryptol/TypeCheck/Infer.hs
index f54f0797c..4d994e215 100644
--- a/src/Cryptol/TypeCheck/Infer.hs
+++ b/src/Cryptol/TypeCheck/Infer.hs
@@ -18,6 +18,8 @@
 -- See Note [-Wincomplete-uni-patterns and irrefutable patterns] in Cryptol.TypeCheck.TypePat
 {-# OPTIONS_GHC -Wno-incomplete-uni-patterns #-}
 {-# LANGUAGE LambdaCase #-}
+{-# OPTIONS_GHC -Wno-unrecognised-pragmas #-}
+{-# HLINT ignore "Redundant <$>" #-}
 module Cryptol.TypeCheck.Infer
   ( checkE
   , checkSigB
@@ -57,15 +59,14 @@ import           Cryptol.Utils.PP (pp)
 import qualified Data.Map as Map
 import           Data.Map (Map)
 import qualified Data.Set as Set
-import           Data.List(foldl',sortBy,groupBy)
-import           Data.Either(partitionEithers)
+import           Data.List(foldl', sortBy, groupBy, partition)
+import           Data.Either(partitionEithers, isRight)
 import           Data.Maybe(isJust, fromMaybe, mapMaybe)
-import           Data.List(partition)
 import           Data.Ratio(numerator,denominator)
 import           Data.Traversable(forM)
 import           Data.Function(on)
 import           Control.Monad(zipWithM,unless,foldM,forM_,mplus)
-import Data.Bifunctor (Bifunctor(second))
+import           Data.Bifunctor (Bifunctor(second))
 
 
 
@@ -976,12 +977,13 @@ checkMonoB b t =
 -- XXX: Do we really need to do the defaulting business in two different places?
 checkSigB :: P.Bind Name -> (Schema,[Goal]) -> InferM Decl
 checkSigB b (Forall as asmps0 t0, validSchema) =
+  let name = thing (P.bName b) in
   case thing (P.bDef b) of
 
     -- XXX what should we do with validSchema in this case?
     P.DPrim -> do
       return Decl
-        { dName       = thing (P.bName b)
+        { dName       = name
         , dSignature  = Forall as asmps0 t0
         , dDefinition = DPrim
         , dPragmas    = P.bPragmas b
@@ -996,7 +998,7 @@ checkSigB b (Forall as asmps0 t0, validSchema) =
         (t, asmps, e2) <- checkBindDefExpr [] asmps0 e0
 
         return Decl
-          { dName       = thing (P.bName b)
+          { dName       = name
           , dSignature  = Forall as asmps t
           , dDefinition = DExpr (foldr ETAbs (foldr EProofAbs e2 asmps) as)
           , dPragmas    = P.bPragmas b
@@ -1005,50 +1007,75 @@ checkSigB b (Forall as asmps0 t0, validSchema) =
           , dDoc        = P.bDoc b
           }
 
-    P.DPropGuards cases0 ->
+    P.DPropGuards cases0 -> do
       inRangeMb (getLoc b) $
-      withTParams as $ do
-        asmps1 <- applySubstPreds asmps0
-        t1     <- applySubst t0
-
-        -- Checking each guarded case is the same as checking a DExpr, except 
-        -- that the guarding assumptions are added first.
-        let checkPropGuardCase :: ([P.Prop Name], P.Expr Name) -> InferM ([Prop], Expr)
-            checkPropGuardCase (guards0, e0) = do
-              mb_rng <- case P.bSignature b of
-                Just (P.Forall _ _ _ mb_rng) -> pure mb_rng
-                _ -> panic "checkSigB" 
-                  [ "Used constraint guards without a signature, dumbwit, at " 
-                  , show . pp $ P.bName b ]
-              -- check guards
-              (guards1, goals) <-  
-                second concat . unzip <$> 
-                checkPropGuard mb_rng `traverse` guards0
-              -- try to prove all goals
-              su <- proveImplication (Just . thing $ P.bName b) as (asmps1 <> guards1) goals
-              extendSubst su
-              -- preprends the goals to the constraints, because these must be
-              -- checked first before the rest of the constraints (during
-              -- evaluation) to ensure well-definedness, since some constraints
-              -- make use of partial functions e.g. `a - b` requires `a >= b`.
-              let guards2 = (goal <$> goals) <> concatMap pSplitAnd (apSubst su guards1)
-              (_t, guards3, e1) <- checkBindDefExpr asmps1 guards2 e0
-              e2 <- applySubst e1
-              pure (guards3, e2)
-
-        cases1 <- mapM checkPropGuardCase cases0
+        withTParams as $ do
+          asmps1 <- applySubstPreds asmps0
+          t1     <- applySubst t0
+
+          -- Checking each guarded case is the same as checking a DExpr, except 
+          -- that the guarding assumptions are added first.
+          let checkPropGuardCase :: ([P.Prop Name], P.Expr Name) -> InferM ([Prop], Expr)
+              checkPropGuardCase (guards0, e0) = do
+                mb_rng <- case P.bSignature b of
+                  Just (P.Forall _ _ _ mb_rng) -> pure mb_rng
+                  _ -> panic "checkSigB"
+                    [ "Used constraint guards without a signature, dumbwit, at "
+                    , show . pp $ P.bName b ]
+                -- check guards
+                (guards1, goals) <-
+                  second concat . unzip <$>
+                  checkPropGuard mb_rng `traverse` guards0
+                -- try to prove all goals
+                su <- proveImplication (Just name) as (asmps1 <> guards1) goals
+                extendSubst su
+                -- Preprends the goals to the constraints, because these must be
+                -- checked first before the rest of the constraints (during
+                -- evaluation) to ensure well-definedness, since some constraints
+                -- make use of partial functions e.g. `a - b` requires `a >= b`.
+                let guards2 = (goal <$> goals) <> concatMap pSplitAnd (apSubst su guards1)
+                (_t, guards3, e1) <- checkBindDefExpr asmps1 guards2 e0
+                e2 <- applySubst e1
+                pure (guards3, e2)
+
+          cases1 <- mapM checkPropGuardCase cases0
+
+          -- Try to prove that at leats one guard will be satisfied. We do this
+          -- instead of directly check exhaustive because that requires either
+          -- negation or disjunction, which are not currently provided for Cryptol
+          -- constraints.
+          or <$> mapM
+            (\(props, _e) ->
+              isRight <$> tryProveImplication (Just name) as asmps1
+                ((\goal ->
+                  Goal
+                    { goalSource = CtPropGuardsExhaustion name
+                    , goalRange = srcRange $ P.bName b
+                    , goal = goal}
+                )
+                  <$> props)
+            )
+            cases1 >>= \case
+              True ->
+                -- proved exhaustive
+                pure ()
+              False ->
+                -- didn't prove exhaustive i.e. none of the guarding props
+                -- necessarily hold
+                recordWarning (NonExhaustivePropGuards name)
+
+          return Decl
+            { dName       = name
+            , dSignature  = Forall as asmps1 t1
+            , dDefinition = DExpr
+                              (foldr ETAbs
+                              (foldr EProofAbs (EPropGuards cases1) asmps1) as)
+            , dPragmas    = P.bPragmas b
+            , dInfix      = P.bInfix b
+            , dFixity     = P.bFixity b
+            , dDoc        = P.bDoc b
+            }
 
-        return Decl
-          { dName       = thing (P.bName b)
-          , dSignature  = Forall as asmps1 t1
-          , dDefinition = DExpr
-                            (foldr ETAbs 
-                            (foldr EProofAbs (EPropGuards cases1) asmps1) as)
-          , dPragmas    = P.bPragmas b
-          , dInfix      = P.bInfix b
-          , dFixity     = P.bFixity b
-          , dDoc        = P.bDoc b
-          }
 
   where
 
diff --git a/src/Cryptol/TypeCheck/InferTypes.hs b/src/Cryptol/TypeCheck/InferTypes.hs
index 217a9c0dc..a220bacfc 100644
--- a/src/Cryptol/TypeCheck/InferTypes.hs
+++ b/src/Cryptol/TypeCheck/InferTypes.hs
@@ -220,6 +220,7 @@ data ConstraintSource
   | CtImprovement
   | CtPattern TypeSource  -- ^ Constraints arising from type-checking patterns
   | CtModuleInstance ModName -- ^ Instantiating a parametrized module
+  | CtPropGuardsExhaustion Name -- ^ Checking that a use of prop guards is exhastive
     deriving (Show, Generic, NFData)
 
 selSrc :: Selector -> TypeSource
@@ -247,6 +248,7 @@ instance TVars ConstraintSource where
       CtImprovement    -> src
       CtPattern _      -> src
       CtModuleInstance _ -> src
+      CtPropGuardsExhaustion _ -> src
 
 
 instance FVS Goal where
@@ -353,6 +355,7 @@ instance PP ConstraintSource where
       CtImprovement   -> "examination of collected goals"
       CtPattern ad    -> "checking a pattern:" <+> pp ad
       CtModuleInstance n -> "module instantiation" <+> pp n
+      CtPropGuardsExhaustion n -> "exhaustion check for prop guards used in defining" <+> pp n
 
 ppUse :: Expr -> Doc
 ppUse expr =
diff --git a/tests/constraint-guards/Len.cry b/tests/constraint-guards/Len.cry
index fcb655d0c..5cdb79ef3 100644
--- a/tests/constraint-guards/Len.cry
+++ b/tests/constraint-guards/Len.cry
@@ -1,3 +1,5 @@
+// Yields non-exhaustive constraint guards warning if
+// warnNonExhaustiveConstraintGuards is on.
 len : {n,a} (fin n) => [n] a -> Integer
 len x
   | (n == 0) => 0

From e08fc8ff0fcf8dcc80e7d073d19e3b03cf4c9670 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Thu, 11 Aug 2022 16:53:21 -0700
Subject: [PATCH 048/125] only check exhaustive constraint guards if user
 option is on

---
 src/Cryptol/TypeCheck/Infer.hs      | 56 +++++++++++++++--------------
 src/Cryptol/TypeCheck/InferTypes.hs |  6 ++--
 src/Cryptol/TypeCheck/Monad.hs      |  6 ++++
 3 files changed, 38 insertions(+), 30 deletions(-)

diff --git a/src/Cryptol/TypeCheck/Infer.hs b/src/Cryptol/TypeCheck/Infer.hs
index 4d994e215..76f7e4b09 100644
--- a/src/Cryptol/TypeCheck/Infer.hs
+++ b/src/Cryptol/TypeCheck/Infer.hs
@@ -65,7 +65,7 @@ import           Data.Maybe(isJust, fromMaybe, mapMaybe)
 import           Data.Ratio(numerator,denominator)
 import           Data.Traversable(forM)
 import           Data.Function(on)
-import           Control.Monad(zipWithM,unless,foldM,forM_,mplus)
+import           Control.Monad(zipWithM,unless,foldM,forM_,mplus, when)
 import           Data.Bifunctor (Bifunctor(second))
 
 
@@ -1013,7 +1013,7 @@ checkSigB b (Forall as asmps0 t0, validSchema) =
           asmps1 <- applySubstPreds asmps0
           t1     <- applySubst t0
 
-          -- Checking each guarded case is the same as checking a DExpr, except 
+          -- Checking each guarded case is the same as checking a DExpr, except
           -- that the guarding assumptions are added first.
           let checkPropGuardCase :: ([P.Prop Name], P.Expr Name) -> InferM ([Prop], Expr)
               checkPropGuardCase (guards0, e0) = do
@@ -1031,8 +1031,9 @@ checkSigB b (Forall as asmps0 t0, validSchema) =
                 extendSubst su
                 -- Preprends the goals to the constraints, because these must be
                 -- checked first before the rest of the constraints (during
-                -- evaluation) to ensure well-definedness, since some constraints
-                -- make use of partial functions e.g. `a - b` requires `a >= b`.
+                -- evaluation) to ensure well-definedness, since some
+                -- constraints make use of partial functions e.g. `a - b`
+                -- requires `a >= b`.
                 let guards2 = (goal <$> goals) <> concatMap pSplitAnd (apSubst su guards1)
                 (_t, guards3, e1) <- checkBindDefExpr asmps1 guards2 e0
                 e2 <- applySubst e1
@@ -1040,29 +1041,30 @@ checkSigB b (Forall as asmps0 t0, validSchema) =
 
           cases1 <- mapM checkPropGuardCase cases0
 
-          -- Try to prove that at leats one guard will be satisfied. We do this
-          -- instead of directly check exhaustive because that requires either
-          -- negation or disjunction, which are not currently provided for Cryptol
-          -- constraints.
-          or <$> mapM
-            (\(props, _e) ->
-              isRight <$> tryProveImplication (Just name) as asmps1
-                ((\goal ->
-                  Goal
-                    { goalSource = CtPropGuardsExhaustion name
-                    , goalRange = srcRange $ P.bName b
-                    , goal = goal}
-                )
-                  <$> props)
-            )
-            cases1 >>= \case
-              True ->
-                -- proved exhaustive
-                pure ()
-              False ->
-                -- didn't prove exhaustive i.e. none of the guarding props
-                -- necessarily hold
-                recordWarning (NonExhaustivePropGuards name)
+          askWarnNonExhaustiveConstraintGuards >>= \flag -> when flag $
+            -- Try to prove that at leats one guard will be satisfied. We do
+            -- this instead of directly check exhaustive because that requires
+            -- either negation or disjunction, which are not currently provided
+            -- for Cryptol constraints.
+            or <$> mapM
+              (\(props, _e) ->
+                isRight <$> tryProveImplication (Just name) as asmps1
+                  ((\goal ->
+                    Goal
+                      { goalSource = CtPropGuardsExhaustive name
+                      , goalRange = srcRange $ P.bName b
+                      , goal = goal}
+                  )
+                    <$> props)
+              )
+              cases1 >>= \case
+                True ->
+                  -- proved exhaustive
+                  pure ()
+                False ->
+                  -- didn't prove exhaustive i.e. none of the guarding props
+                  -- necessarily hold
+                  recordWarning (NonExhaustivePropGuards name)
 
           return Decl
             { dName       = name
diff --git a/src/Cryptol/TypeCheck/InferTypes.hs b/src/Cryptol/TypeCheck/InferTypes.hs
index a220bacfc..821a86d1c 100644
--- a/src/Cryptol/TypeCheck/InferTypes.hs
+++ b/src/Cryptol/TypeCheck/InferTypes.hs
@@ -220,7 +220,7 @@ data ConstraintSource
   | CtImprovement
   | CtPattern TypeSource  -- ^ Constraints arising from type-checking patterns
   | CtModuleInstance ModName -- ^ Instantiating a parametrized module
-  | CtPropGuardsExhaustion Name -- ^ Checking that a use of prop guards is exhastive
+  | CtPropGuardsExhaustive Name -- ^ Checking that a use of prop guards is exhastive
     deriving (Show, Generic, NFData)
 
 selSrc :: Selector -> TypeSource
@@ -248,7 +248,7 @@ instance TVars ConstraintSource where
       CtImprovement    -> src
       CtPattern _      -> src
       CtModuleInstance _ -> src
-      CtPropGuardsExhaustion _ -> src
+      CtPropGuardsExhaustive _ -> src
 
 
 instance FVS Goal where
@@ -355,7 +355,7 @@ instance PP ConstraintSource where
       CtImprovement   -> "examination of collected goals"
       CtPattern ad    -> "checking a pattern:" <+> pp ad
       CtModuleInstance n -> "module instantiation" <+> pp n
-      CtPropGuardsExhaustion n -> "exhaustion check for prop guards used in defining" <+> pp n
+      CtPropGuardsExhaustive n -> "exhaustion check for prop guards used in defining" <+> pp n
 
 ppUse :: Expr -> Doc
 ppUse expr =
diff --git a/src/Cryptol/TypeCheck/Monad.hs b/src/Cryptol/TypeCheck/Monad.hs
index 6f2951da1..1274aa399 100644
--- a/src/Cryptol/TypeCheck/Monad.hs
+++ b/src/Cryptol/TypeCheck/Monad.hs
@@ -245,6 +245,9 @@ data RO = RO
   , iPrimNames :: !PrimMap
 
   , iSolveCounter :: !(IORef Int)
+
+    -- matches the user option `warnNonExhaustiveConstraintGuards`
+  , iWarnNonExhaustiveConstraintGuards :: Bool
   }
 
 -- | Read-write component of the monad.
@@ -947,6 +950,9 @@ withMonoType (x,lt) = withVar x (Forall [] [] (thing lt))
 withMonoTypes :: Map Name (Located Type) -> InferM a -> InferM a
 withMonoTypes xs m = foldr withMonoType m (Map.toList xs)
 
+askWarnNonExhaustiveConstraintGuards :: InferM Bool
+askWarnNonExhaustiveConstraintGuards = IM $ asks iWarnNonExhaustiveConstraintGuards
+
 --------------------------------------------------------------------------------
 -- Kind checking
 

From 3cdb7034137f0925d1931d5160aacad2215d2aae Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Fri, 12 Aug 2022 23:04:48 -0700
Subject: [PATCH 049/125] properly handle censoring warnings

---
 src/Cryptol/REPL/Command.hs    | 33 ++++++++++++++++++++-------------
 src/Cryptol/TypeCheck/Monad.hs |  6 ------
 2 files changed, 20 insertions(+), 19 deletions(-)

diff --git a/src/Cryptol/REPL/Command.hs b/src/Cryptol/REPL/Command.hs
index 0f5404faa..f4ce8bb69 100644
--- a/src/Cryptol/REPL/Command.hs
+++ b/src/Cryptol/REPL/Command.hs
@@ -1492,23 +1492,16 @@ liftModuleCmd cmd =
                 }
      moduleCmdResult =<< io (cmd minp)
 
+-- TODO: add filter for my exhaustie prop guards warning here
+
 moduleCmdResult :: M.ModuleRes a -> REPL a
 moduleCmdResult (res,ws0) = do
   warnDefaulting  <- getKnownUser "warnDefaulting"
   warnShadowing   <- getKnownUser "warnShadowing"
   warnPrefixAssoc <- getKnownUser "warnPrefixAssoc"
+  warnNonExhConGrds <- getKnownUser "warnNonExhaustiveConstraintGuards"
   -- XXX: let's generalize this pattern
-  let isDefaultWarn (T.DefaultingTo _ _) = True
-      isDefaultWarn _ = False
-
-      filterDefaults w | warnDefaulting = Just w
-      filterDefaults (M.TypeCheckWarnings nameMap xs) =
-        case filter (not . isDefaultWarn . snd) xs of
-          [] -> Nothing
-          ys -> Just (M.TypeCheckWarnings nameMap ys)
-      filterDefaults w = Just w
-
-      isShadowWarn (M.SymbolShadowed {}) = True
+  let isShadowWarn (M.SymbolShadowed {}) = True
       isShadowWarn _                     = False
 
       isPrefixAssocWarn (M.PrefixAssocChanged {}) = True
@@ -1521,9 +1514,23 @@ moduleCmdResult (res,ws0) = do
           ys -> Just (M.RenamerWarnings ys)
       filterRenamer _ _ w = Just w
 
-  let ws = mapMaybe filterDefaults
-         . mapMaybe (filterRenamer warnShadowing isShadowWarn)
+      -- ignore certain warnings during typechecking
+      filterTypecheck :: M.ModuleWarning -> Maybe M.ModuleWarning
+      filterTypecheck (M.TypeCheckWarnings nameMap xs) = 
+        case filter (allow . snd) xs of 
+          [] -> Nothing
+          ys -> Just (M.TypeCheckWarnings nameMap ys)
+          where
+            allow :: T.Warning -> Bool 
+            allow = \case
+              T.DefaultingTo _ _ | not warnDefaulting -> False
+              T.NonExhaustivePropGuards _ | not warnNonExhConGrds -> False
+              _ -> True
+      filterTypecheck w = Just w
+
+  let ws = mapMaybe (filterRenamer warnShadowing isShadowWarn)
          . mapMaybe (filterRenamer warnPrefixAssoc isPrefixAssocWarn)
+         . mapMaybe filterTypecheck
          $ ws0
   names <- M.mctxNameDisp <$> getFocusedEnv
   mapM_ (rPrint . runDoc names . pp) ws
diff --git a/src/Cryptol/TypeCheck/Monad.hs b/src/Cryptol/TypeCheck/Monad.hs
index 1274aa399..6f2951da1 100644
--- a/src/Cryptol/TypeCheck/Monad.hs
+++ b/src/Cryptol/TypeCheck/Monad.hs
@@ -245,9 +245,6 @@ data RO = RO
   , iPrimNames :: !PrimMap
 
   , iSolveCounter :: !(IORef Int)
-
-    -- matches the user option `warnNonExhaustiveConstraintGuards`
-  , iWarnNonExhaustiveConstraintGuards :: Bool
   }
 
 -- | Read-write component of the monad.
@@ -950,9 +947,6 @@ withMonoType (x,lt) = withVar x (Forall [] [] (thing lt))
 withMonoTypes :: Map Name (Located Type) -> InferM a -> InferM a
 withMonoTypes xs m = foldr withMonoType m (Map.toList xs)
 
-askWarnNonExhaustiveConstraintGuards :: InferM Bool
-askWarnNonExhaustiveConstraintGuards = IM $ asks iWarnNonExhaustiveConstraintGuards
-
 --------------------------------------------------------------------------------
 -- Kind checking
 

From 722ca3f174b16b013a61cc09cdefdf8d3489a8a0 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Fri, 12 Aug 2022 23:05:02 -0700
Subject: [PATCH 050/125] exhaustive constraints guards checking

---
 src/Cryptol/TypeCheck/Infer.hs | 114 +++++++++++++++++++++++++--------
 1 file changed, 87 insertions(+), 27 deletions(-)

diff --git a/src/Cryptol/TypeCheck/Infer.hs b/src/Cryptol/TypeCheck/Infer.hs
index 76f7e4b09..89bbf8d3d 100644
--- a/src/Cryptol/TypeCheck/Infer.hs
+++ b/src/Cryptol/TypeCheck/Infer.hs
@@ -20,6 +20,7 @@
 {-# LANGUAGE LambdaCase #-}
 {-# OPTIONS_GHC -Wno-unrecognised-pragmas #-}
 {-# HLINT ignore "Redundant <$>" #-}
+{-# HLINT ignore "Redundant <&>" #-}
 module Cryptol.TypeCheck.Infer
   ( checkE
   , checkSigB
@@ -54,7 +55,7 @@ import           Cryptol.TypeCheck.Unify(rootPath)
 import           Cryptol.Utils.Ident
 import           Cryptol.Utils.Panic(panic)
 import           Cryptol.Utils.RecordMap
-import           Cryptol.Utils.PP (pp)
+import           Cryptol.Utils.PP (pp, pretty)
 
 import qualified Data.Map as Map
 import           Data.Map (Map)
@@ -65,7 +66,7 @@ import           Data.Maybe(isJust, fromMaybe, mapMaybe)
 import           Data.Ratio(numerator,denominator)
 import           Data.Traversable(forM)
 import           Data.Function(on)
-import           Control.Monad(zipWithM,unless,foldM,forM_,mplus, when)
+import           Control.Monad(zipWithM,unless,foldM,forM_,mplus, join)
 import           Data.Bifunctor (Bifunctor(second))
 
 
@@ -1041,31 +1042,90 @@ checkSigB b (Forall as asmps0 t0, validSchema) =
 
           cases1 <- mapM checkPropGuardCase cases0
 
-          askWarnNonExhaustiveConstraintGuards >>= \flag -> when flag $
-            -- Try to prove that at leats one guard will be satisfied. We do
-            -- this instead of directly check exhaustive because that requires
-            -- either negation or disjunction, which are not currently provided
-            -- for Cryptol constraints.
-            or <$> mapM
-              (\(props, _e) ->
-                isRight <$> tryProveImplication (Just name) as asmps1
-                  ((\goal ->
-                    Goal
-                      { goalSource = CtPropGuardsExhaustive name
-                      , goalRange = srcRange $ P.bName b
-                      , goal = goal}
-                  )
-                    <$> props)
-              )
-              cases1 >>= \case
-                True ->
-                  -- proved exhaustive
-                  pure ()
-                False ->
-                  -- didn't prove exhaustive i.e. none of the guarding props
-                  -- necessarily hold
-                  recordWarning (NonExhaustivePropGuards name)
-
+          -- Here, `props` is a conjunction of multiple constraints, and so the
+          -- negation is the disjunction of the negation of each conjunct i.e.
+          -- "not (A and B and C) <=> (not A) or (not B) or (not C)". This is
+          -- one of DeMorgan's laws of boolean logic. Since there are no
+          -- constraint disjunctions, we encode a disjunction of conjunctions as
+          -- `[[Prop]]`. For exhaustive checking, each disjunct will need to be
+          -- checked independently, and all must pass in order to be considered
+          -- exhaustive.
+
+          let negateSimpleNumProp :: Prop -> Maybe [Prop]
+              negateSimpleNumProp prop = case prop of
+                TCon tcon tys -> case tcon of
+                  PC pc -> case pc of
+                    -- not x == y  <=>  x /= y
+                    PEqual -> pure [TCon (PC PNeq) tys]
+                    -- not x /= y  <=>  x == y
+                    PNeq -> pure [TCon (PC PEqual) tys]
+                    -- not x >= y  <=>  x /= y and y >= x
+                    PGeq -> pure [TCon (PC PNeq) tys, TCon (PC PGeq) (reverse tys)]
+                    -- not fin x  <=>  x == Inf
+                    PFin | [ty] <- tys -> pure [TCon (PC PEqual) [ty, tInf]]
+                         | otherwise -> panicInvalid
+                    -- not True  <=>  0 == 1
+                    PTrue -> pure [TCon (PC PEqual) [tZero, tOne]]
+                    _ -> mempty
+                  TC _tc -> panicInvalid
+                  TF _tf -> panicInvalid
+                  TError _ki -> panicInvalid -- TODO: where does this come from?
+                TUser _na _tys ty -> negateSimpleNumProp ty
+                _ -> panicInvalid
+                where
+                  panicInvalid = tcPanic "checkSigB"
+                    [ "This type shouldn't be a valid type constraint: " ++
+                      "`" ++ pretty prop ++ "`"]
+              
+              negateSimpleNumProps :: [Prop] -> [[Prop]]
+              negateSimpleNumProps props = do
+                prop <- props
+                maybe mempty pure (negateSimpleNumProp prop)
+
+              toGoal :: Prop -> Goal 
+              toGoal prop = 
+                Goal
+                  { goalSource = CtPropGuardsExhaustive name
+                  , goalRange = srcRange $ P.bName b
+                  , goal = prop }
+
+              canProve :: [Prop] -> [Goal] -> InferM Bool
+              canProve asmps goals = isRight <$> 
+                tryProveImplication (Just name) as asmps goals
+
+              -- Try to prove that the first guard will be satisfied. If cannot,
+              -- then assume it is false (via `negateSimpleNumProps`) and try to
+              -- prove that the second guard will be satisfied. If cannot, then
+              -- assume it is false, and so on. If the last guard cannot be
+              -- proven in this way, then issue a `NonExhaustivePropGuards`
+              -- warning. Note that when assuming that a conjunction of multiple
+              -- constraints is false, this results in a disjunction, and so
+              -- must check exhaustive under assumption that each disjunct is
+              -- false independently. 
+              -- 
+              -- TODO: do I have to check all combinations of false/true
+              -- disjuncts? Or is it satisfactory to just check setting each one
+              -- to false seperately.
+              checkExhaustive :: [Prop] -> [[Prop]] -> InferM Bool
+              checkExhaustive _asmps [] = pure False -- empty GuardProps
+              checkExhaustive asmps [guard] = do
+                canProve asmps (toGoal <$> guard) 
+              checkExhaustive asmps (guard : guards) = 
+                canProve asmps (toGoal <$> guard) >>= \case 
+                  True -> pure True
+                  False -> and <$> mapM
+                    (\asmps' -> checkExhaustive (asmps <> asmps') guards)
+                    (negateSimpleNumProps guard)
+          
+          checkExhaustive asmps1 (fst <$> cases1) >>= \case
+            True ->
+              -- proved exhaustive
+              pure ()
+            False ->
+              -- didn't prove exhaustive i.e. none of the guarding props
+              -- necessarily hold
+              recordWarning (NonExhaustivePropGuards name)
+                
           return Decl
             { dName       = name
             , dSignature  = Forall as asmps1 t1

From fb39dc95decc793cdc1586124c683329c74af2bf Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Fri, 12 Aug 2022 23:05:21 -0700
Subject: [PATCH 051/125] constraint guards example: inits

---
 tests/constraint-guards/Inits.cry | 34 +++++++++++++++++++++++++++++++
 1 file changed, 34 insertions(+)
 create mode 100644 tests/constraint-guards/Inits.cry

diff --git a/tests/constraint-guards/Inits.cry b/tests/constraint-guards/Inits.cry
new file mode 100644
index 000000000..02aa8d645
--- /dev/null
+++ b/tests/constraint-guards/Inits.cry
@@ -0,0 +1,34 @@
+// ys      | zs      | acc
+// ––––––––+–-–––––––+–––––––––––
+// [1,2,3] | []      | []
+// [2,3]   | [1]     | [1]
+// [3]     | [1,2]   | [1,1,2]
+// []      | [1,2,3] | [1,1,2,1,2,3]
+
+inits : {n, a} (fin n) => [n]a -> [(n * (n+1))/2]a
+inits xs
+  | n == 0 => []
+  | n >  0 => go xs' x []
+  where
+    x   = take `{1} xs
+    xs' = drop `{1} xs
+    
+    go : {l, m} (fin l, fin m, l + m == n, m >= 1) =>
+      [l]a -> [m]a -> 
+      [((m-1) * ((m-1)+1))/2]a ->
+      [(n * (n+1))/2]a
+    go ys zs acc
+      | l == 0 => acc # zs
+      | l >  0 => go ys' (zs # y) (acc # zs)
+        where 
+          y   = take `{1} ys
+          ys' = drop `{1} ys
+
+
+property inits_correct =
+  (inits [] == []) &&
+  (inits [1] == [1]) &&
+  (inits [1,2] == [1,1,2]) &&
+  (inits [1,2,3] == [1,1,2,1,2,3]) &&
+  (inits [1,2,3,4] == [1,1,2,1,2,3,1,2,3,4]) &&
+  (inits [1,2,3,4,5] == [1,1,2,1,2,3,1,2,3,4,1,2,3,4,5])
\ No newline at end of file

From fcce470d1e1983b51175552a85007bca4b3a9651 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Fri, 12 Aug 2022 23:08:00 -0700
Subject: [PATCH 052/125] updated docs to reflect new warning

---
 docs/RefMan/BasicSyntax.rst | 8 ++++++--
 1 file changed, 6 insertions(+), 2 deletions(-)

diff --git a/docs/RefMan/BasicSyntax.rst b/docs/RefMan/BasicSyntax.rst
index 43acef714..992f9eb34 100644
--- a/docs/RefMan/BasicSyntax.rst
+++ b/docs/RefMan/BasicSyntax.rst
@@ -56,8 +56,12 @@ that constraint-guarded branch and so it can in fact determine that `n >= 1`.
 Requirements:
   - Numeric constraint guards only support constraints over numeric literals,
     such as `fin`, `<=`, `==`, etc. Type constraint aliases can also be used as
-    long as they only constraint numeric literals.
-  - The numeric constraint guards of a declaration must be exhaustive.
+    long as they only constrain numeric literals.
+  - The numeric constraint guards of a declaration should be exhaustive. The
+    type-checker will attempt to prove that the set of constraint guards is
+    exhaustive, but if it can't then it will issue a non-exhaustive constraint
+    guards warning. This warning is controlled by the environmental option
+    `warnNonExhaustiveConstraintGuards`.
 
 
 Layout

From 0b28062396b41f2f383a0af3a0d6c60ac4beb7e2 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Fri, 12 Aug 2022 23:10:54 -0700
Subject: [PATCH 053/125] fastSchemaOf for EPropGuards

---
 src/Cryptol/TypeCheck/TypeOf.hs | 4 +++-
 1 file changed, 3 insertions(+), 1 deletion(-)

diff --git a/src/Cryptol/TypeCheck/TypeOf.hs b/src/Cryptol/TypeCheck/TypeOf.hs
index acb53f66f..75ae3354b 100644
--- a/src/Cryptol/TypeCheck/TypeOf.hs
+++ b/src/Cryptol/TypeCheck/TypeOf.hs
@@ -116,7 +116,9 @@ fastSchemaOf tyenv expr =
     EAbs   {}      -> monomorphic
     
     -- PropGuards
-    EPropGuards _guards -> undefined -- TODO
+    EPropGuards [] -> panic "Cryptol.TypeCheck.TypeOf.fastSchemaOf"
+                        [ "EPropGuards with no guards" ]
+    EPropGuards ((_, e):_) -> fastSchemaOf tyenv e
   where
     monomorphic = Forall [] [] (fastTypeOf tyenv expr)
 

From 3698ed08a3c107865e7f4039041458aea43722ac Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Fri, 12 Aug 2022 23:12:48 -0700
Subject: [PATCH 054/125] Inst Expr case for EPropGuards

---
 src/Cryptol/Transform/AddModParams.hs | 3 ++-
 1 file changed, 2 insertions(+), 1 deletion(-)

diff --git a/src/Cryptol/Transform/AddModParams.hs b/src/Cryptol/Transform/AddModParams.hs
index caf2ae6cf..ac0ab35a8 100644
--- a/src/Cryptol/Transform/AddModParams.hs
+++ b/src/Cryptol/Transform/AddModParams.hs
@@ -17,6 +17,7 @@ import Cryptol.ModuleSystem.Name(toParamInstName,asParamName,nameIdent
                                 ,paramModRecParam)
 import Cryptol.Utils.Ident(paramInstModName)
 import Cryptol.Utils.RecordMap(recordFromFields)
+import Data.Bifunctor (Bifunctor(second))
 
 {-
 Note that we have to be careful when doing this transformation on
@@ -257,7 +258,7 @@ instance Inst Expr where
          _ -> EProofApp (inst ps e1)
 
      EWhere e dgs  -> EWhere (inst ps e) (inst ps dgs)
-     EPropGuards _guards -> error "undefined: inst ps (EPropGuards _guards)"
+     EPropGuards guards -> EPropGuards (second (inst ps) <$> guards)
 
 
 instance Inst Match where

From 19d4724e852349d1694495a0ab7f4f684c538dd9 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Fri, 12 Aug 2022 23:17:32 -0700
Subject: [PATCH 055/125] showParseable EPropGuards

---
 src/Cryptol/TypeCheck/Parseable.hs | 3 ++-
 1 file changed, 2 insertions(+), 1 deletion(-)

diff --git a/src/Cryptol/TypeCheck/Parseable.hs b/src/Cryptol/TypeCheck/Parseable.hs
index 4237df017..377f16e1e 100644
--- a/src/Cryptol/TypeCheck/Parseable.hs
+++ b/src/Cryptol/TypeCheck/Parseable.hs
@@ -63,7 +63,8 @@ instance ShowParseable Expr where
   --NOTE: erase all "proofs" for now (change the following two lines to change that)
   showParseable (EProofAbs {-p-}_ e) = showParseable e --"(EProofAbs " ++ show p ++ showParseable e ++ ")"
   showParseable (EProofApp e) = showParseable e --"(EProofApp " ++ showParseable e ++ ")"
-  showParseable (EPropGuards _guards) = error "undefined: showParseable (EPropGuards _guards)"
+  
+  showParseable (EPropGuards guards) = parens (text "EPropGuards" $$ showParseable guards)
 
 instance (ShowParseable a, ShowParseable b) => ShowParseable (a,b) where
   showParseable (x,y) = parens (showParseable x <> comma <> showParseable y)

From dbd7a662ca7e1b580e2c14abdc734e1887e862e2 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Fri, 12 Aug 2022 23:19:58 -0700
Subject: [PATCH 056/125] exprSchema EPropGuards shouldn't happen

---
 src/Cryptol/TypeCheck/Sanity.hs | 7 +++++--
 1 file changed, 5 insertions(+), 2 deletions(-)

diff --git a/src/Cryptol/TypeCheck/Sanity.hs b/src/Cryptol/TypeCheck/Sanity.hs
index c93131e95..8a3954f90 100644
--- a/src/Cryptol/TypeCheck/Sanity.hs
+++ b/src/Cryptol/TypeCheck/Sanity.hs
@@ -29,6 +29,7 @@ import qualified Control.Applicative as A
 
 import           Data.Map ( Map )
 import qualified Data.Map as Map
+import Cryptol.Utils.Panic (panic)
 
 
 tcExpr :: InferInput -> Expr -> Either (Range, Error) (Schema, [ ProofObligation ])
@@ -269,8 +270,10 @@ exprSchema expr =
                            withVars xs (go ds)
       in go dgs
 
-    
-    EPropGuards _guards -> error "undefined: exprSchema (EPropGuards _guards)"
+
+    EPropGuards _guards -> panic "exprSchema" 
+      [ "Since `EPropGuards` should (currently) only appear at the top level, " ++
+        "it should never be the argument to `exprSchema`." ]
 
 
 checkHas :: Type -> Selector -> TcM Type

From 3de78ab125da837d38c564529482af7eee540488 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Fri, 12 Aug 2022 23:21:44 -0700
Subject: [PATCH 057/125] freeVars EPropGuards

---
 src/Cryptol/IR/FreeVars.hs | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/src/Cryptol/IR/FreeVars.hs b/src/Cryptol/IR/FreeVars.hs
index 17e0cab41..9541a735a 100644
--- a/src/Cryptol/IR/FreeVars.hs
+++ b/src/Cryptol/IR/FreeVars.hs
@@ -116,7 +116,7 @@ instance FreeVars Expr where
       EProofAbs p e     -> freeVars p <> freeVars e
       EProofApp e       -> freeVars e
       EWhere e ds       -> foldFree ds <> rmVals (defs ds) (freeVars e)
-      EPropGuards _guards -> error "undefined: freeVars (EPropGuards _guards)"
+      EPropGuards guards -> mconcat $ freeVars <$> (snd <$> guards)
     where
       foldFree :: (FreeVars a, Defs a) => [a] -> Deps
       foldFree = foldr updateFree mempty

From c33c3fd1c4f394e93efca8793a1df671ff0db1da Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Sat, 13 Aug 2022 14:22:26 -0700
Subject: [PATCH 058/125] updated docs [ci skip]

---
 .../_build/doctrees/BasicSyntax.doctree       | Bin 46803 -> 55003 bytes
 .../RefMan/_build/doctrees/BasicTypes.doctree | Bin 25202 -> 25225 bytes
 .../_build/doctrees/Expressions.doctree       | Bin 15422 -> 15445 bytes
 docs/RefMan/_build/doctrees/FFI.doctree       | Bin 70142 -> 70165 bytes
 docs/RefMan/_build/doctrees/Modules.doctree   | Bin 62110 -> 62133 bytes
 .../doctrees/OverloadedOperations.doctree     | Bin 9549 -> 9572 bytes
 docs/RefMan/_build/doctrees/RefMan.doctree    | Bin 2936 -> 2959 bytes
 .../_build/doctrees/TypeDeclarations.doctree  | Bin 8391 -> 8414 bytes
 .../RefMan/_build/doctrees/environment.pickle | Bin 125722 -> 135351 bytes
 docs/RefMan/_build/html/BasicSyntax.html      |  39 +++++++++++++++++
 .../_build/html/_sources/BasicSyntax.rst.txt  |   8 +++-
 docs/RefMan/_build/html/_static/basic.css     |  41 ++++++++++++++++--
 .../html/_static/documentation_options.js     |   2 +-
 .../RefMan/_build/html/_static/searchtools.js |  17 ++++----
 docs/RefMan/_build/html/searchindex.js        |   2 +-
 15 files changed, 93 insertions(+), 16 deletions(-)

diff --git a/docs/RefMan/_build/doctrees/BasicSyntax.doctree b/docs/RefMan/_build/doctrees/BasicSyntax.doctree
index 921545827c7eb89828cd050367d240c61688fa03..e7863d45c651b4e6d286c4af197f953a72c9f6f7 100644
GIT binary patch
literal 55003
zcmeHw3zQ^Rd7frwXJ@DPG1^^8AP<Xb5v!eD&2v|8?=I-AMbgMf3kXZA?wanJ>8kDS
zYPza-X2c2vvXDf|cFv*0+evsu2gTsTaY%wi1UMWWFp4lf;Sh72gE0n2Cd5gA<2X*p
z_y4!<y;U_m)m1Y)D;d}$bxqy6kN<uD``_2Yga7Dj-#Cx|1tVUwYB!c9%}S-=RxGa*
zY^k{AcHL_Do%eJOyrc6_XDk?QnTwv=Zk4T0a2|4$t9Gr@vKpO}onQxL_wAZD8I~XN
ztg>&r4OP54SlwJ5I@uYk4hMt2?bocxr(oL+re~LpdzKr%xzwS2$hPT(wM6YFzCPMv
zcu?W)U~|(11b(NwGZ-!^kgEg1<`B}^U{lR*Se@DSoEa2M-*4G-Z66pCMgw-mBj|_9
zHPiEuh`$FLW?lTXrP6NdmpQY1s%6bno^~+gn+x=*Qyr;}R<~7OQ5~r63GSVGgJ-q8
zsp?$KY?P~(?^{zhg=F-m%B|(5@75;DZlhuoX-xjx^IN9f@VzNO?@irp&EIJ@rkEOn
z7?Ujz=)Lmxf%aT=tKftt<@qup*mjczBw8j_><I#1lt|QcI|QJo1<<qAR}yKemw+DC
zy&(Ig_<tY%-;e(f0N3i}jN^pJUL6N0LjYws*j}@Jt7X=Tb2YboD$2}}d1J{qivKS+
zmhu0C5}Xz38lugB=(TBZ1j9@9+I3#jB<b7IY+0c6Y5X}j?~*`15o`g?7ux0m(uP7(
zLoBQILbZnf{i4}gAf^*O$Etf6k6|>*c(vy&MSx&iB}z$C5@bbsgg^x?1d2c@yc#*N
z+_a2)Y>1HG1}2I=$#hMhIkZs9$FY+Uj*Wn0uTiq{iuv&c<2vK5=J?!0#@M{wFw6tS
z(PPGa=1F5t0+XIeLq?oyq;ak~TfM9LD^FBkulZ8FC(ekSsDr_cF=E6AnI=3<Cd~`}
zWW+wDu!FEqVaLU@Fmx?gpBte%LK}@++hz;4feq0`K}rryh<^Yip2)|dcSTtAGFGZ#
z*fVpXWj3o(h5F|8Mnou$Mcc0$rbgc=n+>DwSw<s71SUoz0+j$F<HlmuE~8M(GHUiI
ztI%*;b+cxOuf~|yrjMRMqF~h9HQ%0?Ymp5zO7?uIWLQh2aUN{T0sLLIn!e#zP5QA4
zT!-CQFqC2Q7@)as@OYEPEp7{SnDu7Ox{e7vR=p^A@WsQhqgeQ&LILUdKva5QVMn-|
zETY%3(8<Bd$*#CM7z{FFq<{{9OBxS!w4>FJM=MLW?;oYMA$}JHZ{9dgYbtMGBS|7^
zvo6hev|oE)*biKcVyucWD_O2t4YHDr&_+V^$woF#n#RO2<9Nfj7OYl*GA((=8KYqw
zJ!(u-mg#~a{!!vFLnO|iBc!}zm6qEyN^hNc2*nOa{+*My6bD#7KDSPry(dDn_p7dD
zeAe|XX&Y=96#Q3jx-H*q__bxDV$ZWI`^J3BtxN3l71C%t4-lTqF6NTmuZ}>jJH-aL
zvp*BR_Y=d98uq+V>cVtl{Tcd_jq~TaSxr4M65m><5L^}^r51uW9d8&VB4=rwdI*F2
zarndKQ&x+*hKB2-KZEmFhi5K?h3IwEm??$*l<gH-)?3<k%c>Z@%Y7RvQoY3h8qnr0
z;8#HMS5aB0eoP7FW&w;8x6J_UI}d+ASHSx4qiEsY_VTaTULMGdpl&V5Q78qeEs|sk
zEkQ!v5TWG^^__R#S}@y_&Iu((L63|{46<3|@rYb$72OuKof7SMqJoQ&H-P*)C44FZ
ziI(tdJRAKn3pe${`{D7(Q5~5)w*gz{HjL9|t!=^iB7r9*@FtZA7jzApV?i_(%$rUy
zFCx>Ms9i~eetTY5!kAy1DA`k>xh<CIap*>Nd=$ZhgL$a161QxEakwixK6IPAXq~oN
z<K)1SvUf8)7^RxE+VTWO`f!syW?sZmW{W*tLJb9WZS|)K_Hbc|LYLTVR1D8GY@gj+
zv^Z~;S2bvw<J+P@YIX(jba4Id1n(kTA7tbt+XsNDu88@5U!rVpzEf+=_d{K5Sr3}&
z#)Gw#PRDg9<cP#}kh;`q-6Z4NSUbMAoh?>tkb<*UXF6>%8vl2!ojQG!5w!5q1)gjg
zdu2ppF{G(jh&OQft5~xU+0sKA@Kc2SE=c4lBF<EgWW4wC{`1beTet@lq4cgROc-(u
zuhmu#ZrK=n?IwAlWTs`n&2V8c)Q~w0W_jaq-sNbx1W;i~N=J^;?@{`-{PLv1VH#bN
zVb*LD(L*)|W(}qRLthNXD;QCuwwjBvF~-(#V5n0-&!CE~XnhixoPfu)>OkIb=P^Q$
z1_QjR+pfVjSs1!i&9>*;r!9bpfw>WPycX?R%|HOus?+G*HJU9DKzLsO&G0OrDp#=i
zl78^Tj7Z(%2I8mW{0jTGpMwAmdgBIcSXT=mHr&R91}IW3Dhs0yi)O2VxB&r+J~Moy
z?h`QhEw@%9le^4z+G?D(TW*86ji`m&q$npUDp8?Xw{f$={6@v!TRHGink*E;J{R$1
zaycV{6l{-4ku)@kRMo>dpCok}b)L+lRn8|Uw}>}hkHR0pE6nY1P|#8y0ZA#r*10wa
z;CELNilGma`Xp5&_=B^j2WL|Ya_NBJgLbxlW^kfF*WG8IK@mf}5w$~Tzm$;pm`6fJ
zQmW1XUNkt|L;uG_+1?%rwZ<Mv|9EtiM{nt{Y$8i7LFqqoGy%z<oh3+|Z&O8rDu7du
zGdEEmq1r#1Z2y0)z5TWHJo$7^S-D{2+v>u_Y`(;`DES4Jj#Mdfo)HXsnzK5e$3w;f
z?mdo|v)04L0vqe-Uv)>h?%wq*^{qL2)~d49_ul#o;%0GNvJjWe2s(^=_x-)1DPjk?
z9m2CDvfA3;d+FaRn&o$)&lbgCPA|e(DjFY*bZ3`lkW<;)?d|D_Yxb~Pa7m)wRD)i{
z3>8DlZb5Wt>bwW6?t(_P{^STs?gAibF+waDi1#O}R~>8?PJ1Wlo1ldT&SwcY;rmn9
z^>6UntEqo2@Dam=)tjQ)|B0@hMiw8=Q2PhDb}`vi-6Ph1=thEz!*M6AQ3;31BKYNX
z^xV756dBWnBRXVCnT4kb?vz>h&3Bl~ZW~KoC<t&-AYYYV;#5dtMxD7_f`jEbPEnQM
z#ThpN4&7xrpvbK)x7|e4c0M|=_IR?~Z7rA$`#~CsVu)X%pswAh&@hySpp%8@sv9vc
z&tqvU4T|Q&=$ySVjJnn51!{D%a0jM9xM?42oy2IICh0{ZXt3_$4FSmpmz=W}>;?^*
zISzm!q+0V6YXUR#kxxANU!#ftZcP<bQ#H)+8)8<*#3Y_+Fo;RAOd7mS!md!b6^n1=
zT>d!1rWO)vHFuE!yiqK7iUQ(^`F?b2zo7a#rMgz4mQbRmQi&|<zvRT}EfHmc66uMV
zYZ42-5Sm%6V$A}c%e)Zmps|F%AC!y23WWv!uq?HG?G-50xL0`_@Jh3=8P+1*8AnoE
ziV;`}j#LS?s8UF8(T&OXIP3%IK+7o2mkgRGQ11&RD9-hWz(Gq2LKEjKf6>B{0GYS6
zP)aoblusFw0^U&L35wj2wQ066BV}VvjbS#MHJj!)gt3Vj0$$%kT3RYGd$6#F*X|Wy
z`B0r)B*cL!ssPxr`QcdrgO@@g4!SHbD?M1!a~lUT6GpoML5@P;$!{b?HsYuZ0C*`$
zeaV@y_a(~pb~LCZb~LufSQvpk@u3%V3mUowT?-5BQ)`Fr;#CDow-Kad>IHQQO+UAG
zs0W#*5eUPCUeKh_@M~*_W>2cZMWF1Fu^03ywEXk6L%%g*4kEC|lGg#*Pu33EwQDv_
z5j@sWNjI#AgQ0MeClYTDhLtUp7G#iZqlSa^bn8HTn3QTooMFl>OcooGg0{1|-XNOV
z4PYHuOf_(?%mW&aq?CcXESt%Xz?`*2FMO7@NnF;|GpT3Rj!)9KIM0&^D@H^K`k)5j
z!2|#|t{s4GL(^o(rN>)oYZBiGu;sudwkmpaO^lQDfJ~>PjJ{~plQR0+a-&=4xm2kI
zIzf3@PF0BYd@lOX2&}A1@CfVyz@q%B;LCEP5YEwhLRm1p6c9-n^?VZ(xV-kcRGK;n
z=Y<?B3;$DEp;S6JRe}#giR54PD383HH8S4ez*T`Ngg-=X5>*33b_4BiP}LcAa~XEm
zz*x%1_{?n0*;q5)vTMuQ9XgaBB`t%&T1tb+z9O>l>74=+WZXO0ENCX#+dp+sx5#Su
zP@;Gy3rB6Th1(HlhORqEe#rtUaZ*8ga7x$4kp9DUK?)0&MMQL)LDmvkFq?{EHkHKe
zW9!1~^=Dt8mF@={P<a=6WwVVXl$0g~(x=Cvb5jS!Vgf88Fym&#I5<_9nu>gl+K57|
z9A0LHavz*pQHd1GbJ3KdK8yX+tZS>QWrneBB}O>4>kpBqN#CuwonV+AMcTp_^^tbV
zO>71kk%J&*sGeh0y#a00392EC-ienu{C}KBxM|Os^E{Oh;ZrBtWjKFC9}p*`3H4zG
zTtsCfiKyq#5-rCqBYKV)QWSg?3A#dNz<*6tvpOp%Iy+3cMcdK-JFU+@72+JtPkR(+
zMD#TnF)MXfES{QRewopodchEO5b~zPU~6RmAP1tKBVa;Gq7kh;TH&ytQ@Q}!wTPyr
zI2Y8Rr#Kf|k5k0dp0}|%Qc6fHO$mx~!6v5KE_(2$$}I6Il9drvf?W(ZDlhlG3!xj?
zB_nVtVc`fiR?$#@Pk|c5Z8+Xhu3{5b8J+=lD{+Kn-o_@(f=b2?DHNg=S8zPAh77^k
zn;Q#Qk5e_UWC!J_rZ&RFEw4=B+p$uqSSlS5l@)Y|R8{Cnr(#7-=&UHhWYcD?ioIa_
z<As$KBkTkqC<KH+5E|Pr8oS4(D0Bqfs)+?(UK7=swL;xOU>k8-tY2kcC)_<bPD@*n
zu*@LQ!e!vei`kG7OUAG_4Q^R$LIjB_1&#_~1DS=W((TsrqKn;T+z;K*wrl<b3f<Mj
zE>YiYd8Oh3?IN9dG5MhtJ9u&7fZ!TRaJ#u}gDg5yY5Iy9ayCf^5`{CFBx(`raZzw$
zBSca|xIy)=mu5%SMY9p?-iT^j1l<*%vOo%5RovaLD`W27wJu0~;_kV&0UCqg#c96_
z&1tb@*FBW4>TR(kZ!YO!+ah@P%nA@InK>J55?y-FT7yC0XjeMHC8t6&Jb`h}#9U~G
zCtPWU*&&!C0EF=gwqR?oTRUx4I=A<+UFe6MR$X#HZ(XRWJ%==x<}D~GyJpl4PSE0B
z9C%>0A|58BoxM4P=*lK9?u~p5UUswCEzHxTk^W5bX4UTs2PY8dzB@D7$%A{Gato(v
z31~cuSD>Ir8?PhI82Cre8TrS4`h#YBtyYmf6lTL*^gKi#>5u)CP2{3iiOSimQen@w
z<oyi&>it88(Ss&}<~_NmheG%C!Z5r#!IMf8i`c~unZw7(aT3W>BOWJ0KSG4oasrxf
z=2Iym&1{YGUHhkr<P;Z`9KsYAwWoT81Dl@t6xE%7FR*%=9=TlEf2T^YEBg*WuA^o3
z6R}zL2w9A%duN319Z&g%u9gUVAbf@0|Jtpi*-Gu#!P&$TUc|K;kV-XQADrV>H4(om
zi1-ynk}Tr^IbZz<gh~>Vjn7ax#EDv$9}_`+a}G17G`YGc&n{T7V56`Og7+Y_+G5p3
zsa$oNlU1)o3qgF^wm_@!uPazJ&njRTZM7N&d%gfq{4|PUX+^o#u2_Y-TWQy<g4do4
z|H6SURtww4a1evFNUKOu#9XMGc#xg;muWEtHlooNF_VsgMM3POE?`$l)vmyINB#5m
zQcXNs;z4cKvA^ats>CR!PTOn?dO1&_;x0A{b86!K=M;M-U~C)z1k%-O)d1P4Zwg_Q
zA{F)x|CB{*GosTAR&+m8uzhmUC`!K}T>7%wF*{Bhbq8By*Uf$OUs7|gy!|5)DW)dd
zbIz~fi;V1seW&w8BrVt?o0T1lPEe>je@pd`I)6ittOhFDDSixve~iMwUv-N2-hrVu
zRz}4B3B?dep-RY?Pz}VZ64>xH)CKV-)ByW|V*i99h$Pkq`4##i|D>l-FO{M+kyBWE
zwT_5f*x{u92|Wv6g$k>0O5a2Z>n$mn%78zF;))cms}+6?wO{59?S_0M^$!{N3%Zg$
zJezb?dcY=N^I&fiAPzCwgq>~RO5y|~tqa;|;q%1~cbp$VM=WxZo!`b^><&dVU9Fi+
zbB!V<hg_rJVjReW^VRgxFqPumGP|2N;>sBXGR_NV%L`uCH6w-z$VPC9Y%vex*W(_B
z=o&+>-IL4uu-97+D8#fw)v{aYnmiZLC3HWwzbxkJ(4``n4h6Kz7GhD@HLnYDTurzo
zbWj)aq5D$#a3-5C0!D~c{AL!Yc;~vVp5}R=j~fG*k{@Ru$PH6?DLt~<(W>-O{&~c@
zb4N1B1dn(qp@ENt+Ap{(9Lq(hssgLsKWb>N5zt<h3)+#eulpT9dl)6dE{|8jbpe&e
zac+$wjVnH?bJmihMv6bz7VU~(?c9EVdfVdy&|A1U=XH3*ySz*_?Oah4#-M``3bV2j
zwBcZ&<u0yB=MxJNG;S@g_!M!>w@9X_E>|UJ;x`3O4SM7jmEQ&NPcb!CAI1^7wrFIY
zvpNnQ3Bu{o#P;i>3M(N`q-yXV6E#0dk2Qh+PKGH5_}ZE#<%KY<2zbm4wH8HIAx$g;
zb8clNL&qEo8RPUCOQ+#b3ETdTg<-td)RObN)F>hwuwMhnqk}5k=lmXh%}Pc&pY$(K
zD9u*|S(I)0JqXOFdgqq{^Au-IM|QA9hbc-y3E#AUe4S7lb-qTAteC~XeJ(G!nFQoX
zfmv?WV$sC?a;`JRSz1n^zJR;^_a~?Ff0Ty=lDU7~8+%2q&w$SVt#^LO+!q81QmsJ`
z=I-9i%-u<k+{`6#cc5es*^Ps{(afE?znj|fS{eC;m^*cULUXUoLjuX%ncmnd=Kfny
zYqEEKNv+E{>$)`e1fhhpXXufexdiTAdBNRK=I$Y*j3r*B(q8d6s$TKV_G@f~MpG7P
z+WJ>)-#(p(G?M8prV50pFS?Z-FQ6EGi_&@pJOsLeXK!*l`4fra>Ah;W9HA>b&f`>-
z00_~A*t#+9-6C+HA4>xAp>qYu-YA0x@Rm@^Ppuu0RAE$V`B@OjMI#xFSdFu$tK|sA
zV)d{|j`xEV>AI8sDxo>*d?gRIF%+K7i$W@Oq!+f<PWI|j3EmSl^@#X|u;Jwx9$1-k
z<kjL$JdPX<U+LLRi7{O+Ju%X`q{sEcJS3AU`~p)ep~6yS=;P`-3~+#yRN=lO33)wl
zC|)>|2KNLfsljkna4d#`V&%CQyUrCD#8XL({$ok)ef9dlC}`paeK_-H)Jf+Jkwr=o
zb@E4Ett(*n{Oa|=6S4PEVd=u1V^J`UCBZm;PQZYfXXTRY8NgeD9`~IqK#nQx244p7
zmH?!_c0f`MnX-{jLwLTQ-9~<wvz~P`9}t?O&b#wq8$;nSl+4&u2^3PPvtBa~eLHg|
z)c=@^;rupXC`QTsXU-&;{pmdDOOyRnZ_E{?o&k-Y?44h_+8^hv>CEmij`}L0g#Mcz
zxm|4n_u0JQZYX2X$vx1OuRkCJ1z-CfNU-&Xd61WEeW5qrimhJ&oxa~YzhvuoIcqvw
zH`T0p75We_+9}(%g_&BQM{cGPutO-BRa+U@4P`2{^|H&la&??A47K&L%Mxsz%!9sU
z>%rcbE4KatD7C+Le#zEXbJldW_R!Wl2&GZyb@a&1SOWLfyx?vqW1+2=cI9i05Dc~T
z(ga%@d61WEb$a8i*!m^VX`y$1$<_*IT^CyeLJ7SqJ#w>^z<n$)xEspWeHi$JqbM<q
zI;LLbyYw<w#yu#jbo}~{B?nEP&O;)}{HK^Ys|=dxW0dGIcYvaAM<S!9{v*j@)8`Y#
zGYy-10+e*j;Sn<pC1D2emQahYpDRF)L<us0w*(;HJy(Dni;h)5k)&(>leGhqsvgQv
zJPXZx5{+c+DL>9x(+x#xw|?O;n~B}@$ZaMF*z-{`7qF>xSg#YlwN$#C11b}t#wUyc
zdIx-$BHwp;Le8$vLk4LI4l@N-F$MH7O4zt505}p*DnF3`=Xj!UCPN^=Nu{!qwl9N$
z(+qxk)!~fm1ZQ1`v{ebAQD;66UNK<Hd4Wx(!+NFd670!lX~P^ELVD<<@H>Tmh+bCd
zj=*x1Q4*NkrTp$Zq>&Q%E~d&V5=b9YB~VTPQu*X8--i>0)5Ro=!S@6w*%g5%pq--0
zzJwZl`kVlPZkbpoq3EAV+Wya<D=?JkfFu3;l3;v&?O>!TgVM7<goZwXMlxFUhdJvy
zjKcpQghrkJo(HcOus_HPY$_erYZM?y4|I<g>?{D$aAf&FGGMTqK4$HKrQ(mEP!BdK
zN<9Y}Z|j|34nc-FYdTwdj4WperBP>!9$7JqfjgcT+zn;yXsPsCn0DCq*M`r%Z0Yyn
z!B%6XuYr8hp7gyoVb$)*Ll(*KyO<(m7mP^!o!>xd`WmHl+}VI&65tY`{?{fUnoktZ
zWbC^`<XBXffT)YLmlUHeXK#WoOY4FnIt?wSC3=!YagYeRHwn<Y*A7ssJStIt9)!9B
zjr7oDshP()Yr1Bp`uv|HgfPs=gI5gLkLLw8l@9AQxVy*N4YRd;0E!7`8ozIo`UrMz
zksq~`MbbcpXA@M2>kK@TGza}_iNcvQhFZk>Qiy&;g{7?a1V<uA<=>`};u*c~tR0+G
z4k_mU5eW7l82ofh!|}owIBUA3_UJ?Uwz91LG!JGmaQ`kZxT%zg%W8VoPtXdvQAe!E
zTs>>BiIx&~ZttfBpErpzVhOS?L%R^K5W5hgn+>VNj3^OVK#v=&apScv?40IR`Qg3S
zdiyLdYnR(+^`dn&vtM70oxJ(^9RV&b46kbq_tU2AI^3fUNjQP69uqa(VOG=UCCHwr
zM=m`Fah(u`Yv_^Lp`gPvu2dy>$Kf|(`vLR`31T-J9j$X32VPlN;qT($47sluOYL#)
zFs@jmJ#=op*%oIcW1|4wsHX2UqFpVXI8p*fl=5*D^Wv5t4+kytCSMPiJJD8w@V-3g
z@{0?ECh={8#J4Dd<=Kz;%?PQ{>mPz>CRQ3p7x_m-LeW@?#06bHYB1j{z<g6KFy$iu
zZvo5`C<zd6UJ2q_SK@CYZ4B4+TcY;Yt*AZIn*OnsHI-J>lz$y}rUm?u3Bo>_i?DL9
z$A1A~-^r+F>K@)MsFb>7cj!)WjEfWu^{!>%9}AE_yk?L;kQZcaTT>S8pUF^bxM)8V
zmw&c`$!l1x506DgIAgAi^DNOPoc~J3J-?iXc5*E8rQQgtp7`64j4$@iFJ0VcIBUA&
zu;uznh40yuqM;MCY<!;(8+HDI9+`U#Db57+ck%+ANj9Dq_~l-&A8|+H%pKaMnVXCv
z57W1-$V=u9qEL_Vh+^({K&SrR`6Y9IDv(cA`>pr1=Wyy|nJyua{Eek)7VjtYMxA|m
zu#AEJs=T0YG>c_?IL_i*3Bgc*lTqX2d61VZzPUHvica4Jg>UGcU$Xc$oHbp4cih>o
z`8d$sF7s6rlFP|t&FBR}a@4WtkyV^y2+ZY0V51o=BkyrWKSl_Kj84YmpU8u}Wb~uG
z@m6&D9w_|I-uWe?-_BXn8NKBu?3VQ+imVefbDt!{Mx9U4BR6vi=#S<FdPA8@lL_5}
zz|Rtfg1h}w$sq8T^Pn%;`=#EPEB5{+DD}nO`6YXw;jHQGz4S)Q##y5aIKEG?nNH|~
zWE;5u1xEx{jCS(?D>ofxxoc%+9mDAQ6#)N5f+{g}3D74>J))RMQe%FYD4gz@hBH{y
zB8O<U#jsG~8pPAPz?dpsF?M{1+e!y3jHd{8q*g5h6zlLX_J!fI7@3{X?MiO@k`r`$
z=v!8;m127_3T5>$UI2wJ>YZPT?QYJRF1AB=(wQ}FwXIyeD<(U?OlXZd*U}>^c8awG
z@>O|3-cZ)UChhBPlkOu7Lz}cOX_HRoL0>ZW&Al;Kl==ZE^~T=$C3ElLtm(|%E6og_
zWzzPHF%huAH8Lhf4UGk1kzg+}<kSN3RwBiyvrLcN0zqh=&Wq+o3&bijl^-GuLxET^
zQ~6tY(3b-7f!>%af%qXP_1@n3r9ixgv!)Bgj+>X7IMxIQ<HnuMM6zb}?-P<ZU5g&M
zSxpFhCNBaT%4#h3t1TSrYS_O;C<<N=Adl{jc}n3=^AJEX`#<-_T`~KwL91`{&M%q$
z$DB2t*}o*UzveC=j_X(J#u(jhXB<*$pO!@n!T%xTN1gvokK95)i2WolVjC(1bQKJp
zKhjkUMt3MN7!;?JC_1np?4j>ji68~xVid~S$Nx{z>!RNIr6BC)tm%TV_Xe9T)BwuH
z7$WXCVj2N?)`YRf<ueCxinMY}FX)z4>q5}|J3ziRL6?}<6l{yOCWp9Npk@q!uAfPK
zL!zp5pD=V)seLh<ctBSd^Z~P#u%$|u(nw;&Ra|R20HISV7?E1_dYw{Oue!O^Rcu|N
zS!lhGN0Wdl`j)j&wB8$cMXMiyR!;ByQfL=AYr4=5-Dxh_^>$rKi+Wf3==>(3HR}92
zJ+i7~4CHs`1$o2SYd5;G_jd?I$zHpWVDG=oLjY-$KGhp{MXR5H%1`yqFWLJfXYIva
zyAfw^_^#ReJfSt}JV%e*>?M%Dk{9G0>`l)a&UuRojn%VuoAVYka=Hx7d0&}2=N+Hb
zjm>!nd*sCS1Wm_^ndit6(fWj4mC?`{^_*||WH`+ur_6qzKikGl0(RNB!^Sa?CMNkq
zQC|5$Gk?nnGk-HZGBcm%xCc}Tp5y-8*c|uwBq-q##_B?bMfgWP?&!ol26HwoqrvI#
zW#6og%Uc=fH26Z*S~BG=4LHw1+zre(N3dUoS#lEx#WIox&Wx?lp{#X2W*6sK+P+8U
zxZxz%>k6gP^c+G%bSAHC4oPm96t>(5XU)-Hi*l5o?gFM;BE)HWD1`oi>xsZ74%4GJ
z(_=3Ye6_)P>3{@Txj@NEw>udSC?GCLY3-k$(`X1^Fi||+PY4|qYLgw6?J@T2s)NLb
zOmISUG@P!kjNzPK7o1ZJXLgy?jR(1lX2Ml^K#=eL>7=W3<GOI&xl)ysNea4r>;kX0
z++8NcRge02C@C!!)?f5I==Xx?+4$0UNsf2_r~r3Nq6w}U%tab~D*l~)eJFiDN<(hd
z3BbV*4_$eMJi%5yarM?s;WaiPl!fUo`MPDBn-Tw}Rb>XU-N4pZTGhg|d-&?BbO!zl
zx$Yucturm%a&saNRdrj$dMn_T=J{y<X!h<|C9!|r&{kr^rlihNu)3k^eZ4?bnzXKv
zmvfcya`frBasgi2iMdjV)MWztsLp#|k29)Qbbu>+cyz*%&eM<`yMgO6Ff|L8pn$6%
z4YgK{7Q>kax^c|u)U3t=jjHWQYjRv%r^Ki8lMjUv_I-_$qIWKMbVpOEL6<|(0k>hf
z6+Qy3pJP`dJkr)^wCi&?*d0ystx)P_?@)dxliG$wd$@?oJ#DpWE?kw0a1+E;PkhWg
z`6W1-+G@1`{(Q@=)8$w`PVOexXR&IRtAvJBCCW{gLQNXd{)qF<$+vjxi%8l?AM>Ju
z0lWBU!m7pt9~iQ;5J>AWfHw_1tJH5KDp*~)Xgyr$MNq5kMHHyV65^%n#g)T4wF``~
zJJlP?bLdMBEI*P5G`@0J!S%(T0ZCV;FZfx&ri&bC`<vpc+_{yye`#m4I4du|BOK`I
z6T^8_sRn+lXHX<}o*~&Abv~Cz1S7W=+_{sW{;W_F<+R*8f-YftZf1HW;$=|Zk3Ro8
z<Gw3Sj^pnc<6vla$<zzG3&&&T(BXu?BMQwNqEd&u7Ft@h&{b6Eif)ApN!S#8Z#5s9
zG{!>W8pviIFpeHG%mU>|{sVBPanv{t<Blte=q@vu9$0t_{X@ezb~FqK&rFA==@+Ew
zLK-EGY^nc{rD=8hoWc2tNTpUja(=Ep+s@C+x;Z~|r!@jFu7S%QWyk}!cr@MGa>K3T
zx=38gjr05w455`QxN1^;z^yk3LU^=(i97`gZ158P(ozYP`HL2UC%DxTE7<wANu2G0
zL%>-7O`}|MJ*p2UgB>fCCJWsh2i;N^2Mj@ygaalVr~=*Q$ya$|PlCALvSKZ?a7QH+
zm)sa#EAGf!>B5v(Kyvm86zP@ENprAzf1a?JvF?6JclXJ$^A8f`R+n^mBHZ0mOYDYR
z&`k&;sCWO~1=hIxgb)nLk@TMWk0g(c`)MAKrSqhq9!Usj1mG2)vcO8>tzbQKOjpO|
zW7qjPVwo#oedkL+Z<IL<UJB53;fS`WX%5Y3UWaD)uP8exM@Gt*>H19(%9$pn<B;!M
zypP0Q41)D?l#az--f`rNvGl+LR~eVn;|lROBpx$(%ot~mNvGy&cp7TfSNJ{%v=l@Q
zVbQ}>l*`232;t#enW%x>Cn@GH0Z0_FS<8+vtyVW(89M0*&9y*LCw<M??xcSoowU3l
znfqn0-E6uo%oNOrtNwLZi$>zqi;4*YV=SB#5JBn#;{}e;Mw1Z}#wE6LzG4j138DxR
zDZCJkdFaYqL{|?Kgwu;Y^ZG7;h-<OKn}XmZpi2+Cdg?u0zSk4m1D6XN3PHaN*MS!u
zp*{+J$hi{gpyelyyUM8$5o<0afed3Fh+lZdAx0rq15)c|>lCfDWjfJEZ@E6_)&OCX
z{0<qJ>`vPVFbv_$w4hV09*gQ(=}5e0olMj{MX>IwU@uN2tj&r}HGN*=WTN=$$`px6
zP@C)u>|7y>5$w8r%mi=h{6=$K@J{Ddk_bBa%VxorbWqyYemCi*J+dxrr*bNH1lin0
zd*X^U>o6S>)xOAW#B9pnyDm(Bi%rB!)g(pe`Vt2;3m0Kt6&ITtHRj?c*Tuyf&w|<3
z00n2Ix-1kyN1-TUX#kiaPp^w2TcaJ2@_m9>au*1-CzIwHUzXc7zGbDOA`#!+?VEzw
z`4b|;sPoNS)QGsolLYI3Lg|=m?9EJ19zqOl@{n~n>deBGr9?#BW~LuFT$o-uJUz*m
zdCN@5Kta5#$R(bcnz<^>(u@TCkYy~E=Ku;Edf*C)@Qc#6A}Gt&_n025_t+WS-w0i`
z(2)Ck?OAqzgAZO`t95ZOlapA=kRxhEvr*#0Nt$Ex#9<Vn*IbA=c4FcTJ07gb1x(GA
zN_X>W9kW&{X}7Lax&_l@KF!gYb-TvrTyV7q^b#8ToWZEAL~srpg%16{ga*dlMXcS`
zw3Cv)MJ8#WS^S1}t|7)j?X&Ax(5%t*2GP`>&|-0S$WsaGAiwMS7|vf>7o5Ag$cs|L
zpxf6jaBJO4GssuP4RU05dpE|8_t3PmPy`lq4tgpIgis!!tIp~Ap_WA<T<rd!(_6af
z9pB1odsb~3L$!O_m<v{8E}B+uSq?6vh5mW8^sP)|Jep8w#0I8v;ap*rX?4{6CS693
zPUWOKPom3KX`mPGo-AO+It|1qluXymDpdGFcbuow2&Zhc;$GO5I9d*ZRWg88hZE8f
zSBQ)vb|g{B>NYttilUZT6@L8l$vmw^Kc@ufB7NBm#kH#$ir~G}gP}j<HMmNl)l7%H
zsl8MxQr{@nfK)Lngn*GXKM#$^$xftvg|IA6g{rj?#%cQqxGd9D5_ihbP~3ms!rBvP
zr&%%QupQbbLvkBUIg<V0MKD-|Rd3cTPcJ07EE{|g&COZ@#C$_S3*)Mc0Vt4`Jw;zp
zx52%{1Bt?!RG3<16+U$?iK!LmoHpBq!r8?2HF0t6y#jLR4II@gN@l5dg}HNv*fr`r
zn2T$X0mTgj)1qLXS~3t^JUv&O#y|YbOk+?`yaoU8bMy5Ql$0C_IF_f!x$f1aD1&nz
zfl(7W*ko4_lIPX@>s&q;sr3BNW=u$%AsV2Q_X7D%cGVuf?O*-4JgmZxRJ;xGRl7Xl
zEjN5@RnmJ9L^^`DVS1v%0kIK)m-P>%ZKn%1dv3c`#vO~}G*Q_X>?pUf-mT#m!}Qr;
zn@qux4OVA1*y33}&3SvBU}wcGw|%?jO=5W*R!=l4onZ4D$>e$ZUht9GV0gi5U^|2F
zworb!V*2n)VA}AqRWwsX-KX%1)ma2hvE8cSZM*N5i*siA6n*tNyk{oZHSfAUd>||G
z<@UZ{y9etFE)<uroU7hJ$_~$O+07!hao2&5hx$fEidC~XrMQTVp2czvS4{$5G#3_7
z3ESX0VTPf|hY;ep#Q<UYntB}!c3Mj|2n7$X?a54o!C=LjYcHU_9gAj*X84f<R=$pu
zVLG75B8)nZ2RrNr4g@UXP(PRUmv@5Uwm&~{&4g#;?^nb>7O@D?Z51(dU#VFw5Sc(N
z`<-CKZTs<B2Dz3_uqW{)QHAq$C|IyV)T?2TrC$;MkSH9SPdIoWR23wu0jCZYo|=t?
zwz*(|;uXC2Ta8YzyJeN#R;5_6u-Ku3W^AVPX3U7p15HrGt`x;oOQ*Uy*kQJPx2ThX
zej5_Cz0$5Xi%RN1SWd7ZaIFUIk(mufI0e*gc*K64)by-&#Vsz?NuJK9DHP8tMoY4k
zl>H(dL?YyKq*$>%@|A%|2<4E}hU$2*4aj(qf3YhZQWIt?&fDm!J5czG=r1(lSuHw@
z3LK`|Dq#86mbs{2A)-4;r64)9G8QUOxBbqY=kE`8G_7V)ota6<Y@-yKYGKU?US9S6
zrgz=c6q3Ek=CWUP8<TEpVX6~cNI4k*=upwO;6Om#I>8pCPwbn%0`%O`nlC4+rxacN
zWwLr`s!1Yy%4$vGaLaja13Eud_3Je>Htd^o&?4-X?cBa4*aMlY7nOP{1d3jhB;<+U
zd||GNRa}@}<4e<nO*NN9f18K-D8KlYHuTy9p?34TcrDgkjGqK)_mrz91<|aQ&^J(-
zNl3F<?IxPo0qA_&2mOT|cmmSnma&Q#G9V4ZE;1D!P790Y!&V^(FRcY;ZQR5r2{MCK
z#TBUVGC-(WmXAg*#L&t-RkZ4+T`S^r2wLpJVDF@wiRBm<&I_CNM6gZNz}0&wJzzCX
zcd+#=*doje^ckXQH!3!i#V`71Yr%rKf*|b#kPtN=CKh#8ta-2VP$$?GOKq5SG>v4`
zHm_bTIb|&`Lh%qD!t|xw*cREOcCzDC=!{n{*i8GZDpZB@Bc$NN3*y5N)h51-IiG^H
zaGt_X^;fHJsy<SE*tx$SDQ~8q(g1!=($6-ObcX5YGxYPX=w}9JxAA$h&L|Em<Tjl1
zuoT7lzu0o<e1huzD1O?(Ftx`6big87oUQ)qZ1s^@Zflm?ndLTSx&B$MdzR~coa>zB
z`exhJy;K8(yA9w@R3EOMWLT^35`Y#7ZU(eWaQ~Eko~IuMd4%AmBXAu$BUga@WBQ9h
zragoVGB5OWo}v$r($C8YKh8HsS?EMw=O=_D?NfB#PB_!f5a&<nhn8D9vxw&KiUsFy
z=r0P;Iv*s8uxAx)kLnULd3)IwTj@xDMGBcrnNLVfG)3ftEJ62Zepjg{XT2bisB#a-
zY8;lWa-m(Z`qBHfeClp5Ox6{CIWH){pqFv76STGyY{k*VHK8SNAck%X)89k#_idnl
zd%=6Ob2p4s(`>=qLAX7rrD#~$_h@o;7(M;62TLbYwd*kmSCX~@zdwGaELP-C-iDB9
zi&WeY3TM1Zs?4h>mLg(6^3>wwY}>J2G;UelIVD%>eQ=O}xktWWFmx^Yf=wj(onX`P
z*<0?S{#|-yu#n_--To1Zd|WH)3$`jsu<_U$j!R*@7RYYU#zz<K7OX~RmOR1s+~ofU
Dtv210

delta 9796
zcmb7Kdsq}lwzmsrnC3Y+$`=^|%EQ3SFd%{=5z!=SjDn~!7$YJG+O!dQ`iN$M#aALm
zu<#X41mng;lPEjJ7+16Eu8F!EuU=Pnz1eIwyI=10t{at)BpX+wdrsB#O!qMQ4gd5^
zSN+a8zjIF2>8h^&;(fo%-x6JeZp+ytow{6M=(v=bHD%Q`DJAozvWk?amdvkPTvkzA
zld`b9R;nvWnP0u4vUbUfj!nW#esoj(U^-PdR(OQA=pr4ugquV!?Uc;Y4*GSNg{IaR
zbdhkkmS!dHAkscMZSNQ|c?caFIKYvTR4)+eBT56T^t>gCNT*RmcM{+q(MPQ*M(HCd
zO7fE)&6A?@>Pn<jw8)x3q$?`audEY$qfS`>bxnn;vc>d9F<p05sQb35y-}wuLrJJW
zJ8NuCUMG^R-cdssN@VPTYy@q$kEYw~6Vb!J+n*sL1R9=hGo%as`Y{I=q$GJ)G)Zml
zUP^IqRCVf5GDnT7vJDKB{*7u`n0iu&(lh<-(Jn5{g1v1`TVvbHZHbZ&Zy1Bds5G4g
z{;j2N4|^K&R}~*kL(&q&Hbzn2%q$EDlg#oaY+<R8Y*O^(G{?%cnS!a^)yfkjX9)D~
z!)@eU=Bda%mD>e6AwAtIcw@Sa9QOp@N-y;aUYKDc|K$ljpK(lRrwzsoeLAB_PmZ`H
zT%(ubV(7(@ar#W&czfhBa-Vq<gWlXh-j6a*#z4HbCpiNn|0K{8naQRQqIm1}>!-|g
zGLT>f6~96V?U+7<-U<};IZP?tKI+-<+bZ4M_)nwqgftdgIm;@JMcrn348bAAV*9wu
z8e{aN<1bn764Mk{tD8gkISZMo;V^~JJJ}~62$np-DLEs&f|uu5$Vw0JTUT=g0tUVq
z+d*2eFOj}Iu0VW^I{+Q}Cz7zg(U`6u4=z1U=%ObY#iP9c2-6mR81HzfrvRpt(6lFy
zliw2BeRyoZWM|XJr)G!;xfm#k`F$jP|EY1plYBgmpCSH(_g!<x>>F%xkH?wx-SKz*
ze}qOFZ6Ag;M_&Nez9Eil6Jm*=r=26?%yp7g_V;7a_Ykk8lO~OSvIE4M4U5WFEL&1t
zTGNK`0SJ$tT*q{|E!LIDhXAY$8%Zw(6t*SG9};?LQmSDnw-HaPGHv~3RRETOnjwCU
ziO+mWU_f+^Orj%mBNBOQzkYQkWl{{z&mo|z*{{5Gc$+*JRFz3_g>CYm2(8OaRig9_
zp&#Vh0wzMY9N|a5&K(?pQ26gK<c$*y(>R5xKp~k$qn>#{o2M=^l=8k3=u4sYe7(L2
z`ilH$R{jEG9q+4#AMkOhA3c<xCAu1EPky6e7l*vAsMf6o@onHu480ZSZ`{JWH**bJ
zf!lI3^`D+%aPW>!job%{oamB+ITdSY;oyy~?hU-5+K>Kg`rwFGxbqA?nCjjfO()L?
zvSq*&RJ!HApd_S6ifH!B&K~2gf{-<{{8yl36J=+m`ZKfF5*n;q4}Dh^>xxrdpbEm`
zbn0e7jNu-qb=Tz-%H3Av6sNlU(5ZN*Q<u4x2l!C@YIN|NlzH>okTcfPw3#+C*k4_D
zqWo#cMvMMcFg3`ZPMa00@Qd*G;3wul3&67dq1dD|i7Y0eFpB_HzB7xV(FF!SBo$U*
zBgGn0g`89~SevaORnUu611I$}P6{PfYDg9IffSCeFJ~nX;N<_jjqG8ZMmW>?CNm9*
z7Y4i2jyGTu`_yX-^r{Use5mp2O@G=jdw}sUXUz2>(mdNvKJy8=7m!yyk;-G^H6XH6
z6RquxvNFUL7Y`SI<hFm{(L#wHO|-W6F<R^A<Y2VU&9MlPblOx~pfdO)bm(iO)7J=H
z@A%9rv<NmYGD>_<2IdE7|FX~~jPVIsI@c!TBXXph2Wr8r1*)?ah*|T->O0Ud-zQru
zi)=!jPe?M)F0AtjxdD(n5a}u+5%kovv20b)0*p;M^$a!g2stYVq}Om1<7}3XfQk$~
z3OJa6!C4QDpe)Yk$}wowDtF~j)xbaL=!O!r@IM-lx^%3JP_TJfL-L}AB$l}!ImsUw
zNfhYOki6(SNt~}wmj+ujCHfIP#DJG*VXiyptUyQ7Vb3Q!*UWMRttznUwg3SW?I?&-
z>YfqgmAag1$V6>sc?3Q6LI%SQN32rujQYM*yl6UjL137M>?}PUwZJUQR`Ys}@!AGf
zXQ+AQt9Y3y268#)wv=&0e2to0ejm6&AkDgY^Wwbbd%K>7OOe9sYK~hO#~omksyVjw
z;&_yEJi<64-l68$(l?Iu^YUaYH+RczF#J@h?4tFv2P(y;3r(svdRRg>$~NJjy(E-U
zgA%;d3|M3r?)iXw18_##I@dLr7=zyWhQ4SQViBh-^SjVvw#?VTu2#ORj^0I8^fC?O
z0@%pQp^fu1^oSiDfRkStdKdc;x{ftb^!vsAF?3>u1?roMP*H%oP#2+5kJycR$pVE=
zE22De-T+>67%ye|JP#V&)2EF)v6(r6;7uAQo)7SS{@`RUseBBb*idN^j;I;^Qscxg
zy*Tmb4Hn^SZxJP9D8fg;?kWq6EtR)icW+>PH4Z5sfCm70&jYB$Z#RVGpeBCrspBU;
zYG8xFY``U#4$+U$R>@U=-s?mBU@b^rs`aQp*#?^3Y9=`b)yo9=aat@{bsb<V6OAdE
z%>XV+W?2Ce3pu+NI6D-WrDm65=v#L4m&Rds>y}zbJtLIqTzai!mf;~z2CLUzcn3DI
z*K^G3mf6T=ro;YF9davofm>jeVwr{P)r4au6<%}|7jMR*mfOe?CZf#pmFPL2<!=GQ
z<?1ljF=zOqEK|I~?O*00MDRs*2<!S7!fPwWn0ma#1LiQftMRHw?Ugr?voP&L>9lHB
z>FRMi^$Xy6OYPLRDyR6vDOqGA*9sbJZ2f{ViK4oMeaoB^T{{^ZE#f7<34*;@$Mk5r
zb7zQH$y;Dkd16(PSjg{S&w6uJB-uk~(96#VGwE|LuQDv)CQH%eKnY*X6l05fW53^F
z{#m48sO7k7g_`L-6%<DJTrfe~r<!Sd{b<7)4sK##V}m&4Ab=a75r9<yRJMl7wtXpX
zb2I3Y2A#71ZRKFzF**_71UNUr&YtF8YUBs(=dcDE8xsr;PO4M!fL2cTCm*ojDzo(f
zw+f5H?#)s3)5ciCc`kHTBXmZSkpm*jfiolTu)a*^ZrMrpzk88Qd<a`yRam{QDtbg3
z-V`Z(4{Tf`tQ*Y3Ui2_T_=d)r>n>+70$(*H7)*g|c!kp;D>9fsXrOv%U1yFcOWkW+
z{J}v*n#o>i4iBU^R!0gMV8^|=85YQR9s!<qW>yKh6<F~S*|BDVVFu?ojd4V9o`$0p
zw79p+K5?{o<yaF)FRhJ)XSAAQ73X*q%vNYPE^=|~ZjGYt>rxGr^K4~2QQ$QV&qaOX
zNq4Ug4%aMl9iX4y*zkz(p@v~6XLt+@exPA^z{L==z5bO1!)4C!5@U!07c>kH^nqdV
ztBF<(yB^fd_X{M&bHnhxhH*D%d>jbe&@jHPVZ3ldi77ltsXXo%uCN9nkwNO0FX2Hn
zyE&D>54`r&q25s1+T?n?U+;ro7^?kMK}L9nxr>rKF^J}Gj3kqoRb}Hdo)$M*b)SH>
zC(xQQcyoX<AG}yGVqS|C7ornpxh#mSK2V?p1(fY%4y{`4+D<-v{KDd6P{LfVqjy~p
zwQVw!S2PsYFp4L^;?LC->s=Jl-8-8K#C@FNFE~XM*n<LOiyxi(^CaI2fY+7LXONm!
zGqpC^NxDE^Xc{J*rW>0cQ-bwt7nAPRDb#;;w(d08{+nWZ(P|%UcW+L@HP6?pBWM~m
zQNtR$k|iA-vd*geEodcl+B#R3?z;?Q2yW9!^#9gmGgvIb(DA&rJ{kuNG2*;=%gRe@
zC9k=e7)(>QMAPeQSrE+Yh6$h2+;y%X<OC}t2Dy-}rKU1y@m!0o*qTWyf^pa<IM-r`
z;xA>A+#B>}AqiJ=Wx+TXz)tA;$CSNJPO$Hl5?|YXzAY$OGYxhkE$3_7#l_3rM%i0|
zHyAl3?mJlA&jOXL>bO&vuQ)r7ZjTjzg-Xrx$H8oNpa8sgS?8L(w2!3U+u=d_3pMHT
z3J=m>YDiyYq|XC~E;Z@P8q(Wdj}`B5(ziKj6oB_IZqk<-X=O=vjV}kBOR`qHV@onp
z=|{tA2hv~fG%M?|ViDG3gXrCz3xxgbq@{6JhL|40B9s;a5#py)DcIs(kX>-x-xWnn
zV_mK8Vrk!PBa=eZ#d2&2ZQY&b72E~jIiBEA?MuCaPq*915>IeKM-~ACF!T~GLQoW*
zP!At)Hgl}wX>lX>Zv#`NKAgG&D%OWMChhSjWJd^|PQ^{;Z8-4VCo_03Gor0nIg>f`
ze!OxflLA~$4szVyyMUNFy@aQFpPd}jIMEqG|G3ZA-xCbS+ymbkN<L>f&|`t@3~?-Z
zXO}=g0Nwq{CwCX_&lj(AcmKbayWfC{{|#~6+dqYne>vUdZN1$c`7n2Xc>k`@KP*%k
zBYZS~2mXhK!h!Os*OQq8VWD*Hp|K`U9PZva57`7O0Nraf01xOK;T2riiSL!QV8_YM
zD1m?whUTVEp~-YiFw8;Da9DxbG^cdmL2E&%<BY=s-zJ3ek-*z}hbHr3q1pN2EMjW#
z2o1Un6GeDM<3&R#EkBy&6$}$a*yRZx^zm}9;JqK)goB>ofMZL&f?JMR;0dV?W<#i>
z``C2BEBd+P7U7BqntpWrO|M|-gar=awW{g46LtcQVw&Jf1s^8tj87&Q^kFPbaLBPQ
zxxf1?HJ1pWLI`vG^^;J6^bdnHjf-=(^-j~M2c*f-c(Ow<S<r;X8?=nmnZj_isk|Ss
zgwegHZC<ex&ZG$wJg`%KGn#-%qj9()HxQ|&ggDOpra~|kc`=3xB(;K~Fvr0&gpeYq
zh7hNQ8=n~kQ==CR@L_=PDryLGKCcmk&ue<~Tm{W~H;~>sS4kR~y2o-&TpjoN!S(X^
zdAs2qG-j6HM&0W0N1%$g!sxKy%_fIg^y8gP9?|zNFCCWpfbhdff0=N>vF7)Y0xW_Y
z9iLAY$h|PfjSKhv>RaG^y||`XUtPAK91i1O=4at>BpLy`S?CC;C|+E~dlKcVz*6o)
zs<Wj6sYz;(n_)>Uzk-)cP$XyI<!^ZT3NMAQyOj6fKX!u7j?QgRD&-`+TmnV)@&&lo
zHH&Dbc12|wQs9R2q}h2=Qyw#s$JFOB)p<;99#gqqMs;~iRbHJm1Z5e&VBnW5HAsbw
zoV1oR!>?;(EAqiFQ;=hQKlq#i{xXvIwF3JT0KOi8e~cu)Ct)1fJd(Q*(utR+5W;ZJ
zBBTg!W6>>q10o;5f9vrgLSceO09;<ee+77n$2baj3HTJRkl+n}_>Ke{Y2%fBL^i@6
cI^N$bFEql&J(^Z_Sp(|u-AI{{?&%u!ALQIrhX4Qo

diff --git a/docs/RefMan/_build/doctrees/BasicTypes.doctree b/docs/RefMan/_build/doctrees/BasicTypes.doctree
index 3dd801ff1d93233c1b6867805c6885f0f90fe074..faa49b9be86c82fe3d1c8262696b6337ffb89e27 100644
GIT binary patch
delta 82
zcmex#gt7A|BTED8)Vhr<K8&{E`k}?CMaB9VNjZsm$r-67C8_!@`N^fZsd**E`pHF=
h1ts}8y2<%@DVZgi`FV+8c5z8jVkS_2a~b2G1OOKfAano#

delta 59
zcmeA?%J}IBBTED8)bx!kK8$J(`k}?CMaB9_$r-76`Y!p&rManjCB^#bnI##eN&3k}
Pl?5gFIh%VK|0Dnaj(8T(

diff --git a/docs/RefMan/_build/doctrees/Expressions.doctree b/docs/RefMan/_build/doctrees/Expressions.doctree
index 5e3e471791c0d8676c94d53ac8c12ceb2260755f..7f983f0ab9a15f90bd410c50cda93d3170ecc200 100644
GIT binary patch
delta 80
zcmdm2akYY_fpx0aMiw7N+X(&8;?$yI{fwlX#JuE;)RK}^eV6>?(%jU%l4AYjqRN7j
f{2bln{JfORlFa<PL@>L!q$n{HD8IRk@q`rs+XWwF

delta 57
zcmcawv9E%qfpx0!Miw7NHAnr>;?$yI{iNiK)I5Ec{N&Qy)Vz{n{q)R|jM60i<f6)g
MlKh;_y^JTU0AxNDzyJUM

diff --git a/docs/RefMan/_build/doctrees/FFI.doctree b/docs/RefMan/_build/doctrees/FFI.doctree
index 11ab9115773e9dd35f957a3097fea5abeb36ab53..6c6039e60ab7b41b271a6a00e5f0cdcf8f452439 100644
GIT binary patch
delta 86
zcmeyjm}Tk`7M2FqsmdE!vKVax^h1kNi;DF#l5!IBk~30EN>cS*@{>z*Q}arS^^=P#
l3rg~Hbd&S*QZh?2^YaqH?BbH5#7v-k^AyJIQy3Yu1ORwrAY}jm

delta 63
zcmbQbgyr927M2FqsXQB5vKZAY^+StOi;DG=k~32C^j-3kOLJ56N{aQ<GfOf`lk}5|
TDho>TbDCE(ZePvFm?Z!J(+C#W

diff --git a/docs/RefMan/_build/doctrees/Modules.doctree b/docs/RefMan/_build/doctrees/Modules.doctree
index 59d46a4a18d616f61c880557e4bcc131a8dd2eae..49bf0289b1b12bf3373a07308147ad92771ea3af 100644
GIT binary patch
delta 82
zcmbRDlzHn@W|julsjD`!xG>s==!X`k78UDfB;_RLC1<3Tl%(pr<R_QrrskCt>n9gg
h7L?@Y=qBgqrDT?5=I14X*~KMAiJ3t8&3TLl9|0$DAa4Kw

delta 59
zcmdn`lzHA$W|julsgpOdxG<{O>W3Dm78UC!C1<4O>AU17m*%GCl@#lzXO?7?Cg~>^
PRTh-w=WK3eH24Srn#C5&

diff --git a/docs/RefMan/_build/doctrees/OverloadedOperations.doctree b/docs/RefMan/_build/doctrees/OverloadedOperations.doctree
index 0eff732025c7ea6602da3411098a4e4fbe8ab878..dfd0f3dccdc313fab25625daaff5a0a7f5adf8ce 100644
GIT binary patch
delta 80
zcmX@>^~8&%fpu!+MwSFd+eH1);?$yI{fwlX#JuE;)RK}^eV6>?(%jU%l4AYjqRN7j
f{2bln{JfORlFa<PL@>L!q$n{HD8IRj@vt%g)Lb7*

delta 57
zcmaFjb=Hfefpx0WMwSFdH81_p;?$yI{iNiK)I5Ec{N&Qy)Vz{n{q)R|jM60i<f6)g
NlKh;_3mFe90{~w$6{Y|H

diff --git a/docs/RefMan/_build/doctrees/RefMan.doctree b/docs/RefMan/_build/doctrees/RefMan.doctree
index 8cb0ce09d4a550cbb2d3ff742f0b328756bfc9dc..e2176c85537d4dda049c4e1b40924573fc7f6592 100644
GIT binary patch
delta 80
zcmew%)-TS|z&f>MBTE{iZLof5acWVqenwJGVqS7aYDr0|zDs^`X>Mv>NwI!%QDs3%
fevWQ(eqKsuNoIatBA8uVQk0kpl;1po@dYOUvgID_

delta 57
zcmeAd{~^ZGz&bT|BTE{invH&FacWVqeo}HqYM#DJesXDUYF<gPetKp}Mro3Ma#3YL
MNq)}e<%};l0Y;z|NdN!<

diff --git a/docs/RefMan/_build/doctrees/TypeDeclarations.doctree b/docs/RefMan/_build/doctrees/TypeDeclarations.doctree
index 6ffeda87862cef2da40b5ce373c842493a88631d..6741795089dc697a76fe38fcc58caa1be8fcb04d 100644
GIT binary patch
delta 80
zcmX@^c+ZigfpzNTjVuw2wz2x5#i>Qb`WZ<%iFwHxsU;<;`Y!p&rManjCB^#5MU@35
f`8m4D`FSasC7JnoiC}hdNl{`ZP=0e0qpLgs=`0@*

delta 57
zcmccTc-)btfpzMhjVuw2YHs?W#i>Qb`bo(dsd@S?`N^fZsd**E`stY^8Kp`3$wid~
NCHXm<XEM6V0|0E(6>I<i

diff --git a/docs/RefMan/_build/doctrees/environment.pickle b/docs/RefMan/_build/doctrees/environment.pickle
index dbda8b1dc7cd6b21f25a77796e51e2869c4bdf15..9a2bcfd9021a07bcd2e1fefa8d1e7e8e520cf715 100644
GIT binary patch
literal 135351
zcmeIb37i~PbuX-KG^5rs8ZEYETXxCgMUpi$T8uHq5|(Aj7LvxcER2XPch_{+OjoIw
zaaXryMz#``K&(fBA+$+I;NcLme1w<0@R7W1EU|%*<t5<@VaWzD36JpcLP8P}2;{y0
zIrr9btEzjtYP!ctf_`>Scimg(o_qFt?)K`wrypIibP4@)HrUfevobqsRL+^TYNc#c
z>P=_;T@ABTI2?HNw&sr4G%qx_JInRy>E^hTDOB_Inqd^oTGKf__6pmm*<;0tl3vLd
zje6Y}yStii5HNczUz?k*S4$)LYNcS-&1yyG?{>YWn^X=+_Si{d@`PR)%T7?k^oW4l
zO=qQD%X1s|cB>7*1SXT_RMS~2`|kc;c}Ns^on2KuXVhwD0hnB9I(@cLZ*b?0*}74&
z(G|OS1~eITX*gRStyc@xrcYHoDeLv3rO!5<%L3J=%zCjgF|AKgC)bODY^`3%){92j
zXd2D{NIBI&dDB^DRGQAFV!d3-P8+qdUNS3Z?W_r`o6hpDzwR|nr+>OuwTwJC*MCS*
zyXmaTSEuJ{=2Q_+FWb9&@19-SsiL9Da_y9%mq7}>Q7=}(!u8Rze)OIC*mRZvZp|ne
zx(#er?j7B;XLNVdSywm8(<Qxb*x6}x5tMK;S?^g>2YIWFTHeUojmb$9{a>B0mP){q
z>E^7yuU0T>M&WJ~c!T06o6d^Snq6;>+fJse+jXOsg&d$kAsfKan9Y|O1%sMHsU-eN
zAv5UksbZr%VUHFj@O|{|2eS{>t2H9!y6L$o7R9VxpDP(8y-Z9&>f#m7dj4tG^}3n&
z`Z7chi$-ZWJAr;zba2JlBB=+AfO;iwKxP|yiP2m~q?pZuOxzX;%%FILVxbBoEX6&}
zmGMwU@p{wQ>@w(X`4*4@4~o}0E6dzivkua(!gpXw(j#DAmKS`lxtPhy#k<bnUH#Zn
zdTR(Rn3c&Y(N)3dvUrS|#k-2v6^}dGeHBB4)EOEyAzw462_>yMsY$ULg({se?YvQf
z&>Gc-%{XR^>BdC1Zq`Ba;x*0&{^_!C(kwCV&T8AxYx&|RQ5z_3ApOaj6~SowVK<+2
z*73V}+s=CLtz(`kkJj=dD^O`|rBQ~aXD6#rn>yRCep^T&g!Mu3O}l~Y45~FCEl&Rt
zb83_y_0{zWpzaKuqQCqoldl$xk%>|@e-`f_H|@GvnWB=0v+|r?YM@K7k;Sd(?s6E^
z=J*dai`ziLDSUB;B(<`>VivD=R&d9u;<ZJsc$U5l7q90xiZ>K*6tDJy5c*tGK6h5}
z&+KFw$|7oRDPAdRt_E&;$;iTHl4v;n;<w$@Mfnw?pIO(sFhPZIU-o#dTCHCgecUa(
z@Hp(;g{F8>n=+tuv-PZADphB)la2G|=dv*26&pg%8hz2}mvy+`yNi3on*#)vRarhM
z?gYD;B!kjIK$WTmkP?d9s85dEHe#DoqTS-&;yzJ#O~IJd8>M=-RwW%453kS*1>jO)
zqXLD1QbMb3@Zm{OVLeqSR|^f$gu3Y!Y^~SKG6bVquT<+s*3+A;J+0@B=0(}4T|{Sv
zk+kK*;)}<bPtJxStZRuZtVd1|T%sw-Hssf-vf7Y@Fzn(@#q9#lpldX<6Yw>#_!9ow
zvxYI9ozZI*kj8D@8L}JG(=`LS;FUndnVgrQqh_T5E0nL6%T-tibPJXj<s?{62Ie(u
zOq-?ZluJN<1i=hE+Q5{7iGXFVXD3TK+LqK@Hw~icwK;IJ4Cf8kG!3cbw%1e;4A`I^
zMH9{OacXb9coy)M7f^zNHLy->y|Rs3$wg(LV%De4{MotYMXt0?{?3|H6*A;!#Jii+
z$Kc!)?4~SSDHPsi-$tqb(0P2z7K~~5sbfn8{U0tqB2XVB51mDY3Ah}HxBK=GKQ|r&
z5nT%+#cs9x2DHhgO{QM5vv8T_<ed9xH9g8hoN9I3?PaEcP$>(`jX2ANW`m~n#~P4B
zkJ1|g&$2p;H=O-rcf*u2xi<yNrBP+$<E(Pkm-T;{rNgQYa99O*4mu%(1NGr-Nt>HS
zL%>_h7S{80#cKqg_^BHQ+;isu$Bavy74)36+>u6}gO=i76#s&r2}{r3H5(9mDl6V!
zyhc=7&7fuY0Tan@3M||XG-1^Eu`vH=vSivtqXvf-d>$~Tns`3Quo1RZ>gJ@07o7e^
z<!q%o13$_DMdLO?Re1H{*TusDeyd>?=m`^9bS_UpU~@<C(G+SK?jwm^&G4L)s4B3S
zu96Z-Z^s42R}>%O7K;xQPl~Fd-}P!<O6YR&SfELd5q3%y^s3tEH;{i@urVlm779vX
zfiz&7xKm|aKF`jW1yX?};w^zX+c+p9xk0l+eqNGE6hmO)kYQDT0#k22!wiH19tlMW
z0#lffi3Y+iuVjednW<p_P?;iw49A*5<Y}HqWxXUCEZ$bULYhQ&<wAsHaOv7y3WFoE
zCCr<6i31MjYB!D&;i~3_JTjc(7i8QAH0m-=>F6~PJ<3>8ptXvdh7qkosTuYfeln?_
z<2YSBEWWaMnoEnXDt@2%@{;21qW&P)hf3CTHv|<0n+0eD#M#Dl0Wl^V9y@++M#MZe
z#BoB0dc(KyWAPGvpB!+>SkW!s$S{QwC*GQQwmkf*C?mJ&4>mCTkYg9ukcfEA*@%#u
zq9a)0=~}ir!GjPUJ_UOf0Q4k3FJ4u=T2v5WTu{Uq3CWr1l3ACscTv<A1*Gy>5j#LA
z`3*5XVo??aG)i&{FXR6D&%GhZiqSfZpnxDcPN+b!Dk3bUkSl-?>9PB+<g-AC8VeN&
zaEy>|p(L_b2z)5E5bfaIGC5WkVNWtqL3mX8rVuOAFtXk*KSk%Ojrw#04&Do<`Z$=9
z-P^!zA}~OFgMbCGD>)nPoRAjbB*_Q51GZ(OntWMOmqT?w*pVcVJr#ukgU_%<vu-c*
zaO5xw*Ryw#T%mZiAj}rf@|h;ON-l|l1eXz4%Wgp6DGaAKj7k-O2M_J6HAriSPKk!u
zQ6nm(p=Ql>xD5H0ELkHwl#+#*gvaSZ`<#~+>-A~-_OY>ip)zXO1*2r1tBqES`dDSU
zJSOYjxo^y{Uo-|@jFijBY7lOyEQ!W(1xEfsC&)Be=Qbs+Eji_7k8DRc^~jE<A<*|;
zE|@k(*>mi<mp$?@RXXEV@&G{~C=`(lao^pGI56({zVLH5wwKZYxwt@%e7*ae1`#|A
zl?7|uf(E(Ei=y@h_aU5mRSwFf)4I|t@-0$bui+_0B*GV6?$#-hsdGmbl$+Rc<Q2z{
zYvTt`9M<kQeB$8I<98ms`|gv6AAImYQ?$I<e^um6kcOb_#-`&3$M1Q?!F%xD@#A-v
z%+YFX%6(^z9IjWU$lo~w(*;DjU?c~b#g`TDWD(7XTEejNll9^WvS1J@wwp5ayh;?1
z{Se>E7_7kfmm1}YjA&&(fT~~|UT_25EuwzCI$bi(86}tmj`wIhB;x2zqC(hSGd>b#
zz=toZzzGriHj3A{h@x%8v4{((sJOp)fU8_4sstQ`8>(>eYKfVMlMV%;hFvh1N#ZDe
zn+s%e1Wq^)_L85H^`Y;G!l1`$kbe~!0#V>*3|t3J62mVC>hPEpMg-|3vj*yU4XpFw
zP^js?y2XE7GakdRy`C)^I&6gZ;!v;#q8a$dV@tW&KuO&!Bin&EK3p(Ut(_%c$NIu0
zlpn34<Vh~L!f!<u_;hfVJ-V%_bG57eYBk6xY+f0D(QW;nJ8K{1xSZ-14;PQ{J8LOJ
z<V%GZQe8<8%lcV3F(G4=C&0HVJddcc(T3QS4B?;LsKVOkTGisqi^mxJ2B-?BlA?;R
z-Yp8G!uXxb+=5s^_L5UR($0W8J{KI{>;kADg=N%rvxHPzLt=h~TbQp^F*x=H^e(Ll
ze%<YNzDUuM)4y~7$oF4&b55F|wOplQ%z)ltxU-^B!RT3-r;S`jVUg!2y}=sc#h~RF
zQt_W+Br!|L+nQ0YdxOKleAX;vk;&vx8O^zda0BHa;j-e&*5|V#L_BNELC6YXK-Z6y
z@Ki;o4)M3@BygXoR!ew5CcQ+7#Z@#gFe?;fI0H1Gt~Y8J2CkK9PiQ5EsTi8qi#4c1
zmh(pNGmQSayiEI`3)yq~+`+{adCoy(k!f%>P*#w3|ML9ww20rL83_hF#1&%6u!)M=
z5CWx$0UA@lw0aifql<_t$mr2)qJRa7<`LYoEtqpKr?W^dRdn>;KxQ|87Wpf?==Nya
z^c?cxl`NU)M&&W&c4+`v$kykk-TaXpSZ#*jLr*wA+^7^}dWjO9tGp5(A#e14!Y6V?
zxXf{D=dvYB2;WV9altr8*$hheI(<fE1bI}i+7*5^3B?_iJ4^TY)z<md#JIx)5NPM@
z1Vj-jF`6$}Cx=NRGOO>^U++UgeNNMOWdT?<qfF^Dwfu7bU6GD*t=>fs#1_9w*{r}{
z*UH(FQJI2`_GuF!oel3O1ipBs2PA-_NOK}%;1v$~Er=Ynv&J0~-V3hzG`q^LNa<aY
z4rnIj4xp?)G64>F)kJdaj1TKF9~So<!88wFox!n&T^pM)D`Q2oQ8!EeD*<A8aK$@A
z-aBrA|CZ)AgaDC;U@#1r6wxs{hUUZ3dz4rY!BQtOAf?Dt@<YzmzO;CU&>oKSxo*r*
z$1fy*<c<>DnDa4s{orH?5<Oz%BnvqE%DGkf#u{0`(E=pCf|<c{?sy|u7LK2br{uV0
z9Zwc8GSx~6E=)%L{MaBL>7__TQKK>8tQ9da4P5KcuwzSMGB`?>PlSQRc*9wVXbcmS
zh^n_b>*V-X=I~)y@0U|<?qp$cpty=M+s*(Y6_ILw3UU4FyL8*kKRAah2Tg$;o`r?9
z#nhqGe}WU!u-nUz963spa4<7>8wio$<~gVCY`PD6UaBHCDcpx)wENhb6U#7ode3gY
zr7=+)#{7djpExS~tUa1<9$V&IA$#CGEMkHYsq#9J;PP;xNt0nPL@0A-h`kpv0eozw
zml1Fuv%FLNEg@Kzeohy&Muf)3P$><C==tW*b76>^$CgLhr#V8r5Jt<c7x1{a8AU4v
ztmd)X8qOwZCn@a&K8u7%^P;msd5%FbGR&C4ki9{G>I{H3l&zweaJ#dPM>X)+;2+Os
zE`u3&)^fHDE=U*C7b{2@X{HjnWJC%yCPl^)G`{F;&ZE}ZtbxRNDT_FQ!~jft(pfW&
zEI$o%*@`;I4Tym!9^0dW3^Z^VgR!QXfxu?mSyP+L2j0EWeHVEm9Yd%*qR>&(s82Eg
z$mJLXb_9vuQy{G~D@yX9_=C<myuhY2J4+L2L^KK;?Z$-qbjS@RZKE_PhVU1W+|w~v
z!vh+G!OmrDPfVm$Y9v=kQjpCmp!*wxnQURkDXMYS2pan7%;NImn=U$Q-Rv;9i6mn2
zN@ooN$h!IShBJU*gyx%=an?CF+ItRu?!$ev&u{$;>w@>|OCNgLn(==9)o=fbHRt{M
z%6r~o&3eE7_tq8G<NmKN{*v{C_v>%3Id7f!fBo3Q4F?ldG&V#UhDHs=o1N8iN(jS6
zn&}qVct{rMJ?Y=uny+tS_Ip6idKQ}2&jF(K^Z4L`wMbo1NT!!&^f|lv6sndH{SuF5
z)%T;SvqHk>cUCfsd<rl#$?@2u6>@U0w_Jl}-o?U>RW*G^rqp2j2J%HL#6T1ZR#+cm
z@TcHl2>mr|ax`huUf<-`t!Jr@TI8%06LL-KqbO`l=uRdO?vhe1H#veuluDyQU<JPS
z3EPQp14w)OKPXm%#8RDx(_hyS!y$QZeV9QrU#*YeyXXz0Q@q}K4o}d5PvDQV#G0^`
z3fjU(%M$DNP}%wud;nwXf8sANwf+Eq0q9fW&mW0De=Podmj5)Y&*QI)4@uU1_ym1{
zichda;PVy0TL?ZR+w<Ua<q-@D5d3II<b0}j6j{dFBu$4Z=(VdTu>Ix&u_fJ`2V2i~
zDyVr+1s*GwFN|uW_4DAd*>})dz(XrowWuR-+^|3#$rjCn;}ve;d(vGUqMZ<HNfb0&
zR}+|O3&fP{<UE)Tk#=fI2&AAGQ!a2DT^Mc+CsV3o^g(k+zR_g6B}@z119le{X(GD{
zi=>?0ghg`3F2W*ivU{+ITI?Du#trkWL60PC>gtIGRz!(xyl06+wu_DLD$3Vqk*+Sc
zsOB$1Luer_{E(aMhZ)wVYWj4s#mfSjRbD*Msv4V7)y4<8WBo1>gw5y4#OxsVC&n*`
z304A?M$K%p^M=>pq#4`$;`P$b-cRJ^woW8&OM*D&fw+f3SO@VZ&VOvTj<hJTj<+g!
zpjCk&Vrvm!qZElQJ_caPtbd2(bk+_Rg5!+{aVv>iju7{3S`dfvqUe8-L3Eu9gKTXc
zbkjk$>gFP)0+*)~cc)WctRJq!`qA1ak)Fb`G7(ewvi`$~8;`K#sk9(^&W<hPSd>^Z
z^V%USti|XB20^>0p;MMKXl9%?^#qH4HE|a^Wzm(xNbwSmw3=DsID%!mgkywRznmD2
z2($j*v><xUtd+<0Ihy-WIO9GPZ20rU$al(y{$b3BQtJ_#|4HIDBQ*bPS`a;_`M@D8
z>*JJ^LUsSKp!?Dlz48{Th7nQ-3?h{Ox3pyQ-SEGr1<`ZLuRiK6CJPxOr9{yGhMv)X
z&9F#J)1tN*gL7Tth9km%ZCVgLXTi0{<dm1DR|*<!P^piY6*=arf*guY%v)Qq>S*Hb
zc50%uVRwpd1o)27x+%hU1Z#_s#U*?r8gwKvG7<J2N(-Xr?Az*bjDoHaP7JnU-aK^$
z>&l6{+9~U<8TPov0U6`kj&W9ER3eO<N(-Xrj9c$UWyfi?l#ZDtMbV<gf<13d+@Vg{
zGvvi!SRE)Zim1|?6Sp4W$Q#pw2y?_po<zJ8j!=+Mj7(F2@Ugfntyd*18WSS_(Q0Vi
za!j^8?a)|B#s)>r`b#gp@H>fl6E9pe8!%sb;kOdE6%nP6F^ClDh15jcaH@gT2{yaR
zlLl5@hR0BG6@<k7P2&D`NLy#)Ft$$uD|U!jcEngkRQJn?+mF!uOKItyR%X{9%wq*L
zEuGSim_{i~>}atdb*8U7fqF!YouOgf#b^Y<B4HFEbbsR3BZOX&7KCq|mNJNzW+W{~
z246vI<y$c%QY!c{nz%ciivIdxUb_!`TC(Hj#EnPTu{|w_FgsHC8{cIK?Mnf|$Ks1Z
zfxDe`UG*R>_QbZ`Pz)1zE(GDx#Dwfr5HiEIheJdoA5PqCL<CN!1<`xryVHtc;``49
z@n4&`3!M|+-6|Sm4u2qVvk~GykrqUl_$idf*FO<$qyXV#@tbLVunZY__InXS#^8Lp
z5;A_>3mJbsF>m6fin=ym$oMOX+lq+NFENM|A!AyHIdllCX4qfK+5eE5#*_<n{gcF<
z?U1m}hGA?CBAiCrsO@JHHy@$(r_+M)73NcdUEOwA>+i=zs5#pzPZBK_Ecv&@9qN=N
zL&IYETf1z?zb0-y!jXST3!>*789a&&RkPj_nUIo1N(DczTiKmBKVo~F^~2bNVa~Qw
zkZTh+9%0ATX+iXy9lT;zJ6ORP4svO1(EN)9wMwyI$dSYy>RdrMWvB-*lH~L!aStVK
zJ;ISY(}L(ZN3Mb|E}40=&dcergbeGfv6Nn{CRUi!wx-~dmAIRo^6BbfL*hBY48v;7
z0G<(+O(jMo!m>hI5ItwvhU0W*Oq*3#aTNrE-ki8ooib?SFs}t3X}>(>jfvZj@a4(0
zAbQT1!Mi|$v)aMhlsv3SQJ+Yu;K&COcc)X1tRLnb*CW`sEAfe_$uA^sJi?Cmrv=e-
zcC5j&6!$!Zkl$B}1S39^xFel1Vl8Ij1DHg(@JESTj&R`*(}L(Z7htBa<BSF>?z|Mu
zC)!%Qsy!r5;8L_?{_28T-%i}&PPw%WE9?ZuBktNE@;LTLy*eV#42y8^pA%yf;ov`}
z1rg?8ibR5+ix9)u6d-&oK9F`SAafDC@_q4g5$zVo2PM<`u9uqF*WaDt0rhmg)Wq(@
zZABz&gh4D~YGVEUIEH|BAZc{;84l|S%|J(rg-V}H+|_uMj*u0zE7KCA5f`I~3g4Hw
z^$4Mlrv>3F&r!jvZs#TB9BsqKsS+wPloG**bBVjrDIeAhW7{0oVhTJWEU*(d9AUw9
zS`a;F!FsF(#7TbS2oGtz6)tF9oM^FN#*ZcLP^ZioqP2knqY+vji_Livj{HdC)*~Eg
zrUlV4M^aC^--rMayGl7YnK0@zhEeg3+od&YhctHls={>ol3?G56ZgJT_T5B5rNn+j
zVn33XM>o?7wmc7%V<t|1JuyxZrv3_pSVWgHM7y?-T-LCL8|NU<$*+p~#FPsLd?9gX
zJ7vIzVLE3JIF0x?MHJ}I5;q^A_2<)q@D=DYf?eJADq_P0ZC1keR$Abyuq09{7_uB^
zQg&l&Ow`NE?HB=kBJ5a_xbX-(zI(~CWBFZXDAM95g6uaX?s=zruwr-u?M6s_ec}cq
zq~4YmM9(FE9qqKm4!u&GhX@x61{_P=nNArnh&cs;O)HCkZ{oHiyf~Z|M9+D#=?Kng
zU>`nRr5#8yK0CgO;7c`e$2#T9=HW?+*$89SiaVvm7(}>ZrUlV+?gW<VDBdCPT=3y-
ziM!A#AKEVAc}wDEBgB7GS`a-aesIyKyM9yQLR<yGj{lLkQ=PJ-vsI-ZOx%8iFTa=;
zM9=xMmQtXaJ%<yN=E|Y4DO4u7@u!Kq(kVCA$vvztE|QA=<mcxSHyvTbAEyP;dq$k(
zQ}r~N*Hv_5ty(4+@qZF`rE^Az6aHG}n7@;_=?Ejfl@>(L88P@k12+k1{)q+(D<Y+W
z8N;i3H<Wmc@EP&(iRguvxbX-(wx$IUW=D#Ay`S<IWBC*yd@OpDwOn}u6EQgcQjrDs
zp%8%w6O*u0ee54Di`FBYzdv!C5ze1T3!>*V&m1OO7_<5#SRiOWleiO|(th=@;bRe@
ze?4)#5&A!t7DUhK-+y>krvqSBq4%B&%Kvy`^gE^e0G8Q^_9JBf(Zr2L$o_O%5Mi>X
zuvWgo6Z2syK=@efOq&FfbDVr$*5b`^dZ%m!EvdEI+qC%U#C(aDC+gOG6Plk&+*U-4
zexE@sV)l8<z1Y7`x1O1_?n)d2s*UsQR6&Y5ZR!cd{fESz?~u^WmBYmVjw86R1vhAo
z&=E{AGXQ^=7>x)I{&!jsz7l;^u(4HEI`y>9I?14;Wtw{q4X?t5f-je6x)Vu86u=oA
zmaH%(HW9nJDRJ8oW(+ZiMO272g0>pns23uzS|rGOTjDNuD)wuK1zktP{U{OQz9@0a
z5#sJm3&NN5F~Of!lAd-8$hvz?I>lCt7xYk};KU<|JJTsA24R2*n~|1+{;I@nM|km2
zS`a<w#T5^@XV1I-A(ktxs|o(RI&lX(<<FL3?{s|EJGA7~g~V7yICVZPh%l#8#A$x0
zCk$f>5Iz?3c&XI7dw<P5hr2;EUNaoBq3c40LN@+;Vv=?$8-v&-#Mp?dQez^9|CYGz
zh(x?EEr^bJkv?J=$Bi;ZL27Q88KFYKj87--P3O$OT_(UrYH18JK9#ub2s3`4K`dg#
zupZ`6Y%__qi_v01=6_1u)lSJgM3Dny)Y@ZxBXR2yLVrCi2w&>ICV18D=wUOC6s8Mi
zrd)>=GoWcvNAPCL>RtuSmkpOCZmz3pF_5_|F$xg|ZA=Ry%%Bur#&=XgA5(zvv6#nE
zr8bV6?{^pYnCDyB$QE^koE%L|;ZAk<vSDwr58>9@VjfA1LPSmuF^EO9m_xM2gimvi
z_e(M5g5Fl*&UQ-g4ZPBXacWKLsl?4kXkADP!q)~}u&difbF1)PWHt4Qf8M_2keale
zr><bun-h1nQ)XQwhsHD}(<?a2P)d{JTy(|O8xx}vVce5xLG+w)n|*D<s$Y2$a46Di
zQAaT91BtuVDWfh6XcgA<dbmmI`cv`0kQjvsgWjJOM9&#?ePHJ?X_pq~c2ouH>=nVj
z&m``6r|i1{?DO^_ldg@#Ii;w&{ZV3!BHaALv><xU&8rUb+Lmg=ju^?1(zUHAc=zqZ
z-RzWiR}bqho)H5XGw}N7#E3*#_K#^n^qghef-Lg{x>{+qpSgqjf_>Ml>D4&lI)!}!
zoZIbrzA7;~5hh-d7DUgPcx`}*JmH`o=n&Gqd20&>-j%q!o$8+!WFX@UH4N}EMh9P(
z7?}wB?nn!w=j_{dKd#lH;PO<lR&7ib-J!YX3quU-puS+?Wa2J&%EId~24kE@a1kxx
z><-yIFBrqbd}4GWOw6SP5oThFLAO6{7o)-yAbc#uxIG039}6)do&toA#qXw_&m}By
z=rG^BwRkHUTHMeToQ=1(c<UQ}F0rh{OFwmTzV!`1o4BorX#W(0Sj1Grz+s*n!u7d9
z0y_R<VMKl>ao0K|qqAxlhiu~RW?&$x;g5QLD{-q4f_^M52wy*bQ}CqQ`GnQ9D_F0Y
zHpYD_@s$!m|G!P#jZW#mhW7%yctlw6|0ixZ!h)})1<`XBY@qw3kl1X=iMR@aAsg0q
zC$f#$6&$@yw@M+UNqe+g@?|h_`w_mZNeiOqd|B~*My;yqgm@%qe`{jIJ5`3h;q%mT
zL<{yMZZSgb-DyGeoZ2`tY>HR6wYn2Cu7cpi_a*LBr<|ZO#TYAjd?jD89pTF>6Sp7X
z%c-;=dd`>i;_}{uHM3sCE^9NdYDBbH@Z|dwcc@dI49PP*V3b^pA{==<aqAI|%%%m=
zbB=7JOfv8NZKW!)H3VPYlek-*@@1313s_uP6t67rPK-c=HSbIdqUWp`xZ6Bu+UU5d
zB>rQ;gij>yK&MPtHC%8ph$zK#iCc|O{-bF@^q%r3s|_4+SD6Y?-g_)4|JB4D=$!IM
zJ_rmVl>c9eTa8fuuhN1DQ$EEY-5=+Rfnf>|J{Ipu8;8qrKHpxwc;o!mS6l~2s@6^3
zP=9z`cS3UN=X^tbEpb~Bx!TGgS`PKCm!o4&KW?I~*9@c8HP4;jdGD;mU;-CXHu=hH
zrypNyCUyv%X>K2P#8F@m&Q<FAZ1W9GJP01sPY*I2jL_y~n=5Sc?@|x=LaNE<JS!I?
z(^GFB3jJ7q<j7G#F`PAKC0}Y3aBw=^<qcG<mxC(SarzjikNfH4Bz>HskB9JKI0I#U
zwqQ)xi_K$wPJdpXu9Mw&S__P`VyaY~XkK(yVxcl_hs3wFvSshV08V_IFlt7jc?{ea
zw~JRRr8(5i)btsjT>R5*)OrLMN!H$hug*%l+NkA?rt{#~D{LH$Ggh1^(Vf^vy>5)%
zUCoQ*SjXJcnlS0>o>PkPo;LwJR=@@1V<(MCEYy;JMr(Gx>8!vhVg|Y`Z0bv>@d<q)
zmzD`BT##M4av@kCf5>;uFP>eAxtCrsC@=C1%Igw$EZ${N2j?>=uTI=n#GqVY5G@T#
z_isiQ=M}(ev^>keE0ZB`;!bu*P-ot=4Bnl%=?Hz_nHGfag5M!n)a_K_z_>9JbM}q@
zSO&j|JJ2clR}EKO3?$k7B<^#GTa8fuqiI2eDWAg5`5~CluM{ABEY7FxhzP+N&LHA}
zEId`#^+y-rGta@k9Lw<KkH=P8bn^s$(IIKaHdwSR?bt@1qrpQ8ZH_Hvi+gN&!&yhr
zY$GpRpWVFB6ptp6fMjpTkJif=Br9DeJ!D87`fJ-+&;C7IuV!lo-Pc+G1mWtR!e2t_
zE$s9CU*!D#UlaxSzbG8=e^FfE|DpiF`_*vPlHW(W97Ea7r<%@?>*kfGnL@R!n-yF`
zrxR+<(melJU8`2>S$nQLQ7tvC9{`@t$_K@-w>5XXhI{dQcslN^vCRoO;Pc=FP6kAT
z<Nm(OC{<_hyN@q}#+TKBL-O&nAC8_DI5)?wDWE>?44U>yBUtC6vnq?-r=<ddH$+Iz
z+AOVGIpjZSOgR133CqZ1JKlw6aroGhhO;VP)GJelZPd9R{qm<*K7dOf#72MgmR`Xd
z@(Htit@{fMo1`ZVXL){lnt)mB2N8(97QMEH@J*$IwHc4bt;^`sS;c+6uXf)wI=ZfI
zV9h;tz1&Yrifueu<37Qm`S@*J!LM%NPo{-+CB9#@uEOV;rnQy-AYAw(H0}1Y4?Htw
z2`%n~7t|7-q!oCNE?mSP(hB?`t-v4B3jCquJN}RW;t#p$GtEZBS!Pj}w_DeuNvK4>
z*v9EocSTu8>=~%Bwy4`#n#Q6)RJ=>AU*yIwa@!ZV>5JU*MQ->aw|kMBz1U#B72oFr
zwGMOZf}hJN`18x;L%Yt3<gA{qRi~;P1ykcL-YZM`gn>JN@t!j<WmE*MtXBbU@p@;i
zJzX>_v!i@<1LD=8?5UbwvB4tr;r?26b`E2X?bi39wlkP5>F4LNby<N%Bi2Q9(CG(Q
zIta7r^c`hR)SItqT94u#F1NDuEr*XELbyNiLrsM4Rip}tXTW-n)(ePV#p|s{P;GnY
zU1!Y+-p!1qEc8ws^kM+|O532V+D)s1hpj-aevm6+ks%I5j)PbYKva;l8VuIic>i3z
zh}BUFZqzyV8u2CzU*NYh;NFPdM7_;{g)Wt;EQo*&+qRI(P@!B=VK<%5Ry_U?G&Ms8
z!sk6RTyp&lO=}W;u%@^p_(g=0)WR?7pX?-l&C)NDV`~oI@Zbr0K&oS1;0G+UP9GK*
zL!rq=tf*HDRgyQ>#y<MxYr~mlakI0Eo@Fa^;;?5qo+U}z=#GuFTyAXVPHpE{F4wf4
zL(v&X;YaXS+FP!@;uJL`i>*%(0P!do$wL6hI9pExSr}1RS{{5g#mIWV`>h~?mqer1
zhwyIkOnhMkBkOmmCHW@fvqog^<(N8%m#E9A{R~m`UG(t`eHi2dgd<2btotw_!GPZz
z1?-&e+K809CVIxhQbrj8#f0^fXg9zpkD5_}&C)PSA()agPzc6#xnI8$?N@gQ_DfN~
z)(7bsxuRqJ=o-m`vsT_?p5^;hLNYu!sm*Hp@&C=*9R5GA3TUJ>*hN=Xe+x|}W4*I#
zwp_a1p4KVpFn}xHkaa)^;`HGZemuHZ+=3K|I2#(#UD2E>mhgW)i>qN+X|2zb(0rV_
zO5zvj^eQ1rDrFiI;Q-iK69`xArfz)-0O3x_Pa|Flm;SLR{Ve|xk$&+^OQ8**Lp<nQ
zyxtiWFL5R@P5A3{hP1lm!s6;IVPB34LU$zWOHsgq-VLI6pFoX(@;Fyd?wZnW*B;k*
zO<d5nPns1?-=Xb4pgpXg(I!;kYF{-@(*6OBC6hGkkEsWrp^wkvLy;`&^LPRm&{~>?
z1dmlJ#7NU14P-}X354WRSfIFqrc_8RQ$+R7W$L40nc6ZAk5V)9SU}>Y?zDRvdiVx+
zi(h2vTDKn5>xIEz9R(bauFGBfwF*gK9W$8I#gOg#+(9j%#@Y;Kcs1RpvX;l5r-p54
z7(Q{2{bZ#!#Xa7o&ESk2yi_x^l6lt1RB#Ijj?59I+IG7^g|<dgtd$$3x;Zj|coGkD
z=439X;f^<GCC%XN!1p}TyIQ@d(}$5^7_>IlOPAV=&_o<Q_NaEGS_2F|%<6VmPqvFN
z;rt8NPj!Cmg+xTC;?}6hc$Q9hyFpHa(-;tmaooinl9@i{oJ(Lq-{oMY(oxs5ZEw?B
ziVXIR1ddgTx<SSh4#jy@@5Cr*Lwnhd->Fu1BJ6-whik<cL+dJ{R>-|?5iO~PBgPBm
zOSl^YUZ^5{5cHFLQ00uSjU3=DK2t_5LzQN2?Fp@-?ccBMrYgHLn)pW#4`|}y9t1{I
zcYC2$oz`-X@40~2cBnG6C@lv0>B{Iq7NsQ8xG<l%wFL{V1|GpcVApsR$Aw69Xu^i#
zKi)Ed>pDwwTEU!T1+8n7wQ5<VWwKX;M6n(up<xw!fWCFlYsE>U9IMSMjTH#bO&y8j
zO(c)|HFHwS#mFQ{<`YzsL@*b-@gO@~8O<)TjNaIxjK1<{MavO$a=XZ9^I7~OnD@+|
zHEQInaqTZ649XQ?22;o~QGdU-CnqBZ)6Ue8L^Cl5OIHL^v;jb_I7|P%9L*^H#o;Fc
z$!Z%pwQfRTP^nf5Y+d-mfviLio`3Z_lonjd&$fY{#Ae7K+4o?Cw(G%mbWA-3M<>C1
zDQGp|vMNL^!9WEQms)RJ3~Fs{FFHZ}aptKzKUKQqcXzc=sPO1-P0&NCbXSXly>zMn
zUKXh&Qn@fsHrAq3VNZ4&wz%b4uQ}|$330r;0)o66Ex5pkJd}NxMn;1tHb-3oNHdV}
z;V9DQ1PcUCA8aFt5u>nzLRz;iVG@>^lS&gVi9gf^ZW6*r%mE?nnuA?1MxE0rC<)Ha
zB*bMm-;PpU68?Q1%E^!4Tb(g*$JQ<yFOs2-^C~=bQJNdUCPa)%ajz`gPGDTh&V6?d
z5HcJ(`9&i<poE)|BT%~W&8}*=2%UzxXmL`{xAazFQCt&5Rgn}&EfQV-OdGL@h+`jj
zU6se>poY?nE0AAk19?FLNhrGlxi`i?&BF%;StkvE6qM_i+*fJWNAccn1tFJu-&hRl
z-P<i;RJ!1F4{Qobr-%*uhPpbQ@FS_9q%Iv*iG<(t_pVE3?nR=d$Y_S=5C&<zW5uL-
z)-0V}t7cUokAVp&XH%$h*2J{A`o`&-k@`3(BIh#Jh1j=eM!XxheWT}Q;@HQ^yKn>M
z63!R)*30k7c@BFQ2Jvp{E(f$>hjVxAr_cTLY1H$h8m$TqK+>?AQ@3G{$(ZUT7*^!z
z5X~2m{sXj9mCkr!YfZi$4&TEu()uWRatc<xW!6!vP9mKc%v{>VYNG_pZXgv@)Ejo)
zJZAt!WDzxWOfqBQPDvfhGRu@|tZJA<KPLw!<Vdh~f`EIt)m{2wn4$$>@6sk3bsA*~
z?{O1nEa61z$f2SE6TZm+ikOle@evAu1u&T+ozZKUqn{#V5ems)6cqu7daYV2k;9r}
zFK1NFnYC(#xQ!I6nED5x9KAGNtsM4xe#lEq-@{qj+-N4_n#AoQ$+v>WWU53txB!O-
zVnUqU7eqW1DhtLO)(9y!#}YSpSH*V_xKIM?plIm^6u~>OYGr(FQG4WTRjY-jk>!!j
zb8dD&Dg#M%sGAy;NPj%mg#+>bNS%{of|K3nm+C=!(SVTQ!)>%BCMYC3>~WS8-^=kx
zLDmgx#@j$%P*6xHyFuZyU7?%|JxI~B735mfjxD=me{8?>7ouNQj#_2=Cc7U_Dy<;5
z80x|P_#W7c(StNDI+=k9+JC3_&H2=Cm5}aI2=@}v(m@vU6q@2M`aQrPtk9zG(?^#s
zS<<!Gh9}M4Z0iCd8$U!@a9q=+s3uuVV}<<O>3hCM<xXP9PN?jfHQ{bg-|+8>vdE()
zj?B9x!HWMnJ^b&AY{`c+-6EPWzi)5jBqM>*a0gQC3b7c=Y@2t$q%hA7s@~lOs}!!n
z&tFh?-JmLzzpyT+MmhFqN0cskzdJ-rKg{@~=u+7GB|*zsInlsi7rPyoj<_qzco$A+
z{3kv1OVi@`5|5x_2$=*&nY14!5FxbWuvANn)-@hlYWj%V@fPTWk#)An97$jssYr82
zmt?wC16c@}gTU&|nB^m#t<R)2W<QBlfPpzyZ`2)K{`*(ULAl`a-<8MpxoV@X=$pm0
zSmvK6s&sD&g1=Jw3sJy<g>!eKQ{j-pf(5?^M-EIQWi}biJ=whYty-JXD|}x51hQZS
zn$Ds<4#?C{#&0weT;?p+*>SoFn}CA#kig<N9EmBfc#0Yw%^b%BIyYT6X33{vksK|$
z6OEujT%5{ztO~z5Vc?<%$}4fI3<;8a2}=M86{QIP2^8^Sz7j3ui)$+5HHB>pNaXRH
zK3!;|Ym8!;ETbAPki>Q%%;#WPvb#2K7v^OQJSbt06d`y>EK?35VtecN*kGUj9_<&E
z_QAoO_4l4(`g&AnJj0a2S;VaeIwBm9s-5H-RSV<X7Fu(UEa*%Ts}=Egj@RPv)MoMh
zyt^(xlbPazIW-VS4<<+=H$M0-=(Ct>t538bR@ib4a_otWvQSg(TGQ$?RYl)+!CsM0
z*0kJY4i_De{gS_@a!}-h$Z11sGr}@V81)&$zznUdo14nDHAqy?Gi(|B0>o34Y$xl7
zi>NAj6BpoW`ZTWRp$T1K`~rrF*AJ7`$mN*LSUAi(F*2~k0Ou}3<}@$?K=0Tb@)V`U
zSIJ=NVovldcRm-M%-zAc_fE*8I4UQ>dxBSMH?;O=k-&C2x~9tO()cwAm$iYKLNWco
zl+bkp)3u6NsB{RGrRwWcxUcHTLavhSSd6}IX({q*zuVMHMS~9ceaB+ZppW^j_E$bj
z)wd4$d*5R8ZEIU|rS^HAx~XW<A)hA}gBGg;rdjQ|Qqs$QHWs6wFG=lmRH`fhP6ssP
z`OJPf4X;jSI;%YIr+S4x_K6CXuC@Fx-KFf41da!0LC=u!ow0(16D;swYc-xr@BiM_
z-CoA~zZ*M?GE@q5`cf+D%!NIsdYZQ@1OI(7s1xHYtnsk4gs07xBNS6bdFgqDer^|@
zU5qZY&b+mY+QJ!`l-qJ15)u#|_=KT5INgEsCE@Ln{`1tC97=k0p2-<l5z6EY;5cnw
zIHGXS;(BZ{{<^zN^m94SM*#<NIgdtjInHmpIS08Q$`%$3nK97?SJiPbNsU(YU{@ra
zPk><u4UG)^PtP*B9GzFNiyzX+XrA{`m#YRcCp<ZkA%Gak&;W<Pz)|rX!5%oRtk1zq
zYvP(%q<tn#9LiBMOLO6Y%--Z3Q`qIC0U$*88&NKJ*#YY!3IiEJXQd#gs{G5wb}GoY
z+W)U@Ag37K_)d&ac853XRMskpIN`!{Jq{jjAs3nN98(%{d%SLA>tSNodJNx0(mbEw
zDhN8AzLbtaV}av8B!$M}DYR`dDD*)0)iszma(V!Ne!7QUN=k>76D_H>my{`#shb$v
zDONTj|D>yC7N@;r#>N7rK~c;o@8QR|xUqZZSOkb_MHZvMAQxSoy&V#{nAyKV3kJLu
z3<&es8E`#Y<e-jVN$Svnd~D~T!>(}Xu=*%Xl$etyPEJ+Kjm1?tdU!>572b~?PDTL-
zqK9fUdN}<C<WpTg%ZHr_%z0i73%kjcQ}z_eR8B(T6t)^RmY{EP1UhNrT(6Ax7{?;u
zC0e<Rm;!6Dv3&Y)WeQ8giyEdw@g70KN!I|7r#YVOxm-4v+aZ8u{CN})pzX#B5lFE3
zl=e00goc7SW!86PqJWVL1`?E)MRpdA-6R@&uu4-^KBKgvj)l|qG{EVlOxeKf7bbJC
zi-yA(oI}^ZNn5*UgAE?cF-o+r3;pCp;iyRGm*G@6oGdXSGPi{cr)qI(gn?AAdv+EZ
z;kz1UsgA4SG;!>3wPxqCJHpY=6E7rJ6v1^~SX6{*n21Vt>xit6rAjrWOS4L+TuXPh
z4crAqCxoyYkDcm;fGgc`decO2Y5)C;LHj{$D-PNKm28pHbUlVy2}#>cN;|H!y>&5q
zTqkK;YzwD!*Lh)3c>3p;z?<P;2TXimxjKluZhjN3a`@VLOu9;td20)l-`gema8~e%
ztj@g6I(;}9$1F6RYu$q%aoc)fgig364<&Cdf`@WfG5LoglYw&vaNtq3bdHXkU+P-B
zW$<OepwgiS^Rpxz=cSD09}_L9kq}VhWb`W9hlEpdjhdQ{hJK2LJaR*kcOt)XcA|6n
zVR0f8FI@?Q52|FetQ91R^?Sr>js}0HOH7vwx;{zZLJPWPMN1z?5pgLrta&*J3!NrH
zfA_dwZlW)=fXAq1sUR~hYti4mR7hWLqH3ZR{ZuK@O~66ox#sk9+@B<FdSOQdC}a%F
ztFzoJ?Dd8u&Sp99F~XDkBQrR#Y#L&x%R>d#MQY(g8K0EAe2#d@LZZqu^A}X$Lxy8c
zpj#aj&Tx7)RG508M8k>B2TJ#c2TJqWrXa^Hew``t9imAumeGAH3OF!$dJTFTT8!e9
zPbrJP0z_8^6q+1R@X8Mv){A@<a-le6&L2q7q7{E6f#D7IL}58x1)3FFMz+{(E6iBE
z$ra00^sRf$h+9VWI-vk6cU*(sFLME^Id}ev7*p3Lun>pV>dd%D?TNFV>tYvbtsxc_
z=JLhr^k~t}(K^REZCs@-&9`T8@U)S^`b48v$(WNFj3Liqg&<ZA@_jEEaprNxZcNB;
zCT>=%;n)S78z^oPz$^MxS;rr`)2u#6YXxzT1GXAx!~!o2i8JC9tPJ)Q;~p1`Ist#u
zoGpnzHSveqE@QX#IU_@dAL1rG99QOV>BQ0RGnLFlXg%0}QW^vW)%6owAf;*3S<(_;
z?uooAh+$9rj4PQdG2JqS72s+Fv37J+%es-Hzc94(JCLkjA}d9wSxdxjBE<NF-=Bz6
z6dykz_A$I0n7If<J-@A%1P=RFRyg}-fCtHJ-R2SJR{GXGdk`1P{G{mSKD2}`g<_f0
z$1wuXZHi9(e?o`FZ>hcR52>-@r>9%;r&L?<OK2=MuPgtA&WcB@xNa#_+x<#^g(dKw
zct(Stu%YqQS=7RIeD9wy3G%0~HeQ)$8pIPeF=P+C3iu*yjCjJZYO+)sDz~mQaqdsD
zR7ybiJ?fGH?<RGFYUEn0yIHaq7}c)8X$@fByk{CK+7u3Hw^K~J4_8ib8eSfX{WX{h
zFN&Q-Nod2x{IP6|1$ARtXA2I|#XTVYfvtt?#2k-5=voMB&e{R`*v{p#6)}`WHNsa^
zgM|nOZEsS8HW4MraiQ%l;K#vJ;vP~AeZ|CC(J*W9(smUoVt8U)_Achq5nW(12MTWF
zap?)24CcSc$#D_s(W&LA2T$(RE9rLK%le8L!lydHjnC8a8=-kmXnk+63(BW8LB^e9
z@Em>Xo|%se`+hFYn@Q(d)D^E9@MGay7B=07$V;ztSnU!X*Hi>|?Zj76I$rlWUh8hh
zdFCcGR{sUj@hV!9-E~&hc{#TlO9Xl?7TV>jC7Qu#Q7gd>do;sVnlTG>JK+u)X1v}b
z!D|I#Z@{0pSR!RRL#^83zV$)C^+Kzjah2sY+)~s^ECdkD%hl*gm{_#KW@5mV993HU
z$BKl!-y_fa=v!}9;{!rMeuf#5#7{^X|CER9dl-cE)A-X7QPv&|8bFmYp)!R$&v`BW
zCVg8J@_d;4)&=r}y<!K6$!EO&zAG&jKkk8$3MUm|qFQJr!`rQ&z)NwA+}=5h`*S$|
z<3M0OBedMf`ddOQXh4^vzLM~D1DU_0n%(2Izt-t%0Gw<*CnZ15(R@&7)8C|p>1)%M
z8ARu#?yJ!?CaM<6XNvZ$+YCCg-(5rBx<}DA<XDB4Qjs`Jjs<DYmjp$-Al6u<_egL-
zR!FL85uZ}dM-nZ2B!0ox?(VX|7wlbWsUFA4Ulua6BP~pylQ%Mm?hE#PL`N3v6ZEaO
zf-TAM@@|pi(h=;jM_QX}UY!~&7lJ+ZNUX(vth;RR1-qP<>T!boD?(<hv@m_ao?;N)
z7woqX9a*s7Oy7Dd*peJ?>=rpL5y9R{fe2Qa=W^S`pZ(rX{C2(O_PFKPRMD*<m)^EG
z!R!OwWsfiLKhN9{jV}!yEr;JiIH*!9;fU)O5hB#DZSg0weY_3i6d`d({jxqrjk46s
z-iMtm$Ci;kAbyPR#Ah$nPHc+`*m69JHK~8o+fJlV);N>;Yl3e-2V@r*_5Cb^=-i|Z
z()_2NS5p(tPNY-`j0Y}r1#TsM>#doUBwCJ^x<aB9ob!j3-3yFgoXcUf2P=Dr_=I}m
z#{vAomY_SX7r(@xJNC<;^w+gRQ3H(Cm%;HP2OLY|M~FMS%QoLk-N;;uHNOEfMYUQ<
zO~n49TOg6!Z3+60Se?J44crA;-_E;*)M42AVu*vYNkctobvWtxrP>9OOqB`C4#ZpD
z+@f?Lqey_W6lYVj3rr+i#F~Ik$(ZGi>lN5;TE$+JeyK4_NNM7w>p-*%2jaW%`b)A4
z2v69=sp7R9&tm!TBbRC?4g~G9kfr5#7Tbycr?;I*;pF1Nliv_JH4J1I=zBE=u{hz$
zCyBOf3_j6aDz_ogbKN3Q3eNQ+Jb`6=;)#I84>>jKD@55~HhS3;Ps9rPSG&ssKh*eg
zT8hVU@gqWBzLXZGpW65$gXmn)J55FpT<!|>O8VB@m|K!#Ia*qv-V1VEB0`N&^3gUj
zy`2afl<B39#)|aL?lQm^=^NA1J5Hp3Q`+vdFny8M7)0kHy`p4HhNf4<BV`bIFHw=L
z^bz{jTY;9uIMgj-Tp|JuD}CdQZ6vx#lnqMsvKw!V6=|!xEbv8oGA+g9MEW@)FZr}E
zeUZ*Fh|Wd2Q!D)>(UFDv4fL(ILM_Shx^9u<5)o=x>ESjq{j)^apiD0vjuq+mb(aCY
zNdI(NddG?M$Az@~WLlWMNI%0Mx-Zh7Bsz*{n!fc`q$N3?>lQgK5s|(DsX3YL6Y0JK
z-cR>;U<@Bk?ZM8|3+e!Q*@5`v-dDTJCSUNs%v_l-xkt5HNl9#OERx+@c1L`A?>lWE
zFDSj&dB<WBFvwmoH&x~=$Fo?owC;-5<at3mamO7IMl8p(*iLAdY9|gvb79~_d<tf7
zZ#$8~^u#%c-x9X>ORRe-1jKg`Uli)w@uI`d!uSV>itHZl>n=Up5aT#nTIjfxiIIXw
zy-2pK&gE|A37-+)#z&n1;v&>i&CJr9WA)SSE-QQ&P-V)`=K`o!$1VWf3Uph79*OPN
z>)XIhp&H?CrI3a=A^mNk4kad43bcHUH3hZ1tg-JUDze7Dr@QoQLyUKKix??*)C-Nh
z7RNTS#?pC=xg6p<e2yW8qaSTUIfy&n3~6!vnT4O|E_-}&f0ns1pB7WCBw8F?<|!th
z<5zKht_|E2>XN2gF<~6|0xpL5azm^c`syXw0gMqy0M#BW8;g&9zH_N|A*eh;K$qPR
z--UHsT8n2F#3+TKiL-ydD=h6tK<@=cEWg1ZIv?M67QT%T71<fw++BLMA;xyJ)D>c+
z;88D}0W|N?cJm4+h_b<q)v`z9Cl>DOE(?6icq}c&<GA=gg}mIG7N#HH9A*%mi*%=1
z*fP<Ph59Ug>ut(PlB3uya$F)peN`@ZC&C%TGk40r+c>(}hCi;4i5;V$wp%VEj5}k!
z=u_QgjW6tPWKKxup{eU>oMm_*M1!ie5{<Y#6_G*h*s?q0d-k3-kQd~c+V#x(32K#v
zURDcD**l1E0=$#F*%r&24=zRzLd&xQOP!LkCMc7V@7v-#_KDthEQRjIS=c`ie0&nf
zF3?ZDo<VeOVLJ;N{+g)BqV}ck(z6XQzSu2dq~K96f`*OT8x_4aw*v+i=?{E<zi(c|
zHObC^TSd{)z+=IK<yR&!WH17qW?R;@fx93xMhIgBCdP=WeGV9bq}>Y8PlEn_g>LRL
z&TD$xtrX%FC-t8ayj{YiN<nQu$og(V6VPdpwV&w7M&PC0rDz*++}15}q~KE62&4e<
zm)KS-NGA4{CjsHCpmQdg$Ck-0)vxwoi4!Zru;>VxTfActV^2R6kczrMDduz-{}{gU
z=wXM}FY|#k@^qR%TDD}#nZR+Te0Ym{oT+~_3lK_u?%`{k3=U1j1)VtTMV@=w`7wy~
z@G*#6z0<%?;kc!dl5x%``3Hk5mc!zgS=8&@6?Ojv`NyJwed-_k49sQtpbY<XaB(mm
zU5#)K7rGcYA%{+nmj|%mCQH8Nmu||X%V4G(;x=I%w1YG8a9p3f{8^(@r)+VqIxf%T
zGubES=!6^1#+Af;^r~$<)*$NJq2qI2SX7i%Wv?STGOJz_rKopuc?yFXXO%uDT2grj
zR#l*z@y9_#&dCV~pT{wEl(8wciqh$(*XbYbZl~kU$@x>!>8H>Vy84=yU427~l9UJ4
ztdVx_^`6~(Mqtq8cDA=_=bf$k(}hzK{L^ieJdyucVfV8hyFc1pcE`#1UkG-8h>4v-
zZ~Q>y*95;hp3Uk%A?|}v)xmqJkmU0oNj|%1B>8l=ND_A4i4MB?A8E1h54w?x^n42e
z@5=Eu7<U9GuS2;BYuQyW+rboRi;3+ORIhvaJU?l)1b|bGwc~W=i$Z6<o0c`c&U~9e
zbUuC`I9Mp)z}jj>RT}@XqBYkMHQ8Be-KA?AqHIk|=rB<hq&5F6=-LI-9U4%F1^X@{
ztRmR)OB?R)E(3hQzB4Vo<9PVIke2;vVfsA0ok4Ui*sC9GOyIu4d{nlT5=Fcxh^8#w
zIr`Q;v(bh$XSzk2OGmte%N4@n{aPZdBHr;!8Gf+44DiMK)oJM+$HTu8(sCg!Okcdu
zGl<T`d)<jfscue}%sdV`4O{PUp(5n(A<D9lKSSSoE98<u@9GwTE*&8cE?x->`Lje=
zMabh9wtTF+4Df~gqiN|KC*)ri((<9SFnuBaH3reSkPqCA^Ly=xc>9kP!G4~o$%6ew
z`qo>)mPGmUZV}}Y5o}r$)NW<Mva3Uqy=*LgWx@)o*gY2bqP+xwyB2qUMaau{7tY0R
zGl<Sbd-#xH;^xsQ+=wVdoGv}2wSl!NU5;4L8q+)6kX+90Y>2+1WF4Kj3ZjEr8*W6V
zt`VRHja$2wc{|#`O)>QMxl9PVGd^n+ngmteQH$p9YYHukvxrh`wx$(D-y#aJNr9F>
zxzN>-$qoLTVpuM$hltsVSBqcmc)C|YaVjmn<9PU0AuSK2h3WHfoI!N1`u!)Wg+{3n
zI^EoR8WeEr9MO_}TAjXi&!Dy;$z$Cj$t5Dz@M$-+^J#A<$_C|n*$weN?MJ)I0^iy-
z(^5Q+i(eD+^47F4eZhV+gXmnax490AZ$4?*+IBI0WN6bmvP_jJ&!dU?_73VR%J9oX
ze^!PM(zo6!gCyfGc8iRcjxw}ediointfCApmY#mDyDadP;nQg;9;Xa{E9B)<X<_=x
z@cRs+b7fd}cy<~$yWocLxB+^oP!aQQ5@lJ;|B=4+R?H=V{=QoTx<terdu&Tnd)ovv
zmu(Hn`Et}(!fAK;&lOa&dra^JeG>q8Z6xz|LSlx}!t@1w9fRmx(64l@eyKWz)dclo
zS=&CL+lIC`WbWHlR21M=qBtwSE%dE>w2!k8l5l&vMYu~u0aoR5d@)QL6?lk<8#MKO
z;wqUSFI*)!-CaibN^mMI-Q#%q4IwoTq=o4#!8n8HTnV<_W!7=c6mH_twqwnUUed56
zhHcRH%FTOr<Z_-a$ie)kxEB=r<HT1HU97j^M|j}otO+9GCKW^oHUO)~7%EM>T))t!
zl?4s&34M2XzjTMvwu9gE_c4W*wGo)d7@ZV73JXjMw0bd+hxaS%vu#xWeZ<(H>Muuq
zg$=F<yuVi>@Uv-Y9>>Rj6cY1OX<_<&d=G=@T=Dx)=(A?IQC8K;dm6N**6$E4*{^+)
zzV+6xNs@fLTO_%JMBA*i5$&%MX;slSE3u;eweB*(_i0~AOY=C<{-%(azfKF&7wzX6
zL=w?9D{-PNpDLoAxyBXk0s7Wk(Uv6XLrbaR=P*gSAlfNF_-nhxa;hXCTCeREt1QE?
zXl?h4lC14kSE%}T6Sus`eyh85dxVw+i`CI1{sPtT)%IR>UPUYyQwOW3Ui3{XpF3aW
z{iESk-s{I3Wus>1wc{qP9M-XbUXgRI&nEm}cjeq)*nJ=hIIyt$+vr|+VfU9^oJ$gC
z4cFCc6NWZ};aJ_MXl6y5FlqD9F0Goc>!n?|us&~==}WbiDH^l7{H@`R2ToUvYNxP{
zn}=~&8m{A_b*6@fJJ$<zsd<^NyT>KVX5FSMRdEyg?YM?u_XK9JCUJ?U+Z-NM<s;d0
zMJ^Rbh%DZt`WX)&x+E1ZA$Vap0o=SL<T8T(p-ZIKihwwm3|7Kzj7NpZThksHCm>Ny
z3{*pzWxFSo9=d_yE89R$5lQ>rlTdcY25S{zQt)s>Whwg$=?wR`s<h+w*IJDJj&XlG
z*AxX)C-K`UX%-w=@a*ui-SLBm3yVRsp{St<nrtVgeExoi9cTwDtmA^W?}(OElMdnj
z7<NL%@Avp^wZz$Ucvde@m&A4&*S@O~8($?z1MA0$5$v|!(Os5&66l7agA+@ail*L<
zrbv--$9JHw&fo5R(Jk)9_1@pHG3{>Ql3Z7l*&S0auG+*N@o%>WOhdK1*x&iUs{3Ai
zt6zb?q1Jum4gE^9M-GST5U6_t{!wxuvwL>Z=&Y*BtN(1B4@#kHNq>grB8iW%{+RBG
z{|tS679SUjTb%xUZEm_=Ej6vr<H?1l+=TOSs-xc19g@eeW>aW<s~;MFjrS;u&57#H
zLuajIes-c%&7W;PDVuzbRDg9$RdYrIeV$skWC?adhNHIA4=knUBG_~lJ0?;?Fck=b
zyZ}wB88%jc;)TovQjgw7JKD*oYY4}%gs5axrYIq4jvAx8Xk*@-R@BcK9C9Pbdbn~%
zL|GZTS~j#?CAUL_ee%6XtVdh>I3$!e+0#zI38R)llLd2%B0&V2R7rMcG_2Fuaac37
z>N%rUsv_hp?BY$Ic9mYr(71u(OS6J4n>C<6S*w<@0kKjyW~rarOwr62gYc<#!!`<|
znrkF)cePE%h>yR31Xg|X3yO&l&yTb*{gGG@DMXeJm!KkDyd2Mzez`jR$u_W)Xu8xX
zKN=*Y-DogFo?Zy6f`k(+=%BARtyewLa)`d#&!zDhqd)C#FK+}MKDur%pZyP@g+a6L
z{72}J&!$$nt*~E77crh#ErTc3mq0c;4;imG?xq2xoi=M?ueK`Vt*ZsOXMKxgp55C&
zcUSu3LdPN5`+t;L4{sg_9ZwI!W$vEXvwKe<)}ts4LE7!w!?&E-h3|W`ozgFnD-?by
zv%9)y@4isfDPG#Mm)_bJ`_gR7mu{t(Zi#y-6UNQM?{WRYsJ315Mng4yhqnKKre~-|
z_#cqdwf)*rIKL^QhAfQ+%L@;P!wj^Fc3{7pYuvM2;pz7X6hok(G`sGq@7koP<AsHw
zs$7Rn1%;q5ej!58%i}^&${ix_Sq&x-btL(!rMXJAY@$d*-j7m?w0vC;6l9E9r1Wgs
zu)&ca(u8~pL~b?*VD%XTsYty-2TfGyRb1lt1OiYpQo5EeRc-O`i37RZXeKUj^HGQi
zgOPF!g~1|>&0rChR<1&CaIA$0PYcFW%|IMF$-$%#byRB^NaiE>be~LWOtUC03d6n?
z+R)0aS<zr=HXJO)Cx32i12siR=m$%Lt{W_EiW4lAknvSI=y_;YmxJ^u39Mpqon?2#
z-(vTY?)Kgfh=aW!3@MM=@knX9K9fF%`uxNJr6t#@9$$<;zxEQa4MCUUTnY%y&)Klg
zNg1AAweawC<Ncl|aT5ihtq`#_f;6`*k~9uVi`|vExS&*%eKyb(*&Q_~bzXDF6WZ*f
zkKU@?On+_>fA)$$d+=wE_QU}<M13*hMsInTh-8tx%m@hb)qV6TzoQ0)B3^w_2m%Ge
zs&-xi_yl?78i#XCy(ETzVIh~wwXpb8$aUKb5pw-HLasw1bt$4OyD>dots!?dDGw{~
z6VjC3qL@fbrfS>ee5shF+p#Od^F+bNn9SPY&FyO2G1V$w!9$9&f_X$ASQXPbJ2GOR
zgb3(h3?f>&Vb?hory~!iBXS#+fg43Z)oI#+u9r%48BQ-E%0eK>Yu^Fyl$$h^;g(yZ
z%<PF7uS^(8KP_r&d$|jgUGyLz{a4m&XKAw}(}@c0x$;D{1PrGsigf1`;%OTI#c9nw
zy9J#TI0nIKm0x_>0$HiJQD?!>gh_mJ8<QBx^Cg<|{gF11lW2A%%SR}?A>B|!vQ;X@
zl&9=>$8*2$Ta141PO7>pS(3k=j%s8sREM*y8b1K|&|*++ETQRAiI({76g0zjYFJB^
zWJ^aCJX|07hl@e6cd;S8R1LR67v~bkHJvoTGlisKTIsbb4PROeX*kpcC#hiXbOmBM
z%EDKNC~GLVxs?6pVo-K<Fl-1$#Ew!je^0})Ys#V9ja?YJ9f`)MD#16#)d+Up+N8Nd
zw+-~Idn<+GhHj&>&x2?xX6R<`**&@!8T-+_#=hWS3qvh>i2VMZ-H-0WVvl{hNB4v(
z(3HWgG-TT|w&zw^WjZj$02teqIy>;f-bZgy>GgtO5afre5*kw|Nf5WN;hD;ru!z&}
z>?JS2@XYzKgQZf;04Th0!E>QlWJ@a$Fdc)17PNvvo}Mg6b(z4xLoAlSrg&p?3d=Ea
zxs$xoRxjmp{;(sLJA$PVby}C9m(3C%%*<eSgqOdXi-xIULY+lySD41z+L(#Ra0Xl5
ze6p&lHsBU0{c+|0V4GHwXhmdbL+HChn~cwB1qmlukfPVv>?y@Y?Q$PKRhn}9dulQI
zyCFu3gT}{+t1y56!`33DL%g+>Lkz92KfMt-n+Iu$lu&S1V4gbi$S(W2L(A(GETPBZ
zESd<z=6~dPV(m!=<$2RKN^?k&JlMdxCNI}POQdRsW#sFyD>g01&r@!NCVwkRLdadr
zpJ}l~43J;xzY|{J&kMrbR%s=bJa{UDjjNOZp$RzySs$+}`a}r{lXE~qShBD|+8j$F
zMfjW+bp*@HZA3Dn=qW`0TpRccQgK4uRq=oN&nXIuR{tlZ!TeI(CByZS4h@&{c8U?8
zt-PVhGcexFwJGj_Kq!)>7(}eEEMl%7iDP4O5*7$oK9DiU$aisFM5%!_ppCk_!-#_)
zSPZi~UBkLgSPQ+NPvB&`IvKWmX}Jp7GhSedWz@WqJ-kTs#?G)*ElH;@38p;NM)f16
z1qmC_L-nLfvr6->7yZ#Ta2I4!2w~TxoLx-TD2lwOEzi%XE~(GUTB%RxOYHhz!4nQy
zRY<(2K_XheOftfAl^^V`w8RZ~?~;A{MJYd_xymiOC$hWo4<CDWW6+vCf`9lpd{FI4
zn|i^%xoYq%x0XcU7dCiQdl?oBXN6h7q^P&$^lQCZ(jRGfy|lF>uC4Wvkk=i#HQd0<
zMvc^4U9lH5g2EciWSRL9d#+N)i4GnOWb>jFlVq~AP1DcNP6{<U6WE5jJlV!;XQf?j
z)bd7?LC7)Ee?<$<x_kqR{VVmXtT67Zai8FLRHHd=y%`rpIYWhNzEL+z_9%7*U{PeH
z&~#QlMBd15zO5<Oh|(U~ac9+(QNhmLdbQTXkAhxD6br|LAFD+hSpYtZpIAvwIAt5P
z5`L|%SM%8kJ%5%;u^@pqi8~u6tJOLJdLvMBY^k%>hHnI~v$I%`UT)&aI=fyor?WWk
zu8hvufOnO6Vw4PilBEnmHeb?hMAg)se8GFL27xx_fwO$C6mIRZo<VPp^*KYvtO@F1
z9MG`c!ak?3U`#Zo0B7BdUZd4?r~%(w#*<Za>b*fdX+CMa6F`bT=v-}9aE((IS20!T
z9KI|zSX66StcNR<j2b9O$mHuyXRz9+2P-z6zD9j=<hG`>HB=G;VGV2}W(v4&GydCG
zs|BH#o%MvR4N??Agc7g^`3dnWosAeKRcnQ8!N8)y0sxyty<!I4Gz(cVyWNBtdJC#s
zZ^ehRw$La~XKkZS%M*#x>-d2Qp{Ze#nw|{u6OgH56aV~2)3(tlRI{^X5{UIQ&ukmn
z;G4|md_7A?_6h+T%oa?WhDP9hWzr;;^t-am!tSgA@-~nW$H0N}vSxPD#J0ZXnWps<
z!23yObxofEhX@v3R^|+m{Db4PhX*2CHtWq3>u<7t6qU!Vw^M(Ag!;RA+L&fgB*)ph
zfe;HK-*g7>eB_4Rw-lPzkMk?<pjUp3URhPwCm@eFtf+Zxp!lYX&U#@GvPE;MSi=91
zgcYS~WvXfYH0nQTy@y`?NqTi_zNk|U*r*9v1a%lqnul*pH!oW6LamEnLN$+lJRqf1
z5bM9vbL)o*(A(&v$-ke*=abgE`TKk6vp9vVQqF+T1&AitU{(qyq@bRy>$NEZx`kWg
zhU~@!Xj+F!s8&GVNxONW>1<G*R`fE+i^qUA>HWC&tT8tOi9$vXD<a%O3;fH^h#&7I
zhhaM_X<K`NKv;7yRVdg2n}C9Tf+k9~TmOrk`d`t<7s+D&IeiS!#*RMv__HB=e4akO
zuz`Nk$9=S6>^OaVlRo}|KFYXWgzv|*W(febXT6lx+uueXUm);*Mo!jQMQw8)0(gnm
z$GPQkZgren9Ou@?xutP#Wt>|WXXsBdWYht`@rLyWpgV!$KD^iK!!OY{?!%Yp8~0%~
zcZvG&1?m#_;d%U|bnTv|^;W9L-8o5pqU-)Fz9f*lvk$}*-QmL}s5=(#a`-CM`#60(
zL{+$6f#^Z^6k2<T0CcK_^{e!aHkDeJ)BFwX5wM=5Z?rJW+Dq^#&u@L2J~#k!)_V3E
zykt)90FID}wR)pobqj?^1)pTOIs^@xLF-AfO4UuFhhFVf!D`k`XbK=UD1c$eYjslZ
z&0!$2WQmi3Wy|9fa41=`c(c=gNPd4CNg~;}V;TGP&67=M-LzhVfr6OZ`V^ZIXM<<e
zf{(2a;Vt;6IUDxDE%5#3vnYiPm51hpvR{4yZ}lF%7fJ3K`AALZqjsIEQP)uxNo2p=
zOBds(xnBiekt}|Y5d&|r=1}^f#2}nL=~<ULD@cD};*O3VxsRM*AT)v9qp0K9PskQe
ziFTaT9$ncet(HUQEY3V6dqn3~R1tH)8X;owq9%;sXfLXF;zE)LSt8({3&Pr^Zf!kg
zp@k5?thbRC3SP=xkgM)S@I+CFdUdW7crFGgkE6Ff_A2g?VKR>U7~8p1+c_2<E3Xuf
zV+YKyYtups>iEl|3H4|=oGvqb?5rRMQ9K6bOVE@XSUZDyp<J!-4O%1hYN3jdJ8tu^
zwS~BH4vHrE`V{>Rb5k@+7S-nhDar-B2lq20{=5aR26ja`SKqJWl$Tn?_Gh8^UQdc7
zyp^@vt?*5fD^3x*uGX`1i$`%Iy!U#1d$-!UZyq{7bm!~nhtlrq!`{Y`(0Mytl{NkY
z9tQ8HZ{5?YUx)&BPLI99Hfr`*aiXMG@<jvm9dnh)9+O+oM-cIeyVLX%eMb<D<&kxJ
z48e~*cG8$Up;yKNJsYjr^(Joz$DO<py>$+sD#Cu!$O2Xb3pcChOazVyQ+UJlIn$VN
zcdW=ohd0@@6w=*rBSJVYDKGZx-jfvO^RIqKEYzS(SkDs0m?<BP(rzKf&ObuqBLtXs
z&L3MLT2i?L@^vn5f7urjx1mFrP@#pjM;aBTc1Y;>1@7Ocy4yeBnE!qhu;ur;AN>n2
zGyiXsSOOdThXn>SF{I@tb3*YE4Nz=|?Si?zxy%$6k<SI{d)238_4*8!2fMG>w`;UZ
zi(=y3TrPt{17>&Os(JUH_i|CbOq;5_m$4U;W{jqFY&6aBi=pi4zcbu}!Vde!lJFN`
zShAQUO^VAGfmNbeRZgPL$QdFTfGm$pda~^LCh3U0Dq65go6L`@YQjnRh>>h|u6une
zL%O&Aei~KHwz@c*>odW>71fZ1m=<64z8M7^P`#n3>YcuB>5?TQs`Am6W7fU~9jm70
zMq+hvq=m}1eQ8qLKC;(WJ+CEC&q?<%6y}HyYCEzQb2p@n1|k5OY{6U%5=nZco*4<*
zjQNqq3%SgQroPwNYf32bJ(|rcA4KZd7<uJ&i)(5&2~(r$MU1IgFVbyoPIZ(u0@;+d
z+3og*hBUErL$f1nXa<iW9XH#`#dCGGGuuFI5p8!luDm7+IACY4iLo>H!p_jfvEW)n
zSNCukvJCITZhNnE+xv1E@$ydXMbd94co~ZmUzE#izj+5tmfwB?0J#hqjhnS8@Adg#
zCKV7d2i_vPLjXn+0D$ci?~m~70)r94LA6HTqih!`8y6mpF0#$qCTy0fV=*>s5Lsw*
zwoPy(Ds(3_BAxEsVx0(Eto5hp1gwL!fQ&Oqp-~CfXOnd_YFWAy8XbuO4w$T)(Y;Wz
z$vK1ZE$*Pj(F>GQgD!f=yDLO+^ApywVMObXRqb5}S47H!7er=gQ=trKaJ=j!4w$Af
zupJuA_PDK}SX-xw5=`ueqBL0uvEzogBcdgh`Z50DdH9D}oODB1N4WoBWbJ7zC7hhY
z7)-D8D2|r!FgtRnNp@L%De?*`<Zv>a@)E^>^xDI>o#Cb;FL8z7YpCgZpf<0ui;BGV
z$gDPUAkZFK3&|7ZmLWtKr0(JzGYvT1@l3`9t~f>q&nns+z8EE3KXcxt6aho+768u&
z0L~PvSmT&8Cv%yH_l%CdMD(8t5bnP_uS*A=<hb$~>Xmo89#aFP-!6%WvwqM&+6~To
z!NbT<#z(4z>bbth^Zyh)4;mjg<xqg-S<IBf?iOa~84Q>s>rB>@1djylePpc(*9dxq
z_Dfyb4+hBhbnaRo3%k~<JU4ZU+|*IzYB4^RH?sw4Z}F>a_<x|ghTl&>JP`#P@UnNu
zc-fstC$UI#61zfR1;vR=IMHYt=V8hfncnu3@Y>4dcvBf<I{ZX%+KD3Kxwgo34^~A2
z0mV2uOD7fBuHZi12JV6;c?e<hi_0*Z$+L~~&?3m$j$W9bE@4GTG{fX)(T<3gR8fe!
zd<S0mcI|QauKOudt6gxv!L#hw&KtGR1kU``gCueJ_47>DB%E1TZu8z2oeu|>x6D-=
zw4(yM4zSV-t6GE-Q1pmH#*n{99Ha}s?&YGx3NRFbp@^&#Q!cRka2p|Bh;sZ^8@NeW
zAm<VN8BjvlRgP=sp;1r@ocSuxPmeAs#fcVj5uOU!2y5u;#C~nhJ`F1)f_MJJ)(Cdm
z75y(RvgqFz-^DNiovScf;&GL@PQ_FlRye`$RTjDsuADm6Pp+tQr~7o+>25e)MT(rx
zfG)v!@rX{*J&WI9U;D4!RSMtN{!0{az}LPK9Sj?ty9Cx)(BWY%<9duCW(@r-ZHhuB
zG;h#yL_S53X5j*(+t9GJ8vui%Yh{MrvFQMP<JBfz$z8^cO<yGhR;6RqQJwCSxl11I
zoH~O+7#~(jqcV!PPQhK>h99$H+`1o`KJOofR=HC$k4JNmG=)*o>^#niq#5rV4H*e+
z?%`7yVe(*44E6Sif!<!XG1LkICb)oykjVpwFEkVkjPo*&%!#4r%{+1xC#*){%rP8V
z+!Thz`3j!0CtO2kBYux86=osG5)@(A`d$Y4UCa^A!|}o#vA!E{z(3Y>1Z_ZMcq8i2
zMM|EXSjYf}Oi|~y_E*EUcJMB`lR!HtvuL5zAy;QZyQjMr!#A{}QNRI18?#Q$Dag&K
z$PQBK32KQ2;0Wm4L?CvR;UWV$tId<GyRhU8xfx+9N_u&spa<=)R;Y4nsA2%5m=6s{
zgZomnsYtGq3W5;315pyS9&W7^T~))HWoG<<>z+1{7Zg(x%4F=9VZe1W&$M(%_Mo;W
zdvktTh1E6X5UeCxQUy2a*_<~`YHoT`xGeY;p8AiSkcSIke<D($GBHW-dC5uoArqAN
z<^c=N@3}fat8&~KE`S;x9Sse@FEQMLTz74JjzuVm6fSIVS&e6FSZJI<zQtw4BXz{U
ziwd4SnrEk0`}7srzs{}upNFmcnnV6d!;op`x@_7X@2(N>P5W#VaKN<BqHEz8`jw|(
z&B=g~$O_4)FC_J_-eRd_1G|f9Y#%&9B~!+gHYRSn(k8Gu2kS2FQSC^z1|!cqhr`x<
z1vR6ZXYojgz>`tDTie?!TA{02;7xITQc!T^{;h3VPofQxaXxj+waG7C2r+}&>MRJ-
z{PYg1UrL*OUbLi2WQ@(8qX-_Xn$vE;NMrwgZMTrZy?ce}-M253X;EblMicn=1i!m4
z_-?S^MS+5SqJVAsi&b%X0r3cO*OkflvFId`zJ=N13-Rm<3j?-%2JKroy%8==ozEas
z)wva3+K<6?FsX!0M!CwD9*oN)6=*U6p=(u>J5hr)xA=Xw%pdQrDex`xvr)hS%lu?3
z%PdZDz=jp99mhGnv?G){p?gO~@Q|I3iGXp|^LgwqLPYJIv74E!mP*wbddr>d_bjsr
z71{pxq7{X}pQhe3f&afK9Xv~)MB1gTjmv}l7txYR@fgdqEQdAzL8+k!L9|_6{338(
z%(3sAT67@nyMK)j?a0-0nq90mO4uU_8Nh{dSd$^=(EU`GSdr!)Fme_<HF4+%Ib{eI
zdGg9s@Jf&w6L~T~L!QJJH9mNm<jp<gg7!c(CMU6`1RIuc>=8!SQ@9)s;+d!2)m7Ti
z&7(yjU-DFGg5U|E-1gMRJyD47$Y+8Uf7eEAV(z`Dhl1~=@r?ae8>lIS(ZBbC&?SkZ
z!Pp1>9dakA1^+HP@bsIp_lf?^FFs)xmonaYYYU|f&xl-=tJ6H8e!;(B3Yipfzm#f@
z+SUwm$hA`&u3ua`^>m9ahwYTjTbt<M0348Z*7HP^?iE|1U`D3&8Xq%{VTL|U^C>(F
zA-7Rwaxh%DzA}ewzFDrD=U{@wRg{`OL1!6B2k2g+uG?V)b8x{ZsK%)a@C5O$1J7E`
z3q%atfJ+BeP*w`+C>XjjadR8^3o>zpxNG8eCg4j@aGfMC&QGr{Y4ST-h;>+#how+H
zUcb<xMtAf^kU%aM?_OlherF33gf)BSC<O={gCapdb1n!PVsC}T>QQL9iQ_DgGT;|v
zjFF)|_ho21CF<t1d=UqE;7+nhTvmpa1E{?V;cSD;a`KM7oHuPJ!-w*sqM_)Sv&d}=
z#++)S)e)<)%A=cVHu@zwmHxOAccx7X3$h!8x@$K=XX{&+(@_;XOla4^E~)u5@iHEU
z?qJ?Xj3q~8^vv`8HnxzDa9m5-#!n&8!>(_6bd&dnGD_por}swckuipf5foSZaefq=
zP+^;fd1hLjqYjKwu@O26<Nd=LXepH(uF*MC*57M%&cZkNlTM7X{s~`$=R#Tk!e!s$
z&u{bRzw+mI@X4n=S>MICV@s`n6My~>mo7m&<JMCCT!v5YU?yuh{pzz;a8VzBuEeK%
z=91NqAABs5wTixF=wr3_Yz=)|OCRg#V~{??nMc-oe5WIhtRZ}X>Ud`xSsSRt+Q^@q
z_;WLVUdEr7^XC=(xdoqs%vbX7tLXRD^udP>SzGZHUA+c>Vh$CuuBDn9eT2>qvbNES
zbZC%u9TgAL$4`UafkT3<>+w*Y1Z3Sn^_M0({>Qoz?~GeF;S=J&1Anl(=VtL|MEuz!
z{@lWUwp*_yyYd6{@eg=n{T+Q=bsavgppQfJaVLGu(Z@OZ_$T`K27TO2!?o@7(V&kS
zeSCyIeuF;F6VMs5F4nDq#>Tm!ac*Rs8yIKc;|zG5fsQl4aRxTdfC7i@FtR*nz{v78
zUq<$uggYb4ds`S;+87{@*m;JE8E;-X$awSG491)1vKVj9kP_Y&Wh@%j?Tox7PQS7C
z;}=N#GV$l2_;X17IV}E&!)vU2@eAxbN`IDEFUKG2I6lA-K8R*1A4Fr_k4J!aQv7)g
zf5xqv_)+H{p8mr~ckko|CI+9O;V-N_fEGdlh4mibpyXuQpO_JhmBhR3J${a;>2+km
z-H1yvy-auy>Q~etTW<#fo>%xW)M<Cr2%Qxo?W2FxNPtYDrSO&$-I~LDVCAg%^SJo)
zg!prw|1=s6XQf%@6Nhl59#$b&W=H94KAe_x1V@_D0adT4n2+5}C(7~Jd`~qeoc=;d
zoOfn@4Bc?n-d&xk;H3Kky&;eAb2e0K<`fP}D`gox4m30A{H|4Ws96?yADw=!#{O|S
PL9K4g*73VBG5UW2oSeQJ

literal 125722
zcmeIb33wdWbtX!J1OYU$a?vikBxoTi0^lOak|HUh7FrA`XrpY|TDl9}1#}gAQ&%?u
zNTR&UVy3+0Q`?E{c;dv#Bu*TAoOpL)JN{l4XV3fcCYj7QR%FK+Cr)gSv%F-!%zOVi
z_ttW&svBK}Zitx}A6eaf@2zvsJ=;C^-0k&)?;6;&c@zCPJM3D~tgOr$mD6UuS}7Zq
zM$4JJy=j&TcLkE3Z|!|U>r88pvqi7fTJuh(P|Y{$hEXu<E$7JGL$*=3=N9rsqcV4A
zHQyvK_S}-$C^i@7^7YkPqgtB7EB4$2#^ODCWiGowHBb^kv0KhIyPjuY2NMIs%lT?$
z(OhadW3n~w?`?O83=jR0>S?21Hw&opOv@RxjYgB3W2`icifvXacIz>;a>Av`N@KQB
zEmT`Rosd%28%0ZBX*uTwiiyV7^d)M|q{ztD8-;A6Xq1hX;S87b%2E^gEoZ=}w47bV
zM!A%&8TGPWGApO-tO=}J&X#Y#=?yJss8+99MjpHvx<in!<&5O3wbi=0R7C1|hYlP%
zxL-S2G&Gs7oiy|^NTD|y#VVLG8O<9)+o_E$XA|Jojgq0;z-HT_*@FjX544=|hEcAS
z^oC()YiJ@U;bgL2T1y9ctIc}e$lA@tMHB7cp0Aclz>?|aY`?c&FzQC(P7`>8;t#Z(
zt+REz(VDlNOj)-ZMm-CLqe3ABz|mOAmzo8Gsza_M{x%^TXz<Bmv%Fx>78dY*_Ra^h
z4>qcGBIS5(b%{kRYd2O)2FW86Q;@oNfiuZJ?S|ek^Ilt~D6wdiYS{&}yP|_D&V`bC
zzzC>U@&<&nsh1edaU#V^7G&bONMI&J60(Jeldu#IIv2%5nZ@fZXSd6sJLOwI3Op!Y
z?rbY_WvvECJA&`Pl%z+%JTEW!UUxB*g^Ra8hIjSjo9V47)L>Q?t3+1?qx0f1Y87uU
zUS2%mX!lkO4N_-l(1d*5tPx6Dby1UIHw#s|$F%cC2|{aBn>OQ^F>1|)Y{P7T<i(dc
zJNT!|!bP*hxI5czL$BwHvqWv6xP$a3YgPoK>4)8V&Kc)-^R}J!-WzA0DM@3TWCaS1
zRhngJdUml2wP~<L8nT51LRcRZ-?S^qprBY2(&7vqHJ4^NX|SO$0Ci{hBz<yHCSNTW
zGYh3^{uJInVcHF|vP3yeXWMDL)I^hD^@^9Gxm#c&Tk~&i6)yt`m+-}zlGMujidnqE
z*~$&4f-f&>#Z&ZUx_AY@QM|Hvm3Va!gwR)8GTj;BpV`GSltq-huy~OuxgEIaB_j*t
zNTT5kiQjfh7x@>6c4l4c!UPq<ecn^`YPE4@_9-{-%u}#)XIkP#ZOMSrtu(TFsZ?Fg
zE;gThay8qi>lGV9&KiBz8IonV-3N*X#hb$fmQ`7%6!(GMOp*y{A)rdt0!RtPZ8jEX
zZkVynB~fqjQ1P%RJLw8VK>MA6ef!*&jTVeWy;*8x>s8Wm@zMo)p#WSfY;>S7P+Dlc
z4L&_5p;Cczwa^63hzwrFrH#5-hTv2im1@JtdU}<$YkJ;jofWT-+C>mU7*Sg$7GE*X
zd~|jcVSP(vfjx4AArehV)+xVCmDP$Qh+!A6F76R<CS0SMT|i%i9znt%J7pNP?6O|3
zfOKx{&XnD()#?Ux#mj*SU~->_hMJWEtW>^QE>~ee&@5PH<dfhz8JOR!Q8P=`C6|Dl
z1i=j??O@8lguwDQvWq1hbxUfF*FZGAz6x%abrU_uKn+sMb&poi{o9}(`46r6d8%(x
zqy>7@Gsr>4D6AJ-w`{Xsa#0zsn2nm5KegIA%Z0|}@2t60Aw&O|cz2hY49+dVuFA}9
z!XUWp+bQh>Yy!Sz3q}q7*zwJR{*M$N6{t^851vJV1$0RefA{SvPB)$a5nT%-#csR%
z2DHtkO{P(@v*=RI#Z@<HJ0;~IPW6WEwldR%bCiW;hiBzNvq96w6HUmWN9i4bw5-nJ
z4QJqqJ7H>>+`EGL(&(~raz<SBX8SN;>9D%P>|dd~2c6)wf%@o-N!wdSQ^31aNM{yZ
zeo?ng8=Y_oh!?9RbmE@ujj^5f`pe?WidQf@IoWk5UU}OvJCmE7t&~p2!jXLi`##05
z7r#zvqQl@$Ivdap$}8Rn&|GLcgO*+lEG;JrG~9N!U>iAE^dhLTWZFfej(#zi9<a)q
zNS|QX@ct?dbJ4^L&QP;*s#0A>cO0nPh93*(p!g3WahTs~ngvQ>UWmr!$(L;H4JIw2
zl;I{x?COTs$BCi>i&~X*O?H}`QGBTQDz343fAIlPRJ6NM%}YVvB9aA-C>h?X)Kssi
zjdlb19}QLpn~;SblXoHQ+%9fZS(oYAWwSt<vPrxpP-jyJeWl*itdP4P$t1EN*XY+_
ze1HN|Z<1jKJPMD5A_x90EX_g_UYwUR#qTWFP3m~bZlizBz=1WNL}9%oDlFbmyg*t`
z_6URsNgvfU&E!o-WJ_2<@e=zj&LyrpCcIwF^_-+v#xF?s5ok1|yVKQc!U>fwsX%Ll
ztA?$uLiZW=D5osyr`g>XiN#kJALiWRYl^QGUv4bkB+5^4d1!83cRg8=v0H$KU!85%
z3UF1?FS7r@)d<(ghBz+hP-k>OoGe~K7YTY-D>}v>EEI0`PKGILJ@MAevw`AQMIQC8
z{+I=$7&!!T?Tv8zoSpE@$;pDTuGO>E1s==rC@k2j0HEhMy?Al)5>Y^SgFz8vBqV2Q
zC9@%A@2n^<GDzjK!Ucg)@*859#iA@SXt3pGp2zL=)4h?+*4YMZrGOwBPN+b!D#E)Z
z&n<uu>9PB+<g-ACDhp)@aEy>|p(L^w2z<x|5%u8RGWEYM!k%QJfarMTn?kHe!^p_H
z{1lC^HXF4j`~c4<8)TnMHg5;l3I73Z5d0drz|<#k<Ak(`zLdI3cicBHtI3xob=l+h
zeIiK$*;0`iF!&5xRO_}fkNzG;;R^NxBv;7oEeNv(w0x$Crc$3ozJ$w&OJp-3@Z`<Y
z8%CuH|Aa?~)(*rwM59E-+@HgFq!DY~?UxzywOO)8NR*NV*M*1sLi?N_C^i~3`=+_M
ze4#RH*#)Cyp03YUjK*B0R-Th(Z#z6^*w@X07c=E@X(ms&p|B(xyB`Q31Uo^d$+%mU
zw6@fD4?MaDUe}|0TZTa2d%0lR=&@J1gCBVG5i0bUTgU?hfgq1XGQ@rN5ZuMM^uytF
zcZeXR19EYOI`T<3oyH<Onw1%&Zbp;3%d?{N4mS~<dR30?Wv6wKm*rcehF(W1IWD3v
zI^Qi*B2(uMP$<N4;n9aqoY3Zv+;f+9^Ii8GId<Z<BX{2Uz+DeMcxy}4yxV_OgkBKM
zpdiVv6G!G>`OuM9;=L0mZY!Cy)%ueA&Zr#qSC**1bB1dLIK*Hi`=Z4kEZ)W<nh~Xh
zVds=dk%I6Tgo^E^^iVGr8Du}iw=%{wF#e@xxgs538CIYo7|s`5fA~UCzEQ1}jMGL5
zCV|~T8deE+dzUB>w%3f0gc<0=2P)`<h<!W7Yn(;)AMP&v0?I1hQoNOmoF|F|IttfS
z;q2`aGvO!Q5ri7<f;mqTN9ngYL&jLp3FpCH>ZfFR=sUbH=&?5z5T577WC=u$8+mYh
za2A;>sDXh(Jh+7!L0rnLgMQo<a-ne_5_y{>Z=8OipI$efKm?$XEgCvI#W1T}WGYw$
zE)6<Kj4{Gl4YQ2U2|4}YoaJi$6gk<)2P0W}B@efQEHJ-xfnSr%@d@G#JboF*%3SUe
zzg!*C3hP%!59wm?%G>H+WDlJS7w;+_6>p7E(8-sOvm*5(N-gWB(4z@~qu2w!RnZN}
zB0FseVaX7^mFr_zH@Y^q_(R3x0@e;_4hN_dy%2emZeAe5CUVYmbHb7>vc0I6kGeDL
z4(uh1cDo=d2#y&I-7F!9*L3l}z|GCqs~A^%u>g<mR7JyWf4)dAlryyNmYHWRza}T`
z(ij)17|S3%1i;zatYG9VY}QWBBVWnuJiUP)VaA~4_*3ar#qeT<0>gEq(eMVA6Zx!J
z$RbM0{xhm`t>X@gZ=xTI%bUz+h2MC}ScS+H#9(j;;pU}^P7UI3)kWaGP_34bKz6=F
zLCX;uEtnPZJe*+~j5nHf3?av4NENDzAufjXjba_Tk>!{aIv+-VJTF5^XhQb%VbGkD
zFUWKJB8w=6tCX^U><rG&*J{G4i$*gT!W0*XCBrVt>OctO!ZBzr0n_R!44Payrq@IU
z%MwjSxOo@aAa*T_z*R*@>kUMW^QRCSvx{zvE~~8~)?Uey-ELN%K-`!{m4$3$wdTg2
zWZQQ`{Gl!!du~<=GBia&)DbU-hs`^^pXeyLAo|gH>%hRKO=Q@1`Pl{IG(|!vl<W)|
zl^Miny<!*m#UvDWsP1e&=ocIJi;2OA2Ov<-sRf84!f7-YF)qhWGjhhjD?jN&LU|7H
zczFR>b)!t7H#Pr!|6LKva!ue_55$Fjk+NAqCtfdSOGaf0R@<jdfOIyxOd;^ai##9!
z97PBfVFWL8!mmNZx1CXUoOn05=F{wAzaWK<NjjjJ6i|S&`p5)0;1v^rwa0u|=lQU>
z<?yh1OzTX{HSPM`f?1g>n$3n;@?QxM%Y!T4neyIoGyJzSzan^zJT8M_z=R71fDLFq
zdVh}+lMpO*k_1wU7$+xk9QX%{Hw!z=&Oeup8UOg1)HS(72iFmO0<J)CA_mbPF`SYa
z9J%GVtbAisX0QtZiLYSvdfFX?1oOg9b@8Me%#8Cy1S3<el&C8c;}A|ZsJrySt0Jq}
zTyVyOqfDdO1~lyWW@o38A`C409A_I`G)#J8F3O*~8<&G)IZprsd!L-v^Cl$SdC%eq
z1<{>hI5Q$@{SJ!T9X)ysvut;*z);#^b`tY?ur7BRaF@{0bC}-A+>QWVp3*5&^8nAV
zqON;52#%!fod4h|0xB@=yY7WCC{^Ln6z;_UTmpF~8tcsuV#>pv!kiUdusxe^9UpKm
zkPY$@i<r|y^u0lpIX|3f()=6j6Y|_?X75GJA|K!8MGxF$Rs$-3VF;F`pVq}h6``>+
zluN@VO5Yty7xuYzd`qN$nwG>1VYKW<0m;SP$l4}gwT|D=baqMeNg*n*Uj$EDXPq5N
zItI`PT4T~gwg%3uGYr~LWJ^S9$9V*VjvV~t3Df~tcV~<vbLg3LF=MioWRxaH5uSzv
zLE~3MH$mgG&h9))okGkO{!A9`1&IZi{+u&f!^8m%iP^Y1h$DzWDw6G4K?WM+%)y3J
z$$-N%?~K+L^MQA-a^FQvNyl(24_9^8G#ZNx0P;CUZXZFS_Y_FuW<?1!6yNNO;{~>;
z*%g|zBchR4X*U<t)G623w2jiD81A1%AW+Bj4-bCeD?8`0nK2Q9sgqnGph2drfadQE
z2FHbUCuheQ6*P21pJEQLxW!p(F31^kW6j_<LXyRcoKdbK>jv$c&M>?fngkQ9Rdno?
zNB;CzAG-b*?mMigrbzw8U%o`uXp#KUFI?<vtVsIwLqE_)Sw;S54!p+GcA4_Q^J46S
z$ouTUi>znhM$oV72Y>!QU)OXn!A65s#D!=CQ@qC6E~m0Eex(_FF^d54g$>z4O8$K7
zEv*M&8<fVrBVcOqJ!p*ZGv3-DBWlNxsF*tZc8%FPFdsWCrwa=$>sQeZ>x+00I?fm(
zIOK%trDc89ZsE1zGCY0~Us?3?DC%sLt>SmKvGg(PtdCPJ$tiWU_H2c^b@VV?g4QvJ
zg)bv@eOX2pVeN<WMXX<e-wi3VzQW*7qDv*Bjk2}Xq`7@di(j{1q%vxjvrSB2wyYPB
z*<8?_Ou)e>8@$D2pB;WV4UT~oM0!wk5BN5W=)eDiyi+J6m1#Od4IN%9EpU*{Xf9Zv
zKqb~!@emDSjEYxSUqcGo@C|%OzG|W;Q7{)AmpRtA2-N?=14vtci%%eHeH)(u^j-1s
zJ@N4m;^UwAqiOv!KCOSj1NeNBzOR8#u;)|p3FZiVMz*XEpHHogkJqItxOk}okMq}w
z$EVlEW4GUhYk@vo!KzIef#a3y#PKt0<9LDVKR@6uVA1Xo%Uu*S+ZPj<9$qJ=pIsZ%
zDUx?haj6s(WAX)VN7jiOnd3Dy;G&}#dt;2D9hFNSv}1_y*B5EUf`VkHf&$xnRcuom
z7oo&|4&0jyO(#>TVjM<OYrZjMdnW7+84023q@EV*7%7OwQchxMu`CgrE#?&wl{+en
z5yq^w>|)tY3tPK=p^0^8VzR=s&>@4yMtOv$GqQ;0m)jKcm-@k*l9qqUoeP0^)|cvf
zt=Q&efy{{K0<|l~wpF$LLEc$^LquYmx`M_hv#HcAijf@Lplv{<SvOmvOUsCXH1`9=
zD}?cN0@#Ww?Zj0|NHJs*5X%hFTEa(MSF^_|waKyS?J}0zWeC!?*WFPiOW^k&0P72p
zow4aca9}3;yXR1!sQKNAYnCA1;emKQB?zn%@l-(|^G=4;b7oAiHGR;Hn%SzEisTAh
zKA*T%UCO;PIo*JDr{!lNiieeb!hrc)`CQ`4BV74(S`eSYi+yFswiEg)O+o|>j^ieZ
znqN$ee7D3On#Ker)gGbwR}<G6q4|GL3!?8dAHD;N@i-WyP~A@!bl<kMUv_9@8eN#c
zAVT>qiEE8eep6ZyeW(2PW8T`Xkl|5s1pW6VZbr9qKRPW!!nDRL#^79?xZ(&4u1E`_
z?<{!vaXHzf>6L;;8%Y{7W<?HDsvw7=6Kj?hteQ{U+-_N=O}mq0Gr)I-mN5~&Gg#__
z&?w;>(V*jrk%_SH?zABK&b~`Mj!{28!?Cw^%v+<ZU|l_NQ@dr|%cebUaUajPc4AyL
zF)9(pmC}OfJL4wju>quR=Cu>FcuB{cj-qJMY{8y)CvH%;?3tRz1UF$cgT;CRqlhX!
zpSbo2N8XthM3^H+;z*XGj6(%I#o#A7EXzlynAWlRER#YEyxWbw+WPx@(vH5A&|pyJ
ztN}DcP~{I3GbvumD29nBDX)=H#<iC3&i`KGx*{_5+k%koXxM%Po0^C_PByVXz~(;l
z0RyWc5%>+#(upe|X#4HN?d_7b&dzD<js#ZRGhzi0V-?ZiZzZljLho;;rFUAHojj7q
z%4S-`q#ZSlQkdA$Y(eVD!QOc65ixeArgayi8F-C^QH0QAiEED#I+GTJZ=Hr1L|ZeG
zmLn4n(Hi!442k3leq5WlIo*o><TS6T2R?1taWHY^5q8X`1rcUPivET=3qeJpeJMcr
zSbRe$aIXV<BM;I7Ozg@H8N)!jXhI<|A-ffX%(U&{5Yb3IakUW<cswnL{uAGwatIUO
zPZz|0E^!mOC%(JWGsYagC2_S8;=eI1h%oU}D37my!rMpz!pGt_)AqsAW#qZocJ5AF
zTc6t7QKtEWZjLqSxs1P-m^blKMNM1FW&C{Nx+0?VIR>$TlO9udVEqaAmvUw>q^2?X
zLS0`-+}JJ&>+G1umL0-rri0pkC2{o;TK`#E5Wd3viC|Z+JFLn3Fau|<v<sL-vjt1G
zZtIO-8Ig7Pm13z`r?AN8#I;8_^1shnj!YcGMyC~T`aGm0kzB!#J&7sOt%^)eV>g7k
z(n&$COk8<{9havC(SHTu*})?f9Kj$Lo(9doSQMrOvjsy=ByLc*44D%1gL(iXNlrha
za4d1{5sn;93!?8Fxfm;{N@m_{@Zv5kFTql0tY#N0cNOMzEGhU@OWe$E`E<#&A@Q8y
zU@sOW2JnoqtehB;2+ORrAo|X-9Vh5Wm<}tJ;tB``wGua~TL$f%=5@C-omW8oNaFe<
ze0h6X5Pj#%#O)x#DeXvoNuI@|s81wUaOBg8o6{{vCZ~BP^bGdXN_-+}@`=QiN7(U8
zX+iXz9iw-+OZ6kOA!?Rj#D7oRkZu_<hUs{@X@D?^aN)lut~tVm|B@C&-?;!Yg-u^H
zP;n=y$OW*qMpb*2IABZBlC_HqZfzRsm&<$^7I6uTXWR)a>T&FuMs-FW2^QhtzosR>
zzp(3H(t-$cFhwB2k41=KYzh!Q7N1T#7Lc(BUL(43u?TPVc2Eqhmw9oB8+#;Z)U37Q
z5Z5QJD`E%^Gl&h0LtJ<_7P-)Ye<t}PV$Yd2&j+ssDe816Cp7xu#Ep-)zY#(^7flxf
zIL_dZAsh}jL-U6*#`vMcXheAMKw1#K65T7<*e*ViI`TFy8FZ{%!{J7u(Qr6Z@a5^m
zt?8C86Vs9vro<*<S636)9bv|4LCJOorTtuP+L^3TL0hcDpp$eI9Z<6bdEcM7iQSTS
zY+BG2>n{kC2yx$=xaJ6Pe>5!!U(#EGKkXzvEf>b`HfcAd7BA?bOu>m?OWc@lIWYkP
zMA*!<74*+1t~<hu&!q*?cV1j@zk4)-+dsr|rF}8MpTA7pz;5|-;k0*ngWEf_<<yIb
zv50W$t7$=mIhDds^Ibh*7*l}ou~?&*O0B#1)y>m5#YW@tbjXH|hcbn1?8XU{z1Y(c
zbsi=VL1%2lDZw#zbVuU4BN8!@7DU&)NbfPs;{+t5AT>A4j8LXv#*K+v)2*UTOyj5>
zU?a6Oh8fo<t~<hv!wg~rUFb=eLlJ_FwTsbgLFU&cZfdt=o+8hIF>2pqy*hF25kj9#
z3&NNB`vtFh?LF+qR#iIxXvyucVg@vA$_U;(lelT!^5(qhvc%2ps@e=>o=S{Dgh4B5
zL4+BUqL=YIDxr@lK=@d!(NU!~j=S%}7Ev5FfMw24wzH9K$_P36NMZ_iFDJBp)x)j5
z#r%cDC`9Ds=NQBWTFfbL7j%5T6q7IL{RfE~+bz9!U}hI`Ks&SB)B1N4S0ADEm(zmq
zwc$4eyLxRjFBQEPSxvp-?^Bl?Qb)pTloibSUgD;9%dD5lp)rlg^a}R-sGN(AmA{i1
zl?dbhHZ6$0Gj6x9O_(ylv3EG>KODMfQ${fA{E>cn-{%Fi3X>=vZj!qG9R04uC`1@E
zl@>(b8FWQpR-Uv=i|ck&1?%n=!M-0z-0*Jo>`JiDo2MsTn~Cd`qUv@-VvHi(ye=(>
zzH{^9BRITnwTxSJB1SSayy{p|@GhIUnced4l4;$=Gh!fP240UQMkK<r*Q5o}ca~ii
zWSJ+>xH75DTz?nk1^eEVxXInJ?{bBG0h~Ln2Y7vAbRtYVlNLnZnfUSm6M4cxUF;On
zy){b<2L5c~=61_KEyzH|7it*bV~h^|bYf&8?EA^IAo|X}%kIM&Xyja;EY_>drJ_4D
z_xi#R1G^|MSok}Mo7^o6FQ2XnoM&)OGU4nF*}YychKawG7@Y_ce?2XTFcVV@y8Usx
z7!{@f;bS4j?I}R`ScnPn6d-&o4y29O6Ban>j?cPkHv!rE-4$(4ehbb-TKm2A4U?JP
z`0mumwbnO`C9W$X+8GA1fuV-syLfI0r#lA;==jOPh|DE!TD%d7kkJ{L#s)MTEe;GM
zHT+S}{=~IL2)Z{d2wy+05<Ka3JYhSI(Se~fZMv0JA-<9$=>K5iW^_ycQ94Y=!z03i
z`w~|iVZl9VLG+ykJLnuQ1UB1pBCdd7$a3OFb<2>Q({!2_CV@KgrIEP)2w$E^3!?9Q
z+4@?eUR8BMBnjHTFEQfX(tdFINvb)b1wWR!#t60Fl@>(bsg33IOT4<R-C3(~1q3I)
zkhoFZa)Q>|GgfkI7as*5;mfZiu0O(;&!h#>cfL%Dla`O*x~?K7I?TMP5z%bHldmOi
zP`5mpn#K|AIPeCYmWxq@BQGSbJ;IT%qy^D;j_jmJGLB3wwLO+NwuIoz(DpugqRuXk
zA`@O6m1S#U1R|{2oEAjiSu=d6dD`UL-xXKNPZmtLCUFD0RgRJAf{Q^!DfT3;HA49-
z(}L(f<sYcxDj!5HRP!|KB@4>mo45hpQy#$wfkA}wClc2hq5QG5Ai|VSF-Z5v`C?$0
z0)&snP+Gex$N7Ac^~R0!+aH}C)Nt!2Z>axVVn)SF7`1b)q5fME*A<bgH!_H}Lw&1;
zhT*0I+%H16cDWZdgpL94{&oWYItFgv5DswVoBePJ=e&C3#k08NM>)cR5`y<$(C_$*
zFDNH^^97}P`%vfyU;OiI%Wy{Jr5En)i+ik(f-2U>=<&<+_yj#ZMUT(W<8yczxc@?5
zkvB#U;_?Wc@1buw?FGi!x>Twz;BuC2Sg4F6RPk+0*6bw=V>c8ofyI3*$H9GZ<h!^?
z3D?Z)%RagIr(3D@Yrsgb*5?&2*Qqw^IKtk!dF~<H=3>t+;7Z5J+?}|CgO9D9TY>}C
zT$sz(S8I)GX^yU0nZrc_Se7L}X6XhWhpx&oa5apup#PDoN^>KHZ$*U6t;>qMZar8a
zTF9s1Z=4m0x!pi9A9s7^<C}>a7H>YNfoqwMZzQfOVm`jcAljOb-f#RE<FgHL?+eZD
zh9Xv>JRz^cqe<npOM*J%^3-z|7fBpHa5$K_>Ii)Y(t_|i-2YFosMmqR;dx`3w`_(S
zE-zV-e}CczbW8pbEK`;kL@2*Eajg-`UzHX_nDQy?oNp?Hex(56WAQ>-Etd`#U!bya
zrn1u=D~ip0m1i@J5UU<W4lYT0t@wCUd^|2ba{Li5W7N`kn|T^<33*;fT$hxrCp-{Y
z2C;!QbMijiBuy8?X?C+lTM|{3jb@9czBzGIyCf?em?SZpaWRrq@(KNh#I;8V{Y+XA
zr#xOgC3w|q<0+5xZQ8gPTxEumBlz%hiJQ?aA4X*;P2dq>!OtYFIKqOTN(-XzESRL}
z7LyNmyF=sq2ZPqdiDnCC{BGg~b<2z?o&sZxX7ZSJ!HtL!j(j<B?GcXrMp_VEb0qab
z|EsVt7MFeUITi~>W7#k&ntQ<+-E(k<7UOVq`;uVacM`Y0TlQT|=Z{G2XC(GBa%hF+
z&zMN#GnKrxD88lp+r&6UnEKZYVgtLBDY_gF=MZXGER0*LadWq7#$xgX1E$7Qcf4nP
zH4a9s3Y=zqoFWP|p1Ar5t+%HI;VaNEgJ`=bCGD0@aqm-L*^^??BDsPg*ClRFw;CaD
zg$m#kVaK7wl}Feymlj0d*|FtzGvsM;iXi)I5~JNM*|$zFpxy|nUzNDR2&o@T3!?9&
z9`~liVtR;hreMIC#Et2e0Tcd2n7}5&izgG;9pS}tS`dBb#jc~cKAZdSS`}Md;`;3P
zB7!eJnYdxy@@4n*qQq>5F>BW!|Hs4_M7Z<5v>^J<oxrK?O79Rz7kv2j#7*dy4>6~`
z`_9mp5?31`{uk1M=sWR)_lvk!eJEUrD<IhM&BTrBmK~igAo2O~jl}gw`0};1Ao|W1
z5jeKpK(4})P@dq%*m%FZ*fv3BpAnhFRYw>xlomw)8S#LDu|!3aM*ymfQ1b*M4km6&
zw`wsyU1wZE#}WFBm`z-Dgb~-I1<`j#Ox)izamuQH>$1X%NUmVULy4QyEi)!@b`bEH
z@$r$g^x5%1;>siJxHm0`FgyHs{o2D@iN&H9auj3v6d-&o`V_U?b`Q?%tcTX<yNN;s
z-jbMv-HO1_bXn9M;rtsD*BRmb>(YYgJIyn9ku8ilC_I=UX#b(ajp&y4+oug5iwOPy
zQ{s9f^#5R55Phfr&|ND!j_C=7x4cwA`QJ;7ez%k##)<5r{s`HBJ8`8Evj1jU5Mi>X
zuvWgo6Z2syK=@cZnl^+=STq-!&IDFCWwG`q>#ndl)7oQw9P@$4NBFA8<J&B{_v3iR
zqQlFM@8s=f_(iLjj&J7WB*(W{G=X@0N7ET6Xtt3Ti+SwUnU+Xe#Fh$P-@{3ha#dAU
zE&`%N28hK_-K;>eok?D?lx<YAb%U;HEdYXe^&R*m+}_EnnEYR~oXP)1>ze#uw7|*#
zMJt{BU$o@O`_**DXeATs<yB#J>m4m;%3Zjmq-F}$GS0ccrE@x==4{UM$M$-)+Q{0g
z<%MdgWjzNxoox?_U)~C{Zy|Nw8MVy?nxi?gfZ#6HY`MR0H%irI{2t^xpz&pU;7EM@
z9KvEII<l!XZ~Y!npLZrq`vD_Z=BzW4#d*4=LLDoy9&0&cS=xzzho911aE7W2mXXIP
z9bn9}#M@0xXCz<LD@%rLG`J~4@@KHfFfMu!7Ms{1Uc`Gck$FGn{sQL~DW&Ob$=7NG
z(mH<vlg<AD)mazdn@SMt5+u!Am(tT2;l|%vzqf`Kk2eh1DIDl`ADu{KBW2W0!Tx#t
zwqDM!YW!rPSeN1ZS?h8<F<pKIe_(CY_fU19!GqwRvBH?irg*FN2wPGTyiK<);)9d~
zAEYGspnZ1uAVI_jElI)$Dam84X44t4sNs98t57jCWJsJ-s}Or@S#K1Bg~p1you#dM
z4c?03B5;=LKg-ph<=W43<!8C>vt0FAuK8@!<K#eXH2~T=!Dx87TWIZ@kDi}yH(1S_
z?X`M!smiPV7-!jxZ6$rdzyb7l)frwgDuQ~J4(P=zoH4srG%G8!e2oK^=1pZ!*7b@F
zzM(z$)vGJ3SYx@zT0m)MB3sg*T+QO77%o7oFR`YN-v_k-nr2{H&fqcTPowpQmbHlY
ztR;FB>0#pW*4DGFg}1h_T(OGf(Zoq$zDj$f#joNORsqHKgx+;V@8J`iv3;N3iG%(`
z0QxrDpyR1q)-n>?f!zKe7sA0RnDvf>xDtS<AQ?v4*?He;qllv+6eOvY?nUD*7R<nJ
zXV|?ny@hhS1H1eyOIc6@r&ZfRa6_5iK~qk5$GyB2x{TX%v1-#31m?aJfoEG*70tA2
zOep*!ib=BJ*E96%b#C4p=@)63^(K5n_Op~g+GV|!6I^L_264C&w4Myf)<(5ZWzm)T
zI!FmDky2ZWyPXkA%T{QX*|RV&0<N>uT_39Da&!CkY5V4Kxt8@cR@yz*SMj;`4Gf%1
zZ#_wM$!zNz1VAJO$BU2$vgX!L0A*NRm}Xvp+7gS4hrQnlB6vwuYJCOo79Wexj9_H_
z4b>#yWPC=&1|}>SZ0IY>ETt&RsC|s+`m^--d3yW~^%<h)NVV4WUkC{X{E;YN=ScGP
zxZDQO1YVTOxE<dDYyFF;AixoiY*EU5fQFa~W$rZcCG-};mIgUyaanG_m!b{m4Q0L%
z1#Equ(x`7bK7^(b<DD^iv3Zv7SqTa2#G<yM-GcwuXsh`Dq$-J#++Y)3q5LCMnT*HI
z$V$0%lU>6hbTBx$`VEV#;hZ>wSYm~wv(9h{9zv6h9M*-4#no^Ci{?_Xg#V2!?uube
zwf;G#fh>CgLW~GGQmNHk@ZIHa0|@+=(SUPfw{+{foXnkhOzuC3+<)Q^F)nb1;IWb@
zwAxB;04?HA_oDafVbK$l(X{bdr^N&6LSBoDv-Ev0DkQy;zVAc<2U<6Q*8L$$1Qg4;
zWO4tJc9Zs$zJKA2wrA0-X!>65mRq$)^vARXRq#3&jg!JnlS!q}`YN^H1$z7i9%ro=
z@$}`*`Z|81H((jFzCp#vs0G?MCD^PIB1W(#XcBXVc7sb+g=LEiXi9+?@v^>6IJC2g
z0lbLz-AmRt!;-b_guYsBsuS-Pm*ToF2BG_6=r4!@4m9cl*PM;eatLgatQA#L_OP{i
z)23Hq3t7$9s*74snKiv`Xw~|XUg7gkvHKN=1;F<q{|$W_sqAbfXv(!^Z0yh)MMJYO
z1PYeZ;F?x(x)1IJ^0Jqx(%H-jZ1Ui$8^#JIZHsz?>lKxtLPY)yO0Mvm3kDAEg>Sn=
z$m*E@x=IxQ63E)GEn|3PXtbXsT2;oY3Z59QE`mQ}LgWlh*BHexS!Okym{74X2CDDZ
zV0twfDcPT)rY%-W7$FjZ?h3L1BKA#+zJ8zf8%z730krm$-mq%!i)zq1Y`qiEw6N*B
zNK~k*Y>dgjA>>|UG)ORZXW?^|-Hv_Q3cf$-x*(a%5@)O`;^m|V6Qq>uu-phTC39HT
z-Bn!HhF*JtN}!8;cmg);WYM&x!eXqhHI}PE6JYO$<s$8@Yq`Z7j<6+5CVwyGpwdUM
zrV#p@5jMhI1?rZ~E#*3zCMxHdxD0*);z`#I;);Pv-b5@{(`z_*U0jbwwjyX5U@h6e
z<#NpF9N^J?gBh4PfMW}mFX9dK{{#T7W5dYfd5sSV->>CXMayze=4M?<*dqo<d%Gr&
zGE#98yeD{dtb;NM$9jTy7gGEQ5?z7gs*JFlEoiQbyuf|)qJonvk0(3Sq+8u@4V7MK
z1TDWk&`=)HjVW@YAmxPe{FmEx`qqQ05ToHs;fAZ5%H4(+d)jbofxxjLB;L7gy|ArL
zsO|1h&Ig)+23<1$sg0n)AoE*ouS`qTwl4Ym_Kj%Ur5){=+U7ONrlLiceE!LepvCrp
z?N(c^<n*(hAK!>}-k7>qQmL{II9<??qc1};`V#6KM!fD(?IH%b(^Rl@t>u?{N?FH4
z%x{TnGBbXctzhB=GyK<jZxp}M)26oR7_REh7f~tD?Mtbsvl{L;)s-TyAbe*ds1ws=
zSZ||>gB@(N=YKNXgeMjHxlI_D>S+)mzUSXOtJLk_w~u{0p$&%x)i9tH7niw#$P$VT
z?GrVH2S{P)4ko)e*b)v2`RQ>rb{h$zph@?UpfQ{StAw|QvBQrKx=`q7aXA))t9r{u
zKj=Rl1ssS49YV80BPZv}Zj?gqhqZ+b!^T9>1XtN{G<Cfp;yW}wgW(Acp$z<|m`^5`
zqv@LcoJb?6HQq;AE*glnQ0T|V5I~H0XmCVe&|mQ_aUM9WtgoW8*2G0&2ozz<3GSyg
zORM1l&!OZEQ`qIC0U)IJaFh#PJi+=cNPS@F>TDC_RJ*f*xqS*UuKwTL0dn#okM$>>
zVIq{>Zfsm-t%8UX&P><h;M|@VS`F-*Qz~*>eD6lI7`+oo^IC$dAn0`aQaTFF1!g}b
zh34WZw6GBry1)188VoTxeSp6<-NU^~%0BB_QIl$Wp-ka<oQ1i4hzTJ`g@3wgW--~F
znVSpb21PNWyoVq2;?Bl>a}gk_71@XigIsiV_9-?dN$k<O1BExV;lcYb_Y-EbGwgP5
zk=e>%&UzdO>S?=oAP$Bdi0#K{g2i0Kz2>0_N-oMi#JhW|_P!7Cd=zlNhqxo^Lp=N}
zqOWdm%PYeK=IFFBOJX;uL#J3PLa!XM#KN_@o=4Yj%i-vvi6u`NFIg)$@e(?D1D=IZ
zhvm`ksx0A}>!MaN8hDQ&;lx7#$kW`=o?I@Q%k34wGXDIF2heuCh6p6seG0;wWt?eR
zFmWu|{!A1wBF8{NLlhTtTBz)5QQ3o4n&R>qr4{wlnE0vzoL<V54a}Nh5=cgM-HG}A
zn$0s{tBg{m%I$2@yc!D9x-KlCD;xD05$7#rIIyeju?<7Zxyy*y6yM%7OATBZB9CIN
z*6mz&Z`cQV`laNG+FQP~s0i!u!Kh@n_sa%Zs#JrzIjc0vwRa!x05^#hlym03S4IfC
zUfIch2)NQ5r$1Hnm-b)S2-;8VRc(Muwn%Qe7Q?KBr0r^@9#`7_?~Q12gQRVvEu7L^
z=cPfR3*IenQAco>uWgxC#=d+FORmyk&C&wpzwD7%I9qx7y0d1r&LC#+%tFg~xx4h0
zPn)6b0Ms$bv$)YQxod&^^9jkWIm1|eRV|&S6Gu0@Ms5IISkR+%C}C}uggv~Jj{IGs
zCe;A~Y8;Rrfj85@mI9-$hNPjE?iy7QxOUG*RcAHNm)m)G`ANWQP$i>nsUT6Tu^nza
zaXWqM+3HdMFxhZe?u4MsHdF_Cga<Z1L=vOnk3J8&U#_MvwCKmEXDK5yFH6zqA<CpL
zS5q-jihio(=q2DF1zl5m5w|Bv7rpL*ibBb-+&Wv#!Xa-^;_Q}lATzuYU}hPMw`veS
zU9PQEgR0^6s?W)3?SS0Ii8pf^^x%CNF^llF2W2%JZ4G6vXT(I~ita~D4~0ieYg(%y
z`z?N*M^Qi6Qw6g8QPj;*z=2WJLuhR{5?em0tR4%{T^U(ua%6!pf_F%n2wx#InhB05
zXswGsq>xKT3SzB@x(?0R;JOuN%oC-U87HDN^ZfH9N-F*6xcP-wi<(sKxF&u`#syRZ
z@B9NXrlBuj{SGbhS=RCxM`Cy?Ho`P8c3W80>P@jKF_$k^YqLc=M++qz6z##lwQ*Ah
zJ97}-Ucu<Kk}(%E7)+kV5<@J1%a@u3BO~^KWbEdG{DuQ;#C78tdDtvo(U;0PKB_PR
zja6D~Sjo^5*^F2khOu$R<eMZjx}Cwn-WYxY{-U{35+8N(L3NkShI!h^cqe3KXs9l3
zhQ`jh<w|BDw36)KDGh>x>UJ8BLQ2yvgOfJd6SO#K4EMbaS3I|23T6qr|5V3fY<5=5
zx(=nU*4;0Evi^}gN808iv2*JY`yra0aRhRMAV^?FBj6Ba)SSRhD0RNfMPKp#tTSW|
z*f2ar-+JceSQiqw(8S}isA&aRXi~_-dH4h(Tv$`6{0U_iNm7m7A5wM2Pfy9@PpQA+
zmrz~U59LoNuSjAIc5|WQ?pOL0Cc#VbtOuvC#qsr8lrk5+(&#_PHpt(??0A`;jSwkp
zYsfHo1@J`}8<E1W>M~baEVrz*b?#3xS&EzYed>}W?<IBP%+^_!>?GZ2ysx_z8w|m}
zHFtR^3Ke#A_mHQ1xW!h-a7Syiz|iw;-w1o8cje()he@5;PN?0w;@UbF8Y>9RHvDC$
zh3vvA4@|JB(4y+BG631m`LP8t&_yw_lA;)lMA(6Qo9e&`k3o(aZFe`o)ffPx|JEBA
z7>hZzqG8t2W7}24jnOOPCQvcW4o?H~JkW6?kNx9VCmVQ?Bj&>EqupI7hhE()SJLf<
z7YY`WhwtbHw-;ako(;n;D5BQSdK~;2`qn#3ALjzTE>2ctA6wLw&Na}Lh4-KC61N4i
zi|rB~+jxV!9OH{94gZYS@K5!&;XDutb#ZSJ4gWZ5lFfCtHF$@M>QV$+Eh8G$5>0Eg
zDV1QQHO;)0mdygT)*s*N`$7V`!0tB%cE5v<IG-YAWm9rU@L!0^Y${|u+`vI}Z+f9!
z^SH>CI!=9PCmR9?9pFKm=ws0i+lpaVd{mL~lNB-fpB~!Zp>O@wk7ose{uVVQb8{s_
z2L&Mnl>fm{tZ(6?E4qvw2^vC`IH5d+LYbW|V~6S6hEQk_HKn1DwbesbkSE+bx*Z~&
zhk<h|V!|p8%cCIi*HSY|h<%(sEL02aM0t<(S8bTNr+YRJ<#M;&a%*71BeW{YdIgav
zXiT@DyfQp+hhsPPmf!y5+jVK#8`tSPC#ZZVElgiz<`_ixq#mr()^AmlWSXKuuO>RO
zX?%#j^;d%=IUeX0Ig)FTb-CBx{ftE~#2Rb)9u2PB3Q0As^;7bBQ_;Yq@$0%)d&>r2
zu$yVA9w*p8EM%sh7N#%QRl$a?yNYfF`^SimEZFa+Z~YZ)Nsi}xMUHbvu;(6aZ?1U}
zYcO93_S~bf7W=ckWrHu+pG-^jIKg&=%=~g%n7&~DX9m%Gi~V1Tjx5-JLf`r;*peK7
z+$(aNBZ7S?IU-n$p37Y(K5p@T;<wvt?ulEqO$FToa)s_Kx5Ntk|LQG!e1ZQb=7y+z
zv!>MT;I|MCD%4Im;@U-o2(|07_;!u&Y7aR{ph*tSx@wm-MwPPE%hrcGS@ta>ZGit6
z-w5qoZNz0!0o#H!h0CrJe5k*TNTIB8CiU%tZ-2jj8}eNt_+9%76ErXC$Jo^PvlGcx
z9OL^vfxEZ2RPI2c6R2sOLrX!T6rAgaWBiI-4x>F-*_*`^>WLq>;sZN}ZoWeN5+66;
zB7f4SYlor+7|Sz*<41NlHph<;?cTD@H&a#SQmpw6m?<jNwf#l2Kq9x<67<cnI{%gq
za6Rk$uC0HwiT^BdTG!g4g}|nu?%RiWV%Q90taEe33J=^IZ@+%Do3^|ZO&}3fxiN5S
zd=oyjAx+3AqTp=K$WA_ykP&MF$|aqbo3Bt{yIsq#Y)HFQ=Ov^)@zQl`v<bJyH{tis
z$tJ*0VOyt)*A}G3^5KPZwGp=l4YiP^El7)P#Q*GXBU1Esah>oxg`ZLavg_=GO$O2Z
z&@bYNC^67TuHvUm?RFjG3HsLG;h-eZC~E2niBfQ`AASlf<I_(EEPkj{vknqvgJJ1`
zr=N}$^uxVnf$ww7rKNbBpg%7JeScb*evD%;gXmt+yA9smPjuwb-o5m#zd|j^aiUk`
zI7fsUKIP*bWcmprY*3~*KOQU6c5fNri*z+Dz2ijsUD9@^h3Sj5$soEH>8&MWF*MI2
zk`ycbBSb|O=y%Y!{tC1thSMuzoFf7aD}B{f9VGf=MA@K34_tLstVsWIZ&~1r^heWD
zJWiy4RLIMR)57#c`a=w&dy($eO8*hjk%jsX=v#k<T9V^;dqs|OM5tk<r#r~>cZsk;
znch4dE7ITVEdzX!{&re=$BFcNgtUAsElgjezsVqaFVa)zxgtG5-})=kk{qL`X`SA*
zAjdf((pMrzC&PXs?su#A)BPP7!$)I$u=DhSIzS${H9pFBxVLQb1%HmYvR0IjO0|=c
z*w|Pk%r|gze4OvD4v@V#Uz*rh_YI2)z#w|T+*Fyf1!=Kn>DA|IBW}Jq!iX(Mi*1B?
zt~TP<Xe<nzh!4R$)!#;>Fg<Y{#QQ`Cu^-5;(<1I=5Z!kW-MR7aB`UJV^JBfGX9r@u
zt5?KG!J~czTejzN*YM2GjBn$kodEnIlv2&i=4)d0^H+My3cm~ZG*f=9E`UmP-36do
zfo4n4GqKJ3{SI)~)d7fRrI3a=A$`A4hfgr6QlRC#biX91-Sy;dcN+V*L`Bxvzv(SK
zI}qc4^okfMc+?M#eL0SKWR0cs8*@4McX-ahhoc`IT{(z5-VAAR{27N6=eJj*6msQj
z@pb@)CnKhc+fF!9sU%t)T<<AB$1mr+tOMK)YF3OJ2fl!dA--H0YlaS=lMTQafdo)(
z!N6R+?{n9=+JvC;2mu|qGQJ6~?r#%P7@9cy_Y=a>4g=YBx^IIFqSx-*X`&)`294g*
zvjZ`n=oK+i@Tec10W|ONPV)-yCdvjQRs)a6Pb~acZ&~0Q{8n0u$8qr|g}nSoTA03n
z^L7T&y-0T(h5aPak%ju>^sT=kD@l%z^@<$lh)`dg%iRWd2L8-#^7AtGZZ5-z+sDL?
zQBc~=mmbD#vAyV@_Leoiu>Uc0LUtaS>fSg5ND!hy#oCERT%3x?pf+saw)mF)O$W&9
za&S7e%=&Apm4#jw3r*QO@NfdWlf1bsmN);p5iJO<(+(_kO3Ip`OiI3A7T>Um3)(Zi
z2dqh<yKxrwgMyEL1TL)8Y508x(Y=N3ZUi|?RAf=x-&=ZiAjV$Q)DvQ);88!EhMjww
z6}`T?7X}vL4?Lgo&5OLLY}hTL=&0i-3m%;4z=Mb(gAwR9+VW5bxa-mtLU`@rXVPW`
z=qGL4GYZ|@Wt>a>ZB`2Lij(@E5xhOdq)I_;-^n^EsNHoCsaq%OS)wBwfj9S-q8-Tb
zhF*~)1((7`AUO!!5YOAm1=Ym43rV0jTXATF-8w!X&lhmdtPt?TX%=C4biB;9-a(47
z=OwzQ74R`F(m9GbKgK__Z$5fDqV-QWIxBoAqIVoBAMfHGhw2~R0<>aw^mlzr@k36=
zyE#!Fo!b4miL2pr6EF475kE<nEtibbM#(=?T(Kk;zs#cl#omg(e`?~dMgjW_IR5i6
zpW%Zv{By;{NqTg(!f9LxW8fGaI(ObXYe!rxOn39rWiqv<xW5?Z-QW;CobOj@;@EXF
zuhHpLw#Fy2<E~;p&3$o|@1wDC2{NDFY8y{9={z1gbjHq0i;A+!><@^J%&OmuQnc4+
zDt=hhr1B1|`sKFgL_`kL2?(FZF?H0jE4GNz=oh?3|9Nj49e0?{M@6Im8)`yRf1_<v
zdwh`1sN5^*A7t|_fkBV!+0(9`7u&S77sn^~r{5@XBR^ST_xOdbjE~Z{{)Rh#Nw9ka
zHLcSf-^L)iADax_BW{vV)xk?uNOGk|lIaa2iPkHUg!}L=wyOEg$(FQO?4{k&Y$>H8
zU4w+Uql$WR?hVEv!O84UtiqZnt_4G;Z6><!>n(TvAkvAnWQ_A(KQ8EcEG^7{GtVHp
z*O}oXg#u2vtyWZ}@sky;sSq_;1WNR+zlKB-#q1SP)}=Lf2)g#*K&Q|EJ1p35C&DU%
z9lzA!oxNp%FW636ddCU&Cxx_}O$*Z(>}MH7_kz9s!R7*vY0gJwTgg$x`y)hC7Vi(!
zxBiN^B+Z9<MVfO*yo1XZ!s7k=L|8?<<Cix4VQ(4Wi}&xQrFWcoe_BY(m(#-Z#rroH
zMEBx7eowR1Fl!|<kCRZt);pZ32>IU;Wkokm-})=$l0e_=6@ktjArCHQ2@Co7MPVV2
zU+6MP<$A{eU&u!RIF<7qC*+?M(lU}3rZ42%7)19%K71z*`L!eB?I$aOJxkPN!QM~b
zdPmm|MA_RbqMRdwO>2ZYtyGvN$_CB%z+C)Fh5LHT0$;RGq@{Qq7k@>_%dxaDebGM3
zAi5Xr={pP)H<vEqE=3{YbX_8?6|7h3TE&9atnGDOayi?xBl?OGb#&qihz6EAa3gL8
zC}`X|t<-CFfSY1Y!sjv}?9Kp<Dl`eIyrX8V-PROZ)<JAcMlwY^!(x*HEq^@U(~-%Q
z{v2aiF07v-W(ReDbNuSZpYE4Xd>}2o<9PUaAuaDu3)AP}dl^Lcsy}p3wa_dzLr0){
zsX+m^zC^U-KJAP2t-pPmB+0M#iX`WVSffw7vQwY-B2hLd*8^9^_i116Eem{W_d;5V
z#|icqg}i(vElgjq|BOL&FW8s49TeY?(zLZbV*1F?YC57!l_jr76Z7v~lvk8t;9^%9
zHqp2KDuX2BzxIlZ=Z-RTT#9-*QC3lgHcL^j=q(F;WzYb)XJeNy31zr6Elgh-E@BYf
zE5rC*D>YpIg1gD%2I!$oMa*v}%CgPBjlT6)%q4+t=@o&_5i!S}+tSjZ4$jO1kv1sj
zTTotcr`_d1h2Ap37xY|On#WoF|4T^BV`*Xfg8o_t(Y>Hw<XZhwbqT8p8pX1<XF<0O
z?NG?vcPgkTz#EC;tN^d4Z~avONw_n;BHTHm03*2^-yYLJ1%8T%8&rWoao<dk7p@Zg
zbZ;5qE5QfS(mhTIenUvj`_sbomEgS$qI)H{>~^z(yQpwokG2PEUi6ZNB{6J+_EfGp
zxHp&cbU_a0cg4M+*dHgph-l&$JMbesaC1h3h`2!o;erjr>M@2&)h^e++@Y2f!(N~3
zguXkx-@I3;+rjU(+n7SjIta|KGCC<*6c(5iX!T<tkKV7WuXIrTe<a2RReuZ0D{OE@
z;Q#HH2>g9on#b|+w}ixeH!Vz`kAKG?x>x+6d-N5v+$^hV<)sE~sde5ZZojsRzV)|X
zlO&l!O{u);FiFlK(Kag`MEiOott#4PC04X==q(d`>vnBgn#YOuZwt{rm=>nb$5{rE
zM6}IHoM_8bMYLZ<v}Bj<Bz^0zXiJjZ-z$>zK(teU_-StqrdUpu1Vm_|xAkEUmRMyO
zhDD3Kuj^)!xAk!klDbGWbO~_G3UB99cLDbdtqc|mq-Xp!s^P`oUU6PXEZ0*9i?3(t
zH?4o}ey#WW!)v`K=j9sb6DBSw*0H8uk#;W6(*CyIO1r<j`-h`|1IxRAAI%Fd@BW61
zb4lW?;g)+1m#;5lP}VRixWrgnFlkHCeyy5s=%xL*=RR+i=}WbqDH<!f{H@^%2o74z
zYIGMW59Y8yT*v+FObrcJwHFM0Et?f_rMua%>GoAzl6(_xDLAlzd8|d;_vu!Lq^eAk
zHCN<<aX8B2Ju08^@X;#;c+Usm!Z4fwZr(z2=|{iy9BH*8AkI01m9WY0jS7>uvOO|d
zK)9S3s5&$Q2NskTy6)izJ3vn1Py2l+q3n(j#uQ;v@NhzTDccL_47azc)Z@1IlN-_A
zIc{(FnxbIpBz`+3&4S|#o+BPO5I=<Y@<z~XDrzW#CfkY0U%TDmZnTSa)^RS}ABvh(
zlMdk?Y_maNkCjn#oLzUV=;c~TY^rhXyDG8qMS?W2{)!mE-PT|BmL(Sg-H?ND{QnU(
zy@;C7)IY>+;DM#$&fgun?ppVjd+&2@PP<d|NN!J)IS^AWuGqps@pr%jrlHvF+}-)W
zs)t{3y<dR8q13(98Ty4*j@}h2L!j;sbdQn&nFA|}Mt4P3R{eWxd{78oL;5|IizHoy
z^;No2{snsc1s-Ru7x8q4^7YkPqgrZNU&qfgEx8%z8&oWGskb7LVbvxN`Fh_&o`po~
zv6~^CG0FbyLaCZR)p}0Wc$jp6l}pug#saPWz3rPe!D|k?Z4ckSnbO6MI#;t}Ts3%8
z0WZk&(6qW?V<9MB$SfcN>Fu|p4Sl)>e+>Rv$*3$*T+*C1X7|(nyj88JpElU-hL`n7
z<uT!AW$bF%&~laBUg7u2_ae?7?Ez$;ki0axA#lN{XHaFqTq0Kxo+hQs=FEn*8XFJm
zhE_do)Js+PoQ3_o{nM_}OBotFkb`Mf7L9rx=r7i*W$Z(&G>jE$r?y-)^Ti;1Dowi(
zXEoPK-sI|=bP}I>2??xr&Mzq@LOi!$3PEi%K#w?sh$OOnxC9kZ<1I*2+U08Xt`4x1
z=(^M?-yI~RU3V};UA+)i1qmmZ(M4MyoK*XyEf9URotxtWM_2c@l?%YbN7rrTm;MjX
z!l2=I{!eI-&!%=76z*42x{O~HHK|<*M5B9`@q!a>7(kk7vo3aQt0LaMSde+vT_p0{
zyWP=S;g542|5DU+o6z}?>-g{lI?MwL2M-(!_<H1p!AZMGd*s^3_T&3OZ69q@N3TR3
zq3D$|2dW1T9S(V&;-!O!=&i%CFRiqF>3VwU+PIf8Vcb0Yp3=|EYI`JWG!)bKYPZ~~
z=@}{!{sVHlc8hilUEdP5q^`m4qW?3{dsehtZ;=y@2M;JL{XT(W2ow}%x3jvR<ts_I
zv~Cwvk?gRkAQ$u%FNF(wew+(R!9xT-tHB7OjwoNXv|6c_O=M{cs~lUTRqT2oBV()}
zrf1W>4fX^PC*;E*aw|CiYb+axMd}qgZ=yo4;%>jE;ee8r(zSf4YKz3DZ_VXqGjWca
zk3x(ajF@A{4Hj-}25Ygjauu3`(=CL1S}>OC2K>-Pb|!tOvszn6G9SUG_heFinhmK@
z*juxMWw)Zv(n{D_ijV%(J3vjMd(tKJoh3rob(VI;36@I8_#$1jJhZvXL41@1R<XIx
zz|HZO+r6c?t@j<`VCyGB%A+<slAEs0q>rICKYgoGlWSLhY$MwI#&f_n1UnVyTtH}T
z&W8J(l<w)bMNR8)Pj}wubtG<_AhaPOwnUKR)+b5O*eU&ZZ$&Q7DgAp<)5lN~tWL-&
zb>49E)7r}8k6*7{Lm$_Qk3-_)AU+OiPv7dgsIP$E=&cbGo-Bfw8394QdYE42cT}fP
z_^a22AdoYx>gG9sPmoovY4{RTFNxV-x67sQEiC@za^3J!xLluu%XNo{TnaDCZq{nm
zI$~#w^2`E1Bu&vR@`=Q3s<uZ?n2Kq-z56pfQ4~zZY}Q_Ha#!1fxmNKC63NR7#u0sB
zRm|t?&4{5AJfI^nh-l@e-QZB1jyRkS&uvyZZsY}3YqSwvFO^m^9A1Q%1xJvVzysb%
zH)tr`EjLS<+7nY=nJ|)mSk%@IaT6%I=s`gEudLTk(Vj`B6J^?~<%Mbq7}m&(bY~Uf
zX&V5=Va<aF1f3K(2El0;U;M#!vQp_ropnPKmg>(s*u+SjFVUp$*E&E>qT7)uAEE5J
zbW;(@R;d(|pR(OuPyYVnMzs4tQq@(-lKk~_R3metb~yvp_yNGk%i71AdnPS&2~C$u
zw8U?xpc#(+fwfdgws}^;!|f$6*$9fgpAG4`YPc1;IOjO7>7)TYQ%D+WN~>LInA-?x
zxT6Q1q=LQE6Nu?3i@rKUSwq3irR?n+LD}s=w;|{gJ4(*lEe-pwDTi+VB5GRC(Cui{
zMOEp&Gp<Ci?N*LR&qKGzd&`8Fq1!zJn?+TRpsJX$n|<)W>>-5gXAc>NgQG2swI~q*
z{(}b|KaABLhY!pi3>Ba`gX?L`c5v?C^|DAUFvkEGdz3PJ@xr0UuT|;wl3)<zhpQ1K
zrcjbzdA;Ma5OcypP6M<XUxERe^WGz+Qp^x2ymZ0qM6u46PeNYC21t1_G9RNX$90*&
z&_hg2VRyVSyMzT9x!eQ1*j6v)a{j<0mph8Z5e-_Ip_k1PpU_N8BkaB56|m-pVX7EW
zX9MdM>igynmLf8s!Japttg5yRyBSJ*Torg*hgy;-Mr3e9=(~fPjL&EV2`8A5qSe^-
zDaA%@@*t-wRk`i`z(%xpM~oB)?T-^zVD0vYtwp*n@t%zAA0mBXXo>y9I}x>ckQPa?
zCJF`S$s>>KvYmUiyk5a7dMwYPsW6-ZfGAI_J;@+HZ`wv_6+w~*n^@W8MLTGbRNb(Q
zd;_5kn^xrKDY`-vz!fDV<gVw>v{@tu$glR_2`}>JC1Gx@w3bSqK$XD`Rtka8l$?RM
zkJl7^p@fjhX&@miS=b=$jwO*Id`_D(g5{s-Ad(S9Pa*PO>HvRTDo%*ID*g}uK1D&%
z>VKy+SX+vFWVpt<G+fTR$wz>;^1Th7f$`?9O>rRvT#+pKAYz4O5wraW9UF^_ut2!`
zfs8>$zKeS!N=>W+Z8qFZM(#BbX1P|!%1&4dy`V4Ph`R<Ew!3M`3fVJWVv42IyqG<_
zO!KPluv9Hcw=W5%{I?FOA2BTm*?=BuPr5m)RPXkpU+(~ST_%MPc1_Bujbx3Y$QxSo
z+MMc<`s{3{KHaaf8+wSR9I~pAc&R}mS_3b4$Gn^9Tbm`gDWoNC%zK_}+rJ9=3C~wv
zcwixW0DpKKJb-a)_9*`Fxa)}8k`Cp9ZFALN91Tmh+kD;QN4240$#Axs1<Z|ldr$ke
zu0K-oq%^lPuDSJ*_};*#O^>x4w}k6^*(kA|J+Igl8o^=|Gg@YT#$K&7aKM8{28n^l
z#blYx?OglM)1C@dY6DwRw<P1cv(2tH>v^NaAjDwF87@@w=%gx*mNTAjV)cKek(I^f
zol!Rh$EF&sd1u%*8V$^g+AU{_-fNg8dls7ouv)TGXgS+nMO~ELdcGz19sN0|KJSby
z85Qj4ZB*+3F;dVQaBa~W;m3ASQx@P);U^ZD6Mordy@X$5jcPu-pyy9fE*2`#u6k$3
zVzt_Umv01ej&F9xY;>65es%@x)XOcTjN6U6S<B)yJZhW`co&NlqhxSOmcj<vd`Y+A
zYEyOc1utO~-Z!R)vwZ6mF8FdV$6E4!4mwlDiV0d_kkGW<LW9m=!B}W60p9qsUZ=%&
zD1nZ-jFb^N8{eQ7wVrdv%?fUL%HpP`Djn0;az>hs#hDvsY!lxvQ8TmHl~Ju{v52lv
zGU}i+p_&KBCaTSb3T2R?w46&rIUx|%YhX2;aRJxI!F~G@H6!%0Gf8c*L8u}~R6?6t
z*rB6WmYVvK0g4y!d%&o)oShhFRqKUp!N9u10;(~Y(%Z1JWD(5-Ma)80%#*i@S2*K(
zvr*0ZN!EKIKF(O7S*~S0!2@AA!Gz4!G4)NXo8S~sw_+3f{iK?0Gz-=2N}1$ol4h@M
zBO82^r6k|T(s{r_J}0sT)287T8X~bAautI0#u-I>Y-oWvV-A8NOJ)~M>=tan%A7~v
zP>*fYX?`9|CV&NSeS2MB_I^T2r%16NJhWQ~T2M9{t$QY~cE)Q)E$iK*M(r7;6q+h$
z<*+_Ll-W&bTon{1+c4nZLAP4YFw$qPJa8>Ea=gBn4*{YSAJ7L0&<JjsgF4_OrPlG`
z;*XqlCWU#*7R{w%3I8E#TT4}v(oq}p{*CMtO{k!a2JPhE;%63{vveYX^<jc~X}+ja
z)Y_;E?EpczwX|@cS!<mIBeD3vY=BfkYtMq$)jT#Kfn%;3?;yptajk?}4qNCUYP6M!
zbjSK}s&CT3;`0L3Z522a4Wof7c4H*1pUN6#-7IBsASSJmWxS^dF7XCofJI?{&N`z4
z0t2^OXNybNJmw4wGXTAV2$_|F388Le8+v`ofLQ^zr+^;hp#f_Mcm-q8Zk=g4JCxLl
zUPiS@2DC-*$C`KXJ=U`RlJ4-coo%$!zd#_YH=$2JMwzzD+0GC_6FGaV!{p=~pvSkU
z<M<{$cGFgu9rVxu%DR*u@1)1u=y4-$p}U?QpP^GI=*B?njr1DTV!f62tiG8Z*AUP>
zcr=|6s*$5Hz(&+L&-Kl7UGrSeJl8SL@aGx!Ji~pCVa_wW`KI;o7TQ3#N8tPs59cq?
zH^%up^o?=8fSSNKPXkE`QXgzt@1tx+|9Qfk(dTOt8T}P%7o*PyYY_St2b}g(#x{Dq
zj~-m^qtt%7uhBX~4W>gqtU+3RK-+1pJbk0x5!N5mgO;RO&(HvbCO9mOAhX-&jCmat
zIL0g=%bVh82U0|lLWa&QCuAs?BFaIspoX-hCaV<P6-x9<k0`}P+*%p_4h25?ta^hw
z$=zXCGG~*Mff>%@SafJ_t9Xqwbcg)@JV_wg<>MLqEv*M&VQP9ERte&5LnTFJo+S<@
zTVEk19k*9)SSmNecNJblE?io9iclyD=x6Y*_u0D<m9LXqpb0(HE<a_gE~BflFQ;gl
zhyr3SBi(~oh@bHPJjwDx3eTT+oAWf<=MsZ(2BkBx+1W}O1haZ<{^-5bqX#@Q*jjS8
zjyI)?7N!}{cD8#oX2Y~yh7({Cm&hj3u^v^pT(C&3dEbG=sFpV9dIwRYXuf}33hQ2I
zzwfQ6A;dfD{iLIUuX1nb$eq&X4BZ1CNEZXrzaYI*-Cqy)Naz5kpv>*tr|p{y#}BrN
z<k%p>H#^jjf;#?UaY8*hI7k;QKmLP)97ORLm_LrH++l_@p%=>43STca)2J4z7=Vb8
zhdR!2hS1fLA#Yh9hvrF18=*I{74qQ1JGpNaD3I;-IYJ8b3A~Q(=#%2(y+AQ|=)fiS
z={N|dUa_%pO3u>p1*qf@d5e$tSm7%-x1J=_U2DKfFOuR$z@wUr(}&dBeY4U1xkQub
zk(7G3-{ozs2^~qqMcEQu<YBOjzV%MW&W{3ij?6s-$I_l#$YX+G&Q&FQ4%@(s&4oF+
zIe!lPwdWo%7Vpt3bAcwz*6l`%cgEw&;)t?3cbzQ4fJ)~GYgntNO?bPQa^=0_r%hwo
z-Mk~$UtVp~s!(_Dk?<S6*$J_A`ISjwzWDn0#6k@+-`Yo{Ve0RR63Md?DRkIBPULC=
zOos>@-zsWS*#Yu(FIRsx7?P{0J20~Z?^Qe6tgtH@k}iIM+jnDc+vi*G>!W}zzs*Bv
zUpR*Ki;Gwd9Q?y#3z{L*a*H{k;cy4YJ;dJ0+@V}%2`lPX1LeKqOR{)l87rmTSL~ZK
z+OS4zk#noL49-tj*}uBid)<4vC|{=iW!}r!7)n!TH65F7bNpf`jQnp5_n@%5vA&~V
zSTd(2WvtJaf)OG4s;EReA!mxj0OCBe=!vu2C&>=TE20I9bdG<i3Mcv`A2*WF?lo}x
zwvYx+-baI~m39}3b9q)kJ*p?`F)+RYJ{|=eP{66E0zP~>ro(4c6{KC*tb<KDXim$`
z#A@P98^!JT(xSF!=8&&|UQM31lLlfW%mG9w@5~`gWsyo6=<sRo2~$%Dq3M-IW+r4g
z)<zmH<T5jw`d)XhDW1dkX||?(5UFF`<I2VxoL$1;sHzcTa3)3Iu)}GWvIOmV=IHa<
z!T!$XhV-#}b2Aq<HxtJYPh4r&-E(oaHfN(op*Pm%*(l(EwRu^LwYeMChIZ5i*J!#L
zh^wNdPap2W56Le4a4sWW-lttBJMjcBW6|byxy+tx_QG)a^(O$3%aG}~MqBb;U;AZJ
z1mS<+EwVlYU?u?oSU~aq48JZgm?0cgoAiCk_K>o1uF|_V-f~?gESIWgF_vorA#QV}
zgQFx0^vq2n&F<cAJs7rIlPBqTup_j#jsr@eaSE4b!}YPKed&$i`bZRTz;IoI=7nNT
z&SMzy;+|fdOF>~aXrza{yLbkZ0a)UPB{u%()!q-+MMNujt!RdJTuSE#hwm=p5N-;n
z*`eWWpX&+=xAjG$1QYx7QJSoW*l~m28Bvo;{g__jMf4IYI0%TY*Kq$}YV8_USuU<(
zRHiq0Tt};$m>oHkB<rlc6nO;&ayT|md5Qc%dhL-L9^<MaFL8n3YbfdVLmgh@jw<rn
zqbu6Xt%3SbTS%TL+zcVYuysF&ooNW_4sS9haK$M@NULb8_+pfBMbDEir3e^Gw*mNM
z0N`@5ishd<b1|2B<lyY=jiUWbfN=ZW*=;%nCdY*zqgHuG4>C1C`aP0}I0^~vqs{WX
zRX&Uin&zs6+JAkY=l?Ev9yC5~5aM@Xc{Vr*aiEPQ8U`wn^*56w#4`btA6bLLC4!y8
znyY|14-BXW>b`?r4tKB@d!5xu>a31cFbn71VHf0p#jmpY|Eu1be?KJg^(f##Uwdav
zU%T(vB37|3V%rRCp*WNZhd$MCWT;%S>P7y;i%+-UO=Z~WaEf5|-$xPgI=IN(50;Gr
z0mVc)n->+>uK50I2e>Js#r}*BAq?{HWCc${u0e|+XPs_dSeq_kT}U+DbTtu%quobE
zO{yqFJAMa!@lD!O=)vxz2(EU<{f7SK7VSx+9-6^fyLgZ!F2ByZY{SjX-EG<*_A;+s
ztu|@b33g^+;TzW82t6P-5=XHiv=4_!7ahD8rVi`CR0M`1wN6aF!0sy0Ma;xS=bYA~
zA9Eexu1h}%VOKw1wg!!Yg5a!Gcx`(0NH6YbBNyRWlASP!zFOR(9XzaI)kN@uq}UR{
zM!V8~_r^>Az45IK)6lsXBPSkXiMwa8+%3>;g=7C-VWAG;!t0p@pgyVl-uHds-gn0d
zTD3;!WtU*Zcz~y9pv7-+r<?DsYWSUQE($o%>Ao5b44a<Y1=d*R;bAS^d<-d;4gC~t
zA47x`>tARQ44+MoX}Z8*H#Cav1;C&HTXkv^ldTqQo!676uqbgu)z^rcR60g`tcM3T
zi-0DNeoj7yF&Q82N`o|Vy-uRvx&c2{cx;IuftePJv~nk9aE~S_X?CNc*?B~liMlx&
zK@!;9BPTK7<guR^`5hGFzC&(hC=~=uZ~+g#lLro8Xk-`|_GKPj6(iAWcpxdxqm9B@
zWjM6_DGZCl7bM(_Yv>%w?~}zNOHhPe8~hC9cY_B!kHpJ!#0Kx+CATv{GY}c=h%$8X
zlxHf|Io=_I)V;<1LfGO?+zzZyX-8yeEfi1W;%qnG(_6dYo7;Cs0SC;j6=QA-ax*VN
zh7^y2a$@y6oI5u<h<&@b`a#Zo^K9&XEJs7YMi`8eUS25ZLF=m(svIw>7yv0IOv9ex
z;S_Z$J(rUTf{?ub6eW>ovm@T+Hqlho#ThW;$6p`q069f(;E%ruWw4INU)S&?OqXO2
z>b#Ta&9!M2*4UIIvXZDt72Ih5=DclDb7PjG3q$XsuFnb1*rVg&UPZ)5Wwess^CFh?
zLq;v}%>x#k`g3)F7Vo%|UjQ{bI~y90pJTWMx$au}-(nF;B8BT-UsH|eY*=ob3BLMf
z#-nz`%!>k^Nm}n@H(9~%ZT#25Hh%PuDz-|H!x6d3k;}4y|5|TNfp6enhyo56_>~v~
z|LT*l>14)8aE1KS7m|J0aBKy_ma8WAWYcIrc<xN5jH`f5Toa}(VEYkPWZJXZQJe`O
z_gjZ;`c|q&HPRwUNWpiac(=E@7qmlHwZpsO+N7Z1O8-B1s6B~JM2=yhX1SL62i8N(
zpw2q$g0wch!y1^<az80*QYA9Ra<7s%4_2*eS7Ow0%PragA%%wy2?Koia3<5H$U%%O
z@b@&odpP)RFyp#F#$l1cmi-l~xV(gT1i9<V<c`ZX-1j~c&#|yPU~_EH#DxPM;oS8^
zILKgiZ;OY9Fz^lrn-JS5S83a>HZPB(pm_$ku~kiO*bP$N;`iA;&w%*tLX0U4f^VPq
zMF9uw^K<R&vp4|*8(Xm49H$)9-al%D?j5tigLpb(114I}=V`NF;DqALVzpGNF4J4?
zasbah3%8MbfqvAY5cp<lJrnq*C>=a|pMt<~k&z!3HK`Pju|ESjYzqiV4J8E8b~W;D
z;Jm@3;kUJELpUh*Sw8b5*T`vhvDz#ZSPXC@AJ%Qid3HbkCDyLF=d+x`#!h)+He`#s
z^vY83PL*X7!7~UI0zJO8(Joq!8@XqM(9VhG;v&|aV9Pm9jly_)3AgJ(Li4l_y-Hi(
zdGIJiOdiWkLhH$)+#xl{Em7$2$TUHVhdW44%*7#%kT1SDp0|1js43*pzc_@@h0yWX
z?3exxawn(=&cDS5tSvR+{w<}y^CN9^H9SXhajrp=hx!@+YA(c6#LZl)A?jE%$Qai`
zJ-P7~>RoMG9kx(5Z-t`c6L7NJDX$x%=&#s11p~6A*ZG8gj5PEb&9LyK1eqQT%QHEc
zEZnh{LvY_LH_X$<ejM<`MnzwsL!e~u=Uzas+hNmkWZfvJW~m481o3{jgYk)&v|*PH
zs;q1i)KM^W#p3x6@YiMB2yxfA?MuLypzJzHUR;}AJyPcPv=QsDGEYmPe5!G#OQr7W
zjUa(sE`E69mHWrrP$8_`%g4w&U>_7=0-A+^#}Ip`E|!-<(QzyQ9qY(1NCzWB`}E6D
zcnaFBYWX4#EWwR#i@53yD+*A0KTe@+a$Zi}QJC{4@}%!j-cU3YRdY7DZo!ye>7dvV
z!!hE~O|=|DlAKC=T%r5*4mGUHbP(#U=?L9SVC|x<);vt;)W9BT`Um1=JPh5zG?Exg
z&PdmpC;x41HJ@RpmcowT9pD||^1v(a4P}(ZqfhUR^$d<NT8v=1-S_jO2!%2`*Uf8d
z_yhuPl}%uziXGHR*zX_nKx?gJnCuqp-nVYWW8V5fe%?k2ci<5`M9VtLd9UQ>-TXYp
z&mY2*kH)f&<J<Ag)(P=(59iMF^Im@5M;Qaw{q!+tJs>_F<gAnYd<f6ytXJV_y_y~m
z(}NC*vR+G%N9ggWm-ZNadz>CwdgSP#(_?`ic|7K=0zVBrp-GFB{$9w2wZzFqewzHW
z_<4$-C4QFqS;14#yUM?7^!o{V)bV)EvhhTl8~DJvNmdh|^VVrR`Gh2EnZB*iW0iBB
zq^}<&6rRF2KI_POn$phD;~6}jvtCDEKTKs_k8fwKH}La~c%q^=@sBs-$!88(Z{gq1
z;)#Q8`1^D8<dcJ}v-mo1{V<+5AHl%~76H9oe7sY9w8Y1c^2Z+QuP+DOzoN$@v=;AS
zdc27qucyZ^(BtRm@fY;?b9y{RA=}r|<9T|#lOA88$Dh&TY65iyJzk{8SMg|C?+H{k
z&lSycCG%XtJOiI+!1D}ro&nA?uz3a)IJbw9<;Ag#EbkJ2Jt6iuJs4Tu4#UXOMgn<m
z4=vmkc=IAd#yjWX&C^_r_Y0Ipcv}>}Xj<=Q<gK3&A3uo?koJS(<7dRj&x(%^iH~0p
zAHRqXu<s-EvB~-<KCF-70fvx39^cGo*;t=I65xGGeEbPM=B+;!KmLq=c!mHryLX2?
zFfj;Rz_P?0q>>?`1w%BQ57!8KPZqz+oypE=K=B%~?q<ZroaAvO)UK#;w*EIb>2(sD
zP$vF_5^F0pmyQ*YhH{X8hsh+mt?(8V-TD;X11mo*K0YHpJ}W++;g4ps>1>lnec>QN
ztXHnA%+iU5ICtqN&Tpf`Q68$8Puxi-?eU3*?`SRH*p!ku=FQp<Iyz%_R+lSu3>m#4
x4?c8uRO{vv&W9^y#W7{gx=BZWjnD~gS;T;J`n4T<&*|W}hOyGX@8-hn{|^|Mot*#x

diff --git a/docs/RefMan/_build/html/BasicSyntax.html b/docs/RefMan/_build/html/BasicSyntax.html
index cd9d810c6..757732305 100644
--- a/docs/RefMan/_build/html/BasicSyntax.html
+++ b/docs/RefMan/_build/html/BasicSyntax.html
@@ -43,6 +43,7 @@
 <li class="toctree-l1 current"><a class="current reference internal" href="#">Basic Syntax</a><ul>
 <li class="toctree-l2"><a class="reference internal" href="#declarations">Declarations</a></li>
 <li class="toctree-l2"><a class="reference internal" href="#type-signatures">Type Signatures</a></li>
+<li class="toctree-l2"><a class="reference internal" href="#numeric-constraint-guards">Numeric Constraint Guards</a></li>
 <li class="toctree-l2"><a class="reference internal" href="#layout">Layout</a></li>
 <li class="toctree-l2"><a class="reference internal" href="#comments">Comments</a></li>
 <li class="toctree-l2"><a class="reference internal" href="#identifiers">Identifiers</a></li>
@@ -97,6 +98,44 @@ <h2>Type Signatures<a class="headerlink" href="#type-signatures" title="Permalin
 </pre></div>
 </div>
 </section>
+<section id="numeric-constraint-guards">
+<h2>Numeric Constraint Guards<a class="headerlink" href="#numeric-constraint-guards" title="Permalink to this heading"></a></h2>
+<p>A declaration with a signature can use numeric constraint guards, which are like
+normal guards (such as in a multi-branch <cite>if`</cite> expression) except that the
+guarding conditions can be numeric constraints. For example:</p>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">len</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">n</span><span class="p">}</span><span class="w"> </span><span class="p">(</span><span class="kr">fin</span><span class="w"> </span><span class="n">n</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="p">[</span><span class="n">n</span><span class="p">]</span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="kt">Integer</span><span class="w"></span>
+<span class="nf">len</span><span class="w"> </span><span class="n">xs</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">0</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="mi">0</span><span class="w"></span>
+<span class="w">       </span><span class="o">|</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="o">&gt;</span><span class="w">  </span><span class="mi">0</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="mi">1</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">len</span><span class="w"> </span><span class="p">(</span><span class="n">drop</span><span class="w"> </span><span class="p">`{</span><span class="mi">1</span><span class="p">}</span><span class="w"> </span><span class="n">xs</span><span class="p">)</span><span class="w"></span>
+</pre></div>
+</div>
+<p>Note that this is importantly different from</p>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">len&#39;</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">n</span><span class="p">}</span><span class="w"> </span><span class="p">(</span><span class="kr">fin</span><span class="w"> </span><span class="n">n</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="p">[</span><span class="n">n</span><span class="p">]</span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="kt">Integer</span><span class="w"></span>
+<span class="nf">len&#39;</span><span class="w"> </span><span class="n">xs</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="kr">if</span><span class="w"> </span><span class="p">`</span><span class="n">n</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">0</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="mi">0</span><span class="w"></span>
+<span class="w">           </span><span class="o">|</span><span class="w"> </span><span class="p">`</span><span class="n">n</span><span class="w"> </span><span class="o">&gt;</span><span class="w">  </span><span class="mi">0</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="mi">1</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">len</span><span class="w"> </span><span class="p">(</span><span class="n">drop</span><span class="w"> </span><span class="p">`{</span><span class="mi">1</span><span class="p">}</span><span class="w"> </span><span class="n">xs</span><span class="p">)</span><span class="w"></span>
+</pre></div>
+</div>
+<p>In <cite>len’</cite>, the type-checker cannot determine that <cite>n &gt;= 1</cite> which is
+required to use the</p>
+<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">drop</span><span class="w"> </span><span class="p">`{</span><span class="mi">1</span><span class="p">}</span><span class="w"> </span><span class="n">xs</span><span class="w"></span>
+</pre></div>
+</div>
+<p>since the <cite>if</cite>’s condition is only on values, not types.</p>
+<p>However, in <cite>len</cite>, the type-checker locally-assumes the constraint <cite>n &gt; 0</cite> in
+that constraint-guarded branch and so it can in fact determine that <cite>n &gt;= 1</cite>.</p>
+<dl class="simple">
+<dt>Requirements:</dt><dd><ul class="simple">
+<li><p>Numeric constraint guards only support constraints over numeric literals,
+such as <cite>fin</cite>, <cite>&lt;=</cite>, <cite>==</cite>, etc. Type constraint aliases can also be used as
+long as they only constrain numeric literals.</p></li>
+<li><p>The numeric constraint guards of a declaration should be exhaustive. The
+type-checker will attempt to prove that the set of constraint guards is
+exhaustive, but if it can’t then it will issue a non-exhaustive constraint
+guards warning. This warning is controlled by the environmental option
+<cite>warnNonExhaustiveConstraintGuards</cite>.</p></li>
+</ul>
+</dd>
+</dl>
+</section>
 <section id="layout">
 <h2>Layout<a class="headerlink" href="#layout" title="Permalink to this heading"></a></h2>
 <p>Groups of declarations are organized based on indentation.
diff --git a/docs/RefMan/_build/html/_sources/BasicSyntax.rst.txt b/docs/RefMan/_build/html/_sources/BasicSyntax.rst.txt
index 43acef714..992f9eb34 100644
--- a/docs/RefMan/_build/html/_sources/BasicSyntax.rst.txt
+++ b/docs/RefMan/_build/html/_sources/BasicSyntax.rst.txt
@@ -56,8 +56,12 @@ that constraint-guarded branch and so it can in fact determine that `n >= 1`.
 Requirements:
   - Numeric constraint guards only support constraints over numeric literals,
     such as `fin`, `<=`, `==`, etc. Type constraint aliases can also be used as
-    long as they only constraint numeric literals.
-  - The numeric constraint guards of a declaration must be exhaustive.
+    long as they only constrain numeric literals.
+  - The numeric constraint guards of a declaration should be exhaustive. The
+    type-checker will attempt to prove that the set of constraint guards is
+    exhaustive, but if it can't then it will issue a non-exhaustive constraint
+    guards warning. This warning is controlled by the environmental option
+    `warnNonExhaustiveConstraintGuards`.
 
 
 Layout
diff --git a/docs/RefMan/_build/html/_static/basic.css b/docs/RefMan/_build/html/_static/basic.css
index eeb0519a6..9039e027c 100644
--- a/docs/RefMan/_build/html/_static/basic.css
+++ b/docs/RefMan/_build/html/_static/basic.css
@@ -236,6 +236,7 @@ div.body p, div.body dd, div.body li, div.body blockquote {
 a.headerlink {
     visibility: hidden;
 }
+
 a.brackets:before,
 span.brackets > a:before{
     content: "[";
@@ -246,7 +247,6 @@ span.brackets > a:after {
     content: "]";
 }
 
-
 h1:hover > a.headerlink,
 h2:hover > a.headerlink,
 h3:hover > a.headerlink,
@@ -334,12 +334,14 @@ aside.sidebar {
 p.sidebar-title {
     font-weight: bold;
 }
-div.admonition, div.topic, blockquote {
+
+div.admonition, div.topic, aside.topic, blockquote {
     clear: left;
 }
 
 /* -- topics ---------------------------------------------------------------- */
-div.topic {
+
+div.topic, aside.topic {
     border: 1px solid #ccc;
     padding: 7px;
     margin: 10px 0 10px 0;
@@ -378,6 +380,7 @@ div.body p.centered {
 div.sidebar > :last-child,
 aside.sidebar > :last-child,
 div.topic > :last-child,
+aside.topic > :last-child,
 div.admonition > :last-child {
     margin-bottom: 0;
 }
@@ -385,6 +388,7 @@ div.admonition > :last-child {
 div.sidebar::after,
 aside.sidebar::after,
 div.topic::after,
+aside.topic::after,
 div.admonition::after,
 blockquote::after {
     display: block;
@@ -608,6 +612,8 @@ ol.simple p,
 ul.simple p {
     margin-bottom: 0;
 }
+
+/* Docutils 0.17 and older (footnotes & citations) */
 dl.footnote > dt,
 dl.citation > dt {
     float: left;
@@ -625,6 +631,33 @@ dl.citation > dd:after {
     clear: both;
 }
 
+/* Docutils 0.18+ (footnotes & citations) */
+aside.footnote > span,
+div.citation > span {
+    float: left;
+}
+aside.footnote > span:last-of-type,
+div.citation > span:last-of-type {
+  padding-right: 0.5em;
+}
+aside.footnote > p {
+  margin-left: 2em;
+}
+div.citation > p {
+  margin-left: 4em;
+}
+aside.footnote > p:last-of-type,
+div.citation > p:last-of-type {
+    margin-bottom: 0em;
+}
+aside.footnote > p:last-of-type:after,
+div.citation > p:last-of-type:after {
+    content: "";
+    clear: both;
+}
+
+/* Footnotes & citations ends */
+
 dl.field-list {
     display: grid;
     grid-template-columns: fit-content(30%) auto;
@@ -636,11 +669,11 @@ dl.field-list > dt {
     padding-left: 0.5em;
     padding-right: 5px;
 }
+
 dl.field-list > dt:after {
     content: ":";
 }
 
-
 dl.field-list > dd {
     padding-left: 0.5em;
     margin-top: 0em;
diff --git a/docs/RefMan/_build/html/_static/documentation_options.js b/docs/RefMan/_build/html/_static/documentation_options.js
index b1c5979a4..1d9c2211c 100644
--- a/docs/RefMan/_build/html/_static/documentation_options.js
+++ b/docs/RefMan/_build/html/_static/documentation_options.js
@@ -10,5 +10,5 @@ var DOCUMENTATION_OPTIONS = {
     SOURCELINK_SUFFIX: '.txt',
     NAVIGATION_WITH_KEYS: false,
     SHOW_SEARCH_SUMMARY: true,
-    ENABLE_SEARCH_SHORTCUTS: true,
+    ENABLE_SEARCH_SHORTCUTS: false,
 };
\ No newline at end of file
diff --git a/docs/RefMan/_build/html/_static/searchtools.js b/docs/RefMan/_build/html/_static/searchtools.js
index f2fb7d5cf..ac4d5861f 100644
--- a/docs/RefMan/_build/html/_static/searchtools.js
+++ b/docs/RefMan/_build/html/_static/searchtools.js
@@ -88,7 +88,7 @@ const _displayItem = (item, highlightTerms, searchTerms) => {
   linkEl.href = linkUrl + "?" + params.toString() + anchor;
   linkEl.innerHTML = title;
   if (descr)
-    listItem.appendChild(document.createElement("span")).innerHTML =
+    listItem.appendChild(document.createElement("span")).innerText =
       " (" + descr + ")";
   else if (showSearchSummary)
     fetch(requestUrl)
@@ -155,8 +155,10 @@ const Search = {
   _pulse_status: -1,
 
   htmlToText: (htmlString) => {
-    const htmlElement = new DOMParser().parseFromString(htmlString, 'text/html');
-    htmlElement.querySelectorAll(".headerlink").forEach((el) => { el.remove() });
+    const htmlElement = document
+      .createRange()
+      .createContextualFragment(htmlString);
+    _removeChildren(htmlElement.querySelectorAll(".headerlink"));
     const docContent = htmlElement.querySelector('[role="main"]');
     if (docContent !== undefined) return docContent.textContent;
     console.warn(
@@ -502,12 +504,11 @@ const Search = {
    * latter for highlighting it.
    */
   makeSearchSummary: (htmlText, keywords, highlightWords) => {
-    const text = Search.htmlToText(htmlText);
+    const text = Search.htmlToText(htmlText).toLowerCase();
     if (text === "") return null;
 
-    const textLower = text.toLowerCase();
     const actualStartPosition = [...keywords]
-      .map((k) => textLower.indexOf(k.toLowerCase()))
+      .map((k) => text.indexOf(k.toLowerCase()))
       .filter((i) => i > -1)
       .slice(-1)[0];
     const startWithContext = Math.max(actualStartPosition - 120, 0);
@@ -515,9 +516,9 @@ const Search = {
     const top = startWithContext === 0 ? "" : "...";
     const tail = startWithContext + 240 < text.length ? "..." : "";
 
-    let summary = document.createElement("p");
+    let summary = document.createElement("div");
     summary.classList.add("context");
-    summary.textContent = top + text.substr(startWithContext, 240).trim() + tail;
+    summary.innerText = top + text.substr(startWithContext, 240).trim() + tail;
 
     highlightWords.forEach((highlightWord) =>
       _highlightText(summary, highlightWord, "highlighted")
diff --git a/docs/RefMan/_build/html/searchindex.js b/docs/RefMan/_build/html/searchindex.js
index 5bf45ee7c..ddcd312ea 100644
--- a/docs/RefMan/_build/html/searchindex.js
+++ b/docs/RefMan/_build/html/searchindex.js
@@ -1 +1 @@
-Search.setIndex({"docnames": ["BasicSyntax", "BasicTypes", "Expressions", "FFI", "Modules", "OverloadedOperations", "RefMan", "TypeDeclarations"], "filenames": ["BasicSyntax.rst", "BasicTypes.rst", "Expressions.rst", "FFI.rst", "Modules.rst", "OverloadedOperations.rst", "RefMan.rst", "TypeDeclarations.rst"], "titles": ["Basic Syntax", "Basic Types", "Expressions", "Foreign Function Interface", "Modules", "Overloaded Operations", "Cryptol Reference Manual", "Type Declarations"], "terms": {"f": [0, 1, 2, 3, 4], "x": [0, 1, 2, 3, 4, 7], "y": [0, 1, 2, 3, 4], "z": [0, 2, 4], "g": [0, 2, 4], "b": [0, 3, 4, 5, 7], "fin": [0, 3, 4], "group": [0, 4, 7], "ar": [0, 1, 2, 3, 4, 7], "organ": 0, "base": [0, 2], "indent": [0, 4], "same": [0, 1, 3, 4, 7], "belong": 0, "line": [0, 4, 7], "text": 0, "more": [0, 4], "than": [0, 3, 4], "begin": 0, "while": [0, 1, 3], "less": 0, "termin": 0, "consid": [0, 4, 7], "exampl": [0, 1, 2, 4, 6], "follow": [0, 1, 2, 3, 4], "cryptol": [0, 2, 4], "where": [0, 1, 2, 3, 4], "thi": [0, 1, 2, 3, 4], "ha": [0, 1, 2, 3], "two": [0, 1, 2, 4, 7], "one": [0, 2, 3, 4], "all": [0, 2, 3, 4, 7], "between": [0, 6], "The": [0, 1, 2, 3, 4], "principl": 0, "appli": [0, 3], "block": [0, 6], "which": [0, 2, 3, 4, 7], "defin": [0, 1, 3, 4, 7], "local": [0, 4, 6], "name": [0, 1, 3, 6, 7], "support": [0, 4, 6], "start": [0, 1], "end": [0, 4], "mai": [0, 1, 2, 3, 4, 7], "nest": [0, 1, 3, 6], "arbitrarili": 0, "i": [0, 1, 2, 3, 4, 7], "document": [0, 4], "consist": 0, "charact": 0, "first": [0, 1, 3, 4], "must": [0, 3, 4], "either": [0, 3, 4], "an": [0, 1, 2, 3, 6], "english": 0, "letter": 0, "underscor": 0, "_": [0, 1], "decim": 0, "digit": 0, "prime": 0, "some": [0, 4], "have": [0, 1, 2, 3, 4, 7], "special": 0, "mean": [0, 3], "languag": [0, 3], "so": [0, 1, 2, 3, 4], "thei": [0, 1, 3, 4, 7], "us": [0, 1, 2, 3, 4, 7], "programm": 0, "see": [0, 4], "name1": 0, "longer_nam": 0, "name2": 0, "longernam": 0, "extern": 0, "includ": 0, "interfac": [0, 6], "paramet": [0, 2, 6], "properti": 0, "hide": [0, 6], "infix": [0, 6], "let": [0, 3], "pragma": 0, "submodul": [0, 4], "els": [0, 2, 4], "constraint": [0, 6], "infixl": 0, "modul": [0, 3, 6], "primit": 0, "down": [0, 1], "import": [0, 1, 2, 6], "infixr": 0, "newtyp": [0, 4, 6], "privat": [0, 6], "tabl": [0, 3], "contain": [0, 1, 3, 4], "": [0, 2, 3, 4], "associ": 0, "lowest": 0, "highest": 0, "last": [0, 2, 3], "right": [0, 1], "left": [0, 1], "unari": [0, 2], "varieti": 0, "allow": [0, 3, 4, 7], "comput": [0, 1], "specifi": [0, 2, 4], "size": [0, 1, 3], "sequenc": [0, 6], "addit": [0, 4], "subtract": 0, "multipl": [0, 1, 2, 3, 4], "divis": [0, 6], "ceil": [0, 5], "round": [0, 6], "up": [0, 3], "modulu": 0, "pad": [0, 3], "exponenti": 0, "lg2": 0, "logarithm": 0, "2": [0, 1, 2, 3, 4, 7], "width": [0, 4], "bit": [0, 1, 2, 4, 5, 6], "equal": [0, 1, 6, 7], "n": [0, 1, 3, 4], "1": [0, 1, 2, 3, 4, 7], "max": [0, 5], "maximum": 0, "min": [0, 5], "minimum": 0, "written": [0, 1, 2, 3, 7], "binari": [0, 3], "octal": 0, "hexadecim": 0, "notat": [0, 1, 2, 4], "determin": [0, 1], "its": [0, 3, 4], "prefix": [0, 4, 6], "0b": 0, "0o": 0, "0x": 0, "254": 0, "0254": 0, "0b11111110": 0, "0o376": 0, "0xfe": 0, "result": [0, 1, 2, 4], "fix": [0, 1, 3], "length": [0, 1, 3], "e": [0, 1, 4, 5], "number": [0, 1, 2, 3], "overload": [0, 6], "infer": [0, 2], "from": [0, 1, 2, 3, 4], "context": [0, 2], "0b1010": 0, "4": [0, 3], "0o1234": 0, "12": [0, 4], "3": [0, 1, 2, 4, 7], "0x1234": 0, "16": [0, 3], "10": [0, 1, 3, 4], "integ": [0, 2, 5, 7], "also": [0, 1, 3, 4], "polynomi": 0, "write": [0, 1, 3], "express": [0, 1, 4, 6, 7], "term": 0, "open": 0, "close": 0, "degre": 0, "6": [0, 7], "7": [0, 2, 4], "0b1010111": 0, "5": [0, 1, 2, 4], "0b11010": 0, "fraction": 0, "ox": 0, "A": [0, 1, 3, 4, 7], "option": [0, 7], "expon": 0, "mark": 0, "symbol": [0, 3, 4], "p": [0, 1, 4], "2e3": 0, "0x30": 0, "64": [0, 3], "1p4": 0, "ration": 0, "float": [0, 6], "famili": 0, "cannot": [0, 2], "repres": 0, "precis": 0, "Such": [0, 4], "reject": 0, "static": [0, 3], "when": [0, 1, 2, 3, 4], "closest": 0, "represent": 0, "even": [0, 7], "effect": 0, "valu": [0, 1, 4, 6, 7], "improv": [0, 3], "readabl": [0, 3], "here": [0, 2, 4], "0b_0000_0010": 0, "0x_ffff_ffea": 0, "packag": 1, "togeth": [1, 4], "enclos": [1, 4], "parenthes": 1, "curli": 1, "brace": 1, "compon": [1, 3], "both": [1, 4], "separ": [1, 4], "comma": 1, "label": 1, "sign": [1, 6], "identifi": [1, 4, 6], "posit": 1, "order": [1, 3, 4], "most": [1, 4], "purpos": [1, 7], "true": [1, 3], "fals": [1, 3], "lexicograph": 1, "compar": 1, "appear": [1, 7], "wherea": 1, "alphabet": 1, "wai": [1, 3, 4], "via": 1, "pattern": [1, 2], "match": [1, 3], "explicit": [1, 4, 6], "selector": 1, "15": 1, "20": [1, 3], "0": [1, 2, 3], "onli": [1, 3, 4, 7], "program": 1, "suffici": [1, 2], "inform": 1, "shape": 1, "For": [1, 2, 3, 4, 7], "t": [1, 2, 3, 4, 7], "valid": 1, "definit": [1, 2, 4], "known": 1, "isposit": 1, "invalid": 1, "insuffici": 1, "baddef": 1, "mirror": 1, "syntax": [1, 2, 6], "construct": [1, 2, 4], "getfst": 1, "distance2": 1, "xpo": 1, "ypo": 1, "lift": 1, "through": [1, 6], "point": [1, 6], "wise": 1, "equat": 1, "should": [1, 2, 3], "hold": [1, 3], "l": [1, 3], "thu": [1, 4], "we": [1, 3, 4], "can": [1, 2, 3, 4, 7], "quickli": 1, "obtain": [1, 3, 4], "similarli": 1, "get": 1, "entri": 1, "behavior": [1, 3], "quit": [1, 4], "handi": 1, "examin": 1, "complex": 1, "data": 1, "repl": 1, "r": 1, "pt": 1, "100": 1, "set": [1, 3], "30": [1, 4], "rel": 1, "old": 1, "25": 1, "collect": [1, 7], "element": [1, 2, 3], "finit": [1, 2], "often": 1, "call": [1, 3, 4, 6], "word": [1, 3], "abbrevi": 1, "infinit": 1, "inf": [1, 5], "stream": 1, "e1": 1, "e2": 1, "e3": 1, "three": 1, "t1": [1, 3], "t2": [1, 3], "enumer": 1, "exclus": 1, "bound": [1, 3], "stride": 1, "ex": 1, "downward": 1, "t3": 1, "step": [1, 4], "p11": 1, "e11": 1, "p12": 1, "e12": 1, "comprehens": 1, "p21": 1, "e21": 1, "p22": 1, "e22": 1, "gener": [1, 3], "index": 1, "bind": [1, 3], "arr": 1, "j": [1, 4], "dimension": 1, "note": [1, 3, 4], "those": [1, 4], "descript": 1, "concaten": 1, "shift": 1, "rotat": 1, "arithmet": [1, 6], "bitvector": 1, "front": 1, "back": 1, "sub": [1, 4], "updateend": 1, "locat": [1, 4], "updatesend": 1, "There": 1, "pointwis": 1, "p1": 1, "p2": 1, "p3": 1, "p4": 1, "split": [1, 3], "lambda": [1, 2], "section": [2, 3, 4], "provid": [2, 4], "overview": 2, "h": [2, 4], "pair": 2, "paren": 2, "ad": [2, 3, 4], "8": [2, 3, 4], "whole": [2, 3, 4], "9": 2, "variabl": [2, 3], "If": [2, 3, 4], "polymorph": [2, 3], "typaram": 2, "zero": [2, 3, 6], "you": [2, 3, 4], "evalu": [2, 6], "pass": [2, 3, 6], "13": 2, "weakest": 2, "preced": [2, 4], "scope": [2, 4, 7], "defint": 2, "do": [2, 3, 4, 7], "need": [2, 3, 4], "branch": 2, "22": 2, "33": 2, "correspond": [2, 3], "access": [2, 3, 6], "kind": [2, 3], "larg": [2, 3], "accommod": 2, "liter": [2, 6], "backtick": 2, "sugar": [2, 4], "applic": 2, "primtiv": 2, "abov": [2, 3, 4], "suitabl": 2, "automat": [2, 3], "chosen": 2, "possibl": [2, 4], "usual": 2, "ffi": 3, "other": [3, 4, 7], "convent": 3, "current": 3, "window": 3, "work": [3, 4], "unix": 3, "like": [3, 4, 7], "system": [3, 4], "maco": 3, "linux": 3, "suppos": 3, "want": [3, 4], "uint32_t": 3, "add": [3, 4], "In": [3, 4], "our": 3, "file": [3, 4], "declar": [3, 4, 6], "bodi": [3, 7], "32": [3, 4], "dynam": 3, "load": 3, "share": 3, "librari": 3, "look": [3, 4], "directori": [3, 4], "differ": [3, 4], "extens": 3, "exact": 3, "specif": 3, "On": 3, "dylib": 3, "your": 3, "foo": 3, "cry": [3, 4], "Then": [3, 4], "each": [3, 4, 7], "case": [3, 4], "onc": [3, 4], "ani": [3, 4, 7], "sinc": [3, 4], "sourc": [3, 4], "check": 3, "actual": 3, "It": [3, 4], "respons": 3, "make": [3, 4], "sure": [3, 4], "undefin": 3, "doe": 3, "handl": 3, "simpl": [3, 4], "manual": 3, "command": 3, "cc": 3, "fpic": 3, "o": 3, "dynamiclib": 3, "describ": [3, 4], "how": 3, "given": 3, "signatur": [3, 6], "map": 3, "prototyp": 3, "limit": 3, "clear": 3, "translat": 3, "These": 3, "curri": 3, "argument": [3, 6, 7], "certain": 3, "befor": [3, 4], "That": 3, "could": 3, "mani": [3, 4], "after": 3, "directli": [3, 7], "output": 3, "depend": 3, "pointer": 3, "modifi": 3, "store": 3, "list": [3, 6], "size_t": 3, "numer": [3, 4, 6], "furthermor": 3, "satisfi": 3, "explicitli": 3, "fit": 3, "runtim": 3, "error": [3, 4], "requir": [3, 4], "instead": [3, 4, 7], "just": [3, 4, 7], "practic": [3, 4], "would": [3, 4, 7], "too": 3, "cumbersom": [3, 4], "uint8_t": 3, "nonzero": 3, "k": 3, "uint16_t": 3, "uint64_t": 3, "smaller": 3, "extra": 3, "ignor": 3, "instanc": 3, "0xf": 3, "0x0f": 3, "0xaf": 3, "larger": 3, "standard": 3, "convers": 3, "arrai": 3, "float32": 3, "float64": 3, "doubl": 3, "built": [3, 6], "possibli": 3, "u": 3, "itself": [3, 4], "along": 3, "earlier": 3, "alwai": 3, "know": 3, "tn": 3, "mention": [3, 7], "themselv": 3, "u1": 3, "u2": 3, "un": 3, "respect": 3, "f1": 3, "f2": 3, "fn": 3, "arbitrari": 3, "field": [3, 5, 6, 7], "flatten": 3, "out": 3, "behav": 3, "individu": 3, "recurs": [3, 4, 7], "empti": 3, "don": 3, "void": 3, "treat": [3, 4, 7], "except": [3, 4], "input": 3, "version": 3, "becaus": [3, 4], "alreadi": 3, "involv": 3, "alloc": 3, "dealloc": 3, "manag": [3, 6], "non": 3, "piec": 3, "enough": 3, "try": [3, 4], "adjac": 3, "uniniti": 3, "read": 3, "relat": 4, "top": 4, "level": [4, 6], "m": 4, "type": [4, 6], "glu": 4, "ordinari": 4, "hash": 4, "sha256": 4, "structur": [4, 6], "implement": 4, "search": 4, "cryptolpath": 4, "To": 4, "anoth": 4, "wa": 4, "sometim": 4, "0x02": 4, "0x03": 4, "0x04": 4, "help": 4, "reduc": 4, "collis": 4, "tend": 4, "code": [4, 6], "easier": 4, "understand": 4, "easi": 4, "them": 4, "few": 4, "clash": 4, "situat": 4, "conveni": 4, "everyth": 4, "avoid": 4, "happen": 4, "combin": 4, "claus": 4, "introduc": 4, "might": 4, "helper": 4, "function": [4, 6, 7], "intend": 4, "outsid": 4, "good": 4, "place": 4, "0x01": 4, "helper1": 4, "helper2": 4, "public": 4, "remain": 4, "extend": 4, "keyword": [4, 6], "new": [4, 7], "layout": [4, 6], "singl": 4, "equival": 4, "previou": 4, "withing": 4, "keword": 4, "refer": 4, "shadow": 4, "outer": 4, "submdul": 4, "across": 4, "submould": 4, "bring": [4, 7], "upcom": 4, "variant": 4, "featur": 4, "yet": 4, "part": 4, "main": [3, 4], "content": 4, "without": 4, "concret": 4, "assumpt": 4, "about": 4, "constant": [3, 4], "desrib": 4, "parmaet": 4, "sumbodul": 4, "mayb": 4, "link": 4, "abl": 4, "impos": 4, "cours": 4, "done": 4, "impl": 4, "26": 4, "myf": 4, "fill": 4, "my": 4, "slight": 4, "variat": 4, "impl1": 4, "impl2": 4, "deriv": 4, "somewher": 4, "presum": 4, "coupl": 4, "straight": 4, "awai": 4, "thing": 4, "notion": 4, "11": 4, "syntact": 4, "functor": 4, "time": 4, "synonym": [4, 6], "noth": 4, "exist": [4, 7], "semant": 4, "occasion": 4, "being": 4, "eq": 5, "cmp": 5, "ab": 5, "ring": 5, "signedcmp": 5, "complement": 5, "frominteg": 5, "negat": 5, "tointeg": 5, "inffrom": 5, "inffromthen": 5, "recip": 5, "floor": 5, "trunc": 5, "roundawai": 5, "roundtoeven": 5, "basic": 6, "comment": 6, "oper": 6, "annot": 6, "instanti": 6, "condit": 6, "demot": 6, "tupl": 6, "record": [6, 7], "updat": 6, "comparison": 6, "logic": 6, "integr": 6, "hierarch": 6, "qualifi": 6, "implicit": 6, "parameter": 6, "anonym": 6, "foreign": 6, "platform": 6, "usag": 6, "compil": 6, "c": 6, "convert": 6, "overal": 6, "return": 6, "memori": 6, "creat": 7, "pre": 7, "transpar": 7, "unfold": 7, "site": 7, "though": 7, "user": 7, "had": 7, "newt": 7, "seq": 7, "unlik": 7, "distinct": 7, "checker": 7, "moreov": 7, "member": 7, "typeclass": 7, "typecheck": 7, "otherwis": 7, "irrelev": 7, "form": 7, "everi": 7, "project": 7, "extract": 7, "sum": 7, "someth": 3, "a1": 3, "ak": 3, "c1": 3, "cn": 3, "tm": 3, "tr": 3, "expand": 3, "rule": 3, "out0": 3, "out1": 3, "in0": 3, "in1": 3, "in2": 3, "fulli": 3, "process": 3, "0x00000003": 3, "v1": 3, "v2": 3, "vn": 3, "ti": 3, "ui": 3, "vi": 3, "quick": 6}, "objects": {}, "objtypes": {}, "objnames": {}, "titleterms": {"basic": [0, 1, 3, 5], "syntax": 0, "declar": [0, 2, 7], "type": [0, 1, 2, 3, 7], "signatur": 0, "layout": 0, "comment": 0, "todo": [0, 2], "identifi": 0, "keyword": 0, "built": 0, "oper": [0, 1, 2, 5], "preced": 0, "level": 0, "numer": [0, 2], "liter": 0, "tupl": [1, 3], "record": [1, 3], "access": 1, "field": 1, "updat": 1, "sequenc": [1, 3], "function": [1, 2, 3], "express": 2, "call": 2, "prefix": 2, "infix": 2, "annot": 2, "explicit": 2, "instanti": [2, 4], "local": 2, "block": [2, 4], "argument": [2, 4], "condit": 2, "demot": 2, "valu": [2, 3], "foreign": 3, "interfac": [3, 4], "platform": 3, "support": 3, "usag": 3, "compil": 3, "c": 3, "code": 3, "convert": 3, "between": 3, "cryptol": [3, 6], "overal": 3, "structur": 3, "paramet": [3, 4], "bit": 3, "integr": [3, 5], "float": 3, "point": 3, "return": 3, "memori": 3, "modul": 4, "hierarch": 4, "name": 4, "import": 4, "list": 4, "hide": 4, "qualifi": 4, "privat": 4, "nest": 4, "implicit": 4, "manag": 4, "parameter": 4, "an": 4, "constraint": 4, "anonym": 4, "pass": 4, "through": 4, "overload": 5, "equal": 5, "comparison": 5, "sign": 5, "zero": 5, "logic": 5, "arithmet": 5, "divis": 5, "round": 5, "refer": [3, 6], "manual": 6, "synonym": [3, 7], "newtyp": 7, "exampl": 3, "evalu": 3, "quick": 3}, "envversion": {"sphinx.domains.c": 2, "sphinx.domains.changeset": 1, "sphinx.domains.citation": 1, "sphinx.domains.cpp": 6, "sphinx.domains.index": 1, "sphinx.domains.javascript": 2, "sphinx.domains.math": 2, "sphinx.domains.python": 3, "sphinx.domains.rst": 2, "sphinx.domains.std": 2, "sphinx.ext.todo": 2, "sphinx": 56}})
\ No newline at end of file
+Search.setIndex({"docnames": ["BasicSyntax", "BasicTypes", "Expressions", "FFI", "Modules", "OverloadedOperations", "RefMan", "TypeDeclarations"], "filenames": ["BasicSyntax.rst", "BasicTypes.rst", "Expressions.rst", "FFI.rst", "Modules.rst", "OverloadedOperations.rst", "RefMan.rst", "TypeDeclarations.rst"], "titles": ["Basic Syntax", "Basic Types", "Expressions", "Foreign Function Interface", "Modules", "Overloaded Operations", "Cryptol Reference Manual", "Type Declarations"], "terms": {"f": [0, 1, 2, 3, 4], "x": [0, 1, 2, 3, 4, 7], "y": [0, 1, 2, 3, 4], "z": [0, 2, 4], "g": [0, 2, 4], "b": [0, 3, 4, 5, 7], "fin": [0, 3, 4], "group": [0, 4, 7], "ar": [0, 1, 2, 3, 4, 7], "organ": 0, "base": [0, 2], "indent": [0, 4], "same": [0, 1, 3, 4, 7], "belong": 0, "line": [0, 4, 7], "text": 0, "more": [0, 4], "than": [0, 3, 4], "begin": 0, "while": [0, 1, 3], "less": 0, "termin": 0, "consid": [0, 4, 7], "exampl": [0, 1, 2, 4, 6], "follow": [0, 1, 2, 3, 4], "cryptol": [0, 2, 4], "where": [0, 1, 2, 3, 4], "thi": [0, 1, 2, 3, 4], "ha": [0, 1, 2, 3], "two": [0, 1, 2, 4, 7], "one": [0, 2, 3, 4], "all": [0, 2, 3, 4, 7], "between": [0, 6], "The": [0, 1, 2, 3, 4], "principl": 0, "appli": [0, 3], "block": [0, 6], "which": [0, 2, 3, 4, 7], "defin": [0, 1, 3, 4, 7], "local": [0, 4, 6], "name": [0, 1, 3, 6, 7], "support": [0, 4, 6], "start": [0, 1], "end": [0, 4], "mai": [0, 1, 2, 3, 4, 7], "nest": [0, 1, 3, 6], "arbitrarili": 0, "i": [0, 1, 4], "document": [0, 4], "consist": 0, "charact": 0, "first": [0, 1, 3, 4], "must": [0, 3, 4], "either": [0, 3, 4], "an": [0, 1, 2, 3, 6], "english": 0, "letter": 0, "underscor": 0, "_": [0, 1], "decim": 0, "digit": 0, "prime": 0, "some": [0, 4], "have": [0, 1, 2, 3, 4, 7], "special": 0, "mean": [0, 3], "languag": [0, 3], "so": [0, 1, 2, 3, 4], "thei": [0, 1, 3, 4, 7], "us": [0, 1, 2, 3, 4, 7], "programm": 0, "see": [0, 4], "name1": 0, "longer_nam": 0, "name2": 0, "longernam": 0, "extern": 0, "includ": 0, "interfac": [0, 6], "paramet": [0, 2, 6], "properti": 0, "hide": [0, 6], "infix": [0, 6], "let": [0, 3], "pragma": 0, "submodul": [0, 4], "els": [0, 2, 4], "constraint": 6, "infixl": 0, "modul": [0, 3, 6], "primit": 0, "down": [0, 1], "import": [0, 1, 2, 6], "infixr": 0, "newtyp": [0, 4, 6], "privat": [0, 6], "tabl": [0, 3], "contain": [0, 1, 3, 4], "": [], "associ": 0, "lowest": 0, "highest": 0, "last": [0, 2, 3], "right": [0, 1], "left": [0, 1], "unari": [0, 2], "varieti": 0, "allow": [0, 3, 4, 7], "comput": [0, 1], "specifi": [0, 2, 4], "size": [0, 1, 3], "sequenc": [0, 6], "addit": [0, 4], "subtract": 0, "multipl": [0, 1, 2, 3, 4], "divis": [0, 6], "ceil": [0, 5], "round": [0, 6], "up": [0, 3], "modulu": 0, "pad": [0, 3], "exponenti": 0, "lg2": 0, "logarithm": 0, "2": [0, 1, 2, 3, 4, 7], "width": [0, 4], "bit": [0, 1, 2, 4, 5, 6], "equal": [0, 1, 6, 7], "n": [0, 1, 3, 4], "1": [0, 1, 2, 3, 4, 7], "max": [0, 5], "maximum": 0, "min": [0, 5], "minimum": 0, "written": [0, 1, 2, 3, 7], "binari": [0, 3], "octal": 0, "hexadecim": 0, "notat": [0, 1, 2, 4], "determin": [0, 1], "its": [0, 3, 4], "prefix": [0, 4, 6], "0b": 0, "0o": 0, "0x": 0, "254": 0, "0254": 0, "0b11111110": 0, "0o376": 0, "0xfe": 0, "result": [0, 1, 2, 4], "fix": [0, 1, 3], "length": [0, 1, 3], "e": [0, 1, 4, 5], "number": [0, 1, 2, 3], "overload": [0, 6], "infer": [0, 2], "from": [0, 1, 2, 3, 4], "context": [0, 2], "0b1010": 0, "4": [0, 3], "0o1234": 0, "12": [0, 4], "3": [0, 1, 2, 4, 7], "0x1234": 0, "16": [0, 3], "10": [0, 1, 3, 4], "integ": [0, 2, 5, 7], "also": [0, 1, 3, 4], "polynomi": 0, "write": [0, 1, 3], "express": [0, 1, 4, 6, 7], "term": 0, "open": 0, "close": 0, "degre": 0, "6": [0, 7], "7": [0, 2, 4], "0b1010111": 0, "5": [0, 1, 2, 4], "0b11010": 0, "fraction": 0, "ox": 0, "A": [0, 1, 3, 4, 7], "option": [0, 7], "expon": 0, "mark": 0, "symbol": [0, 3, 4], "p": [0, 1, 4], "2e3": 0, "0x30": 0, "64": [0, 3], "1p4": 0, "ration": 0, "float": [0, 6], "famili": 0, "cannot": [0, 2], "repres": 0, "precis": 0, "Such": [0, 4], "reject": 0, "static": [0, 3], "when": [0, 1, 2, 3, 4], "closest": 0, "represent": 0, "even": [0, 7], "effect": 0, "valu": [0, 1, 4, 6, 7], "improv": [0, 3], "readabl": [0, 3], "here": [0, 2, 4], "0b_0000_0010": 0, "0x_ffff_ffea": 0, "packag": 1, "togeth": [1, 4], "enclos": [1, 4], "parenthes": 1, "curli": 1, "brace": 1, "compon": [1, 3], "both": [1, 4], "separ": [1, 4], "comma": 1, "label": 1, "sign": [1, 6], "identifi": [1, 4, 6], "posit": 1, "order": [1, 3, 4], "most": [1, 4], "purpos": [1, 7], "true": [1, 3], "fals": [1, 3], "lexicograph": 1, "compar": 1, "appear": [1, 7], "wherea": 1, "alphabet": 1, "wai": [1, 3, 4], "via": 1, "pattern": [1, 2], "match": [1, 3], "explicit": [1, 4, 6], "selector": 1, "15": 1, "20": [1, 3], "0": [0, 1, 2, 3], "onli": [0, 1, 3, 4, 7], "program": 1, "suffici": [1, 2], "inform": 1, "shape": 1, "For": [0, 1, 2, 3, 4, 7], "t": [0, 1, 2, 3, 4, 7], "valid": 1, "definit": [1, 2, 4], "known": 1, "isposit": 1, "invalid": 1, "insuffici": 1, "baddef": 1, "mirror": 1, "syntax": [1, 2, 6], "construct": [1, 2, 4], "getfst": 1, "distance2": 1, "xpo": 1, "ypo": 1, "lift": 1, "through": [1, 6], "point": [1, 6], "wise": 1, "equat": 1, "should": [0, 1, 2, 3], "hold": [1, 3], "l": [1, 3], "thu": [1, 4], "we": [1, 3, 4], "can": [0, 1, 2, 3, 4, 7], "quickli": 1, "obtain": [1, 3, 4], "similarli": 1, "get": 1, "entri": 1, "behavior": [1, 3], "quit": [1, 4], "handi": 1, "examin": 1, "complex": 1, "data": 1, "repl": 1, "r": 1, "pt": 1, "100": 1, "set": [0, 1, 3], "30": [1, 4], "rel": 1, "old": 1, "25": 1, "collect": [1, 7], "element": [1, 2, 3], "finit": [1, 2], "often": 1, "call": [1, 3, 4, 6], "word": [1, 3], "abbrevi": 1, "infinit": 1, "inf": [1, 5], "stream": 1, "e1": 1, "e2": 1, "e3": 1, "three": 1, "t1": [1, 3], "t2": [1, 3], "enumer": 1, "exclus": 1, "bound": [1, 3], "stride": 1, "ex": 1, "downward": 1, "t3": 1, "step": [1, 4], "p11": 1, "e11": 1, "p12": 1, "e12": 1, "comprehens": 1, "p21": 1, "e21": 1, "p22": 1, "e22": 1, "gener": [1, 3], "index": 1, "bind": [1, 3], "arr": 1, "j": [1, 4], "dimension": 1, "note": [0, 1, 3, 4], "those": [1, 4], "descript": 1, "concaten": 1, "shift": 1, "rotat": 1, "arithmet": [1, 6], "bitvector": 1, "front": 1, "back": 1, "sub": [1, 4], "updateend": 1, "locat": [1, 4], "updatesend": 1, "There": 1, "pointwis": 1, "p1": 1, "p2": 1, "p3": 1, "p4": 1, "split": [1, 3], "lambda": [1, 2], "section": [2, 3, 4], "provid": [2, 4], "overview": 2, "h": [2, 4], "pair": 2, "paren": 2, "ad": [2, 3, 4], "8": [2, 3, 4], "whole": [2, 3, 4], "9": 2, "variabl": [2, 3], "If": [2, 3, 4], "polymorph": [2, 3], "typaram": 2, "zero": [2, 3, 6], "you": [2, 3, 4], "evalu": [2, 6], "pass": [2, 3, 6], "13": 2, "weakest": 2, "preced": [2, 4], "scope": [2, 4, 7], "defint": 2, "do": [2, 3, 4, 7], "need": [2, 3, 4], "branch": [0, 2], "22": 2, "33": 2, "correspond": [2, 3], "access": [2, 3, 6], "kind": [2, 3], "larg": [2, 3], "accommod": 2, "liter": [2, 6], "backtick": 2, "sugar": [2, 4], "applic": 2, "primtiv": 2, "abov": [2, 3, 4], "suitabl": 2, "automat": [2, 3], "chosen": 2, "possibl": [2, 3, 4], "usual": 2, "ffi": 3, "other": [3, 4, 7], "convent": 3, "current": 3, "window": 3, "work": [3, 4], "unix": 3, "like": [0, 3, 4, 7], "system": [3, 4], "maco": 3, "linux": 3, "suppos": 3, "want": [3, 4], "uint32_t": 3, "add": [3, 4], "In": [0, 3, 4], "our": 3, "file": [3, 4], "declar": [3, 4, 6], "bodi": [3, 7], "32": [3, 4], "dynam": 3, "load": 3, "share": 3, "librari": 3, "look": [3, 4], "directori": [3, 4], "differ": [0, 3, 4], "extens": 3, "exact": 3, "specif": 3, "On": 3, "dylib": 3, "your": 3, "foo": 3, "cry": [3, 4], "Then": [3, 4], "each": [3, 4, 7], "case": [3, 4], "onc": [3, 4], "ani": [3, 4, 7], "sinc": [0, 3, 4], "sourc": [3, 4], "check": 3, "actual": 3, "It": [3, 4], "respons": 3, "make": [3, 4], "sure": [3, 4], "undefin": 3, "doe": 3, "handl": 3, "simpl": [3, 4], "manual": 3, "command": 3, "cc": 3, "fpic": 3, "o": 3, "dynamiclib": 3, "describ": [3, 4], "how": 3, "given": 3, "signatur": [3, 6], "map": 3, "prototyp": 3, "limit": 3, "clear": 3, "translat": 3, "These": 3, "curri": 3, "argument": [3, 6, 7], "certain": 3, "befor": [3, 4], "That": 3, "could": 3, "mani": [3, 4], "after": 3, "directli": [3, 7], "output": 3, "depend": 3, "pointer": 3, "modifi": 3, "store": 3, "list": [3, 6], "size_t": 3, "numer": [3, 4, 6], "furthermor": 3, "satisfi": 3, "explicitli": 3, "fit": 3, "runtim": 3, "error": [3, 4], "requir": [0, 3, 4], "instead": [3, 4, 7], "just": [3, 4, 7], "practic": [3, 4], "would": [3, 4, 7], "too": 3, "cumbersom": [3, 4], "uint8_t": 3, "nonzero": 3, "k": 3, "uint16_t": 3, "uint64_t": 3, "smaller": 3, "extra": 3, "ignor": 3, "instanc": 3, "0xf": 3, "0x0f": 3, "0xaf": 3, "larger": 3, "standard": 3, "convers": 3, "arrai": 3, "float32": 3, "float64": 3, "doubl": 3, "built": [3, 6], "possibli": [], "u": 3, "itself": [3, 4], "along": 3, "earlier": 3, "alwai": 3, "know": 3, "tn": 3, "mention": [3, 7], "themselv": 3, "u1": 3, "u2": 3, "un": 3, "respect": 3, "f1": 3, "f2": 3, "fn": 3, "arbitrari": 3, "field": [3, 5, 6, 7], "flatten": 3, "out": 3, "behav": 3, "individu": 3, "recurs": [3, 4, 7], "empti": 3, "don": 3, "void": 3, "treat": [3, 4, 7], "except": [0, 3, 4], "input": 3, "version": 3, "becaus": [3, 4], "alreadi": 3, "involv": 3, "alloc": 3, "dealloc": 3, "manag": [3, 6], "non": [0, 3], "piec": 3, "enough": 3, "try": [3, 4], "adjac": 3, "uniniti": 3, "read": 3, "relat": 4, "top": 4, "level": [4, 6], "m": 4, "type": [4, 6], "glu": 4, "ordinari": 4, "hash": 4, "sha256": 4, "structur": [4, 6], "implement": 4, "search": 4, "cryptolpath": 4, "To": 4, "anoth": 4, "wa": 4, "sometim": 4, "0x02": 4, "0x03": 4, "0x04": 4, "help": 4, "reduc": 4, "collis": 4, "tend": 4, "code": [4, 6], "easier": 4, "understand": 4, "easi": 4, "them": 4, "few": 4, "clash": 4, "situat": 4, "conveni": 4, "everyth": 4, "avoid": 4, "happen": 4, "combin": 4, "claus": 4, "introduc": 4, "might": 4, "helper": 4, "function": [4, 6, 7], "intend": 4, "outsid": 4, "good": 4, "place": 4, "0x01": 4, "helper1": 4, "helper2": 4, "public": 4, "remain": 4, "extend": 4, "keyword": [4, 6], "new": [4, 7], "layout": [4, 6], "singl": 4, "equival": 4, "previou": 4, "withing": 4, "keword": 4, "refer": 4, "shadow": 4, "outer": 4, "submdul": 4, "across": 4, "submould": 4, "bring": [4, 7], "upcom": 4, "variant": 4, "featur": 4, "yet": 4, "part": 4, "main": [3, 4], "content": 4, "without": 4, "concret": 4, "assumpt": 4, "about": 4, "constant": [3, 4], "desrib": 4, "parmaet": 4, "sumbodul": 4, "mayb": 4, "link": 4, "abl": 4, "impos": 4, "cours": 4, "done": 4, "impl": 4, "26": 4, "myf": 4, "fill": 4, "my": 4, "slight": 4, "variat": 4, "impl1": 4, "impl2": 4, "deriv": 4, "somewher": 4, "presum": 4, "coupl": 4, "straight": 4, "awai": 4, "thing": 4, "notion": 4, "11": 4, "syntact": 4, "functor": 4, "time": 4, "synonym": [4, 6], "noth": 4, "exist": [4, 7], "semant": 4, "occasion": 4, "being": 4, "eq": 5, "cmp": 5, "ab": 5, "ring": 5, "signedcmp": 5, "complement": 5, "frominteg": 5, "negat": 5, "tointeg": 5, "inffrom": 5, "inffromthen": 5, "recip": 5, "floor": 5, "trunc": 5, "roundawai": 5, "roundtoeven": 5, "basic": 6, "comment": 6, "oper": 6, "annot": 6, "instanti": 6, "condit": [0, 6], "demot": 6, "tupl": 6, "record": [6, 7], "updat": 6, "comparison": 6, "logic": 6, "integr": 6, "hierarch": 6, "qualifi": 6, "implicit": 6, "parameter": 6, "anonym": 6, "foreign": 6, "platform": 6, "usag": 6, "compil": 6, "c": 6, "convert": 6, "overal": 6, "return": 6, "memori": 6, "creat": 7, "pre": 7, "transpar": 7, "unfold": 7, "site": 7, "though": 7, "user": 7, "had": 7, "newt": 7, "seq": 7, "unlik": 7, "distinct": 7, "checker": [0, 7], "moreov": 7, "member": 7, "typeclass": 7, "typecheck": 7, "otherwis": 7, "irrelev": 7, "form": 7, "everi": 7, "project": 7, "extract": 7, "sum": 7, "someth": 3, "a1": 3, "ak": 3, "c1": 3, "cn": 3, "tm": 3, "tr": 3, "expand": 3, "rule": 3, "out0": 3, "out1": 3, "in0": 3, "in1": 3, "in2": 3, "fulli": 3, "process": 3, "0x00000003": 3, "v1": 3, "v2": 3, "vn": 3, "ti": 3, "ui": 3, "vi": 3, "quick": 6, "normal": 0, "multi": 0, "len": 0, "xs": [0, 1], "drop": 0, "importantli": 0, "s": [0, 2, 3, 4], "howev": 0, "assum": 0, "fact": 0, "over": 0, "etc": 0, "alias": 0, "long": 0, "constrain": 0, "exhaust": 0, "attempt": 0, "prove": 0, "issu": 0, "warn": 0, "control": 0, "environment": 0, "warnnonexhaustiveconstraintguard": 0, "guard": 6}, "objects": {}, "objtypes": {}, "objnames": {}, "titleterms": {"basic": [0, 1, 3, 5], "syntax": 0, "declar": [0, 2, 7], "type": [0, 1, 2, 3, 7], "signatur": 0, "layout": 0, "comment": 0, "todo": [0, 2], "identifi": 0, "keyword": 0, "built": 0, "oper": [0, 1, 2, 5], "preced": 0, "level": 0, "numer": [0, 2], "liter": 0, "tupl": [1, 3], "record": [1, 3], "access": 1, "field": 1, "updat": 1, "sequenc": [1, 3], "function": [1, 2, 3], "express": 2, "call": 2, "prefix": 2, "infix": 2, "annot": 2, "explicit": 2, "instanti": [2, 4], "local": 2, "block": [2, 4], "argument": [2, 4], "condit": 2, "demot": 2, "valu": [2, 3], "foreign": 3, "interfac": [3, 4], "platform": 3, "support": 3, "usag": 3, "compil": 3, "c": 3, "code": 3, "convert": 3, "between": 3, "cryptol": [3, 6], "overal": 3, "structur": 3, "paramet": [3, 4], "bit": 3, "integr": [3, 5], "float": 3, "point": 3, "return": 3, "memori": 3, "modul": 4, "hierarch": 4, "name": 4, "import": 4, "list": 4, "hide": 4, "qualifi": 4, "privat": 4, "nest": 4, "implicit": 4, "manag": 4, "parameter": 4, "an": 4, "constraint": [0, 4], "anonym": 4, "pass": 4, "through": 4, "overload": 5, "equal": 5, "comparison": 5, "sign": 5, "zero": 5, "logic": 5, "arithmet": 5, "divis": 5, "round": 5, "refer": [3, 6], "manual": 6, "synonym": [3, 7], "newtyp": 7, "exampl": 3, "evalu": 3, "quick": 3, "guard": 0}, "envversion": {"sphinx.domains.c": 2, "sphinx.domains.changeset": 1, "sphinx.domains.citation": 1, "sphinx.domains.cpp": 6, "sphinx.domains.index": 1, "sphinx.domains.javascript": 2, "sphinx.domains.math": 2, "sphinx.domains.python": 3, "sphinx.domains.rst": 2, "sphinx.domains.std": 2, "sphinx.ext.todo": 2, "sphinx": 56}})
\ No newline at end of file

From 961cb004e335830ddff381217c8a7eb99e032402 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Sat, 13 Aug 2022 14:37:47 -0700
Subject: [PATCH 059/125] cryptolError for ExpandPropGuardsError

---
 cryptol-remote-api/src/CryptolServer/Exceptions.hs | 5 +++++
 1 file changed, 5 insertions(+)

diff --git a/cryptol-remote-api/src/CryptolServer/Exceptions.hs b/cryptol-remote-api/src/CryptolServer/Exceptions.hs
index 43bd915ad..ace98053b 100644
--- a/cryptol-remote-api/src/CryptolServer/Exceptions.hs
+++ b/cryptol-remote-api/src/CryptolServer/Exceptions.hs
@@ -79,6 +79,11 @@ cryptolError modErr warns =
         (20710, [ ("source", jsonPretty src)
                 , ("errors", jsonList (map jsonPretty errs))
                 ])
+      ExpandPropGuardsError src err ->
+        (20711, [ ("source", jsonPretty src)
+                , ("errors", jsonPretty err)
+                ])
+        
       NoIncludeErrors src errs ->
         -- TODO: structured error here
         (20720, [ ("source", jsonPretty src)

From 98e944e9fc3b7bd749b7688108218ea37c581a6c Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Mon, 15 Aug 2022 10:19:11 -0700
Subject: [PATCH 060/125] added Mergesort, removed old tests

---
 tests/constraint-guards/Inits.cry     | 26 +++++------
 tests/constraint-guards/Len.cry       |  3 +-
 tests/constraint-guards/Mergesory.cry | 28 ++++++++++++
 tests/constraint-guards/Parsing.cry   | 66 ---------------------------
 tests/constraint-guards/Test1.cry     | 12 -----
 tests/constraint-guards/Test3.cry     |  4 --
 tests/constraint-guards/Test4.cry     | 16 -------
 7 files changed, 41 insertions(+), 114 deletions(-)
 create mode 100644 tests/constraint-guards/Mergesory.cry
 delete mode 100644 tests/constraint-guards/Parsing.cry
 delete mode 100644 tests/constraint-guards/Test1.cry
 delete mode 100644 tests/constraint-guards/Test3.cry
 delete mode 100644 tests/constraint-guards/Test4.cry

diff --git a/tests/constraint-guards/Inits.cry b/tests/constraint-guards/Inits.cry
index 02aa8d645..f19194219 100644
--- a/tests/constraint-guards/Inits.cry
+++ b/tests/constraint-guards/Inits.cry
@@ -9,20 +9,18 @@ inits : {n, a} (fin n) => [n]a -> [(n * (n+1))/2]a
 inits xs
   | n == 0 => []
   | n >  0 => go xs' x []
-  where
-    x   = take `{1} xs
-    xs' = drop `{1} xs
-    
-    go : {l, m} (fin l, fin m, l + m == n, m >= 1) =>
-      [l]a -> [m]a -> 
-      [((m-1) * ((m-1)+1))/2]a ->
-      [(n * (n+1))/2]a
-    go ys zs acc
-      | l == 0 => acc # zs
-      | l >  0 => go ys' (zs # y) (acc # zs)
-        where 
-          y   = take `{1} ys
-          ys' = drop `{1} ys
+    where
+      (x : [1]_) # xs' = xs
+      
+      go : {l, m} (fin l, fin m, l + m == n, m >= 1) =>
+        [l]a -> [m]a -> 
+        [((m-1) * ((m-1)+1))/2]a ->
+        [(n * (n+1))/2]a
+      go ys zs acc
+        | l == 0 => acc # zs
+        | l >  0 => go ys' (zs # y) (acc # zs)
+          where 
+            (y : [1]_) # ys' = ys
 
 
 property inits_correct =
diff --git a/tests/constraint-guards/Len.cry b/tests/constraint-guards/Len.cry
index 5cdb79ef3..f2868c2c8 100644
--- a/tests/constraint-guards/Len.cry
+++ b/tests/constraint-guards/Len.cry
@@ -1,10 +1,9 @@
-// Yields non-exhaustive constraint guards warning if
-// warnNonExhaustiveConstraintGuards is on.
 len : {n,a} (fin n) => [n] a -> Integer
 len x
   | (n == 0) => 0
   | (n >  0) => 1 + len (drop`{1} x)
 
+
 property 
   len_correct = and
     [ len l == length l where l = []
diff --git a/tests/constraint-guards/Mergesory.cry b/tests/constraint-guards/Mergesory.cry
new file mode 100644
index 000000000..0a3b2e4db
--- /dev/null
+++ b/tests/constraint-guards/Mergesory.cry
@@ -0,0 +1,28 @@
+sort : {n,a} Cmp a => (fin n) => [n]a -> [n]a
+sort xs
+  | n <= 1 => xs
+  | ()     => merge (sort left) (sort right)
+              where (left : [n/2] _) # right = xs
+
+merge : {m,n,a} Cmp a => [m]a -> [n]a -> [m+n]a
+merge xs ys
+  | m == 0  => ys
+  | n == 0  => xs
+  | (m > 0, n > 0) => if x <= y 
+                        then [x] # merge restX ys
+                        else [y] # merge xs restY
+                      where
+                      [x] # restX = xs
+                      [y] # restY = ys
+
+
+property sort_correct =
+  (sort [] == []) &&
+  (sort [0] == [0]) &&
+  (sort [-6, 1, 9, -3, -9, 2, 4] == [-9, -6, -3, 1, 2, 4, 9]) &&
+  (sort [4, -8, -1, -7, -5, 9, 8, 8] == [-8, -7, -5, -1, 4, 8, 8, 9]) &&
+  (sort [1, -1, -2, -3, -2, 7, 5] == [-3, -2, -2, -1, 1, 5, 7]) &&
+  (sort [9, 9, 8, -3, 1, 1, -6, -6, -8] == [-8, -6, -6, -3, 1, 1, 8, 9, 9]) &&
+  (sort [9, 1, 5, 0] == [0, 1, 5, 9]) &&
+  (sort [8, 3, 3] == [3, 3, 8]) &&
+  (sort [-7, 8] == [-7, 8])
\ No newline at end of file
diff --git a/tests/constraint-guards/Parsing.cry b/tests/constraint-guards/Parsing.cry
deleted file mode 100644
index b597b3be0..000000000
--- a/tests/constraint-guards/Parsing.cry
+++ /dev/null
@@ -1,66 +0,0 @@
-module Parsing where
-
-// Constraints are parsed the same as types
-
-foo : {n} [n] -> [n]
-foo x = x
-
-l : {n} fin n => [n] -> [n]
-l _ = `n
-
-// f : {n} [n] -> [n]
-// f .. x = x
-
-// f : {n} [n] -> [n]
-// f .. (fin n) .. x = x
-
-// f : {n} [n] -> [n]
-// f <| (fin n, n == 1) => |> x = x
-
-// f : {n} fin n
-// f = undefined
-
-// f : {n} ([n], [n], [n])
-// f = undefined
-
-// f : {n} (n == 1) => [n] -> [n]
-// f x = x
-
-// f : {n} fin n => fin n => [1] -> [1]
-// f x = x
-
-// Tests
-
-// f : {n} [n] -> [n]
-// f <| (n == 1) => |> x = x
-
-// f : {n} [n] -> [n]
-// f x = x
-
-// g : {n} (fin n) => [n] -> [n]
-// g <| (n == 0) |> _ = []
-
-// g' : {n} [n] -> [n]
-// g' <| (n == 1) |> x = x
-
-// FAILS when evaluated on [1,2]
-f : {n} [n] -> [8]
-f x
-  | n == 1 => g1 x // passes
-  | n == 2 => g2 x // passes
-  | n == 3 => g3 x // passes
-  // | n == n => g4 x // fails
-
-g1 : {n} (n == 1) => [n] -> [8]
-g1 x = 1
-
-g2 : {n} (n == 2) => [n] -> [8]
-g2 x = 2
-
-g3 : {n} (n == 3) => [n] -> [8]
-g3 x = 3
-
-g4 : {n} (n == 4) => [n] -> [8]
-g4 x = 4
-
-
diff --git a/tests/constraint-guards/Test1.cry b/tests/constraint-guards/Test1.cry
deleted file mode 100644
index 2199b2858..000000000
--- a/tests/constraint-guards/Test1.cry
+++ /dev/null
@@ -1,12 +0,0 @@
-// PASSES
-// testA : {n} (fin n) => [n] -> [n]
-// testA x = propguards
-//   | n - n == 0 => x
-
-// FAILS
-// testB : {m, n, l} [n] -> [n]
-// testB x = propguards
-//   | (m - n == l) => x
-
-test : {m, n, l} (fin n, m >= n, m - n == l) => [n] -> [n]
-test x = x
\ No newline at end of file
diff --git a/tests/constraint-guards/Test3.cry b/tests/constraint-guards/Test3.cry
deleted file mode 100644
index a71a23288..000000000
--- a/tests/constraint-guards/Test3.cry
+++ /dev/null
@@ -1,4 +0,0 @@
-test : {n, a} [n]a -> Integer
-test x
-  | (n - 1 >= 0, n >= 1) => 0
-  | n == n => 1
\ No newline at end of file
diff --git a/tests/constraint-guards/Test4.cry b/tests/constraint-guards/Test4.cry
deleted file mode 100644
index 3bc1cf3a2..000000000
--- a/tests/constraint-guards/Test4.cry
+++ /dev/null
@@ -1,16 +0,0 @@
-test : {n, a} [n]a -> Bit
-test x
-  | (n - 5 >= 0, n >= 5) => True
-  | 0 == 0 => False
-
-property test_True = 
-  (test [1..5] == True) &&
-  (test [1..6] == True) &&
-  (test [1..7] == True) &&
-  (test [1..8] == True)
-
-property test_False = 
-  (test [1..1] == False) &&
-  (test [1..2] == False) &&
-  (test [1..3] == False) &&
-  (test [1..4] == False)

From 38c72b2815181530b20a3932a34670266ac2f4f8 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Mon, 15 Aug 2022 13:18:16 -0700
Subject: [PATCH 061/125] type in filename [ci skip]

---
 tests/constraint-guards/{Mergesory.cry => Mergesort.cry} | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)
 rename tests/constraint-guards/{Mergesory.cry => Mergesort.cry} (97%)

diff --git a/tests/constraint-guards/Mergesory.cry b/tests/constraint-guards/Mergesort.cry
similarity index 97%
rename from tests/constraint-guards/Mergesory.cry
rename to tests/constraint-guards/Mergesort.cry
index 0a3b2e4db..0bdf15bb5 100644
--- a/tests/constraint-guards/Mergesory.cry
+++ b/tests/constraint-guards/Mergesort.cry
@@ -25,4 +25,4 @@ property sort_correct =
   (sort [9, 9, 8, -3, 1, 1, -6, -6, -8] == [-8, -6, -6, -3, 1, 1, 8, 9, 9]) &&
   (sort [9, 1, 5, 0] == [0, 1, 5, 9]) &&
   (sort [8, 3, 3] == [3, 3, 8]) &&
-  (sort [-7, 8] == [-7, 8])
\ No newline at end of file
+  sort [-7, 8] == [-7, 8]
\ No newline at end of file

From 29542472996fba2ebcafa465a292909e8643461c Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Mon, 15 Aug 2022 14:46:25 -0700
Subject: [PATCH 062/125] new test: insert

---
 tests/constraint-guards/Insert.cry | 28 ++++++++++++++++++++++++++++
 1 file changed, 28 insertions(+)
 create mode 100644 tests/constraint-guards/Insert.cry

diff --git a/tests/constraint-guards/Insert.cry b/tests/constraint-guards/Insert.cry
new file mode 100644
index 000000000..f5ab79738
--- /dev/null
+++ b/tests/constraint-guards/Insert.cry
@@ -0,0 +1,28 @@
+// assumes that `xs` is sorted
+insert : {n, a} (fin n, Cmp a) => a -> [n]a -> [n+1]a
+insert x' xs 
+  | n == 0         => [x']
+  | n == 1         => if x' <= x then [x', x] else [x, x']
+                      where [x] = xs
+  | ( n % 2 == 0
+    , n     >  1 ) => if x' <= x 
+                        then insert x' (xs1 # [x]) # xs2 
+                        else xs1 # [x] # insert x' xs2
+                      where (xs1 : [n/2 - 1]_) # [x] # (xs2 : [n/2]_) = xs
+  | ( n % 2 == 1
+    , n     >  1 ) => if x' <= x 
+                        then insert x' (xs1 # [x]) # xs2
+                        else xs1 # [x] # insert x' xs2
+                      where (xs1 : [n/2]_) # [x] # (xs2 : [n/2]_) = xs
+
+property insert_correct =
+  (insert 0 [  1,2,3,4,5,6,7,8,9] == [0,1,2,3,4,5,6,7,8,9]) &&
+  (insert 1 [0,  2,3,4,5,6,7,8,9] == [0,1,2,3,4,5,6,7,8,9]) &&
+  (insert 2 [0,1,  3,4,5,6,7,8,9] == [0,1,2,3,4,5,6,7,8,9]) &&
+  (insert 3 [0,1,2,  4,5,6,7,8,9] == [0,1,2,3,4,5,6,7,8,9]) &&
+  (insert 4 [0,1,2,3,  5,6,7,8,9] == [0,1,2,3,4,5,6,7,8,9]) &&
+  (insert 5 [0,1,2,3,4,  6,7,8,9] == [0,1,2,3,4,5,6,7,8,9]) &&
+  (insert 6 [0,1,2,3,4,5,  7,8,9] == [0,1,2,3,4,5,6,7,8,9]) &&
+  (insert 7 [0,1,2,3,4,5,6,  8,9] == [0,1,2,3,4,5,6,7,8,9]) &&
+  (insert 8 [0,1,2,3,4,5,6,7,  9] == [0,1,2,3,4,5,6,7,8,9]) &&
+  (insert 9 [0,1,2,3,4,5,6,7,8  ] == [0,1,2,3,4,5,6,7,8,9])

From 556e12f746644bb2e172fd2b9101ae698c0e8cc9 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Mon, 15 Aug 2022 14:48:13 -0700
Subject: [PATCH 063/125] [ci skip]


From cc15341f5183cfa72fd1a63f04b24fcbfe7435c7 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Wed, 17 Aug 2022 10:32:00 -0700
Subject: [PATCH 064/125] removed comment

---
 src/Cryptol/Version.hs | 1 -
 1 file changed, 1 deletion(-)

diff --git a/src/Cryptol/Version.hs b/src/Cryptol/Version.hs
index 38809b324..ad439e899 100644
--- a/src/Cryptol/Version.hs
+++ b/src/Cryptol/Version.hs
@@ -6,7 +6,6 @@
 -- Stability   :  provisional
 -- Portability :  portable
 
--- {-# LANGUAGE Safe #-}
 {-# LANGUAGE CPP  #-}
 {-# LANGUAGE Safe #-}
 

From a78e6a33e25e227dfff0a2d8750a83494daf36b3 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Wed, 17 Aug 2022 10:48:17 -0700
Subject: [PATCH 065/125] added field Schema of EPropGuards

---
 src/Cryptol/Eval.hs                           |  2 +-
 src/Cryptol/Eval/Reference.lhs                |  2 +-
 src/Cryptol/IR/FreeVars.hs                    |  2 +-
 src/Cryptol/ModuleSystem/InstantiateModule.hs |  2 +-
 src/Cryptol/Transform/AddModParams.hs         |  2 +-
 src/Cryptol/Transform/MonoValues.hs           |  2 +-
 src/Cryptol/Transform/Specialize.hs           |  2 +-
 src/Cryptol/TypeCheck/AST.hs                  |  4 ++--
 src/Cryptol/TypeCheck/Infer.hs                |  6 ++++--
 src/Cryptol/TypeCheck/Parseable.hs            |  2 +-
 src/Cryptol/TypeCheck/Sanity.hs               |  8 +++++---
 src/Cryptol/TypeCheck/Subst.hs                |  2 +-
 src/Cryptol/TypeCheck/TypeOf.hs               | 11 +++++++----
 13 files changed, 27 insertions(+), 20 deletions(-)

diff --git a/src/Cryptol/Eval.hs b/src/Cryptol/Eval.hs
index f6ba37514..edcb627a2 100644
--- a/src/Cryptol/Eval.hs
+++ b/src/Cryptol/Eval.hs
@@ -218,7 +218,7 @@ evalExpr sym env expr = case expr of
      env' <- evalDecls sym ds env
      evalExpr sym env' e
 
-  EPropGuards guards -> {-# SCC "evalExpr->EPropGuards" #-} do
+  EPropGuards guards _ -> {-# SCC "evalExpr->EPropGuards" #-} do
     -- let
     --   evalPropGuard (props, e) = do
     --     if and $ checkProp . evalProp env <$> props
diff --git a/src/Cryptol/Eval/Reference.lhs b/src/Cryptol/Eval/Reference.lhs
index c56b2f6ec..39c6d24a3 100644
--- a/src/Cryptol/Eval/Reference.lhs
+++ b/src/Cryptol/Eval/Reference.lhs
@@ -333,7 +333,7 @@ assigns values to those variables.
 >     EProofApp e    -> evalExpr env e
 >     EWhere e dgs   -> evalExpr (foldl evalDeclGroup env dgs) e
 >
->     EPropGuards _guards -> error "unimplemented: `evalExpr (EPropGuards _)`" -- TODO
+>     EPropGuards _guards _schema -> error "unimplemented: `evalExpr (EPropGuards _)`" -- TODO
 
 > appFun :: E Value -> E Value -> E Value
 > appFun f v = f >>= \f' -> fromVFun f' v
diff --git a/src/Cryptol/IR/FreeVars.hs b/src/Cryptol/IR/FreeVars.hs
index 70d6fcab0..1d44f2ff3 100644
--- a/src/Cryptol/IR/FreeVars.hs
+++ b/src/Cryptol/IR/FreeVars.hs
@@ -117,7 +117,7 @@ instance FreeVars Expr where
       EProofAbs p e     -> freeVars p <> freeVars e
       EProofApp e       -> freeVars e
       EWhere e ds       -> foldFree ds <> rmVals (defs ds) (freeVars e)
-      EPropGuards guards -> mconcat $ freeVars <$> (snd <$> guards)
+      EPropGuards guards _ -> mconcat $ freeVars <$> (snd <$> guards)
     where
       foldFree :: (FreeVars a, Defs a) => [a] -> Deps
       foldFree = foldr updateFree mempty
diff --git a/src/Cryptol/ModuleSystem/InstantiateModule.hs b/src/Cryptol/ModuleSystem/InstantiateModule.hs
index 30d1e5f75..3c6bb49fb 100644
--- a/src/Cryptol/ModuleSystem/InstantiateModule.hs
+++ b/src/Cryptol/ModuleSystem/InstantiateModule.hs
@@ -219,7 +219,7 @@ instance Inst Expr where
 
         -- this doesn't exist in the new module system, so it will have to be
         -- implemented differently there anyway
-        EPropGuards _guards       -> EPropGuards undefined 
+        EPropGuards _guards _schema -> panic "inst" ["This is not implemented for EPropGuards yet."]
 
 
 instance Inst DeclGroup where
diff --git a/src/Cryptol/Transform/AddModParams.hs b/src/Cryptol/Transform/AddModParams.hs
index 163f16af4..ced5c25c7 100644
--- a/src/Cryptol/Transform/AddModParams.hs
+++ b/src/Cryptol/Transform/AddModParams.hs
@@ -259,7 +259,7 @@ instance Inst Expr where
          _ -> EProofApp (inst ps e1)
 
      EWhere e dgs  -> EWhere (inst ps e) (inst ps dgs)
-     EPropGuards guards -> EPropGuards (second (inst ps) <$> guards)
+     EPropGuards guards schema -> EPropGuards (second (inst ps) <$> guards) schema
 
 
 instance Inst Match where
diff --git a/src/Cryptol/Transform/MonoValues.hs b/src/Cryptol/Transform/MonoValues.hs
index bfc7dbc0c..91b29f150 100644
--- a/src/Cryptol/Transform/MonoValues.hs
+++ b/src/Cryptol/Transform/MonoValues.hs
@@ -201,7 +201,7 @@ rewE rews = go
       EWhere e dgs    -> EWhere      <$> go e <*> inLocal
                                                   (mapM (rewDeclGroup rews) dgs)
 
-      EPropGuards guards -> EPropGuards <$> (\(props, e) -> (,) <$> pure props <*> go e) `traverse` guards
+      EPropGuards guards schema -> EPropGuards <$> (\(props, e) -> (,) <$> pure props <*> go e) `traverse` guards <*> pure schema 
 
 
 rewM :: RewMap -> Match -> M Match
diff --git a/src/Cryptol/Transform/Specialize.hs b/src/Cryptol/Transform/Specialize.hs
index 5ce0db3d6..4af0d71c9 100644
--- a/src/Cryptol/Transform/Specialize.hs
+++ b/src/Cryptol/Transform/Specialize.hs
@@ -102,7 +102,7 @@ specializeExpr expr =
     EProofAbs p e -> EProofAbs p <$> specializeExpr e
     EProofApp {}  -> specializeConst expr
     EWhere e dgs  -> specializeEWhere e dgs
-    EPropGuards guards -> EPropGuards <$> (\(props, e) -> (,) <$> pure props <*> specializeExpr e) `traverse` guards
+    EPropGuards guards schema -> EPropGuards <$> (\(props, e) -> (,) <$> pure props <*> specializeExpr e) `traverse` guards <*> pure schema
 
 specializeMatch :: Match -> SpecM Match
 specializeMatch (From qn l t e) = From qn l t <$> specializeExpr e
diff --git a/src/Cryptol/TypeCheck/AST.hs b/src/Cryptol/TypeCheck/AST.hs
index 3b28ffd4a..c58cf7683 100644
--- a/src/Cryptol/TypeCheck/AST.hs
+++ b/src/Cryptol/TypeCheck/AST.hs
@@ -150,7 +150,7 @@ data Expr   = EList [Expr] Type         -- ^ List value (with type of elements)
 
             | EWhere Expr [DeclGroup]
 
-            | EPropGuards [([Prop], Expr)]
+            | EPropGuards [([Prop], Expr)] Schema
 
               deriving (Show, Generic, NFData)
 
@@ -270,7 +270,7 @@ instance PP (WithNames Expr) where
                          , hang "where" 2 (vcat (map ppW ds))
                          ]
       
-      EPropGuards guards -> 
+      EPropGuards guards _ -> 
         parens (text "propguard" <+> hsep (ppGuard <$> guards))
         where ppGuard (props, e) = 
                 pipe <+> commaSep (pp <$> props) <+> text "=>" <+> pp e
diff --git a/src/Cryptol/TypeCheck/Infer.hs b/src/Cryptol/TypeCheck/Infer.hs
index 643c8b2a1..73dd7f169 100644
--- a/src/Cryptol/TypeCheck/Infer.hs
+++ b/src/Cryptol/TypeCheck/Infer.hs
@@ -1167,12 +1167,14 @@ checkSigB b (Forall as asmps0 t0, validSchema) =
               -- necessarily hold
               recordWarning (NonExhaustivePropGuards name)
 
+          let schema = Forall as asmps1 t1
+
           return Decl
             { dName       = name
-            , dSignature  = Forall as asmps1 t1
+            , dSignature  = schema
             , dDefinition = DExpr
                               (foldr ETAbs
-                              (foldr EProofAbs (EPropGuards cases1) asmps1) as)
+                              (foldr EProofAbs (EPropGuards cases1 schema) asmps1) as)
             , dPragmas    = P.bPragmas b
             , dInfix      = P.bInfix b
             , dFixity     = P.bFixity b
diff --git a/src/Cryptol/TypeCheck/Parseable.hs b/src/Cryptol/TypeCheck/Parseable.hs
index 35580584a..3cf244784 100644
--- a/src/Cryptol/TypeCheck/Parseable.hs
+++ b/src/Cryptol/TypeCheck/Parseable.hs
@@ -64,7 +64,7 @@ instance ShowParseable Expr where
   showParseable (EProofAbs {-p-}_ e) = showParseable e --"(EProofAbs " ++ show p ++ showParseable e ++ ")"
   showParseable (EProofApp e) = showParseable e --"(EProofApp " ++ showParseable e ++ ")"
   
-  showParseable (EPropGuards guards) = parens (text "EPropGuards" $$ showParseable guards)
+  showParseable (EPropGuards guards _) = parens (text "EPropGuards" $$ showParseable guards)
 
 instance (ShowParseable a, ShowParseable b) => ShowParseable (a,b) where
   showParseable (x,y) = parens (showParseable x <> comma <> showParseable y)
diff --git a/src/Cryptol/TypeCheck/Sanity.hs b/src/Cryptol/TypeCheck/Sanity.hs
index a4c56e4e6..839416e0d 100644
--- a/src/Cryptol/TypeCheck/Sanity.hs
+++ b/src/Cryptol/TypeCheck/Sanity.hs
@@ -271,9 +271,11 @@ exprSchema expr =
       in go dgs
 
 
-    EPropGuards _guards -> panic "exprSchema" 
-      [ "Since `EPropGuards` should (currently) only appear at the top level, " ++
-        "it should never be the argument to `exprSchema`." ]
+    EPropGuards _guards schema -> pure schema
+      -- TODO: remove 
+      -- panic "exprSchema" 
+      -- [ "Since `EPropGuards` should (currently) only appear at the top level, " ++
+      --   "it should never be the argument to `exprSchema`." ]
 
 
 checkHas :: Type -> Selector -> TcM Type
diff --git a/src/Cryptol/TypeCheck/Subst.hs b/src/Cryptol/TypeCheck/Subst.hs
index d2f5df13b..8cefc57c1 100644
--- a/src/Cryptol/TypeCheck/Subst.hs
+++ b/src/Cryptol/TypeCheck/Subst.hs
@@ -391,7 +391,7 @@ instance TVars Expr where
 
         EWhere e ds   -> EWhere !$ (go e) !$ (apSubst su ds)
 
-        EPropGuards guards -> EPropGuards !$ (\(props, e) -> (apSubst su `fmap'` props, apSubst su e)) `fmap'` guards
+        EPropGuards guards schema -> EPropGuards !$ (\(props, e) -> (apSubst su `fmap'` props, apSubst su e)) `fmap'` guards .$ schema
 
 instance TVars Match where
   apSubst su (From x len t e) = From x !$ (apSubst su len) !$ (apSubst su t) !$ (apSubst su e)
diff --git a/src/Cryptol/TypeCheck/TypeOf.hs b/src/Cryptol/TypeCheck/TypeOf.hs
index 75ae3354b..54de3ab98 100644
--- a/src/Cryptol/TypeCheck/TypeOf.hs
+++ b/src/Cryptol/TypeCheck/TypeOf.hs
@@ -43,7 +43,7 @@ fastTypeOf tyenv expr =
                         Just (_, t) -> t
                         Nothing     -> panic "Cryptol.TypeCheck.TypeOf.fastTypeOf"
                                          [ "EApp with non-function operator" ]
-    EPropGuards guards -> case guards of 
+    EPropGuards guards _ -> case guards of 
       ((_props, e):_) -> fastTypeOf tyenv e
       [] -> error "fastTypOf empty EPropGuards"
     -- Polymorphic fragment
@@ -116,9 +116,12 @@ fastSchemaOf tyenv expr =
     EAbs   {}      -> monomorphic
     
     -- PropGuards
-    EPropGuards [] -> panic "Cryptol.TypeCheck.TypeOf.fastSchemaOf"
-                        [ "EPropGuards with no guards" ]
-    EPropGuards ((_, e):_) -> fastSchemaOf tyenv e
+    EPropGuards [] schema -> schema
+      -- TODO: remove
+      -- panic "Cryptol.TypeCheck.TypeOf.fastSchemaOf"
+      --                   [ "EPropGuards with no guards" ]
+    EPropGuards ((_, e):_) schema -> schema 
+    -- TODO: remove -- fastSchemaOf tyenv e
   where
     monomorphic = Forall [] [] (fastTypeOf tyenv expr)
 

From fd0df8bbf63fb2638d5f30c2969c358be2a310d5 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Wed, 17 Aug 2022 10:51:41 -0700
Subject: [PATCH 066/125] making use of EPropGuards' schema

---
 src/Cryptol/TypeCheck/TypeOf.hs | 13 ++++---------
 1 file changed, 4 insertions(+), 9 deletions(-)

diff --git a/src/Cryptol/TypeCheck/TypeOf.hs b/src/Cryptol/TypeCheck/TypeOf.hs
index 54de3ab98..e33e67f94 100644
--- a/src/Cryptol/TypeCheck/TypeOf.hs
+++ b/src/Cryptol/TypeCheck/TypeOf.hs
@@ -9,6 +9,7 @@
 {-# LANGUAGE Safe                                #-}
 {-# LANGUAGE ViewPatterns                        #-}
 {-# LANGUAGE PatternGuards                       #-}
+{-# LANGUAGE NamedFieldPuns                      #-}
 module Cryptol.TypeCheck.TypeOf
   ( fastTypeOf
   , fastSchemaOf
@@ -43,9 +44,7 @@ fastTypeOf tyenv expr =
                         Just (_, t) -> t
                         Nothing     -> panic "Cryptol.TypeCheck.TypeOf.fastTypeOf"
                                          [ "EApp with non-function operator" ]
-    EPropGuards guards _ -> case guards of 
-      ((_props, e):_) -> fastTypeOf tyenv e
-      [] -> error "fastTypOf empty EPropGuards"
+    EPropGuards _guards Forall {sType} -> sType
     -- Polymorphic fragment
     EVar      {}  -> polymorphic
     ETAbs     {}  -> polymorphic
@@ -114,14 +113,10 @@ fastSchemaOf tyenv expr =
     EComp  {}      -> monomorphic
     EApp   {}      -> monomorphic
     EAbs   {}      -> monomorphic
-    
+
     -- PropGuards
     EPropGuards [] schema -> schema
-      -- TODO: remove
-      -- panic "Cryptol.TypeCheck.TypeOf.fastSchemaOf"
-      --                   [ "EPropGuards with no guards" ]
-    EPropGuards ((_, e):_) schema -> schema 
-    -- TODO: remove -- fastSchemaOf tyenv e
+    EPropGuards _ schema -> schema
   where
     monomorphic = Forall [] [] (fastTypeOf tyenv expr)
 

From e4e242be1601ef2a7f98d9c08911e7161cd9a138 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Wed, 17 Aug 2022 10:52:03 -0700
Subject: [PATCH 067/125] dont need LambdaCase

---
 src/Cryptol/TypeCheck/TCon.hs | 1 -
 1 file changed, 1 deletion(-)

diff --git a/src/Cryptol/TypeCheck/TCon.hs b/src/Cryptol/TypeCheck/TCon.hs
index ab3b5ee91..f4a8df4e9 100644
--- a/src/Cryptol/TypeCheck/TCon.hs
+++ b/src/Cryptol/TypeCheck/TCon.hs
@@ -1,5 +1,4 @@
 {-# Language OverloadedStrings, DeriveGeneric, DeriveAnyClass, Safe #-}
-{-# LANGUAGE LambdaCase #-}
 module Cryptol.TypeCheck.TCon where
 
 import qualified Data.Map as Map

From 03f6b4c16fe04c531d747a778cc3a2c70a6fcc0d Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Wed, 17 Aug 2022 10:52:31 -0700
Subject: [PATCH 068/125] no need to panic

---
 src/Cryptol/TypeCheck/Sanity.hs | 5 -----
 1 file changed, 5 deletions(-)

diff --git a/src/Cryptol/TypeCheck/Sanity.hs b/src/Cryptol/TypeCheck/Sanity.hs
index 839416e0d..f8dec80a4 100644
--- a/src/Cryptol/TypeCheck/Sanity.hs
+++ b/src/Cryptol/TypeCheck/Sanity.hs
@@ -272,11 +272,6 @@ exprSchema expr =
 
 
     EPropGuards _guards schema -> pure schema
-      -- TODO: remove 
-      -- panic "exprSchema" 
-      -- [ "Since `EPropGuards` should (currently) only appear at the top level, " ++
-      --   "it should never be the argument to `exprSchema`." ]
-
 
 checkHas :: Type -> Selector -> TcM Type
 checkHas t sel =

From 11e943db4ec31099ed1d2cc8d37f41e8630d8559 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Wed, 17 Aug 2022 10:55:11 -0700
Subject: [PATCH 069/125] remove old comments

---
 src/Cryptol/Eval.hs | 10 ----------
 1 file changed, 10 deletions(-)

diff --git a/src/Cryptol/Eval.hs b/src/Cryptol/Eval.hs
index edcb627a2..d4ea296c7 100644
--- a/src/Cryptol/Eval.hs
+++ b/src/Cryptol/Eval.hs
@@ -219,22 +219,12 @@ evalExpr sym env expr = case expr of
      evalExpr sym env' e
 
   EPropGuards guards _ -> {-# SCC "evalExpr->EPropGuards" #-} do
-    -- let
-    --   evalPropGuard (props, e) = do
-    --     if and $ checkProp . evalProp env <$> props
-    --       then Just <$> evalExpr sym env e
-    --       else pure Nothing
     let checkedGuards =
           first (and . (checkProp . evalProp env <$>))
           <$> guards
     case find fst checkedGuards of 
       Nothing -> raiseError sym (NoMatchingPropGuardCase $ "Available prop guards: `" ++ show (fmap pp . fst <$> guards) ++ "`")
       Just (_, e) -> eval e
-      
-      -- (\case
-      -- Just val -> pure val
-      -- Nothing -> evalPanic "evalExpr" ["no guard case was satisfied"]) . 
-      -- -- raiseError
 
   where
 

From 311527059968ac073f4aecf8e1560ec63413aa0e Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Wed, 17 Aug 2022 10:56:17 -0700
Subject: [PATCH 070/125] redundant import

---
 src/Cryptol/TypeCheck/Sanity.hs | 1 -
 1 file changed, 1 deletion(-)

diff --git a/src/Cryptol/TypeCheck/Sanity.hs b/src/Cryptol/TypeCheck/Sanity.hs
index f8dec80a4..3e4c11a12 100644
--- a/src/Cryptol/TypeCheck/Sanity.hs
+++ b/src/Cryptol/TypeCheck/Sanity.hs
@@ -29,7 +29,6 @@ import qualified Control.Applicative as A
 
 import           Data.Map ( Map )
 import qualified Data.Map as Map
-import Cryptol.Utils.Panic (panic)
 
 
 tcExpr :: InferInput -> Expr -> Either (Range, Error) (Schema, [ ProofObligation ])

From 70ca677079e30a17e9309635c8f0ffed933a17a6 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Wed, 17 Aug 2022 11:05:46 -0700
Subject: [PATCH 071/125] specializeExpr EPropGuards

---
 src/Cryptol/Eval.hs                 |  3 ++-
 src/Cryptol/Transform/Specialize.hs | 10 +++++++++-
 2 files changed, 11 insertions(+), 2 deletions(-)

diff --git a/src/Cryptol/Eval.hs b/src/Cryptol/Eval.hs
index d4ea296c7..05b977bbd 100644
--- a/src/Cryptol/Eval.hs
+++ b/src/Cryptol/Eval.hs
@@ -36,6 +36,7 @@ module Cryptol.Eval (
   , Unsupported(..)
   , WordTooWide(..)
   , forceValue
+  , checkProp
   ) where
 
 import Cryptol.Backend
@@ -245,7 +246,7 @@ checkProp = \case
       -- TODO: instantiate UniqueFactorization for Nat'?
       -- PC PPrime | [n] <- ns -> isJust (isPrime n) 
       PC PTrue -> True
-      pc -> evalPanic "evalProp" ["cannot use this as a guarding constraint: ", show . pp $ TCon tcon ts ]
+      _ -> evalPanic "evalProp" ["cannot use this as a guarding constraint: ", show . pp $ TCon tcon ts ]
   prop -> evalPanic "evalProp" ["cannot use this as a guarding constraint: ", show . pp $ prop ]
   where
     toNat' :: Prop -> Nat'
diff --git a/src/Cryptol/Transform/Specialize.hs b/src/Cryptol/Transform/Specialize.hs
index 4af0d71c9..7e0b6b4b7 100644
--- a/src/Cryptol/Transform/Specialize.hs
+++ b/src/Cryptol/Transform/Specialize.hs
@@ -19,10 +19,12 @@ import qualified Cryptol.ModuleSystem as M
 import qualified Cryptol.ModuleSystem.Env as M
 import qualified Cryptol.ModuleSystem.Monad as M
 import Cryptol.ModuleSystem.Name
+import Cryptol.Eval (checkProp)
 
 import           Data.Map (Map)
 import qualified Data.Map as Map
 import Data.Maybe (catMaybes)
+import qualified Data.List as List
 
 import MonadLib hiding (mapM)
 
@@ -102,7 +104,13 @@ specializeExpr expr =
     EProofAbs p e -> EProofAbs p <$> specializeExpr e
     EProofApp {}  -> specializeConst expr
     EWhere e dgs  -> specializeEWhere e dgs
-    EPropGuards guards schema -> EPropGuards <$> (\(props, e) -> (,) <$> pure props <*> specializeExpr e) `traverse` guards <*> pure schema
+    -- The type should be monomorphic, and the guarded expressions should
+    -- already be normalized, so we just need to choose the first expression
+    -- that's true.
+    EPropGuards guards _schema -> 
+      case List.find (all checkProp . fst) guards of
+        Just (_, e) -> specializeExpr e
+        Nothing -> fail "no guard constraint was satisfied"
 
 specializeMatch :: Match -> SpecM Match
 specializeMatch (From qn l t e) = From qn l t <$> specializeExpr e

From 929cf7f19cf946dc6813c2b24881fdb84f5d0e70 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Wed, 17 Aug 2022 11:09:01 -0700
Subject: [PATCH 072/125] added range

---
 src/Cryptol/Parser/ParserUtils.hs | 8 +++-----
 1 file changed, 3 insertions(+), 5 deletions(-)

diff --git a/src/Cryptol/Parser/ParserUtils.hs b/src/Cryptol/Parser/ParserUtils.hs
index 9f6ad507e..062dc64cd 100644
--- a/src/Cryptol/Parser/ParserUtils.hs
+++ b/src/Cryptol/Parser/ParserUtils.hs
@@ -27,6 +27,7 @@ import           Data.Text(Text)
 import qualified Data.Text as T
 import qualified Data.Map as Map
 import Text.Read(readMaybe)
+import Data.Bifunctor(second)
 
 import GHC.Generics (Generic)
 import Control.DeepSeq
@@ -615,8 +616,7 @@ mkIndexedPropGuardsDecl ::
 mkIndexedPropGuardsDecl f (ps, ixs) guards =
   DBind Bind { bName       = f
              , bParams     = reverse ps
-               -- TODO: add range properly
-             , bDef        = Located emptyRange (DPropGuards guards')
+             , bDef        = at f $ Located emptyRange (DPropGuards guards')
              , bSignature  = Nothing
              , bPragmas    = []
              , bMono       = False
@@ -626,9 +626,7 @@ mkIndexedPropGuardsDecl f (ps, ixs) guards =
              , bExport     = Public
              }
   where
-    -- TODO: need to do anything to `props`?
-    -- guards' :: [([Prop name], Expr name)]
-    guards' = (\(props, e) -> (props, mkGenerate (reverse ixs) e)) <$> guards
+    guards' = second (mkGenerate (reverse ixs)) <$> guards
 
 -- NOTE: The lists of patterns are reversed!
 mkIndexedExpr :: ([Pattern PName], [Pattern PName]) -> Expr PName -> Expr PName

From 8a1af2b1570ae1577d85800f9b05c819eaa3702c Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Wed, 17 Aug 2022 11:11:18 -0700
Subject: [PATCH 073/125] cleaned up syntax

---
 src/Cryptol/Parser/Names.hs    | 2 +-
 src/Cryptol/TypeCheck/Infer.hs | 4 ++--
 2 files changed, 3 insertions(+), 3 deletions(-)

diff --git a/src/Cryptol/Parser/Names.hs b/src/Cryptol/Parser/Names.hs
index 72b35805d..886e88521 100644
--- a/src/Cryptol/Parser/Names.hs
+++ b/src/Cryptol/Parser/Names.hs
@@ -67,7 +67,7 @@ namesDef :: Ord name => BindDef name -> Set name
 namesDef DPrim     = Set.empty
 namesDef DForeign  = Set.empty
 namesDef (DExpr e) = namesE e
-namesDef (DPropGuards guards) = mconcat . fmap (\(_props, e) -> namesE e) $ guards
+namesDef (DPropGuards guards) = Set.unions [ namesE e | (_, e) <- guards ]
 
 
 -- | The names used by an expression.
diff --git a/src/Cryptol/TypeCheck/Infer.hs b/src/Cryptol/TypeCheck/Infer.hs
index 73dd7f169..b1b3d9c77 100644
--- a/src/Cryptol/TypeCheck/Infer.hs
+++ b/src/Cryptol/TypeCheck/Infer.hs
@@ -993,7 +993,7 @@ checkSigB b (Forall as asmps0 t0, validSchema) =
   case thing (P.bDef b) of
 
     -- XXX what should we do with validSchema in this case?
-    P.DPrim -> do
+    P.DPrim ->
       return Decl
         { dName       = name
         , dSignature  = Forall as asmps0 t0
@@ -1050,7 +1050,7 @@ checkSigB b (Forall as asmps0 t0, validSchema) =
           , dDoc        = P.bDoc b
           }
 
-    P.DPropGuards cases0 -> do
+    P.DPropGuards cases0 ->
       inRangeMb (getLoc b) $
         withTParams as $ do
           asmps1 <- applySubstPreds asmps0

From 26e54a9e9cab3c7bfd0a32655d5f41efab50ac34 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Wed, 17 Aug 2022 11:17:55 -0700
Subject: [PATCH 074/125] better parsing propguards

---
 src/Cryptol/Parser.y | 13 ++++---------
 1 file changed, 4 insertions(+), 9 deletions(-)

diff --git a/src/Cryptol/Parser.y b/src/Cryptol/Parser.y
index 375fcc97d..b632edf48 100644
--- a/src/Cryptol/Parser.y
+++ b/src/Cryptol/Parser.y
@@ -302,18 +302,13 @@ mbDoc                   :: { Maybe (Located Text) }
   : doc                    { Just $1 }
   | {- empty -}            { Nothing }
 
--- propguards :: { [([Prop PName], Expr PName)] }
---   : 'propguards' '|' propguards_cases { $3 }
-
 propguards_cases :: { [([Prop PName], Expr PName)] }
-  : propguards_case '|' propguards_cases { $1 ++ $3 }
+  : propguards_case propguards_cases { $1 ++ $2 }
   | propguards_case { $1 }
 
 propguards_case :: { [([Prop PName], Expr PName)] }
-  : propguards_quals '=>' expr { [($1, $3)] }
+  : '|' propguards_quals '=>' expr { [($2, $4)] }
 
--- TODO: support multiple, or is that handles just as pairs or something?
--- I think that mkProp handles parsing pairs
 propguards_quals :: { [Prop PName] }
   : type {% fmap thing (mkProp $1) }
 
@@ -321,8 +316,8 @@ decl                    :: { Decl PName }
   : vars_comma ':' schema  { at (head $1,$3) $ DSignature (reverse $1) $3   }
   | ipat '=' expr          { at ($1,$3) $ DPatBind $1 $3                    }
   | '(' op ')' '=' expr    { at ($1,$5) $ DPatBind (PVar $2) $5             }
-  | var apats_indices '|' propguards_cases
-                           { mkIndexedPropGuardsDecl $1 $2 $4 }
+  | var apats_indices propguards_cases
+                           { mkIndexedPropGuardsDecl $1 $2 $3 }
   | var apats_indices '=' expr
                            { at ($1,$4) $ mkIndexedDecl $1 $2 $4 }
 

From cb9ce9c1ac5f51e5b37393a7030127176ed79014 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Wed, 17 Aug 2022 11:18:38 -0700
Subject: [PATCH 075/125] comment

---
 src/Cryptol/ModuleSystem/InstantiateModule.hs | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/src/Cryptol/ModuleSystem/InstantiateModule.hs b/src/Cryptol/ModuleSystem/InstantiateModule.hs
index 3c6bb49fb..c6e5e3f99 100644
--- a/src/Cryptol/ModuleSystem/InstantiateModule.hs
+++ b/src/Cryptol/ModuleSystem/InstantiateModule.hs
@@ -217,8 +217,8 @@ instance Inst Expr where
         EProofApp e               -> EProofApp (go e)
         EWhere e ds               -> EWhere (go e) (inst env ds)
 
-        -- this doesn't exist in the new module system, so it will have to be
-        -- implemented differently there anyway
+        -- TODO: this doesn't exist in the new module system, so it will have to
+        -- be implemented differently there anyway
         EPropGuards _guards _schema -> panic "inst" ["This is not implemented for EPropGuards yet."]
 
 

From fb161526e0c35e7f296c07dc95084c75d990a276 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Wed, 17 Aug 2022 11:19:20 -0700
Subject: [PATCH 076/125] clean up syntax

---
 src/Cryptol/IR/FreeVars.hs | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/src/Cryptol/IR/FreeVars.hs b/src/Cryptol/IR/FreeVars.hs
index 1d44f2ff3..3082b167e 100644
--- a/src/Cryptol/IR/FreeVars.hs
+++ b/src/Cryptol/IR/FreeVars.hs
@@ -117,7 +117,7 @@ instance FreeVars Expr where
       EProofAbs p e     -> freeVars p <> freeVars e
       EProofApp e       -> freeVars e
       EWhere e ds       -> foldFree ds <> rmVals (defs ds) (freeVars e)
-      EPropGuards guards _ -> mconcat $ freeVars <$> (snd <$> guards)
+      EPropGuards guards _ -> mconcat [ freeVars e | (_, e) <- guards ]
     where
       foldFree :: (FreeVars a, Defs a) => [a] -> Deps
       foldFree = foldr updateFree mempty

From 0f3e8984c42e1c7164bf1dcff2102f6814118340 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Wed, 17 Aug 2022 11:37:18 -0700
Subject: [PATCH 077/125] evalExpr EPropGuards

---
 src/Cryptol/Eval/Reference.lhs      | 22 +++++++++++++++++++++-
 src/Cryptol/Transform/Specialize.hs |  2 +-
 2 files changed, 22 insertions(+), 2 deletions(-)

diff --git a/src/Cryptol/Eval/Reference.lhs b/src/Cryptol/Eval/Reference.lhs
index 39c6d24a3..b8183b5cc 100644
--- a/src/Cryptol/Eval/Reference.lhs
+++ b/src/Cryptol/Eval/Reference.lhs
@@ -10,6 +10,7 @@
 > {-# LANGUAGE BlockArguments #-}
 > {-# LANGUAGE PatternGuards #-}
 > {-# LANGUAGE LambdaCase #-}
+> {-# LANGUAGE NamedFieldPuns #-}
 >
 > module Cryptol.Eval.Reference
 >   ( Value(..)
@@ -32,6 +33,7 @@
 > import LibBF (BigFloat)
 > import qualified LibBF as FP
 > import qualified GHC.Num.Compat as Integer
+> import qualified Data.List as List
 >
 > import Cryptol.ModuleSystem.Name (asPrim)
 > import Cryptol.TypeCheck.Solver.InfNat (Nat'(..), nAdd, nMin, nMul)
@@ -46,6 +48,8 @@
 > import Cryptol.Utils.Panic (panic)
 > import Cryptol.Utils.PP
 > import Cryptol.Utils.RecordMap
+> import Cryptol.Eval (checkProp)
+> import Cryptol.Eval.Type (evalType, lookupTypeVar, tNumTy, tValTy)
 >
 > import qualified Cryptol.ModuleSystem as M
 > import qualified Cryptol.ModuleSystem.Env as M (loadedModules,loadedNewtypes)
@@ -333,11 +337,27 @@ assigns values to those variables.
 >     EProofApp e    -> evalExpr env e
 >     EWhere e dgs   -> evalExpr (foldl evalDeclGroup env dgs) e
 >
->     EPropGuards _guards _schema -> error "unimplemented: `evalExpr (EPropGuards _)`" -- TODO
+>     EPropGuards guards _schema -> 
+>       case List.find (all (checkProp . evalProp env) . fst) guards of
+>         Just (_, e) -> evalExpr env e
+>         Nothing -> evalPanic "fromVBit" ["No guard constraint was satisfied"]
 
 > appFun :: E Value -> E Value -> E Value
 > appFun f v = f >>= \f' -> fromVFun f' v
 
+> -- | Evaluates a `Prop` in an `EvalEnv` by substituting all variables 
+> -- according to `envTypes` and expanding all type synonyms via `tNoUser`.
+> evalProp :: Env -> Prop -> Prop
+> evalProp env@Env { envTypes } = \case
+>   TCon tc tys -> TCon tc (toType . evalType envTypes <$> tys)
+>   TVar tv -> case lookupTypeVar tv envTypes of
+>     Nothing -> panic "evalProp" ["Could not find type variable `" ++ pretty tv ++ "` in the type evaluation environment"]
+>     Just either_nat'_tval -> toType either_nat'_tval
+>   prop@TUser {} -> evalProp env (tNoUser prop)
+>   prop -> panic "evalProp" ["Cannot use the following as a type constraint: `" ++ pretty prop ++ "`"]
+>   where
+>     toType = either tNumTy tValTy
+
 
 Selectors
 ---------
diff --git a/src/Cryptol/Transform/Specialize.hs b/src/Cryptol/Transform/Specialize.hs
index 7e0b6b4b7..e64973d24 100644
--- a/src/Cryptol/Transform/Specialize.hs
+++ b/src/Cryptol/Transform/Specialize.hs
@@ -110,7 +110,7 @@ specializeExpr expr =
     EPropGuards guards _schema -> 
       case List.find (all checkProp . fst) guards of
         Just (_, e) -> specializeExpr e
-        Nothing -> fail "no guard constraint was satisfied"
+        Nothing -> fail "No guard constraint was satisfied"
 
 specializeMatch :: Match -> SpecM Match
 specializeMatch (From qn l t e) = From qn l t <$> specializeExpr e

From cb87c4fb82636740a5eeb0eef42c7a40edf7ef05 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Wed, 17 Aug 2022 11:44:10 -0700
Subject: [PATCH 078/125] Prop ~~> Type

---
 src/Cryptol/Eval.hs | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/src/Cryptol/Eval.hs b/src/Cryptol/Eval.hs
index 05b977bbd..4230597a3 100644
--- a/src/Cryptol/Eval.hs
+++ b/src/Cryptol/Eval.hs
@@ -249,7 +249,7 @@ checkProp = \case
       _ -> evalPanic "evalProp" ["cannot use this as a guarding constraint: ", show . pp $ TCon tcon ts ]
   prop -> evalPanic "evalProp" ["cannot use this as a guarding constraint: ", show . pp $ prop ]
   where
-    toNat' :: Prop -> Nat'
+    toNat' :: Type -> Nat'
     toNat' = \case
       TCon (TC (TCNum n)) [] -> Nat n
       TCon (TC TCInf) [] -> Inf

From 111684b6b2cff13973b632ddbdf9cfe965439d8a Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Wed, 17 Aug 2022 11:44:31 -0700
Subject: [PATCH 079/125] made evalProp more readable

---
 src/Cryptol/Eval.hs | 7 +++----
 1 file changed, 3 insertions(+), 4 deletions(-)

diff --git a/src/Cryptol/Eval.hs b/src/Cryptol/Eval.hs
index 4230597a3..c93eb717b 100644
--- a/src/Cryptol/Eval.hs
+++ b/src/Cryptol/Eval.hs
@@ -261,12 +261,11 @@ checkProp = \case
 evalProp :: GenEvalEnv sym -> Prop -> Prop
 evalProp env@EvalEnv { envTypes } = \case
   TCon tc tys -> TCon tc (toType . evalType envTypes <$> tys)
-  TVar tv -> case lookupTypeVar tv envTypes of
-    Nothing -> panic "evalProp" ["Could not find type variable `" ++ pretty tv ++ "` in the type evaluation environment"]
-    Just either_nat'_tval -> toType either_nat'_tval
+  TVar tv | Just (toType -> ty) <- lookupTypeVar tv envTypes -> ty
   prop@TUser {} -> evalProp env (tNoUser prop)
+  TVar tv | Nothing <- lookupTypeVar tv envTypes -> panic "evalProp" ["Could not find type variable `" ++ pretty tv ++ "` in the type evaluation environment"]
   prop -> panic "evalProp" ["Cannot use the following as a type constraint: `" ++ pretty prop ++ "`"]
-  where
+  where 
     toType = either tNumTy tValTy
 
 -- | Capure the current call stack from the evaluation monad and

From f54225e1cfc0c6e9de6b7c64be6cf043ad206c63 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Wed, 17 Aug 2022 11:46:16 -0700
Subject: [PATCH 080/125] applied same simplification to Reference's evalProp

---
 src/Cryptol/Eval/Reference.lhs | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/src/Cryptol/Eval/Reference.lhs b/src/Cryptol/Eval/Reference.lhs
index b8183b5cc..9657753f4 100644
--- a/src/Cryptol/Eval/Reference.lhs
+++ b/src/Cryptol/Eval/Reference.lhs
@@ -11,6 +11,7 @@
 > {-# LANGUAGE PatternGuards #-}
 > {-# LANGUAGE LambdaCase #-}
 > {-# LANGUAGE NamedFieldPuns #-}
+> {-# LANGUAGE ViewPatterns #-}
 >
 > module Cryptol.Eval.Reference
 >   ( Value(..)
@@ -350,12 +351,11 @@ assigns values to those variables.
 > evalProp :: Env -> Prop -> Prop
 > evalProp env@Env { envTypes } = \case
 >   TCon tc tys -> TCon tc (toType . evalType envTypes <$> tys)
->   TVar tv -> case lookupTypeVar tv envTypes of
->     Nothing -> panic "evalProp" ["Could not find type variable `" ++ pretty tv ++ "` in the type evaluation environment"]
->     Just either_nat'_tval -> toType either_nat'_tval
+>   TVar tv | Just (toType -> ty) <- lookupTypeVar tv envTypes -> ty
 >   prop@TUser {} -> evalProp env (tNoUser prop)
+>   TVar tv | Nothing <- lookupTypeVar tv envTypes -> panic "evalProp" ["Could not find type variable `" ++ pretty tv ++ "` in the type evaluation environment"]
 >   prop -> panic "evalProp" ["Cannot use the following as a type constraint: `" ++ pretty prop ++ "`"]
->   where
+>   where 
 >     toType = either tNumTy tValTy
 
 

From 17a29682e8b5c7fd4e58879b63d2e4c1aefed017 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Wed, 17 Aug 2022 11:48:34 -0700
Subject: [PATCH 081/125] cleaned up syntax

---
 src/Cryptol/Eval.hs | 13 +++++--------
 1 file changed, 5 insertions(+), 8 deletions(-)

diff --git a/src/Cryptol/Eval.hs b/src/Cryptol/Eval.hs
index c93eb717b..11e160812 100644
--- a/src/Cryptol/Eval.hs
+++ b/src/Cryptol/Eval.hs
@@ -69,7 +69,6 @@ import           Control.Applicative
 
 import Prelude ()
 import Prelude.Compat
-import Data.Bifunctor (Bifunctor(first))
 
 type EvalEnv = GenEvalEnv Concrete
 
@@ -220,12 +219,10 @@ evalExpr sym env expr = case expr of
      evalExpr sym env' e
 
   EPropGuards guards _ -> {-# SCC "evalExpr->EPropGuards" #-} do
-    let checkedGuards =
-          first (and . (checkProp . evalProp env <$>))
-          <$> guards
-    case find fst checkedGuards of 
-      Nothing -> raiseError sym (NoMatchingPropGuardCase $ "Available prop guards: `" ++ show (fmap pp . fst <$> guards) ++ "`")
-      Just (_, e) -> eval e
+    let checkedGuards = [ e | (ps,e) <- guards, all (checkProp . evalProp env) ps ]
+    case checkedGuards of
+      (e:_) -> eval e
+      [] -> raiseError sym (NoMatchingPropGuardCase $ "Available prop guards: `" ++ show (fmap pp . fst <$> guards) ++ "`")
 
   where
 
@@ -265,7 +262,7 @@ evalProp env@EvalEnv { envTypes } = \case
   prop@TUser {} -> evalProp env (tNoUser prop)
   TVar tv | Nothing <- lookupTypeVar tv envTypes -> panic "evalProp" ["Could not find type variable `" ++ pretty tv ++ "` in the type evaluation environment"]
   prop -> panic "evalProp" ["Cannot use the following as a type constraint: `" ++ pretty prop ++ "`"]
-  where 
+  where
     toType = either tNumTy tValTy
 
 -- | Capure the current call stack from the evaluation monad and

From d2d92eae7348597b34e49fae5c54f74305861b8a Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Fri, 19 Aug 2022 13:43:41 -0700
Subject: [PATCH 082/125] Uncons

---
 tests/constraint-guards/Uncons.cry | 3 +++
 1 file changed, 3 insertions(+)
 create mode 100644 tests/constraint-guards/Uncons.cry

diff --git a/tests/constraint-guards/Uncons.cry b/tests/constraint-guards/Uncons.cry
new file mode 100644
index 000000000..d0e87e164
--- /dev/null
+++ b/tests/constraint-guards/Uncons.cry
@@ -0,0 +1,3 @@
+tail : {n, a} (fin n) => [n]a -> [(max n 1) - 1]a
+tail xs | n == 0 => xs
+        | n >= 1 => drop `{1} xs
\ No newline at end of file

From 908ceac2ca4874ef36f455850c021cb49a697e41 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Fri, 19 Aug 2022 13:45:22 -0700
Subject: [PATCH 083/125] delete debug comments

---
 src/Cryptol/TypeCheck/Infer.hs | 8 --------
 1 file changed, 8 deletions(-)

diff --git a/src/Cryptol/TypeCheck/Infer.hs b/src/Cryptol/TypeCheck/Infer.hs
index b1b3d9c77..e6c30a895 100644
--- a/src/Cryptol/TypeCheck/Infer.hs
+++ b/src/Cryptol/TypeCheck/Infer.hs
@@ -1194,15 +1194,9 @@ checkSigB b (Forall as asmps0 t0, validSchema) =
         addGoals validSchema
         () <- simplifyAllConstraints  -- XXX: using `asmps` also?
         return e1
-
-      -- pure $! unsafePerformIO $ putStrLn $ "[*] asmpsSign = " ++ show (pp <$> asmpsSign) -- DEBUG
-      -- pure $! unsafePerformIO $ putStrLn $ "[*] asmps1    = " ++ show (pp <$> asmps1) -- DEBUG
-
       asmps2 <- applySubstPreds asmps1
       cs     <- applySubstGoals cs0
 
-      -- pure $! unsafePerformIO $ putStrLn $ "[*] asmps2    = " ++ show (pp <$> asmps2) -- DEBUG
-
       let findKeep vs keep todo =
             let stays (_,cvs)    = not $ Set.null $ Set.intersection vs cvs
                 (yes,perhaps)    = partition stays todo
@@ -1228,8 +1222,6 @@ checkSigB b (Forall as asmps0 t0, validSchema) =
       t      <- applySubst t0
       e2     <- applySubst e1
 
-      -- pure $! unsafePerformIO $ putStrLn $ "[*] asmps     = " ++ show (pp <$> asmps) -- DEBUG
-
       pure (t, asmps, e2)
 
 --------------------------------------------------------------------------------

From f7dcfe7f579d5098d633a2e058c969d87fd3c1e6 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Fri, 19 Aug 2022 14:03:05 -0700
Subject: [PATCH 084/125] added proper Safe and Trustworthy pragmas

---
 src/Cryptol/Backend/FFI/Error.hs     | 1 +
 src/Cryptol/TypeCheck/FFI.hs         | 1 +
 src/Cryptol/TypeCheck/FFI/Error.hs   | 1 +
 src/Cryptol/TypeCheck/FFI/FFIType.hs | 1 +
 src/Cryptol/Version.hs               | 1 -
 5 files changed, 4 insertions(+), 1 deletion(-)

diff --git a/src/Cryptol/Backend/FFI/Error.hs b/src/Cryptol/Backend/FFI/Error.hs
index d04a72385..766a48d80 100644
--- a/src/Cryptol/Backend/FFI/Error.hs
+++ b/src/Cryptol/Backend/FFI/Error.hs
@@ -1,5 +1,6 @@
 {-# LANGUAGE DeriveAnyClass #-}
 {-# LANGUAGE DeriveGeneric  #-}
+{-# LANGUAGE Trustworthy  #-}
 
 -- | Errors from dynamic loading of shared libraries for FFI.
 module Cryptol.Backend.FFI.Error where
diff --git a/src/Cryptol/TypeCheck/FFI.hs b/src/Cryptol/TypeCheck/FFI.hs
index b4c97b198..0ed11046a 100644
--- a/src/Cryptol/TypeCheck/FFI.hs
+++ b/src/Cryptol/TypeCheck/FFI.hs
@@ -1,6 +1,7 @@
 {-# LANGUAGE BlockArguments  #-}
 {-# LANGUAGE RecordWildCards #-}
 {-# LANGUAGE ViewPatterns    #-}
+{-# LANGUAGE Safe    #-}
 
 -- | Checking and conversion of 'Type's to 'FFIType's.
 module Cryptol.TypeCheck.FFI
diff --git a/src/Cryptol/TypeCheck/FFI/Error.hs b/src/Cryptol/TypeCheck/FFI/Error.hs
index 23f942bb8..faa612339 100644
--- a/src/Cryptol/TypeCheck/FFI/Error.hs
+++ b/src/Cryptol/TypeCheck/FFI/Error.hs
@@ -2,6 +2,7 @@
 {-# LANGUAGE DeriveGeneric     #-}
 {-# LANGUAGE FlexibleInstances #-}
 {-# LANGUAGE OverloadedStrings #-}
+{-# LANGUAGE Safe #-}
 
 -- | Errors from typechecking foreign functions.
 module Cryptol.TypeCheck.FFI.Error where
diff --git a/src/Cryptol/TypeCheck/FFI/FFIType.hs b/src/Cryptol/TypeCheck/FFI/FFIType.hs
index dfd8ef502..c457ec21c 100644
--- a/src/Cryptol/TypeCheck/FFI/FFIType.hs
+++ b/src/Cryptol/TypeCheck/FFI/FFIType.hs
@@ -1,5 +1,6 @@
 {-# LANGUAGE DeriveAnyClass #-}
 {-# LANGUAGE DeriveGeneric  #-}
+{-# LANGUAGE Trustworthy #-}
 
 -- | This module defines a nicer intermediate representation of Cryptol types
 -- allowed for the FFI, which the typechecker generates then stores in the AST.
diff --git a/src/Cryptol/Version.hs b/src/Cryptol/Version.hs
index ad439e899..88c9da67e 100644
--- a/src/Cryptol/Version.hs
+++ b/src/Cryptol/Version.hs
@@ -7,7 +7,6 @@
 -- Portability :  portable
 
 {-# LANGUAGE CPP  #-}
-{-# LANGUAGE Safe #-}
 
 module Cryptol.Version (
     commitHash

From f08ddf786528f28d031535094fc1a67d16944c85 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Fri, 19 Aug 2022 14:56:39 -0700
Subject: [PATCH 085/125] refactored checkSigB case P.DPropGuards

---
 src/Cryptol/TypeCheck/Infer.hs | 166 +++++++++++++--------------------
 src/Cryptol/TypeCheck/Type.hs  |  53 +++++++++++
 2 files changed, 116 insertions(+), 103 deletions(-)

diff --git a/src/Cryptol/TypeCheck/Infer.hs b/src/Cryptol/TypeCheck/Infer.hs
index e6c30a895..748fb016c 100644
--- a/src/Cryptol/TypeCheck/Infer.hs
+++ b/src/Cryptol/TypeCheck/Infer.hs
@@ -1055,108 +1055,39 @@ checkSigB b (Forall as asmps0 t0, validSchema) =
         withTParams as $ do
           asmps1 <- applySubstPreds asmps0
           t1     <- applySubst t0
-          -- Checking each guarded case is the same as checking a DExpr, except
-          -- that the guarding assumptions are added first.
-          let checkPropGuardCase :: ([P.Prop Name], P.Expr Name) -> InferM ([Prop], Expr)
-              checkPropGuardCase (guards0, e0) = do
-                mb_rng <- case P.bSignature b of
-                  Just (P.Forall _ _ _ mb_rng) -> pure mb_rng
-                  _ -> panic "checkSigB"
-                    [ "Used constraint guards without a signature, dumbwit, at "
-                    , show . pp $ P.bName b ]
-                -- check guards
-                (guards1, goals) <-
-                  second concat . unzip <$>
-                  checkPropGuard mb_rng `traverse` guards0
-                -- try to prove all goals
-                su <- proveImplication True (Just name) as (asmps1 <> guards1) goals
-                extendSubst su
-                -- Preprends the goals to the constraints, because these must be
-                -- checked first before the rest of the constraints (during
-                -- evaluation) to ensure well-definedness, since some
-                -- constraints make use of partial functions e.g. `a - b`
-                -- requires `a >= b`.
-                let guards2 = (goal <$> goals) <> concatMap pSplitAnd (apSubst su guards1)
-                (_t, guards3, e1) <- checkBindDefExpr asmps1 guards2 e0
-                e2 <- applySubst e1
-                pure (guards3, e2)
-
-          cases1 <- mapM checkPropGuardCase cases0
-
-          -- Here, `props` is a conjunction of multiple constraints, and so the
-          -- negation is the disjunction of the negation of each conjunct i.e.
-          -- "not (A and B and C) <=> (not A) or (not B) or (not C)". This is
-          -- one of DeMorgan's laws of boolean logic. Since there are no
-          -- constraint disjunctions, we encode a disjunction of conjunctions as
-          -- `[[Prop]]`. For exhaustive checking, each disjunct will need to be
-          -- checked independently, and all must pass in order to be considered
-          -- exhaustive.
-
-          let negateSimpleNumProp :: Prop -> Maybe [Prop]
-              negateSimpleNumProp prop = case prop of
-                TCon tcon tys -> case tcon of
-                  PC pc -> case pc of
-                    -- not x == y  <=>  x /= y
-                    PEqual -> pure [TCon (PC PNeq) tys]
-                    -- not x /= y  <=>  x == y
-                    PNeq -> pure [TCon (PC PEqual) tys]
-                    -- not x >= y  <=>  x /= y and y >= x
-                    PGeq -> pure [TCon (PC PNeq) tys, TCon (PC PGeq) (reverse tys)]
-                    -- not fin x  <=>  x == Inf
-                    PFin | [ty] <- tys -> pure [TCon (PC PEqual) [ty, tInf]]
-                         | otherwise -> panicInvalid
-                    -- not True  <=>  0 == 1
-                    PTrue -> pure [TCon (PC PEqual) [tZero, tOne]]
-                    _ -> mempty
-                  TC _tc -> panicInvalid
-                  TF _tf -> panicInvalid
-                  TError _ki -> panicInvalid -- TODO: where does this come from?
-                TUser _na _tys ty -> negateSimpleNumProp ty
-                _ -> panicInvalid
-                where
-                  panicInvalid = tcPanic "checkSigB"
-                    [ "This type shouldn't be a valid type constraint: " ++
-                      "`" ++ pretty prop ++ "`"]
-
-              negateSimpleNumProps :: [Prop] -> [[Prop]]
-              negateSimpleNumProps props = do
-                prop <- props
-                maybe mempty pure (negateSimpleNumProp prop)
-
-              toGoal :: Prop -> Goal
-              toGoal prop =
-                Goal
-                  { goalSource = CtPropGuardsExhaustive name
-                  , goalRange = srcRange $ P.bName b
-                  , goal = prop }
-
-              canProve :: [Prop] -> [Goal] -> InferM Bool
-              canProve asmps goals = isRight <$>
-                tryProveImplication (Just name) as asmps goals
-
-              -- Try to prove that the first guard will be satisfied. If cannot,
-              -- then assume it is false (via `negateSimpleNumProps`) and try to
-              -- prove that the second guard will be satisfied. If cannot, then
-              -- assume it is false, and so on. If the last guard cannot be
-              -- proven in this way, then issue a `NonExhaustivePropGuards`
-              -- warning. Note that when assuming that a conjunction of multiple
-              -- constraints is false, this results in a disjunction, and so
-              -- must check exhaustive under assumption that each disjunct is
-              -- false independently. 
-              -- 
-              -- TODO: do I have to check all combinations of false/true
-              -- disjuncts? Or is it satisfactory to just check setting each one
-              -- to false seperately.
-              checkExhaustive :: [Prop] -> [[Prop]] -> InferM Bool
-              checkExhaustive _asmps [] = pure False -- empty GuardProps
-              checkExhaustive asmps [guard] = do
-                canProve asmps (toGoal <$> guard)
-              checkExhaustive asmps (guard : guards) =
-                canProve asmps (toGoal <$> guard) >>= \case
-                  True -> pure True
-                  False -> and <$> mapM
-                    (\asmps' -> checkExhaustive (asmps <> asmps') guards)
-                    (negateSimpleNumProps guard)
+          cases1 <- mapM (checkPropGuardCase name asmps1) cases0
+
+          let
+            toGoal :: Prop -> Goal
+            toGoal prop =
+              Goal
+                { goalSource = CtPropGuardsExhaustive name
+                , goalRange = srcRange $ P.bName b
+                , goal = prop }
+
+            canProve :: [Prop] -> [Goal] -> InferM Bool
+            canProve asmps goals = isRight <$>
+              tryProveImplication (Just name) as asmps goals
+
+            -- Try to prove that the first guard will be satisfied. If cannot,
+            -- then assume it is false (via `negateSimpleNumProps`) and try to
+            -- prove that the second guard will be satisfied. If cannot, then
+            -- assume it is false, and so on. If the last guard cannot be proven
+            -- in this way, then issue a `NonExhaustivePropGuards` warning. Note
+            -- that when assuming that a conjunction of constraints is false,
+            -- this results in a disjunction, and so must check exhaustive under
+            -- assumption that each disjunct is false independently i.e.
+            -- `checkExhaustive` branches on conjunctions.
+            checkExhaustive :: [Prop] -> [[Prop]] -> InferM Bool
+            checkExhaustive _asmps [] = pure False -- empty GuardProps
+            checkExhaustive asmps [guard] = do
+              canProve asmps (toGoal <$> guard)
+            checkExhaustive asmps (guard : guards) =
+              canProve asmps (toGoal <$> guard) >>= \case
+                True -> pure True
+                False -> and <$> mapM
+                  (\asmps' -> checkExhaustive (asmps <> asmps') guards)
+                  (negateSimpleNumProps guard)
 
           checkExhaustive asmps1 (fst <$> cases1) >>= \case
             True ->
@@ -1174,7 +1105,10 @@ checkSigB b (Forall as asmps0 t0, validSchema) =
             , dSignature  = schema
             , dDefinition = DExpr
                               (foldr ETAbs
-                              (foldr EProofAbs (EPropGuards cases1 schema) asmps1) as)
+                                (foldr EProofAbs
+                                  (EPropGuards cases1 schema)
+                                asmps1)
+                              as)
             , dPragmas    = P.bPragmas b
             , dInfix      = P.bInfix b
             , dFixity     = P.bFixity b
@@ -1224,6 +1158,32 @@ checkSigB b (Forall as asmps0 t0, validSchema) =
 
       pure (t, asmps, e2)
 
+    -- Checking each guarded case is the same as checking a DExpr, except
+    -- that the guarding assumptions are added first.
+    checkPropGuardCase :: Name -> [Prop] -> ([P.Prop Name], P.Expr Name) -> InferM ([Prop], Expr)
+    checkPropGuardCase name asmps1 (guards0, e0) = do
+      mb_rng <- case P.bSignature b of
+        Just (P.Forall _ _ _ mb_rng) -> pure mb_rng
+        _ -> panic "checkSigB"
+          [ "Used constraint guards without a signature, dumbwit, at "
+          , show . pp $ P.bName b ]
+      -- check guards
+      (guards1, goals) <-
+        second concat . unzip <$>
+        checkPropGuard mb_rng `traverse` guards0
+      -- try to prove all goals
+      su <- proveImplication True (Just name) as (asmps1 <> guards1) goals
+      extendSubst su
+      -- Preprends the goals to the constraints, because these must be
+      -- checked first before the rest of the constraints (during
+      -- evaluation) to ensure well-definedness, since some
+      -- constraints make use of partial functions e.g. `a - b`
+      -- requires `a >= b`.
+      let guards2 = (goal <$> goals) <> concatMap pSplitAnd (apSubst su guards1)
+      (_t, guards3, e1) <- checkBindDefExpr asmps1 guards2 e0
+      e2 <- applySubst e1
+      pure (guards3, e2)
+
 --------------------------------------------------------------------------------
 --------------------------------------------------------------------------------
 
diff --git a/src/Cryptol/TypeCheck/Type.hs b/src/Cryptol/TypeCheck/Type.hs
index a0a79bdb5..41fd726f2 100644
--- a/src/Cryptol/TypeCheck/Type.hs
+++ b/src/Cryptol/TypeCheck/Type.hs
@@ -888,9 +888,62 @@ instance FVS Schema where
       Set.difference (Set.union (fvs ps) (fvs t)) bound
     where bound = Set.fromList (map tpVar as)
 
+-- Negation --------------------------------------------------------------------
 
+{-|
+`negateSimpleNumProps` negates a simple prop over numeric type vars. Results in
+`Just _` if the input is simple and can be negated, otherwise `Nothing`.
 
+The only simple props are: @(x == y), (x /= y), (x >= y), (fin x), True@, and
+any type constraint synonym applications where the type constraint synonym is
+defined in terms of only simple props.
 
+The negation of a conjunction of props should result in a disjunction via
+DeMorgan's laws. e.g. `(x == y, x == z)  =>  (x /= y) or (x /= z)`. However,
+Cryptol currently doesn't support disjunctions in type constraints, so instead
+`negateSimpleNumProps` results in a list of lists of props that is understood to
+be a disjunction of conjunctions.
+-}
+{-|
+Examples:
+@
+  [(x == y)]          =>  Just [[(x /= y)]]
+  [(fin x)]           =>  Just [[(x == inf)]]
+  [(x <= y)]          =>  Just [[(x >= y), (x /= y)]]
+  [(x == y, x == z)]  =>  Just [[(x /= y)], [(x /= z)]]
+@
+-}
+negateSimpleNumProps :: [Prop] -> [[Prop]]
+negateSimpleNumProps props = do
+  prop <- props
+  maybe mempty pure (negateSimpleNumProp prop)
+
+negateSimpleNumProp :: Prop -> Maybe [Prop]
+negateSimpleNumProp prop = case prop of
+  TCon tcon tys -> case tcon of
+    PC pc -> case pc of
+      -- not x == y  <=>  x /= y
+      PEqual -> pure [TCon (PC PNeq) tys]
+      -- not x /= y  <=>  x == y
+      PNeq -> pure [TCon (PC PEqual) tys]
+      -- not x >= y  <=>  x /= y and y >= x
+      PGeq -> pure [TCon (PC PNeq) tys, TCon (PC PGeq) (reverse tys)]
+      -- not fin x  <=>  x == Inf
+      PFin | [ty] <- tys -> pure [TCon (PC PEqual) [ty, tInf]]
+           | otherwise -> panicInvalid
+      -- not True  <=>  0 == 1
+      PTrue -> pure [TCon (PC PEqual) [tZero, tOne]]
+      -- not simple enough
+      _ -> mempty
+    TC _tc -> panicInvalid
+    TF _tf -> panicInvalid
+    TError _ki -> Just [prop] -- propogates `TError`
+  TUser _na _tys ty -> negateSimpleNumProp ty
+  _ -> panicInvalid
+  where
+    panicInvalid = panic "negateSimpleNumProp"
+      [ "This type shouldn't be a valid type constraint: " ++
+        "`" ++ pretty prop ++ "`"]
 
 -- Pretty Printing -------------------------------------------------------------
 

From 5b6cd2a21868c90c2f8d83da3126a60fecb8f2b1 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Fri, 19 Aug 2022 15:01:04 -0700
Subject: [PATCH 086/125] refactor

---
 src/Cryptol/TypeCheck/Infer.hs |   4 +-
 src/Cryptol/TypeCheck/Type.hs  | 114 ++++++++++++++++-----------------
 2 files changed, 59 insertions(+), 59 deletions(-)

diff --git a/src/Cryptol/TypeCheck/Infer.hs b/src/Cryptol/TypeCheck/Infer.hs
index 748fb016c..dc24efd2e 100644
--- a/src/Cryptol/TypeCheck/Infer.hs
+++ b/src/Cryptol/TypeCheck/Infer.hs
@@ -1070,7 +1070,7 @@ checkSigB b (Forall as asmps0 t0, validSchema) =
               tryProveImplication (Just name) as asmps goals
 
             -- Try to prove that the first guard will be satisfied. If cannot,
-            -- then assume it is false (via `negateSimpleNumProps`) and try to
+            -- then assume it is false (via `pNegNumeric`) and try to
             -- prove that the second guard will be satisfied. If cannot, then
             -- assume it is false, and so on. If the last guard cannot be proven
             -- in this way, then issue a `NonExhaustivePropGuards` warning. Note
@@ -1087,7 +1087,7 @@ checkSigB b (Forall as asmps0 t0, validSchema) =
                 True -> pure True
                 False -> and <$> mapM
                   (\asmps' -> checkExhaustive (asmps <> asmps') guards)
-                  (negateSimpleNumProps guard)
+                  (pNegNumeric guard)
 
           checkExhaustive asmps1 (fst <$> cases1) >>= \case
             True ->
diff --git a/src/Cryptol/TypeCheck/Type.hs b/src/Cryptol/TypeCheck/Type.hs
index 41fd726f2..a0493c48b 100644
--- a/src/Cryptol/TypeCheck/Type.hs
+++ b/src/Cryptol/TypeCheck/Type.hs
@@ -847,6 +847,63 @@ pPrime ty =
   where
   prop = TCon (PC PPrime) [ty]
 
+-- Negation --------------------------------------------------------------------
+
+{-|
+`pNegNumeric` negates a simple prop over numeric type vars. Results in `Just _`
+if the input is simple and can be negated, otherwise `Nothing`. The input list
+is understood as a conjunction.
+
+The only simple props are: @(x == y), (x /= y), (x >= y), (fin x), True@, and
+any type constraint synonym applications where the type constraint synonym is
+defined in terms of only simple props.
+
+The negation of a conjunction of props should result in a disjunction via
+DeMorgan's laws. e.g. `(x == y, x == z)  =>  (x /= y) or (x /= z)`. However,
+Cryptol currently doesn't support disjunctions in type constraints, so instead
+`pNegNumeric` results in a list of lists of props that is understood to be a
+disjunction of conjunctions.
+-}
+{-|
+Examples:
+@
+  [(x == y)]          =>  Just [[(x /= y)]]
+  [(fin x)]           =>  Just [[(x == inf)]]
+  [(x <= y)]          =>  Just [[(x >= y), (x /= y)]]
+  [(x == y), (x == z)]  =>  Just [[(x /= y)], [(x /= z)]]
+@
+-}
+pNegNumeric :: [Prop] -> [[Prop]]
+pNegNumeric props = do
+  prop <- props
+  maybe mempty pure (pNegNumeric' prop)
+  where
+    pNegNumeric' :: Prop -> Maybe [Prop]
+    pNegNumeric' prop = case prop of
+      TCon tcon tys -> case tcon of
+        PC pc -> case pc of
+          -- not x == y  <=>  x /= y
+          PEqual -> pure [TCon (PC PNeq) tys]
+          -- not x /= y  <=>  x == y
+          PNeq -> pure [TCon (PC PEqual) tys]
+          -- not x >= y  <=>  x /= y and y >= x
+          PGeq -> pure [TCon (PC PNeq) tys, TCon (PC PGeq) (reverse tys)]
+          -- not fin x  <=>  x == Inf
+          PFin | [ty] <- tys -> pure [TCon (PC PEqual) [ty, tInf]]
+              | otherwise -> panicInvalid
+          -- not True  <=>  0 == 1
+          PTrue -> pure [TCon (PC PEqual) [tZero, tOne]]
+          -- not simple enough
+          _ -> mempty
+        TC _tc -> panicInvalid
+        TF _tf -> panicInvalid
+        TError _ki -> Just [prop] -- propogates `TError`
+      TUser _na _tys ty -> pNegNumeric' ty
+      _ -> panicInvalid
+      where
+        panicInvalid = panic "pNegNumeric'"
+          [ "This type shouldn't be a valid type constraint: " ++
+            "`" ++ pretty prop ++ "`"]
 
 --------------------------------------------------------------------------------
 
@@ -888,63 +945,6 @@ instance FVS Schema where
       Set.difference (Set.union (fvs ps) (fvs t)) bound
     where bound = Set.fromList (map tpVar as)
 
--- Negation --------------------------------------------------------------------
-
-{-|
-`negateSimpleNumProps` negates a simple prop over numeric type vars. Results in
-`Just _` if the input is simple and can be negated, otherwise `Nothing`.
-
-The only simple props are: @(x == y), (x /= y), (x >= y), (fin x), True@, and
-any type constraint synonym applications where the type constraint synonym is
-defined in terms of only simple props.
-
-The negation of a conjunction of props should result in a disjunction via
-DeMorgan's laws. e.g. `(x == y, x == z)  =>  (x /= y) or (x /= z)`. However,
-Cryptol currently doesn't support disjunctions in type constraints, so instead
-`negateSimpleNumProps` results in a list of lists of props that is understood to
-be a disjunction of conjunctions.
--}
-{-|
-Examples:
-@
-  [(x == y)]          =>  Just [[(x /= y)]]
-  [(fin x)]           =>  Just [[(x == inf)]]
-  [(x <= y)]          =>  Just [[(x >= y), (x /= y)]]
-  [(x == y, x == z)]  =>  Just [[(x /= y)], [(x /= z)]]
-@
--}
-negateSimpleNumProps :: [Prop] -> [[Prop]]
-negateSimpleNumProps props = do
-  prop <- props
-  maybe mempty pure (negateSimpleNumProp prop)
-
-negateSimpleNumProp :: Prop -> Maybe [Prop]
-negateSimpleNumProp prop = case prop of
-  TCon tcon tys -> case tcon of
-    PC pc -> case pc of
-      -- not x == y  <=>  x /= y
-      PEqual -> pure [TCon (PC PNeq) tys]
-      -- not x /= y  <=>  x == y
-      PNeq -> pure [TCon (PC PEqual) tys]
-      -- not x >= y  <=>  x /= y and y >= x
-      PGeq -> pure [TCon (PC PNeq) tys, TCon (PC PGeq) (reverse tys)]
-      -- not fin x  <=>  x == Inf
-      PFin | [ty] <- tys -> pure [TCon (PC PEqual) [ty, tInf]]
-           | otherwise -> panicInvalid
-      -- not True  <=>  0 == 1
-      PTrue -> pure [TCon (PC PEqual) [tZero, tOne]]
-      -- not simple enough
-      _ -> mempty
-    TC _tc -> panicInvalid
-    TF _tf -> panicInvalid
-    TError _ki -> Just [prop] -- propogates `TError`
-  TUser _na _tys ty -> negateSimpleNumProp ty
-  _ -> panicInvalid
-  where
-    panicInvalid = panic "negateSimpleNumProp"
-      [ "This type shouldn't be a valid type constraint: " ++
-        "`" ++ pretty prop ++ "`"]
-
 -- Pretty Printing -------------------------------------------------------------
 
 instance PP TParam where

From 537b3d91a28f6b06d468f82decbb6f34d5c3225e Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Fri, 19 Aug 2022 15:05:15 -0700
Subject: [PATCH 087/125] safe

---
 src/Cryptol/Backend/FFI/Error.hs     | 2 +-
 src/Cryptol/TypeCheck/FFI/FFIType.hs | 2 +-
 2 files changed, 2 insertions(+), 2 deletions(-)

diff --git a/src/Cryptol/Backend/FFI/Error.hs b/src/Cryptol/Backend/FFI/Error.hs
index 766a48d80..2e4adda41 100644
--- a/src/Cryptol/Backend/FFI/Error.hs
+++ b/src/Cryptol/Backend/FFI/Error.hs
@@ -1,6 +1,6 @@
 {-# LANGUAGE DeriveAnyClass #-}
 {-# LANGUAGE DeriveGeneric  #-}
-{-# LANGUAGE Trustworthy  #-}
+{-# LANGUAGE Safe  #-}
 
 -- | Errors from dynamic loading of shared libraries for FFI.
 module Cryptol.Backend.FFI.Error where
diff --git a/src/Cryptol/TypeCheck/FFI/FFIType.hs b/src/Cryptol/TypeCheck/FFI/FFIType.hs
index c457ec21c..4923f89c0 100644
--- a/src/Cryptol/TypeCheck/FFI/FFIType.hs
+++ b/src/Cryptol/TypeCheck/FFI/FFIType.hs
@@ -1,6 +1,6 @@
 {-# LANGUAGE DeriveAnyClass #-}
 {-# LANGUAGE DeriveGeneric  #-}
-{-# LANGUAGE Trustworthy #-}
+{-# LANGUAGE Safe #-}
 
 -- | This module defines a nicer intermediate representation of Cryptol types
 -- allowed for the FFI, which the typechecker generates then stores in the AST.

From d3b79ac80335c395cb797a73028b6affad560fb1 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Fri, 19 Aug 2022 15:17:38 -0700
Subject: [PATCH 088/125] EPropGuards has a Type instead of a Schema

---
 src/Cryptol/TypeCheck/AST.hs    | 2 +-
 src/Cryptol/TypeCheck/Infer.hs  | 4 ++--
 src/Cryptol/TypeCheck/Sanity.hs | 3 ++-
 src/Cryptol/TypeCheck/TypeOf.hs | 7 +++----
 4 files changed, 8 insertions(+), 8 deletions(-)

diff --git a/src/Cryptol/TypeCheck/AST.hs b/src/Cryptol/TypeCheck/AST.hs
index c58cf7683..4caf12ff8 100644
--- a/src/Cryptol/TypeCheck/AST.hs
+++ b/src/Cryptol/TypeCheck/AST.hs
@@ -150,7 +150,7 @@ data Expr   = EList [Expr] Type         -- ^ List value (with type of elements)
 
             | EWhere Expr [DeclGroup]
 
-            | EPropGuards [([Prop], Expr)] Schema
+            | EPropGuards [([Prop], Expr)] Type
 
               deriving (Show, Generic, NFData)
 
diff --git a/src/Cryptol/TypeCheck/Infer.hs b/src/Cryptol/TypeCheck/Infer.hs
index dc24efd2e..1519d36ab 100644
--- a/src/Cryptol/TypeCheck/Infer.hs
+++ b/src/Cryptol/TypeCheck/Infer.hs
@@ -57,7 +57,7 @@ import           Cryptol.TypeCheck.FFI.FFIType
 import           Cryptol.Utils.Ident
 import           Cryptol.Utils.Panic(panic)
 import           Cryptol.Utils.RecordMap
-import           Cryptol.Utils.PP (pp, pretty)
+import           Cryptol.Utils.PP (pp)
 
 import qualified Data.Map as Map
 import           Data.Map (Map)
@@ -1106,7 +1106,7 @@ checkSigB b (Forall as asmps0 t0, validSchema) =
             , dDefinition = DExpr
                               (foldr ETAbs
                                 (foldr EProofAbs
-                                  (EPropGuards cases1 schema)
+                                  (EPropGuards cases1 t1)
                                 asmps1)
                               as)
             , dPragmas    = P.bPragmas b
diff --git a/src/Cryptol/TypeCheck/Sanity.hs b/src/Cryptol/TypeCheck/Sanity.hs
index 3e4c11a12..8a89ce8c8 100644
--- a/src/Cryptol/TypeCheck/Sanity.hs
+++ b/src/Cryptol/TypeCheck/Sanity.hs
@@ -270,7 +270,8 @@ exprSchema expr =
       in go dgs
 
 
-    EPropGuards _guards schema -> pure schema
+    EPropGuards _guards typ -> 
+      pure Forall {sVars = [], sProps = [], sType = typ}
 
 checkHas :: Type -> Selector -> TcM Type
 checkHas t sel =
diff --git a/src/Cryptol/TypeCheck/TypeOf.hs b/src/Cryptol/TypeCheck/TypeOf.hs
index e33e67f94..e0d67c405 100644
--- a/src/Cryptol/TypeCheck/TypeOf.hs
+++ b/src/Cryptol/TypeCheck/TypeOf.hs
@@ -44,7 +44,7 @@ fastTypeOf tyenv expr =
                         Just (_, t) -> t
                         Nothing     -> panic "Cryptol.TypeCheck.TypeOf.fastTypeOf"
                                          [ "EApp with non-function operator" ]
-    EPropGuards _guards Forall {sType} -> sType
+    EPropGuards _guards sType -> sType
     -- Polymorphic fragment
     EVar      {}  -> polymorphic
     ETAbs     {}  -> polymorphic
@@ -115,10 +115,9 @@ fastSchemaOf tyenv expr =
     EAbs   {}      -> monomorphic
 
     -- PropGuards
-    EPropGuards [] schema -> schema
-    EPropGuards _ schema -> schema
+    EPropGuards _ t -> Forall {sVars = [], sProps = [], sType = t}
   where
-    monomorphic = Forall [] [] (fastTypeOf tyenv expr)
+    monomorphic = Forall {sVars = [], sProps = [], sType = fastTypeOf tyenv expr}
 
 -- | Apply a substitution to a type *without* simplifying
 -- constraints like @Arith [n]a@ to @Arith a@. (This is in contrast to

From 76ff13efad925eda80971cf89ac28db090aec33c Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Fri, 19 Aug 2022 15:38:34 -0700
Subject: [PATCH 089/125] refactored out checkExhaustive

---
 src/Cryptol/TypeCheck/Infer.hs | 68 +++++++++++++++++-----------------
 1 file changed, 35 insertions(+), 33 deletions(-)

diff --git a/src/Cryptol/TypeCheck/Infer.hs b/src/Cryptol/TypeCheck/Infer.hs
index 1519d36ab..0ca850cf6 100644
--- a/src/Cryptol/TypeCheck/Infer.hs
+++ b/src/Cryptol/TypeCheck/Infer.hs
@@ -1057,39 +1057,7 @@ checkSigB b (Forall as asmps0 t0, validSchema) =
           t1     <- applySubst t0
           cases1 <- mapM (checkPropGuardCase name asmps1) cases0
 
-          let
-            toGoal :: Prop -> Goal
-            toGoal prop =
-              Goal
-                { goalSource = CtPropGuardsExhaustive name
-                , goalRange = srcRange $ P.bName b
-                , goal = prop }
-
-            canProve :: [Prop] -> [Goal] -> InferM Bool
-            canProve asmps goals = isRight <$>
-              tryProveImplication (Just name) as asmps goals
-
-            -- Try to prove that the first guard will be satisfied. If cannot,
-            -- then assume it is false (via `pNegNumeric`) and try to
-            -- prove that the second guard will be satisfied. If cannot, then
-            -- assume it is false, and so on. If the last guard cannot be proven
-            -- in this way, then issue a `NonExhaustivePropGuards` warning. Note
-            -- that when assuming that a conjunction of constraints is false,
-            -- this results in a disjunction, and so must check exhaustive under
-            -- assumption that each disjunct is false independently i.e.
-            -- `checkExhaustive` branches on conjunctions.
-            checkExhaustive :: [Prop] -> [[Prop]] -> InferM Bool
-            checkExhaustive _asmps [] = pure False -- empty GuardProps
-            checkExhaustive asmps [guard] = do
-              canProve asmps (toGoal <$> guard)
-            checkExhaustive asmps (guard : guards) =
-              canProve asmps (toGoal <$> guard) >>= \case
-                True -> pure True
-                False -> and <$> mapM
-                  (\asmps' -> checkExhaustive (asmps <> asmps') guards)
-                  (pNegNumeric guard)
-
-          checkExhaustive asmps1 (fst <$> cases1) >>= \case
+          checkExhaustive name asmps1 (fst <$> cases1) >>= \case
             True ->
               -- proved exhaustive
               pure ()
@@ -1184,6 +1152,40 @@ checkSigB b (Forall as asmps0 t0, validSchema) =
       e2 <- applySubst e1
       pure (guards3, e2)
 
+    -- Try to prove that the first guard will be satisfied. If cannot,
+    -- then assume it is false (via `pNegNumeric`) and try to
+    -- prove that the second guard will be satisfied. If cannot, then
+    -- assume it is false, and so on. If the last guard cannot be proven
+    -- in this way, then issue a `NonExhaustivePropGuards` warning. Note
+    -- that when assuming that a conjunction of constraints is false,
+    -- this results in a disjunction, and so must check exhaustive under
+    -- assumption that each disjunct is false independently i.e.
+    -- `checkExhaustive` branches on conjunctions.
+    checkExhaustive :: Name -> [Prop] -> [[Prop]] -> InferM Bool
+    checkExhaustive _name _asmps [] = pure False -- empty GuardProps
+    -- checkExhaustive asmps [guard] = do
+    --   canProve asmps (toGoal <$> guard)
+    checkExhaustive name asmps (guard : guards) =
+      if null guards then
+        canProve asmps (toGoal <$> guard)
+      else 
+        canProve asmps (toGoal <$> guard) >>= \case
+          True -> pure True
+          False -> and <$> mapM
+            (\asmps' -> checkExhaustive name (asmps <> asmps') guards)
+            (pNegNumeric guard)
+      where
+        toGoal :: Prop -> Goal
+        toGoal prop =
+          Goal
+            { goalSource = CtPropGuardsExhaustive name
+            , goalRange = srcRange $ P.bName b
+            , goal = prop }
+
+        canProve :: [Prop] -> [Goal] -> InferM Bool
+        canProve asmps' goals = isRight <$>
+          tryProveImplication (Just name) as asmps' goals
+
 --------------------------------------------------------------------------------
 --------------------------------------------------------------------------------
 

From 5dcdbe002b1949f8e8df001bd9f3612c366022bb Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Mon, 22 Aug 2022 11:23:58 -0700
Subject: [PATCH 090/125] readability

---
 src/Cryptol/TypeCheck/Infer.hs | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/src/Cryptol/TypeCheck/Infer.hs b/src/Cryptol/TypeCheck/Infer.hs
index 0ca850cf6..ad561cdc6 100644
--- a/src/Cryptol/TypeCheck/Infer.hs
+++ b/src/Cryptol/TypeCheck/Infer.hs
@@ -1057,7 +1057,7 @@ checkSigB b (Forall as asmps0 t0, validSchema) =
           t1     <- applySubst t0
           cases1 <- mapM (checkPropGuardCase name asmps1) cases0
 
-          checkExhaustive name asmps1 (fst <$> cases1) >>= \case
+          checkExhaustive name asmps1 [ props | (props, _) <- cases1 ] >>= \case
             True ->
               -- proved exhaustive
               pure ()

From 8b4381b4011bdb0b727baf309be159911558368a Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Mon, 22 Aug 2022 11:51:36 -0700
Subject: [PATCH 091/125] rename

---
 src/Cryptol/TypeCheck/Type.hs | 10 +++++-----
 1 file changed, 5 insertions(+), 5 deletions(-)

diff --git a/src/Cryptol/TypeCheck/Type.hs b/src/Cryptol/TypeCheck/Type.hs
index a0493c48b..c928d50f6 100644
--- a/src/Cryptol/TypeCheck/Type.hs
+++ b/src/Cryptol/TypeCheck/Type.hs
@@ -876,10 +876,10 @@ Examples:
 pNegNumeric :: [Prop] -> [[Prop]]
 pNegNumeric props = do
   prop <- props
-  maybe mempty pure (pNegNumeric' prop)
+  maybe mempty pure (go prop)
   where
-    pNegNumeric' :: Prop -> Maybe [Prop]
-    pNegNumeric' prop = case prop of
+    go :: Prop -> Maybe [Prop]
+    go prop = case prop of
       TCon tcon tys -> case tcon of
         PC pc -> case pc of
           -- not x == y  <=>  x /= y
@@ -898,10 +898,10 @@ pNegNumeric props = do
         TC _tc -> panicInvalid
         TF _tf -> panicInvalid
         TError _ki -> Just [prop] -- propogates `TError`
-      TUser _na _tys ty -> pNegNumeric' ty
+      TUser _na _tys ty -> go ty
       _ -> panicInvalid
       where
-        panicInvalid = panic "pNegNumeric'"
+        panicInvalid = panic "pNegNumeric"
           [ "This type shouldn't be a valid type constraint: " ++
             "`" ++ pretty prop ++ "`"]
 

From c1f5d0cb6d3d10a0dd45629bb28de340043b981a Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Mon, 22 Aug 2022 11:52:28 -0700
Subject: [PATCH 092/125] comment

---
 src/Cryptol/TypeCheck/Type.hs | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/src/Cryptol/TypeCheck/Type.hs b/src/Cryptol/TypeCheck/Type.hs
index c928d50f6..80cd207f0 100644
--- a/src/Cryptol/TypeCheck/Type.hs
+++ b/src/Cryptol/TypeCheck/Type.hs
@@ -867,9 +867,9 @@ disjunction of conjunctions.
 {-|
 Examples:
 @
-  [(x == y)]          =>  Just [[(x /= y)]]
-  [(fin x)]           =>  Just [[(x == inf)]]
-  [(x <= y)]          =>  Just [[(x >= y), (x /= y)]]
+  [(x == y)]            =>  Just [[(x /= y)]]
+  [(fin x)]             =>  Just [[(x == inf)]]
+  [(x <= y)]            =>  Just [[(x >= y), (x /= y)]]
   [(x == y), (x == z)]  =>  Just [[(x /= y)], [(x /= z)]]
 @
 -}

From b52ad960e306ef8973d052e777cc7f4b716f962c Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Mon, 22 Aug 2022 12:08:04 -0700
Subject: [PATCH 093/125] more efficient checkExhaustive

---
 src/Cryptol/TypeCheck/Infer.hs | 77 ++++++++++++++++++++++++----------
 1 file changed, 56 insertions(+), 21 deletions(-)

diff --git a/src/Cryptol/TypeCheck/Infer.hs b/src/Cryptol/TypeCheck/Infer.hs
index ad561cdc6..077f48077 100644
--- a/src/Cryptol/TypeCheck/Infer.hs
+++ b/src/Cryptol/TypeCheck/Infer.hs
@@ -71,6 +71,7 @@ import           Data.Function(on)
 import           Control.Monad(zipWithM, unless, foldM, forM_, mplus, zipWithM,
                                unless, foldM, forM_, mplus, when)
 import           Data.Bifunctor (Bifunctor(second))
+import qualified Data.List as List
 
 
 
@@ -1152,28 +1153,60 @@ checkSigB b (Forall as asmps0 t0, validSchema) =
       e2 <- applySubst e1
       pure (guards3, e2)
 
-    -- Try to prove that the first guard will be satisfied. If cannot,
-    -- then assume it is false (via `pNegNumeric`) and try to
-    -- prove that the second guard will be satisfied. If cannot, then
-    -- assume it is false, and so on. If the last guard cannot be proven
-    -- in this way, then issue a `NonExhaustivePropGuards` warning. Note
-    -- that when assuming that a conjunction of constraints is false,
-    -- this results in a disjunction, and so must check exhaustive under
-    -- assumption that each disjunct is false independently i.e.
-    -- `checkExhaustive` branches on conjunctions.
+    {-
+    Given a DPropGuards of the form
+
+    @
+    f : {...} A
+    f | (B1, B2) => ... 
+      | (C1, C2, C2) => ... 
+    @
+
+    we check that it is exhaustive by trying to prove the following
+    implications:
+
+    @
+      A /\ ~B1 => C1 /\ C2 /\ C3
+      A /\ ~B2 => C1 /\ C2 /\ C3 
+    @
+
+    The implications were derive by the following general algorithm:
+    - Find that @(C1, C2, C3)@ is the guard that has the most conjuncts, so we
+      will keep it on the RHS of the generated implications in order to minimize
+      the number of implications we need to check.
+    - Negate @(B1, B2)@ which yields @(~B1) \/ (~B2)@. This is a disjunction, so
+      we need to consider a branch for each disjunct --- one branch gets the
+      assumption @~B1@ and another branch gets the assumption @~B2@. Each
+      branch's implications need to be proven independently.
+
+    -}
     checkExhaustive :: Name -> [Prop] -> [[Prop]] -> InferM Bool
-    checkExhaustive _name _asmps [] = pure False -- empty GuardProps
-    -- checkExhaustive asmps [guard] = do
-    --   canProve asmps (toGoal <$> guard)
-    checkExhaustive name asmps (guard : guards) =
-      if null guards then
-        canProve asmps (toGoal <$> guard)
-      else 
-        canProve asmps (toGoal <$> guard) >>= \case
-          True -> pure True
-          False -> and <$> mapM
-            (\asmps' -> checkExhaustive name (asmps <> asmps') guards)
-            (pNegNumeric guard)
+    checkExhaustive name asmps guards = 
+      -- sort in decreasing order of number of conjuncts
+      let c props1 props2 = 
+            -- reversed, so that sorting is in decreasing order
+            compare (length props2) (length props1)
+      in
+      case sortBy c guards of
+        [] -> pure False -- empty PropGuards 
+        -- singleton
+        [props] -> canProve asmps (toGoal <$> props)
+        (props : guards) -> 
+          -- Keep `props` on the RHS of implication. Negate each of `guards` and
+          -- move to RHS. For each negation of a conjunction, a disjunction is
+          -- yielded, which multiplies the number of implications that we need
+          -- to check. So that's why we chose the guard with the largest
+          -- conjunction to stay on RHS.
+          let 
+            goals = toGoal <$> props
+            impls = go asmps guards
+              where 
+                go asmps [] = pure $ canProve asmps goals
+                go asmps (guard : guards) = do
+                  neg_guard <- pNegNumeric guard
+                  go (asmps <> neg_guard) guards
+          in
+            and <$> sequence impls
       where
         toGoal :: Prop -> Goal
         toGoal prop =
@@ -1185,6 +1218,8 @@ checkSigB b (Forall as asmps0 t0, validSchema) =
         canProve :: [Prop] -> [Goal] -> InferM Bool
         canProve asmps' goals = isRight <$>
           tryProveImplication (Just name) as asmps' goals
+      
+
 
 --------------------------------------------------------------------------------
 --------------------------------------------------------------------------------

From ee2db7cb4b0b040f596d8c969e2768c53d00cf9a Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Fri, 26 Aug 2022 12:39:28 -0700
Subject: [PATCH 094/125] properly set up test suite

---
 tests/constraint-guards/Mergesort.cry         |  2 +-
 tests/constraint-guards/Uncons.cry            |  3 ---
 tests/constraint-guards/inits.icry            |  2 ++
 tests/constraint-guards/inits.icry.stdout     |  8 ++++++++
 tests/constraint-guards/insert.icry           |  2 ++
 tests/constraint-guards/insert.icry.stdout    |  8 ++++++++
 tests/constraint-guards/len.icry              |  2 ++
 tests/constraint-guards/len.icry.stdout       |  6 ++++++
 tests/constraint-guards/mergesort.icry        |  2 ++
 tests/constraint-guards/mergesort.icry.stdout |  8 ++++++++
 tests/constraint-guards/tail.cry              | 10 ++++++++++
 tests/constraint-guards/tail.icry             |  2 ++
 tests/constraint-guards/tail.icry.stdout      |  8 ++++++++
 13 files changed, 59 insertions(+), 4 deletions(-)
 delete mode 100644 tests/constraint-guards/Uncons.cry
 create mode 100644 tests/constraint-guards/inits.icry
 create mode 100644 tests/constraint-guards/inits.icry.stdout
 create mode 100644 tests/constraint-guards/insert.icry
 create mode 100644 tests/constraint-guards/insert.icry.stdout
 create mode 100644 tests/constraint-guards/len.icry
 create mode 100644 tests/constraint-guards/len.icry.stdout
 create mode 100644 tests/constraint-guards/mergesort.icry
 create mode 100644 tests/constraint-guards/mergesort.icry.stdout
 create mode 100644 tests/constraint-guards/tail.cry
 create mode 100644 tests/constraint-guards/tail.icry
 create mode 100644 tests/constraint-guards/tail.icry.stdout

diff --git a/tests/constraint-guards/Mergesort.cry b/tests/constraint-guards/Mergesort.cry
index 0bdf15bb5..0a3b2e4db 100644
--- a/tests/constraint-guards/Mergesort.cry
+++ b/tests/constraint-guards/Mergesort.cry
@@ -25,4 +25,4 @@ property sort_correct =
   (sort [9, 9, 8, -3, 1, 1, -6, -6, -8] == [-8, -6, -6, -3, 1, 1, 8, 9, 9]) &&
   (sort [9, 1, 5, 0] == [0, 1, 5, 9]) &&
   (sort [8, 3, 3] == [3, 3, 8]) &&
-  sort [-7, 8] == [-7, 8]
\ No newline at end of file
+  (sort [-7, 8] == [-7, 8])
\ No newline at end of file
diff --git a/tests/constraint-guards/Uncons.cry b/tests/constraint-guards/Uncons.cry
deleted file mode 100644
index d0e87e164..000000000
--- a/tests/constraint-guards/Uncons.cry
+++ /dev/null
@@ -1,3 +0,0 @@
-tail : {n, a} (fin n) => [n]a -> [(max n 1) - 1]a
-tail xs | n == 0 => xs
-        | n >= 1 => drop `{1} xs
\ No newline at end of file
diff --git a/tests/constraint-guards/inits.icry b/tests/constraint-guards/inits.icry
new file mode 100644
index 000000000..b5695b458
--- /dev/null
+++ b/tests/constraint-guards/inits.icry
@@ -0,0 +1,2 @@
+:l inits.cry
+:check inits_correct
diff --git a/tests/constraint-guards/inits.icry.stdout b/tests/constraint-guards/inits.icry.stdout
new file mode 100644
index 000000000..b5aac7865
--- /dev/null
+++ b/tests/constraint-guards/inits.icry.stdout
@@ -0,0 +1,8 @@
+Loading module Cryptol
+Loading module Cryptol
+Loading module Main
+Showing a specific instance of polymorphic result:
+  * Using 'Integer' for type of sequence member
+Using exhaustive testing.
+Testing... Passed 1 tests.
+Q.E.D.
diff --git a/tests/constraint-guards/insert.icry b/tests/constraint-guards/insert.icry
new file mode 100644
index 000000000..53fc0f95a
--- /dev/null
+++ b/tests/constraint-guards/insert.icry
@@ -0,0 +1,2 @@
+:l insert.cry
+:check insert_correct
diff --git a/tests/constraint-guards/insert.icry.stdout b/tests/constraint-guards/insert.icry.stdout
new file mode 100644
index 000000000..736b24325
--- /dev/null
+++ b/tests/constraint-guards/insert.icry.stdout
@@ -0,0 +1,8 @@
+Loading module Cryptol
+Loading module Cryptol
+Loading module Main
+[warning] at insert.cry:3:1--3:7:
+  Could not prove that the constraint guards used in defining Main::insert were exhaustive.
+Using exhaustive testing.
+Testing... Passed 1 tests.
+Q.E.D.
diff --git a/tests/constraint-guards/len.icry b/tests/constraint-guards/len.icry
new file mode 100644
index 000000000..71308c7fc
--- /dev/null
+++ b/tests/constraint-guards/len.icry
@@ -0,0 +1,2 @@
+:l len.cry
+:check len_correct
\ No newline at end of file
diff --git a/tests/constraint-guards/len.icry.stdout b/tests/constraint-guards/len.icry.stdout
new file mode 100644
index 000000000..d80fdf123
--- /dev/null
+++ b/tests/constraint-guards/len.icry.stdout
@@ -0,0 +1,6 @@
+Loading module Cryptol
+Loading module Cryptol
+Loading module Main
+Using exhaustive testing.
+Testing... Passed 1 tests.
+Q.E.D.
diff --git a/tests/constraint-guards/mergesort.icry b/tests/constraint-guards/mergesort.icry
new file mode 100644
index 000000000..91aa4f7a9
--- /dev/null
+++ b/tests/constraint-guards/mergesort.icry
@@ -0,0 +1,2 @@
+:l mergesort.cry
+:check sort_correct
\ No newline at end of file
diff --git a/tests/constraint-guards/mergesort.icry.stdout b/tests/constraint-guards/mergesort.icry.stdout
new file mode 100644
index 000000000..b5aac7865
--- /dev/null
+++ b/tests/constraint-guards/mergesort.icry.stdout
@@ -0,0 +1,8 @@
+Loading module Cryptol
+Loading module Cryptol
+Loading module Main
+Showing a specific instance of polymorphic result:
+  * Using 'Integer' for type of sequence member
+Using exhaustive testing.
+Testing... Passed 1 tests.
+Q.E.D.
diff --git a/tests/constraint-guards/tail.cry b/tests/constraint-guards/tail.cry
new file mode 100644
index 000000000..ca82cc54c
--- /dev/null
+++ b/tests/constraint-guards/tail.cry
@@ -0,0 +1,10 @@
+tail : {n, a} (fin n) => [n]a -> [(max n 1) - 1]a
+tail xs | n == 0 => xs
+        | n >= 1 => drop `{1} xs
+
+property tail_correct =
+  (tail [] == []) &&
+  (tail [1] == []) &&
+  (tail [1,2] == [2]) &&
+  (tail [1,2,3] == [2,3]) &&
+  (tail [1,2,3,4] == [2,3,4])
diff --git a/tests/constraint-guards/tail.icry b/tests/constraint-guards/tail.icry
new file mode 100644
index 000000000..a12f0c409
--- /dev/null
+++ b/tests/constraint-guards/tail.icry
@@ -0,0 +1,2 @@
+:l tail.cry
+:check tail_correct
diff --git a/tests/constraint-guards/tail.icry.stdout b/tests/constraint-guards/tail.icry.stdout
new file mode 100644
index 000000000..b5aac7865
--- /dev/null
+++ b/tests/constraint-guards/tail.icry.stdout
@@ -0,0 +1,8 @@
+Loading module Cryptol
+Loading module Cryptol
+Loading module Main
+Showing a specific instance of polymorphic result:
+  * Using 'Integer' for type of sequence member
+Using exhaustive testing.
+Testing... Passed 1 tests.
+Q.E.D.

From 01ed76b71b348732506c68d78080564a55be1a2c Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Mon, 29 Aug 2022 10:41:03 -0700
Subject: [PATCH 095/125] proper uncapitalized names

---
 tests/constraint-guards/{Inits.cry => inits.cry}         | 0
 tests/constraint-guards/{Insert.cry => insert.cry}       | 0
 tests/constraint-guards/{Len.cry => len.cry}             | 0
 tests/constraint-guards/{Mergesort.cry => mergesort.cry} | 0
 4 files changed, 0 insertions(+), 0 deletions(-)
 rename tests/constraint-guards/{Inits.cry => inits.cry} (100%)
 rename tests/constraint-guards/{Insert.cry => insert.cry} (100%)
 rename tests/constraint-guards/{Len.cry => len.cry} (100%)
 rename tests/constraint-guards/{Mergesort.cry => mergesort.cry} (100%)

diff --git a/tests/constraint-guards/Inits.cry b/tests/constraint-guards/inits.cry
similarity index 100%
rename from tests/constraint-guards/Inits.cry
rename to tests/constraint-guards/inits.cry
diff --git a/tests/constraint-guards/Insert.cry b/tests/constraint-guards/insert.cry
similarity index 100%
rename from tests/constraint-guards/Insert.cry
rename to tests/constraint-guards/insert.cry
diff --git a/tests/constraint-guards/Len.cry b/tests/constraint-guards/len.cry
similarity index 100%
rename from tests/constraint-guards/Len.cry
rename to tests/constraint-guards/len.cry
diff --git a/tests/constraint-guards/Mergesort.cry b/tests/constraint-guards/mergesort.cry
similarity index 100%
rename from tests/constraint-guards/Mergesort.cry
rename to tests/constraint-guards/mergesort.cry

From 28f34df25e6469e3c2c28634e683a1068361ed50 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Tue, 30 Aug 2022 08:55:46 -0700
Subject: [PATCH 096/125] can be -> are

---
 docs/RefMan/BasicSyntax.rst | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/docs/RefMan/BasicSyntax.rst b/docs/RefMan/BasicSyntax.rst
index 992f9eb34..3c46e4c0e 100644
--- a/docs/RefMan/BasicSyntax.rst
+++ b/docs/RefMan/BasicSyntax.rst
@@ -24,7 +24,7 @@ Numeric Constraint Guards
 
 A declaration with a signature can use numeric constraint guards, which are like
 normal guards (such as in a multi-branch `if`` expression) except that the
-guarding conditions can be numeric constraints. For example:
+guarding conditions are numeric constraints. For example:
 
 .. code-block:: cryptol
 

From 5a6819398c7e4e39009116af6594e0184d89c351 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Tue, 30 Aug 2022 09:03:53 -0700
Subject: [PATCH 097/125] redundant import

---
 src/Cryptol/TypeCheck/Infer.hs | 11 +++++------
 1 file changed, 5 insertions(+), 6 deletions(-)

diff --git a/src/Cryptol/TypeCheck/Infer.hs b/src/Cryptol/TypeCheck/Infer.hs
index 077f48077..7aafac3fe 100644
--- a/src/Cryptol/TypeCheck/Infer.hs
+++ b/src/Cryptol/TypeCheck/Infer.hs
@@ -71,7 +71,6 @@ import           Data.Function(on)
 import           Control.Monad(zipWithM, unless, foldM, forM_, mplus, zipWithM,
                                unless, foldM, forM_, mplus, when)
 import           Data.Bifunctor (Bifunctor(second))
-import qualified Data.List as List
 
 
 
@@ -1191,7 +1190,7 @@ checkSigB b (Forall as asmps0 t0, validSchema) =
         [] -> pure False -- empty PropGuards 
         -- singleton
         [props] -> canProve asmps (toGoal <$> props)
-        (props : guards) -> 
+        (props : guards') -> 
           -- Keep `props` on the RHS of implication. Negate each of `guards` and
           -- move to RHS. For each negation of a conjunction, a disjunction is
           -- yielded, which multiplies the number of implications that we need
@@ -1199,12 +1198,12 @@ checkSigB b (Forall as asmps0 t0, validSchema) =
           -- conjunction to stay on RHS.
           let 
             goals = toGoal <$> props
-            impls = go asmps guards
+            impls = go asmps guards'
               where 
-                go asmps [] = pure $ canProve asmps goals
-                go asmps (guard : guards) = do
+                go asmps' [] = pure $ canProve asmps' goals
+                go asmps' (guard : guards'') = do
                   neg_guard <- pNegNumeric guard
-                  go (asmps <> neg_guard) guards
+                  go (asmps' <> neg_guard) guards''
           in
             and <$> sequence impls
       where

From efa149d96788c4c64f17a153f4fcd0de608cd391 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Tue, 30 Aug 2022 09:06:24 -0700
Subject: [PATCH 098/125] removed obscenity

---
 src/Cryptol/TypeCheck/Infer.hs | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/src/Cryptol/TypeCheck/Infer.hs b/src/Cryptol/TypeCheck/Infer.hs
index 7aafac3fe..707e2ce61 100644
--- a/src/Cryptol/TypeCheck/Infer.hs
+++ b/src/Cryptol/TypeCheck/Infer.hs
@@ -983,7 +983,7 @@ checkMonoB b t =
 
     P.DPropGuards _ ->
       tcPanic "checkMonoB"
-        [ "Used constraint guards without a signature, dumbwit, at "
+        [ "Used constraint guards without a signature at "
         , show . pp $ P.bName b ]
 
 -- XXX: Do we really need to do the defaulting business in two different places?

From 418e575364f129bdaef7eb3a5d2bab1f76239b72 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Tue, 30 Aug 2022 09:06:44 -0700
Subject: [PATCH 099/125] better error message

---
 src/Cryptol/Parser/ExpandPropGuards.hs | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/src/Cryptol/Parser/ExpandPropGuards.hs b/src/Cryptol/Parser/ExpandPropGuards.hs
index a27df0bd9..9cd18905b 100644
--- a/src/Cryptol/Parser/ExpandPropGuards.hs
+++ b/src/Cryptol/Parser/ExpandPropGuards.hs
@@ -50,7 +50,7 @@ instance PP Error where
   ppPrec _ err = case err of
     NoSignature x -> 
       text "At" <+> pp (srcRange x) <.> colon <+>
-      text "No signature provided for declaration that uses PROPGUARDS."
+      text "Declarations using constraint guards currently require an explicit type signature."
 
 -- | Instances
 

From e8e9fbfc40bea755fa454c1d474bbd66c2baf9a0 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Tue, 30 Aug 2022 09:07:39 -0700
Subject: [PATCH 100/125] TODO: emit expression `error`

---
 src/Cryptol/Transform/Specialize.hs | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/src/Cryptol/Transform/Specialize.hs b/src/Cryptol/Transform/Specialize.hs
index e64973d24..d450e74bd 100644
--- a/src/Cryptol/Transform/Specialize.hs
+++ b/src/Cryptol/Transform/Specialize.hs
@@ -110,7 +110,7 @@ specializeExpr expr =
     EPropGuards guards _schema -> 
       case List.find (all checkProp . fst) guards of
         Just (_, e) -> specializeExpr e
-        Nothing -> fail "No guard constraint was satisfied"
+        Nothing -> undefined -- TODO: emit expression `error`
 
 specializeMatch :: Match -> SpecM Match
 specializeMatch (From qn l t e) = From qn l t <$> specializeExpr e

From 79a2f6288dc144fa8af4fdc2115b419987131c04 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Tue, 30 Aug 2022 09:22:37 -0700
Subject: [PATCH 101/125] better local helper names

---
 src/Cryptol/Parser/ExpandPropGuards.hs | 124 ++++++++++++-------------
 1 file changed, 61 insertions(+), 63 deletions(-)

diff --git a/src/Cryptol/Parser/ExpandPropGuards.hs b/src/Cryptol/Parser/ExpandPropGuards.hs
index 9cd18905b..90515c4a5 100644
--- a/src/Cryptol/Parser/ExpandPropGuards.hs
+++ b/src/Cryptol/Parser/ExpandPropGuards.hs
@@ -1,3 +1,9 @@
+{-# LANGUAGE BlockArguments #-}
+{-# LANGUAGE DeriveAnyClass #-}
+{-# LANGUAGE DeriveGeneric #-}
+{-# LANGUAGE FlexibleContexts #-}
+{-# LANGUAGE FlexibleInstances #-}
+
 -- |
 -- Module      :  Cryptol.Parser.PropGuards
 -- Copyright   :  (c) 2022 Galois, Inc.
@@ -9,30 +15,23 @@
 -- Expands PropGuards into a top-level definition for each case, and rewrites
 -- the body of each case to be an appropriate call to the respectively generated
 -- function.
---
-
-{-# LANGUAGE FlexibleInstances #-}
-{-# LANGUAGE FlexibleContexts #-}
-{-# LANGUAGE DeriveGeneric #-}
-{-# LANGUAGE DeriveAnyClass #-}
-
 module Cryptol.Parser.ExpandPropGuards where
 
-import Cryptol.Parser.AST
 -- import Cryptol.Parser.Position (Range(..), emptyRange, start, at)
 -- import Cryptol.Parser.Names (namesP)
-import Cryptol.Utils.PP
+
 -- import Cryptol.Utils.Ident (mkIdent)
-import Cryptol.Utils.Panic (panic)
--- import Cryptol.Utils.RecordMap
 
-import           Data.Text (pack)
+-- import Cryptol.Utils.RecordMap
 
-import GHC.Generics (Generic)
 import Control.DeepSeq
+import Cryptol.Parser.AST
+import Cryptol.Utils.PP
+import Cryptol.Utils.Panic (panic)
+import Data.Text (pack)
+import GHC.Generics (Generic)
 
 -- | Monad
-
 type ExpandPropGuardsM a = Either Error a
 
 runExpandPropGuardsM :: ExpandPropGuardsM a -> Either Error a
@@ -44,68 +43,67 @@ class ExpandPropGuards a where
 
 -- | Error
 data Error = NoSignature (Located PName)
-  deriving (Show,Generic, NFData)
+  deriving (Show, Generic, NFData)
 
 instance PP Error where
   ppPrec _ err = case err of
-    NoSignature x -> 
-      text "At" <+> pp (srcRange x) <.> colon <+>
-      text "Declarations using constraint guards currently require an explicit type signature."
+    NoSignature x ->
+      text "At" <+> pp (srcRange x) <.> colon
+        <+> text "Declarations using constraint guards currently require an explicit type signature."
 
 -- | Instances
-
 instance ExpandPropGuards (Program PName) where
   expandPropGuards (Program decls) = Program <$> expandPropGuards decls
 
 instance ExpandPropGuards (Module PName) where
   expandPropGuards m = do
     mDecls' <- expandPropGuards (mDecls m)
-    pure m { mDecls = mDecls' }
+    pure m {mDecls = mDecls'}
 
 instance ExpandPropGuards [TopDecl PName] where
-  expandPropGuards topDecls = concat <$> traverse f topDecls 
-    where 
-      f :: TopDecl PName -> ExpandPropGuardsM [TopDecl PName]
-      f (Decl topLevelDecl) = fmap mu <$> expandPropGuards [tlValue topLevelDecl]
-        where mu decl = Decl $ topLevelDecl { tlValue = decl }
-      f topDecl = pure [topDecl]
-
-instance ExpandPropGuards [Decl PName] where 
-  expandPropGuards decls = concat <$> traverse f decls 
-    where 
-      f (DBind bind) = fmap DBind <$> expandPropGuards [bind]
-      f decl = pure [decl]
+  expandPropGuards topDecls = concat <$> traverse goTopDecl topDecls
+    where
+      goTopDecl :: TopDecl PName -> ExpandPropGuardsM [TopDecl PName]
+      goTopDecl (Decl topLevelDecl) = fmap mu <$> expandPropGuards [tlValue topLevelDecl]
+        where
+          mu decl = Decl $ topLevelDecl {tlValue = decl}
+      goTopDecl topDecl = pure [topDecl]
+
+instance ExpandPropGuards [Decl PName] where
+  expandPropGuards decls = concat <$> traverse goDBind decls
+    where
+      goDBind (DBind bind) = fmap DBind <$> expandPropGuards [bind]
+      goDBind decl = pure [decl]
 
 instance ExpandPropGuards [Bind PName] where
-  expandPropGuards binds = concat <$> traverse f binds
-    where 
-      f :: Bind PName -> Either Error [Bind PName]
-      f bind = case thing $ bDef bind of 
+  expandPropGuards binds = concat <$> traverse goPName binds
+    where
+      goPName :: Bind PName -> Either Error [Bind PName]
+      goPName bind = case thing $ bDef bind of
         DPropGuards guards -> do
           Forall params props t rng <-
             case bSignature bind of
-              Just schema -> pure schema 
+              Just schema -> pure schema
               Nothing -> Left . NoSignature $ bName bind
-          let
-            g :: ([Prop PName], Expr PName) -> ExpandPropGuardsM (([Prop PName], Expr PName), Bind PName)
-            g (props', e) = do
-              bName' <- newName (bName bind) props'
-              -- call to generated function
-              let e' = foldr EApp (EVar $ thing bName') (patternToExpr <$> bParams bind)
-              pure 
-                ( (props', e') 
-                , bind
-                    { bName = bName'
-                      -- include guarded props in signature
-                    , bSignature = Just $ Forall params (props <> props') t rng
-                      -- keeps same location at original bind 
-                      -- i.e. "on top of" original bind
-                    , bDef = (bDef bind) {thing = DExpr e}
-                    }
-                )
+          let g :: ([Prop PName], Expr PName) -> ExpandPropGuardsM (([Prop PName], Expr PName), Bind PName)
+              g (props', e) = do
+                bName' <- newName (bName bind) props'
+                -- call to generated function
+                let e' = foldr EApp (EVar $ thing bName') (patternToExpr <$> bParams bind)
+                pure
+                  ( (props', e'),
+                    bind
+                      { bName = bName',
+                        -- include guarded props in signature
+                        bSignature = Just $ Forall params (props <> props') t rng,
+                        -- keeps same location at original bind
+                        -- i.e. "on top of" original bind
+                        bDef = (bDef bind) {thing = DExpr e}
+                      }
+                  )
           (guards', binds') <- unzip <$> mapM g guards
-          pure $ 
-            bind { bDef = const (DPropGuards guards') <$> bDef bind } :
+          pure $
+            bind {bDef = DPropGuards guards' <$ bDef bind} :
             binds'
         _ -> pure [bind]
 
@@ -115,13 +113,13 @@ patternToExpr _ = panic "patternToExpr" ["Unimplemented: patternToExpr of anythi
 
 newName :: Located PName -> [Prop PName] -> ExpandPropGuardsM (Located PName)
 newName locName props =
-  case thing locName of 
-    Qual modName ident -> do
-      let txt  = identText ident
+  pure case thing locName of
+    Qual modName ident ->
+      let txt = identText ident
           txt' = pack $ show $ pp props
-      pure $ const (Qual modName (mkIdent $ txt <> txt')) <$> locName
-    UnQual ident -> do
-      let txt  = identText ident
+       in Qual modName (mkIdent $ txt <> txt') <$ locName
+    UnQual ident ->
+      let txt = identText ident
           txt' = pack $ show $ pp props
-      pure $ const (UnQual (mkIdent $ txt <> txt')) <$> locName 
+       in UnQual (mkIdent $ txt <> txt') <$ locName
     NewName _ _ -> panic "mkName" ["During expanding prop guards, tried to make new name from NewName case of PName"]

From d5b7c2f245dfae5f5af514644929c9457f3623e7 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Tue, 30 Aug 2022 09:25:44 -0700
Subject: [PATCH 102/125] better pp

---
 src/Cryptol/TypeCheck/AST.hs | 7 ++++---
 1 file changed, 4 insertions(+), 3 deletions(-)

diff --git a/src/Cryptol/TypeCheck/AST.hs b/src/Cryptol/TypeCheck/AST.hs
index 4caf12ff8..962a013ac 100644
--- a/src/Cryptol/TypeCheck/AST.hs
+++ b/src/Cryptol/TypeCheck/AST.hs
@@ -271,9 +271,10 @@ instance PP (WithNames Expr) where
                          ]
       
       EPropGuards guards _ -> 
-        parens (text "propguard" <+> hsep (ppGuard <$> guards))
-        where ppGuard (props, e) = 
-                pipe <+> commaSep (pp <$> props) <+> text "=>" <+> pp e
+        parens (text "propguards" <+> vsep (ppGuard <$> guards))
+        where ppGuard (props, e) = indent 1
+                                 $ pipe <+> commaSep (pp <$> props) 
+                               <+> text "=>" <+> pp e
 
     where
     ppW x   = ppWithNames nm x

From 0a6fb8b08acca41e30baa2cadb9595a5931dd2fb Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Tue, 30 Aug 2022 10:53:15 -0700
Subject: [PATCH 103/125] If no constraint guard is satisfied, specialization
 yields error term

---
 src/Cryptol/Transform/Specialize.hs | 7 ++++++-
 src/Cryptol/TypeCheck/AST.hs        | 7 +++++++
 2 files changed, 13 insertions(+), 1 deletion(-)

diff --git a/src/Cryptol/Transform/Specialize.hs b/src/Cryptol/Transform/Specialize.hs
index d450e74bd..494e085bf 100644
--- a/src/Cryptol/Transform/Specialize.hs
+++ b/src/Cryptol/Transform/Specialize.hs
@@ -27,6 +27,8 @@ import Data.Maybe (catMaybes)
 import qualified Data.List as List
 
 import MonadLib hiding (mapM)
+import Cryptol.ModuleSystem.Base (getPrimMap)
+
 
 -- Specializer Monad -----------------------------------------------------------
 
@@ -110,7 +112,10 @@ specializeExpr expr =
     EPropGuards guards _schema -> 
       case List.find (all checkProp . fst) guards of
         Just (_, e) -> specializeExpr e
-        Nothing -> undefined -- TODO: emit expression `error`
+        Nothing -> do
+          pm <- liftSpecT getPrimMap
+          pure $ eError' pm "no constraint guard was satisfied"
+
 
 specializeMatch :: Match -> SpecM Match
 specializeMatch (From qn l t e) = From qn l t <$> specializeExpr e
diff --git a/src/Cryptol/TypeCheck/AST.hs b/src/Cryptol/TypeCheck/AST.hs
index 962a013ac..940e13814 100644
--- a/src/Cryptol/TypeCheck/AST.hs
+++ b/src/Cryptol/TypeCheck/AST.hs
@@ -198,6 +198,13 @@ eError prims t str =
   EApp (ETApp (ETApp (ePrim prims (prelPrim "error")) t)
               (tNum (length str))) (eString prims str)
 
+-- | Make an expression that is @error@ pre-applied a message (but not a also
+-- type, like @eError@).
+eError' :: PrimMap -> String -> Expr
+eError' prims str =
+  EApp (ETApp (ePrim prims (prelPrim "error"))
+              (tNum (length str))) (eString prims str)
+
 eString :: PrimMap -> String -> Expr
 eString prims str = EList (map (eChar prims) str) tChar
 

From 1ec956c5f105e94bbfe82e215774c9866284832a Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Tue, 30 Aug 2022 11:01:43 -0700
Subject: [PATCH 104/125] rename

---
 src/Cryptol/Parser/ExpandPropGuards.hs | 12 ++++++------
 1 file changed, 6 insertions(+), 6 deletions(-)

diff --git a/src/Cryptol/Parser/ExpandPropGuards.hs b/src/Cryptol/Parser/ExpandPropGuards.hs
index 90515c4a5..3341ca7f2 100644
--- a/src/Cryptol/Parser/ExpandPropGuards.hs
+++ b/src/Cryptol/Parser/ExpandPropGuards.hs
@@ -76,17 +76,17 @@ instance ExpandPropGuards [Decl PName] where
       goDBind decl = pure [decl]
 
 instance ExpandPropGuards [Bind PName] where
-  expandPropGuards binds = concat <$> traverse goPName binds
+  expandPropGuards binds = concat <$> traverse goBind binds
     where
-      goPName :: Bind PName -> Either Error [Bind PName]
-      goPName bind = case thing $ bDef bind of
+      goBind :: Bind PName -> Either Error [Bind PName]
+      goBind bind = case thing $ bDef bind of
         DPropGuards guards -> do
           Forall params props t rng <-
             case bSignature bind of
               Just schema -> pure schema
               Nothing -> Left . NoSignature $ bName bind
-          let g :: ([Prop PName], Expr PName) -> ExpandPropGuardsM (([Prop PName], Expr PName), Bind PName)
-              g (props', e) = do
+          let goGuard :: ([Prop PName], Expr PName) -> ExpandPropGuardsM (([Prop PName], Expr PName), Bind PName)
+              goGuard (props', e) = do
                 bName' <- newName (bName bind) props'
                 -- call to generated function
                 let e' = foldr EApp (EVar $ thing bName') (patternToExpr <$> bParams bind)
@@ -101,7 +101,7 @@ instance ExpandPropGuards [Bind PName] where
                         bDef = (bDef bind) {thing = DExpr e}
                       }
                   )
-          (guards', binds') <- unzip <$> mapM g guards
+          (guards', binds') <- unzip <$> mapM goGuard guards
           pure $
             bind {bDef = DPropGuards guards' <$ bDef bind} :
             binds'

From 3c9bc24b501e42ec4f84bc38d643bc0d90571eaa Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Tue, 30 Aug 2022 11:46:15 -0700
Subject: [PATCH 105/125] properly apply type args to funs gen'ed during
 ExpandPropGuards

---
 src/Cryptol/Parser/ExpandPropGuards.hs | 9 ++++++++-
 1 file changed, 8 insertions(+), 1 deletion(-)

diff --git a/src/Cryptol/Parser/ExpandPropGuards.hs b/src/Cryptol/Parser/ExpandPropGuards.hs
index 3341ca7f2..90e135651 100644
--- a/src/Cryptol/Parser/ExpandPropGuards.hs
+++ b/src/Cryptol/Parser/ExpandPropGuards.hs
@@ -3,6 +3,7 @@
 {-# LANGUAGE DeriveGeneric #-}
 {-# LANGUAGE FlexibleContexts #-}
 {-# LANGUAGE FlexibleInstances #-}
+{-# LANGUAGE LambdaCase #-}
 
 -- |
 -- Module      :  Cryptol.Parser.PropGuards
@@ -89,7 +90,13 @@ instance ExpandPropGuards [Bind PName] where
               goGuard (props', e) = do
                 bName' <- newName (bName bind) props'
                 -- call to generated function
-                let e' = foldr EApp (EVar $ thing bName') (patternToExpr <$> bParams bind)
+                tParams <- case bSignature bind of
+                  Just (Forall tps _ _ _) -> pure tps
+                  Nothing -> Left $ NoSignature (bName bind)
+                typeInsts <-
+                  (\(TParam n _ _) -> Right . PosInst $ TUser n [])
+                    `traverse` tParams
+                let e' = foldl EApp (EAppT (EVar $ thing bName') typeInsts) (patternToExpr <$> bParams bind)
                 pure
                   ( (props', e'),
                     bind

From 1514db5e8636ae9c74db15f756dcc6980b5d9063 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Tue, 30 Aug 2022 11:46:36 -0700
Subject: [PATCH 106/125] better error message on NoMatchingPropGuardCase

---
 src/Cryptol/Backend/Monad.hs | 2 +-
 src/Cryptol/Eval.hs          | 2 +-
 2 files changed, 2 insertions(+), 2 deletions(-)

diff --git a/src/Cryptol/Backend/Monad.hs b/src/Cryptol/Backend/Monad.hs
index 21f814d56..a4e8a1c79 100644
--- a/src/Cryptol/Backend/Monad.hs
+++ b/src/Cryptol/Backend/Monad.hs
@@ -444,7 +444,7 @@ instance PP EvalError where
     BadRoundingMode r -> "invalid rounding mode" <+> integer r
     BadValue x -> "invalid input for" <+> backticks (text x)
     NoPrim x -> text "unimplemented primitive:" <+> pp x
-    NoMatchingPropGuardCase msg -> text $ "No matching prop guard case; " ++ msg
+    NoMatchingPropGuardCase msg -> text $ "No matching constraint guard; " ++ msg
     FFINotSupported x -> vcat
       [ text "cannot call foreign function" <+> pp x
       , text "FFI calls are not supported in this context"
diff --git a/src/Cryptol/Eval.hs b/src/Cryptol/Eval.hs
index 11e160812..64d614dfa 100644
--- a/src/Cryptol/Eval.hs
+++ b/src/Cryptol/Eval.hs
@@ -222,7 +222,7 @@ evalExpr sym env expr = case expr of
     let checkedGuards = [ e | (ps,e) <- guards, all (checkProp . evalProp env) ps ]
     case checkedGuards of
       (e:_) -> eval e
-      [] -> raiseError sym (NoMatchingPropGuardCase $ "Available prop guards: `" ++ show (fmap pp . fst <$> guards) ++ "`")
+      [] -> raiseError sym (NoMatchingPropGuardCase $ "Among constraint guards: " ++ show (fmap pp . fst <$> guards))
 
   where
 

From f61f002b676016d0d24d81672b6452a103b71576 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Tue, 30 Aug 2022 11:47:08 -0700
Subject: [PATCH 107/125] allow constant declarations to use constraint guards

---
 src/Cryptol/Parser.y                 |  2 ++
 src/Cryptol/Parser/ParserUtils.hs    |  7 ++++++-
 tests/constraint-guards/constant.cry | 11 +++++++++++
 3 files changed, 19 insertions(+), 1 deletion(-)
 create mode 100644 tests/constraint-guards/constant.cry

diff --git a/src/Cryptol/Parser.y b/src/Cryptol/Parser.y
index b632edf48..8cf7a176b 100644
--- a/src/Cryptol/Parser.y
+++ b/src/Cryptol/Parser.y
@@ -318,6 +318,8 @@ decl                    :: { Decl PName }
   | '(' op ')' '=' expr    { at ($1,$5) $ DPatBind (PVar $2) $5             }
   | var apats_indices propguards_cases
                            { mkIndexedPropGuardsDecl $1 $2 $3 }
+  | var propguards_cases
+                           { mkIndexedConstantPropGuardsDecl $1 $2 }
   | var apats_indices '=' expr
                            { at ($1,$4) $ mkIndexedDecl $1 $2 $4 }
 
diff --git a/src/Cryptol/Parser/ParserUtils.hs b/src/Cryptol/Parser/ParserUtils.hs
index 062dc64cd..991e2f8d1 100644
--- a/src/Cryptol/Parser/ParserUtils.hs
+++ b/src/Cryptol/Parser/ParserUtils.hs
@@ -611,7 +611,7 @@ mkIndexedDecl f (ps, ixs) e =
     rhs = mkGenerate (reverse ixs) e
 
 -- NOTE: The lists of patterns are reversed!
-mkIndexedPropGuardsDecl ::
+mkIndexedPropGuardsDecl ::  
   LPName -> ([Pattern PName], [Pattern PName]) -> [([Prop PName], Expr PName)] -> Decl PName
 mkIndexedPropGuardsDecl f (ps, ixs) guards =
   DBind Bind { bName       = f
@@ -628,6 +628,11 @@ mkIndexedPropGuardsDecl f (ps, ixs) guards =
   where
     guards' = second (mkGenerate (reverse ixs)) <$> guards
 
+mkIndexedConstantPropGuardsDecl :: 
+  LPName -> [([Prop PName], Expr PName)] -> Decl PName
+mkIndexedConstantPropGuardsDecl f guards =
+  mkIndexedPropGuardsDecl f ([], []) guards
+
 -- NOTE: The lists of patterns are reversed!
 mkIndexedExpr :: ([Pattern PName], [Pattern PName]) -> Expr PName -> Expr PName
 mkIndexedExpr (ps, ixs) body
diff --git a/tests/constraint-guards/constant.cry b/tests/constraint-guards/constant.cry
new file mode 100644
index 000000000..3bb3984e0
--- /dev/null
+++ b/tests/constraint-guards/constant.cry
@@ -0,0 +1,11 @@
+isZero : {n} Bit
+isZero
+  | n == 0 => True
+  | ()     => False
+
+isFin : {n} Bit
+isFin | fin n => True
+      | () => False
+
+idTypeNum : {n} Integer 
+idTypeNum | fin n => `n
\ No newline at end of file

From 5df322ee9f783d9cd96f1d8f3826c5cd61cd8baf Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Tue, 30 Aug 2022 11:47:12 -0700
Subject: [PATCH 108/125] formatting

---
 tests/constraint-guards/inits.cry | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/tests/constraint-guards/inits.cry b/tests/constraint-guards/inits.cry
index f19194219..c0ca485c6 100644
--- a/tests/constraint-guards/inits.cry
+++ b/tests/constraint-guards/inits.cry
@@ -29,4 +29,4 @@ property inits_correct =
   (inits [1,2] == [1,1,2]) &&
   (inits [1,2,3] == [1,1,2,1,2,3]) &&
   (inits [1,2,3,4] == [1,1,2,1,2,3,1,2,3,4]) &&
-  (inits [1,2,3,4,5] == [1,1,2,1,2,3,1,2,3,4,1,2,3,4,5])
\ No newline at end of file
+  (inits [1,2,3,4,5] == [1,1,2,1,2,3,1,2,3,4,1,2,3,4,5])

From 9cd2aea93647303a6273b483f65afad4692b8b91 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Tue, 30 Aug 2022 11:47:30 -0700
Subject: [PATCH 109/125] formatting

---
 tests/constraint-guards/constant.cry | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/tests/constraint-guards/constant.cry b/tests/constraint-guards/constant.cry
index 3bb3984e0..075e68419 100644
--- a/tests/constraint-guards/constant.cry
+++ b/tests/constraint-guards/constant.cry
@@ -8,4 +8,4 @@ isFin | fin n => True
       | () => False
 
 idTypeNum : {n} Integer 
-idTypeNum | fin n => `n
\ No newline at end of file
+idTypeNum | fin n => `n

From 97e7c05e6e05b5d399b92fbb823e715964a1685d Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Tue, 30 Aug 2022 11:47:55 -0700
Subject: [PATCH 110/125] formatting

---
 tests/constraint-guards/constant.cry | 7 +++----
 1 file changed, 3 insertions(+), 4 deletions(-)

diff --git a/tests/constraint-guards/constant.cry b/tests/constraint-guards/constant.cry
index 075e68419..0d16cb4b5 100644
--- a/tests/constraint-guards/constant.cry
+++ b/tests/constraint-guards/constant.cry
@@ -1,11 +1,10 @@
 isZero : {n} Bit
-isZero
-  | n == 0 => True
-  | ()     => False
+isZero | n == 0 => True
+       | ()     => False
 
 isFin : {n} Bit
 isFin | fin n => True
-      | () => False
+      | ()    => False
 
 idTypeNum : {n} Integer 
 idTypeNum | fin n => `n

From 88b26ea7b157032daa441b2c5fb82d4591345b6b Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Tue, 30 Aug 2022 11:56:45 -0700
Subject: [PATCH 111/125] constant tests for constraint guards

---
 tests/constraint-guards/constant.cry         | 32 ++++++++++++++++++--
 tests/constraint-guards/constant.icry        |  3 ++
 tests/constraint-guards/constant.icry.stdout | 18 +++++++++++
 3 files changed, 50 insertions(+), 3 deletions(-)
 create mode 100644 tests/constraint-guards/constant.icry
 create mode 100644 tests/constraint-guards/constant.icry.stdout

diff --git a/tests/constraint-guards/constant.cry b/tests/constraint-guards/constant.cry
index 0d16cb4b5..5cd95b398 100644
--- a/tests/constraint-guards/constant.cry
+++ b/tests/constraint-guards/constant.cry
@@ -1,10 +1,36 @@
-isZero : {n} Bit
+isZero : {n : #} Bit
 isZero | n == 0 => True
        | ()     => False
 
-isFin : {n} Bit
+property isZero_correct =
+  ~isZero `{inf} &&
+   isZero `{  0}   &&
+  ~isZero `{  1}   &&
+  ~isZero `{  2}   &&
+  ~isZero `{  4}   &&
+  ~isZero `{  8}   &&
+  ~isZero `{ 16}
+
+isFin : {n : #} Bit
 isFin | fin n => True
       | ()    => False
 
-idTypeNum : {n} Integer 
+property isFin_correct =
+  ~isFin `{inf} &&
+   isFin `{  0}   &&
+   isFin `{  1}   &&
+   isFin `{  2}   &&
+   isFin `{  4}   &&
+   isFin `{  8}   &&
+   isFin `{ 16}
+
+idTypeNum : {n : #} Integer 
 idTypeNum | fin n => `n
+
+property idTypeNum_correct =
+  (idTypeNum `{ 0}  ==  0) &&
+  (idTypeNum `{ 1}  ==  1) &&
+  (idTypeNum `{ 2}  ==  2) &&
+  (idTypeNum `{ 4}  ==  4) &&
+  (idTypeNum `{ 8}  ==  8) &&
+  (idTypeNum `{16}  == 16)
diff --git a/tests/constraint-guards/constant.icry b/tests/constraint-guards/constant.icry
new file mode 100644
index 000000000..b7557b195
--- /dev/null
+++ b/tests/constraint-guards/constant.icry
@@ -0,0 +1,3 @@
+:l constant.cry
+
+:check
\ No newline at end of file
diff --git a/tests/constraint-guards/constant.icry.stdout b/tests/constraint-guards/constant.icry.stdout
new file mode 100644
index 000000000..8f64c6d74
--- /dev/null
+++ b/tests/constraint-guards/constant.icry.stdout
@@ -0,0 +1,18 @@
+Loading module Cryptol
+Loading module Cryptol
+Loading module Main
+[warning] at constant.cry:1:11--1:16
+    Unused name: n
+[warning] at constant.cry:14:10--14:15
+    Unused name: n
+[warning] at constant.cry:28:1--28:10:
+  Could not prove that the constraint guards used in defining Main::idTypeNum were exhaustive.
+property isZero_correct Using exhaustive testing.
+Testing... Passed 1 tests.
+Q.E.D.
+property isFin_correct Using exhaustive testing.
+Testing... Passed 1 tests.
+Q.E.D.
+property idTypeNum_correct Using exhaustive testing.
+Testing... Passed 1 tests.
+Q.E.D.

From 415c6dacd6523660d403dce9dbfc633e1a746120 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Wed, 31 Aug 2022 09:00:46 -0700
Subject: [PATCH 112/125] using `eError` properly

---
 src/Cryptol/Transform/Specialize.hs | 4 ++--
 src/Cryptol/TypeCheck/AST.hs        | 7 -------
 2 files changed, 2 insertions(+), 9 deletions(-)

diff --git a/src/Cryptol/Transform/Specialize.hs b/src/Cryptol/Transform/Specialize.hs
index 494e085bf..904f6a205 100644
--- a/src/Cryptol/Transform/Specialize.hs
+++ b/src/Cryptol/Transform/Specialize.hs
@@ -109,12 +109,12 @@ specializeExpr expr =
     -- The type should be monomorphic, and the guarded expressions should
     -- already be normalized, so we just need to choose the first expression
     -- that's true.
-    EPropGuards guards _schema -> 
+    EPropGuards guards ty -> 
       case List.find (all checkProp . fst) guards of
         Just (_, e) -> specializeExpr e
         Nothing -> do
           pm <- liftSpecT getPrimMap
-          pure $ eError' pm "no constraint guard was satisfied"
+          pure $ eError pm ty "no constraint guard was satisfied"
 
 
 specializeMatch :: Match -> SpecM Match
diff --git a/src/Cryptol/TypeCheck/AST.hs b/src/Cryptol/TypeCheck/AST.hs
index 940e13814..962a013ac 100644
--- a/src/Cryptol/TypeCheck/AST.hs
+++ b/src/Cryptol/TypeCheck/AST.hs
@@ -198,13 +198,6 @@ eError prims t str =
   EApp (ETApp (ETApp (ePrim prims (prelPrim "error")) t)
               (tNum (length str))) (eString prims str)
 
--- | Make an expression that is @error@ pre-applied a message (but not a also
--- type, like @eError@).
-eError' :: PrimMap -> String -> Expr
-eError' prims str =
-  EApp (ETApp (ePrim prims (prelPrim "error"))
-              (tNum (length str))) (eString prims str)
-
 eString :: PrimMap -> String -> Expr
 eString prims str = EList (map (eChar prims) str) tChar
 

From a40d19cdbae1af672e1e2b4bfa4a6ea53d9b3185 Mon Sep 17 00:00:00 2001
From: Henry Blanchette <henry@monkeyface.com>
Date: Wed, 31 Aug 2022 09:02:31 -0700
Subject: [PATCH 113/125] EPropGuards ... schema ~~> EPropGuards ... ty

---
 src/Cryptol/Eval/Reference.lhs                | 2 +-
 src/Cryptol/ModuleSystem/InstantiateModule.hs | 2 +-
 src/Cryptol/Transform/AddModParams.hs         | 2 +-
 src/Cryptol/Transform/MonoValues.hs           | 2 +-
 src/Cryptol/TypeCheck/Subst.hs                | 2 +-
 5 files changed, 5 insertions(+), 5 deletions(-)

diff --git a/src/Cryptol/Eval/Reference.lhs b/src/Cryptol/Eval/Reference.lhs
index 9657753f4..ad56b3d10 100644
--- a/src/Cryptol/Eval/Reference.lhs
+++ b/src/Cryptol/Eval/Reference.lhs
@@ -338,7 +338,7 @@ assigns values to those variables.
 >     EProofApp e    -> evalExpr env e
 >     EWhere e dgs   -> evalExpr (foldl evalDeclGroup env dgs) e
 >
->     EPropGuards guards _schema -> 
+>     EPropGuards guards _ty -> 
 >       case List.find (all (checkProp . evalProp env) . fst) guards of
 >         Just (_, e) -> evalExpr env e
 >         Nothing -> evalPanic "fromVBit" ["No guard constraint was satisfied"]
diff --git a/src/Cryptol/ModuleSystem/InstantiateModule.hs b/src/Cryptol/ModuleSystem/InstantiateModule.hs
index c6e5e3f99..8cf44a94c 100644
--- a/src/Cryptol/ModuleSystem/InstantiateModule.hs
+++ b/src/Cryptol/ModuleSystem/InstantiateModule.hs
@@ -219,7 +219,7 @@ instance Inst Expr where
 
         -- TODO: this doesn't exist in the new module system, so it will have to
         -- be implemented differently there anyway
-        EPropGuards _guards _schema -> panic "inst" ["This is not implemented for EPropGuards yet."]
+        EPropGuards _guards _ty -> panic "inst" ["This is not implemented for EPropGuards yet."]
 
 
 instance Inst DeclGroup where
diff --git a/src/Cryptol/Transform/AddModParams.hs b/src/Cryptol/Transform/AddModParams.hs
index ced5c25c7..4a625b86f 100644
--- a/src/Cryptol/Transform/AddModParams.hs
+++ b/src/Cryptol/Transform/AddModParams.hs
@@ -259,7 +259,7 @@ instance Inst Expr where
          _ -> EProofApp (inst ps e1)
 
      EWhere e dgs  -> EWhere (inst ps e) (inst ps dgs)
-     EPropGuards guards schema -> EPropGuards (second (inst ps) <$> guards) schema
+     EPropGuards guards ty -> EPropGuards (second (inst ps) <$> guards) ty
 
 
 instance Inst Match where
diff --git a/src/Cryptol/Transform/MonoValues.hs b/src/Cryptol/Transform/MonoValues.hs
index 91b29f150..f49ac5561 100644
--- a/src/Cryptol/Transform/MonoValues.hs
+++ b/src/Cryptol/Transform/MonoValues.hs
@@ -201,7 +201,7 @@ rewE rews = go
       EWhere e dgs    -> EWhere      <$> go e <*> inLocal
                                                   (mapM (rewDeclGroup rews) dgs)
 
-      EPropGuards guards schema -> EPropGuards <$> (\(props, e) -> (,) <$> pure props <*> go e) `traverse` guards <*> pure schema 
+      EPropGuards guards ty -> EPropGuards <$> (\(props, e) -> (,) <$> pure props <*> go e) `traverse` guards <*> pure ty
 
 
 rewM :: RewMap -> Match -> M Match
diff --git a/src/Cryptol/TypeCheck/Subst.hs b/src/Cryptol/TypeCheck/Subst.hs
index 8cefc57c1..b50b9fec7 100644
--- a/src/Cryptol/TypeCheck/Subst.hs
+++ b/src/Cryptol/TypeCheck/Subst.hs
@@ -391,7 +391,7 @@ instance TVars Expr where
 
         EWhere e ds   -> EWhere !$ (go e) !$ (apSubst su ds)
 
-        EPropGuards guards schema -> EPropGuards !$ (\(props, e) -> (apSubst su `fmap'` props, apSubst su e)) `fmap'` guards .$ schema
+        EPropGuards guards ty -> EPropGuards !$ (\(props, e) -> (apSubst su `fmap'` props, apSubst su e)) `fmap'` guards .$ ty
 
 instance TVars Match where
   apSubst su (From x len t e) = From x !$ (apSubst su len) !$ (apSubst su t) !$ (apSubst su e)

From b86825b7c49c09cd47fb766ec143a5b8f6357f26 Mon Sep 17 00:00:00 2001
From: Iavor Diatchki <iavor.diatchki@gmail.com>
Date: Sat, 3 Sep 2022 11:56:57 +0300
Subject: [PATCH 114/125] Update text in the "Numeric Constraint Guards"
 section

---
 docs/RefMan/BasicSyntax.rst                   |    42 +-
 .../_build/doctrees/BasicSyntax.doctree       |   Bin 55003 -> 57829 bytes
 .../RefMan/_build/doctrees/BasicTypes.doctree |   Bin 25225 -> 25178 bytes
 .../_build/doctrees/Expressions.doctree       |   Bin 15445 -> 15398 bytes
 docs/RefMan/_build/doctrees/FFI.doctree       |   Bin 70992 -> 70968 bytes
 docs/RefMan/_build/doctrees/Modules.doctree   |   Bin 62133 -> 62086 bytes
 .../doctrees/OverloadedOperations.doctree     |   Bin 9572 -> 9525 bytes
 docs/RefMan/_build/doctrees/RefMan.doctree    |   Bin 2959 -> 2912 bytes
 .../_build/doctrees/TypeDeclarations.doctree  |   Bin 8414 -> 8367 bytes
 .../RefMan/_build/doctrees/environment.pickle |   Bin 125702 -> 138808 bytes
 docs/RefMan/_build/html/.buildinfo            |     2 +-
 docs/RefMan/_build/html/BasicSyntax.html      |    59 +-
 docs/RefMan/_build/html/BasicTypes.html       |    13 +-
 docs/RefMan/_build/html/Expressions.html      |    21 +-
 docs/RefMan/_build/html/FFI.html              |    37 +-
 docs/RefMan/_build/html/Modules.html          |    39 +-
 .../_build/html/OverloadedOperations.html     |    21 +-
 docs/RefMan/_build/html/RefMan.html           |     3 +-
 docs/RefMan/_build/html/TypeDeclarations.html |     7 +-
 .../_build/html/_sources/BasicSyntax.rst.txt  |    42 +-
 docs/RefMan/_build/html/_static/basic.css     |    43 +-
 docs/RefMan/_build/html/_static/doctools.js   |   449 +-
 .../html/_static/documentation_options.js     |     6 +-
 docs/RefMan/_build/html/_static/jquery.js     | 10881 +++++++++++++++-
 .../_build/html/_static/language_data.js      |   102 +-
 .../RefMan/_build/html/_static/searchtools.js |   793 +-
 docs/RefMan/_build/html/_static/underscore.js |  2048 ++-
 docs/RefMan/_build/html/genindex.html         |     1 -
 docs/RefMan/_build/html/search.html           |     1 -
 docs/RefMan/_build/html/searchindex.js        |     2 +-
 30 files changed, 13830 insertions(+), 782 deletions(-)

diff --git a/docs/RefMan/BasicSyntax.rst b/docs/RefMan/BasicSyntax.rst
index 3c46e4c0e..cab60dc5b 100644
--- a/docs/RefMan/BasicSyntax.rst
+++ b/docs/RefMan/BasicSyntax.rst
@@ -22,9 +22,9 @@ Type Signatures
 Numeric Constraint Guards
 -------------------------
 
-A declaration with a signature can use numeric constraint guards, which are like
-normal guards (such as in a multi-branch `if`` expression) except that the
-guarding conditions are numeric constraints. For example:
+A declaration with a signature can use *numeric constraint guards*,
+which are used to change the behavior of a functoin depending on its
+numeric type parameters.  For example:
 
 .. code-block:: cryptol
 
@@ -32,8 +32,14 @@ guarding conditions are numeric constraints. For example:
   len xs | n == 0 => 0
          | n >  0 => 1 + len (drop `{1} xs)
 
+Each behavior starts with ``|`` and lists some constraints on the numeric
+parameters to a declaration.  When applied, the function will use the first
+definition that satisfies the provided numeric parameters.
 
-Note that this is importantly different from
+Numeric constraint guards are quite similar to an ``if`` expression,
+except that decisions are based on *types* rather than values.  There
+is also an important difference to simply using demotion and an
+actual ``if`` statement:
 
 .. code-block:: cryptol
   
@@ -41,28 +47,26 @@ Note that this is importantly different from
   len' xs = if `n == 0 => 0
              | `n >  0 => 1 + len (drop `{1} xs)
 
-In `len'`, the type-checker cannot determine that `n >= 1` which is
-required to use the
-
-.. code-block:: cryptol
-
-  drop `{1} xs
-
-since the `if`'s condition is only on values, not types.
-
-However, in `len`, the type-checker locally-assumes the constraint `n > 0` in
-that constraint-guarded branch and so it can in fact determine that `n >= 1`.
+The definition of ``len'`` is rejected, because the *value based* ``if``
+expression does provide the *type based* fact ``n >= 1`` which is
+required by ``drop `{1} xs``, while in ``len``, the type-checker
+locally-assumes the constraint ``n > 0`` in that constraint-guarded branch
+and so it can in fact determine that ``n >= 1``.
 
 Requirements:
   - Numeric constraint guards only support constraints over numeric literals,
-    such as `fin`, `<=`, `==`, etc. Type constraint aliases can also be used as
-    long as they only constrain numeric literals.
+    such as ``fin``, ``<=``, ``==``, etc.
+    Type constraint aliases can also be used as long as they only constrain
+    numeric literals.
   - The numeric constraint guards of a declaration should be exhaustive. The
     type-checker will attempt to prove that the set of constraint guards is
     exhaustive, but if it can't then it will issue a non-exhaustive constraint
     guards warning. This warning is controlled by the environmental option
-    `warnNonExhaustiveConstraintGuards`.
-
+    ``warnNonExhaustiveConstraintGuards``.
+  - Each constraint guard is checked *independently* of the others, and there
+    are no implict assumptions that the previous behaviors do not match---
+    instead the programmer needs to specify all constraints explicitly
+    in the guard.
 
 Layout
 ------
diff --git a/docs/RefMan/_build/doctrees/BasicSyntax.doctree b/docs/RefMan/_build/doctrees/BasicSyntax.doctree
index e7863d45c651b4e6d286c4af197f953a72c9f6f7..3306ce73fe6ddc805defec80b37abfeb690d9dd3 100644
GIT binary patch
literal 57829
zcmeHw3zQsJd8TJZBWYTXku6(}J(gX<$Qq63CD|C;NWzk_u`wQFTLCXd?yl*snXYno
zSJPFknXv^pa3Gizhux(UmauTx<&|&_OE{d(VMCT>36BNV8**|M5(s$^P9W@t1eTW}
z%kKC8x9+2>d#bzUA)ANJ(Nx#1`}p7YzyEzbHvF4k{+kQ<Uo;xj%WiFX+Afu9e#r@1
z(e{#GY*w9G*m`s8@UOLA(Hf6N8un7)HycH#6<vTF#j;x|HJn=OOe@+=*+aJyOvmN7
z1x_(^{hBIX9xiV!Z#&Z(FONjSp&M2l<5RTrlpVN5>;9EmXfL-YAF^#Z?JQIKiLbA1
zF+8YnZ?v^;1A?$szAzfeE0D`W(bgE!xoAtptvRi^=DZ!{>@aM&^UV+#5=KLADIn;#
z6)ScSAQ8WZYj#!q+Fokb^~=0ne7NB(P@ZPAEwmTuQ>#2$9xLxGUr`<^?~hK+l>MqR
zQ*!OFSbo@@2^z(jVq>Kq`jwe*rS42EHtj|!m;s!@%ze(n-F9t;@fK)LHv%AX<y}L~
z`SK1yb4|28G9lXeJO|)5Y@%);NVPAKs3~+5;LQr~=E_$R5z1Eq^YQ@@_-gz=i2sN1
z|1hvBU(47`iR|S`fU*ssj6}OCZs;`ZN`AiL7aum+Ho9OfTgUPLT5ARWACcg6q-%(_
z0-{^e;D|<+tCgFBx=nJnz20yFr*RfPhZlSjy~m^N6}tvXE+TDPOkN0J*<CDG@ITDk
zjYVQF;d7$ApYa$$ql{N`-cbaIc9u*^+L9n0=>~yvn%#;(DZCmz4YphNyAYPJ2}~4y
zlIfa0^Jt-vjbmpFj*Wt2&sDN=#lqyGb+h%TJvsjhYka}2S@vP;_zCMl`;0X&fl1G#
zAtTP!(l}S1E8kOo(c|TNHDAj2w=?2G)WP7kF=CXpBhX~hyx>n(+ou$E5cVnTxNHt4
ztpPi8D^w?J*lsPfp3gcdX_1mc6XG|3#N*jm^g4q@m$Figz;fA(4ZB`873za0Ekh`+
zB{wWvwnpD7+BK^gIMzfh#-yk*5!Pj5GPhKAizwD`C~L_IeXCf8$~ab7b}T4>eb)6G
zmcM|S7n-$V=tC|_PTi@M+}fh$*DN;-a<TzpjYY6l9T<UN+Olp(VQ1N{)+^4<Ot<m!
zzUWY&fVUJG`!51=ztto+Owx9zS}&u^2u$LQrBFpNSmM<|I1L#(s<HCB%@)(G=D#NZ
z!PI?G_52cF)ABqwoaBf$s?vy>y~<l+D|{J>u_CnDsA9#bk&UXw7OEyJRPBsyO`Wjr
ztcA{^)5uY#<-j^;)vV*ktywZ+vpGxrqr?-INIZgWi1Ln?8h+g>JbL66D0WzK|Gc!N
zxWaPupVw(I_Zvj}H_EVo;Wis8u5>vF?M4^~b5SUqD-<ldR<bH?fW!bkiKV4IAO$Bw
z5Gz7X>o!>m+q6GW_Lr1FOuJsMxK3%3%dyFT?}64T6*fjx+ky-4C0BCL$GGH~Agdi(
z0lbu8!F2*IS#S7f-4ZO4)Ir_!v@#@@ua244&?qez2=;`jyf7ErVh_f&7Q;*^DH#Lj
zbnVQyKQpUH*Z(h4i>&`2`q`tqlGf;F5cnjk`?Et=cU7ssom;I-<*xMQO*p~miK{N0
zZ`PEWRVcU%&^2e7ywm_vKbdoui%vZh(vP0prPP2cn764jhGtAqml{l1aN)}iszTpv
zowX}XhdS5ONOE#6ic|t<Bl_ZM-EV|8Je88Wuz-)XB06%PAgNbYpnue7mz=84T1RSc
z*K&3-Y}yqGAFM;@&{$4)*GID>tMwyVOKH&jJElsNzod-WRzXLpii7TgZi{vC$7aFa
zy7(Q|#o4TU(Tzsg%XXmmE`{E<nBfw?VdlSXjZpM<4P0<R|5%d8A+Ri-2Qkv1M(3ru
z4qEmvDxQ^zj%2w79d}rUmS~&UmYjsEKWlRc#X7y78l03veYrh{$nQCBxeHdIi|<1o
z&^h|jp96Hhn^lx#A-@UCS*JTRX;4$SLk~P36~l7E4l4fx!<#~ZhztV_bJ}n`1f<A^
znRkjd4WY<unP9tXv1y)&%_U5@H0M^yhwBo%EusJqhvNJTFtaEG+8?)$pcygla)VsM
zL2uE3wVz+XcheIs6ecNK#j!BvV)!V9K%t7Kie;zxFnPOv(XLchrVy1vrzE^5?ZSyR
zty#h>cC_?I5oDsa8+NT&&QXtmp2Q7#?1=mfb%_RZRRqSU`!SKwj@U(=1T_pnx34f`
zcP7-&u=3j_JER@lLfp|+vV`21DBsiAbBk>6FJGO_x{)X?S2y^z8Q;|=EE0(wh6L$m
z7#AlKE->jDmjO%H72%~DWEqU&awbS%6g4FKQ`NzMvPZ^l7--t=<SsJSLrL14)-~M@
zQ}#D9;nPOhtwR2Fg^^6@2BD^LPV2dZZ>vyzT@}Ojj!dw%(RyEZ3!)o{R?CqN`<|o?
zk{IkXO_Oeh@%Yf%@z`P5I9+ShmYfdpw%9aEK!;!|bWIH3C)W<&(d-siHy*8}bUL;p
zEL&vHCBDPdpU>(>8RIXl9pgJTs-w^#MH^RVI(7Qiyl<_YJ_FMRVtDBSQGd=J&9_Kr
zZzLMk{z#sJF-G_S92JvX7bo)MG0dzQ86UWE=z<IG6AlH9;ewlUQ`YLEH@}8KVbHA8
zps_vba~5Mw8F-1qA;Ba<XhD;L#Q~fO_)g@F6bi?Vi|28EI$?1d`A$<HSo;|mpt=~*
z2JBYwV0Au@H>0kKk3lJ(aBNmE<ON8oAZkiNF%68!*^ucfZ)k~_wun`mf$^a1H!JXQ
z91QZxaOXnztTRoOpnB7j5<x0V`ypP8QMu2~T<r7!I4f{Ms=TvBcyX3dH{8Z%NItmm
zqYlvsAAvEvaTLsjpXMNTR`Y998X%)uR2HMMWH)LUvJ<dyOXD|kT>wMa@GBMJHWF}7
z?X27IYs7U7=KVU2@KI5rK&9sV+HDH;Th%Opn9e8^h^8D#OQOb2v71@4Cfu5c`=f=*
z$^=n@+V%0L5lnI{i+&POX*Qt-HxfYy7hW$rrVJ1<86G5+gWHUmg=V1Qk^vlOlnSjX
z&4^A-O`#$eGcS&fSqU!SV+N#(IT@?wI3-ktxJDgOlZ6$CSH+-TK!bU-jCtb~u7t}o
zNvCscHECXX3purh?nJxV6h~UuM5-F2coz*~5I*MZp$AXt_AzJb?WWvfn(;Oi&fyjQ
z=tyJ)Lk*CW-tU-ig4bbpyFkc{ki|$^gXpsxr~3UV{zj?2RBmZ{#6Y90#&ADxn9-!z
zeH+g#qo3N0+9ANx3F$Y6aB$1GkC2Kqgf|TkJ1Ngjl<qx%qxN_JH#ljIdgv`38iWn0
zqmsZ39y^|Z<pmoAi+3kgBq#$&^`HO{P#38nIG%*yWow539Wi&jo2P%u?nRs5Ru@k8
z=TO~*k`pW;sgmT43l<&ZtlnWfWc>93ib<SCZzC;GvPZ;>7)^!u=U!}-bD_P2b-NZD
z<XH6QRtQ;FR{NL4?ayn=KwNYj4;=iN64|dk_SVe)@CFI3w)hWR{WC?g>?4Scq8JS7
ztH@Xy4zAIq9qda|Wsi5D=SV~|h~0zNCt6N5>Sc<K5v=SUm}7MBpJ}Y$iAaBa%5ju@
zl&ei`KBZ5IzP52=s|^}iZNRvSCleeoP>n}bhJXGyKldoJRFmI+peL$Ytoz9fd3%3C
z@XI>*J(?JXOXb?tHagcWvLbyrQD3Sgmnj5J5U?VBX!UXa2FT*q9&6<`S{60#SfsLQ
zkYWRXrx3-41K)-F{n@EgDEZ#3c53yiqpc$3(2548XmzxAHOY{OT#%b>_0iOoR73_j
zR&R=G->z$?xX5rHwGVOaB7j=nFM=<+k?6A6gP+nKe7vN-r56m#Oh)i14!t2$%F<z4
zm7B73c<T%86~Bq~`4qL?7s*#OhVq^il=&e&jIK3ZFR^>T`<^PnE6VQx9NNA1(9b=;
z;Wz6%NHK;eVoj0XShQ>IBNQ@}tBc5JAYMqZ!s*=ej0Nsubs&Y^0<7gl98Tp!yp995
zh`y=Mi`3|J?uD2l=B7hz#lTlY`bf=0VKiIy@y08dsN}q}=+-E@$s;NRz|=;CwkA-C
z@kve=(Ke0Frl5`lCz`5YiIpX0t+AX512zVcS~4o5B~%m)#WKUjq=g*=h#T@s<;ffY
zxPbVozeE7uD)wcxl@-gQ;C}y->gSc}T8Xw{u7hj^J^EH6xxDxVhB85k^e%`S6T4Ip
zKwgT&+AF+!Wx`rU+9Pr&OD?yF?JUQw6{+oOuRx*3o%UYfwa)b~_qHRcEyXAge=v_A
z)B=m+t#HY2lkZ7P#gGm(tipm=A*|jP3s9Vs2)RQ`azYd5op8y)9EZ$XSS+L(0LrHf
zNe*vfHKVXL^@dw3y4W!guO;SCKWU_?yJC{kp$QIR50<y^hNB!*9M!R%z*H5_m(iLS
zV8`Z%7t2_@Qwx(<D+05^BL%&b<uK2+^g|fK)5uT=Jh?g{vIyXh@-DYLHjRl@o5n0a
zGz5gCbPXhyJ9^WJx>EZPZ<2Bg0NB0T#q&0jvj#$m4_$!vrcjrRn*qi}4dbG&h(-D2
zx?sF)RcX`BL@Am2fIWr2r`HAhFw@t7GfwCOrWATEt_!C9shVlP+9P8hIHb_^k#*s)
z!>}F(#BIszgYS*&g72m^+cN{3byU&?cO!0tH6*dolxAg^-*wxpw(rbB0*=3sVPm_J
z)7Ds58kwnGAWT}66zTbJ7SKAZ-ZlMo4+iA@mgobk6>TS1bPG)IPp=EBq^<E5s5)uv
zlf->QgYifLj6Yi!7~Mi|$qrAC)6%wpy%fO90Z-c&(5)3QzS09Zosu$YqtQ~zsBQbL
zK2{fC(Tr3IouE83@Ba##{v->DXs5LIBUOS&Zu5Xe`D4*%<p?8QjDuAXw0j!EQUQ^a
zSKhiM#%6`W%mkbsTCt10n4E^iPZKk=7)R{qg8P<U9(g&dF;3#pe2yxNBPZnE!IqtB
z0|!eqR$zd!4g<?Gu!p2E?_z^&!>z1nH|l71l(ZN|YbgyPk8Eil3m7&J)2~D@$=ku1
z3Ednk-$jYCsg4v|J8F%s-R^ca=!&D{m!2>Z0~L%DGrB5<@!;BFgazwIEOdiWza@I&
zG-Kj4lf>!9wc~W}#*44g^k@?*??S2mEMW;Hr2&D&>Cx)^%!F7QhOwO8ZZxckncU2b
z@s(6rT7+C%IlRmXRi2pXs6<NR`DjW}pQZg?*00s|u#Y1I%58*GN0%TzH68jTzZH$p
zBTwg$m?N&e&x;Q<!SHfsVgjU$wQ{_y&(_#-nret+eBz}Y{&FVCrcR<nB}9-FhbQO`
z!dsvZh$hm6!-xXTP*x)m^_)$#Y}i3`5^We!d{QLn+L-#UOw_SDAL#H5nth{I&3-zq
zZ}($t&HQx4$`KKrjYjQK)fc;ir<hZ=dHhJU4acJJnJUqaQ*;<id=?CalIIETn1*OX
ztBqDQ97iL&dhJ4(X(>(wb=)aV#Ev^D0_kEKb3^$NZD~qGyx%22$GrDtqBBX!yHyEx
zB?41Y9(Wx>JF@FVU{k`v5pJvzq<)=-`-tmsJOqb5G_W&C9M*7}qMp1rTP0gnte2&}
z-f<CuX~5uGx78N0+OUimD^|+lXo!Z@MA)?v6e+wrUMS=Xg~MX_lhYwoRbe2VhmM-i
zK~aRqtz!LZ$z62A$y{f}2ulG7tR8g{mPTXPu|<vDPy5zQba8G4V%M}h)UM>J4g%kZ
z<HmEA@<^CT+Uo?YRv08&dI~)G6bxj<My`0d>68c}m2w<4vc>}kQK!3{l_ekN^KcJz
zs_9n3DHOV=j-zivzY!GjhqWto?y2O5*6Qe~g#&{7AC=&W=^Dc<4YS-xYdVnEV6!p$
zSfXTaV?=F1G4@5LH$xaTc$-xJx~TOhYp2%e;dTu(5bgNX6GkYf;%IX7-q+U-WB62P
zyg`Vkru}Zz#=`He5#wj{woj5VSM{)D2Hrih0>mf#W^1%Xbl^Q}jfR1vTWUpDJsca|
zDU4*M=3}Ef<x8W>^VB~i0EDTDw&SD)zjD?oweA{VTQCT#tUBO`-nvj#`w3|dOcNz#
zM~u3`2~0GHI3>zy7@j1I7kh0uRitS176{{Gbm?tkzL94#jowT0X4UTs2k*czqk9!S
z`ke&x_ET=*BAo*om*W*E=uyQBh%>ZVoSsMIk3;l>=6;<<o<8K};#~ARN+0RRA<8Cl
z(W^vdBdb){bJsA%(68Ph^f5}%M9{n^XY^?7j9wD&Lzv>I%+wMN;)2ZKqj4f$^5DDI
zlP~%!L})E1p!rrlSkGu?hsk&CjV6*)98z-sQXJBr>J<-QdgfD9_wE;1-Aj*tWsYND
zbE*V8uCE2;ItEr{?^DgW8)UIeXU>Y9xq!U6*s&6!4FsifrV~eVm)eVqrvh=F5Tr7Y
zv-i<?ZdDV}7DUV|lJv2Cs4Qo%e;q<4iOI%iTRfmKt;_d`prJjFc~qKeUE<Am@NgF$
z*eI-u;1dTLO|b@}P%QiP>2gq@LuW$TZALqaZq7NCz`?F=IQq4myO4w5eHKNr(4tsr
zmYiJGFEuMp4l)@3!YO%91E&T!xtg;?>)%ntUaZ=9kev=!XlX@_cWdM5Iod9UVMI=x
zTa&YcT-l{_<xu~EyIc{EhImlhRU8*}7FEg<=5l&*Pp;%I)pGM{8vYj)dnI6O8+}Mu
zuQdc@r>a62rAWnn!@F6uw&J+3MaSHZ8ts~%w(`<%h*fE|lR~{5>W;R{uABSlS5R|T
z-t`_simA!wymuMC$T{V>@AR%T(xUCMS=q7Z1ckcyCaQnTdm}yiHBe@!_&yYV0}2Cw
z)hRykLJX|2PNMCfPz;e2tAu=s)j+%|fsJ2dT@Y_V4RHEL+drWQB8jy@eucispY#;!
zrBak8atdp&))A2l8&lOkp=a@{P+|2=>6=Jly(J}68Sq0Wu1Mj!8u8ay`(@tPZpc?M
z3^4<LNmsIm8%bBC2W$e~#&X<`d$a``lEIb4A*@;#w9~?eAz#<>9!K2{ImzBh{9<>=
z&~&weGR-wIOb)q5(Ph}Wi?et1LYPv1eudploYL$49-8r9g+D=bY1fPxCLkNZC9<`7
z7;kL%FhtiFd+mYrB@V$Emjenhy-;@C2D+xeM=S~5j~lLt88~#Q2%19youY$48%|o&
z1v!c)+!8u#82QkBseCv<Iuzj{#3$a=4^-GSbKc-m^5gvh=m=Bz5qk7%N0pEALBqOp
zM>5O=H$0Tsz#Ad;i|>g^Z%|c*QM-TC&^{rc{d^{9N8`Tk!+`d`p=8|U@$#=Opwc+b
zuTWgE<D)t%Iyq{jXme%BErsRQU5BZ+{YwGpSGYOvukdK^^7^Xj!j76S1|5cxwo9F$
zjYLBYf2kv#k5@;CxUtgl$#BfKOQxtUS0!lT4{v2r8KOsKQTcrk{{oaub5#i4p9;eL
zL=f)(brMdGCU%`P6;?u?NY&t9A;7<U&EQ{}6?|<?lk!5CJ}EH$0b{zl@usZb6Iq2c
zu?)=nrA~&9dq3`=*SMET!)>%<`Gkz&sh!N;^NC6bYruF7A%l*naEEheCK}Sb(QUnH
zr>x3HkpEQg{8Ch&%URRW9B$A_@KQwLH!T{AgwL4g&?B>C6S(tP!R<>ljtR^%GZpI~
zUM6QVjre<8^1f*BWyxv!$1~wiY<+ESycJvj0Qq0tJHKS>s|50?(%XZrzeD(7%M3j-
zvz5SoS5|O0o2@f1>rmB*R=ucXuyy8T32pscCj5!5pYDyfV(T9w{~z_vFWLHW&blsb
z{d>Y^%=-pCGP9My{d!h#H<hjX#i0>chHwC9N8oXs&XC|&d6vX@yB4RPF|lJ?7P=6-
zx1j`_qJ4C-pf-w27!1cBO)|HGLLf`CI(Q&?+{ONl2L*7dUMk|=%YXn~RT6}m%?IIt
z$&VqtX(DoOd2)>)q)MIAzmI`OTbP0AK1A$T4RF?U{Trnas~!!>VSLn)u7#yQIF5M_
zWkOYkIthgbv!akn9qC-HwFiB6p#Y}{I(SU{6$*I*53H>@_DoJZAs)w$$FKBcRWP*`
zbKc6kf_^0(saI#B7wPINnNF+dDt%l<R{;ock*YdyEFq(<M9EZH;*~%>0cq1zbW-VO
z^SpQS0U-8C0t}u=YUxMT0YFYuGaA70V}ebqaDqr7MFo5uJoZdon(f8s*8xcv10FL<
zTTK8!va3mv1mLTi3;@hFYmJ0p2yY1*{Nv_>a6&084RY|70AXNzyE65w5~+qsneC55
zNFD`}eU68hIqQa-ZHsUm^RCQ<sx;e#!Wc?sLLrqp>owbu>~rU&WGjL9ZXxu<V0Q3a
z;$9E$R3_ZX1fS@QvtsifA^&rF=a=5`jhr=|%{>M^1;PhCF+DPS#{}+!S;5^@mZIN!
zsFS0Q5q5&30}mzi_SKm%=RUPJ#)_ez0)-y!onJC^nX{%d6z85VsMv&f(T>$S37awR
z9rVb|P6GCAS%KYDc0xn1xu%n!A1Cx;4ZY@?1VcZO33p=X$9m(e82TCH|7h?0lA#~r
ztmzExp`m|G_>6gfNsr7dC2+rz72Hi_DKzxzPL5tMqBuHmb%LRT^sR5qiJ?F3jj>|r
zXOaIWz4J?k{)n@#i=h_bgI+WfTCx`<aK})x&t6o3yQvI42>&o1{fObu3H2)9rTb_O
zb;zwW#yW#1l7pR7ndrkkEz@O{!On?9bw*qOpd2$sJA=oP!=2NKvb}vfYHigRN&HcH
z92A&fqA3p-ZwVz>*nAL<nM4@ETLOgT%?IIxIno%yTLOePtPzA%1yH8o^U$s5Fym4g
zEKR|UoHgAPq;}T7OW0t$M<%4CAs}GiofX(rI;_{7-ccxA%b|{`*uI<U4zrJsQoskU
zO)&QJnP@=D{u#!76=kQ7W|v_oI{=aJQQ@fsAYV<COqB$VYzRP7DXS#x2>|{{20XQ1
zDPjMWv#vwJ{+X~D^M0HODJfwD><_a7n@WfEO4wD{&dd^q=_*9q(DUH$40;!O>DI}B
z*~Sjvf#e3?D|78)lFAfj_T?zCs$Hj#t4p1lVuRErr_yE<B{u+&ws;!o0AeZaJD3pq
zQ=8m8I#}Y8Y=3YjY1dD0J^)HSp!I_XlK?EN5r9;2S8D&q(4<SzLZ43C#hi5=YX4fo
zX3Tp{CZwd=6R?kE1vZrq>s5P*&qG~C_3t6{;!)s3$zlEbGT}}g%DZ~wtQh(y$p6mX
z`K29yJ7-O2Xpd3grwAWRozkQ4v5;gbf&1~S;BG2Q#|nj8V76hmZ;77=*oq&(gUv+3
zcR(g-JqB(`Sg&tnq6xA3Z<!Wk2rMH4&TsKolg5Vg07)cxB`AZpBw_jS2EpPzNfjwb
z^-uwpT#|^~mjek}?A(z>KH6x}Z8nz(wK^#jvxt%hlAv6<Mo?1aPHEtuf;fN8Y)tJd
zr3QYLv!-ics;_>Wu)**k6H-$D2-q7@vQPUjfK8>tdQIxy@n+3#tQ>{{!W+ilS1P^R
z7j2gxwQw0}z~#XN6$}l5e5SeAr9{b8=CQ{`ZLR8Yr2`^yB1L(n#)W6i&aM%VRIVuL
z{GTAw0}Oa7f>Jtvm9wTxXOI5jHwm9H@6DOelJZI5{>!Z3rc$C^KGU<_EEed9<%+9k
zjkeG_+tyu!w8Zhx#S%xcK3A8aEqd3BEqdloJSy>NQNmbVKAG5f=j}iiz28plE#)=e
za&M_#(T!#fVa4O&Gqi!FoWsp+JB6tfJJ}*!;~Jmb7;iRB*^;+kofkm&wM<o<vra`H
z9U!}#9=Y@^!2b}!@ZU2D1DzxBSyh6O_%akvFQC<j1&FO)biT}4oblvf`8%B<q1MQY
zbAIWlTsmB)-W10PW3@VVd0_*Zyhw$%d<5cj1>@o_$`Rm9V%`B8;Nm)3M<1xQ@lP!f
zn#6x0Nc?3*uq>PP{=y(Nwm5yJa~ZC=0^Se_MPn%v7kB-r!TbjS=KsnBrd$F4R{-;y
zC<ze1+zH}Zm#Ob0ZHyPZKPhTo<AV3`&YHg80cZ9_&V8+JAKS_H_A+{8_Q$^l!tO)K
zKK+5coHf0B*mk!#(L@S{de^dWRDe9YW{{_{f~*a5%8K?qebgGSXphC^Ip{Fj_eZQ@
zDLWh$6_8Z!wf7(qC!Q%z#wgEZA{_bF|Drc)%4PUE^1rxue(5sY&so!DV*ANb3EN}+
zniLA1prztb!fMQ0p+{yxCZNw|1-dV(c#*&_^I~?>|I}=K8(|l-H5u`JdnU|@t#9p(
zv104rA^&gn&M(>eX3m<<)*bgZ=W)1V(d2Afnr7}t3AZutKhYyIa|!g{&kFixGgpOk
zHFLj0*u~6EMtHxP33FoZpZCUCG54Fu|Ha<<C3F9jv!*k5_ub7(h?CCUBHzIvH8+{8
zS^N{i5T~rrBQuK$fgfZ=V6$1Q0_B>;W4knqld<#t^sR5qiN%+pM31glvG`lazpr<G
z$>P17HJ!!VpNB1@foYaif@bS;2&*ygCVKRZoE*;)&^KfSdQ;g-GXPyexDOI~LUjjc
zk|EqPnQ-U+wl~g-vHu%1dU5aklCk%5)^x^ReXHZ*NX<o@RVNrs$I(HWEnJ3z^YBVm
zvwoNrn$B#zs57$;QFQ$ZfL9VEX%D<8#pyD`^y);()VKr(UZ^b&yzFd)Ux{ecp56tz
zREcV1#93}D6{dDZq*g7159{zD4$2^}wm}~x3dY?`asur`nW_7M-WV$ieH*lWfA9Q~
zLhs|O>7u&rZaSu=sdiGUcg0@sj|rzS?+JQjwm<~(=dyylsZ50hI@rYm{Uf0lTcCqU
z3-p~#xRV9?hu%0Vw*C|Hf2((X$<}Xh)^xTWkVb_M?!Z;*<01fq%hhd+1!{}J{=oe7
zkyDGp=x!E;UG&H-3WR13C42O^?PzYcD0G`ooFVjLQRtXYJdz1_5{0SWI4e>3F7i+G
z&M#?nh_j}P!tUFa>o~mwr@gj2l8I!^<a-FiG4F1AWM(oU@Pe!eY$}tnrmnJhw9}0H
zgrDH@5HjdKm!}0@o(X$mbG0|tip}3cey?|a$>v4Qn$G6SrN&qMMZ{vma@88A%iOG^
zO4ZY{X!gH}Fvkf=^vKM9LhKD$5!+Pu(}gB<z(%J4e2_2{0x&Gj;7~+h5%^Fh3XlkV
zpf~191b%@0@9&*oiop9gYq|&=IOT>oe+I}}<A|5ztYn1KS^CFo*B&{H<B*lpd2zR_
zS_Pu+-vROy38EN|=T5UJIbPik)#BE5<xJc!ChAFb`PdDmmc{(vVO>`=0Gv9ZN|mTK
z7JQCtO>MoM1*ui9*WrY%s@lt)qB=CHM0E%mH2zG>Vfxy)s*<1%phS;uSW)Rm$p6#+
zsq_=hnl7l@?zWfRYO^YZM7=8o^sXkH#=HZWP?N)60{P0`C`!f(kT;#NZmpBCw-SDF
zCscK73C7-*343Df$=+Bi#{L-jPxQ_&sq`Gq+KaJnt(~#)yJl>Wa2oS$dh{)`lCcEx
zLs>!2z}WPx@%*%yd{{kexA|!?d#20K{PeR@=cn6eVCUK{L)b4Tp{Ho-RLl|^XC3RQ
zYn9Q`8TI^Z`ouNO`KHWN@0n{>orYVqUg+XHLmLzFu^e}P(9Hk0g89FliTN}i{T5Y%
z=c9kxHXr?W5|sEXUUiSa68xYLS5M+N*m;+hx!?fvVrW+;<z)hNpn0y0t6k;g0yx1y
zTzQMjQE)aY`A?Y9wsGPqBWdCA(~^Uq&{c6rsv8D$AQ_G%y%}5lXXg>*p~Gcmb4c>z
zq`2jpFYg|R%Ta#1;+8Hq5XZuy5c&YF$AC@Dd{e~e*PkZ%YHRiM0SU75J4#kMt`fl5
zpI9VCb#QiG;~;##MA=lwfZY;mjop%6ZH(9TMu`u-A%w(e2z^}>L-@(HLpZ|__AiIJ
z<tTH}-dHL(2WtjrlP=Ad){f<cor<FjP}JpP7f7|8?lN61`_H>C7(h{JnEE-O_G0r)
zcWJ96r@MbtkbB=Jii~;xCktVWgKO^|CTRZ&r6H{9<l5-lN1t`QJb6_;aW&NQ;>%WI
zD08!2@^#BLe?<J7Rh3!Dc8ZO!G@`j#|GH=2pfm6<<hqAUv(B`9`)!FlRMj1Zu~xt>
zFYuA{X7=t`C9!|e&{kr^CS+hwy7%AvSbS5Ow6c&>bAxbd^r^3MZCu((uTqI{;HEeP
zUoSR$;9eXj)zRN|cIfDHjlR;7{kVl|9x#sz4<Lt&2radYO!VsLwb6@LoZ2D{ncZn;
zdQx2a!>7uV%Y@<cgS9iFGtLEclTe{Xw+fMW5SQz4325OOdk%D|9=+6>)p@5u*H81^
zMSMIxrN{C+ozyn0r^9tg{#mC{@!^@2gjXOgB;w=I$qm7g%1)yJ@E00>m9B6KapE+2
zI!k32w_6+aQ*OGtXxftYN1V$|uEe8HA!&{7<tYUNcJVT3ggF{9q8b>Ivjj-fF@!e_
zIqTCi5~X`P4b&bx4LRzpgkb4PaT%^o?E+o$zSf#@7Y33e$Y*5%O<snpp!>wnfut+b
z7yUe7(?uGz{Y`ULMzcCAzw*L(T&GXE=0T(y=dGSWk=(nV#Ba>IH<J|VD`@V%grJ@i
z%A%Z>2S(8)%+4Q~Jz{tn)c2#$zu9{5`ZJUGeZ-oG?Jk*mVRzwp965Sj!ru{vjvS>@
z*L5wlylSBvsL=J@3gwcpDfk|>UomZs$HcXe%|2`$KVjK9%8~pB;B4!-btjBFuGXRZ
z?O=Ui;c+>JRkKbUkE6XuW@GF0OVV^9jS@#T)_Inu)lGCC&W|CLTKUNNdG<y-KbLlM
ze&~i}#9Mp|7q-X<2X3FJ`<0cNU&W<{xFQ<o&?ELiOHgnjqWXZ_S`e!UXvq<I3KYlS
z)%Att0xAoa9K=d+_aYXT^PPw|4FjiQvHsguvEm0*ACAg8Q7BC3x;YNIr7jK_Vj>9#
zOgK<Ex^t2*oWynkx?sjZh-I;Xn-rnA^rmaYZH}ETOtAx!jVF-NH=md0VD**~HZ$4j
zFY8V}Ie307QFL`-r*-p_Lu{j|J$6Yh?j{Nb0lI(h0<qylA?`w=Bz>sCW69Ih-kb$w
zj=Ly$M-u{SfZFk?CzK@H3d(aQbX{ya-n(`vU;Q-D7-a~frvo%yc%iLnnk#cvR##^4
zi<AYFV=m>zbp56X<$aPkKIVNQ3**hG%QFeq|ANwOQI}skcFtOU=%E{|Yw2;lcpMdv
zBX}IK&Yh6%%(LNRsL5R6^&rHO6E(y|ucM+|rrm)MzRj}|HIU;ZW&CLXi6S<u*cX^q
zt6Qu-x@UvtTA-+VzHy_w=Z~U$mKXSPj~q1Xb-#frfrWTkz7A;77@Yb~F*9I|i%A1?
zrxcJrJelLLteK1`FfLq`6BFZ@HxNaTNPz`2+Mz4+5mh~$6Yeg0%adII5!W`yciX@{
zKxZCz^3-qod=sTzsjTEU2!b9NP6MwWLVc&v9m`1(>YC*z4!O!X4-sI_C4r2i9f({6
z)=@^Gtp=o4?Z(5jIF{)|AA^<Zyk7x?b@Di5OtL#|4PY3;BeQ}|ZS^=*Pp1p<+;uWh
zcN5XNtAf4wX2ROEcckeP7~e^hU0suCvnov)Q)}GuU)Ujq23}o0_J%ZdB4f*i?J<`O
zkj`dR3<HtuWqaaDN+%8Kpr7={E?qmGGZ|IcKr?gEbS$x(3RXfQIbd9s%T{}0?Kr-j
zO~KRE^cWO<ngiOCf3Ts7e|3!)^Y8fD`FHCE7-kJkv?0~?qy_o`MGHr_&a`;Z+G(-F
z>|B&z6SXCGflYfUX>RXCX1DkDPA5cSy|>#p1+iBn8jN|BETk~q-lGJoi_&dwZ*XLG
z`Y0k}(?^}_Oh*-NDkUP0c4YRU>vFTp*Ue7z)zUH(GEivl26A_g%pAEP&Qdo*dB`%}
zmgg`E9DV3|iSSd>wjwAC)+0=h)w{VqTw8;#T4>0%y=jA8+vvAXRw`Yb$K=$MGTw+q
z(HxVw{*Y$Q0>o}?1bl=?oHLv@F&&023C{E)Cfo{z`*_KXT`3f_%T_4dj>)f(X5Q?o
zTj7HxxLUfH9Si1Y^2$ALFlrNVJ{yG&{p*AV8m=Ig+iJo|G2bqeG{h`>Z%fp(x)e&c
zkXmN9FsGTKD~-(5bU3j9J7%Q>a+u$BWenkeSUZFlb&(OJdQrEpT_D!_lxBo)Za2cl
zJoR3T1@ET`Vj=u2+#J4C=*LhVrpvbJrksXD!B}j}Ks2|juJOH~Zs1f_F!Z{=iCJAW
zhN21LhU4KnROnnlYu1W1W}~TrTH8QVu6WC>GC_`-U!u#%(Waa}=jm|SDh=G?4U9P~
zET@4L1%>INQ-um&DUL&HYVqWYR@O_p5=RR`v`PlB>N5$^FqEKA;rc?NhTh^&ZL;`(
z{}+>OT7P~)3D8CE`ZE#7S2GdOZ&81R-jA2fDpgjq74nwwLLpB*p;*UJ#>@^vKhDAe
zbR7pLk=o_rvN&|9(nLU}86tGDLeoLq1w%J+_jUv8N1&H>$)3kv<d96r9W-r7mV+0v
zU?EktUU34w804D%;4^f#-x46^-zQYiP+|-&fwAlz2J*TA?is$DDA`+isV!FChtDS&
zwaT2=X1ma~KS8~<T~NKtI*v>l_pUV3qHVv*k-5C&lzLZ~dwVY8fx~Wk^t-y>95~!g
zFzrC;wt>TCv-9~`{KKCkvvB_Nx8ooF+;&oel9EFK$HH_4*S)$3_2GmYFls_aTig=D
z>b&%Ror~X$O83OpVoF*I(EuH37s+q3dk*mJ(CX*VVadEv@lM1@-QrZRQVX%2NN*Sr
z=?J{W>4^%51XFnp{!rQmqG)U2HycG<0XRtx<v_H%*u-kJT9}X1=c1i51t%pqt+{A>
z;Dj_|9kikgOMbB#x|LuWi`%gFp;l@|TVG7ZF3`78kIqFSi%t!D4?@3z@*^cXgf9Z4
zhL;_pnLO%#7_V4iMbPA%jSAj&g?=$VZx<h?uR)79xI`B%_<jh#$1%R#H4yCzV0XcV
z{4$ngRa;2e9fS?Hp2vRbD)0$V-<U{oDh{XQm$3UXU&KxB@QtXsxPVI733myz1bIH)
z59b(02(?$#>u_|Tv+ROU@amd@%rqPgmz??LBI?_{WH)Gj9yws&t4JB4Q-B=8sP+12
zw_C$WdwHCe=hH^-Ry5KK7p88U3S9iYqWxnYO9=f&9`o*{iqim*3DjcPibnlr*j~#p
z*V2miC%z=A@D`w8(QZ+%hC!CTqWwdnaI}YT2tcSZNK^q%Ei4<gYl}^L(E-Ivcpr3X
zt!Qt<Df*34zT{x3LJ7^dOzEwd)mQ+Upom+_i|LY9d26)WZiaqdCq;uUBx+ZwS*_=l
z)Pb;^;6mUUHQLZJ7macXs9Ot&{W_^0IL(ruU#^lo?V)Lqz{#5>SxSmwp3eUe@;RC>
zxdHjdKqQ88o79H#WV92=1dxBRNgGlVXUi|R=%iav_<i&XjRa1EPJ9A~skRbWzN29;
zsaJ^Tg``rD99q{36{xyl>+U^=qTO|;o>zxa5;8j}g{DhbGa{=ThV|g)nVF@frRn-g
zSoUkveq(W_<eZ&B&S0h$T|y-o5a?1qbl^fj?OM@xq)#23y&iPk-B>6lnxPck%oVbk
z(8ocZ(>OPBftx9Z)e4#z3GI345Vo<l?%E#hheTHMN;wty`Jhhn@p!aH7^{34S9MqT
zy6$L8#V5hv8DK^!%)h(|tqwq@z5Fg-^A#T>CPCQ!#j;JIGN&Q54K!u~(tK32jwW`)
z9))fQ>I*CIIAq5!Vg)WFK$?Y%$WR10kgF}<P6tbWOL^?=Swvd^R=fw{3fe9^PKdNi
zFp9Dt&O24xt>ke!1Fg_ucrT<XiPIPYE(lZhcr@hH&bF`}EZQ!t2-Fr5=+;UubRx`$
zc4N_jRf4=+2xuTtAuK8CC^-v3>lLl&qPEnUT}4w!Mr{k~rRRyKXIkEqTX05d5N)Ns
zPbI3tdmO$3KD-JKeAq^{i7(^cNf-t11pbs?T7F6SHRZ>=?+ha4+w|xASbySum;U@a
zRO!8g{@jH+ygTU6r*JSNpU3L`9=%c<UJJVzynjW1ZlZc`z@KI`LhbR`8?cBL=gKdg
zE5Bxr+nVEc=D3YHu78f}p5uC7&vnjmeRIw70jhz)-3f4~%8!-LFs$X*2|&L`a5JDk
zBDh-wa*6&h$nU0KbcC!&XUqza-$1_@WZKuqAoJD{@458ha{BWD`osDDkh0K;w%!{E
zN!mN;?Zqq|Z{P4<PQPePr1v%YLyHT%2o5jDTfJ$b2s=>GE>mfk$-9cK*xp9!DN@KX
z%6vj<%oLFivIHfgsaU0lob}>FqRKteR^y0ll?z?eRzEtqMo7KtCCR$tFBe2P*zF?D
zO@ey1q8&K;w<5Fxe!{j}<McO^{DnaMu3Yfi)_t%+b-Mwp2H_4^^MJxd%8Z-I<q>q~
zD*+6dOw}I7Fg!-uo2yQ~jo<f0({~`k*&z495(;NM<6&oI30+d~3<{Ho@Qyt7H#uAO
z1rpf#)qPO%nBD?E_=z6*qT$$s7>Krz<hP<Nch22@4|U_x`GP4V@9M7ipib}eqP}Q{
gq68a{9r3^uCUKGM25m<4;Z?zEwC2d+YtB#qe@d(r@Bjb+

delta 11998
zcmbta33yaRwx({nJKZ5<Pmpvc+$@C9>1>1mfv_)vK#)Zlk)=CHC*4ib9g+?ZM8h%x
z#0&@(Kor@TD2jqT`d9@-%%HNVFt{*+qRwM{E^mD3Q{V8;sp{K(Z_){I=KJ_A>8iiZ
z`Okk&)vdbsesMbJ<NZPErRt3ruN+iQB89)pexSx$U6XAquCO>uY*x41nmyW8Qd?<t
zx@)pas_UxUu8PbOm$TIFw!54b_IHiD+G2OQJ&Q<!id?0WHNEKuLyvlsxX@-Vv5A&y
zt5{*5XAN<>sw*uOVtK8ly0k`2uc^h(8qw|)En;PDh1;H4T#a5uv%So07Ojh_s;xCO
z;HD4!U1F_ri*B0*FV+xd!|p5>eN<}15{pwTwu(+5TWv29>C=Xg9yM9wSXVU+w^UYD
zSO+!Pf@e3S+u|A*ODxC!>nxiZnwB*^3g*;)bHn}(b2hzg3!OS3BTCKUXIz155Qsq|
zf=3T{=wDNWK52-V(pm>U^?$>vP?P1!(yk-*rXrWyDkaAb8HIn9Rjz8c#p$l76HD!7
zW!7q_AhE34RVl^w+Xndv+b)1k=WGUBkS(FemRM9<Y@uPZdXZF*JyJ&m+sE|#;Rbr)
zQ1X-sX@Fdb$l7AtQ+=dd%^2?#%@tN>Z?g$YNp#m$Su>&3OXgXtv4)&3w^(X*TdOPW
zPH#|Vr#N(om`m@Ej<LC2Vr>n!TYbe81Qun*z<z@3zspJ5cKZluxOYhh4RHBv=@!2M
zn+68|K*=m){Vp^E?Bg2ybegQ+&~F(OkZ%~TZmksm!0tUsFct5~?CK|$K&M1U$H`Rj
zWvY>Nh0D6o2_3HOn__~$q|6NS2@_gc?Wz*ZkK{foE~=rwbWasTLJuAqUOypQhWBT3
zV2#~b!cxIjjNY&WNDC8|pvwuh=W>b*EEToZ8k2~L#bnoH`7#&cw;+>E-fGi3atNVS
znLSi0n3nWntezC01ehD>>e7X!#{?PdynDYy#@|Ak`}0;6HR>}4=LOW|nQ^X#)&<sT
z6E3Y-Y=J7BhV|&#6%#Awm;o0;zwePqL>dv_Ylt`9X1`9Ma*Hyhl<gqMR3=rjnt7Ef
zJP0WG2Vr?T9!3e1P{OH_gna{4IFK9yq{4cLYM=46U@vRQyqX2k%7GIdL@6AMQ-s-%
z_(M+fTh}UzeOX(YB+Kuq5q=;qD(dq|K7CL>Rmc$NK7D!jGCPWHE*yf_A$YaAOR_{t
zk}`x4kq%8Yc<Kxz2#rch7P3O<*~I&_&w~(PtQlOIq8xkiSAxxCOPnwQT6YrqP|w-q
zG+i%F>&Q3+H7r#RlDWjB--M2%bCV7WXIT2wYBTVsgOUy8JPM#e8KG-UvcZcGRT!F-
z0HJV*UlW$z8#rtLALgAQf=RYUI<E6z&+z2?*G3hHMfY3v<R54uR$)OdqA$*GQ&J#W
zkd?P|_uc+0?68DeDsZv`dCZWe0RB2f==_}Ih!foZG3MWKl6d}_n#Z!C%?b%&anVyz
z(Vna6Jqe9WOYv;zZ5K!!b!Enr6l|b{#sZ<IK$Gq<B_qi=!5gN$JRFpJiKFvV^VNj_
zi=tIIDLS8Xday1rxlvPGTTx+kH#L&XrdnHu;|Px8sYk~D!5Hga<+h*@4%Q_{Zueub
zJhn27_GyN(t%Nl;jvma}rYi+n&|S=k#)QM4bFqcpJXvjx_B@sQtDvjqxGI5OTGvlK
z7IE}Szh{NV1YCbL6DDDc=V(49WG#w7^9Lmeo0(Ns9BX0VfWF?oq=5;-KGqkC(yaAL
zLw5``(9HwWWfqPrEaVm>%Pd?}^qnb~DjWB?qVMrRS+c&{ioQOB*Qk&Hy%v%}&kycR
zy3+N9nL1q%(*<bvDKz;9lSCRhEK|w)PGKK<yD;Ai8b2g~<RVB4JGY>FgyRC2&l~A(
z+A<`Kj6xKv4M_l8Eqp7#R2yqqZ9K>nUp#aI8BHT{6Y0&Ny|gyYu?+0wCYIn2f7<3K
zb~I<{{Na5)8-~S_Sho+y_ePEoXrPCO8_A>cz}-Q#`-pz+pl6RTk|$fCkB%s92c0|8
zNOreEuN!$p02fL6erhvBRziP2>U-f>5U-_D)^dFGBJw_lroVucdAU2}VL2`Z(dA<@
zV{Zfu>C~9M<Ui$ZZ-Du_B)ZhB)64@87lP=FvC|{Y$&53<N5@VkbC||`?#)oes6d_T
z!*kix2!|gsja{B+?|oi~6@9I8MGHPiCw=I$`(UN^))L~_R$w~K9ygsvOepPOXdw>O
z`G(RP69%+{Hcm_@la**s!$d-eNLNkTMM|No51m#tLtBhI^$wA~Qe+fF6%&6xG=$Uc
zlb357dG8udc{Tpxk}m>CgNlAS`IzvO3KJAO!P|86{%P73d{{UgHf0uZG1-nxnWlZ6
zHy;CQnM}IF*x)bEW%R+RziQv*sJ9VC&5>Ho3h;GU<=HqbSr9%#XUTe8@2+xOD;qoL
z?FYt;s)fEr?L2GULKmDF+4A@|geOke$&C5k))qT{4?WUm5^h6y)N?$pqK`e8qy3rt
z_^D0&yTQ!=s60PB_?94O)W9j7-h3!d!<#qEj0^n%Mp|ttvzr_*s%Y}e9GzE_!z%jl
zOjEF4-KC4;mWr;ODF!1H{`R~&a|F@$f)22qLU&F!v8sH55vB#R=4l7=zW&%3W()VG
z;$;Bj(JyC}hmYs|W8pst>pnWEv46KnluGKL+h;G=R&kWm=iwDFFi(y5w{Sb}E8`X%
z^rYE956;QfuHx+tiZRRC7@cnn-eGj59BE;F+PVDKSh{;|60y?xCDFt|b9VQPA2MX9
znQsKxQX|RlctuUa%?9!(aO7KV52)#gEk@0sfaZP$&3%5FgSGE*R~LO05r0lWaUUeA
zE;-ywv6+vSSYfDdTSC=*={seKqu*F!$PaQN-*F<Zf#LsB5V<8M60KnwjHCxk^EHSK
z)1bDJPPgtx;!uf1;^h(}Y!45XnnI*0pQ~X~90IFZ%&L^J3~&lL$BYfuPUj4!G6sm9
ztYDC#xr+>otf^iZwpop2fr3G`hUPk=4UI&^4N^6FViQ=t%JnHTQlU80$C{0aiCWER
z;TWLG?lAkxOyrri_5)%w%S~i|Ypi$ersiUm;8G}3!QJp04zcBF-{tP#MpYQTMWISX
zN2+{ho9R_#qCK5_qhN6h6^Su;qq~J(+9-0_o-T9=hHYPlPZT~(5(S4zq8v&#3Q?T}
zUv?OUR0b}PiiF#O!#@e}ZyfLkBrGt!x$}&|fX;fn4&d>f1zRdi!o!^f-vn@F8?bbH
zJ_hu^Ql$81s}$=RgW1$u6O8*&4GvfpET4NfJIXOE00xcOyktqhh3Um$`iWC7yriVJ
zFPP286X2<td6MSi9$+HPN8P)e*4vyGf?F6^>s>ncP>VCA-DN2u-fW%|kki+}^rfnJ
z;Tt8VTb$D=luN<srk|66*4HO!L$yq<5IVmmUxWByEvhBay4fKugC4|6OAAQML?5j-
zkSrQm>0i2xS|-(LaMPQ)k)%om7LrujiJa1Xj1pq+WmswPOx1R{bfHu!0U1?j>HY3_
z;#5#_a7t&uO}T<nshm<Hr?iGqLhLF9rP7Wm8K`c7$-8z8SYRYCDH!b2%GZv4=&8-x
z@dk`K8DNyObl@my=@_-pMBeKp_AS8P>?C&lA``jY8Y@lA7SN<wq2C_Aeyq}Tu{u_1
z(K<FUaX^GlJ~8*)O~k0hQC<<#7N-jXbhwoIHo|#y+2UAf0nS5LZA5$-MvZSh>OfsG
z+hUysJ~@n!RFj!t#9Na*02>dWj0b=NO4tBtu4K{!b?r}K19dM+^YY)iB%RhS%Jh+6
zDJQ=&Ao*3B(}k@{@@$k;0XRykfIW|<3omsNoAQ`ZIN3?;9>BiW8tWC1F0E4uD-;4Q
zZ7tyUT)=OcfNa3m3IUhiMZkGWLo=0I#mEpyG;G%4Mkmaf<G<6fCrQyEiV6v*x%Dj9
z>T{5~Q23Q1rCJAOq~%AKi#GL+>=5=q1F<H=N?F!XQlA{*XnzAaba}Ej&Be>pg=tC>
zlj-s039*yWMVtEkdbyFFe=IXsx`!i*9Sa3f{`||z`SD)9g>tS)7Zx!`zOBXN5c#SS
z*x`>WjKZ4M{78K^nJ5=$Jfp$3m3$sN&j~bhf#98rV~<>*@plvG^@gFbEoh^S0ysl2
zD&uHT#1VMd=9THfXUaHQfJBD+5^#G{9?L0zEQ58VD@*hp9tUE7mB(=k;|TF5njLNS
z@)O2b+`uQsHmXWo6*Wy01Uz7k=3RMo<!WPgF8`rCn8FJutF0%#7)gRN;Q~1FS@3jd
z>ouERx|TwZHYX5xYW(;T-5}0vU{`!d$WF=m*uwN;&)%+hzIZ&I=*Dr}*sfTr(N`e?
z2?y2O7bwsjQ{t)pi6Od&IC6$$k)Pl{h7r@D2hd~K!Hk_3V?t%;MJw;dj={;^Go-i8
z3=X728$UBU<Oiu=XZO;r;%*xlLG@q3-Ex}S;G1{#+_-~&w>Ocl|3i{)8^>?;<F_DQ
zy7kw0#UyCGb8iVV<vm_{IsK7^;ir+%-)znZxEp9eSA6Lp8Ld{1vnZ4Q-f{*U@s;B`
zMDT_@f)i2%cy!#ou9xmB9>Etp0>pnNkKhE0K-%XW<D+GCdzj6c0qMdv?@7I&3sn$<
zv*;f<vCqJf0Ka_F-jNeqygozQJCs#>FM4rZz8c}l2$z(-b9Y|GfV}RdPi)W&<CVO|
zNWAF%>r`Z<oYyd*;azGCbOz1UmUCWK;8j41<(!6v$~Ss#wStXac0f+6LaD1MUU*zd
zszD;9{t}{JE+<tlCpBneFKsg?wU>#7@Lh6Z^&Jy4(5y|ZZ&WR4(0ilGZhfOVt0a2H
zNAz#t`3*VI6LO-_n~P(=K)Y?$QQRzi!;Jdw2VaEJ&o}1?@E<-}MZ=%TLpsrMND1_l
zr$Y3~d#}EmFC@~7E^aFHZD)GWof}zM(yyA*rF(2Nz**vPuAkhJMCWd_O4S$Lt;0+k
z=z*t0!<F72rhk6gK#MnJs@d(5uHQ66@-$8IgmZG^Gc$CLAXB}gt{X0s^yDTLo%B?y
z<a^rPe7D_oJmZhN?XKh5Zi*?oMbbk34N%wwzkE}a%6aa1Hdl9)^E}LWGW=_ZmzdIy
znBoJqit@ez=flU{=#gy(;hK`!hm4uHwHvu2XZ60E)vE2|b-!>{|I1l@2T|OXvwFWH
zR+xe9JHlJ#PEU{Q=qV(Gp-{d8?GeV#hW`!r<HGP<Af+=pOtxaI*;yJ}01a(we#5T*
z!boP(SB3@DzDq9@K%>5&2JQA|b|pEZ!#XIsoZWrAo4A*^#RgSc7SWb%g+8v8j4SQ8
z-B;b^5=pG?{5?tZ;&xwkmv`()41*WGvge@mz>XL?Zf`XGaEJf#*?#VEz)qjXX1~W_
zstfRgF54ANKV6qbkL*g9Vr*uvr3bRd*dnj<?qRI>EASp>I!$XfYQ1}yeEPfQrBEaI
za_PtBe4RF&%_dDaq>pb-g0RKEIr-UB`<y|Djq$b0p9_|rHVO$i)PH-8+3-SMJLs@C
zjY3W<G~M;W!gk;pFB*kWt>LR*94y2@qrP9SU!e#jvalAl^U%NN{&6}B4{|Ou7Ul52
z^_WBm7@6hSzh5noN;?0KJ>i3)6b)~szr3s$;938=cT%PIA3=1)VZCSW0jm((5KxdS
zub70j%#E+S8p3IRk4b?4;M)<p)RQ3WM1YCCIBW>_eBjwius2Dc*LzY|<a76+-hK6c
z-3cDlapo;r9#kY6ITG$Ed2OOV-jSk8@iyc9^KV??tFqDoO>F0i?=|GHdPW?M6NJw>
z@7kjY!q<M@(0cah@Yv4-il9Gc6z(uuJ`n(4cdUOq_)~z7icqW{pND&T9ybv5&UDdt
zPM6KEkJaTwu!_!N1{KK`(MX0T<wOP{h4jFoktw_d2DFxBU|>mD`hPh&Lx`P@UfSHM
zaX!puj(zLabb9La;CA3RA*x!#=e=3i4*WL2S9rtnzHCGq>{OXe*PqI!Pn;Rn&e%`R
zqzju`x$+EnYZ_?>zqKV@c)k^${@Aj;9r$y9P8W_bc#L%5^-=2z-?i*G9uo=wkKvzR
z*1-3da8{x7U(HWT>s)5no*k?Eh-daH^P{NvEHrXC!lQpXjF2x`YQ0TuQ(Mq(YU4eZ
z-&sv!{~0i~u5<n2leeTZ{^y_njG!N$GqnTnem;l9w}wA*zL5MAqt^6iQG5Pz-bG^b
zA_J8Y8Yn~q5t5*Y!(7u(Fa6}Xa!EymyhxlK!IKKOwYc{qN$djwt>J6xIcUvSmk-dU
z555&1U>15$8rHcie0n)cy96ER9gESLA_*hW#==NC{mM*XHM}f4G$Pg8)G7%odueV?
zds+BP8Tr}s++X4ev3pKmok)cDB0Z5G9U=GJV{^N!Y6fLzS6QoSva0IbHkUKYRb5X1
z{_(v@X;NpY#chGFkntPNEW6cRhKTG^R|y^e$p>-W?3I>s>)Z;Lr4&9HZfaCj*q!s5
zsOj3MZlTu7Vr%JK2B@JG*Pf^^#S?u^qo&$gW`{S<k2X2*wJsd>Z}E;`r=`-$d(s{I
zK@`V6RA#1ahHZsysbdy=3gUPOFJ}1kz%d&yp)k^+!^>-U@!%yFj&|(nfrGt4X0MLB
zz_MEJ_&?YNIQF99U2v&w)S*N6-6DQ$%v=`PW)|626ftK-%ux|@Qp6k-G2=zd@M;Gd
zEn@bHYHdkqf$<FmzL~bAw%LrVZ6#+qSEvWSj4FO{;<$qs{6K?~#xEo|X?!Nagn^gm
z@E7BZk1ZHyb|-V}!;S{L+yl=TI4&I_dHC}-Mv0Ft9Q8oZF$*u(;F1J)F!-|wCZi(*
zFF)bsGG3lWO`y;=e)@xOJ(50gy;&F<1^dlZmEJKp3U-@`bn%T0%}#vqQ9xg~G3fsR
Dn@rHu

diff --git a/docs/RefMan/_build/doctrees/BasicTypes.doctree b/docs/RefMan/_build/doctrees/BasicTypes.doctree
index faa49b9be86c82fe3d1c8262696b6337ffb89e27..b02455b75e68cc37ea02a81e596d73888888a30f 100644
GIT binary patch
delta 148
zcmeA?%6RJtBTED8RR4`EK8$LP`WgATsro6Ii6zMy*_ryqMalZfMU@35`8oO}l?AD~
z>7|K9DVuv3x5p?bWR#Q?6kF-*mzS686;zgF<mc(-7p3c`q?YLyq!tuUj*fE|mw_oN
t$<NOz*2_#SNdqaGd^qk3KTm3IQff+kW^Q77YVnlL$!p`CHzjm30RRNPIBoy{

delta 194
zcmcb0gt7A|BTED8)Vhr<K8!Zu`k}?CMaB9VNjZsm$r-67C8_!@`N^fZsd**E`pHF=
z1ts}8y2<%@DVZgi`FV+8c5z8jVrE{+<}$|ZF%l9PB_##LR{Ht{sRhM)1(hWk`FVQz
zMd_1$<J=Y1V3H|`C5b>?$=RtzdYP#uX&@E)Df!8hSI1ou<IT)XOizu^$xlql%uAor
f!;+Jkmpx^2U%WFfPik&bYDzp<LGk8u@jXlcD|kw~

diff --git a/docs/RefMan/_build/doctrees/Expressions.doctree b/docs/RefMan/_build/doctrees/Expressions.doctree
index 7f983f0ab9a15f90bd410c50cda93d3170ecc200..b792e97d0b36a73d7eb0470e675cf3ae422c153a 100644
GIT binary patch
delta 147
zcmcawv8;lnfpx0%Miw7NH7EUy{M=Oil+47E<c#c0{o<lz{p6y`f|C3k{gTRpRNeH_
z#G;hVJ&Yb^3JMt|B?ZM+`ugSN<$48`B^mj7dih1^`YEYp`UR;4#gpHdyNk=f6qV%X
r=M?K@rk13E6ip7XxWdnqnwylG5}%oyn4VfZrE{{KrSs;AmPeQXqBS=O

delta 192
zcmXwwu?_(-7=UwfHdeV!EH>8-CpHoyR*CIW?eE&?wN3jIHV<GsUcoLN!V9o^7F=Tc
zlJEPj``11^Rxh(#I1h$Pvhd(M5i3PC6MzV0Y}hsjjh--fuxM0=8O<e1qiM+=9hDmI
zyI|UlB7tcAfDjAT$M%52=-9Zdc=sl)_Fr;}^n0-lxL5+Ne+A)&6~q3sQI|Q*AXSEP
csk8GbR8nuwMKc-IYml#ir)A*pY4WIi09P_dRsaA1

diff --git a/docs/RefMan/_build/doctrees/FFI.doctree b/docs/RefMan/_build/doctrees/FFI.doctree
index 8b44e1ef0a847b61ab347194b4e33a8f9c59fab5..222099c8d1ed12db025c692e6dd0577d7aaef197 100644
GIT binary patch
delta 161
zcmcbxie<+t7M2FqsmC|6WHG8+>1X8Urs}6;CYB^;WM}FZ7bWW_7gZLN<mc#@R2HP_
zrk5rbr4(<T!f5xOF?Q=^Mp=FZg^ZGtf?_Lu{qpj1y@JY;jQl*k{GxRIl+-f)g4BZI
z=^O%#?&2~qRVDfPImLRJsU>M3RnrRu7_ad2q~<22ro?CFCZ?wrPwAW<CCKQ!eXStl
GVrBr*Svpq$

delta 183
zcmdn7isiy87M2FqsmC_5WHG8)>W3Dm78UC!C1<4O>AU17m*%GCl@#lzXO?7?Cg~>^
zRTh-w=WL$JX!oD7Z0i+9S$+wLjFOUqVk>?9g4BXyy@JY;jQl*k{G#;ff&z^0ifS;~
zl*E$6lA^@q?9?K?%+!)JkP`ir{N(BR0*qJ0cr$Yo(^KPf@)J`s^U|mEu;gUsWlxzN
ZB*^H@%afX$l$sI`R#Citk|5(UW&kj5LR|m=

diff --git a/docs/RefMan/_build/doctrees/Modules.doctree b/docs/RefMan/_build/doctrees/Modules.doctree
index 49bf0289b1b12bf3373a07308147ad92771ea3af..8b613321a349888b0871f7761d434efe41992d84 100644
GIT binary patch
delta 178
zcmdn`l)3FGGfM;O)as2aE{tk+`WgATsro6Ii6zMy*_ryqMalZfMU@35`8oO}l?AD~
z>7|K9DVtjuYhNlTWR#Q?6kF-*mzS686;zgF<mc(-7p3c`q?YLyq!tuUmVE6lE(23k
zlAoVbte2Tuk_J*Vx$*TCexB6aq|}u7%-qEE)Z!_fle6DAZ{GLDnU$%CZ}P@$MfMEc
V4C$<V5L<4t=O;tP+{x9StN_#nMXUe-

delta 224
zcmZpB%DnX{GfM;O)Kwc<To`Ra^h1kNi;DF#l5!IBk~30EN>cS*@{>z*Q}arS^^=P#
z3rg~Hbd&S*QZh?2^YaqH?BbH5#LT>s&3TNqFC`>0N=gcft@QN^QVWXp3Mxx7^7Hia
zi_#}^zjjwtgGr_&mLvjoC1<A=>1C#tq=8iEr{pJ3&U}4Ej5jkkF+DXtCqFSIGcSEg
z4@*vFUiOs9K5v|Pc~WzeQd8o=3W_)Pym4b?D&d=~C?hxdLjoI%bXFmRBlXFUF@Lhp
GCo2FM!&S)u

diff --git a/docs/RefMan/_build/doctrees/OverloadedOperations.doctree b/docs/RefMan/_build/doctrees/OverloadedOperations.doctree
index dfd0f3dccdc313fab25625daaff5a0a7f5adf8ce..11e0aa8fe68801e33f87cbfafab346e9ec863ae6 100644
GIT binary patch
delta 147
zcmaFjwbhHIfpx0ZMwSFdHE;cl{M=Oil+47E<c#c0{o<lz{p6y`f|C3k{gTRpRNeH_
z#G;hV3m9|d6%;Z`N(zdt^!3Zj%k>H>OEU8F^zw_+^;1&I^b1l8iYKcox{J%e6qV%X
r=M?K@rk13E6ix0`yu#0unwylG5}%oyn4VfZrE_w*lJn+MO0$>%cpWx)

delta 192
zcmXwwI|{-;6aZ0Tr>&-wq_8vFi=BdyUeHR{-Dk37f9$>#>8!;r5o|n!h&S;F9>fpW
z4b03VeWk&nb6($qZEH%&(u4CP-$|-j4v0YJhLs95dcs^~(a13~nhO+0(;s_uRA{^(
zTWT1FIimFwLM&LH*a~x_6XUXa5G|t7Uvi4{bFl(kA^`W_f^fs?GJ5uVLeUI1(oimR
a)|>(<bkWqSc-HHJ+5zAE0)M~6*Y+D0;YY;)

diff --git a/docs/RefMan/_build/doctrees/RefMan.doctree b/docs/RefMan/_build/doctrees/RefMan.doctree
index e2176c85537d4dda049c4e1b40924573fc7f6592..1f815ddbcabdcea641ab5a102679cd85034eb6cc 100644
GIT binary patch
delta 147
zcmeAde;~%vz&bT_BTE{inyr3Der~FMN@ik7az=KhesNK<esWP|K}mj&eo19Ps&0B|
zVo}QGWsDAN3JMt|B?ZM+`ugSN<$48`B^mj7dih1^`YEYp`UR;4#gqTByNk=f6qV%X
r=M?K@rk13E6irU!xWdnqnwylG5}%oyn4VfZrE_usr}O5;oNpKbLW?#U

delta 192
zcmaDL)-TS|z&f>MBTE{iO|X7wacWVqenwJGVqS7aYDr0|zDs^`X>Mv>NwI!%QDs3%
zevWQ(eqKsuNoIatBA8uVQk0mPSF(8mqXV0SL`F$TL9vy-enDzMv0g!CNk)F2UVc&f
z<PYrbifS;)l*E!mpswWX)FQpi)RHui3jLJ)<jH;<SHyTTa}(23<8$&8Q!?|?r}VJo
dWaed0nQX}E%*&ISo0OUo4^~jTxsdZcBLLTlM`r*4

diff --git a/docs/RefMan/_build/doctrees/TypeDeclarations.doctree b/docs/RefMan/_build/doctrees/TypeDeclarations.doctree
index 6741795089dc697a76fe38fcc58caa1be8fcb04d..e97c9e74421c96c0498805f8898c3bba877e1e10 100644
GIT binary patch
delta 147
zcmccTxZaVafpzMVjVuw2YVP_O`MIh3DVd2S$r;(1`o%@b`pHF=1ts}8`X!YGsk-T<
ziA5=!XE5eSD=1`?loS+O>Fbx5m+KW&mSp7T>E#!t>!+la=@+CH6i=3sbr+X`DJsd&
r&nec+Of5+RDVp3Odxf7TH8&|WB|bAZF+H_-O6TM}Ip@s><z$%vn0qz~

delta 192
zcmXwwy$ZrG7yzl%%{od!6kXhGc5x8}M<>BWN}7DOp=lD5&%sTc1&7w>5b2}n?6dd-
zZU=XFo4scKv3Y&m{f#%>lC=ZtNR~*dSO$nd7Mkq~Q0NG=2ZLIUnO0n&(2D-pp`}7$
zeez^C3^PRICWII;E;0wqw2HJ%%XV)$9Q`GyNIw_L!A1gb_bmw5tdzZHClCcqA(onQ
bq0;K?OQG_rT=nNc3yK7I{0m%t=?@xjK*~o~

diff --git a/docs/RefMan/_build/doctrees/environment.pickle b/docs/RefMan/_build/doctrees/environment.pickle
index 1e4de8bee53da6dd32afb69d2a4a2a106c6f4262..b21911b25cfb44c2f1a9ec4e7622d5c683b768b4 100644
GIT binary patch
literal 138808
zcmeIb378yLbuTWBwwabjqt*LT@?cw%H8Wa_H!Ne>k{4u+HyIn-a(7L4&2*J|b62-!
zMp%GDuq{$x6Pl0(5+K0|TL>W`2?>F`BoN{dLdZ-0SqOn7yzn=Wg+Nwb-tU}yYq?d`
zJzX{3W09cmQ%`r@Tj!qro_p^0npJOExor6|`sZx2Yelm%H*Qo;nDuI<Y*ZR8XTwcR
zvs5?~c=YDhj>lW4THBo!dac%)bTWl%zEL-ff?01lH%%0)Wn-dX>WzHyxH)0h^Aq{{
ze63L}O*H0f#@I|#uNUkIykk$?V@w~>D-+o%YJwgS7`x@H##;<+Z*pjOJ729#n=>tE
zSkmMEUVXDD@CX>Ho-pclvw${FwVYM9(P%P3#$3aw*k-k2w~m3%5tlD>jqygcP;L2~
z!jrPzC|del%Q-7hZN_XAn^QG?hRE3<3bOS^A=@Y#Wus*{gC)HJR?HY+;Fe;eT*}sr
zdRZ@-mE(5S1ja3A#oxd7@s_iuR<Bw{9+Fsdv*2UP8Om2{^L2Bkh^J@m-Mx3uF70U1
z&}6xG)X>XdgWhZus}RYCXxSRjP4u;#Wq?~ZN``J5cxCVSo;~BcTh981QLdHrhGA!G
zAP-z{GFk6gO9yMK&3fL*+Rf={6SS|*S4$;e$vkt`-dQggb)#_51m58GJuPSDc-?Na
zCT%BE*6oH-&qCU0P-p;fH0JW9X2GE5P%0U}T4)9cK3Z&+r|j{<6uyriyf=Gqqgp36
zuCL9{ke=FEyD?uPW@ea~g3ZNqoDKZbZs-j&@6ocJNSn)oY<`!7KO!ChtEPAc!54Qs
z=SiLdPY_he8_?ILUK+>iEoZCC@PqO#Gy<L$w>hiJT&>jrtA_9$Et4h)m}ljM9P2Jj
zS-JSqV|Z6Tyqw<Jh!)Jsbd~s|V02bIMy=vYi`$B~JKCKULxUC>8nilJH*18FR-M+Q
z8jZs&j+l1dC_w>@YSU&MGe)gBm2H>}u&{Wcvx$GYBAGTzjJvbeHuQSFI8H1Dikrw5
zvSvjHj(*s!r=0ctZr--D-h1m=2Fjyheq;qI4Og0FSZ#K?3NvW1e_3M-je_#sE52!$
zl6OG0CZzAIxy76r=SQm=`V>%i29MHTew4{q3&z+~shU5I_wO+6hFO`RlBTozgkEZb
zB>1r61t50?9A0bk$yQMV3k&$-Y?R!}`i52<byhOrRPmzX#l<3hxuiJCZxmltyi~lp
z3XIU_Tk^Rx#6PpsWhlR>d9L{DtOaU%$;iUdk!Cn+#BaN$3qa=xGPACuV18C~cn{~S
zSJtc5#;NgFx@D(c372)MC0^8K4A{_IBdeE6)!FQH^W@3-Y@@DMZ0I-}=xJw-tixna
z6nBd^2MH`&rhHP|Q5+LRBhuhu1JwdJ2|H{yrpK-sv&|XNZgEd>uc*7OU`*@HQX^Zh
zl1Yk(=jeq3aH+75fIYyPV5Bz0@RX>qfhv@%g(i4HWO@Y`HtJ>>dQojustqISnN8NN
z>3O4dS~hAIL9Fn3wtQH;YLdm|Y%0Q8mdIgx>;%Ilnv!iB{W?{)8d4C3UA(M#xqvg`
z`oQcIx(#yP;`#7#!>DCv^?C)Yaa(sb+Ra+6Zom}05?DAZ*jXUdtQ6pc^3`&=3I_qQ
z;7CzUdgWx`Ewe_=ELCS*2J$25W#G{!<_tUp9Caf*UDDCE<mUPsn5Ng~A<eRG!qE@Z
zpp@M9x(fPgI85&BTa%O2-Ujh3(D9u@2@2N1IkEG~HtQu9mBEVHsG0fW^R3fdX}$cN
zHD@a1myd~ex2TUHxf!@kS-4u*yDPrU()?la_?9ggHFP_Nmka(sP<(|zeS|vOEGkT)
z2Z4IKZ*S!1#-m`O>p)y9bKih9xxC3VN_G}KpgBG7K3YqU@=&LG!*;36G;L~ShQc5h
znhl;d9&JJoJx*^5Jj?2=-srm@JqS<A?A{VAmp+w!k2B<&FWdisrNgNXax8@28GJ&7
z1@5EoBx`ONO#yG19qbf3Y<3343x%BcsoSmJdgCC6bjzHT^qj2Rkv^W|kK&&f|D2u)
zN6(#QHlXxWRy<O?P*hsWpk*`x56N!|EL;MhUIscoE)g97S}mD&(Ws+K3qB7x)QiRQ
z5eAPStkN*2O}yZ&X;zL`s<SRY(Y~D*n15ZoHOOx@%|fgAb-@=wU!Fp`){fw#8Pqb|
zM-scb;dM`<s=%UFB|DP+9TybuDc;L17AK2$imHP2Ml~;$bcJ{<(4@x*BBd32Rc+7>
zg?J{|80<X@8>PTN`milbR9TnLv$JM_tYDdVOQ6nf4z@@gp;@7xUg0}*7F{wN3s7Kj
zY+#syV1O7FC_$(RFEZ6cK;@Ne<acK4CiR)*lhNm75KEdTQCTmE28&l0&yik{J9D8$
zGF%h|n*s#^^%5RVlyS)6T;N7hA^_FgphpH&{DO?+fJQ?`DqX!M;z1c53bcl}Y5379
z?3!V(<0sSl368wQ!{X86eOy|6dGUVn<(lHPqW%cihgH^fH>eZ^TLox@xY=f{fG87v
z9(VoRjEH({sN<9l3rF|DkHt&q{=n~QMaNKpmBKCF%rJ!?C)t{Lc0T;7D5IX!A3n64
zEpjB{`VtYbIhzqAQ+xzRT&riRQ#`ET!BCK@0HCM%dGWmB`J#dd<bo>3NJz=lN@hdq
z-f2-^6p+bhMfd=v<Tu2KhgDe=(74AfJd5e|pL>IhmE#TgK><M!PN=}JDk3nYpeuk7
z*|Gbsl(RsH8VeN&aEy@ep(L`N;?25!rYsOzLk2|t*%g<dt=eqVn&`s4aA_5XOA>ow
z80h*D!5}0-a7x_?<1Umzbc58(xg)HBaZSD~na8oXAI?Y$B_X0PY;&Sn!K^G?Qk~rM
zDEA+d=@gL`gjWJuzDxwE)ag(d;PUwbmJ|ir9B0!TMy2YG#jFhS3W6xnFn7g>`)F)f
zce_-Ed}WrL4IWCxLDa#6YGGW?ONxy~&Ax78B44PCTXw-HnJ4Pw6{9gxsg);W-5d8!
z81{=NAd9hbxipq1+)!CEjUxvP(}Ud{^LxG9lys)l?G8M=9X;B^J6eW7-+Q@W+87qk
zbKgAh@IzGTm|MvM1cjhrLkh%wcP}Enxaa%A&)w)<Y6tY<Bz4sr+~+h*;BlrbSmzcr
zsW&_=YHxBMqT8;@QMBxn&hv_VhttsOcuFyc=xWY(>y*foxnl=PCY*cAeRtfUO&&OM
zNW1>fkps8iapQr52k$v_@4Yv)M9W+KS4DyYc>_vEY`NpW<gND|xE1f+amS4%bG%xg
zao<@d$K#b5>du_OS^=>v1j%7!@%rL^R?&>8CHyu&*&v=E4F#oQw<v?l^F;x<2l1_p
z;Rt+tsadYbm{kt=sR{<#1vivESJZD*YbE1^QOe38D2;eTq`XB`2)kp(N5Twr(E}Cq
zF(kgt;x#TJ_l`&v-98l+uPeTUtDGgO1o{Ct65-;t5;GA7-57)#4&b;<GDqo_xj<$=
z(8uN>Uh0Nqeb_sKto-p%7=J!F0#U#tN;nAQcFa14<lf8c19gyga)bPH{l|6VQH;48
z*`lGt{=FAB25TS?LDzP8IpY&3X_#fCDiDQ-3udeJ;{@#Rs&I*3$s<yLSLK3p{8nUv
zPop#N$hMZw)h_U>)uDgzXJvG0ZtJ(+SpNh^)l|25Q}JegXPDAEzQo0V=sbE@){mqA
z5s3>L<>Onm?&{fQ8!A;YL|5kq1lAtcV-{~M-p1fJ!3;PL6jkyKZc!kQ#qXTu7Q`y4
zms#?Wb_U(iwNQnvE`SR1PewyGOUQ{erQy)~4VSKbkpdZK&CdN}ue#)loOB<<T%}^n
zf}aqmv$9#i*jBif&0Izii`U0_Ln&&PLCX=I()aOTDl<o!(z?-Tctf|5eAX;vkv8Ng
z7R|X%Y!fB?(A~t9ZOCUu^mg2shY}UUaBB_nuQL^$2;y(mY2ZFpt(NeB+;NGrenS+q
zn-z?$;i+i2+i2D?NE?<pMpzUEkr+5Pigl=Zma{tOBN+Yld6|>}3E30-+_?XoJZA{9
z$OE_*CM!sveRjT96QNZ!U%-Gja)nqnY@wnKj6f;+@8%3JtsckF<uoD!a#-}5C}2gQ
z)Vy1Et_^0_vPk_@bWm?(r}X@BWS8usOVPI4Jd)3qEV<Wa<x!+eX>3=>(iDKq?uao@
z@opLStmkYZ86enDf|<z3fgc-Whh7pz6g8Vu&amiHDXwiGm3eqM(B@uNJ`qAjyyC2e
zH%FQn31UB?zFvmOeun)nnQQlE2;7;7;t-|6oIyBEk(+uNVZxR>G1e?q;m-<pB5Ib&
zHD~RiIY`eI^9Rm~TW+}>qo<p6+sq#Y^-!)2^!K0v@9Vv@<_IUgQ0S$^*YYd(&SS(i
z*LnuTdP#faE!{bVabe>2c)oRbz&S?}<UK56k^wok265)>aG^;_apbE}=Fa?hFJfZn
z@JeqS;XW1vOVmF%1k2J-=px%pXlxFZQiMg%w}zez9cdk25ow?13h+W0ExS>`<Kk8n
ztroCahp%ZmTV&dU2CERi7)G^DJDZf}h_#WLLh4gegMQB$1aD}JOWo0SXFUf?a3&BR
z&uR=HpmNq3$TrEC7+p4|D)={#D3Ra*b5A>4^H781Sp%uIQWn0A#1Bb7<*chAFGyiC
zr_UVC4P<9$XU7Hk6bDTdj1v>6X-{D4h2B8>V!DA8c3pisAAo_NTLi-mI3|1CG#b+k
zgSrxWpK2@buQw~oP^9>{vz~H>H1y8SQNEpcMIDvhoKl}|bh|IxC{2q2!D(aybmVq9
zJVM9ooW<iT6JxMCsS}1gG{!7|_|3u0mz&*2rknHa#TCv%iCt&d%`ZW$$Uzjp;;dtk
zSvLdMbOzxtDPt`p7&Nn65Bz_>^&3~cb@+>_LCVMf^q{az@$*Oj;ujsy1jVBtKUrvF
z;G+B;pD;aJ6;IxI$(k6`mSrD$gLTcovSsw^x8L^nzx}bMgDg3Ptr#Iv&{N#$td;p_
zM6xt%CQ^aWPB?`XWW#T6y{>gnTetJH>SXXU>SplJqY~d;SA(zYrSMnrT~A}KWKhoU
z6k1jV_*;+SgV1n>F@~f5O)t&r^L7jG4wexrAm^dWs#R2VR!VC4oz<*eEGo;OQqsd_
z!-N`FAYc%>O3Xod{&%RZ&&t#RocLhAh>2o!>FDFFH!}F6H1r0ugtyd$hkad(C#bDA
zQx&DeSuJKBTGpFT)|}FvOdxU~C$PfgU;rIH1;@Y%3cE`9e0&>3a?k%k-5v+>$H1vI
z4ISMfP0vUonp4&^8nK?ihnO*Ego>k93r|47Tk%KbxQckNAF<v}px%!UAZ`6P{sLL+
z9rz1C?-GB0O8j|N{P`LF)3n};zt;Qk0eoiYduM#ky9FT)I(F?AIaj0Ij{HV_nx<M5
z^g2}(*nX57O^<DHVQf8hR#5Yv3Os&ik$9L3<FVBb1++jcpkURej==Gc7m1^_FplTA
zN!EMZ-bFhirl}P)+gB5q{>>sWJ-#re8_A3{B|=hAj42nm{nH|GBNx4ZeXQfKOp|e$
zf|gn&Fj}@kvDnn^MVRr^OkdN<l&Y1PkTYeECOi(g31RDGf)?8m8G*%`OsZzFzK|#_
zmIpD8J1C10#*~xnQrS-nU%Pgyi8US~T?v;P>(baM4^cuhi+o<WO*MZ>4Pqtf`8T@R
zP&jCPrmokDZC)1040$0=yK2I_3TZ{V1?z1@F+0^As))L9s?;meDiutHJmstgCe6Cp
z5<OZ*<QKRjD2@v6>jaP$O};2`lM+%4mjuL%7@~C!{=^ApyLDmPlF>FL*7kM<%-T&y
zn-~z=nqDbr_ZUbfqu*4_A+CZz_GJK^tQ+f+<Id($Ea3uHW58+*85hP%_JP-;Rnh*f
ziQAVTZuCGLWDqI%ZKY)Qh68!b`%u<MyTvq0VP;2*1*yjqliDq-H;(EqMq?P;6Gjn6
z7ZbN0VYHDF1ZLMgFC<toB}CTF5Yh@}<UX3{YbTdTsler##8h=FmJOpk@d$j{O63iS
z8;?lk^=Uzz#*0C57>Q$9N9l(IEMbkwVOc&p2biL^ZZfTQ4Bbn4Z!8=PImf_rLBek&
z=4iJXkr}l;93mF_>xr9<=)$k21<`-zyJMIz^Zn<7`G1?3gzlN|u6c`bk6%vQY=rq=
zOba5+{1nFX3us&LPedOnK=@dko0bs5!X0Y23xC?0_4c%Ott3i<VUP7;FR;95WpBb9
z$|4|7!82M)U}^aw&H0Jjim1{#3}OjGnvFLjdB+{6Of`heG^Sjr+y2DF#+z$|vCgJZ
ztbib##yXhob%~pg@cQbsAbf+lQi!Y9;mn4+FrG2zWEP`}*}b54JJDhx5<M|N-HK%6
zs7S|;Re6quFp})_wf~XCtw$vCP+Aaum&nNNST{1~<>NvEiIfU?ye=_0-O6LbDCVQh
zxlRW1eTf^7h~w31LG)c5oL1KkRInIb&iJVY!nvzpu@K065);&|KsJsxkS@cB*T*Pg
zAkQXlJtC2xObep#5;-4<@{*Z18=U?}z8cfPSWGNtHx=P@tSRL5nZ#svE2j%a4T<L%
z3k)+m0X!oj``yHdL`3$fv>^H}vQ2l;=9dmB-na@vK>wJSsBQ(cd6Xw9#|puz`G{P;
zk+}VcT%J!0qVIAUxd|*dt{te)$W3R8`9w;EM7FN#Q=IE;80CefV_2Rj@rj6IQ{u)W
z;uuK_qVM8ZceA^kLC1oBMHXt25X7~K3F+1}hDW`H6@*Dd3Rfj=IU<F9X+iW|3UE{9
zDrfj6p@nrbFQ%EbMpb*c*h#2JX5s2WTE`L-+^w{>jTR)vV^~Q?7;}$fk2R`ea_?hA
zf)6IfCL+Q6(}D;~FhwH4&qat~Yzh!Q7F*N$XPJxOY4)YdMRb~p4{E0M8(wPShZ2h_
zUiXO7g;Eo5PTW>Rvz}oPOPHG2a2Hlv)6yu7_Hbg$k?MS-#lob2F)^uKvem&TSYkBh
zViYmqpHJL+gwY>N3&J;^_X}C|IxiuY@ic8Lo>zsTln6QeX<{<EmBYGGtmcD16?jBM
z@W+W8j)>s%X+iW|1RHL~8fcR<b~kIhA}{D&oM^ES#&;4E)U7Z!A}Wy>jpfG}qliTQ
zJ#p(1iTq1i5M4_obsG9I1c+GW%E8H$(U>)iigyeMP0Zh{(NHrKI(GY#5Z|`dy@~E4
zU4?Tw1(g!}F^T<{JRE~3@MYK%4L2`Jj8jCY=QD^U>{2$;5-}u~H7uTQ=4siy>c(Qq
zg#d0!Ol-IIvuTueO9Q7dAE$@`y)<$25nf-P7KCp=*9vj<x>p(DY#l8*!s1ohNu+qR
zNU0FWbYgP4703pW$_wBV5l238;}LP>(t_x_I9A+bh9WI~BG~@=#AtWR_LZYkXg9*@
zClfaqVfFW?1<`j_ucu|bSZ7y?>mkC0LI6LTn3!$_FoHP+fsGibMrHB7#BE1p@iS>b
z^j#KPZo&2u?!#+UFd|MO@l}Le{xC6N-O6R_=(NOaj4^8`ozEu5AR?XLOADg!(g`fp
zQF@2Kb0LRsCnlj=IdojY^UcJ~MwtH(X+iXz`N2h`?s`r|3UL*LIL=$sufVmtRi<Yr
zZa*TIEonjYT`t2MIN9@+YGuA03Y$V@LK-(DCZ${BSTBMm4;RTre|5l15;q+Y#5HL_
z^j{G7@CIZ}=5-a@7*@-KAf^(N(!C(WX6Uv#=4|4oBZ7E1Er`AgV&v{7jzrV^eF=&v
zBBeqYPb4O%TVZS%eU$LQB6zu#G#XRAHgV$-al9rih_E<P<m>&EzZlD>0O4cNr>y1b
zBbbQ6Ndby3xDSO2d?YaoyH$ZTqh-;0#3Oz<ahnmz|6E!Sedl@R5c$HG)gQqE!TUc;
zOhmW5Ups2}SVZ{$CyCpQ@c)m}g6KQ{*BqMD>8uP@>Ak0d^Zz$7`rUGV5X)>t`w_PP
zN8&~!Z2#A^Ai``<;jMg!C+5Rafbg++L)xUaoa5w8g-bWb>22u^dQ$7N-h}4WIPkI;
zTgr&6g(ftwOx#vPjrK5zCCombdmE0{q|=*CT6ZN*8__2DnB5>poeuSc;l4aE@$rTm
zVYGAJXfc4}7>=F9QNUxg;5}x+$-Rluh{)isv><#VIwHi_E-RgST4%i!(CuZKdkzh+
z!i7REClgcCtz1S%r6^2^O~kLxCT=?-jE3N3JBQMK|7zL|9P0#cwL7p&FvMWBNU-<E
z5|h|1dxu8_U&q8TkP+toaN?FD%zaB*5Wc4WppZ{HO;0O@^|zUHnz$CP=%GR(iH|2H
zrdvsjzyT39V{H}v*AllKk;Sj11<`j|oO8E(Oqbg~#7d=oH6fqBPE268@;MhnT6vI|
z+dH(C)L$jWA|k0Tqy-U{REjvw5A}p&Oaa2jVu4;Nwe8+jH&5W0M2*)BhkWSzP@&L`
z%|m^P(wq_O5@Kw`l@Boy!-m9dM>JwMEr_mVkv?LW#NnDoL0WED7@<NTjH?q<)2*S7
zjN;fwU?Z(GMi^HnZaX53Jq%(AL+A}~hhm#atY3^43pPKHnAC3BypbXY#;ARdbzkDv
zBaFT$EeK!h?-a7?b@Z?m=NHjgoHK5R6*Hh|Q%A_=vBacxE1R=M%Mv%Yt7<clnNN&D
zL_jCff(Q#JMK9xbRKgxpfbg+cprcCd9Jk)(F7Po=w)2r~>Igk~e_{@IuP5GOAHuD@
z$9zv>6e4=^EQ44=kGYZ7nDEhY@%>Uvx#0I_5)<1kzc=wp6UM1MuYWgj^ATQuDlG`#
z8h%TNtJhBRLeYDX*VHTi;eJv=YSMOrx<Xk0n3&XVg>{h}8q=6euZ+<ep`hfVGg{wB
zj7mgs&!+{^cfoD-tqH4sv0@YVI)zggZR!X?ZO!y6`aUaQRan#O;U>B3PsMLaj6y^}
zBWXeOT|h4i>^vsx(&D-u)xf%YMTqa(#DsTiXO}{J-d<#~wXwKPDQa$4CB`Ts&3$P>
z^j(_gAK<kuxFRv)Btyfijx~ksjwL3uTiIPOs=Ihb9AwPE>%qi`L_~IfS`d8~*|wm_
zJcY*nmu>blcTr!6@A1SWcPqY26!8Uc?zHFmRf*Aw2=SF^LG)dS7YBsM6AtQu4k6oH
zu(lB3yAzY!tpK&402yDHVL*;CHu$c@$V9~V6KO&8U3}Z_!m-&DTplgftIe6BJ2dzD
z!jJ&Fs4qnL>BJ;=E5b`gYXavn+}S}myF+%b7mN|&CljL+5#n#A1rZivib1zOZWp7%
z6d-&o#JD{L2p<bEA)W$+kHvV}d_7@-6Xf`C<aQH~y+1*&&2iwt*?8*<-uj01YkL#B
z6Ojw8Z&;hSt%zz5GKeKiH4Gl&xglH&6l9>|KNe18EHP>EP9(xcXJ{0MY+`l_7)WmT
zqn@3KTa7UE^0Xj)`*@L%Nw4z>YiU=oUN>!w`&8yDC4&EVCnlp?{;%V`z%CvU5lkj-
zI3j|>X+iW|1e@-~g$+n-wv|L&1tE}TVxqbg$mUVH9||c=+N0f8F7?FiN90mX3!?9G
zS^1z*uc|g79tqz6NMgjh<^8JBlhks=3VtYYixF<WIW363a~ns7&G72Bb{BBORS=T+
zSYo2Ol?0tB##qVYD{(_oOfdP;#O+7q@=Iw!^j$6+#2pL=aKmd6yR6N;Y7x<5A(Jm9
zCa7DPY?Nnsz$v*HMJ(kn6Sp3b$e*VL(RYb#rc5&L{cUF|u{DHTR;}w(B<gJOcL9sD
zUgM2rATa_F(frpLE1JQB<_VLo4pfcAe=LNsBQX!UHIAXtf{Q`KC@xFfYJ~HnX+iYe
zC<gDTHgR_#F8WnR5Z+_K`6G!5=$`XPJ_rmVoPSy3RwJChH7$rR=Ti*Q{c*k+7^VQ>
zW3ei&@yc;NUwyQ6<NWsbX$AGndfprAKap5a@ft>SE;Q7CZQ`~fdi5Fx(RQeBZ9{ei
zm*e5WNxDI{&An0GUufsw;K%f>!L6=*YxJ?!_DOlypS+vv3EZ8j9Mew^f;U9c@Ax}h
zsU&)RB0cr?q0kS$HSvj-;jELlB)S)NZ?`@Gu2>(Wj}Otuhw0-N>EoB^<5%!u;KD?G
z4wpdE<*2K0-=JRO>sX!k3gfJtDOIO%Tjy#lRL0Gb_%<wC_8tt1yOVJN=V3@++z}=&
z)O9krOwnf-|8yI*J`Rk8Xnk4XlGSRnj(h){{S(D%*_bHcOyzv>xH)0h^Aqx*rU^dF
zc&4f2{-+7Lh;!l|V;bwS<ezc6%GFtkL&FSEDO~8=sI4@&82WBRDBYsm$f?C(fpj6?
zo3?arB<9XL#ee*p=Rf{WV#4D62NAfC|M;84ZAJXYml#A_|Iz!MAL4idIEl7L7kFht
zUsn$&)z>Z=>MVG4!HUF9NBFxeEeOBI{f-b(uQP{(lg4b!@pS%U!Tz0z3FwynLs+LQ
zF_3KYbGDZ!ZZ*RB7o`Oe=6ni2=etT_UnxNNSo~#LE0+-$U#q!vu2Q{+Q}L2(5R3?|
z%7=tAgc4k(yH@-e7Jo*>pN;${UaN?<crST5-V$x)61OFF=@JjbF$S@OUUFUg>sQqx
zLE`r%Cb3I)I>R{38h0_*<z*X^Gd^=)ow(%)b013!;sQ@T^Fltoc9G%)LQ3!JbYf&^
zf+bQaWbtfba=Mj;JfDyf`x2jsIDRs5;}LPZBQ1!&i{o7P0C;}^rgkfbzG~8-Lp>p)
z-%U(nw<0=k)IIXuUx+y-!gF^%z_*=GB}OA6tlvrtqVK|5eTP0@ZHCU1bRP;ad?PXP
z-HKt&Xi2mlF_7mIw;AF2-=zi7cb*So3bKqbX2?<bj|Ja1tyd%Jo^`&MhR1ZHz#zi;
zk;JV=IKM6}h`w`v?d?biG)&yY8$QKWDG~g?Dlr+|>ixP=Gk`}#1p5*<91+3pv>^H}
zf{PCu^Rsm0G~bDRQ`0Opuokf0O?nH~7NUAEF}dA}N*g^c@x|tf!q}9=H+s*W-(TFH
z7@3Ipj;00Cckx~5NsP`m94i?oj8Z${El^j8?p29N?N)Rbje64J^c&;aNpP=Bj7mgs
zb7?{JU2q%RsO%0C8-yY^B}I#cc;1zmpl-#p(Tl;b9!y{q@q|B-xb=uc-j)_bSR#IM
zVBwBfVsW-N@)0A`6d-&o9!wk05Ejj;rZa-+g)HLUtef6G)!J?u7?~elZP6vKhcgyk
zKX7=HMaK>u-pp$~@sOqv4ln0a?%@>{4doAKn$CKHW*d0`oTA?JR7*UX#<0hKv_Vd3
zWMu}P>M=mfM0At>x19|<U65^5vvq^)xc~^_)u-{7aC?TQ5d2>>m*D@RNd^BG%`W)A
zXqv(QMe_~buck9h(+Fsnr)2Eb(=BJCAj~KzPcwyT8Jo;-y}eGTIm`3>XKlS&ZDj5F
z@>I3dvR(o_oz?e>U*7c2+wpYLS!bJ5bYIAUDO@yw2^07CO-89Yi{Gm_SiqOHfiXUQ
zuE9hC?U!y%TF(LXNoT~g?=gaPPCG+c9A;H2)G-ZmtmO=6X&cPV{*&gEv!*&_8F|E_
z5X`kC+ht8>C|}eoGlp$6n3Og0XRyj3ZjuzI2a-6%i+E2yWOW#Je?fB7^rY#m$k%EF
z()t>#(z*f7SzpIDl_AzY;?bn_PxR>wG4XfS@2r91^$i1i`Ei;Cuamd&WS#p2n^*AL
z`e%OiTl~pPvA&J(r>%d%ClXix#(yv`@l$9zK=3Na&zNJ(Bq`pM8DUFCg15;?@P~{9
zf5=GihZecw4=E!4&~yO)kdYi~HJi?WMTBp+{sRreLe_{wq7-JYEbExu3RD^{>UNga
z$<j=hc%2Y9&F!D&=1+6$r@8Ud-1cd1`ZTwEy6H)Bpf(=>ZEYJ-$X-G7PJYYYTPy4a
zo0+q=R<F)fdCHA(mSn6h=~D)7xWlW?;EYib+_SC%^x~*9Y}blrWp14BiNw6v#_Z9$
zUa=uJ&~sP4Iya9A&h6IKsO^koOZv(AEVgNK1)BQAgc`pOZUHoP3@vBX?JS>0>v5P8
z-m|W!kNxy<13sQ?J<*zavW2<AD%K{DB!T%nZBP)uilf%GsJ1=yuCwk4AD@Q3GxSaz
z^jiYZSK9`i4cD^nz{7SR*WSyOu&WU_FvUSU5`d^68AjRJeAj%Vh<#ZKlAv;HVCzg}
zCJQQY1e`4tGF0g8-gdg%LrFYz<6WV}f#1%c8@jiige~K)bxfIhionvBD)2<hItVhY
zL(C}rB92M6;n%(N>!@3HKm8(OvL3)U6hA}{I2-;jKXA3#S%okG$7quyS=p!-s;s)w
zURTir-&kOS!di=4ogpg9R;q>2#JY3AU3vo`E4DU^HEw*N08WUmoB9;<v&BZd-FgOp
zcRbFGy%}Gfl}D*<OB7pg^&bV3=+F=H?p6~dzzf4w^WB^+G1EWj{q|fRfyPS`>Kp0T
zgYktCjI0k+OF?{;8T}wyqAFwdB(eDveY}P~K22SS=txpcJHL-`V8GuW1?=3EVs0E4
z79*KU%e-u!AZO$b55Rj9cbp;Gc!c$NwW7LS!Z~!bXxbV=6Y@72JlF~JAvE07=pvsJ
zrZKBkr?p1Wa4&(n+}3dEuxv}i5$O$mZd?`ctw~{i`87Wh3sn)uj}WJrXK#)2Y!Si;
z@`eR#wFo|Sh=*6k2?;!XEoua`+*8G<wjIR9kBYW!ycxG6(QdX|niXccn%J`V1t#-7
zJtfofb?(_H-~i2QT%8$~Lyauom>bfY4@_%&wcx*r2@U6fmbBb-PIw5?IKBc&%k9l&
zX0$nNK2YDQJ|n9)W~-X_ihZ4yo6B+1BR8MR6t(ShyXJRzuX`^S<;&HI;lI2~V|}gZ
zW?jqii#b(4zsqnBT7l~+e;Fc7=6Rf<xpL_`yQb6Xn?W*Qm^Z$z!kv_OblMp#A&hNO
zPmGmA_4!%@p}4cYXwDQ%_}|Fl#$@hJtoM>b2`NX|aE658sG8QC^2c=V01yP(8%bwi
z4P(=uHR#s6xQxTjKou=m<yleXXZVj8Kssxr7i+~CZ5Tn)^6ss;7`EaKcOgtS=h`H5
zEUwQ+{AW>HTZFF)81bJ(0SAnDBgp$D)Cf4K2QFE@Y}uG<w3=&4&5B;1*K%XAwma6w
z)H}X3t!*FM>zl0ClII`DX5Cx3VeVslb1+<Z00SWgJ~f;~hLdXbN+UBC@-+)1jTds6
zF-?81yVn#~@jaeNuijqN#A;=#(sfb)C$WpNK1n+LDf;*we4MsEjZfbhS<m4o;#qb;
z)@P_1#bE)h-y$quHH{drvjOf8)*DD~hMkVAp^04sRitcmE5_$oe@s}k3*-Wrkv(?r
zZk({Y8M(be-lk2+z||Rvfek>XA7Sc$5uGaF0Cg9|c$?ecZT4zcX#2cgTl0Ou7416x
zy|UBam&=HkcWN(|09^CUE&Q^Ew{n^7SL}e}^4m`UAeSN6afLSHy}t0vWC$W+!CT~g
z2*6kZ0Puj~{V{%BU@%5Fs6Od?ob4fJ<ASRZSW&XzYSEr+n{XnknZ<an5tAH2hiFMu
zSSVKN+Ha9%ckj1;F6_5>#k+Q(QmKmkXK1X$_1SUl?3d%ZJPJ7AxUK+sKLpnn2$P&+
z7)pynS!p5+7U?0cmGyaT3XiZ-zMx^a><@(PT?k!7eq<LJaR#%rZg8U&(AiW>PEdwM
z%6)DtsNB}I#0h5h)lr@-CMJD%Oiw%}T2i?m(@T6Ay~Lb$orYUly?z3&)~*?Ob9x@*
zIK9CmL1cMF$|;AM<ek-*BCnuAP7A$6@gTkS&^5=nt;kDUA@~|<y8Tdx*SMpKy!P;%
zHg-dxJ+v0mCk=@gC=mv_yENz+4_e(ZPR0bT86L=1w0V3%2HDU~x|||lNXfJTcrpNR
zwpcA0TF#u#WgglyK7OsBpBWIQ-zXWp%teFl=D6}PqUwZfC&%0X>$giL?$GvwzALmn
z;ARYUlunW+q4r<jlllJ$nFpPZJ0>^;&$Glm>+Uw5=uvpBNIGHzuYCx(e1!dKHiBye
zJB39K45$a{zJvXva0h$7*I6B<&MI(RWN5#y#jmpa&-K>*`+3D<QNV$|_Fzn3yYu#G
zEr*Oij(nl6)vBd=TyBRMt-QE>(w}R%&h;VN#U#QCyr~R39eyH&U5+B+b#NjdzDDLY
zLs`vLjEviqXlePh(vGXja~;~yt?qXpy2&dSA)f;9i|0!&>4G^yV{^KB!EYustn(NZ
zHV)MgVn@Sqk-#mYB~>?~k${8F`8w^D=+f?@ys>u5{e})_zs6^eC~5SCs|Q))3hf6W
zv?caGx3!@^9ClubmBq-QBd8R&{Grn(!=SiQoPLK0Nf$l7mnIJz#l{E>MRlE+a)I5u
zIw-R>i^5=loWMxl*8y&FBe9+!aO}efVb?w`T7XAEMQ|3X?1S&KT^wnn7on`Jvl$-J
zH;et+o_*RW)j`G92omjT|8FtVlJI@e<JvppsSNuT=X?yM#Jv;T0|zGU(T|1uV6U<;
zhj8V^<msrB>b^Vv*Kl`?^ML3wytW&iEPjJE_=~+Y4Zj!uizwhgFMK};47;A21lEDY
zP_~TwF~*oR^y9dC1yjRD9_ytld4nc|X{IkQ`V9?hdjT-0z}7d2CT82$qSSdkRuavY
zS>(7L>lLCUm5<RL>w#4=!^y*;qsK5vn=Kl3gGOx>iycM3bq#*ZiGl5Y<O98b7%t_G
z%4{FabJBE2MYHorHxqYrG^8Z3xrdHo1j>U!8t_#x*5ZNSUbivS3IZm$fQMkp1BWj(
zR1Ay*GY`*;q3IPovSg%V;LI}|8kmM*aXy3B3lOez>g?+G*n*`Kf-ON6c75=_Lw}bz
z0(mH2pCdka6R$xV3%Y@b>lJm7(F*LJT-?kEIi&7A?ghAGR*3^g_^Plr$8lR+o&Cnv
zjd)R=z*vmm@ZIgEDBys*wPM_D;eN8@ri~mTWwl_OB^?gdOBXh(2=v@U5HG6OmB~>C
zM>vd<UY;uGLGP;-s+>To7yv0|P{Wboz7%b$v12L-Lh~+(vdH6oB)VKJNL53e0W*FO
zc0~usDS87xz9f_(Iv#&r!Lu@5vOQ??PNFv#=2h5YQ;x_=q9s*vqy3xnhH1@BVv3Fn
zy^FfUCpd+Vj(~d=kua6%OL~v{ElOe1KbgkFHxF2FI?uHMTL0tDh5^+0__*51oN2fP
zrS5wAgRDYHv~bbUb~RqIVZCuictuy>K7eq9Eh=~}X|c24<ORF;@i&Hj{5tH7F7W(G
zcqfj<b=kpZd+Q2(2mf#saKORO#W?u;kHV*u8zaRP`cGd-_u<3EChBIs!J~alCvi_e
zi)u6FW~pJ~o_lQyOT6<%!yeaesn+4@`S$s+PhUyRs7_iu5?WA-;@#fsp3@Fp)emop
zqe(%*)&6FO)|1$TjMIJ3Ok}y9`6Y{CX3%DxML}Aa-(d?(>A6pemQ;<5@!az?DuAfw
zwM#MT*uP)fEwpg&Ug3cE?aO4^RM{gO^<(_*zTmsTf)@u0_K5=a>{qMm@&e)!l&-6j
zZ)DX;qJ4|@$fx2Z7S;!69lV0?;==AYT)LPH2RW?neQ_b|i;>$XR~xi`c@k^%>qyko
z!~??Es`hfd)C`>`V)6UzpWoA4hv56?XQO}v{`skP{+Y6@2K+}ID`9KIe2~PEH}<VD
zT|9_)XZ-VdEUrg%-Q<f%5Yl9(t0n9>qqp4k0iJ&rVI%hf{b(hq+SV@<^~~UpMET(P
z`y@KwAv5xN(UQvX82>YnYp9NZ9t6>LE%LX3^AeAS-_VAJa8m4}w;`9K<r+E7E>@eR
z0x$f~cp-<J5cl(6Vw%cToa5L>HLl^d8bgC_QI}qs$tabPJVU=vX*A7!X-dcZKB?R;
zq-xB3k#ab8b9&m$o7jO`n#UNiK4WA^L-TYVMHO2p@dDZqDh6QmgCKZ%D5uI+F(nHB
z9r;Y~;*UCLj+ibR;Zq-JYa*C}6kurDYz5e)3VeCIyua9?rQ|w_O}b{IWCYOi>48@A
z;O*zX3&j_-6z98<0ACF4QZC^RFl9jWrZ&bLo<uo6*Pz)&{gk%-4zYh;L&60MSZ>gC
zRdGAk3<}0|VgI)DF6=FBs1Ca@oA+T&>G|V0BLBG8PqAy^eOvG_GkRUa4iKa`G`&Vs
zFud`Ud=qtYIk+cmSkEE*Z<ZV833w;F%8o{-{nze-xLF)~-#|`Fx5K{Yz@kx5{Z<d)
z3FZxLYM&3Z{t_|`&Ug;Gd{A{|wcw6|p{o{~I>1lv>8!7l<K%9h5O<y1&IED^>aLUI
zMZeiT8}pB}QR}cV(@_|tl&@@@>e8sYdLzgnSBh6Kvy;ec(IbYpwc$e8xMy#t@PUI=
ztQw$c8iW*B9c&<=EojsAYMBPd4P&l>1*tG}95#TRy5fadlOvFf-fZAF1~>;y=gn*R
zV%3HbW87G)V#xt&??Swb8>mp0<NF=JbZ@3l1{dWeMME()XNlVuf_X^?!;UzPA&+mW
z=U5}zsnFvp-N6nmBvC~f$osB?P<LI&@^PhY2fr7luSdQ1JK|M54Bf#rlNf7`$tZb@
z)ZHFyRL3~zrL?5FI?sE<i>vt!8rXSnEN1YG(PRY6wSH(HMJQC*xozHBuFg>fMzYw;
zokaTHQR@ss=z`;KrFYinoA4ABoVp@TWXJI!?h`&*ebO1kktQ^Dv9V2)w%|9+l06Q`
z0;f_b;N*#yi}Aj<@BV3Q#>5#U;v9-bwT=@<hG>+6t4qstAjw+MQWoHk<7Y<xY}QNo
zHB2YuP^dzsXmJ&tyEET%HcjJX7<e}$P<VJbj?KW1b!bI)4#7*gg(vHAMYvhZdS~@b
zI_HZg?y}}ArC76=x5Pl6PD2@%FL)2u)eYKlnB}9dT89UmOi?d+KUX;$jX4wS!cK;!
z?N(altSaE7of*JeKdaYqxW^1?)D69iCqp=?BX1B<t*4yzW~J6_;5eZ?9kemia)z3X
z>9K3ZaPn!(xj-$<!iiVwS)40VC>eD+<O8(jaq9gDPM=hvtYRoF=fY4)2!!<}*uJw~
z!1Zx(-@ZUC2)*oVAR2HciCqMXO1y)3*xfA*j^nHdX8?!hIGeFX1gF(yaRmWX1kISt
z>DB0naMBTR#4KdR-n$mgK3PxwPu72A9f1Zp!-ZzKhQpGi?t!uV05{X)^a+{(z}Y?g
zgwH`C@%xWzw$a4#71-&FS{q=P=+SVRlK&=aNxqS#8*zk+j${j_O<f}hkyx&AZGuh5
zSqFM-7y?JefIBQ}X5G6PoU`Z~+QF7;S{4Bz6Tkwbz7`iGct4?~8_BkyJe3*fV#zF<
zjn<J3mpkigM$I3_5<Tna2_*%xWFOW&#F?%1jGMx<tb3Rb?dCRWW0&r}5=ObcKAjH%
zq9;C}`v}kwVgZ;#f$oVIEWZA<vq7BWko9(Z(*+Av($aNyS%*zL+Jp((AZRoH7C*D%
z&>Ebk@(4k_5GNl&;lXTS9bgDk3joKPHS9274=*A{?80hs*94v*W`V?9Gu}joZ8xXX
zdg}~Ce1)u8#`bg@kT!_lc4Hogj}#3Yy>!~ynlDxL<5>geOO>+NqC-biFv=U{zHsPN
zX<B%n)5XFhj&m9m77r7HwjgU`LVp|C24z}s#uM#52PP1G1HKPp#kv>T0q<;5p3<pO
z{20)ty&tP-hiQSIuc3$HJI>&u&V7bHK2O_b{(wIIlRo~9K3+tto3_!%gY<Dfef%kX
z{4sru&>&zPeY}D`UQQoBNgwZ^k0}D0#Rrb0q87R5<AYeJ%}H)=lG~c(b|$%vNrpek
zuqPSrB*UC!c#}<w&Tperj~Hh@t%PxY*29^1+cM6)dyR3XeLv0$v#_US(K>s9J}&`g
z^m%C&qtBDjj6P3l5c(FS7jdGP=lH=%=40fDEN7S;h+9txEck>BfuBOX>1462Qgut{
zp;voIsTMe<3ktDGfsekR-k{EBYZ#U+!8z`5Z+Tq81gmHjcRFismfznD$*{jWyxe|W
z>mFDx7H+`Wp-VO^IW^{aIOXwL?=dUxT6tO=tZ{~PHiN}ERdKdC&iL}e2?Tz<JGF*|
z8rpn)16l|TQY@Q<A3STP^C?2XA((iVhrItnTHz70Xfoo~{Jm6!q(oOV#IybY2)Lo9
zGolyDRk589kthx~(&b4N>XLZ>#5q1(Nd{nn<CVgj*KZIggtyG;-5;T5)qs95Z?XBH
zJV^<&(Gxp&YC9)#UY<5`R86v@n$F(r%H-8*qZq|Vfp<U4v<5!LeT%cUUEQ~EsfWVF
z^sS9{cYXdOg|9*cmqY<OY0hNgTPkt$3!RWehsTLCg;u~$x@XO49Av4o=3sE`onkRu
zmo4V1C<QTdK`B_XFACV&OV9YYBsx?joUIw5O_yS$;5=5fo>T|Ik<uVR?tu7aG!Pv8
zER6R;husv<^^cWkd&Z6R5%ON_<$Mz5!8R%%f-XZK=d24YkyLI0iIgh0f(Tbpe6X!D
zhB)56GJPPdOp)szg6y}rI_uL^RP4Rcr)(5(fVz<weY#+J*9@oqc1<ChkNG&6$A3sa
zrcJ5J)wybrR9Dlgi8al-n<%)4KJLZG>7Zs=_u+|mU`d=dZ4@$Axe%jGBNWWhP|>|4
zLszer!Auw`XiA0DIz?RXUZ*}6)~OCRRRmdX@r$fouP5$t|K4Lq{$vzzK)cQcouPom
z`QU-z+Ga7Yi|nb(cwVxF^;+6anURtUkaUbOHE|`z&RrQXflG_}d1)7tPvT5io;aB@
zu%+6>j0>h%<TBqXlvoUzkr<#Y;bz0mxDBviy&Ydz5!Pu**yUZKujc-`eoJWUTccd{
zoPn4w9>mGB*nDr=m?wVA-OI2~0{?=6$@v}lr`qtjE*~&DM;0W&XoUvXfZx>tH$Qu}
za0eoDr|%$etfNFU^o667^3sYpXf@6fx9t<(&OrTqXxChQOH99du4qZM*ckVpNA85&
ze?>a~3QyubR5_;8>SLK!&rqc~TYF5ah=ppH=iMz=AoIf;G%Sh3!##*dsP6Vcy;{RQ
zyFI7y+749%m!!p@j9p#+RaUtqTD!Q;=)yK42>ZxCIHY5Jis#38s4Gu}&E+0*cPW^5
z11nf?$7jGr@_84uOhp=X#`kMt?NuOXf}`U-3p^`r6n3%m^maw?3>G<Jf;Md;y2h~A
zJ!J(Cacqc<e4UNUOT-ond9rE2ZJPE;h~p{k@RZhh?del|j?<~4;N^22+)-rb1NPN|
zd#ds+e@to8RgFLD05^%kNH=$avP<md2w~UFeMszk_-+zp(2Sh#Li~Lp^x56Y1D7N2
zHf-yEJt<d1M!H|#wD>5dl_~5jn^>O4CXAzF#8xGLR%{m*zvXc$u`o-RINwGu4tb=+
zG#{n3lhc(uH6*UEiIS>T<dmIQN{4-wSP_TxKNi3tKyuH9)C%UbT$4u41CttNtHml!
zF?)z`3eza~pFwIGli4nQG>^mQ-GrB{>`hLxVxvwP07CFz?_kyucadnL)VDi8UX;Ti
zlwF6hJFqFOE1|1=Oa6KnTze<*3r3!6q@t;Ab`@)%f{yEIhqm-|aN<XlLC)ouK<^dm
zoF!?o3;Bc(mq?`57xY#(em5AD%~~zsDwGaJDOs4-9!1KRi<Tm;JDhl{Ah5l>t5ErJ
zij{f8NG>K`rfqwVX(&k&G%t1ILAkh=`(kKEvb5pi;^$p$1QY60AGj6c;iCv!0|6^?
z0l6H>OPqvMH|Ulb3VNrEyzYj%JH<+G?lO1EZY;R2yii4~E8|>_i`ms_vi>x>KfDAn
z;tUZq<E}E#)Ny+XCO)yi9m~9O!GRE+K7(plHHHKQ<3~>@;wE=Fh7D@@<3>Hhv%sbK
zF)XY=upq+iK)AqdYP*RtI*I_1xnC%*5v8_y!y9hND9{2^9Cbq{;h;WaT`(|vR>s7+
zc-<!=9Jz0bvQ_nZaTSEr4s~!Pk*;^p6_(nItRx944Z5m0*#Y{Zx?e)u?S9Xrg}w2r
zqafvUs@MfL!d>dHqL?a6)&_J|LBi#X-doQ2-D{9D%R}2F@w*E;7u7X2dP|qzH3jLq
zu%r1a{B{<o+XX+ua$gtpFRIuxoV8@nqhR4m{mI^PCtm8Sh4)YpaNLJo&>NP2#&<j_
zwX20wRT^?B{n6f18m|Xu#d~uFA*WrX6r9))?k7}!tP6G`3KA|?KCl#ASsUoR6f7L2
zBnACzWM`<7y#nrEX~(7Z6H7tu-sC;Af~=DUKnmUsdGUbCy;T%o?p9E8`S<yy;NNY%
z3QrUgoZf*=!Ru5W>nlsa?a=ab>*ch>hcl3!0<j*Ap!SNEA|oiiDQm<J%du7vt2Vs#
z&CyH8oGqcsS){|t>KhMSgvBlQh!~rXSH2Ec1GG;u;g-00?AEB!O5{MGjLbQ%<MNW%
z@~}{Q7bZ3ACbIE3NC?M8niUGrbGhsHi@*E%uhGblqux=PA@)OW<kCze-)xSwIj`m(
zMFCi}_ER2CG>-{M+8p9ezX6iW-fJ!v<DiHlZ}+)Z*PRm;bDe?Yeqd9kF;~P0hxV3@
z6A*w84lXbQi>)ejjC7e2h`1sOH<Zb701ZU2OqhU2TQqGz@?m2n)x<$&({gBWIiI#o
z6Rn~F6GIoA>y9mQl`;RN09XJM)4Q5n<xR*U+?Ky6@&*o#IyQxikrW|kR8E*!E>BWN
z-cj5P2|&3Vy){{_9P&uN+2wBI)~1f@zH>R^DbGWMN#mw?<W<mi(v6K`sWr9;@07dt
zv?>~}<3xHIP0?3kD$Pb$FtS2^6f4OgTa4AjRh42;MfhT6HfE-qwl}w9yC+LwlTf}m
zHZ}%8blRe!Ghh-1?vyKIzr03gPw^=L?$PaZLZFX3U+=~TJeKGvARY-Cf~Dgbw<Fjt
zW{+3WXiqgFXIQZy_XRN>8!8K?0<7V!u3uS8-+H&mV2Hql)&?CCeq|MkFeYPf5}1`z
zDMH^Sm&u(2{}9MfdIj693)K?m)4g*W-8qe3xeV7acn-r8U??~8-;hMPPwt-H%T5h6
z`q6;U=Sw?SP9!yg(3ra+Pr|%nVg;Tl=(?fZcn8>vN{kTFZenC$S7`iC4^q&E+%)y9
zDrp1P?~kSIzzac{btARPag=00cn}L3C@Kiius@!LdzXR+L@XSk^v~G@djzNd&H4Oq
z*WdIgj=fg2w2f6gg|%FO{zZVeh(UxqoCj`~nQGU6`~A5a4e=tj?gG1Bg>`;>w&<X)
zM<HEz0i9=Zp+4_>T<$J#PR3=??LKhnca;X?9^}LWlOE}?(uX}T`d!7g<fFM>F->^S
z6CJwANPu){S9<I@3l5*QEjVCQ#ODTAukL_XitfVCJrluhaMeDO(}^uT>H+r)0n{0v
z6eKOw13F*s-59(_Bk&%KzvD;Wk+tw&`fpFWYh`kbwrxRz6*F_Xs4w*MogEC(3Qwzz
zgt9s=k}}z$q<j>7T(f^~ht^Wqh(EbTWVmMkq4vq99w_>kU(>=3ii=J(DT=P}3X4M#
zx>C|Bnk?%9{*)@~IsOalQjfgqO`@f@_sXj#LCaY^)kF>zXI(5GbFX?no5m@jT$>#G
zoSzoQbIC|}pe)jLNpO^_rdJS%5Lz+?xGXJN|Cc6T7%g>ng4^+S*@TgG++8wb{s>Jh
zt)UZX)UAhZ)j)Dq4(3ob^`0@>OZD0|8-XJ`jjeBm_l&K+L&w!s>Y0(E7W3j8#OdDU
zZvCCU&qo0VHi+E@qQZkU3z6}y^=h+*8JX$eUNNzrxmusmE9Oa>18`S1lf%XY0G%K)
zo;euUyeoE>kq@%569GAKuO1TcJOhLI4zGBI8XeEvfn`wKG@a}vQupMq#LH+F*XQx{
zh`9A-%9t@LbSMoWtJBE<Sf|aXC{18ZR-nk8HmAcoqD{fC5uRuYM{gkG&nvU&EK*%#
z6vJ%6^6i^3yI~fL`Yt|cP@ZPKD?_CDr|8~XpRYBlr63~yX@cDMJ@7r=FDdVXX*26P
zWGQTn{}Htr&oQM4FXA?Xy-c*ES|^M#yu|gI(B5*)Eb(nd_&d*g&Uf-9x+mTJ=b6k5
z7tE_MReCT%7P;Zq&{-5ECE>*4mYv?+hFM|HHNs<hOjHUp<;#(0tBSqt!dx%eWL?A6
zgFJoc{hrCekPl!^4_2EIo?*&p%o^A{=hn^5<T^Ses^>Yj41S579m4zJfKeP5MRy;F
z4PQK$NFE~KnD|yJdWIo1O>1IFDPLrffpY^m_vB=rlc#m4ppM-kFHqI^XdcXt<6bM8
z7|orGoMpI!r*ykvj~YuRcu&acT&PI9{w#8a;0lnY>T8=DNiXRDHHkXP@a7A2s1RE`
zq3g!|!-`s{d<d2KFDIaNCQR#$(uQkfFJ1~-&uy#n3QkUkdZ~EOrMz!j3LdOtd8_ow
zXQ^oGQoau@1#K60bXO|P3)D@;i!S9{SqfgP4Y+2Na;2o7bUwZmbY7df(^0vy2smBv
zFg$CEMU%3}Q+t9{{8Yir^^mRJa??-#277~y-vKK~IKhH0=nWsZ-F2V$)4ioKzR$a?
zyU0T2K({ZY;?8`ymz-A`cXi;SOTnF(9>RK%8V<$|Q30O}lW;PYgx^~V657vUbc)o%
zSr|3Z5|>M{;s!hNoTu<$Ck)+LT@pExa6-p_o;rI&iH`2GH|MU0aD#{X4c?3kNstq;
z6$x5gkCou>dn-ggfAh5{;6VOnDw@A>KJDfi<QiKncEs@DII>}a1lQF0R11-zp|kTa
z)Sy8FPPOG{SXjLiXX%M0mNXh#;C<BP_XF7yp6JaGK$(apFzB4beWort?hOmb#8Apb
zuTPmc1gCD6=EHm6_9iDx5tow&fUxoZj7q`F2t?*Tu>gtKsrF+76FU`TTnD!5?Dhkt
z6hj)n6C;$}A<cSKv<f0lxG){Xq%0wdcTOk`xfGwX6cnRxB5htsaTNreZeL2rp@}Gm
zCgM4C#ZqwS?%tbgFjwUC0sg{#4|gdkJFJ3eN%g%jrf_y{YGS8YB#)evuDV&AM4G_`
zu$*t<(x574l=tvsQaHbz6A>V)O)W)(K`FX6dk`AAlo`Kb8v$&_Sr=g$JA-al5}64K
zmZT0HsE_SFbl4vb9oF7XlL;n{X{v{!2d>J|L$<dD??(?0M*#<-2ORPpnf-YJIaIfw
z#f*lFInSkGuMl<RlrcpDl@pKNf#`H>-%*<G;FGGn$66UXUoi023|visO%&MkeyB2o
zT}MSsu3*m#4hgJlP0Y8{Z5-)rXxnqSY%aG$01Mne=mE6dcp(A_9-mUFI6)m#Ear^a
z*p-O_M*bH_U|WZY`6x7o;|Qp+d+8LfAh|ff5R+ClfYVEvvVj>d%rMExcK2QY_ok?M
zMoHdJ!{;HQqQ7wj*Ue*XxKYS(dRE(R8%XaSHs)t>j{w{Tda0Y5W~niTm+q_?n7gXh
z?Ob+8IQn_)g_MfgPrk6I2-i@GYIggG4CjtPt5jFIJgX4pdb(x@xQmL%2w^uKJK7Hg
zSIBYt(?oxH|I||Oeq@L015~y}O4Cscw-VB}_){}}Y$+&iybvBvW$O!rLKm{zzCziW
z=3KI{XI2G!@dBP)<->xt1<F6$Beif=QlHau7Hrm8#g}=Y=5g6EjiF;2o01*VSk>*A
z+yzUQgKs{2>6#I{S~`IXVGb{Mo!kJruwX3d&;$RSb~9$-@GfNt-xMvW0T58*J&QwF
zMAX1RySQB<e($r~r@1Dt^A1wAmUH$Yaa}zx9SKAYs%EsU6=aI_$0TYF0{^H-LYI@9
ze@Ng$YquT~EqxY6U`2Q|^D<HvItz>b?s30dPG4xP4lcc+g3P3>MSu5FA$_@=s)<_k
zQ{_Z20SB4q_Ss)%dXn_ci(8MNuraK!bScbUZzSSul{-SmI0-j4TgT)-)K0gCVL``Q
zY7W&ImbJ57yY-Zm<!4BitR$*FvwXpY=hor+o0vn@*9Mg{oK+1KrXC;BD5CrEkscl&
zE$Ewq61Vtu=EUlAz>|Kgm|GDA92hgb4%CL$oj7G4_;|Oa2bit}#}S$wNAMyK8O@6{
z74Bfq1ji4wKE)qEU{u2c2(iAyJIqs_)V;KAE5g`HoMK^Yj`GZl#*^5k)c3eageOHy
zs&rh3zDA}1LXP@d#2j%eC@ssG<&z*V7?l_J(Hh2it=<&t2XnX`v^HL}b96p^gN{C+
z!!fSQ7$w`lDO4D%Rx;*v21CaaSPY0og85RjU}SJld9!3>U<L9UU&e-0-Hc4dn58X&
zctxKn>-a<6Xk(t11y=a{D4e5DXBS{3oDt`}W^_AKH0ky{z@IkfO5#sl{GqmSpBfI5
z@Q;<w`0HUah3af2GZk9;^*@vcK}B`@iBV{2+ANmT%x#{^tBM%zX@APq%+=zqwUA;C
zkB@6vH*)kX`p0oW58XsIB>DzrS+m+xSRbb@;bE*tmWb^k#Hb%Q{O&kI@$my<zmIq0
z&tv$!TH*}4II11G|2W8I>n4vmH`2G>Ip?@o=BEXj`_U3e3dJ%H+<`O}PI*!O2^$uV
zr1iQ#VBBP};-`0Ry8J24R{Rnc3%8;C6E-UzvEjO<Fm3lM{S}_Td*V3_e!`B%H)l}`
z2fBFwgiDY=g}3p_Jl7zeu!|vo;8nmE;bX)ThE<oP(owl}rHgZak`Ghl|2^)K1Mekw
zgJ$G<t4Y@EB)w-$RJ#)A{XlpNUelvkQ#hpEPBHDi7P}k69glq*uEL9AAA%za?X6fi
zmW}bCZY=AZi^J9Frb-M;(L+}9xEgb6p2r__s~|OJ?E`;o=j_;uW`U}adlc2+A;Ll1
z8`Qu_L<w?SXlpV&yBtG2cjznT%Zi3sM=x#TR!{6QIAJ#C#S}WC3(VobzzyI^2nSx|
zoVbYe==xFALr?D2!=<wgFWD=Cx~IFr4O^*~47;FyS|xJs9QIlCt#@udF6{eYTyG{j
z*Wx4XM(@v{BMtO$&K5Vb9uN>Nbqy}@h_9j${wj~~$9hXRPuPUU>K_(_&!Z(tuCuzq
zE4S5H0wyEK@NyQ_5=~sRsbzH^W6;D}N#3EmLxveodn|ASV$a}DfYTl}DcjlDt{u+X
ztU|Y@7ur$ARaVrivu!F!2FZK3<5ef(CI(&2QMJW?tZ2wbJofwoee17jd_-u-hgc9v
z`U%P74|>SHpFvnZhd;5h4ExUE13?F<awb%!u;(*gi_g)wC1KC+Fl{|xPq<ffJHog`
zj^yxrJ$ipSEf(+gKuCj=hA>qv%(vC^_u-{DL2mC}#B1mjr5gg%7@-Bb*1r;BK?k}5
z^_7IL8_4`S)$E<D{UuJ{2H<4lIVqR8j^>wzHGMNJOy8RRfkAZ7>Q!|F1-Lsk$V~Z6
zv7U3z1s}QJJ&V5ej-wseu^BC;VsV%qi?W`t3y$_ct+6)m;ov%~kXAe4az317;Nkdn
zTG#bf48CGtm6q#qlKiO9nSE(t`jXtuAbPLZuOL3MV&6~S`m5NI9Y=e`jx$HGCmwF^
zu1T?#a-rB05661!SN2v6zGBa&<$9cA|C-R5Mp~G@Vn50tdau|&N_=F+{$cvoU&WT}
zcuTL?afT@Nh2l6z?1<flQyuYVKb`K#KLe*cZjW1q-Tg6;zt&sv_zM5aEDbTL58csW
z+1^PQRI8nK#1TfEP~(MxZSm(@{(c9@DPrO@gkkg=?qxZ+jL?7pGM<RPI#Y?*7S*s7
zcoyqZ|Ea%3q_EaFpZe><UHu}EU1Zqz^9-VUpE^PlpnhUa%{V)eQYA9pc%JKLN9bFB
z{j6lsI<(Xi7NwA!Kd$UuWPEilhv6Rl>h<DNIN2NU2U~%ze-S^tLHxOXzx+vmT|X4{
zz*uz|96)l!u{?f=xUaWj^WD@0OKBnhOSRf*O~iSDEU?HWTY|nm*5(g&fV(K~+dWw^
z-WQ=@_lG>+f2NW^nyCt5;D&h5Yc2^18ASt}<v8=7BfmttMWPAVlu)jL>tCe6cJnHa
zEeT!f!Qz3SMe1O<ZwCqFCc>hLC*h4}Bnb#l*u|+dtiZEaIlSXcCE|vle-^s50?%TJ
z`1$@4k)o4}3r{{FY-$&fU1Z<8gF!4!c=9>oEjxqH_Lj>XSoC|nVo?go^&>oiTX`&a
zcYMh0SpP_z4Q5aW9*e(N{+qoOfgfu8eOivkN%1#@zI-h$Oh32rRR+<$qIa8(-gv&N
z)Fbq*zcIID$2zpMNV^y8I75^gq2wcht}?9Cdx)_?onHP(tnc2}TLJhgJ&~5*aVq`W
z(s!qY>8tb(2GPAr<JQ{g(EN&cqzoeOCN8p<zLUQ7SD_^{?&uXW&Jcx$m%i+>4jTO^
zaW<&Y1D9PEtI~FFMc}J+H7&>ERQgjwUrK3V`YLTQi0)OoTQB`4;v*~d)AX&sN-f#p
z^okv4h*HB#k9N@M4-sR7I=y@}R;54OTLJhg{lT>Sj#KGR3vGFSTA02{zlTBeUZp=r
zd=$|%ee17EOLqKTuh?;hsPv^6q|0odNcY{~{d9i^#_-Y99u4v%xxIlK;*)#d?5&u5
z#s7Pj%0kIKs?|<QBFQ}vc6}tfH*kG?dT-SQ?IABJz1KZqG3h;IFIbwP>;<01x}~$v
zR3fgA3StGG#S*dOOeNxmXfA98p2ZUJlKv8r!u7;;5YGwU`?bY;#IFkT?RwQ=cVYa4
z#6|8N9_TGUJ22xuw6xf9DKjI5jQWvmS)0pU!4p1Xe%ur71P~XYmg;7fUlFU?kM&j*
zeityuoL{I5pjusb0U#?twgf#EOV%4Zz+F@aAjnFg4RK2P8DS1hW>pHb{E)6LxZPum
z{Qz;1E%trA<!1+G{7kQykwQlOu-J=nTq9d7ox_;RA-==s1Y$V)(J_>Rx<?KxTpoW`
z;b(g*9^Z<eV`(g8#Z)Va6$jUOipl5rWt?B?05^rXq#-LNjDuVt#gKQsG}aA$^Nb__
zp)@I=O2NQHeC)I8!uGO#;bZ_3g2p2hbl}o>63*@~2`L;+od5f*@U*|f7MFsverNF8
z45It-eRtv8Rm4T^46f`gKRYmE4_aDe_$HW<LPq`Q44}4;bedOqIdL|au^M<Jeq!N)
z-ipBYj7QUQJWh(A6Z&#@TA02{Pcn$^Rl3_O><Qu{D|Lgu^*3cD+3{$v*l~s^_4&En
zjR<ED&)g{gZsX`?8~(U`Ozap1wcT<VVcZzoi~ewLMdK@bizOjD4^3T9;|$<|Pz|cq
zPBr54RKy0Auz?%nDSKZB$SJyj?kKa~ORcifO9q6dHyuPc0oh5}Y>So6$CiSE_Up5g
ziYBO&QtsR03Hxk+2}@zSaUS;bLXK|&vWx5|-^d`k_psds4c{OxvZ{TpxBTqDjIZ{J
z87XAckDy`m_GU$|&+mYPMfwAuukziCyghi(t)ked<3AQMSa(qZM+PU*ZMJ1=2e^xJ
zV}vk9U}B7@`scuU$E0Kh_$NWXO5vNkjPvsTl9fWe;<WyM3)v1at5R^=53*JZZg-tT
z>Nd!_h4{!$;9ze#+JPMhdc}?uQVKhP6d<0*zFNUDvAH}62xlcuhp=0R2jrgW*L$$U
zkriQBbcW28-node#~%tv#YY56F~`IB=kUdxc4&QqPoz-}&GOGP<<nc-^GyA-S%6UL
zgAZTlWc=f4#KEWCpM&_i@HvPVdZ&ON#d%9(CF6uq@(%=8Jcq?Ev#Ou!t*ZMc$DfP>
z_PKxf&)_b@heG(Lf{T;!=t_hWxX8u85jk{fymyXHqlnvh^%9@QS1s3?;^ttSWrIWU
za9&@fSvKlsUZZ2DY>m%T$1TBp7W?!(UCyc5xPF+=UbT%!n{?KW9Xdbfg+)bKRpt;M
zSyZo&a<tcHB>shHNtGQ$H3!>_KMx{uP)<PkJc+5Jj4iQM6r$hm5&dJmB|7e)oG%KZ
ze;6%+)E{V1YMYXjC)KQze(!0|@4ZK0@Jw&p+1{?5XWO;YgJTl><872Yk^fi`_j8`O
zKiyk#$Mw8l7UKRSGkZ~i$ZraHbsdPTIU??XP|d-6s<7nC9!vge$yoA*Ua=(HbtgLM
z<`ZeL@K3sthV->I3clUyfrew;5uCgZ<tD7P7sG7_Q>1Mswuh-+@A7$mYGnw3Q;oIb
zZ02u-&8$uf(+}QPFo^EQ?}G;l1)Nx0t*A!hKUS>f3gRYrmOJQM@A%q*DVOz%DT}h2
zWrDB0QS9J=I;_}-iLr`e$1iO-(pv%eihX-pe#go1D?(dtNek0g?3)=x_lmvt-sTkU
zDa=Q8TPac0`#ABG)!U?R{Z((tn(1D#=FCy=;Btkqdj9}1R#ETxr3`QAtpI%WKAo1|
zaq9hdLR+3l3)5Hc*D{Fi)qDMsW~pJ;N@gCXoQA!3xKL5@_Yr4V$=^fY`m5xULC^Mz
zL1&JV2N$n|mHatktfJ)c3tK+ZTLJh={^_**j#KjgUuerG)57$X{5Kgy_ewr^5C{0$
z5%u;TD~kO*ag!DMtMskEiY=M)m0mIB3{h-a6Vz#C!dfk)*#i^tD-(vPV(&!YtM(88
z_bl%In$VZkX<_=Ry@Ek>uiB$G8zycXoxx3rLdEH_Ls}bHuhON61+7`z;fCaLc4t%c
z6(#HF#8nUk?&u(m$ka7PUP0&9X=UEt4scTp{e3AD!tRXEI)x`elXujjg=tM;WpN%+
zs?BALWC}XNYLfyje{!LxBa=)0ImNJESXmOb(yPU<cGRg}KTQ8vT7JjL@Ebx~9!v|<
zm*M>kqI=U{bA)cBX@-tB_nrn7+<G<flKZq%^sRSX?ZA?gy<*83qSmxXv{Rq<6U5n|
zUJqOv->1E^w<7Sp-P_Z0JWh)LAoS%&)57!>`>hP3d&S=7c2IovNz>N0<JKok9~oLr
zN0zBF<Mn7_zP*e3iZOhg_|L}hG5XeDV~}k8Xs_6K<`_fArKevc&ML;xX6fmddMg6o
z7`~8}<8j9DPeNb*EG<mm82*GobZ-pn56#tZwF~a&jvJtd3Kcc~FXAk#`FH4Bf7M(v
z=-+$Apfg0xvB$PFv$sPqbMdy2p07ZCC7gDb|7@e0y%U13=obQT&qgx;EHvi4v@m@|
zKbt{xujuEwUcXeG!D@m=v8-*M(rrWA8*=xZDk=u>QsOupz<&DHJKo262+6qXdd0Xi
z!~lkJIldXDg9&7bxj|RIO57zAl!a>qdT#~c8^N)(e2<gmw}sX`m=>mQ1otzD?u}sE
zO=bi4OcfeMZ9CSy=p_wHV%P_5uUxTbM=s~tf*j0miF-luKTdoVLE@<n@(2&yoOMA&
z+@yjC!3N>=7(=CLSL#o6XeGt4*Oxk>?+)*m?@-!y@OxnzQ&?FCg*nOSq@XCQFe%XL
z$3PyvUs<2)VEP{>!3Ir#1?nqea8=+J`=tUOO3U*&IsU8An4e7x)0gA>7)1AmzvhTO
zXO^2~)vUayL0@Wpo_NXq+UMw7fBQAblHczYOU@wGHY*)e`<ujCRkh7ZtZIL&w?go}
z+drn|d7NthyU>_#q=o6L_VWxPiE5jbIMtR<71iE+iL2Th>05tQTe4(5T1pi^hgs4C
z)lLE8`Ovz=Bp}+a?G~#n!?0*=_luLP?N(Q)`j->8y~+MUcj@*REejT_qsROOs^Pos
zz3RM*ST3dxR!_a?n^rz|zsmbP;Z@!nCgtkpJ51a;tYZPaqUT(nUHHp-tLOg0?pvdP
z0}H$VFUSio?EZ?2b4lW?;l6qe*Qn28IMy&Knpx4NOxirOORMG^dTAGKtk0We`ckcD
zipHESe`~nofzuV^8r^Wp!#FGr*KyN2b3?<W>jeW}%VtGf&Tckry0Q~jp<jn<2zF0l
z25Y)n_nO0_s(d6{uE?e02$98mR6pb4qgM)un|C94VK@QYyd~r^f`0N0p;}Q8=ZwKh
zbQ||amC0Mv9vLSfQBDF>Lz#iyQwoJ{V3_LwIYlJx_nw5ZJ2n_rlu5zE36-U!7up%7
zx2m+`(rYgTy%S7t_m-ky>Lh+UCC`E*3!WVw*d0H3cw#AdwlV4`f-c*MDPNfGa0lAO
z3hS8Q?Z~p_qAAs<L%V+;TcP4Ne0*Llakd<q)62Dz*iYj+cvWTNs|1-~{S--p`>l8N
zRwjQ4bVK36kyVoFpFmTf^_OtVcYs#s8+%`TrF(U~_jh7KJ1F`jx39_Uj;R+{ZEBDB
zx7!1zq1sK{;rYO-`>wvqufX3>>rUzp{YrDU917JTP`3p-NGXBL?zw5ByQ-?J{-+Ti
z)I!&l{v7K?l1{?9do$GR9{RW!AE%4wI&1Rv`C6k|YFYQ;$*Gpyh4T@*QeM5OJEV_c
z)27(?DnB;<Hg8glyEE7smcq|Ym8$vUt*2y@pCJ=q+fvP((E!cQty{JX+abeY+XHtm
zr{`iXoom=Jp&Fv8KosOfXj<K{u>=$^WTudN^mf|ORz6)rJcjtJWK?D-BWaEs<GW~Q
z-n>@SPZ%6?Bg%THa!iC-8M|6Gv|J^(L&SaZy-2V}d;2&hq$rJkRGQ@}qn<&N1#^Z%
zK}4GLT#_>$wrOlRtQ%VOgi$Y55px!H@vcw1N-t$-;6MSUS(!HKb)Y|8ua>oZwbC%=
zh)!*`Xy%JS_*9$rAC7CTlf2HgHW?(o@&#nD+Bv_Vm<aX!oer))5)2}T$ok<jROE|S
z;F&^~Ytx_W06U4LOPlh;K|<OM2Q$>w3uRT1aDoM0(E67f)gEaDR9~fYd3?&~Z+c7R
z7l4P4u1n?r`fp%`LAUSxcOb|YQ@i9=xL-*bGL9@hWIX2%HxD5Fv{@IMwN)K&Uo9v-
zYhct>(q;6mcd5O&&~dAz{yW0zL!sjXBj_@BPwm;gClKpV6ow$}I_;q=kL|+uJ=#v$
zFHu)0`lZb7>Yly(LQ$u9Y0qAIYhUb3b8TO`ie9=h?xjo^HxIv8>ZiuF?NT-xs_8ql
z{WoZOhH8ZW0XbdUuicK$Z^o!2O{2l{q6ak4e^#^`_RGn}J-Zc|evd&h3<_$q+g+`P
zDksYwFD?XC^*Zb-C<MLwg$O~<jtfC4d5FYkHJCxvk>#tF<}1~*i6U)ko^y+|eq9d~
zWQ;lF^laL(!I2>HgnSG{ZY~F4jadV^NWDTQO;qSr9OaK2!#D)gwS1{+i-(Whkjsr{
z;sQ4xg_tlHImb{KEW+3fR$*!7D(nX5T8QwpV9eAF#G%t1O!`pAwYGs|K7vp0*`&ra
zOVXm~)-LPd*sW-=G#3t*;<G;!9iXNN3H@M+&~<~QEpdvaGBUnO7nFy#bvek7lENw;
z*BQ7z{u;ZRdP}_@5C^Fr2^o({c%(EP&18=unjgDCY034f_bmm@-**Q1hG3WCoCydm
zEZK0MlQKNLc=6%s=DWO}#7z{0_Cmzg2=d&rNz*vz@@Q{$E-om2k)*kTrr>u%L8<fj
z^^a+Dk34dfb_M;pQvBH~{_Me@J=$Y8xFPD*h#S52VIq=6@-ibJ$XEB#tNe}{6pDED
z#UTh346D|82H+EvmFpZ{&D=}k_!k#)sZtB8KZRV^ybvMRuOj5SS)?vSlw~(-wQ3!?
zvuSx+fuE43>=wmDV)9noE+<UIG~JF}8J;K#KE`a;4sUW-+m5+b@d_T&P%xNB^nq0|
zpR*$)21<y44#Xg$m78{hQ*k=-a5^HlaT&N#6jZIz7IYjKHlN}2BBCq=g1q=0@Q%7k
zLm6(lMatBknDWYmk@VA|wzii^pzNXt0qMW8UO!H|C7DlDXwR3YswH4pqbSmyQ;6qn
z02HS+_v{vYQs5W_r(J&WrHd4$(v3Qch9+F%TRXVKNS-gzr0+XAKu%)Wkt`pf?1pq3
zBbu#pDW*In-Ca-qet0S9-ksERRkkF5JssD`U8o(-Ks9~<@X4j%+C)Ovr7|t?+bMX4
z{nYT5D$ACSD|onl<ex4D$KKA4^h|Z!3SXQv9M`ve5{FFFzjSJWE-IuJHHCavExxuC
zYH@Q9dP@a+rza58aTc9+h_i-*o6Fh%S_;mt4aN__(AZH*7N#^D#HJj>?d-uA?v`k<
zsxo|YT#X>{)`c%}?dE*?*58SRy^`j0&{WJA&fc?od@oY><9m&L!BH2+T=Wo${yn=N
z*@smh`*x4-300uEgR5xlwr66`RkBJgFxLPW+m$*y@WS3lu2lK;f?yDohiei$m_tdT
zxy6msRLO)@oW^O_z5wGi=SL5eN--m$@CpX6FU4|OJ_>mjJ0RuJ$b62n9NuLDBM`A_
z0^8$_@fobk$mQ<gHMe>xm-ELTx!f&SBhjD*8hY6*@e$3mLc-n=UI=S08K#O0b(XMQ
z;TjKga1)Vn&AK34RZ|;u`K{37>i^3+w35UsB4Zpv-yP#*d_gNnIKhGxRAbwxR2!A#
zRs2+G%BA<%Qqa38MvH^a$BC=3F#Ta~k+MU)u3d*1T512lW+ZR!rL|IQiNb(+4#{J?
zq;rRs*DF{|k5yVUBZgxD=s@*2f099Y-n5O<JaQ%XHnG6TOM1{+sk&hq`35o^HZ9E0
zQ<8;dfh$U8$X(W-X|q-gkni{339t3%m0@nHw4_QNL6yN4R?39X%$$Mrk4K6=RYK<E
z1dtG(EbNfB#<ECJKBr9`A@UO)R5D`dDOCQ|9pEp@#0hcN#J}}FQxz1e{vXPNg|)ax
zj%$CHj?4KWiV<L~d~t*4V7w`8Q``uFP$Ww+h*)S@#H2qm$j0<EJP<B_AZL(~@8aT!
zQWJ|on+<obk$Vq>S+3Qwz!Tm=FX&S^<E}xD?KWDsLjH_bnqoaQFKG|2*1W7cELBg^
z?Mp%^Kit9eBd!IR8}LKzNtb7p=G|WOogLsV%B2v(u1h(-l%i1#c}ZJdSW-PQpPSp6
zPxsq1*4)Q44_Q@7yr)4XS|2AJ;YrJn^;TQrCM|D~w0%_QPk7Su+}%^z-S~%(J-abz
z&EA54_&9VxrKCf>AZ@N0JjbmiQTW9T9#tyCYT>Lj3z!}CHlOxwZGWWU4bs<+xxUs%
zVtB=}Wye~MTf+^!Y}6RxB5Nc65#xvAgF<62p}h}kibUNN8bM(lrnJobm_1)<;A{tv
z2eNrlirF$*+M(%-J2t%{*)lq3wOwu2^G1uYmt&+?(WZ^&CTxeWPVna}KCP4Zko$&c
zckHBfipyTbpReZ6*YM}#__TOa_iOR(@N(<>#h=%4=@b0<B!50d1q0S;`m@S<z4-G3
zT;%ZQ8}Rv*^+tRaAGe;tAK=@-Wk-#c^@H?lRkJZYb`4AfKdk>GD}GDx@muM~hABON
z+%D;M5fO7qCt805&x>ENehhymt+(;#+v(A$_2c+s9RYdPPw?Y+@aH@E^IiP;ll=Kp
z{P}MFd={TV_&?3Re+Hk&TGo5<=PB!b_yh~yk3UB?TyA{;e<!V<#iw--wemrHa|UZh
zZS2zBR~A~<hq(Obsr)`F|1iEC9xT58wDk*Ab7iSonQ2)c!S|=EU!q!%P_19ax6{_I
z@aISIi3Wd_fBYJMevChV9iLBGAE)od0&Rf#1insMzkyF+`<wW4s%8DQ`12|Lv+!+T
zc=2axgN|)|TD<r$R0j|DVKY4*KF1HYTmL|k`8s_(Ov?KT`uKkOc$_}|ZYw_imOj3E
z7Cyd0AFrTIJTIq@WwbB<JM`_uMfjjg%dCe;L8&S0;3fDtKp%fc;QtmMP3tp(W+%DH
zNp5bEo0{ZiCb@}81`jm{=t&0q6oW)fK$>h?L$Li*t?dGNHhM;WpND*wzA^Go(l<u_
zd7_1p{~Bnal-Zt^wV8^Uj)#c^rh~6+V><Q|l}rb3^(Q(k-oEtDRQa>?k)tYHuS|@f
zTjQ+jh;lk(!1`bGjdu81+9*C~!M61#`c|Qjmk>P4wOU`G5AKAl&k2!zUi|sr_yfuP
ziTLxU;?JLpKVJ}kz9{~D34fqrU#36HtiQ$|>u>P^?IFWCoUvcmx~FA*6^{V#dGY6s
zC~?-?^LE21XUkZVs?Qj$H@5=&5Mg}sn2^vY-!I_Jt>d>L>sH5E&BwKdUY{`<+9k)0
z`Ppi{U|&L`WiiUfmL<CAtPnr1x9w62;*xZW(lhd=QVtm|N({nT#dp-<;yY(0<ttjw
z%G)PzxwECZV3;`e^0yAZTef(CZ0GCX<D~Ts!Oef*A71wZTc#~`-cIrqg!$(ku%4<r
z_6}FjLP#psR?=r7F}b;G=wLOEAq{dXN=WVmo{P@&M$i=MJU!eaK|hW$nAo{f+c^=A
z{8x*|N?UH+b6bZNQgFv#?MbLNr^20kx;)q6s$d6kJO<`^H06c~&WK(pS1Wuo&{(5d
zs3L$6k%JnfSl^-pG_HZMN%g6clMG8!G)un8mjcY8*=#ziaSX+bVYi&McCBbu=Ej>1
zvxMmA789$t^|Ena#eDQ2^}lSpPq(I=HHFeN3bACc0EC_4gVosz?Ixr*Y*EeGRIOt_
nB9<g&8GN=`H(RG#&JdhIEnCnVI{jLUV=J<9dm(-|r^f#u5(1<_

literal 125702
zcmeIb37i~PeJAc29W&F?XhxUu?Xt(mNY>2gu)!ExAlni)lE%iC!Nit(YPxHttJIgf
zs-+npT#1QAiZ#Ivgai^;LP8+?$r4D+v1FGG8$v=h`_J_ccYv^j5MbFHn{1Z-e}BLC
z>UdSvJzX{3V`am9r0VYXUj5$h{jT?WzjwWQ!<z@r8#s^t+--KfWLB4^jp}K$QL9#r
zs?&1EZ*7|8;^9!z)2&^vX+7SWbl2(idTZ9r6>9~jVHicT(Q*&X+-DmNduF~+GO9DT
z*9uJnW6vy_PN_LRQ)n#LomzPYuh=v97z@Ys>P&u~YM>;7Vz=ClcB8<+_N4}fmkYJ(
zg1OjoM`dfg-y3fe89w?WwbMqUVHQ#4<1KfCZ8%MCj<MtzRokpp?bb=Oa?GR3k~8hp
zinUfiC!|z#r)23%E%*FTG11t%zDTVZ7a946Q_MRhqhhoScet!q7n{g$xr0Wv<?bjs
zm2$prG%9-8te&#-Ca`X~>%RBnuW7kM^+wGy3gE@iZGwC)ccf6OFE`A^5>n6Kzjyz>
zJ=%$qp~-yhgrQeJ3ccx+YGBHEJZ}hXr#80S^8mMDlnvbmHXHX(@7p)Mx8-hej7q(%
zJBFRFqlut|o6GxYEgj^oH5&yZZ#NefOtgPfp;j&fOQxH<>8?i6Xc)!YP2dfR-_vr}
zPd99*HEX-Mif%hbBM*k7LLmge(O4>!n?-}FL#`zLMj;$%@QG5hGH*{8=ka~|_Iva9
zI<*Foa!Y-Akwq+TJIiH*<dKOfNL{+X9p|66qdR87Z_8FnEE(l`eje?v>fnldp`;!#
z0_xR*0pV=wWkz!gkzy$iGI3obFk>PK*+RrgSW5fci;|&C<Mo!i(__%>@+}|*9+a+h
zH&(c^mIKm`;5#rS=@Br`F9^OjJj`U_(yb@)u6}fY-r9;9%<4jo=&E3JelkX_(ygT{
zOUGR8uBxFy>I@B<P-vKSLP@JFXj1H^p-RV1yI_<dv_`FIGmbf<-ki@nrUR0fE_1i>
zPmhHQW|?t!H`#{XD3qp&+CXs|=}+FQ3P#fpyY-~Ih2JgMcHVz)3-e4#8s#J_RA{u?
ztU%NA3pJ>X!xm}C77_?yy;pqGt|o(mVogYkJ9NZcoaUqrjy@06-Qg4T$w|3Ft!PZm
zmurPnc>kDbJ7#r}a+>bO(|WmyCc)~JE=6<K!9=!Zf3j7&0wi3-7k8_qRz6V7(pBzy
zZa5XZyrh**(U*zRRs2Tj>e4mh)eRtozTA@O?g;<PFI1o`qU438i$uvyz)de3c^F3$
z4R=WVwp+T$zd*Dz?^zcns1WY+A8piX&g0XMdU=mO3Oo0BOT4Hp8c@0=C$E>wwKMsJ
z<|B_R=beULwISrJ(P!NuS%%xax3o{ZIZR+#m1Rn4H`vW28Iu+Qs#Gh2lu+EJvoLkz
zlx;4GdQ1CD2SnL%Pbfm#?+)(X?X_%k(OA%%WhdXLk&cU(F3^ib;96y)1BHRoLhEht
z=}8Hd3RG&vCTK=v@G~xT8fFE8Q*){{$H@D7mAC79!DyWouWz<XAcioawoEKNZ<hJ!
zZY#n1mdOJ9<OV||nv$$rgEBQ%E0Q3FUAne3Dd3EGMm0Z=z6d>ngg<)9FzWd;dZP-`
zd9}M+?Pk5+FrX`b4om=(`+PLitQKLV3bjh51`C2_!7?MC1kcUE{N|0iS*|U51mq+L
zZYXIRQwAmkmfy)Qly%fCskx;NqUnugaJ!<L=s5=KkXo*La~0jc4eF8q(3+j4`o=|C
zs5gBaImp-y>&4bB-)xjUREDdjQ#T8zmRo1J&=&bSZ!T8J(4Q3V?ogA#xkcDjnYmFI
z1dn~&rG0=+z_)zSsG}b{Iw0u(K<Pn&`WW@#c@&sOmjv<m-rmaT#={_@XJMq+ZSvlL
zwt2M4Ib}PKF4bIE_L4SHQUT)BaBQ!Yxh9;WJS;mrD-W6tnmP|RA%{Mtw}sO3I*T`)
zfroF0sbzBS2<J<q%f`ta@zk5`!=R<Z>JGDih3+17g3|`-qcbLLZy8Mi?@}S1d35<D
z-8OA>!et;{s+G}+`?5F6cG~YROP7_dVs>(}=T5x%MZ@e&p69NobTSsM>?_#!DSe~#
z4N4Oo26xi=kZw?3>284LLYo-0^kQIXIZ>eDwX+4=$jPD?L6v3GE*TB<i{bQ;Rn|oM
z7{iA5S9Qz<6EC<!&FZOY?F_o(P~|rKSU3lzzY~eW{8rN}QVR1zG_F9tWNTMAX%VFi
zFG*t8F#JAF6ct$1You$k)8vfOeWjOijir~C?h!>ryPaA=3i3LUENDc@@Lr{+`bBND
z8_2&kTp4Ua9(qjPg|u@!xKR~drsvO?Mbeb>#9IP&Highv>P^imxeJm^A{%mzejUaK
zC@}TL8D_|%@JT3g;NQa1%s1i1`8iwpoih!SI$pBd=$~_NV9iHRSTBnTOE;D-kd~7@
z0wF@uNA*lIdDAi35>`;W#D0r=iRX?9uUGRtC+U^(3(|cA8jf^#x_V7Gq0%K4XpL~y
zu(dVlKEvM3DGT~(cK1bM>E)&SIk)tR(vOKR&oA91%8zk*Xl_IIJXw*kQ-FqFop08Q
za8=PSvj4!<2-nGmIL_-(XLLcFEM7tv33}J6I>sL?6khgrhAC`4@zyM`f#O$19`&xl
zm<6L4IRx_Tjd1(i?eNUW$%3)2H}bW49?S43EZnLPpeH%KbaCktQ9yWuVG&~_BxmYn
z(~+`wR+JYRr1E*;f<P$w4Kd7OQ5G3A*zz*Z=k^Ba{>Wziv;$iyAc%$&Dp0Jd@NUU-
z3n4^$?7b`bED)l~A{hc4BNSLDiR=XeA96uNJ$Sc5{jZ0xFPSJHI$rsv5G&F!GV&fj
zMdNEtr{07g;QM47*e8?C+s1Xme}EeVzXmQa^-0_~AuXaWrLNK&_YF>K@?}X~_V@#z
zNRmLdRAhz>KEoE(daW#=zlTw{iv0k|6>@uv!fXMpfN7$s)F+WI;W6S8*$fCgdGqv!
zQLVv0;Sr*>4e<`qC{Z!@=Wrfr#M<!sWrloxo~#iPrDVZ%;o-i}KKBJB$En*l&CC>v
z)oIHv8fEizW4dZMGu3)!MwWfiff>WTVFtXIs#MBT1;P!5CDGXZKmZ}!2{KK#cvVSj
zOMUm?gOl*O9^BP31p5BVMbk!)z04i_;DZlPp_5)A9}onBJQm3i@7?`y7n9NtMAN+?
zf|L%(#pBeGk9+Af7U9vX%-HN@G^x8hD@t$k649yG<k((zS{M0Qfkkrk22#m!5q;5f
zyfS4nb>0AlLL3(!x$oF9ZT8Ud!`jV<j~}}8*ozL`e)~O#@4fe6OVqqGcvXa65Y3<<
z$&O=(W?y{Yp%>%5W5-@pHm7TiMem)>a@1d4r2ftwt{34DgOTiumR?wT5sPR}loE!W
zQ^rLK!ebCBwwuyJy;x+B{Se<O7}LP`mz$NUbbMu4fr?-_U-bOp3q^USRxcZ;jWSFE
zyM;8Y67Kd6Q6Ors86OEV)Q1mN(Fqazwu{#|i|jw#UHAo*Rl22gkc*rziiA1}&sE{<
zO%gNVC*2l?8tsBPPZCGzw>d+`SkMU<z+UR7WO?X2yfEmoKNb+4=fz|RM2;7E@Op3-
znX9OQp+Y>kg&9Fy%4~ps+!b=6EdeC*Hc8$%{lXx<VLXfofRis7Iy=QMt6XGjxCmSt
zbdnfjM6(>Tg3t*${n4B=wZ<uOvX5?vW$D!d+zzt9{L%$MO)@7Sh&%Yu6&NdXxl4j_
z4M;1jUj;p+hrx?q)c6nVp>yHV;nETD)+hy?0tq=QQZJ&^ihc?`nh-dOJ>Xjn-H<G@
z-G&gB4bfY9K8E#t&&HNsQaUPNZG+};fJ)H|kvHz;g(7Ss=X@_GD%m32k9q~DyTjhV
zUb1MX2cnALnBnMV89}_JhyMj$ZlO`bxY~~e_;jZ#9IyR_61h<B(C%BNUU}tpbJ8x2
za*?WW2Be1oxa*r$jJ$=-+Rl08EBT$LKhPu07_=OJDxInrUMx{yxM4VsKd>At<jrCp
zQBwAwQJrTUw^4i({a8}ocp)$R##6>JM6M_XgF^^6FIIJG5Pz#J0QdP?t&9Y+^JNNJ
zj?ieqtdi&94%1-VX*Mu~9F-wes49lI7}h(b26Q9OF)4IDjQ*B_3@M=r`O^nLb56dX
z!10Sbq7<G|$^x=8cut{S7fxL~n!ymZa)CrL?4Ya;gg`DFgXSVIt)0T4$&+JxO=Pev
z(PV^|ccBep*YgNmRdux9K-9Q!3b8S}<hAIE`Z8ke)jZklX7ypjjcHU_%sb0<FZLwc
zz7ygPb>Y}^vs#p)DGH*F_&Gdm-tPZIN67`zkIq_q2hTf?4BL(%yJ(!INC<_J-3>-{
z3Nc#0*abl`3B?<#y94`zVq1b@Vld(Z2-S0H9-@eF8qGy)kz=PRIb-0L9}gg*JcoGv
zyb!F0QK8VAn*W^OT@lLiOyF4`#DzhTidjV`-l*iuMs*QZJD^R7bT+z7A@HS(d>|nl
zMF<sP1V3{us6oWH-Ob)O@eXh;pxMPiK?)s{bU-sHpa5kJkO^_XFD3$OCj(gL2e7#1
z@UVGI>yFJd?Z(W!S)D1FO~)(;uY`!@!xisr_22O_g15AwB6y8FE`wpfgbN0M4m2OV
zzfXyA2$niY0x3m|lM^`({DRWW!Va_Z&t((FKS3sSP2SMKb3`A8D-fQDLG(uqr(_04
zZaFS1-`FfO*oA<^S221$?F~Z0c~PgjbV3ehw(vv*BU7uEsVfuX5KcCzyY$1WBCFY)
zcSnVzOru!`8g_KR-L9kv1B*V#-3S*Alb)E13g+&%$icCkCxC&yTTbiw6O!J%XK93j
z=<YC_84<O93ci2tRz&6sCtyy<S|8`2Hok4*<a?J9Ac3j&XVZ4v1uZYv;Hnhw!pK?%
z@!d^_mtbdYF}dlkJ96Ysnj8eo+YR_!Ua>c#vHtuZraZhU%xTdD+tY>C(LwhD*&si$
zggH$_-yNdNbE26h&A-7uA<vs;_Fu#-^3jcc^uSAIHK6hrMqpX`X<bZI5gOYgxioB|
z^qrA(VV_$^*Tw3mX-T{gMay=ING|O})<yxVb@axjyF;2!3Q>XmB6!j|>uyuhF@Q$U
z8j~inHE?F#VbF#mTOv}sg-1Z>$iWbvKplj2cSkughn`6nGbZavMrm>s;b}M!G=4>N
z6Er^S?ku3xDa35y&*b4=5MLo1Pr94ym^h#zF&kGGaRf0)MY26D$UuXf8Q5?t8FF}L
z-OY`KLg?LVymt{((lOjBz*U_#4QGJ?Kt5;4?ITF^o&sr$SyciJrJr!O;03m*`6ZgO
zBchR4X*cK9)UBScX&dDQG2B0kK%kE4A0GU`S9Z^5Gh-qI(;&G*K!Z$K5zXHo4vq`!
zPR@?IS<ui6eTq4}(mHpgxgdAci#3Da2uYSMayN4oc`s<+bcf-^&?J~(t)i1JKJ@?n
z`}>~z{<{w-8Z1&j@avbTDk+jb_*)kT8ZMHax$gyTvQCTqkM4a%f+CB&kL|n2`UyA<
z`1M=&KYgt5JJxIbU$YDEXu6nOqk$@7LNt0QUFU9+(^we0((JvML4fGO-mD`9f4cQV
z>mJwzrJ+xS%o4tb?G=6|Bae)@`9Y#$r=G$D?6904EVisq0D0@T@E{!AQG{&B>(t9<
z^kut+cZVx*@kw4~(SMJk?t0l2erF?#8}rKgFy)e9Qr~J%SE(OIm%=4z;euG{GSbk`
z$WS88`*5Lz1uJm0Ay(Gs8T<+Kp+u?8Y>qW)kDqAq>(*DOjGE<c6!VoW>r2RN&g*V2
z<k6GSU1zeB4o93u!@vqMyg~E__%@7ifAE9cQD`5PX}Uv>4mXunG{|N&=dF*R66=e2
zhz2o6rK_y3A_Z;uIzA*bHPOQ;m<u+`9P6(L)c?c-NL$~=Cy=$igHHhZuK4)A`1pbN
z_*?#HT7QpE>mTp{KEFZVSHLISSE=}fa|Avc*R2kp-&`3Vzt2^0@lypJJ64IuGb`h<
zGw9m2P~Wa#)uxQV@yb==_|cVd+)7fUDNcogUqZgXZSN{^BRjW(TwQboLs+=#+7Y>O
zK)Vxx^2P#9{3}RyDk!i$sA8L0Wrb>d0k}go$T+XigbTd!$UWYIAnmwVKBP3DeKCRl
zOI7r(7vndS_)hV0RD2v4A9wMGRAPZ?)6JD@7<kcKT3}4so(X$HMnY&hsi(y{MharF
zl#>`*EK9_6?x8Fqs2~92hG}Zqr?Q<EwszBe6AR76?1XQjBL<C)@(9ge<PpBFv?&&>
z?SuOyE&o<;@&o2sUu@|0Qk$0rG9$jv)2<lXR@L^0nPh#7h{QIviN>e1snjisp&R_3
zjX<T@Fk7Na%ZZUQ_XDM?1mD~cwxY^<>MA9q1TqPT7DKd(_(<w%CM~l~j#X=y;k3&T
zq-}3yHY-^IzqbHbUx@6EP87p~D5)w>pgvLa)2VBgAY32B8#98yvJhVt1Tt@6NIhr9
z7~B1Oy)c=r8q`>>z~$qqTh*o9yW<lM`XO3xCc<`D$|p>1z?ElGS03ZaN3w$WFkb8{
zJ2oEEmuc1^Y;asJQPljE)W~;B{GkcVNK)-Fntw5MoiUpKc~%g8r}^-0SbfLQABE~c
zvY`9A_5HF#BNOPt1O_q6pO?DU80G)>IZOFXclwLDB8ErF5%j+{H6^;0`^^&~226{}
z5)95&sVk1L;EJpu`Y!yJAC<F9nqDnxv~$FnGOKc!QUf^@omjE7VAavo&Fz*|+JrY7
zHU)gAXx$RwJB779h=mfqF%7ySH8L^w9nK1(@9ewO=NR?lQygq-$GjEF3f9$9H?>>V
zT{hu!i~D%SwG-pYsZohB&dds;?~EIt#g31LS<sHrY9$?$IEtdhvjuyePTinx*|T*5
zGunjF6jtX6jAE+v#?-aPIP!+9Afg;GQb)2}WgIH#DF#33VOaq>M%M22H<=V-;N5QY
z)z;si%sTo~LW5zMv;L1iuKiqUCM8Q5#V`>i<wY^dxYi2X`Ol`VD<)IFBM8}!hV4hN
znTfdVL=!6lZ0<AfF|hm*f!{DK-J}9S;=Yr*y<O7Q-9CZskid$2MlAVZtYSL+SE=id
z(fgZO>77+(#}5^-l$lm7X-7<>93^%<TabEmLvK9xm>9cTCv*>^DR_;9QH;>J)V0S5
zJ(LwhV4c=8h_+@VD@VreqebiO7!u1B{MeVeIo*o>_yjMa2R?1tF`c^d7(1@Z3L?sm
z4E+st7J`aG`!awCu=u)A;9dvzM((8*m)M3IF@~XZ(F8p;A-ffX+=T7p5YxzqQdb)j
zfd{gJ=s)qj$&o1WgLFasCsH?|d*XXrI}^;|Yg1PnBmS$hf`}47gYpFWC%laeAOb9Y
zJ8K^-T}GaZZRhT^we^|39c6Am?B-ab@O_0;eKIv~lBJ58wvx;E@ziz2MClm@v4)c#
zTW`aH6YekN9A-pK6Y>RNzm&SMT@u#aHi11lgws?9wf%hR>SMJ2v#cNjh52K_u3mRo
z<9A~Q&Rl92Fo|aimJDp{jb9m)b@-KHZCR(V$PcrUGnke7Us*x)og-s+VrSEmKhYmi
zl31?b$JKq~$M^)cKbT9M6y(a(mB$q1@~j~G&JJGcr5&o`%muk1HEjOHN-!l`FyzkE
z4eHirZ58u_dI%#)&LE<2Bz5gEj@*_NMBh1bF;-HQ&4TIh;w~(N!P;glUl&Vt73Op-
zDfm=L-OO(JbjgGv@topdFIFOk@Qks{N{vX2Ws6xs^qpnfj?oz~9oAMQ6%Y*i>C}zt
zmO<Mmc%ki7=M@nDCUyNWzWh{H5Pj#%*sUPJDeX{WQ69des81|caO5MYo6{{v#wU2|
z^AtAFN_=8!@}bm~$Jp_~tRVW%j?K4uYx85XA!?Rj#Gj{bNVkj_#dN&fB|w<OxbUZ`
zYmRZ@kFtX3I~QQ4u*-`ED&7PYO)T1)Q`251PSjGgWaZ+5TmL(CgS+L{6<EY2FrM-z
zu&Bqer<~f9JOeDo!GB7PO^k#8kQGFfgBbz|K`cTHV>5sVu=q&Uv4D(4@EXyzi$(aW
zx5Hv+UF^ppo;%c=u^BaMr8vZa)OE$gXfK0U!#Ko+cVLkVo$zOpPa-y@X|sINT9~44
zhjK!r?@QhIWQ~py+P!F^6vA-|rwZXTxG9=HOfbgxq(&pggS)bV2$blUU}L-ZMCQob
z7RjJHD|MV^6d4UiGX-CkQ@5sDzKl&sR+ti-m|Z=cy6zY=Y(dF(2BrO6Zq}Ks&4RXA
zhe1c@C_12K3G)7I>Lzwe-q8s`SFFDvOk%`+YwDU~#BF5-5lH$^3;wi|^sHRia)(LV
zC$(fjk7No?d@^-oy5+<e3=m;6)mG3yp1STBFP_N?qVK%8;HBPK2wwk?$d&fR1b@Dk
zx`EyD=fVm9v<9ztXv?Xuq{bq~sV`;)5#>|{KP_<egkj78BEVvWUMjQh-rX=y<JcOF
z$I}rTx+Rh+WMdnSob1J(j=1wMh6p-iBaQ`5u%lzC>yAmp=ByyP=0$doVHQUo8AYkN
zQD#Ik1v8$Tx;5P@>evL%)&VwBOB0xJAa&g_X6$7UYv@9c!yJkbY@%I^XA3gFJatpM
zCG%GD92leaJ=TfTwZ{nk(ySl?sh<_R>b3W<6MHG?z@tU4!%7&?v?(Ka^Jwa(b<3Oc
zCn^#*ud8Y^kXcHNLX1JptRSKc%FxRM9hK0>3?Kq5R_LfQ8^@h@V~Z#b8^AK>N7~uQ
zHf4mIygxOCyO$H%zUt%F-eSHtH3~5~c@KkFLyNi9->;qAFD2v)djEdv#&%2ZZJ61G
z9MB%}_O$-p)YZpm{hzaf2(;lp33m0`XkIFMFS43?HP}%vIi!w+S12o(_5IXM?Uq@W
z$)Pcg$@D7r`>33YkCp!>H7YU2eLE|NzB6uTpiP)E!8vz0+CLh)Xj4WoYR5>wyzlcv
zT7^jzA2&(eV2*xkY7}A&+L9GS-x+jOXjY!IOH1l@R0Zqq6~Vq6Q#ZU@J-Zt0^XKVF
z*QSy>rMSA?kQ$>HH}_`+(RXfMd<du2Emv@jPRvL~hF2X+3f?`Kx|!Yb?ve@J!!u?e
z69!(dNR3F0WiQJLqVFubBFr*hpm9f1o4Nij$_w_rI(3t~W#5$w`$9N(S`YAeYII^u
zd?YJ~zBBRi5EFUAL0#+=(Y+N*3kLpT>gIOKKrPHb#usWB;$wmizAH5{G4}m@RuFw>
z-xYV`3^Z~sPm~(9=3>bkn)`iWgn?a@7cBft>Lz!~!Ye200_Q0lj7&ItLw3IxOkm=t
zQ==1O;-|8Lh%zz5pgS11i&0?)5CIlq+@1kMfQ6V4&j2F8Vk&FAp0L1iUVPS7y9vnN
z@2+Tb@>_T&(%R*(Zy3$>#&@SiuC%@(m%6T)Xb&-nH4HTjALh9s9OoP+pc^C$BeExT
z(~^xyjEwHc1U8`IEOB5UsS%8NcBQU0M$l`rf(Z0uLhz*5@q|q{MhAw{wCNgFh4@O2
zp#R;eo6#-(H`8G{J{~a^98X<wj0G>r3Zm~U*hc4gA+Xt&6G;UGL!8u&>XsqfC+IXU
zOagV}%fqSbkMX6N6-3|pvi`@6MorZTktAsUGpP~pmi8Ma9-*3JTJYx7HO8p@rmP_P
zPHilwU*y$o?ao?FDj+!ViPVkimJ_tzp0Sc!yKn+_f;0Ki)b+>s@*7z}^qnu`;-uw6
zxSy+pi4L=%YD7F+@Z_th8`LdNwoc&8bsTtuPRqk6rYT=aU3-ippU(=S?;P1qkz^d1
zT5fwRabgL<m-U<a<cYdFIEqYobySvt)Cj~_^TTtNHN&@?r%k@@U2&y?WWj{V)HLW;
zIYuUm9tJU`xH@&MG0I<=6-3{aV)&jK?(RY4LN!l8vY`C2)D7sK@(4Z%3}TeOGj**o
z${)!JB1-uTgY;mWF9wDgKm=H<&#Js~oX;m&uiZF5;RN-tYFp3q$M{dA=1{U|Q3F>R
z<G(g_T`_@r6@ysAG5#oRNunDYXkI2V){Nu{UH!$>jqH-3?iP7ov4=}cVc(Uy>KJ{0
zJ}ZboRenyesMkaO;aTGhZ?=k<N<UeU|1+r@&@K5#u)t7a5TpF3Q`Z`!{HL;lh*Ca-
zoeNB*(60<20xTZO+7M|f`I3gUGnJk0aZqgLVc%vBY*xL|m2XB!mN9B+vdy&px_%g;
z=E`+R$*TGw{uhH-Lz_8%H!gjpJDfDTS*OiJs>;T*h3abkA}bwrA~BlsFp^XX2z_bl
z+GB*iC@YAP&#UJ!h_-?Mtjp%*L7Yt+clfHzP;vwxZcp8eF2&p3EC;~?j~ELMrLH)}
zf`eH>^qmFc6eu<MSf<-FzA7wiUEFxKU`8o*gSutLRt{b>MpFd@OmTTxj3Y+s+G8A<
z&kCYzj$~e<dkvPf;a)!8fj)0IXAGmNd3Wc~3FWtG2@XfMFA4U!saxMI`>v&v10?oS
z68ot_W4Z3s%6uwoflov61Al>~JDVD(7*k)zAl9%;*-F=1;RG=a%lvS`EH2qq%~(Rd
zV891bH?~^_Y@4VFoTdVtVhZ%W)YZpm{mWTF1Pb(vf?d6K$;FK=p#=+yMT_MMhWyvm
z&FPjQ@;;XkJ~4LuLF&q5?D)N`Ao|XZb+?)kPm5Co+5avz+TD_U{lq-#jgk5XsVj_;
z`g>VH^qtgO{9txM4-w5247hN#PlE<`EC^u>Y+}4PKXu(PUTn__qVK%eaRfKravxr=
zVR3p=pPgJp@a2}&4eM4hc1|ov%%&K#cKz{9sWFIg=XqH{^qo7Q^O%+1A(Sropr>v^
zw|q!Ar#Wzj9!gzpjQ9^^1<`lnhi?Y(4(V68kW@gh<B8Ob>Xsdyt_}$J^4iq($N2K9
ztRVW%7ZEtNy+E$Ql1QH5#;>GqO1Io-6I2cu@k^<zjxplhSwZxl5%(AvOH?&^c$dlu
zHBT_&bE%usJtG>7OXMK2fDxZfU3H8RzmpY2-x)FX(x!>?5rg|u6;{M@1vCD8>gIII
zjB%X$0eq$cd?YOcc6>K=<uP{rbyg5jb_DVIuEWCxKjbLJ@)<w`SoA4sx$!to+iOHt
z*LsOU1g_Z9FRyxNq9SUKasIN@b;dY<aaIt0r+Mx$*}{Y)e#04p_J>n9qFeRbG+_i-
z#OQx(>Uv}Je_>V-eW(A>;UyghY(&CaeyX6nnHv3WDL;&}ltuk9vM;2rG)DG9RuECL
zXRua*!4vag89)SB{Lieja)gC<i~HKmakjteJ>1P&_xpXqzfH}kWC5ew>Q|cK{DstY
z#pLSk45Do~+Nz*o?htN^cN&J#?ke_g1J}n}lU>|%?`}kl5tsP3_%eET2wxi}4vak6
znw)jTgc=r%IQmlSbuA>|6!iw(C`PMrDIv#eQ%}&rvHW`n#kLVCC>q7kDq<?hN8&5j
zlvApIEGhk1cjU;OfMU3t&1#|CEaHv{T+2qNSicLZSieV)&(Y(*(Br?-<B#a^CwLg{
za7AA#8g-}CI=aCfD(H0wXtvz;0^_b<EZ62+XWflBw+=Vz;@haK*-se8;kffg!zi|n
zg8Po?0Ha#9yo|EBhJGd>7ytAswY~t1Bx^s8ukJ>>)@&4vmV5KeeKu~(otZC`jOxto
zwSqXadS($zX`Ayia?)d_SS#2w_ZSN}phtd8H*BZnuE(UCf%Xa8`3%)EulqMTX7HGV
zxUI^7ylpjDH0PV{7^FE5I_EuVlIVUIB7Ag&Z+Ser(V{Cqj^->nx9sS4-f4zkv`*{j
zI*XPb9Not9dvu`bZXsy4Q4ox?TaULy(gJo<FfTc2Txw8WGMo|_M3>TLyW=dKd8d|d
z7<5Bx5fFr+K7~)R7H?#U4Std62ERy#gI^@f!7q~P;1`Lv|EuYalGLJJwg7hPsg}Fd
z6H+BLSFBZV#0Bn~(+M?qpuiuS8nv2}x0fsPwQ|dP5_q~B?-jqEZtZ#vx8kpmI_qw>
z&3T&SJv5KmA?T;~`&Oe|JA>aF`1)sj*%UerA3uj6y>wbrYu5TEP@i?jO#2=qT;{Ah
zlE+cH<swWE^xGZH(<c1ef|TaGJ5-yui~<hm0ApT9EIzO4juc9Ib<wa5hnq4ae};<;
z<BkX6@)0}4i+E2aGVe#dU*OyVr8M1jg?gPpTHD89Pksv3Sv&AeC5Uwal4h+7>FJJe
z<L_$RRY!}rI0hUYoaJ{n9Y$m$WwV!pt@HS8UCggu!cQiObt%4|wJyW+WXsa{1HI|@
zQFW-n8^Awfi7}H+@hvoAOG<*b>7qq^kdokolms8N#SR~&B={gD!3T-u$yT%J4qDXk
zN$W~f3=J6)N7O3BUSH8+OGAZ5OS+w>U3z3##p{H?S+4&qSAUjkKg*S$<+{&u)n~cp
zvrV6qgZ1SQXzLC}!_Qqu#xAHiNVgqUGj~(HQCqCBg=d^)Gd7m>c>`z9<5hQf(WnaQ
zStkL#bd@`5*Gpz~X_{|vfGysdKhe;uHu#42+})@xEu%l3v>rlfcPwAlA6d@hkQgpN
zJuQqlzYl5wG)>{Q+zod!f1K89TGl+?vkLSm(!;>xC()hF|6~hYQw=MliIc#5nYKrZ
zU!|+8ITV|Wyz6d0&WAT+=RUoY1icc1zR@=5Wa^e>Be5OGP4{vkoT-9kGf5Dg5JUyZ
zD9Y~kyO*63PK8jAq*i)&jJH@YL%-c&@4ECB%Iyqo@UJfBK@A*KZ41GTWcp`Jx!s-g
z@{`bIT%3y@+7|@oz7&DiwX9QUrd4J_;TKU%k`2Eep<j=Bd9S2jB;eMo@D16or3BJ0
z>&H34lV*1V&Q*felOb8})QUA0U8%1dC?QamldaNDcZAaNRa&OvTbQo^uDjiH2(-Dm
znccg!-7|A@E$geuItju2B0i;o=F;m=P+c<H`Z@s+NnuYI@<7(y`Z=Hss|(Z29!E<!
zlEeOQ1rfX?Dz!e3cS|ReGh-N8-=do2n~cw9v3E(jkYT(;Sw`&xMAvuI<Cp014eB#Q
z&k=TRz602>VBZxVWGC_K2jb&z`9nHf|9~H&&F_l?b`Pa@z_<;f3G9V2Zb#R_TK@_v
z2yw(GTbwfQpz(-88O0Y?D8pr$GM|h$pf{BHcpR|xF-oJp>F5xeMvQky<(=kvzG5XJ
ztYZt>l6DLJU#BhO|0Aj-#&W|=^n~(rs4^Xo-I1kA`6j!L^XFi2XfR?l;GDP{utpO}
zXWij4JcK40IgA0s5+XQ&C3CS<#(yV|YhqYat-nubAj@8e5F<j4RBAQn19w>nrMo%g
z+}JH$71CI4g3!7{@K|}g(pGXqXc2$97rjqKMNh0|p*_z!tv*tB0$5y}rSE%jA?c0u
zeJ2h$)VeXW?)On5q*(4H3wsu|o3uyuJ@b!ilM7~5(|2jN9Mm4rPiph3;B_vVB!&N+
zS_-W%Pz%0Dk1yeI*7`D@fxKB?#ZUAGEMwN!s2CZwP#d=jHmih45Uep;1u;b%!6mDr
zvc&~7r9gssS$|D9FjEt3VhAsyefN^}&8TE;Jf<(#n(E3Oi%W6c&lv|6{V?=9;($Yq
zy1+AMBeb3h`y=Zm)s)?D4V-u0i?MsGZfms#Ev(EMq9a<Zv8Y%1=u>Qb#W?}Bsz&}B
z!Xl)y)48xI*Un%huQ??{voQn;m($>y)^M;7t_1S47pc<e+%b&mxoXE)!m5vw?r^=L
z5>$w(1A~&Q{N}uYGkf9NE)ueOE`+X91%QOI_Go7?yfQQjAjGT6`BlLa!>vW|XH1Bk
zq3If<7$wWJhQku7HpW1WJsM1}CPS@za@4eiS{WlmLeN`+8bZXrNzvCI(SB`dA2xv2
zB<T&S<~4B*T7|85Lz)&feHV!eRh3OJ`8P(~i<|}tMkEfO%j|aS)|T-75zht5<rX<(
zSrIQcJD4z~Jcs25kSU$Rvg)qliZ=AR8mNT2$ot1&!%mb;TPiHZ>Y8(=7B&I)9#}5Y
z&W1L(Fo)A?$&$(6i*r!vLs*my{mls*;VmQg%FZp$bu>*>&Np#6`~t)io*l&P0@Z?v
z$skRy<IHt&GaA{7uw{U?WCJ%h$DE!6Ji2Ny2Qvq7Y{3d8yn+6o0HAej7<oLe@%i9;
zw7F%`vbjg*raeiR6oaE(U6V&$ke%W^!K=d^lu0<&V;o7Q_!A_$3ddC$VY%zjTn~AH
z`@n*NlP8aNcc>|d3wJwoLL`;~+#$4r_CP~<L^rC)je?XL$qQa?*Xdh#sX~l~FGd@#
z?kD#eUhHYZt%nF48$#lp*VYT$>V(?v4&?%%DQM6o^UtgW4K^^p)%MD?Ol|9uzpr15
zwq4rMo~dnKp=>5vbjjy;tOYGLg>1LlawVsq?fkX1Xy@}Y_ev^NRsp9A8gleyNJd{G
zox_OVJ*r*A2JSQ!EIn)a>7G*7^$`nN;+f1`&}A!_xZ#Z8wcZ=WKksQ%+jI=qbmxnx
z6zKM)Ow?J9cAM%_Gfxn{vli4z=rXLcRB^b2jraVIM4Rx4LO-twKU|9@3`{F^yZ9Yo
z-%e<wVL>$vm>8?Ro*EO04eb^+MF&Vx=q@I^IM@;m2?gn^i3Cy5r29xv4oAQ$;q75;
z5w0LY5(zGHITnK}x8jX{#DXr50}jQ4_M=&mk(2woUX(&^sJDd;!_H>W1W(y<Ds{sV
z@g16;!SIBJPzL@}%qKTDN7FTXIFUwBE4+`gTr?DGq0o<!BY+t3(BO!`puge^;(Tyg
zMPEi|t%*Cr5GcZ)HC#<=mY1Ugp8e??riy(Q0780a;#~0K3D$2z>O(_UccUPu+MNx~
z>{gKR^#8^Vkkb!&tUvM%6QS&NV_Q_#Du}qz%xo<V&+Un!)!^<Kr6RAzN7tgo=$%NK
zR}x$WLATqNvQcOzH2WzjG?PrBht`5ZFYUd$hC@tlAK<S{_h_$@vCq0*)TG*8C{uJE
zXMSckVnPT~;h(OWSxk24W@bXUVNuK}@8QR+xUO;cObm!>Mb@IiFc&?YJ;TN%jXhd*
zpzy{vJa{YSexhu4hrP}%Hd`6aS&aihJ#F_6#B|hw*mNgNu$T+D(mdira8dRl-qc&Q
z4;BtQ6$c#hA#RKN5cj_h(O0jx<&|Lqb9CC6C9xgq&?(l6&?|>5v2d-S7tr<FayYtR
zV#!m^Pu40;yo65PfM;PeV0pB|)kWNJUDC>igZBs$4m$*Z0?iFg&dufL=5`5SxnTaq
z2WWd<Lktq^J_TXT3XU@^nplUrCl?2d$T5)65XHru7Am_|RCaHTrnmw|X(jzMCcf$b
zr<ZdT1G8qB1d>r*Z(@FrX7dc#GNV+jaXXtduZDuOt_w@(Dn?^U#CeN34(w`^wqa;<
z-ZCOK#kV%ivV+?~<SDGRhCP?x74?B0dp5bE_Lk2sD#AMaLR_-j`(+zgs#JqIkXIVz
z*}M04fSbk&$~p7ED<gzGuk1uW1YBv3+n*}>OZ$(n1?|UnsWw0*TP!zQi(ytG(sr#<
zk0)(^uof+LNZQug!YR#lpB)ss;GMHh9l>3>vSn5od-)2MT&2T`r3K1=(Ic^N*Yomq
zcg1Sm4Vb|*i!JwZZ|N%^S4G<asAH1HaHC`L)&d20nvh*{hq3yqRz6L;O9nh6H;67Q
z>`}Uuurf=c9$rRA{;;S?b%1~x2c$>f%{bUnU^LW_G}O{tqbdT|-aZ(0R`WS>KOiqZ
z33&~wWV9_6CW<w(&5I`v(YKxjl7fvx(XiYxL772R2YN&YHZLKG(eOu~`@ApL(id9v
zV>I%Vk(-sJ=yN}1(wA$gm?%X*RdVzaaF~LgDLtRtlctMa^*}|TWK?e5b!KtDKPYi`
z$~llJUI{RD28*}q5I>zaN<<d`N7t)9DZB}6|M2BDNxYfUpa<{ENLYloDJ-keXlo>M
zH6tb(S9CvOx+gkfTG3jC*>CadJc@cjPZh`tMo~A$0f$CW_o21XNNnYVvU)5;cV%Ru
z$&m%Z2>vODB7B9=Xf8aWptUZ+kU}mUDT=is>N+%cjq6sJ@e-mGGvkgp&3yknjgm?~
zI%$64<)S8)JD!Ojl5qjmz`K7(jB)gNtlyy}K4-K7#*rAFij6Q1#%}Y=TB9jeCC(K}
zwfc0)o}-154n=z~aCL6VVP_7a+e;X|R&(Y;4ui?lSYn9fZ@k$vC-#Bl?B=}uh7+*F
zP2)LvS~XtL7b`kGYA^!MGA%Z&=4gp*PAm<>*f?kMC6YPa&S4WLhM$1HU@n!#M?-v2
z-4)X@Pa8S^h`k&Q)y1XI*g1EmnwyWTB>PuNgRr1_oyPr;(yYtiq)qk(ElC=qeXrw*
z=SEDyEMoVc>R60UPiuM4p$yd8+XcPy@+a#D<T=tdABmk;kJt~<?2IFj8vsE<Ga4a>
zXrr1F+6kr3mwD(bzMr*B=70^u8T!^UH^<sZ;35-`XGBd7ve2Z6hjafiM7Xe~Q27(e
zERv)edq1S=il4rc$)8ex#V?_{upi2wP+pP58tmml$GxxgDNKT&;#&_+VT%*!wJ2pS
z_@&W*kZq8^h1u~leH$TC*w&C?@C)FJFg7BEVKro~v{+tQY3sb7WU>@D??==nOWsTB
zCYh}#ShCY}qshMRdTcNx{=r^!+~uJtRMgR(Bv1E1i>;2~jn;MpL*KWh4T!qBY@m&Y
zYt4{4vz<`8b;Y%HFEo}AnstKpoyGk8G7n6!W6|RMjwS%v?sF0gVxWs+WF;*w1|t!5
z;NGA*aKdAd-nZ@T2DlajK=j|bgMqP_Q!5!}13k7~L);j>GA;oX)9mmxFwX-WHwxH4
zj&-u37dc`sygu69g>vZC{c>g9cKlGVm^^%{8{EG3>bI>Kc3}~<-tBYnUG%MYmOjY^
zd{vUH$Ue5DE1heoD~s+w-64+nU>DmXJht(McR3~(Q5yaczu~{$+lKQ%B+|wGxM=vV
zp(fc}cca5QTvV4L)M^>gsFi72qfIIQ1df$m4Vrl?pD~McOv$dm7ZT6~cK=CW_dEDV
z@+mS_wp9)Z{$HXpn+jPEH*f>GH@(=dd0b>&1E)T;lMMlc4)CB&^oeLkZN;!BKB~wB
z$%>eK*GKz1^sT@8@j5}Ezd}vv++4}f4T2B?$~PE_^(}mKMVHY-VMC}ACz7X7XybN|
zvFqvEnowu}HD#fYb)Ju`AWyV+^g6`$`@CJ2M?vDRWM-5Q`y_psuNB*gGWL_SVdiA_
zY#y4MyXBUHp$U)3swnFKktl3T*P*;JJn)8NH}sa@!Q|V%tn5wdbe<Gcp3Vw05Si;3
zME9iL(4ei~swT-aMT71oI<jeeDShj&21#<v_KF<oHORWmZ|@{y(F?K0TD}Lv>$W0N
zO>6y>eBM+v_+aw7u4Zr95D50eS*e~R*sm8dQ_Tu95bRTe4PAE?-3oS#=*WWoCi>Q2
z!ItEBs#oMVcLaOp!S?2w7qN!(g<#J-m}s$oqql4b1p7l-sh%X*u8^4zW`!9D_OCLC
z-dpTHAv&^P{}FxbuV71Z{9&)iagGS~rR0cUG5Xxx72@L-|0jNXz2;=ns%<Lh6_6`*
zZ@DE=;Qyhw><I+^e=s*h<pY{hw~OCGIH*uN;Yey15hBvAE0Wul+tD6!nn05roORVM
zYlJFgsh6#fcCzeS#@Yb?F}V?!oU4tvA}(O-kfw0ibAqS)+lUOxnq*S{jo{n&S8qf9
zMhJe_zQP#Iiv}?^HU8|zauvt;xG!)=drRdGB)S7Nt#W87NR)wd{cwz*H#djT9<1!m
z;tBP{kAwKY&Y_#H62HX9&9}&(^y%55xB<rU%<%Y;9gczI5n`>kYzxfPDdtk5`3;#V
zD%G|9MYBL6uh|mx&51hynhtO~S>HGR_ivxaf6)~rF*DqK`w&lznqiD}ZjM>u!JCuq
z*V7r>()T8ih^pKeJeb^s_pC`1a*8Op13B5rrxG$^O-Q+<^K$c53T&@yd1g)8r8+MW
z?MardgYhODOm4zw&&ejhPhnf9iq|@%CGz2m=V~Jkh7GllrFBS4Y{Yl_+lUOkT~a6f
zM&YNFfb1$eVS_<*KlF=vB1#N2maF(FqdPsvcoTi=?{H9(Xc#s1ghUxQ*AG7hmhrL2
zLKZ*LsaaD**>G5T@Uh1d1%0NsEC_s#>#|ZjNzk7bf<BoQW)S1Jnn83g=-meIjuRbu
zw0D%g^;f7RIqv8cInEKGhEMrW2br!AVZ$;#@KB;i*Lur<K%`G)rFW7@zggPutS|$S
zHW)<rBE7zBEJWs6M3Q2q-#}Dkf&MA_)?a~^#CWn-#5hL;8dmz6YdT2u2Z*v^i5|S>
znnaQQU~gFvi1hojQankd-zwzgy;)%fBK;l)(Y;7_Yo$L&bY!9aJ^I#Pp_b(MOs~js
zjtDiZ^h5`l{u?4}Sf&Ri5=HuZy=6ck(tn+m-bo_;HX$wF$_g_O>Az$Uy%*`x^F5K?
zMBn-=(vlp*sA-knv>?YhBGOkQMkm95BJOw4|LOe>jp5@lKG=DBK^-6u9!!q%&GeQ{
zf#6@qTv;i~N2S_HNn&g)7UmngIXTXEr~~9qalRE}W8F6_ApnEu1#?qn&N`$enx%Ws
z)kfTWbBqz|ke1j8<6LdT!FVhToJbDAoat{PGMJvE4&vuT2Qdj`S7{NiW)R(X5Z$@)
zZy_qO$J6R9Jv$KNr+Y<=3_R*buw~QS+;u$jGZonQcqahA2&GgrGjLs^em>J%Rs>zZ
zhney#bpceW>n;Gz3N>4To=R-iXFI@MRR<uNl|dSkg!COk9sV7YDg#=9OZWc>YIi-k
z+nvV#6;Y8j_P_O(o*jtsjb0HW1CRQlv6thRN7h(6zj1C3{vDn(@Zso3M^_HwjyEG(
zoP5UNrsuR*qYQEtXz>sL!;=wH#cd~?s8kv)4zKqVpp%z#UfKcf8Z|4yjRRl6#Ry-n
zPBcR^=VSvgMj!!HTQE42?E4%#SDO%49wDHES0^{&-u^ZrgP}>Xf4?9s?Rp@)O80Gm
zLG;>vYY-K=GpP5Lo*jr$=@l_D@Tec10W|NSPV)+HBFcs%R)Y^EPb{>0%Ywk*zcDMt
zleqXUAun&p3N!F;Ue6%97wK-Jupc5ivQYmTed}+?N|NIPy&}gsBGebp&AkZj4E&iF
z$<Hg;ySV}%ULTV<MnP#WUwRlXO6*1dxVNkcg#8bh6SDKrRQJXmM1l|vD%MUklHycE
z2DM>>FG_CNf9n8wRSr(4mRaAVT3P62vB;FY3lAs6JIR|X5_$8FYte$pI_=O>r?jjI
z%cSJ{70C_TbU}Nj_kcASbT`SuzFY9|bKt@%orcdci0&<HcO%H%L`4?0$==el12L{f
zO+6t-1|IdpY1ls5tm=*BT`;f+f8hDbz`V$t%7(onijKNLvf#lT9e5BkWH18VMq6Im
z0q&}Fg%DnO_?fm@A^J(%_DY3r-ZIWYf18y-ypp8;J%YD~nN%659XMIH3Tk&9MC#Vb
zdM(kBjlipWOVJMGc)VBS$iStj5l9aLH^lRHazQn5?m`+U?s^;=VYiMB%JT)hGb;o<
zahgRG9vv@py?>Bm;(3YQX$5>ti*$|>&W{NW?VF9Cj%fW49Gw+C6wyBpm5+DvjzbL&
zZvk4XIVkZyH|O7+D34C<{@ldV(Q^|o_0JJML6<F;jnhUsI8t1(Bo@ESqW_8Bihgiv
z;z#3v0|p#@AIxX;AdTQ$adDC!U9E5$7s41gMu*Ow_s`l97YozfymXmNy(#W5#(6h5
zL=WftRhu|=-7IKyI+d;QiR`$mm``(GSmyg^Y+QoOr?=Y1!%aGm$Bvw_^X#IctTOvO
zq9e2FcjFZ8^_hylDr!=B2UdNs?Ku&#!*oKz=W|RQb?itiqBQ!8expC%+eRlHrt?A3
z=s!bEXzHihHnqnG*=&}Zbb^Cyz9lf|aXpjm>iKe;miFTKgy8fWC2kZXE9}l)=*jpn
zed}+y<3obo8&K0K-SI&N(f!zD=(xB^LRAMpRUye0K1nWLGm>1=E0RR}@Rd)&37z5b
ze^?7Lc#K!m?r64@QjxAjLef!1JvsLV<B;%Vb|h9|y@a?H4w<%@=swn4?gl}mJF+q}
z$$R~<pzGnRFhkBfgXmsoh7T2sIN`QdRh1@4R<y<<YO)BF=v#jci6n~AE26AQYhEbm
z+Jgg~A_MHGV85OSs|a@TQU|xU3<w1K$*lBF671g)((*)Bn1NuwmO*qc*qiQc&f}Qo
zLR_|$97Vj}M>J*eelLCNuXsz+yr);BId{Z6ynG=l-k&AHD&n2IwBh%A%YZ<<Ka-W-
zN#gyCkd{wpg&BzVrx--{;=Sc~v+S7lvRS}Ms8Q=3%~XW^+eBH>jnlXO3b`cEU-pVX
z=Z=tv7qdi#Ja<u4$debkY^HL(V?ZF}!vLJg`A!n@j|pknkQHVi<bw>Ndm$gb9f$nd
zG4T$P6~W$3)MUY)q;I{WYX_oS-7BJ;BZ5t9ggUKMcnMK9Y`zC)l2<Am>n#fc(Y_-q
z#gn-B2_Y|sv%(BS`&I_gy=YI|W|+9SbP;zc3K6I45^1eqqej;%7PV%5m*<kp*`96j
zSCpuun^ZtFu+)JYNi#rU<JM`V-oqW>W*A`xTqcCQ8KBJyO~NYgs#z<yHG`IQ5F3M$
z%+SuL*knK}m~80j$mHr^jxj11*3T2O!@56^y!!E-{Su0|XQg)%4?iiS<!xDE20VNV
zgXmuMhmO~Z&2lqx1iGIZ7I5p6L`&||K0)95+owsAe6&|2IY-1AecIKX`m`?-Wy5kk
zcy)50_SN39Ah32{%u4Yj!Tt|IUj95Q%s{aJltFYa*jIQR6yK22w6#ewePn2L9Z{z0
zqTi#5`S&i$E6VUgqCYFcKhwAVDuX2BKlX}@=Z-RTT#9<x#ZhHwvlLaMg1uuwpbVD)
zaL>jrpAzzNVOE%dGMvvKx>trRhnMQO{sniFCk@aenTnVnB+9aw-%Q_nN8==GAqn*S
zUJ>XV5p(RhEidlx;LJQkqzxPWbttd6)82BRx!y7%5cCJL(maWezbz!@6<J{hg8niF
z(Y>Hw<XQc4Z4s*poKi)boY!qb+aEFaoeC-n@JgaME5Kv)t-lH&3AfxU!kr@uFfupC
zx5so)fuAShhE-sLxNj!R3r`8&*;_^gO7QlqbWc)(|16~DZCPOkO7Ip2(Y+E}ajWUz
zE-GBtqfKJXi(b~SB!+F!Wc9jzyXNM6U66zM9Z4@J_Qy>wBAWP#4*ZA?+}zD!M7*Ga
zaKVOQ^%z5?YLDxm?odmHVQ;{7Lf;$S5A0IvcJX`VHfGSW4g&L0Mkhmyq5_ivt$qyT
z(fd{Or4Fk917d7g_1B@i!Uj(S{<dEt@cpbbPvYZegv9(!R+s@Fzs(@JSNx&l`jS~`
zR#dg}Q^U5@+IET8uZ`2U{`PB<B%`P)lQ$hD$vGt2X0?N8?<dl#qHR_aMf>{RG9j>T
zd$ZC!NwhyJM0+YL%z%%(8AKY<HmgaZEmIZIzK3YZF5BJot-qozNpiebB<X=@X8`d|
zT6xJN6U(X6fQT&gw%+T*600nuuxOF@4c#pAwtmfrq%Km8Tmqc1!rQ&nTfjX<D}%)X
z>8W6iYIO0pUz`^b%k|XZ;;UKuP3xb#U+ev|(Y4;=vvQ5|F%uUQ>sV8-NIREj)}8IG
zv<J((Ul#`)THgH!XkK)A_cuM9%Mxb|x7=&EeEkdtWsXtBCC1vkNn48cXtjc)m-pbF
z`+`}aFSSOlWGw0Ow}vYqIA}4g(OsxKn8N~b9rv>{H8fn+UNrEvVpheK?xthY?W?#X
z`6k>_uy-EwSPQuC)2j|iHJK!9uF3`DaFoS+R6gh9qgRXYp7+9qVK^b&{DtJwkN(MX
zq}7UmxaSO3!oa*GE=>N)_Sk3v;c{Z2>d*}ComX1uxre{d0dfX^I_N_QWp9KqstA*U
zha1Vu*j`9yw7oT@9<RM0T8sA1aC^Jg6a`Z^_1hU~79L;l9P!}Z<RQeT*MeqS<Ax$^
zvfYIImD?TdM!Q&No#ev(p{PkU=@9OLHX8&ct&M7qyW{YZUa6PGrW((_s}h@BBuoSA
z>%<7|w*I2GEZGTkBM!pRKM^&388xA)zmMC%LrcZo@9w|hdheEd|8r(WyIu51UQd(T
zn@}#P*!({6x7P=zq1dh5-37pE2cGxbpa6eEsk^8%3<@nBIUFfNpza8DkCFkoy-N#5
zcSTiJ{cCG{SO`5s`aPD5G+l)C1-eoGi}d&s9%rpD<LM3+8q0O3RtAOf^YND4jPo@r
z7P-`0k;tfOlZX7=z(d{*iPjT0L%O4q{rUNFt#GRKq^xm<bbysh)pN!It^Veg^Uj0U
z9Ch37f9U|Fiyd{IW+%96@TNjuknf>s4a3GlP`r?vM+DN}Z$}&YbPfI({IjxAU8K0A
zIc-euq5XNwT1h``u-gqU>w)S?;b!IRTE)=js&l)9-zVRTIeWARkbOe((&UD~d83g-
zl|^%rTtRr6lrEby9o1@VJZu<R?X=M-*Why&_we>lyGAeNXzV}^rdeGu8V#Vo(5O|g
z53%YPOVm#7Ovx;i!tkjy?LwT^JS%yVr*G0peDql)u-Z94tC$G!9J&;O+Gc<ra|RJf
zWclz2Dx${gkfyZD)9UdKu+!+e)TzK7B&0oeFh^az5LN{VH=NN$TkjfI`=oUceYKqf
z$$_JZ-nQ}~;1QtfwenN{7ieMF@VoyvG$>$GI}M8VD;ZtJuZWt|t^}gdy~}vPF)s`t
z&9vDNJGNC3Z(l6TJnImNJoj!d?5*%8xsHD+YPwnIe8hFUe+(Vw-uZod_l0~t^1|Sx
z-K0Hm{mDJ}zE9gt+tkr3QAa3xrQF`yzWoOxUZ;3z-+p@QK;lbFZC`pWy>xxjOSvd+
zK7Nntk56lpk~JEN>ASRB4r+RiN<{yFoUYxX-HEPmky_HwV0Y2~8R$K$+QD1ogyX)w
z3QK=PpacSih1u(@j<bBF>6TXQf+~_7H5KH7KJVFZL7$W4f>Q7hfzMhvf~X_PS1T`9
zYZVh&+Wa!d7HJi`9?HlWONi;&v~PnwLBt99Fo?OOIRJCc7>GscRXT5?O0VK>zsKN!
zl9kf6Lb+y(#K#WK%}wW$9Jc_41UDEl$A}v&+}Iq}Vri8cGzX_!2=}yTEH(`Ip$qIx
z22iK9wvJ>WhEMOwr1~^#Qlqf9MhDAo#hs<4sI!zD{i$|<nnw4eOBgsygs$f-?MM<V
zm5|9rx@dW1bC-+wC<&}$bKSw4lP|Y>O>bKtIK<)Bk42P6ZFnp<TboHABW-@{pi+}(
zS6ge*=GUGBwjtc9xaR^wD|0s5=VWwGzb9&1g?qaFZoeb(;slWm5s4+jB)2|9g2qni
zuk}{slAO}N6*YYTHNomcoKp8SH$SE=J@n9Xwd?5PdhxMeeC)%=KJBrCo{RcC_>KM=
zG2zJ~c$pIr<f{khRencx3WdLVLj(dj!>Vqc1Nekl<(Y<0GWF7!{Z+eM3g4pQPcGMu
z&xXtOakyN!iO8k!vg~HPUTYwBwjj?e2tv{n-6Eez%%*CSa>7(h)9u=m<B6hhGG?=O
z`IEcaB<5PhD@Y_SD;!4*fYmUcvnwZtO7MUVB_N_znzqBCI2~~~9iH2?blk`bs?}*D
zx?V0X=Qz9wFAI(!FM$WV6JF3zx?5hBGPNhBymC<_gRrQr?dK*?bkT=^@Lxr5oT5FG
zOee~;mn-wNGBB)@7wOF^B-1toio=@w_6j;Fa14UeF24A}RkBj)M%`6I6PD^vJJ`fn
zoG;a+?^ilNPNUngC?BEhxpZ4&lC4rHAwOfgyPo|0!CJI?Z(7w=$&&u{Y*Zt2p>{cg
zwd4W7hRfQ=n|mfLGbv4%O0?8(XP_C5{eiVqNj5O8;NkU>7pw)v-ob|STs7PZUEFgV
z*KE>&o+%;?b*0swG+eh9(r{Z3I!Oh4w<i#@Q5Jo5gtCT$n@8D$YeCsfVYead6T3>z
z$}Nrht{I1J|0HT!&Cu;g+(lLCy*;T!xb4=1M0y^&{aA0AkT7&RJ~$w%dO4~}7`xf~
z_D=6d$bNdiaUeX}!dQzE5#Zmq_n`w=?Qvl5^u9;|nlpGVjoJ3i?0c>(QV-2B0LG+J
zW*1)A|Iqa+y`B{e!u;?wqQn$R(<`rbd=_C&RLE(7_WWmIfad<}p>jE42oznq;CG@}
zXUiucpTP!5c``B|qb$dDxzNx<OiW>SyfM9q1sQX5_wZs{y*xJ;3_RxMj$m<wLn|}%
zidp6pnrUf-y(_u`)?7186(j1dVZB0qU){k{#0E6j^A?a*)wW?TLurqv0%tqal14FN
zgBwEM8{FgqMk`3T;fxHe#;#8(HfobMaH>+3*WS0UMSHg;NO9QyxJd<8ZhzETWa|=-
z=Vbp7>k}hO?C;->sLj2!NQyO4C@@bR`DB;v+@%%tDpt{Bc@|BD;S>Nwc@phO4*3Ps
zHp<HglHA+G$|gVBL5rjshGi5Sgf?tikzb(b3QYi4m5`9Po<G-Skr*JqJa{L%$e)*l
zd9~77DtQ7`4m(&W1VU4C2I4+`Q}p>VLMEqygs@~$gS0b|M2hgaZORCif24y*#uPn+
z$bYf}{8gzqA?~U8-~H<p1x2g>mC|5kDejTs8tu|>xo;sK0ouy<Huwg{pSw22g%EH>
z^5lbv6_zE;_9Jv`EG)nR;qC`A208gI?u{rnu?n>5c$<v8Yaq-@y@8dTuoikzpT`k*
z4jHyPXvqrMGhSkfrPREbJ-STun(nYvElIa838ws62i1?67KCg-549&9$Sc)*z35jv
zz+II|A%s1Xa%wGEqbTy4*1R&OdZa$v+o@0YtL%pE<0*%{DkOetn26R7Nk(|g`_H|V
zmZUN7`Lb>QDC8$PUwPr)`TSn|;jwQo#;y4y_`~DyA+;qP%7xqJsX^{?lGZc=zv}U$
z+R&(Exa-X#=0^R!r@Q;Lu0K}sxHPv@p1BQ>`2OH|=bdc1UJ1|lvQc6+dtR|AG={}y
z%xIZ~DSNr<;D8683=#v8i^(#X+qw2%qCFMr!tv0S)OG3j?ryYe%|^j!F$ghOa)*nx
z0y?Rx({i^Inppi`b@H;<th?Du!Lg}EYt|jM4adQ}sNHh6(tD0swx_XK0IMad#g@DA
zWz<F4t*2XZ-_aL9^;vgh(WqiauTyIP#7I$h;M$@$!jDa&raZu(!cQzPC;alwMj5|G
zomwG3uNO{HE*2`#u6lRdLapY&%Qr$fM+e+d8yzONpI^c{^-2pVTWqIc*7G<Gj~ZtK
z-o+xtC>xxTr?5f3P}Xg@+Ekr<!B5x>?;F#@dA@ZD7ks&xV=enXH@I7kB@?v5Afah{
zg*LbwipG3%5%9L0(Hpeb4kgerSCBG7XX6{xqSlk{7PE?5p7OY<sYb{2wcL@WvoLkz
zlx^bsC2D3KyE1BxJQmRv%SHoqCR7XH*jTOUs8BXAl$LvGBqsvGx(`;v-6G%yICyVg
zqGm*1cE_m=HV9P$iOOhG3p;f5>S9x0G(hnpeh(Vemb)F}tXiX(FB({PSVT1@Q+gwI
zmMox|pom$_i+S=^=_+@N-gIjDAj$e!h>ts3Y*y-dU+_R!PB0;J4NQF#>&7?*)UDdY
z{vfGt8_i-Zzf>W48mHN7+sKFCWGN{)c{&eR$mdwTXxcQ~LPI2$L!Lsg-ng659vfO9
z&X|MX$ddU56T1alurlY<H`HSr4Vs?^lL=rET;J5t&-gzfrCUj{AUw2N2wG4vo!0U3
zYuzn%qn`KgQKR;3rWBegXXUWoNtD@1X<QW)Chr(<@Ss~QcNpnYSMR+Z8o8yhP>2Ac
zlmO7X3D5{`nS(muB&F8T;nGi^b;pHy%9qT=QW^gtYU|52lG4pK=KY=g!%e85jRtM!
z-{NN;o3nHxf%U5d_0mE~r>M2j5ZVEPaBFGdK(pRD3r1q`f$4x$LTk^0*R=vRA%SC_
z8gC=TwsEb5S`J(2A!@XhiFC($JJmOCVDWho>b49VN`~Q}ik%oq>!<QYMK{ZN9EeG4
zWEt<R1ebV&Fu;PaKWE*|0s;fKTW3p)*gWPA3o`({g9w?`q6wjP@{ZnEG+<W1?X5r$
z^5DQ40$$Nruv?F}+-*u~Rj;60Bm>%l|6|3w_)fO0zo0w(Y<DB=^e++!>s9CzkYQ4{
zYP&-OP2@~kGtg>l4?Vs`9mikNV=HZS*+P#?0Lr?M9xgr3(&Gl&LbsnDAE8qy=*B?n
zmGm0bV*NPnS$#D<t|g#X;n8$Qs78*)02@)~EY~;7b<J`;vs}k4!=Gi?vkdo1hB?dd
zW}DWF*U<*TNrChGe4IZ{-x%lb&^N|;2Q`6lz8pwWka}OsdMjl!`cDz&j6PqJ$ml!N
zE=HdZ)*$pP4meFx#vnc3N)ImgeriA6*Jv$MgXvHYYk*cC&~{oYPv2;Fg!PB?pe1S6
zBji%j1c!AAL1wql9rZgXaEw_#S}?`Y4y1@8g$$inPRLL=MU;bNK@Dk1O<pOwBa-Ns
z9#M*oc(pS8Z3=w!Sq+Ce$(>PHGUq%u2Qys2vFOm=R_Qu-=r;NNX_7#)%SUte6Rmq-
zVd{DVRte&5LnTFJz9kMPTc0N--C{4>uvA_~;3|9txo~OaDMFDbV35JP-ly+CRK7uO
zfhP1&yYiH=d<I>OeI-THL=+Hv8R;IxV)BIl$4Hh_xy>@V%)8BbNb#GgLAV>FGcn+<
zCk=vGy>s@+UDTt8JTur@a<`5)rHdA&8PIk&`7~z3v`K~&U=kO}Ceg7THMm@`NUhnx
zfyAhmHt6~XQKT6)$mR#frLgWr_WK@04H4d1ZzCNQe3g4cM{busXXGCEP`VhjeTno+
zb$@-_W1$0_f-<vvx3+sG8b8=5k`sdnf7zji4Aco0ixcYc!9liY`Oy~&auCH6VEzoM
z@`f4im|m>Zs(iiJlv69#FaQxF4|Sa54xy_hL*BAJ49%00HbQUYtK`8&cXA&TD3I+9
zI6?~a5xkD>=r_d2TYzHt(1A<t)^QL{qiSR0l$@pG3sA`+@)sXZTG1;v*PkHNJ!`;9
zFOrf*z{8q{(|gp~1GCZnxkRJrk(7Ej9rm}@M2;llqHGDy_c0i!Z@ts8?Qy{Fp_%*O
zSlTo51xzr^c&cR2U>kU;IX@#e=g)w@_RKxT!g0Mi6KcYA!**J{GagqK$CTAQe4+#c
zDxD*&VXd7u;q79|mG_RHHjOjh<{i2I@>-i#g?f9Bgx~1TPKd3`FHQ^dYp;G=BGfSR
zt!s!hO#Q3kMDndf1|1HL6PX~ubcn#w^`a(~9Ux!#a`lZ35xLrW8)lZ^y=q6ARdz)q
z(#0=u`)=rM`vMETKMvRm+B}5zMPpbWSioxF@E;ai&<vS2w=gF(9PR+QhuAwgw|_3T
zh!yqAq4Iw5MOoZAgO$?WEA~wqZCInV$aBkcIh>!cv}bvj|GNKjNxn?`%lwzIF_fmx
z>N+;v&hd+pF!H}J+{41|#rkdq!_qk|8Do8c6pRSTS4Ab>3AtNI3?R-^3%)peeUj{e
z{32SoNay&Ms&JxD3UDI{?Op?iH%2sY{B9alEw#H)oXfKUo{a0sY79)EfIk)o98$oo
zaRt2pN=%1OsVYdjuvrJ2bkLkOH<hS~Q*9Kt<4X(L<kbE^0sWeMZ6^)HNSFhNP~NHi
zn93rRG|=JG+!Lmz5JJ<dPHrk<IaWp*FU;kpH1)miUQ;}WAJJ?@`5;m!y2sYq8=M`&
z;HavRU~tAo;IPAKm$C%ydgkc!%EA85=7#jKdvmiVYHr5vL_Be+U3bsL+1fl2HwwM6
zHm{8X4q2Pa60FS~ur{=#F1$w5(?DDmEq(fE7rtM1;Roh&;^p1i4YCtY@iG=|-Y}P&
zylxi^S5SWn0CPDq9oK1#{_88hOo|}<54=UzhX72a000Xp-k;*v1qM@ugKCq0MA;rv
zHpx|b)7o3ED}?1z)hxksjUmKsE_HB}M1h{UNu=4`+pW8!c5D0u9S?Sh*4A-ADKbvs
z@@%+15VtSAF<kG90}dIk>(IPN%*j285ijoP#kmv|W`joh$a{-tFd2X)epq4?j9%?M
za9u>Sg4c@XXvd{=ZgBYS0uJG(fSMf{-uAh!uy9+SAWAT?KNhFSYKWaQ=$#TZsnk#C
zCBBAUVhINU(e)bMA55)X$12N(WsJ&nhsSlax{28_hmvHS)t6$gpuilC%~M_?e~?~#
z;Kq|&RqQ1$5Pl6My?&^}Yur)AUVCs!n>rY(54A<)iNehgA`DyiaM+oKpx*E%X98E8
zGK93Mwu~=E8CUc?;!%o#p>!L7kAwi8Db=w2bIx3t%RR7fdiwdI{Y-#p`@Pw1It6Bq
z3!kJ``9}{jH9-1FNkkllg!a*9dEP1?MFvgtR6^~)e#G;C6+90cA1?^;8Cae*4npj0
zV~N%SmDu{5aT4OGkjam&!Qm3&PGQAWK%EB$)B|<j!8*|n_F})YIzgS)omI@j`FGfb
zIbiXtZ2rIATk{`;B)%F49O`RtPv~oR-?@NQtP9vS16wE#rNW_4bsQNgm#q4c|LEe=
zb$C-5cDkG*nEm}YB7O%KoBP4CQ6Qk0D0g5%f$fR!KX!ndAzB>F_z=P%4^LL`G~^1j
z2y@o$=7p8%64ixN(@jBK?TDyJ6@_@m@1ifhNqZDM*xeMt)gJf0p?|qWd&Fo&W^h(6
z9wv#$uWeVXxw*NcP5Yx>=Jm_9Cha=G&I~Mk!`d662joWLC^m%l;SlMfgZIPKQ61PC
zgP};Rn~*QCyApH}GjZ`br`71kbsgZYN<Ro;Pd_eOfkt6La91k4GCg{v7suPkMRb;A
zI}Bo=7Pn~o4ro|45xyWPu|&Ahp7h_o_R@b>ax0@WbT7upiN{#t?inn13w2x3*uP&`
zs6({yYGwhbPwKw+{h4U*yX_dQTBGx_%dlcRz*98P;y1X{&G%L{f=>6rIN(sH`*Jie
zYI<%JSYw%okF|93F{C(S=%;A=7$T%t|3Zsk_-t}a(}f1Rkx^_f0EPwFs#2SnY~^_C
z{GL36MM)Z}zCzTb(lOp+-M?W#1T=Z{bK)e%WPG$M4bsT<I)Q%cM*LV3!`NF8{`3DZ
z(waLVgL^bdNwXVO%`PCiOw^sD5hQ_~d*B2HoILguBfouO+_&GW45h+=2`=Elck;pE
z3ylmz!@k^u%VH#Y9S<bMd9-mj%M6E>KSg12_=1F+agCfK`6IIUWC@F~XM-Ps{I2nU
z=YeE-j@jUCyySK&YzAVZ9Z`lZp7Kq_D#trykh-_HpNLxAv0H)lDeaI9twrLAT%7I3
zn|o_F0(1MOIN*@EwGzy2QEui%$dKYuP)@9VhjZse2eEG#S3k&^Z=Q|agXL%l*a(AB
z)+_TxJ#2loVvXZPRRbW!glW_>JdmMIrRQ=pK@gJnZ{sBLZFbDN+$fr=x;TSo^7!lh
z9Uy1u4TA9(p$yjX`0F~Jgz1v(VV!qVy}2^2q8giVL{=6xse&8t-`qDWXkN@xbX@3N
z)b%;x8GCd*+^dNAsEk(9dw#@{e#odLzWKnyQ-7Wg(Bd6$@(ZA*r>7(1@pBBfFxNdx
z|Jy7=X{2z~>uYMsoQ=wjJH}VvO!?G~nR!vbH%Y6V>?SMNy^a5B)W&bVt%j`<<Z#4p
za^$jX;J?yaQxF*VFUA3f4E$1pfq(f4*mN>uB)CHU=?lp|Y&f<8Vart$d$MV?A3k>`
zSHV?4Caww7=CS<<D>ChA?Fi0<ko&EpHhn!+qZ(<EB&6UwalG4G-3!{GtJ>imNo`V4
z@TC9mI@F#<C*(@;z%o;_Jj?uo)etkRv+k-OtxWHz24=L}kBFL7iA=EE%jC_2Rm<Ad
z7<Jroi?&xt;r{)?03SGz%e5)84<ifwJ;v`I2)`T7xFM8rKxD9Gf1WBX&mtaS?s_u0
z<;pepy&q5JSX3UcIW}zKq5+R+?rI_&WU#uo#p{P6>l_i=sMKiNt~M)=qo8>PxUn@&
zZrBY|-s1P!KJNnY+l3f27=*w+UlRu$vd>Spv(MrL3~X${a&w$=Ond*R5xRfO1`p!t
zhz*!%y-=XdexVbJa|^X{xps!$@|FYm_F1@%+za%h7KOk!QtO$(&yCZ;xAz$coD>;(
zy{Jj0c!K>IoWr(&aEOu;!f1OMc{^}k<I(UN+O#1W6#E#Tc{1nBX?CgBEEib}a3deq
zZOD1{ApRxRu6gIPoWjOVoS8zsGh~ap^y*^xPL(qzf@csa1bPB#qg}KdH}cL1p`8=W
zg$1lT!IpEJ8in!pB5v1%gcfKYdX2We^Wag4m^_x7gw~fsxkG9Lw?v`8E7JrmPIQo*
zgo{I*h%Y{n%-fS4pk|QA;NlQM7edElvk(0X<W5)-+<%D;SXpYK{aZ$V=cn7~YIKg|
z;yH&V5B0}`tGN(Q5jS(GhNxr7Fk?Imb$abB)SKJ1I%=V8-U>y>C*WkcQ+_u@(O<E3
z3I=3RZ}18I7-{HrnqlEd2{JtxmgnYRvT(=R9D@61#W7DCdvL%L8x?(?4uO)rpLYSh
zZbwbap;e=xnx!7V6U2L62jdenX~P~JR9V?5sH0%$iN#YL;IGQK5#pY4+ns_hVcB)l
zytp#GdZf&6Ya`ZCWuA~i`Ka@FmrC8$8({)@Tzv1^EBD*mP$8<^XYM5LfPGMe31}7u
z9z)`tx>#NcMaQuKbgU!4ARUYx?bEM7;VEdhtQAT)umm@{E#Rs*tSCU~JvfE3$$4|~
zj>0*AB2W4bl{G~}Q8jms>lTc8rh{U~49AF1H`Q_sNpdRf@r3R_cBo-hrh`!TOh@Eq
z0&9G$H%#c%z#eJ(JCkKR3f;vtk{C-)N!OVt|7~nFpJJz$!j9h^<Q?Jiz$^a^Wt7IF
zPydb84305cjA6Mc@blvcMKU|r&1-A;1Ok7RO=zTw9n@*q9~|>AL2JdVzXzeL=hF!U
zH{mgBy?~!LQ^E`J2p^(l-O72l@$+_m9_Hr}Jo#uW>&5tXbilepeB8;oFX87=ejcNY
zLF+huY_Mj<$6cItH$PvB=abewcv|<;;{-kEpeXBQ^msWv?)TGPLEnCi9uLstL3*5|
z$3yhU<1uT^@l(eWnlw-8baaSS;N&7d4Sp{0bCI7VewzHW@D%hu#lOq+yF!mD9#2{|
zJkjPlK5%Z5^)NnXtp=WaLXu_EH-{cg&N)qA-%Ti-!8bnZ$XcSbWqLe<$CK8h^py@U
zvL3^?v)1GMd?lW!=vDmV)p+umL)L5f_iORQ!8ZK;C+Nv12U$<x>#X%UJaIn4llZ_Q
zpx28JSA4utd_2t`lh!w{1l+IF<K?tS@dQ0yMUThm@yqo1MS6UR9-pVjD=1|9GI~5k
z50@T)PLDsO#{_}W=<#KGd;yQ9_2y7zvs}?ES2D{L%rfv<20Y6^XBpru1Dj<)p>ul}
zSza8=$nq{>MwYklF|x1qk)@3U^4uO;xGV7fDt%+TdGQA0&C^_rH-}9LZ;JvLP3vuf
zU_U25-hmI0_7}v*yTr%4#m9TZ$1jVIU%?01_dfbK&w4*TtPkJ;hLAuW9pJNUtbd0j
z!25Oa@kjWWwf<QA_*4Gj8v@wu-W~G5#NdNeCWsh(;6TzrDjO*`9HQxbxJKA}viMz&
zIgL#Kir<h`HzO(LB#$ehcEyde^-tiW-%0#4=$d>&iFF<|myQ*YhH`*@N693*t>_jN
z-TF<u2Ub2KK0YcwenNb_hCiCkrn^xd^@W27v0k~lG)*TO;@qVpIKPb!N4c+RK72c!
zw8tkJKGmAXu_<M7%$qd{I=Z8`*UnVw7&3Z89(?F-t2N9;oDWydi(|@~4U>-k8le-~
Z@`wTH^lKCLp3}i`j<Mw6cXNLF{|6SIPWb=;

diff --git a/docs/RefMan/_build/html/.buildinfo b/docs/RefMan/_build/html/.buildinfo
index bb39e3d43..3b4193dce 100644
--- a/docs/RefMan/_build/html/.buildinfo
+++ b/docs/RefMan/_build/html/.buildinfo
@@ -1,4 +1,4 @@
 # Sphinx build info version 1
 # This file hashes the configuration used when building these files. When it is not found, a full rebuild will be done.
-config: 12febdda05646d6655d93ce350355f10
+config: 41758cdb8fafe65367e2aa727ac7d826
 tags: 645f666f9bcd5a90fca523b33c5a78b7
diff --git a/docs/RefMan/_build/html/BasicSyntax.html b/docs/RefMan/_build/html/BasicSyntax.html
index 757732305..79fc359cf 100644
--- a/docs/RefMan/_build/html/BasicSyntax.html
+++ b/docs/RefMan/_build/html/BasicSyntax.html
@@ -14,7 +14,6 @@
         <script data-url_root="./" id="documentation_options" src="_static/documentation_options.js"></script>
         <script src="_static/jquery.js"></script>
         <script src="_static/underscore.js"></script>
-        <script src="_static/_sphinx_javascript_frameworks_compat.js"></script>
         <script src="_static/doctools.js"></script>
     <script src="_static/js/theme.js"></script>
     <link rel="index" title="Index" href="genindex.html" />
@@ -85,59 +84,67 @@
            <div itemprop="articleBody">
              
   <section id="basic-syntax">
-<h1>Basic Syntax<a class="headerlink" href="#basic-syntax" title="Permalink to this heading"></a></h1>
+<h1>Basic Syntax<a class="headerlink" href="#basic-syntax" title="Permalink to this headline"></a></h1>
 <section id="declarations">
-<h2>Declarations<a class="headerlink" href="#declarations" title="Permalink to this heading"></a></h2>
+<h2>Declarations<a class="headerlink" href="#declarations" title="Permalink to this headline"></a></h2>
 <div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">f</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">y</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">z</span><span class="w"></span>
 </pre></div>
 </div>
 </section>
 <section id="type-signatures">
-<h2>Type Signatures<a class="headerlink" href="#type-signatures" title="Permalink to this heading"></a></h2>
+<h2>Type Signatures<a class="headerlink" href="#type-signatures" title="Permalink to this headline"></a></h2>
 <div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">f</span><span class="p">,</span><span class="n">g</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">a</span><span class="p">,</span><span class="n">b</span><span class="p">}</span><span class="w"> </span><span class="p">(</span><span class="kr">fin</span><span class="w"> </span><span class="n">a</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="p">[</span><span class="n">a</span><span class="p">]</span><span class="w"> </span><span class="n">b</span><span class="w"></span>
 </pre></div>
 </div>
 </section>
 <section id="numeric-constraint-guards">
-<h2>Numeric Constraint Guards<a class="headerlink" href="#numeric-constraint-guards" title="Permalink to this heading"></a></h2>
-<p>A declaration with a signature can use numeric constraint guards, which are like
-normal guards (such as in a multi-branch <cite>if`</cite> expression) except that the
-guarding conditions can be numeric constraints. For example:</p>
+<h2>Numeric Constraint Guards<a class="headerlink" href="#numeric-constraint-guards" title="Permalink to this headline"></a></h2>
+<p>A declaration with a signature can use <em>numeric constraint guards</em>,
+which are used to change the behavior of a functoin depending on its
+numeric type parameters.  For example:</p>
 <div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">len</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">n</span><span class="p">}</span><span class="w"> </span><span class="p">(</span><span class="kr">fin</span><span class="w"> </span><span class="n">n</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="p">[</span><span class="n">n</span><span class="p">]</span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="kt">Integer</span><span class="w"></span>
 <span class="nf">len</span><span class="w"> </span><span class="n">xs</span><span class="w"> </span><span class="o">|</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">0</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="mi">0</span><span class="w"></span>
 <span class="w">       </span><span class="o">|</span><span class="w"> </span><span class="n">n</span><span class="w"> </span><span class="o">&gt;</span><span class="w">  </span><span class="mi">0</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="mi">1</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">len</span><span class="w"> </span><span class="p">(</span><span class="n">drop</span><span class="w"> </span><span class="p">`{</span><span class="mi">1</span><span class="p">}</span><span class="w"> </span><span class="n">xs</span><span class="p">)</span><span class="w"></span>
 </pre></div>
 </div>
-<p>Note that this is importantly different from</p>
+<p>Each behavior starts with <code class="docutils literal notranslate"><span class="pre">|</span></code> and lists some constraints on the numeric
+parameters to a declaration.  When applied, the function will use the first
+definition that satisfies the provided numeric parameters.</p>
+<p>Numeric constraint guards are quite similar to an <code class="docutils literal notranslate"><span class="pre">if</span></code> expression,
+except that decisions are based on <em>types</em> rather than values.  There
+is also an important difference to simply using demotion and an
+actual <code class="docutils literal notranslate"><span class="pre">if</span></code> statement:</p>
 <div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">len&#39;</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">n</span><span class="p">}</span><span class="w"> </span><span class="p">(</span><span class="kr">fin</span><span class="w"> </span><span class="n">n</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="p">[</span><span class="n">n</span><span class="p">]</span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="kt">Integer</span><span class="w"></span>
 <span class="nf">len&#39;</span><span class="w"> </span><span class="n">xs</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="kr">if</span><span class="w"> </span><span class="p">`</span><span class="n">n</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">0</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="mi">0</span><span class="w"></span>
 <span class="w">           </span><span class="o">|</span><span class="w"> </span><span class="p">`</span><span class="n">n</span><span class="w"> </span><span class="o">&gt;</span><span class="w">  </span><span class="mi">0</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="mi">1</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">len</span><span class="w"> </span><span class="p">(</span><span class="n">drop</span><span class="w"> </span><span class="p">`{</span><span class="mi">1</span><span class="p">}</span><span class="w"> </span><span class="n">xs</span><span class="p">)</span><span class="w"></span>
 </pre></div>
 </div>
-<p>In <cite>len’</cite>, the type-checker cannot determine that <cite>n &gt;= 1</cite> which is
-required to use the</p>
-<div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">drop</span><span class="w"> </span><span class="p">`{</span><span class="mi">1</span><span class="p">}</span><span class="w"> </span><span class="n">xs</span><span class="w"></span>
-</pre></div>
-</div>
-<p>since the <cite>if</cite>’s condition is only on values, not types.</p>
-<p>However, in <cite>len</cite>, the type-checker locally-assumes the constraint <cite>n &gt; 0</cite> in
-that constraint-guarded branch and so it can in fact determine that <cite>n &gt;= 1</cite>.</p>
+<p>The definition of <code class="docutils literal notranslate"><span class="pre">len'</span></code> is rejected, because the <em>value based</em> <code class="docutils literal notranslate"><span class="pre">if</span></code>
+expression does provide the <em>type based</em> fact <code class="docutils literal notranslate"><span class="pre">n</span> <span class="pre">&gt;=</span> <span class="pre">1</span></code> which is
+required by <code class="docutils literal notranslate"><span class="pre">drop</span> <span class="pre">`{1}</span> <span class="pre">xs</span></code>, while in <code class="docutils literal notranslate"><span class="pre">len</span></code>, the type-checker
+locally-assumes the constraint <code class="docutils literal notranslate"><span class="pre">n</span> <span class="pre">&gt;</span> <span class="pre">0</span></code> in that constraint-guarded branch
+and so it can in fact determine that <code class="docutils literal notranslate"><span class="pre">n</span> <span class="pre">&gt;=</span> <span class="pre">1</span></code>.</p>
 <dl class="simple">
 <dt>Requirements:</dt><dd><ul class="simple">
 <li><p>Numeric constraint guards only support constraints over numeric literals,
-such as <cite>fin</cite>, <cite>&lt;=</cite>, <cite>==</cite>, etc. Type constraint aliases can also be used as
-long as they only constrain numeric literals.</p></li>
+such as <code class="docutils literal notranslate"><span class="pre">fin</span></code>, <code class="docutils literal notranslate"><span class="pre">&lt;=</span></code>, <code class="docutils literal notranslate"><span class="pre">==</span></code>, etc.
+Type constraint aliases can also be used as long as they only constrain
+numeric literals.</p></li>
 <li><p>The numeric constraint guards of a declaration should be exhaustive. The
 type-checker will attempt to prove that the set of constraint guards is
 exhaustive, but if it can’t then it will issue a non-exhaustive constraint
 guards warning. This warning is controlled by the environmental option
-<cite>warnNonExhaustiveConstraintGuards</cite>.</p></li>
+<code class="docutils literal notranslate"><span class="pre">warnNonExhaustiveConstraintGuards</span></code>.</p></li>
+<li><p>Each constraint guard is checked <em>independently</em> of the others, and there
+are no implict assumptions that the previous behaviors do not match—
+instead the programmer needs to specify all constraints explicitly
+in the guard.</p></li>
 </ul>
 </dd>
 </dl>
 </section>
 <section id="layout">
-<h2>Layout<a class="headerlink" href="#layout" title="Permalink to this heading"></a></h2>
+<h2>Layout<a class="headerlink" href="#layout" title="Permalink to this headline"></a></h2>
 <p>Groups of declarations are organized based on indentation.
 Declarations with the same indentation belong to the same group.
 Lines of text that are indented more than the beginning of a
@@ -158,7 +165,7 @@ <h2>Layout<a class="headerlink" href="#layout" title="Permalink to this heading"
 of <cite>f</cite>, which defines two more local names, <cite>y</cite> and <cite>z</cite>.</p>
 </section>
 <section id="comments">
-<h2>Comments<a class="headerlink" href="#comments" title="Permalink to this heading"></a></h2>
+<h2>Comments<a class="headerlink" href="#comments" title="Permalink to this headline"></a></h2>
 <p>Cryptol supports block comments, which start with <code class="docutils literal notranslate"><span class="pre">/*</span></code> and end with
 <code class="docutils literal notranslate"><span class="pre">*/</span></code>, and line comments, which start with <code class="docutils literal notranslate"><span class="pre">//</span></code> and terminate at the
 end of the line.  Block comments may be nested arbitrarily.</p>
@@ -173,7 +180,7 @@ <h2>Comments<a class="headerlink" href="#comments" title="Permalink to this head
 </div>
 </section>
 <section id="identifiers">
-<h2>Identifiers<a class="headerlink" href="#identifiers" title="Permalink to this heading"></a></h2>
+<h2>Identifiers<a class="headerlink" href="#identifiers" title="Permalink to this headline"></a></h2>
 <p>Cryptol identifiers consist of one or more characters.  The first
 character must be either an English letter or underscore (<code class="docutils literal notranslate"><span class="pre">_</span></code>).  The
 following characters may be an English letter, a decimal digit,
@@ -189,7 +196,7 @@ <h2>Identifiers<a class="headerlink" href="#identifiers" title="Permalink to thi
 </div>
 </section>
 <section id="keywords-and-built-in-operators">
-<h2>Keywords and Built-in Operators<a class="headerlink" href="#keywords-and-built-in-operators" title="Permalink to this heading"></a></h2>
+<h2>Keywords and Built-in Operators<a class="headerlink" href="#keywords-and-built-in-operators" title="Permalink to this headline"></a></h2>
 <p>The following identifiers have special meanings in Cryptol, and may
 not be used for programmer defined names:</p>
 <div class="literal-block-wrapper docutils container" id="id3">
@@ -266,7 +273,7 @@ <h2>Keywords and Built-in Operators<a class="headerlink" href="#keywords-and-bui
 </table>
 </section>
 <section id="built-in-type-level-operators">
-<h2>Built-in Type-level Operators<a class="headerlink" href="#built-in-type-level-operators" title="Permalink to this heading"></a></h2>
+<h2>Built-in Type-level Operators<a class="headerlink" href="#built-in-type-level-operators" title="Permalink to this headline"></a></h2>
 <p>Cryptol includes a variety of operators that allow computations on
 the numeric types used to specify the sizes of sequences.</p>
 <table class="docutils align-default" id="id5">
@@ -321,7 +328,7 @@ <h2>Built-in Type-level Operators<a class="headerlink" href="#built-in-type-leve
 </table>
 </section>
 <section id="numeric-literals">
-<h2>Numeric Literals<a class="headerlink" href="#numeric-literals" title="Permalink to this heading"></a></h2>
+<h2>Numeric Literals<a class="headerlink" href="#numeric-literals" title="Permalink to this headline"></a></h2>
 <p>Numeric literals may be written in binary, octal, decimal, or
 hexadecimal notation. The base of a literal is determined by its prefix:
 <code class="docutils literal notranslate"><span class="pre">0b</span></code> for binary, <code class="docutils literal notranslate"><span class="pre">0o</span></code> for octal, no special prefix for
diff --git a/docs/RefMan/_build/html/BasicTypes.html b/docs/RefMan/_build/html/BasicTypes.html
index 1fd9d5267..316076210 100644
--- a/docs/RefMan/_build/html/BasicTypes.html
+++ b/docs/RefMan/_build/html/BasicTypes.html
@@ -14,7 +14,6 @@
         <script data-url_root="./" id="documentation_options" src="_static/documentation_options.js"></script>
         <script src="_static/jquery.js"></script>
         <script src="_static/underscore.js"></script>
-        <script src="_static/_sphinx_javascript_frameworks_compat.js"></script>
         <script src="_static/doctools.js"></script>
     <script src="_static/js/theme.js"></script>
     <link rel="index" title="Index" href="genindex.html" />
@@ -83,9 +82,9 @@
            <div itemprop="articleBody">
              
   <section id="basic-types">
-<h1>Basic Types<a class="headerlink" href="#basic-types" title="Permalink to this heading"></a></h1>
+<h1>Basic Types<a class="headerlink" href="#basic-types" title="Permalink to this headline"></a></h1>
 <section id="tuples-and-records">
-<h2>Tuples and Records<a class="headerlink" href="#tuples-and-records" title="Permalink to this heading"></a></h2>
+<h2>Tuples and Records<a class="headerlink" href="#tuples-and-records" title="Permalink to this headline"></a></h2>
 <p>Tuples and records are used for packaging multiple values together.
 Tuples are enclosed in parentheses, while records are enclosed in
 curly braces.  The components of both tuples and records are separated by
@@ -114,7 +113,7 @@ <h2>Tuples and Records<a class="headerlink" href="#tuples-and-records" title="Pe
 components are compared in the order they appear, whereas record
 fields are compared in alphabetical order of field names.</p>
 <section id="accessing-fields">
-<h3>Accessing Fields<a class="headerlink" href="#accessing-fields" title="Permalink to this heading"></a></h3>
+<h3>Accessing Fields<a class="headerlink" href="#accessing-fields" title="Permalink to this headline"></a></h3>
 <p>The components of a record or a tuple may be accessed in two ways: via
 pattern matching or by using explicit component selectors.  Explicit
 component selectors are written as follows:</p>
@@ -165,7 +164,7 @@ <h3>Accessing Fields<a class="headerlink" href="#accessing-fields" title="Permal
 <p>This behavior is quite handy when examining complex data at the REPL.</p>
 </section>
 <section id="updating-fields">
-<h3>Updating Fields<a class="headerlink" href="#updating-fields" title="Permalink to this heading"></a></h3>
+<h3>Updating Fields<a class="headerlink" href="#updating-fields" title="Permalink to this headline"></a></h3>
 <p>The components of a record or a tuple may be updated using the following
 notation:</p>
 <div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="c1">// Example values</span><span class="w"></span>
@@ -188,7 +187,7 @@ <h3>Updating Fields<a class="headerlink" href="#updating-fields" title="Permalin
 </section>
 </section>
 <section id="sequences">
-<h2>Sequences<a class="headerlink" href="#sequences" title="Permalink to this heading"></a></h2>
+<h2>Sequences<a class="headerlink" href="#sequences" title="Permalink to this headline"></a></h2>
 <p>A sequence is a fixed-length collection of elements of the same type.
 The type of a finite sequence of length <cite>n</cite>, with elements of type <cite>a</cite>
 is <code class="docutils literal notranslate"><span class="pre">[n]</span> <span class="pre">a</span></code>.  Often, a finite sequence of bits, <code class="docutils literal notranslate"><span class="pre">[n]</span> <span class="pre">Bit</span></code>, is called a
@@ -267,7 +266,7 @@ <h2>Sequences<a class="headerlink" href="#sequences" title="Permalink to this he
 </div>
 </section>
 <section id="functions">
-<h2>Functions<a class="headerlink" href="#functions" title="Permalink to this heading"></a></h2>
+<h2>Functions<a class="headerlink" href="#functions" title="Permalink to this headline"></a></h2>
 <div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">\</span><span class="n">p1</span><span class="w"> </span><span class="n">p2</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">e</span><span class="w">              </span><span class="c1">// Lambda expression</span><span class="w"></span>
 <span class="nf">f</span><span class="w"> </span><span class="n">p1</span><span class="w"> </span><span class="n">p2</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="n">e</span><span class="w">              </span><span class="c1">// Function definition</span><span class="w"></span>
 </pre></div>
diff --git a/docs/RefMan/_build/html/Expressions.html b/docs/RefMan/_build/html/Expressions.html
index d242cae93..02d60cef9 100644
--- a/docs/RefMan/_build/html/Expressions.html
+++ b/docs/RefMan/_build/html/Expressions.html
@@ -14,7 +14,6 @@
         <script data-url_root="./" id="documentation_options" src="_static/documentation_options.js"></script>
         <script src="_static/jquery.js"></script>
         <script src="_static/underscore.js"></script>
-        <script src="_static/_sphinx_javascript_frameworks_compat.js"></script>
         <script src="_static/doctools.js"></script>
     <script src="_static/js/theme.js"></script>
     <link rel="index" title="Index" href="genindex.html" />
@@ -85,10 +84,10 @@
            <div itemprop="articleBody">
              
   <section id="expressions">
-<h1>Expressions<a class="headerlink" href="#expressions" title="Permalink to this heading"></a></h1>
+<h1>Expressions<a class="headerlink" href="#expressions" title="Permalink to this headline"></a></h1>
 <p>This section provides an overview of the Cryptol’s expression syntax.</p>
 <section id="calling-functions">
-<h2>Calling Functions<a class="headerlink" href="#calling-functions" title="Permalink to this heading"></a></h2>
+<h2>Calling Functions<a class="headerlink" href="#calling-functions" title="Permalink to this headline"></a></h2>
 <div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">f</span><span class="w"> </span><span class="mi">2</span><span class="w">             </span><span class="c1">// call `f` with parameter `2`</span><span class="w"></span>
 <span class="nf">g</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="n">y</span><span class="w">           </span><span class="c1">// call `g` with two parameters: `x` and `y`</span><span class="w"></span>
 <span class="nf">h</span><span class="w"> </span><span class="p">(</span><span class="n">x</span><span class="p">,</span><span class="n">y</span><span class="p">)</span><span class="w">         </span><span class="c1">// call `h` with one parameter,  the pair `(x,y)`</span><span class="w"></span>
@@ -96,7 +95,7 @@ <h2>Calling Functions<a class="headerlink" href="#calling-functions" title="Perm
 </div>
 </section>
 <section id="prefix-operators">
-<h2>Prefix Operators<a class="headerlink" href="#prefix-operators" title="Permalink to this heading"></a></h2>
+<h2>Prefix Operators<a class="headerlink" href="#prefix-operators" title="Permalink to this headline"></a></h2>
 <div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="o">-</span><span class="mi">2</span><span class="w">              </span><span class="c1">// call unary `-` with parameter `2`</span><span class="w"></span>
 <span class="o">-</span><span class="w"> </span><span class="mi">2</span><span class="w">             </span><span class="c1">// call unary `-` with parameter `2`</span><span class="w"></span>
 <span class="nf">f</span><span class="w"> </span><span class="p">(</span><span class="o">-</span><span class="mi">2</span><span class="p">)</span><span class="w">          </span><span class="c1">// call `f` with one argument: `-2`,  parens are important</span><span class="w"></span>
@@ -106,7 +105,7 @@ <h2>Prefix Operators<a class="headerlink" href="#prefix-operators" title="Permal
 </div>
 </section>
 <section id="infix-functions">
-<h2>Infix Functions<a class="headerlink" href="#infix-functions" title="Permalink to this heading"></a></h2>
+<h2>Infix Functions<a class="headerlink" href="#infix-functions" title="Permalink to this headline"></a></h2>
 <div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="mi">2</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">3</span><span class="w">           </span><span class="c1">// call `+` with two parameters: `2` and `3`</span><span class="w"></span>
 <span class="mi">2</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">3</span><span class="w"> </span><span class="o">*</span><span class="w"> </span><span class="mi">5</span><span class="w">       </span><span class="c1">// call `+` with two parameters: `2` and `3 * 5`</span><span class="w"></span>
 <span class="p">(</span><span class="o">+</span><span class="p">)</span><span class="w"> </span><span class="mi">2</span><span class="w"> </span><span class="mi">3</span><span class="w">         </span><span class="c1">// call `+` with two parameters: `2` and `3`</span><span class="w"></span>
@@ -117,7 +116,7 @@ <h2>Infix Functions<a class="headerlink" href="#infix-functions" title="Permalin
 </div>
 </section>
 <section id="type-annotations">
-<h2>Type Annotations<a class="headerlink" href="#type-annotations" title="Permalink to this heading"></a></h2>
+<h2>Type Annotations<a class="headerlink" href="#type-annotations" title="Permalink to this headline"></a></h2>
 <p>Explicit type annotations may be added on expressions, patterns, and
 in argument definitions.</p>
 <div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">x</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="kr">Bit</span><span class="w">         </span><span class="c1">// specify that `x` has type `Bit`</span><span class="w"></span>
@@ -139,7 +138,7 @@ <h2>Type Annotations<a class="headerlink" href="#type-annotations" title="Permal
 </div>
 </section>
 <section id="explicit-type-instantiation">
-<h2>Explicit Type Instantiation<a class="headerlink" href="#explicit-type-instantiation" title="Permalink to this heading"></a></h2>
+<h2>Explicit Type Instantiation<a class="headerlink" href="#explicit-type-instantiation" title="Permalink to this headline"></a></h2>
 <p>If <code class="docutils literal notranslate"><span class="pre">f</span></code> is a polymorphic value with type:</p>
 <div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">f</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="n">tyParam</span><span class="w"> </span><span class="p">}</span><span class="w"> </span><span class="n">tyParam</span><span class="w"></span>
 <span class="nf">f</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="n">zero</span><span class="w"></span>
@@ -151,7 +150,7 @@ <h2>Explicit Type Instantiation<a class="headerlink" href="#explicit-type-instan
 </div>
 </section>
 <section id="local-declarations">
-<h2>Local Declarations<a class="headerlink" href="#local-declarations" title="Permalink to this heading"></a></h2>
+<h2>Local Declarations<a class="headerlink" href="#local-declarations" title="Permalink to this headline"></a></h2>
 <p>Local declarations have the weakest precedence of all expressions.</p>
 <div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="mi">2</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="p">[</span><span class="kt">T</span><span class="p">]</span><span class="w"></span>
 <span class="w">  </span><span class="kr">where</span><span class="w"></span>
@@ -167,7 +166,7 @@ <h2>Local Declarations<a class="headerlink" href="#local-declarations" title="Pe
 </div>
 </section>
 <section id="block-arguments">
-<h2>Block Arguments<a class="headerlink" href="#block-arguments" title="Permalink to this heading"></a></h2>
+<h2>Block Arguments<a class="headerlink" href="#block-arguments" title="Permalink to this headline"></a></h2>
 <p>When used as the last argument to a function call,
 <code class="docutils literal notranslate"><span class="pre">if</span></code> and lambda expressions do not need parens:</p>
 <div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">f</span><span class="w"> </span><span class="nf">\</span><span class="n">x</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">x</span><span class="w">       </span><span class="c1">// call `f` with one argument `x -&gt; x`</span><span class="w"></span>
@@ -178,7 +177,7 @@ <h2>Block Arguments<a class="headerlink" href="#block-arguments" title="Permalin
 </div>
 </section>
 <section id="conditionals">
-<h2>Conditionals<a class="headerlink" href="#conditionals" title="Permalink to this heading"></a></h2>
+<h2>Conditionals<a class="headerlink" href="#conditionals" title="Permalink to this headline"></a></h2>
 <p>The <code class="docutils literal notranslate"><span class="pre">if</span> <span class="pre">...</span> <span class="pre">then</span> <span class="pre">...</span> <span class="pre">else</span></code> construct can be used with
 multiple branches. For example:</p>
 <div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">x</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="kr">if</span><span class="w"> </span><span class="n">y</span><span class="w"> </span><span class="o">%</span><span class="w"> </span><span class="mi">2</span><span class="w"> </span><span class="o">==</span><span class="w"> </span><span class="mi">0</span><span class="w"> </span><span class="kr">then</span><span class="w"> </span><span class="mi">22</span><span class="w"> </span><span class="kr">else</span><span class="w"> </span><span class="mi">33</span><span class="w"></span>
@@ -191,7 +190,7 @@ <h2>Conditionals<a class="headerlink" href="#conditionals" title="Permalink to t
 </div>
 </section>
 <section id="demoting-numeric-types-to-values">
-<h2>Demoting Numeric Types to Values<a class="headerlink" href="#demoting-numeric-types-to-values" title="Permalink to this heading"></a></h2>
+<h2>Demoting Numeric Types to Values<a class="headerlink" href="#demoting-numeric-types-to-values" title="Permalink to this headline"></a></h2>
 <p>The value corresponding to a numeric type may be accessed using the
 following notation:</p>
 <div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="p">`</span><span class="n">t</span><span class="w"></span>
diff --git a/docs/RefMan/_build/html/FFI.html b/docs/RefMan/_build/html/FFI.html
index 98e8b9ced..0f73e4a98 100644
--- a/docs/RefMan/_build/html/FFI.html
+++ b/docs/RefMan/_build/html/FFI.html
@@ -14,7 +14,6 @@
         <script data-url_root="./" id="documentation_options" src="_static/documentation_options.js"></script>
         <script src="_static/jquery.js"></script>
         <script src="_static/underscore.js"></script>
-        <script src="_static/_sphinx_javascript_frameworks_compat.js"></script>
         <script src="_static/doctools.js"></script>
     <script src="_static/js/theme.js"></script>
     <link rel="index" title="Index" href="genindex.html" />
@@ -94,16 +93,16 @@
            <div itemprop="articleBody">
              
   <section id="foreign-function-interface">
-<h1>Foreign Function Interface<a class="headerlink" href="#foreign-function-interface" title="Permalink to this heading"></a></h1>
+<h1>Foreign Function Interface<a class="headerlink" href="#foreign-function-interface" title="Permalink to this headline"></a></h1>
 <p>The foreign function interface (FFI) allows Cryptol to call functions written in
 C (or other languages that use the C calling convention).</p>
 <section id="platform-support">
-<h2>Platform support<a class="headerlink" href="#platform-support" title="Permalink to this heading"></a></h2>
+<h2>Platform support<a class="headerlink" href="#platform-support" title="Permalink to this headline"></a></h2>
 <p>The FFI is currently <strong>not supported on Windows</strong>, and only works on Unix-like
 systems (macOS and Linux).</p>
 </section>
 <section id="basic-usage">
-<h2>Basic usage<a class="headerlink" href="#basic-usage" title="Permalink to this heading"></a></h2>
+<h2>Basic usage<a class="headerlink" href="#basic-usage" title="Permalink to this headline"></a></h2>
 <p>Suppose we want to call the following C function:</p>
 <div class="highlight-c notranslate"><div class="highlight"><pre><span></span><span class="kt">uint32_t</span><span class="w"> </span><span class="nf">add</span><span class="p">(</span><span class="kt">uint32_t</span><span class="w"> </span><span class="n">x</span><span class="p">,</span><span class="w"> </span><span class="kt">uint32_t</span><span class="w"> </span><span class="n">y</span><span class="p">)</span><span class="w"> </span><span class="p">{</span><span class="w"></span>
 <span class="w">  </span><span class="k">return</span><span class="w"> </span><span class="n">x</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="n">y</span><span class="p">;</span><span class="w"></span>
@@ -149,7 +148,7 @@ <h2>Basic usage<a class="headerlink" href="#basic-usage" title="Permalink to thi
 be undefined behavior.</p>
 </section>
 <section id="compiling-c-code">
-<h2>Compiling C code<a class="headerlink" href="#compiling-c-code" title="Permalink to this heading"></a></h2>
+<h2>Compiling C code<a class="headerlink" href="#compiling-c-code" title="Permalink to this headline"></a></h2>
 <p>Cryptol currently does not handle compilation of C code to shared libraries. For
 simple usages, you can do this manually with the following commands:</p>
 <ul class="simple">
@@ -158,12 +157,12 @@ <h2>Compiling C code<a class="headerlink" href="#compiling-c-code" title="Permal
 </ul>
 </section>
 <section id="converting-between-cryptol-and-c-types">
-<h2>Converting between Cryptol and C types<a class="headerlink" href="#converting-between-cryptol-and-c-types" title="Permalink to this heading"></a></h2>
+<h2>Converting between Cryptol and C types<a class="headerlink" href="#converting-between-cryptol-and-c-types" title="Permalink to this headline"></a></h2>
 <p>This section describes how a given Cryptol function signature maps to a C
 function prototype. The FFI only supports a limited set of Cryptol types which
 have a clear translation into C.</p>
 <section id="overall-structure">
-<h3>Overall structure<a class="headerlink" href="#overall-structure" title="Permalink to this heading"></a></h3>
+<h3>Overall structure<a class="headerlink" href="#overall-structure" title="Permalink to this headline"></a></h3>
 <p>Cryptol <code class="docutils literal notranslate"><span class="pre">foreign</span></code> bindings must be functions. These functions may have
 multiple (curried) arguments; they may also be polymorphic, with certain
 limitations. That is, the general structure of a <code class="docutils literal notranslate"><span class="pre">foreign</span></code> declaration would
@@ -190,7 +189,7 @@ <h3>Overall structure<a class="headerlink" href="#overall-structure" title="Perm
 corresponds to.</p>
 </section>
 <section id="type-parameters">
-<h3>Type parameters<a class="headerlink" href="#type-parameters" title="Permalink to this heading"></a></h3>
+<h3>Type parameters<a class="headerlink" href="#type-parameters" title="Permalink to this headline"></a></h3>
 <table class="docutils align-default">
 <colgroup>
 <col style="width: 55%" />
@@ -217,7 +216,7 @@ <h3>Type parameters<a class="headerlink" href="#type-parameters" title="Permalin
 cumbersome.)</p>
 </section>
 <section id="bit">
-<h3>Bit<a class="headerlink" href="#bit" title="Permalink to this heading"></a></h3>
+<h3>Bit<a class="headerlink" href="#bit" title="Permalink to this headline"></a></h3>
 <table class="docutils align-default">
 <colgroup>
 <col style="width: 52%" />
@@ -239,7 +238,7 @@ <h3>Bit<a class="headerlink" href="#bit" title="Permalink to this heading"></
 <code class="docutils literal notranslate"><span class="pre">0</span></code> is converted to <code class="docutils literal notranslate"><span class="pre">False</span></code>.</p>
 </section>
 <section id="integral-types">
-<h3>Integral types<a class="headerlink" href="#integral-types" title="Permalink to this heading"></a></h3>
+<h3>Integral types<a class="headerlink" href="#integral-types" title="Permalink to this headline"></a></h3>
 <p>Let <code class="docutils literal notranslate"><span class="pre">K</span> <span class="pre">:</span> <span class="pre">#</span></code> be a Cryptol type. Note <code class="docutils literal notranslate"><span class="pre">K</span></code> must be an actual fixed numeric type
 and not a type variable.</p>
 <table class="docutils align-default">
@@ -278,7 +277,7 @@ <h3>Integral types<a class="headerlink" href="#integral-types" title="Permalink
 handle it in C as an array.</p>
 </section>
 <section id="floating-point-types">
-<h3>Floating point types<a class="headerlink" href="#floating-point-types" title="Permalink to this heading"></a></h3>
+<h3>Floating point types<a class="headerlink" href="#floating-point-types" title="Permalink to this headline"></a></h3>
 <table class="docutils align-default">
 <colgroup>
 <col style="width: 55%" />
@@ -302,7 +301,7 @@ <h3>Floating point types<a class="headerlink" href="#floating-point-types" title
 Other sizes of floating points are not supported.</p>
 </section>
 <section id="sequences">
-<h3>Sequences<a class="headerlink" href="#sequences" title="Permalink to this heading"></a></h3>
+<h3>Sequences<a class="headerlink" href="#sequences" title="Permalink to this headline"></a></h3>
 <p>Let <code class="docutils literal notranslate"><span class="pre">n1,</span> <span class="pre">n2,</span> <span class="pre">...,</span> <span class="pre">nk</span> <span class="pre">:</span> <span class="pre">#</span></code> be Cryptol types (with <code class="docutils literal notranslate"><span class="pre">k</span> <span class="pre">&gt;=</span> <span class="pre">1</span></code>), possibly
 containing type variables, that satisfy <code class="docutils literal notranslate"><span class="pre">fin</span> <span class="pre">n1,</span> <span class="pre">fin</span> <span class="pre">n2,</span> <span class="pre">...,</span> <span class="pre">fin</span> <span class="pre">nk</span></code>, and
 <code class="docutils literal notranslate"><span class="pre">T</span></code> be one of the above Cryptol <em>integral types</em> or <em>floating point types</em>.
@@ -331,7 +330,7 @@ <h3>Sequences<a class="headerlink" href="#sequences" title="Permalink to this he
 <code class="docutils literal notranslate"><span class="pre">size_t</span></code>’s earlier, so the C code can always know the dimensions of the array.</p>
 </section>
 <section id="tuples-and-records">
-<h3>Tuples and records<a class="headerlink" href="#tuples-and-records" title="Permalink to this heading"></a></h3>
+<h3>Tuples and records<a class="headerlink" href="#tuples-and-records" title="Permalink to this headline"></a></h3>
 <p>Let <code class="docutils literal notranslate"><span class="pre">T1,</span> <span class="pre">T2,</span> <span class="pre">...,</span> <span class="pre">Tn</span></code> be Cryptol types supported by the FFI (which may be any
 of the types mentioned above, or tuples and records themselves). Let
 <code class="docutils literal notranslate"><span class="pre">U1,</span> <span class="pre">U2,</span> <span class="pre">...,</span> <span class="pre">Un</span></code> be the C types that <code class="docutils literal notranslate"><span class="pre">T1,</span> <span class="pre">T2,</span> <span class="pre">...,</span> <span class="pre">Tn</span></code> respectively
@@ -361,12 +360,12 @@ <h3>Tuples and records<a class="headerlink" href="#tuples-and-records" title="Pe
 means empty tuples don’t map to any C values at all.</p>
 </section>
 <section id="type-synonyms">
-<h3>Type synonyms<a class="headerlink" href="#type-synonyms" title="Permalink to this heading"></a></h3>
+<h3>Type synonyms<a class="headerlink" href="#type-synonyms" title="Permalink to this headline"></a></h3>
 <p>All type synonyms are expanded before applying the above rules, so you can use
 type synonyms in <code class="docutils literal notranslate"><span class="pre">foreign</span></code> declarations to improve readability.</p>
 </section>
 <section id="return-values">
-<h3>Return values<a class="headerlink" href="#return-values" title="Permalink to this heading"></a></h3>
+<h3>Return values<a class="headerlink" href="#return-values" title="Permalink to this headline"></a></h3>
 <p>If the Cryptol return type is <code class="docutils literal notranslate"><span class="pre">Bit</span></code> or one of the above <em>integral types</em> or
 <em>floating point types</em>, the value is returned directly from the C function. In
 that case, the return type of the C function will be the C type corresponding to
@@ -379,7 +378,7 @@ <h3>Return values<a class="headerlink" href="#return-values" title="Permalink to
 input versions are the same type, because it is already a pointer.</p>
 </section>
 <section id="quick-reference">
-<h3>Quick reference<a class="headerlink" href="#quick-reference" title="Permalink to this heading"></a></h3>
+<h3>Quick reference<a class="headerlink" href="#quick-reference" title="Permalink to this headline"></a></h3>
 <table class="docutils align-default">
 <colgroup>
 <col style="width: 37%" />
@@ -457,7 +456,7 @@ <h3>Quick reference<a class="headerlink" href="#quick-reference" title="Permalin
 </section>
 </section>
 <section id="memory">
-<h2>Memory<a class="headerlink" href="#memory" title="Permalink to this heading"></a></h2>
+<h2>Memory<a class="headerlink" href="#memory" title="Permalink to this headline"></a></h2>
 <p>When pointers are involved, namely in the cases of sequences and output
 arguments, they point to memory. This memory is always allocated and deallocated
 by Cryptol; the C code does not need to manage this memory.</p>
@@ -471,11 +470,11 @@ <h2>Memory<a class="headerlink" href="#memory" title="Permalink to this heading"
 from it. It must write to the memory the value it is returning.</p>
 </section>
 <section id="evaluation">
-<h2>Evaluation<a class="headerlink" href="#evaluation" title="Permalink to this heading"></a></h2>
+<h2>Evaluation<a class="headerlink" href="#evaluation" title="Permalink to this headline"></a></h2>
 <p>All Cryptol arguments are fully evaluated when a foreign function is called.</p>
 </section>
 <section id="example">
-<h2>Example<a class="headerlink" href="#example" title="Permalink to this heading"></a></h2>
+<h2>Example<a class="headerlink" href="#example" title="Permalink to this headline"></a></h2>
 <p>The Cryptol signature</p>
 <div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">foreign</span><span class="w"> </span><span class="n">f</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">n</span><span class="p">}</span><span class="w"> </span><span class="p">(</span><span class="kr">fin</span><span class="w"> </span><span class="n">n</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="p">[</span><span class="n">n</span><span class="p">][</span><span class="mi">10</span><span class="p">]</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="p">{</span><span class="n">a</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="kr">Bit</span><span class="p">,</span><span class="w"> </span><span class="n">b</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="p">[</span><span class="mi">64</span><span class="p">]}</span><span class="w"></span>
 <span class="w">                           </span><span class="ow">-&gt;</span><span class="w"> </span><span class="p">(</span><span class="kt">Float64</span><span class="p">,</span><span class="w"> </span><span class="p">[</span><span class="n">n</span><span class="w"> </span><span class="o">+</span><span class="w"> </span><span class="mi">1</span><span class="p">][</span><span class="mi">20</span><span class="p">])</span><span class="w"></span>
diff --git a/docs/RefMan/_build/html/Modules.html b/docs/RefMan/_build/html/Modules.html
index a874dd877..412a71656 100644
--- a/docs/RefMan/_build/html/Modules.html
+++ b/docs/RefMan/_build/html/Modules.html
@@ -14,7 +14,6 @@
         <script data-url_root="./" id="documentation_options" src="_static/documentation_options.js"></script>
         <script src="_static/jquery.js"></script>
         <script src="_static/underscore.js"></script>
-        <script src="_static/_sphinx_javascript_frameworks_compat.js"></script>
         <script src="_static/doctools.js"></script>
     <script src="_static/js/theme.js"></script>
     <link rel="index" title="Index" href="genindex.html" />
@@ -100,7 +99,7 @@
            <div itemprop="articleBody">
              
   <section id="modules">
-<h1>Modules<a class="headerlink" href="#modules" title="Permalink to this heading"></a></h1>
+<h1>Modules<a class="headerlink" href="#modules" title="Permalink to this headline"></a></h1>
 <p>A <em>module</em> is used to group some related definitions.  Each file may
 contain at most one top-level module.</p>
 <div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kr">module</span><span class="w"> </span><span class="nn">M</span><span class="w"> </span><span class="kr">where</span><span class="w"></span>
@@ -112,7 +111,7 @@ <h1>Modules<a class="headerlink" href="#modules" title="Permalink to this headin
 </pre></div>
 </div>
 <section id="hierarchical-module-names">
-<h2>Hierarchical Module Names<a class="headerlink" href="#hierarchical-module-names" title="Permalink to this heading"></a></h2>
+<h2>Hierarchical Module Names<a class="headerlink" href="#hierarchical-module-names" title="Permalink to this headline"></a></h2>
 <p>Module may have either simple or <em>hierarchical</em> names.
 Hierarchical names are constructed by gluing together ordinary
 identifiers using the symbol <code class="docutils literal notranslate"><span class="pre">::</span></code>.</p>
@@ -129,7 +128,7 @@ <h2>Hierarchical Module Names<a class="headerlink" href="#hierarchical-module-na
 <code class="docutils literal notranslate"><span class="pre">Hash</span></code>, contained in one of the directories specified by <code class="docutils literal notranslate"><span class="pre">CRYPTOLPATH</span></code>.</p>
 </section>
 <section id="module-imports">
-<h2>Module Imports<a class="headerlink" href="#module-imports" title="Permalink to this heading"></a></h2>
+<h2>Module Imports<a class="headerlink" href="#module-imports" title="Permalink to this headline"></a></h2>
 <p>To use the definitions from one module in another module, we use
 <code class="docutils literal notranslate"><span class="pre">import</span></code> declarations:</p>
 <div class="literal-block-wrapper docutils container" id="id1">
@@ -154,7 +153,7 @@ <h2>Module Imports<a class="headerlink" href="#module-imports" title="Permalink
 </div>
 </div>
 <section id="import-lists">
-<h3>Import Lists<a class="headerlink" href="#import-lists" title="Permalink to this heading"></a></h3>
+<h3>Import Lists<a class="headerlink" href="#import-lists" title="Permalink to this headline"></a></h3>
 <p>Sometimes, we may want to import only some of the definitions
 from a module.  To do so, we use an import declaration with
 an <em>import list</em>.</p>
@@ -177,7 +176,7 @@ <h3>Import Lists<a class="headerlink" href="#import-lists" title="Permalink to t
 it makes it easy to see the source of definitions.</p>
 </section>
 <section id="hiding-imports">
-<h3>Hiding Imports<a class="headerlink" href="#hiding-imports" title="Permalink to this heading"></a></h3>
+<h3>Hiding Imports<a class="headerlink" href="#hiding-imports" title="Permalink to this headline"></a></h3>
 <p>Sometimes a module may provide many definitions, and we want to use
 most of them but with a few exceptions (e.g., because those would
 result to a name clash).   In such situations it is convenient
@@ -204,7 +203,7 @@ <h3>Hiding Imports<a class="headerlink" href="#hiding-imports" title="Permalink
 </div>
 </section>
 <section id="qualified-module-imports">
-<h3>Qualified Module Imports<a class="headerlink" href="#qualified-module-imports" title="Permalink to this heading"></a></h3>
+<h3>Qualified Module Imports<a class="headerlink" href="#qualified-module-imports" title="Permalink to this headline"></a></h3>
 <p>Another way to avoid name collisions is by using a
 <em>qualified</em> import.</p>
 <div class="literal-block-wrapper docutils container" id="id5">
@@ -253,7 +252,7 @@ <h3>Qualified Module Imports<a class="headerlink" href="#qualified-module-import
 </section>
 </section>
 <section id="private-blocks">
-<h2>Private Blocks<a class="headerlink" href="#private-blocks" title="Permalink to this heading"></a></h2>
+<h2>Private Blocks<a class="headerlink" href="#private-blocks" title="Permalink to this headline"></a></h2>
 <p>In some cases, definitions in a module might use helper
 functions that are not intended to be used outside the module.
 It is good practice to place such declarations in <em>private blocks</em>:</p>
@@ -318,7 +317,7 @@ <h2>Private Blocks<a class="headerlink" href="#private-blocks" title="Permalink
 </div>
 </section>
 <section id="nested-modules">
-<h2>Nested Modules<a class="headerlink" href="#nested-modules" title="Permalink to this heading"></a></h2>
+<h2>Nested Modules<a class="headerlink" href="#nested-modules" title="Permalink to this headline"></a></h2>
 <p>Module may be declared withing other modules, using the <code class="docutils literal notranslate"><span class="pre">submodule</span></code> keword.</p>
 <div class="literal-block-wrapper docutils container" id="id12">
 <div class="code-block-caption"><span class="caption-text">Declaring a nested module called N</span><a class="headerlink" href="#id12" title="Permalink to this code"></a></div>
@@ -355,7 +354,7 @@ <h2>Nested Modules<a class="headerlink" href="#nested-modules" title="Permalink
 So, in the previous example, it would be an error if <code class="docutils literal notranslate"><span class="pre">y</span></code> was
 to try to use <code class="docutils literal notranslate"><span class="pre">z</span></code> in its definition.</p>
 <section id="implicit-imports">
-<h3>Implicit Imports<a class="headerlink" href="#implicit-imports" title="Permalink to this heading"></a></h3>
+<h3>Implicit Imports<a class="headerlink" href="#implicit-imports" title="Permalink to this headline"></a></h3>
 <p>For convenience, we add an implicit qualified submodule import for
 each locally defined submodules.</p>
 <div class="literal-block-wrapper docutils container" id="id14">
@@ -375,7 +374,7 @@ <h3>Implicit Imports<a class="headerlink" href="#implicit-imports" title="Permal
 an implicit import <code class="docutils literal notranslate"><span class="pre">import</span> <span class="pre">submoulde</span> <span class="pre">N</span> <span class="pre">as</span> <span class="pre">N</span></code>.</p>
 </section>
 <section id="managing-module-names">
-<h3>Managing Module Names<a class="headerlink" href="#managing-module-names" title="Permalink to this heading"></a></h3>
+<h3>Managing Module Names<a class="headerlink" href="#managing-module-names" title="Permalink to this headline"></a></h3>
 <p>The names of nested modules are managed by the module system just
 like the name of any other declaration in Cryptol.  Thus, nested
 modules may declared in the public or private sections of their
@@ -407,14 +406,14 @@ <h3>Managing Module Names<a class="headerlink" href="#managing-module-names" tit
 </section>
 </section>
 <section id="parameterized-modules">
-<h2>Parameterized Modules<a class="headerlink" href="#parameterized-modules" title="Permalink to this heading"></a></h2>
+<h2>Parameterized Modules<a class="headerlink" href="#parameterized-modules" title="Permalink to this headline"></a></h2>
 <div class="admonition warning">
 <p class="admonition-title">Warning</p>
 <p>The documentation in this section is for the upcoming variant of
 the feature, which is not yet part of main line Cryptol.</p>
 </div>
 <section id="interface-modules">
-<h3>Interface Modules<a class="headerlink" href="#interface-modules" title="Permalink to this heading"></a></h3>
+<h3>Interface Modules<a class="headerlink" href="#interface-modules" title="Permalink to this headline"></a></h3>
 <p>An <em>interface module</em> describes the content of a module
 without providing a concrete implementation.</p>
 <div class="literal-block-wrapper docutils container" id="id16">
@@ -449,7 +448,7 @@ <h3>Interface Modules<a class="headerlink" href="#interface-modules" title="Perm
 </div>
 </section>
 <section id="importing-an-interface-module">
-<h3>Importing an Interface Module<a class="headerlink" href="#importing-an-interface-module" title="Permalink to this heading"></a></h3>
+<h3>Importing an Interface Module<a class="headerlink" href="#importing-an-interface-module" title="Permalink to this headline"></a></h3>
 <p>A module may be parameterized by importing an interface,
 instead of a concrete module</p>
 <div class="literal-block-wrapper docutils container" id="id18">
@@ -498,7 +497,7 @@ <h3>Importing an Interface Module<a class="headerlink" href="#importing-an-inter
 </div>
 </section>
 <section id="interface-constraints">
-<h3>Interface Constraints<a class="headerlink" href="#interface-constraints" title="Permalink to this heading"></a></h3>
+<h3>Interface Constraints<a class="headerlink" href="#interface-constraints" title="Permalink to this headline"></a></h3>
 <p>When working with multiple interfaces, it is to useful
 to be able to impose additional constraints on the
 types imported from the interface.</p>
@@ -527,7 +526,7 @@ <h3>Interface Constraints<a class="headerlink" href="#interface-constraints" tit
 may provide different values for <code class="docutils literal notranslate"><span class="pre">x</span></code>.</p>
 </section>
 <section id="instantiating-a-parameterized-module">
-<span id="instantiating-modules"></span><h3>Instantiating a Parameterized Module<a class="headerlink" href="#instantiating-a-parameterized-module" title="Permalink to this heading"></a></h3>
+<span id="instantiating-modules"></span><h3>Instantiating a Parameterized Module<a class="headerlink" href="#instantiating-a-parameterized-module" title="Permalink to this headline"></a></h3>
 <p>To use a parameterized module we need to provide concrete
 implementations for the interfaces that it uses, and provide
 a name for the resulting module.  This is done as follows:</p>
@@ -622,7 +621,7 @@ <h3>Interface Constraints<a class="headerlink" href="#interface-constraints" tit
 </div>
 </section>
 <section id="anonymous-interface-modules">
-<h3>Anonymous Interface Modules<a class="headerlink" href="#anonymous-interface-modules" title="Permalink to this heading"></a></h3>
+<h3>Anonymous Interface Modules<a class="headerlink" href="#anonymous-interface-modules" title="Permalink to this headline"></a></h3>
 <p>If we need to just parameterize a module by a couple of types/values,
 it is quite cumbersome to have to define a whole separate interface module.
 To make this more convenient we provide the following notation for defining
@@ -646,7 +645,7 @@ <h3>Anonymous Interface Modules<a class="headerlink" href="#anonymous-interface-
 the interface is declared outside of <code class="docutils literal notranslate"><span class="pre">M</span></code>.</p>
 </section>
 <section id="anonymous-instantiation-arguments">
-<h3>Anonymous Instantiation Arguments<a class="headerlink" href="#anonymous-instantiation-arguments" title="Permalink to this heading"></a></h3>
+<h3>Anonymous Instantiation Arguments<a class="headerlink" href="#anonymous-instantiation-arguments" title="Permalink to this headline"></a></h3>
 <p>Sometimes it is also a bit cumbersome to have to define a whole
 separate module just to pass it as an argument to some parameterized
 module.   To make this more convenient we support the following notion
@@ -678,7 +677,7 @@ <h3>Anonymous Instantiation Arguments<a class="headerlink" href="#anonymous-inst
 to parameterized module <code class="docutils literal notranslate"><span class="pre">M</span></code>.</p>
 </section>
 <section id="anonymous-import-instantiations">
-<h3>Anonymous Import Instantiations<a class="headerlink" href="#anonymous-import-instantiations" title="Permalink to this heading"></a></h3>
+<h3>Anonymous Import Instantiations<a class="headerlink" href="#anonymous-import-instantiations" title="Permalink to this headline"></a></h3>
 <p>We provide syntactic sugar for importing and instantiating a functor
 at the same time:</p>
 <div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="nf">submodule</span><span class="w"> </span><span class="kt">F</span><span class="w"> </span><span class="kr">where</span><span class="w"></span>
@@ -729,7 +728,7 @@ <h3>Anonymous Import Instantiations<a class="headerlink" href="#anonymous-import
 </div>
 </section>
 <section id="passing-through-module-parameters">
-<h3>Passing Through Module Parameters<a class="headerlink" href="#passing-through-module-parameters" title="Permalink to this heading"></a></h3>
+<h3>Passing Through Module Parameters<a class="headerlink" href="#passing-through-module-parameters" title="Permalink to this headline"></a></h3>
 <p>Occasionally it is useful to define a functor that instantiates <em>another</em>
 functor using the same parameters as the functor being defined
 (i.e., a functor parameter is passed on to another functor).  This can
diff --git a/docs/RefMan/_build/html/OverloadedOperations.html b/docs/RefMan/_build/html/OverloadedOperations.html
index f917ab032..ace85180c 100644
--- a/docs/RefMan/_build/html/OverloadedOperations.html
+++ b/docs/RefMan/_build/html/OverloadedOperations.html
@@ -14,7 +14,6 @@
         <script data-url_root="./" id="documentation_options" src="_static/documentation_options.js"></script>
         <script src="_static/jquery.js"></script>
         <script src="_static/underscore.js"></script>
-        <script src="_static/_sphinx_javascript_frameworks_compat.js"></script>
         <script src="_static/doctools.js"></script>
     <script src="_static/js/theme.js"></script>
     <link rel="index" title="Index" href="genindex.html" />
@@ -85,9 +84,9 @@
            <div itemprop="articleBody">
              
   <section id="overloaded-operations">
-<h1>Overloaded Operations<a class="headerlink" href="#overloaded-operations" title="Permalink to this heading"></a></h1>
+<h1>Overloaded Operations<a class="headerlink" href="#overloaded-operations" title="Permalink to this headline"></a></h1>
 <section id="equality">
-<h2>Equality<a class="headerlink" href="#equality" title="Permalink to this heading"></a></h2>
+<h2>Equality<a class="headerlink" href="#equality" title="Permalink to this headline"></a></h2>
 <div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kt">Eq</span><span class="w"></span>
 <span class="w">  </span><span class="p">(</span><span class="o">==</span><span class="p">)</span><span class="w">        </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">a</span><span class="p">}</span><span class="w">    </span><span class="p">(</span><span class="kt">Eq</span><span class="w"> </span><span class="n">a</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="kr">Bit</span><span class="w"></span>
 <span class="w">  </span><span class="p">(</span><span class="o">!=</span><span class="p">)</span><span class="w">        </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">a</span><span class="p">}</span><span class="w">    </span><span class="p">(</span><span class="kt">Eq</span><span class="w"> </span><span class="n">a</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="kr">Bit</span><span class="w"></span>
@@ -97,7 +96,7 @@ <h2>Equality<a class="headerlink" href="#equality" title="Permalink to this head
 </div>
 </section>
 <section id="comparisons">
-<h2>Comparisons<a class="headerlink" href="#comparisons" title="Permalink to this heading"></a></h2>
+<h2>Comparisons<a class="headerlink" href="#comparisons" title="Permalink to this headline"></a></h2>
 <div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kr">Cmp</span><span class="w"></span>
 <span class="w">  </span><span class="p">(</span><span class="o">&lt;</span><span class="p">)</span><span class="w">         </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">a</span><span class="p">}</span><span class="w"> </span><span class="p">(</span><span class="kr">Cmp</span><span class="w"> </span><span class="n">a</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="kr">Bit</span><span class="w"></span>
 <span class="w">  </span><span class="p">(</span><span class="o">&gt;</span><span class="p">)</span><span class="w">         </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">a</span><span class="p">}</span><span class="w"> </span><span class="p">(</span><span class="kr">Cmp</span><span class="w"> </span><span class="n">a</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="kr">Bit</span><span class="w"></span>
@@ -110,7 +109,7 @@ <h2>Comparisons<a class="headerlink" href="#comparisons" title="Permalink to thi
 </div>
 </section>
 <section id="signed-comparisons">
-<h2>Signed Comparisons<a class="headerlink" href="#signed-comparisons" title="Permalink to this heading"></a></h2>
+<h2>Signed Comparisons<a class="headerlink" href="#signed-comparisons" title="Permalink to this headline"></a></h2>
 <div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kt">SignedCmp</span><span class="w"></span>
 <span class="w">  </span><span class="p">(</span><span class="o">&lt;$</span><span class="p">)</span><span class="w">        </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">a</span><span class="p">}</span><span class="w"> </span><span class="p">(</span><span class="kt">SignedCmp</span><span class="w"> </span><span class="n">a</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="kr">Bit</span><span class="w"></span>
 <span class="w">  </span><span class="p">(</span><span class="o">&gt;$</span><span class="p">)</span><span class="w">        </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">a</span><span class="p">}</span><span class="w"> </span><span class="p">(</span><span class="kt">SignedCmp</span><span class="w"> </span><span class="n">a</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="kr">Bit</span><span class="w"></span>
@@ -120,14 +119,14 @@ <h2>Signed Comparisons<a class="headerlink" href="#signed-comparisons" title="Pe
 </div>
 </section>
 <section id="zero">
-<h2>Zero<a class="headerlink" href="#zero" title="Permalink to this heading"></a></h2>
+<h2>Zero<a class="headerlink" href="#zero" title="Permalink to this headline"></a></h2>
 <div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kt">Zero</span><span class="w"></span>
 <span class="w">  </span><span class="n">zero</span><span class="w">        </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">a</span><span class="p">}</span><span class="w"> </span><span class="p">(</span><span class="kt">Zero</span><span class="w"> </span><span class="n">a</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"></span>
 </pre></div>
 </div>
 </section>
 <section id="logical-operations">
-<h2>Logical Operations<a class="headerlink" href="#logical-operations" title="Permalink to this heading"></a></h2>
+<h2>Logical Operations<a class="headerlink" href="#logical-operations" title="Permalink to this headline"></a></h2>
 <div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kt">Logic</span><span class="w"></span>
 <span class="w">  </span><span class="p">(</span><span class="o">&amp;&amp;</span><span class="p">)</span><span class="w">        </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">a</span><span class="p">}</span><span class="w"> </span><span class="p">(</span><span class="kt">Logic</span><span class="w"> </span><span class="n">a</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"></span>
 <span class="w">  </span><span class="p">(</span><span class="o">||</span><span class="p">)</span><span class="w">        </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">a</span><span class="p">}</span><span class="w"> </span><span class="p">(</span><span class="kt">Logic</span><span class="w"> </span><span class="n">a</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"></span>
@@ -137,7 +136,7 @@ <h2>Logical Operations<a class="headerlink" href="#logical-operations" title="Pe
 </div>
 </section>
 <section id="basic-arithmetic">
-<h2>Basic Arithmetic<a class="headerlink" href="#basic-arithmetic" title="Permalink to this heading"></a></h2>
+<h2>Basic Arithmetic<a class="headerlink" href="#basic-arithmetic" title="Permalink to this headline"></a></h2>
 <div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kt">Ring</span><span class="w"></span>
 <span class="w">  </span><span class="n">fromInteger</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">a</span><span class="p">}</span><span class="w"> </span><span class="p">(</span><span class="kt">Ring</span><span class="w"> </span><span class="n">a</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="kt">Integer</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"></span>
 <span class="w">  </span><span class="p">(</span><span class="o">+</span><span class="p">)</span><span class="w">         </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">a</span><span class="p">}</span><span class="w"> </span><span class="p">(</span><span class="kt">Ring</span><span class="w"> </span><span class="n">a</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"></span>
@@ -149,7 +148,7 @@ <h2>Basic Arithmetic<a class="headerlink" href="#basic-arithmetic" title="Permal
 </div>
 </section>
 <section id="integral-operations">
-<h2>Integral Operations<a class="headerlink" href="#integral-operations" title="Permalink to this heading"></a></h2>
+<h2>Integral Operations<a class="headerlink" href="#integral-operations" title="Permalink to this headline"></a></h2>
 <div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kt">Integral</span><span class="w"></span>
 <span class="w">  </span><span class="p">(</span><span class="o">/</span><span class="p">)</span><span class="w">         </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">a</span><span class="p">}</span><span class="w"> </span><span class="p">(</span><span class="kt">Integral</span><span class="w"> </span><span class="n">a</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"></span>
 <span class="w">  </span><span class="p">(</span><span class="o">%</span><span class="p">)</span><span class="w">         </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">a</span><span class="p">}</span><span class="w"> </span><span class="p">(</span><span class="kt">Integral</span><span class="w"> </span><span class="n">a</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"></span>
@@ -161,7 +160,7 @@ <h2>Integral Operations<a class="headerlink" href="#integral-operations" title="
 </div>
 </section>
 <section id="division">
-<h2>Division<a class="headerlink" href="#division" title="Permalink to this heading"></a></h2>
+<h2>Division<a class="headerlink" href="#division" title="Permalink to this headline"></a></h2>
 <div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kt">Field</span><span class="w"></span>
 <span class="w">  </span><span class="n">recip</span><span class="w">       </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">a</span><span class="p">}</span><span class="w"> </span><span class="p">(</span><span class="kt">Field</span><span class="w"> </span><span class="n">a</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"></span>
 <span class="w">  </span><span class="p">(</span><span class="o">/.</span><span class="p">)</span><span class="w">        </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">a</span><span class="p">}</span><span class="w"> </span><span class="p">(</span><span class="kt">Field</span><span class="w"> </span><span class="n">a</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"></span>
@@ -169,7 +168,7 @@ <h2>Division<a class="headerlink" href="#division" title="Permalink to this head
 </div>
 </section>
 <section id="rounding">
-<h2>Rounding<a class="headerlink" href="#rounding" title="Permalink to this heading"></a></h2>
+<h2>Rounding<a class="headerlink" href="#rounding" title="Permalink to this headline"></a></h2>
 <div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kt">Round</span><span class="w"></span>
 <span class="w">  </span><span class="n">ceiling</span><span class="w">     </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">a</span><span class="p">}</span><span class="w"> </span><span class="p">(</span><span class="kt">Round</span><span class="w"> </span><span class="n">a</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="kt">Integer</span><span class="w"></span>
 <span class="w">  </span><span class="n">floor</span><span class="w">       </span><span class="kt">:</span><span class="w"> </span><span class="p">{</span><span class="n">a</span><span class="p">}</span><span class="w"> </span><span class="p">(</span><span class="kt">Round</span><span class="w"> </span><span class="n">a</span><span class="p">)</span><span class="w"> </span><span class="ow">=&gt;</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="ow">-&gt;</span><span class="w"> </span><span class="kt">Integer</span><span class="w"></span>
diff --git a/docs/RefMan/_build/html/RefMan.html b/docs/RefMan/_build/html/RefMan.html
index 497f19098..7c342eef3 100644
--- a/docs/RefMan/_build/html/RefMan.html
+++ b/docs/RefMan/_build/html/RefMan.html
@@ -14,7 +14,6 @@
         <script data-url_root="./" id="documentation_options" src="_static/documentation_options.js"></script>
         <script src="_static/jquery.js"></script>
         <script src="_static/underscore.js"></script>
-        <script src="_static/_sphinx_javascript_frameworks_compat.js"></script>
         <script src="_static/doctools.js"></script>
     <script src="_static/js/theme.js"></script>
     <link rel="index" title="Index" href="genindex.html" />
@@ -73,7 +72,7 @@
            <div itemprop="articleBody">
              
   <section id="cryptol-reference-manual">
-<h1>Cryptol Reference Manual<a class="headerlink" href="#cryptol-reference-manual" title="Permalink to this heading"></a></h1>
+<h1>Cryptol Reference Manual<a class="headerlink" href="#cryptol-reference-manual" title="Permalink to this headline"></a></h1>
 <div class="toctree-wrapper compound">
 <p class="caption" role="heading"><span class="caption-text">Cryptol Reference Manual</span></p>
 <ul>
diff --git a/docs/RefMan/_build/html/TypeDeclarations.html b/docs/RefMan/_build/html/TypeDeclarations.html
index 1d11e58af..d198f9833 100644
--- a/docs/RefMan/_build/html/TypeDeclarations.html
+++ b/docs/RefMan/_build/html/TypeDeclarations.html
@@ -14,7 +14,6 @@
         <script data-url_root="./" id="documentation_options" src="_static/documentation_options.js"></script>
         <script src="_static/jquery.js"></script>
         <script src="_static/underscore.js"></script>
-        <script src="_static/_sphinx_javascript_frameworks_compat.js"></script>
         <script src="_static/doctools.js"></script>
     <script src="_static/js/theme.js"></script>
     <link rel="index" title="Index" href="genindex.html" />
@@ -78,9 +77,9 @@
            <div itemprop="articleBody">
              
   <section id="type-declarations">
-<h1>Type Declarations<a class="headerlink" href="#type-declarations" title="Permalink to this heading"></a></h1>
+<h1>Type Declarations<a class="headerlink" href="#type-declarations" title="Permalink to this headline"></a></h1>
 <section id="type-synonyms">
-<h2>Type Synonyms<a class="headerlink" href="#type-synonyms" title="Permalink to this heading"></a></h2>
+<h2>Type Synonyms<a class="headerlink" href="#type-synonyms" title="Permalink to this headline"></a></h2>
 <div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kr">type</span><span class="w"> </span><span class="kt">T</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="n">b</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="p">[</span><span class="n">a</span><span class="p">]</span><span class="w"> </span><span class="n">b</span><span class="w"></span>
 </pre></div>
 </div>
@@ -93,7 +92,7 @@ <h2>Type Synonyms<a class="headerlink" href="#type-synonyms" title="Permalink to
 allowed to create a recursive collection of type synonyms.</p>
 </section>
 <section id="newtypes">
-<h2>Newtypes<a class="headerlink" href="#newtypes" title="Permalink to this heading"></a></h2>
+<h2>Newtypes<a class="headerlink" href="#newtypes" title="Permalink to this headline"></a></h2>
 <div class="highlight-cryptol notranslate"><div class="highlight"><pre><span></span><span class="kr">newtype</span><span class="w"> </span><span class="kt">NewT</span><span class="w"> </span><span class="n">a</span><span class="w"> </span><span class="n">b</span><span class="w"> </span><span class="ow">=</span><span class="w"> </span><span class="p">{</span><span class="w"> </span><span class="nb">seq</span><span class="w"> </span><span class="kt">:</span><span class="w"> </span><span class="p">[</span><span class="n">a</span><span class="p">]</span><span class="n">b</span><span class="w"> </span><span class="p">}</span><span class="w"></span>
 </pre></div>
 </div>
diff --git a/docs/RefMan/_build/html/_sources/BasicSyntax.rst.txt b/docs/RefMan/_build/html/_sources/BasicSyntax.rst.txt
index 992f9eb34..cab60dc5b 100644
--- a/docs/RefMan/_build/html/_sources/BasicSyntax.rst.txt
+++ b/docs/RefMan/_build/html/_sources/BasicSyntax.rst.txt
@@ -22,9 +22,9 @@ Type Signatures
 Numeric Constraint Guards
 -------------------------
 
-A declaration with a signature can use numeric constraint guards, which are like
-normal guards (such as in a multi-branch `if`` expression) except that the
-guarding conditions can be numeric constraints. For example:
+A declaration with a signature can use *numeric constraint guards*,
+which are used to change the behavior of a functoin depending on its
+numeric type parameters.  For example:
 
 .. code-block:: cryptol
 
@@ -32,8 +32,14 @@ guarding conditions can be numeric constraints. For example:
   len xs | n == 0 => 0
          | n >  0 => 1 + len (drop `{1} xs)
 
+Each behavior starts with ``|`` and lists some constraints on the numeric
+parameters to a declaration.  When applied, the function will use the first
+definition that satisfies the provided numeric parameters.
 
-Note that this is importantly different from
+Numeric constraint guards are quite similar to an ``if`` expression,
+except that decisions are based on *types* rather than values.  There
+is also an important difference to simply using demotion and an
+actual ``if`` statement:
 
 .. code-block:: cryptol
   
@@ -41,28 +47,26 @@ Note that this is importantly different from
   len' xs = if `n == 0 => 0
              | `n >  0 => 1 + len (drop `{1} xs)
 
-In `len'`, the type-checker cannot determine that `n >= 1` which is
-required to use the
-
-.. code-block:: cryptol
-
-  drop `{1} xs
-
-since the `if`'s condition is only on values, not types.
-
-However, in `len`, the type-checker locally-assumes the constraint `n > 0` in
-that constraint-guarded branch and so it can in fact determine that `n >= 1`.
+The definition of ``len'`` is rejected, because the *value based* ``if``
+expression does provide the *type based* fact ``n >= 1`` which is
+required by ``drop `{1} xs``, while in ``len``, the type-checker
+locally-assumes the constraint ``n > 0`` in that constraint-guarded branch
+and so it can in fact determine that ``n >= 1``.
 
 Requirements:
   - Numeric constraint guards only support constraints over numeric literals,
-    such as `fin`, `<=`, `==`, etc. Type constraint aliases can also be used as
-    long as they only constrain numeric literals.
+    such as ``fin``, ``<=``, ``==``, etc.
+    Type constraint aliases can also be used as long as they only constrain
+    numeric literals.
   - The numeric constraint guards of a declaration should be exhaustive. The
     type-checker will attempt to prove that the set of constraint guards is
     exhaustive, but if it can't then it will issue a non-exhaustive constraint
     guards warning. This warning is controlled by the environmental option
-    `warnNonExhaustiveConstraintGuards`.
-
+    ``warnNonExhaustiveConstraintGuards``.
+  - Each constraint guard is checked *independently* of the others, and there
+    are no implict assumptions that the previous behaviors do not match---
+    instead the programmer needs to specify all constraints explicitly
+    in the guard.
 
 Layout
 ------
diff --git a/docs/RefMan/_build/html/_static/basic.css b/docs/RefMan/_build/html/_static/basic.css
index 9039e027c..603f6a879 100644
--- a/docs/RefMan/_build/html/_static/basic.css
+++ b/docs/RefMan/_build/html/_static/basic.css
@@ -4,7 +4,7 @@
  *
  * Sphinx stylesheet -- basic theme.
  *
- * :copyright: Copyright 2007-2022 by the Sphinx team, see AUTHORS.
+ * :copyright: Copyright 2007-2021 by the Sphinx team, see AUTHORS.
  * :license: BSD, see LICENSE for details.
  *
  */
@@ -222,7 +222,7 @@ table.modindextable td {
 /* -- general body styles --------------------------------------------------- */
 
 div.body {
-    min-width: 360px;
+    min-width: 450px;
     max-width: 800px;
 }
 
@@ -335,13 +335,13 @@ p.sidebar-title {
     font-weight: bold;
 }
 
-div.admonition, div.topic, aside.topic, blockquote {
+div.admonition, div.topic, blockquote {
     clear: left;
 }
 
 /* -- topics ---------------------------------------------------------------- */
 
-div.topic, aside.topic {
+div.topic {
     border: 1px solid #ccc;
     padding: 7px;
     margin: 10px 0 10px 0;
@@ -380,7 +380,6 @@ div.body p.centered {
 div.sidebar > :last-child,
 aside.sidebar > :last-child,
 div.topic > :last-child,
-aside.topic > :last-child,
 div.admonition > :last-child {
     margin-bottom: 0;
 }
@@ -388,7 +387,6 @@ div.admonition > :last-child {
 div.sidebar::after,
 aside.sidebar::after,
 div.topic::after,
-aside.topic::after,
 div.admonition::after,
 blockquote::after {
     display: block;
@@ -430,6 +428,10 @@ table.docutils td, table.docutils th {
     border-bottom: 1px solid #aaa;
 }
 
+table.footnote td, table.footnote th {
+    border: 0 !important;
+}
+
 th {
     text-align: left;
     padding-right: 5px;
@@ -613,7 +615,6 @@ ul.simple p {
     margin-bottom: 0;
 }
 
-/* Docutils 0.17 and older (footnotes & citations) */
 dl.footnote > dt,
 dl.citation > dt {
     float: left;
@@ -631,33 +632,6 @@ dl.citation > dd:after {
     clear: both;
 }
 
-/* Docutils 0.18+ (footnotes & citations) */
-aside.footnote > span,
-div.citation > span {
-    float: left;
-}
-aside.footnote > span:last-of-type,
-div.citation > span:last-of-type {
-  padding-right: 0.5em;
-}
-aside.footnote > p {
-  margin-left: 2em;
-}
-div.citation > p {
-  margin-left: 4em;
-}
-aside.footnote > p:last-of-type,
-div.citation > p:last-of-type {
-    margin-bottom: 0em;
-}
-aside.footnote > p:last-of-type:after,
-div.citation > p:last-of-type:after {
-    content: "";
-    clear: both;
-}
-
-/* Footnotes & citations ends */
-
 dl.field-list {
     display: grid;
     grid-template-columns: fit-content(30%) auto;
@@ -783,7 +757,6 @@ span.pre {
     -ms-hyphens: none;
     -webkit-hyphens: none;
     hyphens: none;
-    white-space: nowrap;
 }
 
 div[class*="highlight-"] {
diff --git a/docs/RefMan/_build/html/_static/doctools.js b/docs/RefMan/_build/html/_static/doctools.js
index c3db08d1c..8cbf1b161 100644
--- a/docs/RefMan/_build/html/_static/doctools.js
+++ b/docs/RefMan/_build/html/_static/doctools.js
@@ -2,263 +2,322 @@
  * doctools.js
  * ~~~~~~~~~~~
  *
- * Base JavaScript utilities for all Sphinx HTML documentation.
+ * Sphinx JavaScript utilities for all documentation.
  *
- * :copyright: Copyright 2007-2022 by the Sphinx team, see AUTHORS.
+ * :copyright: Copyright 2007-2021 by the Sphinx team, see AUTHORS.
  * :license: BSD, see LICENSE for details.
  *
  */
-"use strict";
 
-const _ready = (callback) => {
-  if (document.readyState !== "loading") {
-    callback();
-  } else {
-    document.addEventListener("DOMContentLoaded", callback);
+/**
+ * select a different prefix for underscore
+ */
+$u = _.noConflict();
+
+/**
+ * make the code below compatible with browsers without
+ * an installed firebug like debugger
+if (!window.console || !console.firebug) {
+  var names = ["log", "debug", "info", "warn", "error", "assert", "dir",
+    "dirxml", "group", "groupEnd", "time", "timeEnd", "count", "trace",
+    "profile", "profileEnd"];
+  window.console = {};
+  for (var i = 0; i < names.length; ++i)
+    window.console[names[i]] = function() {};
+}
+ */
+
+/**
+ * small helper function to urldecode strings
+ *
+ * See https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/decodeURIComponent#Decoding_query_parameters_from_a_URL
+ */
+jQuery.urldecode = function(x) {
+  if (!x) {
+    return x
   }
+  return decodeURIComponent(x.replace(/\+/g, ' '));
 };
 
 /**
- * highlight a given string on a node by wrapping it in
- * span elements with the given class name.
+ * small helper function to urlencode strings
  */
-const _highlight = (node, addItems, text, className) => {
-  if (node.nodeType === Node.TEXT_NODE) {
-    const val = node.nodeValue;
-    const parent = node.parentNode;
-    const pos = val.toLowerCase().indexOf(text);
-    if (
-      pos >= 0 &&
-      !parent.classList.contains(className) &&
-      !parent.classList.contains("nohighlight")
-    ) {
-      let span;
+jQuery.urlencode = encodeURIComponent;
 
-      const closestNode = parent.closest("body, svg, foreignObject");
-      const isInSVG = closestNode && closestNode.matches("svg");
-      if (isInSVG) {
-        span = document.createElementNS("http://www.w3.org/2000/svg", "tspan");
-      } else {
-        span = document.createElement("span");
-        span.classList.add(className);
-      }
+/**
+ * This function returns the parsed url parameters of the
+ * current request. Multiple values per key are supported,
+ * it will always return arrays of strings for the value parts.
+ */
+jQuery.getQueryParameters = function(s) {
+  if (typeof s === 'undefined')
+    s = document.location.search;
+  var parts = s.substr(s.indexOf('?') + 1).split('&');
+  var result = {};
+  for (var i = 0; i < parts.length; i++) {
+    var tmp = parts[i].split('=', 2);
+    var key = jQuery.urldecode(tmp[0]);
+    var value = jQuery.urldecode(tmp[1]);
+    if (key in result)
+      result[key].push(value);
+    else
+      result[key] = [value];
+  }
+  return result;
+};
 
-      span.appendChild(document.createTextNode(val.substr(pos, text.length)));
-      parent.insertBefore(
-        span,
-        parent.insertBefore(
+/**
+ * highlight a given string on a jquery object by wrapping it in
+ * span elements with the given class name.
+ */
+jQuery.fn.highlightText = function(text, className) {
+  function highlight(node, addItems) {
+    if (node.nodeType === 3) {
+      var val = node.nodeValue;
+      var pos = val.toLowerCase().indexOf(text);
+      if (pos >= 0 &&
+          !jQuery(node.parentNode).hasClass(className) &&
+          !jQuery(node.parentNode).hasClass("nohighlight")) {
+        var span;
+        var isInSVG = jQuery(node).closest("body, svg, foreignObject").is("svg");
+        if (isInSVG) {
+          span = document.createElementNS("http://www.w3.org/2000/svg", "tspan");
+        } else {
+          span = document.createElement("span");
+          span.className = className;
+        }
+        span.appendChild(document.createTextNode(val.substr(pos, text.length)));
+        node.parentNode.insertBefore(span, node.parentNode.insertBefore(
           document.createTextNode(val.substr(pos + text.length)),
-          node.nextSibling
-        )
-      );
-      node.nodeValue = val.substr(0, pos);
-
-      if (isInSVG) {
-        const rect = document.createElementNS(
-          "http://www.w3.org/2000/svg",
-          "rect"
-        );
-        const bbox = parent.getBBox();
-        rect.x.baseVal.value = bbox.x;
-        rect.y.baseVal.value = bbox.y;
-        rect.width.baseVal.value = bbox.width;
-        rect.height.baseVal.value = bbox.height;
-        rect.setAttribute("class", className);
-        addItems.push({ parent: parent, target: rect });
+          node.nextSibling));
+        node.nodeValue = val.substr(0, pos);
+        if (isInSVG) {
+          var rect = document.createElementNS("http://www.w3.org/2000/svg", "rect");
+          var bbox = node.parentElement.getBBox();
+          rect.x.baseVal.value = bbox.x;
+          rect.y.baseVal.value = bbox.y;
+          rect.width.baseVal.value = bbox.width;
+          rect.height.baseVal.value = bbox.height;
+          rect.setAttribute('class', className);
+          addItems.push({
+              "parent": node.parentNode,
+              "target": rect});
+        }
       }
     }
-  } else if (node.matches && !node.matches("button, select, textarea")) {
-    node.childNodes.forEach((el) => _highlight(el, addItems, text, className));
+    else if (!jQuery(node).is("button, select, textarea")) {
+      jQuery.each(node.childNodes, function() {
+        highlight(this, addItems);
+      });
+    }
   }
-};
-const _highlightText = (thisNode, text, className) => {
-  let addItems = [];
-  _highlight(thisNode, addItems, text, className);
-  addItems.forEach((obj) =>
-    obj.parent.insertAdjacentElement("beforebegin", obj.target)
-  );
+  var addItems = [];
+  var result = this.each(function() {
+    highlight(this, addItems);
+  });
+  for (var i = 0; i < addItems.length; ++i) {
+    jQuery(addItems[i].parent).before(addItems[i].target);
+  }
+  return result;
 };
 
+/*
+ * backward compatibility for jQuery.browser
+ * This will be supported until firefox bug is fixed.
+ */
+if (!jQuery.browser) {
+  jQuery.uaMatch = function(ua) {
+    ua = ua.toLowerCase();
+
+    var match = /(chrome)[ \/]([\w.]+)/.exec(ua) ||
+      /(webkit)[ \/]([\w.]+)/.exec(ua) ||
+      /(opera)(?:.*version|)[ \/]([\w.]+)/.exec(ua) ||
+      /(msie) ([\w.]+)/.exec(ua) ||
+      ua.indexOf("compatible") < 0 && /(mozilla)(?:.*? rv:([\w.]+)|)/.exec(ua) ||
+      [];
+
+    return {
+      browser: match[ 1 ] || "",
+      version: match[ 2 ] || "0"
+    };
+  };
+  jQuery.browser = {};
+  jQuery.browser[jQuery.uaMatch(navigator.userAgent).browser] = true;
+}
+
 /**
  * Small JavaScript module for the documentation.
  */
-const Documentation = {
-  init: () => {
-    Documentation.highlightSearchWords();
-    Documentation.initDomainIndexTable();
-    Documentation.initOnKeyListeners();
+var Documentation = {
+
+  init : function() {
+    this.fixFirefoxAnchorBug();
+    this.highlightSearchWords();
+    this.initIndexTable();
+    if (DOCUMENTATION_OPTIONS.NAVIGATION_WITH_KEYS) {
+      this.initOnKeyListeners();
+    }
   },
 
   /**
    * i18n support
    */
-  TRANSLATIONS: {},
-  PLURAL_EXPR: (n) => (n === 1 ? 0 : 1),
-  LOCALE: "unknown",
+  TRANSLATIONS : {},
+  PLURAL_EXPR : function(n) { return n === 1 ? 0 : 1; },
+  LOCALE : 'unknown',
 
   // gettext and ngettext don't access this so that the functions
   // can safely bound to a different name (_ = Documentation.gettext)
-  gettext: (string) => {
-    const translated = Documentation.TRANSLATIONS[string];
-    switch (typeof translated) {
-      case "undefined":
-        return string; // no translation
-      case "string":
-        return translated; // translation exists
-      default:
-        return translated[0]; // (singular, plural) translation tuple exists
-    }
+  gettext : function(string) {
+    var translated = Documentation.TRANSLATIONS[string];
+    if (typeof translated === 'undefined')
+      return string;
+    return (typeof translated === 'string') ? translated : translated[0];
   },
 
-  ngettext: (singular, plural, n) => {
-    const translated = Documentation.TRANSLATIONS[singular];
-    if (typeof translated !== "undefined")
-      return translated[Documentation.PLURAL_EXPR(n)];
-    return n === 1 ? singular : plural;
+  ngettext : function(singular, plural, n) {
+    var translated = Documentation.TRANSLATIONS[singular];
+    if (typeof translated === 'undefined')
+      return (n == 1) ? singular : plural;
+    return translated[Documentation.PLURALEXPR(n)];
   },
 
-  addTranslations: (catalog) => {
-    Object.assign(Documentation.TRANSLATIONS, catalog.messages);
-    Documentation.PLURAL_EXPR = new Function(
-      "n",
-      `return (${catalog.plural_expr})`
-    );
-    Documentation.LOCALE = catalog.locale;
+  addTranslations : function(catalog) {
+    for (var key in catalog.messages)
+      this.TRANSLATIONS[key] = catalog.messages[key];
+    this.PLURAL_EXPR = new Function('n', 'return +(' + catalog.plural_expr + ')');
+    this.LOCALE = catalog.locale;
   },
 
   /**
-   * highlight the search words provided in the url in the text
+   * add context elements like header anchor links
    */
-  highlightSearchWords: () => {
-    const highlight =
-      new URLSearchParams(window.location.search).get("highlight") || "";
-    const terms = highlight.toLowerCase().split(/\s+/).filter(x => x);
-    if (terms.length === 0) return; // nothing to do
-
-    // There should never be more than one element matching "div.body"
-    const divBody = document.querySelectorAll("div.body");
-    const body = divBody.length ? divBody[0] : document.querySelector("body");
-    window.setTimeout(() => {
-      terms.forEach((term) => _highlightText(body, term, "highlighted"));
-    }, 10);
-
-    const searchBox = document.getElementById("searchbox");
-    if (searchBox === null) return;
-    searchBox.appendChild(
-      document
-        .createRange()
-        .createContextualFragment(
-          '<p class="highlight-link">' +
-            '<a href="javascript:Documentation.hideSearchWords()">' +
-            Documentation.gettext("Hide Search Matches") +
-            "</a></p>"
-        )
-    );
+  addContextElements : function() {
+    $('div[id] > :header:first').each(function() {
+      $('<a class="headerlink">\u00B6</a>').
+      attr('href', '#' + this.id).
+      attr('title', _('Permalink to this headline')).
+      appendTo(this);
+    });
+    $('dt[id]').each(function() {
+      $('<a class="headerlink">\u00B6</a>').
+      attr('href', '#' + this.id).
+      attr('title', _('Permalink to this definition')).
+      appendTo(this);
+    });
   },
 
   /**
-   * helper function to hide the search marks again
+   * workaround a firefox stupidity
+   * see: https://bugzilla.mozilla.org/show_bug.cgi?id=645075
    */
-  hideSearchWords: () => {
-    document
-      .querySelectorAll("#searchbox .highlight-link")
-      .forEach((el) => el.remove());
-    document
-      .querySelectorAll("span.highlighted")
-      .forEach((el) => el.classList.remove("highlighted"));
-    const url = new URL(window.location);
-    url.searchParams.delete("highlight");
-    window.history.replaceState({}, "", url);
+  fixFirefoxAnchorBug : function() {
+    if (document.location.hash && $.browser.mozilla)
+      window.setTimeout(function() {
+        document.location.href += '';
+      }, 10);
   },
 
   /**
-   * helper function to focus on search bar
+   * highlight the search words provided in the url in the text
    */
-  focusSearchBar: () => {
-    document.querySelectorAll("input[name=q]")[0]?.focus();
+  highlightSearchWords : function() {
+    var params = $.getQueryParameters();
+    var terms = (params.highlight) ? params.highlight[0].split(/\s+/) : [];
+    if (terms.length) {
+      var body = $('div.body');
+      if (!body.length) {
+        body = $('body');
+      }
+      window.setTimeout(function() {
+        $.each(terms, function() {
+          body.highlightText(this.toLowerCase(), 'highlighted');
+        });
+      }, 10);
+      $('<p class="highlight-link"><a href="javascript:Documentation.' +
+        'hideSearchWords()">' + _('Hide Search Matches') + '</a></p>')
+          .appendTo($('#searchbox'));
+    }
   },
 
   /**
-   * Initialise the domain index toggle buttons
+   * init the domain index toggle buttons
    */
-  initDomainIndexTable: () => {
-    const toggler = (el) => {
-      const idNumber = el.id.substr(7);
-      const toggledRows = document.querySelectorAll(`tr.cg-${idNumber}`);
-      if (el.src.substr(-9) === "minus.png") {
-        el.src = `${el.src.substr(0, el.src.length - 9)}plus.png`;
-        toggledRows.forEach((el) => (el.style.display = "none"));
-      } else {
-        el.src = `${el.src.substr(0, el.src.length - 8)}minus.png`;
-        toggledRows.forEach((el) => (el.style.display = ""));
-      }
-    };
-
-    const togglerElements = document.querySelectorAll("img.toggler");
-    togglerElements.forEach((el) =>
-      el.addEventListener("click", (event) => toggler(event.currentTarget))
-    );
-    togglerElements.forEach((el) => (el.style.display = ""));
-    if (DOCUMENTATION_OPTIONS.COLLAPSE_INDEX) togglerElements.forEach(toggler);
+  initIndexTable : function() {
+    var togglers = $('img.toggler').click(function() {
+      var src = $(this).attr('src');
+      var idnum = $(this).attr('id').substr(7);
+      $('tr.cg-' + idnum).toggle();
+      if (src.substr(-9) === 'minus.png')
+        $(this).attr('src', src.substr(0, src.length-9) + 'plus.png');
+      else
+        $(this).attr('src', src.substr(0, src.length-8) + 'minus.png');
+    }).css('display', '');
+    if (DOCUMENTATION_OPTIONS.COLLAPSE_INDEX) {
+        togglers.click();
+    }
   },
 
-  initOnKeyListeners: () => {
-    // only install a listener if it is really needed
-    if (
-      !DOCUMENTATION_OPTIONS.NAVIGATION_WITH_KEYS &&
-      !DOCUMENTATION_OPTIONS.ENABLE_SEARCH_SHORTCUTS
-    )
-      return;
+  /**
+   * helper function to hide the search marks again
+   */
+  hideSearchWords : function() {
+    $('#searchbox .highlight-link').fadeOut(300);
+    $('span.highlighted').removeClass('highlighted');
+  },
 
-    const blacklistedElements = new Set([
-      "TEXTAREA",
-      "INPUT",
-      "SELECT",
-      "BUTTON",
-    ]);
-    document.addEventListener("keydown", (event) => {
-      if (blacklistedElements.has(document.activeElement.tagName)) return; // bail for input elements
-      if (event.altKey || event.ctrlKey || event.metaKey) return; // bail with special keys
+  /**
+   * make the url absolute
+   */
+  makeURL : function(relativeURL) {
+    return DOCUMENTATION_OPTIONS.URL_ROOT + '/' + relativeURL;
+  },
 
-      if (!event.shiftKey) {
-        switch (event.key) {
-          case "ArrowLeft":
-            if (!DOCUMENTATION_OPTIONS.NAVIGATION_WITH_KEYS) break;
+  /**
+   * get the current relative url
+   */
+  getCurrentURL : function() {
+    var path = document.location.pathname;
+    var parts = path.split(/\//);
+    $.each(DOCUMENTATION_OPTIONS.URL_ROOT.split(/\//), function() {
+      if (this === '..')
+        parts.pop();
+    });
+    var url = parts.join('/');
+    return path.substring(url.lastIndexOf('/') + 1, path.length - 1);
+  },
 
-            const prevLink = document.querySelector('link[rel="prev"]');
-            if (prevLink && prevLink.href) {
-              window.location.href = prevLink.href;
-              event.preventDefault();
+  initOnKeyListeners: function() {
+    $(document).keydown(function(event) {
+      var activeElementType = document.activeElement.tagName;
+      // don't navigate when in search box, textarea, dropdown or button
+      if (activeElementType !== 'TEXTAREA' && activeElementType !== 'INPUT' && activeElementType !== 'SELECT'
+          && activeElementType !== 'BUTTON' && !event.altKey && !event.ctrlKey && !event.metaKey
+          && !event.shiftKey) {
+        switch (event.keyCode) {
+          case 37: // left
+            var prevHref = $('link[rel="prev"]').prop('href');
+            if (prevHref) {
+              window.location.href = prevHref;
+              return false;
             }
             break;
-          case "ArrowRight":
-            if (!DOCUMENTATION_OPTIONS.NAVIGATION_WITH_KEYS) break;
-
-            const nextLink = document.querySelector('link[rel="next"]');
-            if (nextLink && nextLink.href) {
-              window.location.href = nextLink.href;
-              event.preventDefault();
+          case 39: // right
+            var nextHref = $('link[rel="next"]').prop('href');
+            if (nextHref) {
+              window.location.href = nextHref;
+              return false;
             }
             break;
-          case "Escape":
-            if (!DOCUMENTATION_OPTIONS.ENABLE_SEARCH_SHORTCUTS) break;
-            Documentation.hideSearchWords();
-            event.preventDefault();
         }
       }
-
-      // some keyboard layouts may need Shift to get /
-      switch (event.key) {
-        case "/":
-          if (!DOCUMENTATION_OPTIONS.ENABLE_SEARCH_SHORTCUTS) break;
-          Documentation.focusSearchBar();
-          event.preventDefault();
-      }
     });
-  },
+  }
 };
 
 // quick alias for translations
-const _ = Documentation.gettext;
+_ = Documentation.gettext;
 
-_ready(Documentation.init);
+$(document).ready(function() {
+  Documentation.init();
+});
diff --git a/docs/RefMan/_build/html/_static/documentation_options.js b/docs/RefMan/_build/html/_static/documentation_options.js
index 1d9c2211c..b6ad65f53 100644
--- a/docs/RefMan/_build/html/_static/documentation_options.js
+++ b/docs/RefMan/_build/html/_static/documentation_options.js
@@ -1,14 +1,12 @@
 var DOCUMENTATION_OPTIONS = {
     URL_ROOT: document.getElementById("documentation_options").getAttribute('data-url_root'),
     VERSION: '2.11.0',
-    LANGUAGE: 'en',
+    LANGUAGE: 'None',
     COLLAPSE_INDEX: false,
     BUILDER: 'html',
     FILE_SUFFIX: '.html',
     LINK_SUFFIX: '.html',
     HAS_SOURCE: true,
     SOURCELINK_SUFFIX: '.txt',
-    NAVIGATION_WITH_KEYS: false,
-    SHOW_SEARCH_SUMMARY: true,
-    ENABLE_SEARCH_SHORTCUTS: false,
+    NAVIGATION_WITH_KEYS: false
 };
\ No newline at end of file
diff --git a/docs/RefMan/_build/html/_static/jquery.js b/docs/RefMan/_build/html/_static/jquery.js
index c4c6022f2..624bca829 100644
--- a/docs/RefMan/_build/html/_static/jquery.js
+++ b/docs/RefMan/_build/html/_static/jquery.js
@@ -1,2 +1,10879 @@
-/*! jQuery v3.6.0 | (c) OpenJS Foundation and other contributors | jquery.org/license */
-!function(e,t){"use strict";"object"==typeof module&&"object"==typeof module.exports?module.exports=e.document?t(e,!0):function(e){if(!e.document)throw new Error("jQuery requires a window with a document");return t(e)}:t(e)}("undefined"!=typeof window?window:this,function(C,e){"use strict";var t=[],r=Object.getPrototypeOf,s=t.slice,g=t.flat?function(e){return t.flat.call(e)}:function(e){return t.concat.apply([],e)},u=t.push,i=t.indexOf,n={},o=n.toString,v=n.hasOwnProperty,a=v.toString,l=a.call(Object),y={},m=function(e){return"function"==typeof e&&"number"!=typeof e.nodeType&&"function"!=typeof e.item},x=function(e){return null!=e&&e===e.window},E=C.document,c={type:!0,src:!0,nonce:!0,noModule:!0};function b(e,t,n){var r,i,o=(n=n||E).createElement("script");if(o.text=e,t)for(r in c)(i=t[r]||t.getAttribute&&t.getAttribute(r))&&o.setAttribute(r,i);n.head.appendChild(o).parentNode.removeChild(o)}function w(e){return null==e?e+"":"object"==typeof e||"function"==typeof e?n[o.call(e)]||"object":typeof e}var f="3.6.0",S=function(e,t){return new S.fn.init(e,t)};function p(e){var t=!!e&&"length"in e&&e.length,n=w(e);return!m(e)&&!x(e)&&("array"===n||0===t||"number"==typeof t&&0<t&&t-1 in e)}S.fn=S.prototype={jquery:f,constructor:S,length:0,toArray:function(){return s.call(this)},get:function(e){return null==e?s.call(this):e<0?this[e+this.length]:this[e]},pushStack:function(e){var t=S.merge(this.constructor(),e);return t.prevObject=this,t},each:function(e){return S.each(this,e)},map:function(n){return this.pushStack(S.map(this,function(e,t){return n.call(e,t,e)}))},slice:function(){return this.pushStack(s.apply(this,arguments))},first:function(){return this.eq(0)},last:function(){return this.eq(-1)},even:function(){return this.pushStack(S.grep(this,function(e,t){return(t+1)%2}))},odd:function(){return this.pushStack(S.grep(this,function(e,t){return t%2}))},eq:function(e){var t=this.length,n=+e+(e<0?t:0);return this.pushStack(0<=n&&n<t?[this[n]]:[])},end:function(){return this.prevObject||this.constructor()},push:u,sort:t.sort,splice:t.splice},S.extend=S.fn.extend=function(){var e,t,n,r,i,o,a=arguments[0]||{},s=1,u=arguments.length,l=!1;for("boolean"==typeof a&&(l=a,a=arguments[s]||{},s++),"object"==typeof a||m(a)||(a={}),s===u&&(a=this,s--);s<u;s++)if(null!=(e=arguments[s]))for(t in e)r=e[t],"__proto__"!==t&&a!==r&&(l&&r&&(S.isPlainObject(r)||(i=Array.isArray(r)))?(n=a[t],o=i&&!Array.isArray(n)?[]:i||S.isPlainObject(n)?n:{},i=!1,a[t]=S.extend(l,o,r)):void 0!==r&&(a[t]=r));return a},S.extend({expando:"jQuery"+(f+Math.random()).replace(/\D/g,""),isReady:!0,error:function(e){throw new Error(e)},noop:function(){},isPlainObject:function(e){var t,n;return!(!e||"[object Object]"!==o.call(e))&&(!(t=r(e))||"function"==typeof(n=v.call(t,"constructor")&&t.constructor)&&a.call(n)===l)},isEmptyObject:function(e){var t;for(t in e)return!1;return!0},globalEval:function(e,t,n){b(e,{nonce:t&&t.nonce},n)},each:function(e,t){var n,r=0;if(p(e)){for(n=e.length;r<n;r++)if(!1===t.call(e[r],r,e[r]))break}else for(r in e)if(!1===t.call(e[r],r,e[r]))break;return e},makeArray:function(e,t){var n=t||[];return null!=e&&(p(Object(e))?S.merge(n,"string"==typeof e?[e]:e):u.call(n,e)),n},inArray:function(e,t,n){return null==t?-1:i.call(t,e,n)},merge:function(e,t){for(var n=+t.length,r=0,i=e.length;r<n;r++)e[i++]=t[r];return e.length=i,e},grep:function(e,t,n){for(var r=[],i=0,o=e.length,a=!n;i<o;i++)!t(e[i],i)!==a&&r.push(e[i]);return r},map:function(e,t,n){var r,i,o=0,a=[];if(p(e))for(r=e.length;o<r;o++)null!=(i=t(e[o],o,n))&&a.push(i);else for(o in e)null!=(i=t(e[o],o,n))&&a.push(i);return g(a)},guid:1,support:y}),"function"==typeof Symbol&&(S.fn[Symbol.iterator]=t[Symbol.iterator]),S.each("Boolean Number String Function Array Date RegExp Object Error Symbol".split(" "),function(e,t){n["[object "+t+"]"]=t.toLowerCase()});var d=function(n){var e,d,b,o,i,h,f,g,w,u,l,T,C,a,E,v,s,c,y,S="sizzle"+1*new Date,p=n.document,k=0,r=0,m=ue(),x=ue(),A=ue(),N=ue(),j=function(e,t){return e===t&&(l=!0),0},D={}.hasOwnProperty,t=[],q=t.pop,L=t.push,H=t.push,O=t.slice,P=function(e,t){for(var n=0,r=e.length;n<r;n++)if(e[n]===t)return n;return-1},R="checked|selected|async|autofocus|autoplay|controls|defer|disabled|hidden|ismap|loop|multiple|open|readonly|required|scoped",M="[\\x20\\t\\r\\n\\f]",I="(?:\\\\[\\da-fA-F]{1,6}"+M+"?|\\\\[^\\r\\n\\f]|[\\w-]|[^\0-\\x7f])+",W="\\["+M+"*("+I+")(?:"+M+"*([*^$|!~]?=)"+M+"*(?:'((?:\\\\.|[^\\\\'])*)'|\"((?:\\\\.|[^\\\\\"])*)\"|("+I+"))|)"+M+"*\\]",F=":("+I+")(?:\\((('((?:\\\\.|[^\\\\'])*)'|\"((?:\\\\.|[^\\\\\"])*)\")|((?:\\\\.|[^\\\\()[\\]]|"+W+")*)|.*)\\)|)",B=new RegExp(M+"+","g"),$=new RegExp("^"+M+"+|((?:^|[^\\\\])(?:\\\\.)*)"+M+"+$","g"),_=new RegExp("^"+M+"*,"+M+"*"),z=new RegExp("^"+M+"*([>+~]|"+M+")"+M+"*"),U=new RegExp(M+"|>"),X=new RegExp(F),V=new RegExp("^"+I+"$"),G={ID:new RegExp("^#("+I+")"),CLASS:new RegExp("^\\.("+I+")"),TAG:new RegExp("^("+I+"|[*])"),ATTR:new RegExp("^"+W),PSEUDO:new RegExp("^"+F),CHILD:new RegExp("^:(only|first|last|nth|nth-last)-(child|of-type)(?:\\("+M+"*(even|odd|(([+-]|)(\\d*)n|)"+M+"*(?:([+-]|)"+M+"*(\\d+)|))"+M+"*\\)|)","i"),bool:new RegExp("^(?:"+R+")$","i"),needsContext:new RegExp("^"+M+"*[>+~]|:(even|odd|eq|gt|lt|nth|first|last)(?:\\("+M+"*((?:-\\d)?\\d*)"+M+"*\\)|)(?=[^-]|$)","i")},Y=/HTML$/i,Q=/^(?:input|select|textarea|button)$/i,J=/^h\d$/i,K=/^[^{]+\{\s*\[native \w/,Z=/^(?:#([\w-]+)|(\w+)|\.([\w-]+))$/,ee=/[+~]/,te=new RegExp("\\\\[\\da-fA-F]{1,6}"+M+"?|\\\\([^\\r\\n\\f])","g"),ne=function(e,t){var n="0x"+e.slice(1)-65536;return t||(n<0?String.fromCharCode(n+65536):String.fromCharCode(n>>10|55296,1023&n|56320))},re=/([\0-\x1f\x7f]|^-?\d)|^-$|[^\0-\x1f\x7f-\uFFFF\w-]/g,ie=function(e,t){return t?"\0"===e?"\ufffd":e.slice(0,-1)+"\\"+e.charCodeAt(e.length-1).toString(16)+" ":"\\"+e},oe=function(){T()},ae=be(function(e){return!0===e.disabled&&"fieldset"===e.nodeName.toLowerCase()},{dir:"parentNode",next:"legend"});try{H.apply(t=O.call(p.childNodes),p.childNodes),t[p.childNodes.length].nodeType}catch(e){H={apply:t.length?function(e,t){L.apply(e,O.call(t))}:function(e,t){var n=e.length,r=0;while(e[n++]=t[r++]);e.length=n-1}}}function se(t,e,n,r){var i,o,a,s,u,l,c,f=e&&e.ownerDocument,p=e?e.nodeType:9;if(n=n||[],"string"!=typeof t||!t||1!==p&&9!==p&&11!==p)return n;if(!r&&(T(e),e=e||C,E)){if(11!==p&&(u=Z.exec(t)))if(i=u[1]){if(9===p){if(!(a=e.getElementById(i)))return n;if(a.id===i)return n.push(a),n}else if(f&&(a=f.getElementById(i))&&y(e,a)&&a.id===i)return n.push(a),n}else{if(u[2])return H.apply(n,e.getElementsByTagName(t)),n;if((i=u[3])&&d.getElementsByClassName&&e.getElementsByClassName)return H.apply(n,e.getElementsByClassName(i)),n}if(d.qsa&&!N[t+" "]&&(!v||!v.test(t))&&(1!==p||"object"!==e.nodeName.toLowerCase())){if(c=t,f=e,1===p&&(U.test(t)||z.test(t))){(f=ee.test(t)&&ye(e.parentNode)||e)===e&&d.scope||((s=e.getAttribute("id"))?s=s.replace(re,ie):e.setAttribute("id",s=S)),o=(l=h(t)).length;while(o--)l[o]=(s?"#"+s:":scope")+" "+xe(l[o]);c=l.join(",")}try{return H.apply(n,f.querySelectorAll(c)),n}catch(e){N(t,!0)}finally{s===S&&e.removeAttribute("id")}}}return g(t.replace($,"$1"),e,n,r)}function ue(){var r=[];return function e(t,n){return r.push(t+" ")>b.cacheLength&&delete e[r.shift()],e[t+" "]=n}}function le(e){return e[S]=!0,e}function ce(e){var t=C.createElement("fieldset");try{return!!e(t)}catch(e){return!1}finally{t.parentNode&&t.parentNode.removeChild(t),t=null}}function fe(e,t){var n=e.split("|"),r=n.length;while(r--)b.attrHandle[n[r]]=t}function pe(e,t){var n=t&&e,r=n&&1===e.nodeType&&1===t.nodeType&&e.sourceIndex-t.sourceIndex;if(r)return r;if(n)while(n=n.nextSibling)if(n===t)return-1;return e?1:-1}function de(t){return function(e){return"input"===e.nodeName.toLowerCase()&&e.type===t}}function he(n){return function(e){var t=e.nodeName.toLowerCase();return("input"===t||"button"===t)&&e.type===n}}function ge(t){return function(e){return"form"in e?e.parentNode&&!1===e.disabled?"label"in e?"label"in e.parentNode?e.parentNode.disabled===t:e.disabled===t:e.isDisabled===t||e.isDisabled!==!t&&ae(e)===t:e.disabled===t:"label"in e&&e.disabled===t}}function ve(a){return le(function(o){return o=+o,le(function(e,t){var n,r=a([],e.length,o),i=r.length;while(i--)e[n=r[i]]&&(e[n]=!(t[n]=e[n]))})})}function ye(e){return e&&"undefined"!=typeof e.getElementsByTagName&&e}for(e in d=se.support={},i=se.isXML=function(e){var t=e&&e.namespaceURI,n=e&&(e.ownerDocument||e).documentElement;return!Y.test(t||n&&n.nodeName||"HTML")},T=se.setDocument=function(e){var t,n,r=e?e.ownerDocument||e:p;return r!=C&&9===r.nodeType&&r.documentElement&&(a=(C=r).documentElement,E=!i(C),p!=C&&(n=C.defaultView)&&n.top!==n&&(n.addEventListener?n.addEventListener("unload",oe,!1):n.attachEvent&&n.attachEvent("onunload",oe)),d.scope=ce(function(e){return a.appendChild(e).appendChild(C.createElement("div")),"undefined"!=typeof e.querySelectorAll&&!e.querySelectorAll(":scope fieldset div").length}),d.attributes=ce(function(e){return e.className="i",!e.getAttribute("className")}),d.getElementsByTagName=ce(function(e){return e.appendChild(C.createComment("")),!e.getElementsByTagName("*").length}),d.getElementsByClassName=K.test(C.getElementsByClassName),d.getById=ce(function(e){return a.appendChild(e).id=S,!C.getElementsByName||!C.getElementsByName(S).length}),d.getById?(b.filter.ID=function(e){var t=e.replace(te,ne);return function(e){return e.getAttribute("id")===t}},b.find.ID=function(e,t){if("undefined"!=typeof t.getElementById&&E){var n=t.getElementById(e);return n?[n]:[]}}):(b.filter.ID=function(e){var n=e.replace(te,ne);return function(e){var t="undefined"!=typeof e.getAttributeNode&&e.getAttributeNode("id");return t&&t.value===n}},b.find.ID=function(e,t){if("undefined"!=typeof t.getElementById&&E){var n,r,i,o=t.getElementById(e);if(o){if((n=o.getAttributeNode("id"))&&n.value===e)return[o];i=t.getElementsByName(e),r=0;while(o=i[r++])if((n=o.getAttributeNode("id"))&&n.value===e)return[o]}return[]}}),b.find.TAG=d.getElementsByTagName?function(e,t){return"undefined"!=typeof t.getElementsByTagName?t.getElementsByTagName(e):d.qsa?t.querySelectorAll(e):void 0}:function(e,t){var n,r=[],i=0,o=t.getElementsByTagName(e);if("*"===e){while(n=o[i++])1===n.nodeType&&r.push(n);return r}return o},b.find.CLASS=d.getElementsByClassName&&function(e,t){if("undefined"!=typeof t.getElementsByClassName&&E)return t.getElementsByClassName(e)},s=[],v=[],(d.qsa=K.test(C.querySelectorAll))&&(ce(function(e){var t;a.appendChild(e).innerHTML="<a id='"+S+"'></a><select id='"+S+"-\r\\' msallowcapture=''><option selected=''></option></select>",e.querySelectorAll("[msallowcapture^='']").length&&v.push("[*^$]="+M+"*(?:''|\"\")"),e.querySelectorAll("[selected]").length||v.push("\\["+M+"*(?:value|"+R+")"),e.querySelectorAll("[id~="+S+"-]").length||v.push("~="),(t=C.createElement("input")).setAttribute("name",""),e.appendChild(t),e.querySelectorAll("[name='']").length||v.push("\\["+M+"*name"+M+"*="+M+"*(?:''|\"\")"),e.querySelectorAll(":checked").length||v.push(":checked"),e.querySelectorAll("a#"+S+"+*").length||v.push(".#.+[+~]"),e.querySelectorAll("\\\f"),v.push("[\\r\\n\\f]")}),ce(function(e){e.innerHTML="<a href='' disabled='disabled'></a><select disabled='disabled'><option/></select>";var t=C.createElement("input");t.setAttribute("type","hidden"),e.appendChild(t).setAttribute("name","D"),e.querySelectorAll("[name=d]").length&&v.push("name"+M+"*[*^$|!~]?="),2!==e.querySelectorAll(":enabled").length&&v.push(":enabled",":disabled"),a.appendChild(e).disabled=!0,2!==e.querySelectorAll(":disabled").length&&v.push(":enabled",":disabled"),e.querySelectorAll("*,:x"),v.push(",.*:")})),(d.matchesSelector=K.test(c=a.matches||a.webkitMatchesSelector||a.mozMatchesSelector||a.oMatchesSelector||a.msMatchesSelector))&&ce(function(e){d.disconnectedMatch=c.call(e,"*"),c.call(e,"[s!='']:x"),s.push("!=",F)}),v=v.length&&new RegExp(v.join("|")),s=s.length&&new RegExp(s.join("|")),t=K.test(a.compareDocumentPosition),y=t||K.test(a.contains)?function(e,t){var n=9===e.nodeType?e.documentElement:e,r=t&&t.parentNode;return e===r||!(!r||1!==r.nodeType||!(n.contains?n.contains(r):e.compareDocumentPosition&&16&e.compareDocumentPosition(r)))}:function(e,t){if(t)while(t=t.parentNode)if(t===e)return!0;return!1},j=t?function(e,t){if(e===t)return l=!0,0;var n=!e.compareDocumentPosition-!t.compareDocumentPosition;return n||(1&(n=(e.ownerDocument||e)==(t.ownerDocument||t)?e.compareDocumentPosition(t):1)||!d.sortDetached&&t.compareDocumentPosition(e)===n?e==C||e.ownerDocument==p&&y(p,e)?-1:t==C||t.ownerDocument==p&&y(p,t)?1:u?P(u,e)-P(u,t):0:4&n?-1:1)}:function(e,t){if(e===t)return l=!0,0;var n,r=0,i=e.parentNode,o=t.parentNode,a=[e],s=[t];if(!i||!o)return e==C?-1:t==C?1:i?-1:o?1:u?P(u,e)-P(u,t):0;if(i===o)return pe(e,t);n=e;while(n=n.parentNode)a.unshift(n);n=t;while(n=n.parentNode)s.unshift(n);while(a[r]===s[r])r++;return r?pe(a[r],s[r]):a[r]==p?-1:s[r]==p?1:0}),C},se.matches=function(e,t){return se(e,null,null,t)},se.matchesSelector=function(e,t){if(T(e),d.matchesSelector&&E&&!N[t+" "]&&(!s||!s.test(t))&&(!v||!v.test(t)))try{var n=c.call(e,t);if(n||d.disconnectedMatch||e.document&&11!==e.document.nodeType)return n}catch(e){N(t,!0)}return 0<se(t,C,null,[e]).length},se.contains=function(e,t){return(e.ownerDocument||e)!=C&&T(e),y(e,t)},se.attr=function(e,t){(e.ownerDocument||e)!=C&&T(e);var n=b.attrHandle[t.toLowerCase()],r=n&&D.call(b.attrHandle,t.toLowerCase())?n(e,t,!E):void 0;return void 0!==r?r:d.attributes||!E?e.getAttribute(t):(r=e.getAttributeNode(t))&&r.specified?r.value:null},se.escape=function(e){return(e+"").replace(re,ie)},se.error=function(e){throw new Error("Syntax error, unrecognized expression: "+e)},se.uniqueSort=function(e){var t,n=[],r=0,i=0;if(l=!d.detectDuplicates,u=!d.sortStable&&e.slice(0),e.sort(j),l){while(t=e[i++])t===e[i]&&(r=n.push(i));while(r--)e.splice(n[r],1)}return u=null,e},o=se.getText=function(e){var t,n="",r=0,i=e.nodeType;if(i){if(1===i||9===i||11===i){if("string"==typeof e.textContent)return e.textContent;for(e=e.firstChild;e;e=e.nextSibling)n+=o(e)}else if(3===i||4===i)return e.nodeValue}else while(t=e[r++])n+=o(t);return n},(b=se.selectors={cacheLength:50,createPseudo:le,match:G,attrHandle:{},find:{},relative:{">":{dir:"parentNode",first:!0}," ":{dir:"parentNode"},"+":{dir:"previousSibling",first:!0},"~":{dir:"previousSibling"}},preFilter:{ATTR:function(e){return e[1]=e[1].replace(te,ne),e[3]=(e[3]||e[4]||e[5]||"").replace(te,ne),"~="===e[2]&&(e[3]=" "+e[3]+" "),e.slice(0,4)},CHILD:function(e){return e[1]=e[1].toLowerCase(),"nth"===e[1].slice(0,3)?(e[3]||se.error(e[0]),e[4]=+(e[4]?e[5]+(e[6]||1):2*("even"===e[3]||"odd"===e[3])),e[5]=+(e[7]+e[8]||"odd"===e[3])):e[3]&&se.error(e[0]),e},PSEUDO:function(e){var t,n=!e[6]&&e[2];return G.CHILD.test(e[0])?null:(e[3]?e[2]=e[4]||e[5]||"":n&&X.test(n)&&(t=h(n,!0))&&(t=n.indexOf(")",n.length-t)-n.length)&&(e[0]=e[0].slice(0,t),e[2]=n.slice(0,t)),e.slice(0,3))}},filter:{TAG:function(e){var t=e.replace(te,ne).toLowerCase();return"*"===e?function(){return!0}:function(e){return e.nodeName&&e.nodeName.toLowerCase()===t}},CLASS:function(e){var t=m[e+" "];return t||(t=new RegExp("(^|"+M+")"+e+"("+M+"|$)"))&&m(e,function(e){return t.test("string"==typeof e.className&&e.className||"undefined"!=typeof e.getAttribute&&e.getAttribute("class")||"")})},ATTR:function(n,r,i){return function(e){var t=se.attr(e,n);return null==t?"!="===r:!r||(t+="","="===r?t===i:"!="===r?t!==i:"^="===r?i&&0===t.indexOf(i):"*="===r?i&&-1<t.indexOf(i):"$="===r?i&&t.slice(-i.length)===i:"~="===r?-1<(" "+t.replace(B," ")+" ").indexOf(i):"|="===r&&(t===i||t.slice(0,i.length+1)===i+"-"))}},CHILD:function(h,e,t,g,v){var y="nth"!==h.slice(0,3),m="last"!==h.slice(-4),x="of-type"===e;return 1===g&&0===v?function(e){return!!e.parentNode}:function(e,t,n){var r,i,o,a,s,u,l=y!==m?"nextSibling":"previousSibling",c=e.parentNode,f=x&&e.nodeName.toLowerCase(),p=!n&&!x,d=!1;if(c){if(y){while(l){a=e;while(a=a[l])if(x?a.nodeName.toLowerCase()===f:1===a.nodeType)return!1;u=l="only"===h&&!u&&"nextSibling"}return!0}if(u=[m?c.firstChild:c.lastChild],m&&p){d=(s=(r=(i=(o=(a=c)[S]||(a[S]={}))[a.uniqueID]||(o[a.uniqueID]={}))[h]||[])[0]===k&&r[1])&&r[2],a=s&&c.childNodes[s];while(a=++s&&a&&a[l]||(d=s=0)||u.pop())if(1===a.nodeType&&++d&&a===e){i[h]=[k,s,d];break}}else if(p&&(d=s=(r=(i=(o=(a=e)[S]||(a[S]={}))[a.uniqueID]||(o[a.uniqueID]={}))[h]||[])[0]===k&&r[1]),!1===d)while(a=++s&&a&&a[l]||(d=s=0)||u.pop())if((x?a.nodeName.toLowerCase()===f:1===a.nodeType)&&++d&&(p&&((i=(o=a[S]||(a[S]={}))[a.uniqueID]||(o[a.uniqueID]={}))[h]=[k,d]),a===e))break;return(d-=v)===g||d%g==0&&0<=d/g}}},PSEUDO:function(e,o){var t,a=b.pseudos[e]||b.setFilters[e.toLowerCase()]||se.error("unsupported pseudo: "+e);return a[S]?a(o):1<a.length?(t=[e,e,"",o],b.setFilters.hasOwnProperty(e.toLowerCase())?le(function(e,t){var n,r=a(e,o),i=r.length;while(i--)e[n=P(e,r[i])]=!(t[n]=r[i])}):function(e){return a(e,0,t)}):a}},pseudos:{not:le(function(e){var r=[],i=[],s=f(e.replace($,"$1"));return s[S]?le(function(e,t,n,r){var i,o=s(e,null,r,[]),a=e.length;while(a--)(i=o[a])&&(e[a]=!(t[a]=i))}):function(e,t,n){return r[0]=e,s(r,null,n,i),r[0]=null,!i.pop()}}),has:le(function(t){return function(e){return 0<se(t,e).length}}),contains:le(function(t){return t=t.replace(te,ne),function(e){return-1<(e.textContent||o(e)).indexOf(t)}}),lang:le(function(n){return V.test(n||"")||se.error("unsupported lang: "+n),n=n.replace(te,ne).toLowerCase(),function(e){var t;do{if(t=E?e.lang:e.getAttribute("xml:lang")||e.getAttribute("lang"))return(t=t.toLowerCase())===n||0===t.indexOf(n+"-")}while((e=e.parentNode)&&1===e.nodeType);return!1}}),target:function(e){var t=n.location&&n.location.hash;return t&&t.slice(1)===e.id},root:function(e){return e===a},focus:function(e){return e===C.activeElement&&(!C.hasFocus||C.hasFocus())&&!!(e.type||e.href||~e.tabIndex)},enabled:ge(!1),disabled:ge(!0),checked:function(e){var t=e.nodeName.toLowerCase();return"input"===t&&!!e.checked||"option"===t&&!!e.selected},selected:function(e){return e.parentNode&&e.parentNode.selectedIndex,!0===e.selected},empty:function(e){for(e=e.firstChild;e;e=e.nextSibling)if(e.nodeType<6)return!1;return!0},parent:function(e){return!b.pseudos.empty(e)},header:function(e){return J.test(e.nodeName)},input:function(e){return Q.test(e.nodeName)},button:function(e){var t=e.nodeName.toLowerCase();return"input"===t&&"button"===e.type||"button"===t},text:function(e){var t;return"input"===e.nodeName.toLowerCase()&&"text"===e.type&&(null==(t=e.getAttribute("type"))||"text"===t.toLowerCase())},first:ve(function(){return[0]}),last:ve(function(e,t){return[t-1]}),eq:ve(function(e,t,n){return[n<0?n+t:n]}),even:ve(function(e,t){for(var n=0;n<t;n+=2)e.push(n);return e}),odd:ve(function(e,t){for(var n=1;n<t;n+=2)e.push(n);return e}),lt:ve(function(e,t,n){for(var r=n<0?n+t:t<n?t:n;0<=--r;)e.push(r);return e}),gt:ve(function(e,t,n){for(var r=n<0?n+t:n;++r<t;)e.push(r);return e})}}).pseudos.nth=b.pseudos.eq,{radio:!0,checkbox:!0,file:!0,password:!0,image:!0})b.pseudos[e]=de(e);for(e in{submit:!0,reset:!0})b.pseudos[e]=he(e);function me(){}function xe(e){for(var t=0,n=e.length,r="";t<n;t++)r+=e[t].value;return r}function be(s,e,t){var u=e.dir,l=e.next,c=l||u,f=t&&"parentNode"===c,p=r++;return e.first?function(e,t,n){while(e=e[u])if(1===e.nodeType||f)return s(e,t,n);return!1}:function(e,t,n){var r,i,o,a=[k,p];if(n){while(e=e[u])if((1===e.nodeType||f)&&s(e,t,n))return!0}else while(e=e[u])if(1===e.nodeType||f)if(i=(o=e[S]||(e[S]={}))[e.uniqueID]||(o[e.uniqueID]={}),l&&l===e.nodeName.toLowerCase())e=e[u]||e;else{if((r=i[c])&&r[0]===k&&r[1]===p)return a[2]=r[2];if((i[c]=a)[2]=s(e,t,n))return!0}return!1}}function we(i){return 1<i.length?function(e,t,n){var r=i.length;while(r--)if(!i[r](e,t,n))return!1;return!0}:i[0]}function Te(e,t,n,r,i){for(var o,a=[],s=0,u=e.length,l=null!=t;s<u;s++)(o=e[s])&&(n&&!n(o,r,i)||(a.push(o),l&&t.push(s)));return a}function Ce(d,h,g,v,y,e){return v&&!v[S]&&(v=Ce(v)),y&&!y[S]&&(y=Ce(y,e)),le(function(e,t,n,r){var i,o,a,s=[],u=[],l=t.length,c=e||function(e,t,n){for(var r=0,i=t.length;r<i;r++)se(e,t[r],n);return n}(h||"*",n.nodeType?[n]:n,[]),f=!d||!e&&h?c:Te(c,s,d,n,r),p=g?y||(e?d:l||v)?[]:t:f;if(g&&g(f,p,n,r),v){i=Te(p,u),v(i,[],n,r),o=i.length;while(o--)(a=i[o])&&(p[u[o]]=!(f[u[o]]=a))}if(e){if(y||d){if(y){i=[],o=p.length;while(o--)(a=p[o])&&i.push(f[o]=a);y(null,p=[],i,r)}o=p.length;while(o--)(a=p[o])&&-1<(i=y?P(e,a):s[o])&&(e[i]=!(t[i]=a))}}else p=Te(p===t?p.splice(l,p.length):p),y?y(null,t,p,r):H.apply(t,p)})}function Ee(e){for(var i,t,n,r=e.length,o=b.relative[e[0].type],a=o||b.relative[" "],s=o?1:0,u=be(function(e){return e===i},a,!0),l=be(function(e){return-1<P(i,e)},a,!0),c=[function(e,t,n){var r=!o&&(n||t!==w)||((i=t).nodeType?u(e,t,n):l(e,t,n));return i=null,r}];s<r;s++)if(t=b.relative[e[s].type])c=[be(we(c),t)];else{if((t=b.filter[e[s].type].apply(null,e[s].matches))[S]){for(n=++s;n<r;n++)if(b.relative[e[n].type])break;return Ce(1<s&&we(c),1<s&&xe(e.slice(0,s-1).concat({value:" "===e[s-2].type?"*":""})).replace($,"$1"),t,s<n&&Ee(e.slice(s,n)),n<r&&Ee(e=e.slice(n)),n<r&&xe(e))}c.push(t)}return we(c)}return me.prototype=b.filters=b.pseudos,b.setFilters=new me,h=se.tokenize=function(e,t){var n,r,i,o,a,s,u,l=x[e+" "];if(l)return t?0:l.slice(0);a=e,s=[],u=b.preFilter;while(a){for(o in n&&!(r=_.exec(a))||(r&&(a=a.slice(r[0].length)||a),s.push(i=[])),n=!1,(r=z.exec(a))&&(n=r.shift(),i.push({value:n,type:r[0].replace($," ")}),a=a.slice(n.length)),b.filter)!(r=G[o].exec(a))||u[o]&&!(r=u[o](r))||(n=r.shift(),i.push({value:n,type:o,matches:r}),a=a.slice(n.length));if(!n)break}return t?a.length:a?se.error(e):x(e,s).slice(0)},f=se.compile=function(e,t){var n,v,y,m,x,r,i=[],o=[],a=A[e+" "];if(!a){t||(t=h(e)),n=t.length;while(n--)(a=Ee(t[n]))[S]?i.push(a):o.push(a);(a=A(e,(v=o,m=0<(y=i).length,x=0<v.length,r=function(e,t,n,r,i){var o,a,s,u=0,l="0",c=e&&[],f=[],p=w,d=e||x&&b.find.TAG("*",i),h=k+=null==p?1:Math.random()||.1,g=d.length;for(i&&(w=t==C||t||i);l!==g&&null!=(o=d[l]);l++){if(x&&o){a=0,t||o.ownerDocument==C||(T(o),n=!E);while(s=v[a++])if(s(o,t||C,n)){r.push(o);break}i&&(k=h)}m&&((o=!s&&o)&&u--,e&&c.push(o))}if(u+=l,m&&l!==u){a=0;while(s=y[a++])s(c,f,t,n);if(e){if(0<u)while(l--)c[l]||f[l]||(f[l]=q.call(r));f=Te(f)}H.apply(r,f),i&&!e&&0<f.length&&1<u+y.length&&se.uniqueSort(r)}return i&&(k=h,w=p),c},m?le(r):r))).selector=e}return a},g=se.select=function(e,t,n,r){var i,o,a,s,u,l="function"==typeof e&&e,c=!r&&h(e=l.selector||e);if(n=n||[],1===c.length){if(2<(o=c[0]=c[0].slice(0)).length&&"ID"===(a=o[0]).type&&9===t.nodeType&&E&&b.relative[o[1].type]){if(!(t=(b.find.ID(a.matches[0].replace(te,ne),t)||[])[0]))return n;l&&(t=t.parentNode),e=e.slice(o.shift().value.length)}i=G.needsContext.test(e)?0:o.length;while(i--){if(a=o[i],b.relative[s=a.type])break;if((u=b.find[s])&&(r=u(a.matches[0].replace(te,ne),ee.test(o[0].type)&&ye(t.parentNode)||t))){if(o.splice(i,1),!(e=r.length&&xe(o)))return H.apply(n,r),n;break}}}return(l||f(e,c))(r,t,!E,n,!t||ee.test(e)&&ye(t.parentNode)||t),n},d.sortStable=S.split("").sort(j).join("")===S,d.detectDuplicates=!!l,T(),d.sortDetached=ce(function(e){return 1&e.compareDocumentPosition(C.createElement("fieldset"))}),ce(function(e){return e.innerHTML="<a href='#'></a>","#"===e.firstChild.getAttribute("href")})||fe("type|href|height|width",function(e,t,n){if(!n)return e.getAttribute(t,"type"===t.toLowerCase()?1:2)}),d.attributes&&ce(function(e){return e.innerHTML="<input/>",e.firstChild.setAttribute("value",""),""===e.firstChild.getAttribute("value")})||fe("value",function(e,t,n){if(!n&&"input"===e.nodeName.toLowerCase())return e.defaultValue}),ce(function(e){return null==e.getAttribute("disabled")})||fe(R,function(e,t,n){var r;if(!n)return!0===e[t]?t.toLowerCase():(r=e.getAttributeNode(t))&&r.specified?r.value:null}),se}(C);S.find=d,S.expr=d.selectors,S.expr[":"]=S.expr.pseudos,S.uniqueSort=S.unique=d.uniqueSort,S.text=d.getText,S.isXMLDoc=d.isXML,S.contains=d.contains,S.escapeSelector=d.escape;var h=function(e,t,n){var r=[],i=void 0!==n;while((e=e[t])&&9!==e.nodeType)if(1===e.nodeType){if(i&&S(e).is(n))break;r.push(e)}return r},T=function(e,t){for(var n=[];e;e=e.nextSibling)1===e.nodeType&&e!==t&&n.push(e);return n},k=S.expr.match.needsContext;function A(e,t){return e.nodeName&&e.nodeName.toLowerCase()===t.toLowerCase()}var N=/^<([a-z][^\/\0>:\x20\t\r\n\f]*)[\x20\t\r\n\f]*\/?>(?:<\/\1>|)$/i;function j(e,n,r){return m(n)?S.grep(e,function(e,t){return!!n.call(e,t,e)!==r}):n.nodeType?S.grep(e,function(e){return e===n!==r}):"string"!=typeof n?S.grep(e,function(e){return-1<i.call(n,e)!==r}):S.filter(n,e,r)}S.filter=function(e,t,n){var r=t[0];return n&&(e=":not("+e+")"),1===t.length&&1===r.nodeType?S.find.matchesSelector(r,e)?[r]:[]:S.find.matches(e,S.grep(t,function(e){return 1===e.nodeType}))},S.fn.extend({find:function(e){var t,n,r=this.length,i=this;if("string"!=typeof e)return this.pushStack(S(e).filter(function(){for(t=0;t<r;t++)if(S.contains(i[t],this))return!0}));for(n=this.pushStack([]),t=0;t<r;t++)S.find(e,i[t],n);return 1<r?S.uniqueSort(n):n},filter:function(e){return this.pushStack(j(this,e||[],!1))},not:function(e){return this.pushStack(j(this,e||[],!0))},is:function(e){return!!j(this,"string"==typeof e&&k.test(e)?S(e):e||[],!1).length}});var D,q=/^(?:\s*(<[\w\W]+>)[^>]*|#([\w-]+))$/;(S.fn.init=function(e,t,n){var r,i;if(!e)return this;if(n=n||D,"string"==typeof e){if(!(r="<"===e[0]&&">"===e[e.length-1]&&3<=e.length?[null,e,null]:q.exec(e))||!r[1]&&t)return!t||t.jquery?(t||n).find(e):this.constructor(t).find(e);if(r[1]){if(t=t instanceof S?t[0]:t,S.merge(this,S.parseHTML(r[1],t&&t.nodeType?t.ownerDocument||t:E,!0)),N.test(r[1])&&S.isPlainObject(t))for(r in t)m(this[r])?this[r](t[r]):this.attr(r,t[r]);return this}return(i=E.getElementById(r[2]))&&(this[0]=i,this.length=1),this}return e.nodeType?(this[0]=e,this.length=1,this):m(e)?void 0!==n.ready?n.ready(e):e(S):S.makeArray(e,this)}).prototype=S.fn,D=S(E);var L=/^(?:parents|prev(?:Until|All))/,H={children:!0,contents:!0,next:!0,prev:!0};function O(e,t){while((e=e[t])&&1!==e.nodeType);return e}S.fn.extend({has:function(e){var t=S(e,this),n=t.length;return this.filter(function(){for(var e=0;e<n;e++)if(S.contains(this,t[e]))return!0})},closest:function(e,t){var n,r=0,i=this.length,o=[],a="string"!=typeof e&&S(e);if(!k.test(e))for(;r<i;r++)for(n=this[r];n&&n!==t;n=n.parentNode)if(n.nodeType<11&&(a?-1<a.index(n):1===n.nodeType&&S.find.matchesSelector(n,e))){o.push(n);break}return this.pushStack(1<o.length?S.uniqueSort(o):o)},index:function(e){return e?"string"==typeof e?i.call(S(e),this[0]):i.call(this,e.jquery?e[0]:e):this[0]&&this[0].parentNode?this.first().prevAll().length:-1},add:function(e,t){return this.pushStack(S.uniqueSort(S.merge(this.get(),S(e,t))))},addBack:function(e){return this.add(null==e?this.prevObject:this.prevObject.filter(e))}}),S.each({parent:function(e){var t=e.parentNode;return t&&11!==t.nodeType?t:null},parents:function(e){return h(e,"parentNode")},parentsUntil:function(e,t,n){return h(e,"parentNode",n)},next:function(e){return O(e,"nextSibling")},prev:function(e){return O(e,"previousSibling")},nextAll:function(e){return h(e,"nextSibling")},prevAll:function(e){return h(e,"previousSibling")},nextUntil:function(e,t,n){return h(e,"nextSibling",n)},prevUntil:function(e,t,n){return h(e,"previousSibling",n)},siblings:function(e){return T((e.parentNode||{}).firstChild,e)},children:function(e){return T(e.firstChild)},contents:function(e){return null!=e.contentDocument&&r(e.contentDocument)?e.contentDocument:(A(e,"template")&&(e=e.content||e),S.merge([],e.childNodes))}},function(r,i){S.fn[r]=function(e,t){var n=S.map(this,i,e);return"Until"!==r.slice(-5)&&(t=e),t&&"string"==typeof t&&(n=S.filter(t,n)),1<this.length&&(H[r]||S.uniqueSort(n),L.test(r)&&n.reverse()),this.pushStack(n)}});var P=/[^\x20\t\r\n\f]+/g;function R(e){return e}function M(e){throw e}function I(e,t,n,r){var i;try{e&&m(i=e.promise)?i.call(e).done(t).fail(n):e&&m(i=e.then)?i.call(e,t,n):t.apply(void 0,[e].slice(r))}catch(e){n.apply(void 0,[e])}}S.Callbacks=function(r){var e,n;r="string"==typeof r?(e=r,n={},S.each(e.match(P)||[],function(e,t){n[t]=!0}),n):S.extend({},r);var i,t,o,a,s=[],u=[],l=-1,c=function(){for(a=a||r.once,o=i=!0;u.length;l=-1){t=u.shift();while(++l<s.length)!1===s[l].apply(t[0],t[1])&&r.stopOnFalse&&(l=s.length,t=!1)}r.memory||(t=!1),i=!1,a&&(s=t?[]:"")},f={add:function(){return s&&(t&&!i&&(l=s.length-1,u.push(t)),function n(e){S.each(e,function(e,t){m(t)?r.unique&&f.has(t)||s.push(t):t&&t.length&&"string"!==w(t)&&n(t)})}(arguments),t&&!i&&c()),this},remove:function(){return S.each(arguments,function(e,t){var n;while(-1<(n=S.inArray(t,s,n)))s.splice(n,1),n<=l&&l--}),this},has:function(e){return e?-1<S.inArray(e,s):0<s.length},empty:function(){return s&&(s=[]),this},disable:function(){return a=u=[],s=t="",this},disabled:function(){return!s},lock:function(){return a=u=[],t||i||(s=t=""),this},locked:function(){return!!a},fireWith:function(e,t){return a||(t=[e,(t=t||[]).slice?t.slice():t],u.push(t),i||c()),this},fire:function(){return f.fireWith(this,arguments),this},fired:function(){return!!o}};return f},S.extend({Deferred:function(e){var o=[["notify","progress",S.Callbacks("memory"),S.Callbacks("memory"),2],["resolve","done",S.Callbacks("once memory"),S.Callbacks("once memory"),0,"resolved"],["reject","fail",S.Callbacks("once memory"),S.Callbacks("once memory"),1,"rejected"]],i="pending",a={state:function(){return i},always:function(){return s.done(arguments).fail(arguments),this},"catch":function(e){return a.then(null,e)},pipe:function(){var i=arguments;return S.Deferred(function(r){S.each(o,function(e,t){var n=m(i[t[4]])&&i[t[4]];s[t[1]](function(){var e=n&&n.apply(this,arguments);e&&m(e.promise)?e.promise().progress(r.notify).done(r.resolve).fail(r.reject):r[t[0]+"With"](this,n?[e]:arguments)})}),i=null}).promise()},then:function(t,n,r){var u=0;function l(i,o,a,s){return function(){var n=this,r=arguments,e=function(){var e,t;if(!(i<u)){if((e=a.apply(n,r))===o.promise())throw new TypeError("Thenable self-resolution");t=e&&("object"==typeof e||"function"==typeof e)&&e.then,m(t)?s?t.call(e,l(u,o,R,s),l(u,o,M,s)):(u++,t.call(e,l(u,o,R,s),l(u,o,M,s),l(u,o,R,o.notifyWith))):(a!==R&&(n=void 0,r=[e]),(s||o.resolveWith)(n,r))}},t=s?e:function(){try{e()}catch(e){S.Deferred.exceptionHook&&S.Deferred.exceptionHook(e,t.stackTrace),u<=i+1&&(a!==M&&(n=void 0,r=[e]),o.rejectWith(n,r))}};i?t():(S.Deferred.getStackHook&&(t.stackTrace=S.Deferred.getStackHook()),C.setTimeout(t))}}return S.Deferred(function(e){o[0][3].add(l(0,e,m(r)?r:R,e.notifyWith)),o[1][3].add(l(0,e,m(t)?t:R)),o[2][3].add(l(0,e,m(n)?n:M))}).promise()},promise:function(e){return null!=e?S.extend(e,a):a}},s={};return S.each(o,function(e,t){var n=t[2],r=t[5];a[t[1]]=n.add,r&&n.add(function(){i=r},o[3-e][2].disable,o[3-e][3].disable,o[0][2].lock,o[0][3].lock),n.add(t[3].fire),s[t[0]]=function(){return s[t[0]+"With"](this===s?void 0:this,arguments),this},s[t[0]+"With"]=n.fireWith}),a.promise(s),e&&e.call(s,s),s},when:function(e){var n=arguments.length,t=n,r=Array(t),i=s.call(arguments),o=S.Deferred(),a=function(t){return function(e){r[t]=this,i[t]=1<arguments.length?s.call(arguments):e,--n||o.resolveWith(r,i)}};if(n<=1&&(I(e,o.done(a(t)).resolve,o.reject,!n),"pending"===o.state()||m(i[t]&&i[t].then)))return o.then();while(t--)I(i[t],a(t),o.reject);return o.promise()}});var W=/^(Eval|Internal|Range|Reference|Syntax|Type|URI)Error$/;S.Deferred.exceptionHook=function(e,t){C.console&&C.console.warn&&e&&W.test(e.name)&&C.console.warn("jQuery.Deferred exception: "+e.message,e.stack,t)},S.readyException=function(e){C.setTimeout(function(){throw e})};var F=S.Deferred();function B(){E.removeEventListener("DOMContentLoaded",B),C.removeEventListener("load",B),S.ready()}S.fn.ready=function(e){return F.then(e)["catch"](function(e){S.readyException(e)}),this},S.extend({isReady:!1,readyWait:1,ready:function(e){(!0===e?--S.readyWait:S.isReady)||(S.isReady=!0)!==e&&0<--S.readyWait||F.resolveWith(E,[S])}}),S.ready.then=F.then,"complete"===E.readyState||"loading"!==E.readyState&&!E.documentElement.doScroll?C.setTimeout(S.ready):(E.addEventListener("DOMContentLoaded",B),C.addEventListener("load",B));var $=function(e,t,n,r,i,o,a){var s=0,u=e.length,l=null==n;if("object"===w(n))for(s in i=!0,n)$(e,t,s,n[s],!0,o,a);else if(void 0!==r&&(i=!0,m(r)||(a=!0),l&&(a?(t.call(e,r),t=null):(l=t,t=function(e,t,n){return l.call(S(e),n)})),t))for(;s<u;s++)t(e[s],n,a?r:r.call(e[s],s,t(e[s],n)));return i?e:l?t.call(e):u?t(e[0],n):o},_=/^-ms-/,z=/-([a-z])/g;function U(e,t){return t.toUpperCase()}function X(e){return e.replace(_,"ms-").replace(z,U)}var V=function(e){return 1===e.nodeType||9===e.nodeType||!+e.nodeType};function G(){this.expando=S.expando+G.uid++}G.uid=1,G.prototype={cache:function(e){var t=e[this.expando];return t||(t={},V(e)&&(e.nodeType?e[this.expando]=t:Object.defineProperty(e,this.expando,{value:t,configurable:!0}))),t},set:function(e,t,n){var r,i=this.cache(e);if("string"==typeof t)i[X(t)]=n;else for(r in t)i[X(r)]=t[r];return i},get:function(e,t){return void 0===t?this.cache(e):e[this.expando]&&e[this.expando][X(t)]},access:function(e,t,n){return void 0===t||t&&"string"==typeof t&&void 0===n?this.get(e,t):(this.set(e,t,n),void 0!==n?n:t)},remove:function(e,t){var n,r=e[this.expando];if(void 0!==r){if(void 0!==t){n=(t=Array.isArray(t)?t.map(X):(t=X(t))in r?[t]:t.match(P)||[]).length;while(n--)delete r[t[n]]}(void 0===t||S.isEmptyObject(r))&&(e.nodeType?e[this.expando]=void 0:delete e[this.expando])}},hasData:function(e){var t=e[this.expando];return void 0!==t&&!S.isEmptyObject(t)}};var Y=new G,Q=new G,J=/^(?:\{[\w\W]*\}|\[[\w\W]*\])$/,K=/[A-Z]/g;function Z(e,t,n){var r,i;if(void 0===n&&1===e.nodeType)if(r="data-"+t.replace(K,"-$&").toLowerCase(),"string"==typeof(n=e.getAttribute(r))){try{n="true"===(i=n)||"false"!==i&&("null"===i?null:i===+i+""?+i:J.test(i)?JSON.parse(i):i)}catch(e){}Q.set(e,t,n)}else n=void 0;return n}S.extend({hasData:function(e){return Q.hasData(e)||Y.hasData(e)},data:function(e,t,n){return Q.access(e,t,n)},removeData:function(e,t){Q.remove(e,t)},_data:function(e,t,n){return Y.access(e,t,n)},_removeData:function(e,t){Y.remove(e,t)}}),S.fn.extend({data:function(n,e){var t,r,i,o=this[0],a=o&&o.attributes;if(void 0===n){if(this.length&&(i=Q.get(o),1===o.nodeType&&!Y.get(o,"hasDataAttrs"))){t=a.length;while(t--)a[t]&&0===(r=a[t].name).indexOf("data-")&&(r=X(r.slice(5)),Z(o,r,i[r]));Y.set(o,"hasDataAttrs",!0)}return i}return"object"==typeof n?this.each(function(){Q.set(this,n)}):$(this,function(e){var t;if(o&&void 0===e)return void 0!==(t=Q.get(o,n))?t:void 0!==(t=Z(o,n))?t:void 0;this.each(function(){Q.set(this,n,e)})},null,e,1<arguments.length,null,!0)},removeData:function(e){return this.each(function(){Q.remove(this,e)})}}),S.extend({queue:function(e,t,n){var r;if(e)return t=(t||"fx")+"queue",r=Y.get(e,t),n&&(!r||Array.isArray(n)?r=Y.access(e,t,S.makeArray(n)):r.push(n)),r||[]},dequeue:function(e,t){t=t||"fx";var n=S.queue(e,t),r=n.length,i=n.shift(),o=S._queueHooks(e,t);"inprogress"===i&&(i=n.shift(),r--),i&&("fx"===t&&n.unshift("inprogress"),delete o.stop,i.call(e,function(){S.dequeue(e,t)},o)),!r&&o&&o.empty.fire()},_queueHooks:function(e,t){var n=t+"queueHooks";return Y.get(e,n)||Y.access(e,n,{empty:S.Callbacks("once memory").add(function(){Y.remove(e,[t+"queue",n])})})}}),S.fn.extend({queue:function(t,n){var e=2;return"string"!=typeof t&&(n=t,t="fx",e--),arguments.length<e?S.queue(this[0],t):void 0===n?this:this.each(function(){var e=S.queue(this,t,n);S._queueHooks(this,t),"fx"===t&&"inprogress"!==e[0]&&S.dequeue(this,t)})},dequeue:function(e){return this.each(function(){S.dequeue(this,e)})},clearQueue:function(e){return this.queue(e||"fx",[])},promise:function(e,t){var n,r=1,i=S.Deferred(),o=this,a=this.length,s=function(){--r||i.resolveWith(o,[o])};"string"!=typeof e&&(t=e,e=void 0),e=e||"fx";while(a--)(n=Y.get(o[a],e+"queueHooks"))&&n.empty&&(r++,n.empty.add(s));return s(),i.promise(t)}});var ee=/[+-]?(?:\d*\.|)\d+(?:[eE][+-]?\d+|)/.source,te=new RegExp("^(?:([+-])=|)("+ee+")([a-z%]*)$","i"),ne=["Top","Right","Bottom","Left"],re=E.documentElement,ie=function(e){return S.contains(e.ownerDocument,e)},oe={composed:!0};re.getRootNode&&(ie=function(e){return S.contains(e.ownerDocument,e)||e.getRootNode(oe)===e.ownerDocument});var ae=function(e,t){return"none"===(e=t||e).style.display||""===e.style.display&&ie(e)&&"none"===S.css(e,"display")};function se(e,t,n,r){var i,o,a=20,s=r?function(){return r.cur()}:function(){return S.css(e,t,"")},u=s(),l=n&&n[3]||(S.cssNumber[t]?"":"px"),c=e.nodeType&&(S.cssNumber[t]||"px"!==l&&+u)&&te.exec(S.css(e,t));if(c&&c[3]!==l){u/=2,l=l||c[3],c=+u||1;while(a--)S.style(e,t,c+l),(1-o)*(1-(o=s()/u||.5))<=0&&(a=0),c/=o;c*=2,S.style(e,t,c+l),n=n||[]}return n&&(c=+c||+u||0,i=n[1]?c+(n[1]+1)*n[2]:+n[2],r&&(r.unit=l,r.start=c,r.end=i)),i}var ue={};function le(e,t){for(var n,r,i,o,a,s,u,l=[],c=0,f=e.length;c<f;c++)(r=e[c]).style&&(n=r.style.display,t?("none"===n&&(l[c]=Y.get(r,"display")||null,l[c]||(r.style.display="")),""===r.style.display&&ae(r)&&(l[c]=(u=a=o=void 0,a=(i=r).ownerDocument,s=i.nodeName,(u=ue[s])||(o=a.body.appendChild(a.createElement(s)),u=S.css(o,"display"),o.parentNode.removeChild(o),"none"===u&&(u="block"),ue[s]=u)))):"none"!==n&&(l[c]="none",Y.set(r,"display",n)));for(c=0;c<f;c++)null!=l[c]&&(e[c].style.display=l[c]);return e}S.fn.extend({show:function(){return le(this,!0)},hide:function(){return le(this)},toggle:function(e){return"boolean"==typeof e?e?this.show():this.hide():this.each(function(){ae(this)?S(this).show():S(this).hide()})}});var ce,fe,pe=/^(?:checkbox|radio)$/i,de=/<([a-z][^\/\0>\x20\t\r\n\f]*)/i,he=/^$|^module$|\/(?:java|ecma)script/i;ce=E.createDocumentFragment().appendChild(E.createElement("div")),(fe=E.createElement("input")).setAttribute("type","radio"),fe.setAttribute("checked","checked"),fe.setAttribute("name","t"),ce.appendChild(fe),y.checkClone=ce.cloneNode(!0).cloneNode(!0).lastChild.checked,ce.innerHTML="<textarea>x</textarea>",y.noCloneChecked=!!ce.cloneNode(!0).lastChild.defaultValue,ce.innerHTML="<option></option>",y.option=!!ce.lastChild;var ge={thead:[1,"<table>","</table>"],col:[2,"<table><colgroup>","</colgroup></table>"],tr:[2,"<table><tbody>","</tbody></table>"],td:[3,"<table><tbody><tr>","</tr></tbody></table>"],_default:[0,"",""]};function ve(e,t){var n;return n="undefined"!=typeof e.getElementsByTagName?e.getElementsByTagName(t||"*"):"undefined"!=typeof e.querySelectorAll?e.querySelectorAll(t||"*"):[],void 0===t||t&&A(e,t)?S.merge([e],n):n}function ye(e,t){for(var n=0,r=e.length;n<r;n++)Y.set(e[n],"globalEval",!t||Y.get(t[n],"globalEval"))}ge.tbody=ge.tfoot=ge.colgroup=ge.caption=ge.thead,ge.th=ge.td,y.option||(ge.optgroup=ge.option=[1,"<select multiple='multiple'>","</select>"]);var me=/<|&#?\w+;/;function xe(e,t,n,r,i){for(var o,a,s,u,l,c,f=t.createDocumentFragment(),p=[],d=0,h=e.length;d<h;d++)if((o=e[d])||0===o)if("object"===w(o))S.merge(p,o.nodeType?[o]:o);else if(me.test(o)){a=a||f.appendChild(t.createElement("div")),s=(de.exec(o)||["",""])[1].toLowerCase(),u=ge[s]||ge._default,a.innerHTML=u[1]+S.htmlPrefilter(o)+u[2],c=u[0];while(c--)a=a.lastChild;S.merge(p,a.childNodes),(a=f.firstChild).textContent=""}else p.push(t.createTextNode(o));f.textContent="",d=0;while(o=p[d++])if(r&&-1<S.inArray(o,r))i&&i.push(o);else if(l=ie(o),a=ve(f.appendChild(o),"script"),l&&ye(a),n){c=0;while(o=a[c++])he.test(o.type||"")&&n.push(o)}return f}var be=/^([^.]*)(?:\.(.+)|)/;function we(){return!0}function Te(){return!1}function Ce(e,t){return e===function(){try{return E.activeElement}catch(e){}}()==("focus"===t)}function Ee(e,t,n,r,i,o){var a,s;if("object"==typeof t){for(s in"string"!=typeof n&&(r=r||n,n=void 0),t)Ee(e,s,n,r,t[s],o);return e}if(null==r&&null==i?(i=n,r=n=void 0):null==i&&("string"==typeof n?(i=r,r=void 0):(i=r,r=n,n=void 0)),!1===i)i=Te;else if(!i)return e;return 1===o&&(a=i,(i=function(e){return S().off(e),a.apply(this,arguments)}).guid=a.guid||(a.guid=S.guid++)),e.each(function(){S.event.add(this,t,i,r,n)})}function Se(e,i,o){o?(Y.set(e,i,!1),S.event.add(e,i,{namespace:!1,handler:function(e){var t,n,r=Y.get(this,i);if(1&e.isTrigger&&this[i]){if(r.length)(S.event.special[i]||{}).delegateType&&e.stopPropagation();else if(r=s.call(arguments),Y.set(this,i,r),t=o(this,i),this[i](),r!==(n=Y.get(this,i))||t?Y.set(this,i,!1):n={},r!==n)return e.stopImmediatePropagation(),e.preventDefault(),n&&n.value}else r.length&&(Y.set(this,i,{value:S.event.trigger(S.extend(r[0],S.Event.prototype),r.slice(1),this)}),e.stopImmediatePropagation())}})):void 0===Y.get(e,i)&&S.event.add(e,i,we)}S.event={global:{},add:function(t,e,n,r,i){var o,a,s,u,l,c,f,p,d,h,g,v=Y.get(t);if(V(t)){n.handler&&(n=(o=n).handler,i=o.selector),i&&S.find.matchesSelector(re,i),n.guid||(n.guid=S.guid++),(u=v.events)||(u=v.events=Object.create(null)),(a=v.handle)||(a=v.handle=function(e){return"undefined"!=typeof S&&S.event.triggered!==e.type?S.event.dispatch.apply(t,arguments):void 0}),l=(e=(e||"").match(P)||[""]).length;while(l--)d=g=(s=be.exec(e[l])||[])[1],h=(s[2]||"").split(".").sort(),d&&(f=S.event.special[d]||{},d=(i?f.delegateType:f.bindType)||d,f=S.event.special[d]||{},c=S.extend({type:d,origType:g,data:r,handler:n,guid:n.guid,selector:i,needsContext:i&&S.expr.match.needsContext.test(i),namespace:h.join(".")},o),(p=u[d])||((p=u[d]=[]).delegateCount=0,f.setup&&!1!==f.setup.call(t,r,h,a)||t.addEventListener&&t.addEventListener(d,a)),f.add&&(f.add.call(t,c),c.handler.guid||(c.handler.guid=n.guid)),i?p.splice(p.delegateCount++,0,c):p.push(c),S.event.global[d]=!0)}},remove:function(e,t,n,r,i){var o,a,s,u,l,c,f,p,d,h,g,v=Y.hasData(e)&&Y.get(e);if(v&&(u=v.events)){l=(t=(t||"").match(P)||[""]).length;while(l--)if(d=g=(s=be.exec(t[l])||[])[1],h=(s[2]||"").split(".").sort(),d){f=S.event.special[d]||{},p=u[d=(r?f.delegateType:f.bindType)||d]||[],s=s[2]&&new RegExp("(^|\\.)"+h.join("\\.(?:.*\\.|)")+"(\\.|$)"),a=o=p.length;while(o--)c=p[o],!i&&g!==c.origType||n&&n.guid!==c.guid||s&&!s.test(c.namespace)||r&&r!==c.selector&&("**"!==r||!c.selector)||(p.splice(o,1),c.selector&&p.delegateCount--,f.remove&&f.remove.call(e,c));a&&!p.length&&(f.teardown&&!1!==f.teardown.call(e,h,v.handle)||S.removeEvent(e,d,v.handle),delete u[d])}else for(d in u)S.event.remove(e,d+t[l],n,r,!0);S.isEmptyObject(u)&&Y.remove(e,"handle events")}},dispatch:function(e){var t,n,r,i,o,a,s=new Array(arguments.length),u=S.event.fix(e),l=(Y.get(this,"events")||Object.create(null))[u.type]||[],c=S.event.special[u.type]||{};for(s[0]=u,t=1;t<arguments.length;t++)s[t]=arguments[t];if(u.delegateTarget=this,!c.preDispatch||!1!==c.preDispatch.call(this,u)){a=S.event.handlers.call(this,u,l),t=0;while((i=a[t++])&&!u.isPropagationStopped()){u.currentTarget=i.elem,n=0;while((o=i.handlers[n++])&&!u.isImmediatePropagationStopped())u.rnamespace&&!1!==o.namespace&&!u.rnamespace.test(o.namespace)||(u.handleObj=o,u.data=o.data,void 0!==(r=((S.event.special[o.origType]||{}).handle||o.handler).apply(i.elem,s))&&!1===(u.result=r)&&(u.preventDefault(),u.stopPropagation()))}return c.postDispatch&&c.postDispatch.call(this,u),u.result}},handlers:function(e,t){var n,r,i,o,a,s=[],u=t.delegateCount,l=e.target;if(u&&l.nodeType&&!("click"===e.type&&1<=e.button))for(;l!==this;l=l.parentNode||this)if(1===l.nodeType&&("click"!==e.type||!0!==l.disabled)){for(o=[],a={},n=0;n<u;n++)void 0===a[i=(r=t[n]).selector+" "]&&(a[i]=r.needsContext?-1<S(i,this).index(l):S.find(i,this,null,[l]).length),a[i]&&o.push(r);o.length&&s.push({elem:l,handlers:o})}return l=this,u<t.length&&s.push({elem:l,handlers:t.slice(u)}),s},addProp:function(t,e){Object.defineProperty(S.Event.prototype,t,{enumerable:!0,configurable:!0,get:m(e)?function(){if(this.originalEvent)return e(this.originalEvent)}:function(){if(this.originalEvent)return this.originalEvent[t]},set:function(e){Object.defineProperty(this,t,{enumerable:!0,configurable:!0,writable:!0,value:e})}})},fix:function(e){return e[S.expando]?e:new S.Event(e)},special:{load:{noBubble:!0},click:{setup:function(e){var t=this||e;return pe.test(t.type)&&t.click&&A(t,"input")&&Se(t,"click",we),!1},trigger:function(e){var t=this||e;return pe.test(t.type)&&t.click&&A(t,"input")&&Se(t,"click"),!0},_default:function(e){var t=e.target;return pe.test(t.type)&&t.click&&A(t,"input")&&Y.get(t,"click")||A(t,"a")}},beforeunload:{postDispatch:function(e){void 0!==e.result&&e.originalEvent&&(e.originalEvent.returnValue=e.result)}}}},S.removeEvent=function(e,t,n){e.removeEventListener&&e.removeEventListener(t,n)},S.Event=function(e,t){if(!(this instanceof S.Event))return new S.Event(e,t);e&&e.type?(this.originalEvent=e,this.type=e.type,this.isDefaultPrevented=e.defaultPrevented||void 0===e.defaultPrevented&&!1===e.returnValue?we:Te,this.target=e.target&&3===e.target.nodeType?e.target.parentNode:e.target,this.currentTarget=e.currentTarget,this.relatedTarget=e.relatedTarget):this.type=e,t&&S.extend(this,t),this.timeStamp=e&&e.timeStamp||Date.now(),this[S.expando]=!0},S.Event.prototype={constructor:S.Event,isDefaultPrevented:Te,isPropagationStopped:Te,isImmediatePropagationStopped:Te,isSimulated:!1,preventDefault:function(){var e=this.originalEvent;this.isDefaultPrevented=we,e&&!this.isSimulated&&e.preventDefault()},stopPropagation:function(){var e=this.originalEvent;this.isPropagationStopped=we,e&&!this.isSimulated&&e.stopPropagation()},stopImmediatePropagation:function(){var e=this.originalEvent;this.isImmediatePropagationStopped=we,e&&!this.isSimulated&&e.stopImmediatePropagation(),this.stopPropagation()}},S.each({altKey:!0,bubbles:!0,cancelable:!0,changedTouches:!0,ctrlKey:!0,detail:!0,eventPhase:!0,metaKey:!0,pageX:!0,pageY:!0,shiftKey:!0,view:!0,"char":!0,code:!0,charCode:!0,key:!0,keyCode:!0,button:!0,buttons:!0,clientX:!0,clientY:!0,offsetX:!0,offsetY:!0,pointerId:!0,pointerType:!0,screenX:!0,screenY:!0,targetTouches:!0,toElement:!0,touches:!0,which:!0},S.event.addProp),S.each({focus:"focusin",blur:"focusout"},function(e,t){S.event.special[e]={setup:function(){return Se(this,e,Ce),!1},trigger:function(){return Se(this,e),!0},_default:function(){return!0},delegateType:t}}),S.each({mouseenter:"mouseover",mouseleave:"mouseout",pointerenter:"pointerover",pointerleave:"pointerout"},function(e,i){S.event.special[e]={delegateType:i,bindType:i,handle:function(e){var t,n=e.relatedTarget,r=e.handleObj;return n&&(n===this||S.contains(this,n))||(e.type=r.origType,t=r.handler.apply(this,arguments),e.type=i),t}}}),S.fn.extend({on:function(e,t,n,r){return Ee(this,e,t,n,r)},one:function(e,t,n,r){return Ee(this,e,t,n,r,1)},off:function(e,t,n){var r,i;if(e&&e.preventDefault&&e.handleObj)return r=e.handleObj,S(e.delegateTarget).off(r.namespace?r.origType+"."+r.namespace:r.origType,r.selector,r.handler),this;if("object"==typeof e){for(i in e)this.off(i,t,e[i]);return this}return!1!==t&&"function"!=typeof t||(n=t,t=void 0),!1===n&&(n=Te),this.each(function(){S.event.remove(this,e,n,t)})}});var ke=/<script|<style|<link/i,Ae=/checked\s*(?:[^=]|=\s*.checked.)/i,Ne=/^\s*<!(?:\[CDATA\[|--)|(?:\]\]|--)>\s*$/g;function je(e,t){return A(e,"table")&&A(11!==t.nodeType?t:t.firstChild,"tr")&&S(e).children("tbody")[0]||e}function De(e){return e.type=(null!==e.getAttribute("type"))+"/"+e.type,e}function qe(e){return"true/"===(e.type||"").slice(0,5)?e.type=e.type.slice(5):e.removeAttribute("type"),e}function Le(e,t){var n,r,i,o,a,s;if(1===t.nodeType){if(Y.hasData(e)&&(s=Y.get(e).events))for(i in Y.remove(t,"handle events"),s)for(n=0,r=s[i].length;n<r;n++)S.event.add(t,i,s[i][n]);Q.hasData(e)&&(o=Q.access(e),a=S.extend({},o),Q.set(t,a))}}function He(n,r,i,o){r=g(r);var e,t,a,s,u,l,c=0,f=n.length,p=f-1,d=r[0],h=m(d);if(h||1<f&&"string"==typeof d&&!y.checkClone&&Ae.test(d))return n.each(function(e){var t=n.eq(e);h&&(r[0]=d.call(this,e,t.html())),He(t,r,i,o)});if(f&&(t=(e=xe(r,n[0].ownerDocument,!1,n,o)).firstChild,1===e.childNodes.length&&(e=t),t||o)){for(s=(a=S.map(ve(e,"script"),De)).length;c<f;c++)u=e,c!==p&&(u=S.clone(u,!0,!0),s&&S.merge(a,ve(u,"script"))),i.call(n[c],u,c);if(s)for(l=a[a.length-1].ownerDocument,S.map(a,qe),c=0;c<s;c++)u=a[c],he.test(u.type||"")&&!Y.access(u,"globalEval")&&S.contains(l,u)&&(u.src&&"module"!==(u.type||"").toLowerCase()?S._evalUrl&&!u.noModule&&S._evalUrl(u.src,{nonce:u.nonce||u.getAttribute("nonce")},l):b(u.textContent.replace(Ne,""),u,l))}return n}function Oe(e,t,n){for(var r,i=t?S.filter(t,e):e,o=0;null!=(r=i[o]);o++)n||1!==r.nodeType||S.cleanData(ve(r)),r.parentNode&&(n&&ie(r)&&ye(ve(r,"script")),r.parentNode.removeChild(r));return e}S.extend({htmlPrefilter:function(e){return e},clone:function(e,t,n){var r,i,o,a,s,u,l,c=e.cloneNode(!0),f=ie(e);if(!(y.noCloneChecked||1!==e.nodeType&&11!==e.nodeType||S.isXMLDoc(e)))for(a=ve(c),r=0,i=(o=ve(e)).length;r<i;r++)s=o[r],u=a[r],void 0,"input"===(l=u.nodeName.toLowerCase())&&pe.test(s.type)?u.checked=s.checked:"input"!==l&&"textarea"!==l||(u.defaultValue=s.defaultValue);if(t)if(n)for(o=o||ve(e),a=a||ve(c),r=0,i=o.length;r<i;r++)Le(o[r],a[r]);else Le(e,c);return 0<(a=ve(c,"script")).length&&ye(a,!f&&ve(e,"script")),c},cleanData:function(e){for(var t,n,r,i=S.event.special,o=0;void 0!==(n=e[o]);o++)if(V(n)){if(t=n[Y.expando]){if(t.events)for(r in t.events)i[r]?S.event.remove(n,r):S.removeEvent(n,r,t.handle);n[Y.expando]=void 0}n[Q.expando]&&(n[Q.expando]=void 0)}}}),S.fn.extend({detach:function(e){return Oe(this,e,!0)},remove:function(e){return Oe(this,e)},text:function(e){return $(this,function(e){return void 0===e?S.text(this):this.empty().each(function(){1!==this.nodeType&&11!==this.nodeType&&9!==this.nodeType||(this.textContent=e)})},null,e,arguments.length)},append:function(){return He(this,arguments,function(e){1!==this.nodeType&&11!==this.nodeType&&9!==this.nodeType||je(this,e).appendChild(e)})},prepend:function(){return He(this,arguments,function(e){if(1===this.nodeType||11===this.nodeType||9===this.nodeType){var t=je(this,e);t.insertBefore(e,t.firstChild)}})},before:function(){return He(this,arguments,function(e){this.parentNode&&this.parentNode.insertBefore(e,this)})},after:function(){return He(this,arguments,function(e){this.parentNode&&this.parentNode.insertBefore(e,this.nextSibling)})},empty:function(){for(var e,t=0;null!=(e=this[t]);t++)1===e.nodeType&&(S.cleanData(ve(e,!1)),e.textContent="");return this},clone:function(e,t){return e=null!=e&&e,t=null==t?e:t,this.map(function(){return S.clone(this,e,t)})},html:function(e){return $(this,function(e){var t=this[0]||{},n=0,r=this.length;if(void 0===e&&1===t.nodeType)return t.innerHTML;if("string"==typeof e&&!ke.test(e)&&!ge[(de.exec(e)||["",""])[1].toLowerCase()]){e=S.htmlPrefilter(e);try{for(;n<r;n++)1===(t=this[n]||{}).nodeType&&(S.cleanData(ve(t,!1)),t.innerHTML=e);t=0}catch(e){}}t&&this.empty().append(e)},null,e,arguments.length)},replaceWith:function(){var n=[];return He(this,arguments,function(e){var t=this.parentNode;S.inArray(this,n)<0&&(S.cleanData(ve(this)),t&&t.replaceChild(e,this))},n)}}),S.each({appendTo:"append",prependTo:"prepend",insertBefore:"before",insertAfter:"after",replaceAll:"replaceWith"},function(e,a){S.fn[e]=function(e){for(var t,n=[],r=S(e),i=r.length-1,o=0;o<=i;o++)t=o===i?this:this.clone(!0),S(r[o])[a](t),u.apply(n,t.get());return this.pushStack(n)}});var Pe=new RegExp("^("+ee+")(?!px)[a-z%]+$","i"),Re=function(e){var t=e.ownerDocument.defaultView;return t&&t.opener||(t=C),t.getComputedStyle(e)},Me=function(e,t,n){var r,i,o={};for(i in t)o[i]=e.style[i],e.style[i]=t[i];for(i in r=n.call(e),t)e.style[i]=o[i];return r},Ie=new RegExp(ne.join("|"),"i");function We(e,t,n){var r,i,o,a,s=e.style;return(n=n||Re(e))&&(""!==(a=n.getPropertyValue(t)||n[t])||ie(e)||(a=S.style(e,t)),!y.pixelBoxStyles()&&Pe.test(a)&&Ie.test(t)&&(r=s.width,i=s.minWidth,o=s.maxWidth,s.minWidth=s.maxWidth=s.width=a,a=n.width,s.width=r,s.minWidth=i,s.maxWidth=o)),void 0!==a?a+"":a}function Fe(e,t){return{get:function(){if(!e())return(this.get=t).apply(this,arguments);delete this.get}}}!function(){function e(){if(l){u.style.cssText="position:absolute;left:-11111px;width:60px;margin-top:1px;padding:0;border:0",l.style.cssText="position:relative;display:block;box-sizing:border-box;overflow:scroll;margin:auto;border:1px;padding:1px;width:60%;top:1%",re.appendChild(u).appendChild(l);var e=C.getComputedStyle(l);n="1%"!==e.top,s=12===t(e.marginLeft),l.style.right="60%",o=36===t(e.right),r=36===t(e.width),l.style.position="absolute",i=12===t(l.offsetWidth/3),re.removeChild(u),l=null}}function t(e){return Math.round(parseFloat(e))}var n,r,i,o,a,s,u=E.createElement("div"),l=E.createElement("div");l.style&&(l.style.backgroundClip="content-box",l.cloneNode(!0).style.backgroundClip="",y.clearCloneStyle="content-box"===l.style.backgroundClip,S.extend(y,{boxSizingReliable:function(){return e(),r},pixelBoxStyles:function(){return e(),o},pixelPosition:function(){return e(),n},reliableMarginLeft:function(){return e(),s},scrollboxSize:function(){return e(),i},reliableTrDimensions:function(){var e,t,n,r;return null==a&&(e=E.createElement("table"),t=E.createElement("tr"),n=E.createElement("div"),e.style.cssText="position:absolute;left:-11111px;border-collapse:separate",t.style.cssText="border:1px solid",t.style.height="1px",n.style.height="9px",n.style.display="block",re.appendChild(e).appendChild(t).appendChild(n),r=C.getComputedStyle(t),a=parseInt(r.height,10)+parseInt(r.borderTopWidth,10)+parseInt(r.borderBottomWidth,10)===t.offsetHeight,re.removeChild(e)),a}}))}();var Be=["Webkit","Moz","ms"],$e=E.createElement("div").style,_e={};function ze(e){var t=S.cssProps[e]||_e[e];return t||(e in $e?e:_e[e]=function(e){var t=e[0].toUpperCase()+e.slice(1),n=Be.length;while(n--)if((e=Be[n]+t)in $e)return e}(e)||e)}var Ue=/^(none|table(?!-c[ea]).+)/,Xe=/^--/,Ve={position:"absolute",visibility:"hidden",display:"block"},Ge={letterSpacing:"0",fontWeight:"400"};function Ye(e,t,n){var r=te.exec(t);return r?Math.max(0,r[2]-(n||0))+(r[3]||"px"):t}function Qe(e,t,n,r,i,o){var a="width"===t?1:0,s=0,u=0;if(n===(r?"border":"content"))return 0;for(;a<4;a+=2)"margin"===n&&(u+=S.css(e,n+ne[a],!0,i)),r?("content"===n&&(u-=S.css(e,"padding"+ne[a],!0,i)),"margin"!==n&&(u-=S.css(e,"border"+ne[a]+"Width",!0,i))):(u+=S.css(e,"padding"+ne[a],!0,i),"padding"!==n?u+=S.css(e,"border"+ne[a]+"Width",!0,i):s+=S.css(e,"border"+ne[a]+"Width",!0,i));return!r&&0<=o&&(u+=Math.max(0,Math.ceil(e["offset"+t[0].toUpperCase()+t.slice(1)]-o-u-s-.5))||0),u}function Je(e,t,n){var r=Re(e),i=(!y.boxSizingReliable()||n)&&"border-box"===S.css(e,"boxSizing",!1,r),o=i,a=We(e,t,r),s="offset"+t[0].toUpperCase()+t.slice(1);if(Pe.test(a)){if(!n)return a;a="auto"}return(!y.boxSizingReliable()&&i||!y.reliableTrDimensions()&&A(e,"tr")||"auto"===a||!parseFloat(a)&&"inline"===S.css(e,"display",!1,r))&&e.getClientRects().length&&(i="border-box"===S.css(e,"boxSizing",!1,r),(o=s in e)&&(a=e[s])),(a=parseFloat(a)||0)+Qe(e,t,n||(i?"border":"content"),o,r,a)+"px"}function Ke(e,t,n,r,i){return new Ke.prototype.init(e,t,n,r,i)}S.extend({cssHooks:{opacity:{get:function(e,t){if(t){var n=We(e,"opacity");return""===n?"1":n}}}},cssNumber:{animationIterationCount:!0,columnCount:!0,fillOpacity:!0,flexGrow:!0,flexShrink:!0,fontWeight:!0,gridArea:!0,gridColumn:!0,gridColumnEnd:!0,gridColumnStart:!0,gridRow:!0,gridRowEnd:!0,gridRowStart:!0,lineHeight:!0,opacity:!0,order:!0,orphans:!0,widows:!0,zIndex:!0,zoom:!0},cssProps:{},style:function(e,t,n,r){if(e&&3!==e.nodeType&&8!==e.nodeType&&e.style){var i,o,a,s=X(t),u=Xe.test(t),l=e.style;if(u||(t=ze(s)),a=S.cssHooks[t]||S.cssHooks[s],void 0===n)return a&&"get"in a&&void 0!==(i=a.get(e,!1,r))?i:l[t];"string"===(o=typeof n)&&(i=te.exec(n))&&i[1]&&(n=se(e,t,i),o="number"),null!=n&&n==n&&("number"!==o||u||(n+=i&&i[3]||(S.cssNumber[s]?"":"px")),y.clearCloneStyle||""!==n||0!==t.indexOf("background")||(l[t]="inherit"),a&&"set"in a&&void 0===(n=a.set(e,n,r))||(u?l.setProperty(t,n):l[t]=n))}},css:function(e,t,n,r){var i,o,a,s=X(t);return Xe.test(t)||(t=ze(s)),(a=S.cssHooks[t]||S.cssHooks[s])&&"get"in a&&(i=a.get(e,!0,n)),void 0===i&&(i=We(e,t,r)),"normal"===i&&t in Ge&&(i=Ge[t]),""===n||n?(o=parseFloat(i),!0===n||isFinite(o)?o||0:i):i}}),S.each(["height","width"],function(e,u){S.cssHooks[u]={get:function(e,t,n){if(t)return!Ue.test(S.css(e,"display"))||e.getClientRects().length&&e.getBoundingClientRect().width?Je(e,u,n):Me(e,Ve,function(){return Je(e,u,n)})},set:function(e,t,n){var r,i=Re(e),o=!y.scrollboxSize()&&"absolute"===i.position,a=(o||n)&&"border-box"===S.css(e,"boxSizing",!1,i),s=n?Qe(e,u,n,a,i):0;return a&&o&&(s-=Math.ceil(e["offset"+u[0].toUpperCase()+u.slice(1)]-parseFloat(i[u])-Qe(e,u,"border",!1,i)-.5)),s&&(r=te.exec(t))&&"px"!==(r[3]||"px")&&(e.style[u]=t,t=S.css(e,u)),Ye(0,t,s)}}}),S.cssHooks.marginLeft=Fe(y.reliableMarginLeft,function(e,t){if(t)return(parseFloat(We(e,"marginLeft"))||e.getBoundingClientRect().left-Me(e,{marginLeft:0},function(){return e.getBoundingClientRect().left}))+"px"}),S.each({margin:"",padding:"",border:"Width"},function(i,o){S.cssHooks[i+o]={expand:function(e){for(var t=0,n={},r="string"==typeof e?e.split(" "):[e];t<4;t++)n[i+ne[t]+o]=r[t]||r[t-2]||r[0];return n}},"margin"!==i&&(S.cssHooks[i+o].set=Ye)}),S.fn.extend({css:function(e,t){return $(this,function(e,t,n){var r,i,o={},a=0;if(Array.isArray(t)){for(r=Re(e),i=t.length;a<i;a++)o[t[a]]=S.css(e,t[a],!1,r);return o}return void 0!==n?S.style(e,t,n):S.css(e,t)},e,t,1<arguments.length)}}),((S.Tween=Ke).prototype={constructor:Ke,init:function(e,t,n,r,i,o){this.elem=e,this.prop=n,this.easing=i||S.easing._default,this.options=t,this.start=this.now=this.cur(),this.end=r,this.unit=o||(S.cssNumber[n]?"":"px")},cur:function(){var e=Ke.propHooks[this.prop];return e&&e.get?e.get(this):Ke.propHooks._default.get(this)},run:function(e){var t,n=Ke.propHooks[this.prop];return this.options.duration?this.pos=t=S.easing[this.easing](e,this.options.duration*e,0,1,this.options.duration):this.pos=t=e,this.now=(this.end-this.start)*t+this.start,this.options.step&&this.options.step.call(this.elem,this.now,this),n&&n.set?n.set(this):Ke.propHooks._default.set(this),this}}).init.prototype=Ke.prototype,(Ke.propHooks={_default:{get:function(e){var t;return 1!==e.elem.nodeType||null!=e.elem[e.prop]&&null==e.elem.style[e.prop]?e.elem[e.prop]:(t=S.css(e.elem,e.prop,""))&&"auto"!==t?t:0},set:function(e){S.fx.step[e.prop]?S.fx.step[e.prop](e):1!==e.elem.nodeType||!S.cssHooks[e.prop]&&null==e.elem.style[ze(e.prop)]?e.elem[e.prop]=e.now:S.style(e.elem,e.prop,e.now+e.unit)}}}).scrollTop=Ke.propHooks.scrollLeft={set:function(e){e.elem.nodeType&&e.elem.parentNode&&(e.elem[e.prop]=e.now)}},S.easing={linear:function(e){return e},swing:function(e){return.5-Math.cos(e*Math.PI)/2},_default:"swing"},S.fx=Ke.prototype.init,S.fx.step={};var Ze,et,tt,nt,rt=/^(?:toggle|show|hide)$/,it=/queueHooks$/;function ot(){et&&(!1===E.hidden&&C.requestAnimationFrame?C.requestAnimationFrame(ot):C.setTimeout(ot,S.fx.interval),S.fx.tick())}function at(){return C.setTimeout(function(){Ze=void 0}),Ze=Date.now()}function st(e,t){var n,r=0,i={height:e};for(t=t?1:0;r<4;r+=2-t)i["margin"+(n=ne[r])]=i["padding"+n]=e;return t&&(i.opacity=i.width=e),i}function ut(e,t,n){for(var r,i=(lt.tweeners[t]||[]).concat(lt.tweeners["*"]),o=0,a=i.length;o<a;o++)if(r=i[o].call(n,t,e))return r}function lt(o,e,t){var n,a,r=0,i=lt.prefilters.length,s=S.Deferred().always(function(){delete u.elem}),u=function(){if(a)return!1;for(var e=Ze||at(),t=Math.max(0,l.startTime+l.duration-e),n=1-(t/l.duration||0),r=0,i=l.tweens.length;r<i;r++)l.tweens[r].run(n);return s.notifyWith(o,[l,n,t]),n<1&&i?t:(i||s.notifyWith(o,[l,1,0]),s.resolveWith(o,[l]),!1)},l=s.promise({elem:o,props:S.extend({},e),opts:S.extend(!0,{specialEasing:{},easing:S.easing._default},t),originalProperties:e,originalOptions:t,startTime:Ze||at(),duration:t.duration,tweens:[],createTween:function(e,t){var n=S.Tween(o,l.opts,e,t,l.opts.specialEasing[e]||l.opts.easing);return l.tweens.push(n),n},stop:function(e){var t=0,n=e?l.tweens.length:0;if(a)return this;for(a=!0;t<n;t++)l.tweens[t].run(1);return e?(s.notifyWith(o,[l,1,0]),s.resolveWith(o,[l,e])):s.rejectWith(o,[l,e]),this}}),c=l.props;for(!function(e,t){var n,r,i,o,a;for(n in e)if(i=t[r=X(n)],o=e[n],Array.isArray(o)&&(i=o[1],o=e[n]=o[0]),n!==r&&(e[r]=o,delete e[n]),(a=S.cssHooks[r])&&"expand"in a)for(n in o=a.expand(o),delete e[r],o)n in e||(e[n]=o[n],t[n]=i);else t[r]=i}(c,l.opts.specialEasing);r<i;r++)if(n=lt.prefilters[r].call(l,o,c,l.opts))return m(n.stop)&&(S._queueHooks(l.elem,l.opts.queue).stop=n.stop.bind(n)),n;return S.map(c,ut,l),m(l.opts.start)&&l.opts.start.call(o,l),l.progress(l.opts.progress).done(l.opts.done,l.opts.complete).fail(l.opts.fail).always(l.opts.always),S.fx.timer(S.extend(u,{elem:o,anim:l,queue:l.opts.queue})),l}S.Animation=S.extend(lt,{tweeners:{"*":[function(e,t){var n=this.createTween(e,t);return se(n.elem,e,te.exec(t),n),n}]},tweener:function(e,t){m(e)?(t=e,e=["*"]):e=e.match(P);for(var n,r=0,i=e.length;r<i;r++)n=e[r],lt.tweeners[n]=lt.tweeners[n]||[],lt.tweeners[n].unshift(t)},prefilters:[function(e,t,n){var r,i,o,a,s,u,l,c,f="width"in t||"height"in t,p=this,d={},h=e.style,g=e.nodeType&&ae(e),v=Y.get(e,"fxshow");for(r in n.queue||(null==(a=S._queueHooks(e,"fx")).unqueued&&(a.unqueued=0,s=a.empty.fire,a.empty.fire=function(){a.unqueued||s()}),a.unqueued++,p.always(function(){p.always(function(){a.unqueued--,S.queue(e,"fx").length||a.empty.fire()})})),t)if(i=t[r],rt.test(i)){if(delete t[r],o=o||"toggle"===i,i===(g?"hide":"show")){if("show"!==i||!v||void 0===v[r])continue;g=!0}d[r]=v&&v[r]||S.style(e,r)}if((u=!S.isEmptyObject(t))||!S.isEmptyObject(d))for(r in f&&1===e.nodeType&&(n.overflow=[h.overflow,h.overflowX,h.overflowY],null==(l=v&&v.display)&&(l=Y.get(e,"display")),"none"===(c=S.css(e,"display"))&&(l?c=l:(le([e],!0),l=e.style.display||l,c=S.css(e,"display"),le([e]))),("inline"===c||"inline-block"===c&&null!=l)&&"none"===S.css(e,"float")&&(u||(p.done(function(){h.display=l}),null==l&&(c=h.display,l="none"===c?"":c)),h.display="inline-block")),n.overflow&&(h.overflow="hidden",p.always(function(){h.overflow=n.overflow[0],h.overflowX=n.overflow[1],h.overflowY=n.overflow[2]})),u=!1,d)u||(v?"hidden"in v&&(g=v.hidden):v=Y.access(e,"fxshow",{display:l}),o&&(v.hidden=!g),g&&le([e],!0),p.done(function(){for(r in g||le([e]),Y.remove(e,"fxshow"),d)S.style(e,r,d[r])})),u=ut(g?v[r]:0,r,p),r in v||(v[r]=u.start,g&&(u.end=u.start,u.start=0))}],prefilter:function(e,t){t?lt.prefilters.unshift(e):lt.prefilters.push(e)}}),S.speed=function(e,t,n){var r=e&&"object"==typeof e?S.extend({},e):{complete:n||!n&&t||m(e)&&e,duration:e,easing:n&&t||t&&!m(t)&&t};return S.fx.off?r.duration=0:"number"!=typeof r.duration&&(r.duration in S.fx.speeds?r.duration=S.fx.speeds[r.duration]:r.duration=S.fx.speeds._default),null!=r.queue&&!0!==r.queue||(r.queue="fx"),r.old=r.complete,r.complete=function(){m(r.old)&&r.old.call(this),r.queue&&S.dequeue(this,r.queue)},r},S.fn.extend({fadeTo:function(e,t,n,r){return this.filter(ae).css("opacity",0).show().end().animate({opacity:t},e,n,r)},animate:function(t,e,n,r){var i=S.isEmptyObject(t),o=S.speed(e,n,r),a=function(){var e=lt(this,S.extend({},t),o);(i||Y.get(this,"finish"))&&e.stop(!0)};return a.finish=a,i||!1===o.queue?this.each(a):this.queue(o.queue,a)},stop:function(i,e,o){var a=function(e){var t=e.stop;delete e.stop,t(o)};return"string"!=typeof i&&(o=e,e=i,i=void 0),e&&this.queue(i||"fx",[]),this.each(function(){var e=!0,t=null!=i&&i+"queueHooks",n=S.timers,r=Y.get(this);if(t)r[t]&&r[t].stop&&a(r[t]);else for(t in r)r[t]&&r[t].stop&&it.test(t)&&a(r[t]);for(t=n.length;t--;)n[t].elem!==this||null!=i&&n[t].queue!==i||(n[t].anim.stop(o),e=!1,n.splice(t,1));!e&&o||S.dequeue(this,i)})},finish:function(a){return!1!==a&&(a=a||"fx"),this.each(function(){var e,t=Y.get(this),n=t[a+"queue"],r=t[a+"queueHooks"],i=S.timers,o=n?n.length:0;for(t.finish=!0,S.queue(this,a,[]),r&&r.stop&&r.stop.call(this,!0),e=i.length;e--;)i[e].elem===this&&i[e].queue===a&&(i[e].anim.stop(!0),i.splice(e,1));for(e=0;e<o;e++)n[e]&&n[e].finish&&n[e].finish.call(this);delete t.finish})}}),S.each(["toggle","show","hide"],function(e,r){var i=S.fn[r];S.fn[r]=function(e,t,n){return null==e||"boolean"==typeof e?i.apply(this,arguments):this.animate(st(r,!0),e,t,n)}}),S.each({slideDown:st("show"),slideUp:st("hide"),slideToggle:st("toggle"),fadeIn:{opacity:"show"},fadeOut:{opacity:"hide"},fadeToggle:{opacity:"toggle"}},function(e,r){S.fn[e]=function(e,t,n){return this.animate(r,e,t,n)}}),S.timers=[],S.fx.tick=function(){var e,t=0,n=S.timers;for(Ze=Date.now();t<n.length;t++)(e=n[t])()||n[t]!==e||n.splice(t--,1);n.length||S.fx.stop(),Ze=void 0},S.fx.timer=function(e){S.timers.push(e),S.fx.start()},S.fx.interval=13,S.fx.start=function(){et||(et=!0,ot())},S.fx.stop=function(){et=null},S.fx.speeds={slow:600,fast:200,_default:400},S.fn.delay=function(r,e){return r=S.fx&&S.fx.speeds[r]||r,e=e||"fx",this.queue(e,function(e,t){var n=C.setTimeout(e,r);t.stop=function(){C.clearTimeout(n)}})},tt=E.createElement("input"),nt=E.createElement("select").appendChild(E.createElement("option")),tt.type="checkbox",y.checkOn=""!==tt.value,y.optSelected=nt.selected,(tt=E.createElement("input")).value="t",tt.type="radio",y.radioValue="t"===tt.value;var ct,ft=S.expr.attrHandle;S.fn.extend({attr:function(e,t){return $(this,S.attr,e,t,1<arguments.length)},removeAttr:function(e){return this.each(function(){S.removeAttr(this,e)})}}),S.extend({attr:function(e,t,n){var r,i,o=e.nodeType;if(3!==o&&8!==o&&2!==o)return"undefined"==typeof e.getAttribute?S.prop(e,t,n):(1===o&&S.isXMLDoc(e)||(i=S.attrHooks[t.toLowerCase()]||(S.expr.match.bool.test(t)?ct:void 0)),void 0!==n?null===n?void S.removeAttr(e,t):i&&"set"in i&&void 0!==(r=i.set(e,n,t))?r:(e.setAttribute(t,n+""),n):i&&"get"in i&&null!==(r=i.get(e,t))?r:null==(r=S.find.attr(e,t))?void 0:r)},attrHooks:{type:{set:function(e,t){if(!y.radioValue&&"radio"===t&&A(e,"input")){var n=e.value;return e.setAttribute("type",t),n&&(e.value=n),t}}}},removeAttr:function(e,t){var n,r=0,i=t&&t.match(P);if(i&&1===e.nodeType)while(n=i[r++])e.removeAttribute(n)}}),ct={set:function(e,t,n){return!1===t?S.removeAttr(e,n):e.setAttribute(n,n),n}},S.each(S.expr.match.bool.source.match(/\w+/g),function(e,t){var a=ft[t]||S.find.attr;ft[t]=function(e,t,n){var r,i,o=t.toLowerCase();return n||(i=ft[o],ft[o]=r,r=null!=a(e,t,n)?o:null,ft[o]=i),r}});var pt=/^(?:input|select|textarea|button)$/i,dt=/^(?:a|area)$/i;function ht(e){return(e.match(P)||[]).join(" ")}function gt(e){return e.getAttribute&&e.getAttribute("class")||""}function vt(e){return Array.isArray(e)?e:"string"==typeof e&&e.match(P)||[]}S.fn.extend({prop:function(e,t){return $(this,S.prop,e,t,1<arguments.length)},removeProp:function(e){return this.each(function(){delete this[S.propFix[e]||e]})}}),S.extend({prop:function(e,t,n){var r,i,o=e.nodeType;if(3!==o&&8!==o&&2!==o)return 1===o&&S.isXMLDoc(e)||(t=S.propFix[t]||t,i=S.propHooks[t]),void 0!==n?i&&"set"in i&&void 0!==(r=i.set(e,n,t))?r:e[t]=n:i&&"get"in i&&null!==(r=i.get(e,t))?r:e[t]},propHooks:{tabIndex:{get:function(e){var t=S.find.attr(e,"tabindex");return t?parseInt(t,10):pt.test(e.nodeName)||dt.test(e.nodeName)&&e.href?0:-1}}},propFix:{"for":"htmlFor","class":"className"}}),y.optSelected||(S.propHooks.selected={get:function(e){var t=e.parentNode;return t&&t.parentNode&&t.parentNode.selectedIndex,null},set:function(e){var t=e.parentNode;t&&(t.selectedIndex,t.parentNode&&t.parentNode.selectedIndex)}}),S.each(["tabIndex","readOnly","maxLength","cellSpacing","cellPadding","rowSpan","colSpan","useMap","frameBorder","contentEditable"],function(){S.propFix[this.toLowerCase()]=this}),S.fn.extend({addClass:function(t){var e,n,r,i,o,a,s,u=0;if(m(t))return this.each(function(e){S(this).addClass(t.call(this,e,gt(this)))});if((e=vt(t)).length)while(n=this[u++])if(i=gt(n),r=1===n.nodeType&&" "+ht(i)+" "){a=0;while(o=e[a++])r.indexOf(" "+o+" ")<0&&(r+=o+" ");i!==(s=ht(r))&&n.setAttribute("class",s)}return this},removeClass:function(t){var e,n,r,i,o,a,s,u=0;if(m(t))return this.each(function(e){S(this).removeClass(t.call(this,e,gt(this)))});if(!arguments.length)return this.attr("class","");if((e=vt(t)).length)while(n=this[u++])if(i=gt(n),r=1===n.nodeType&&" "+ht(i)+" "){a=0;while(o=e[a++])while(-1<r.indexOf(" "+o+" "))r=r.replace(" "+o+" "," ");i!==(s=ht(r))&&n.setAttribute("class",s)}return this},toggleClass:function(i,t){var o=typeof i,a="string"===o||Array.isArray(i);return"boolean"==typeof t&&a?t?this.addClass(i):this.removeClass(i):m(i)?this.each(function(e){S(this).toggleClass(i.call(this,e,gt(this),t),t)}):this.each(function(){var e,t,n,r;if(a){t=0,n=S(this),r=vt(i);while(e=r[t++])n.hasClass(e)?n.removeClass(e):n.addClass(e)}else void 0!==i&&"boolean"!==o||((e=gt(this))&&Y.set(this,"__className__",e),this.setAttribute&&this.setAttribute("class",e||!1===i?"":Y.get(this,"__className__")||""))})},hasClass:function(e){var t,n,r=0;t=" "+e+" ";while(n=this[r++])if(1===n.nodeType&&-1<(" "+ht(gt(n))+" ").indexOf(t))return!0;return!1}});var yt=/\r/g;S.fn.extend({val:function(n){var r,e,i,t=this[0];return arguments.length?(i=m(n),this.each(function(e){var t;1===this.nodeType&&(null==(t=i?n.call(this,e,S(this).val()):n)?t="":"number"==typeof t?t+="":Array.isArray(t)&&(t=S.map(t,function(e){return null==e?"":e+""})),(r=S.valHooks[this.type]||S.valHooks[this.nodeName.toLowerCase()])&&"set"in r&&void 0!==r.set(this,t,"value")||(this.value=t))})):t?(r=S.valHooks[t.type]||S.valHooks[t.nodeName.toLowerCase()])&&"get"in r&&void 0!==(e=r.get(t,"value"))?e:"string"==typeof(e=t.value)?e.replace(yt,""):null==e?"":e:void 0}}),S.extend({valHooks:{option:{get:function(e){var t=S.find.attr(e,"value");return null!=t?t:ht(S.text(e))}},select:{get:function(e){var t,n,r,i=e.options,o=e.selectedIndex,a="select-one"===e.type,s=a?null:[],u=a?o+1:i.length;for(r=o<0?u:a?o:0;r<u;r++)if(((n=i[r]).selected||r===o)&&!n.disabled&&(!n.parentNode.disabled||!A(n.parentNode,"optgroup"))){if(t=S(n).val(),a)return t;s.push(t)}return s},set:function(e,t){var n,r,i=e.options,o=S.makeArray(t),a=i.length;while(a--)((r=i[a]).selected=-1<S.inArray(S.valHooks.option.get(r),o))&&(n=!0);return n||(e.selectedIndex=-1),o}}}}),S.each(["radio","checkbox"],function(){S.valHooks[this]={set:function(e,t){if(Array.isArray(t))return e.checked=-1<S.inArray(S(e).val(),t)}},y.checkOn||(S.valHooks[this].get=function(e){return null===e.getAttribute("value")?"on":e.value})}),y.focusin="onfocusin"in C;var mt=/^(?:focusinfocus|focusoutblur)$/,xt=function(e){e.stopPropagation()};S.extend(S.event,{trigger:function(e,t,n,r){var i,o,a,s,u,l,c,f,p=[n||E],d=v.call(e,"type")?e.type:e,h=v.call(e,"namespace")?e.namespace.split("."):[];if(o=f=a=n=n||E,3!==n.nodeType&&8!==n.nodeType&&!mt.test(d+S.event.triggered)&&(-1<d.indexOf(".")&&(d=(h=d.split(".")).shift(),h.sort()),u=d.indexOf(":")<0&&"on"+d,(e=e[S.expando]?e:new S.Event(d,"object"==typeof e&&e)).isTrigger=r?2:3,e.namespace=h.join("."),e.rnamespace=e.namespace?new RegExp("(^|\\.)"+h.join("\\.(?:.*\\.|)")+"(\\.|$)"):null,e.result=void 0,e.target||(e.target=n),t=null==t?[e]:S.makeArray(t,[e]),c=S.event.special[d]||{},r||!c.trigger||!1!==c.trigger.apply(n,t))){if(!r&&!c.noBubble&&!x(n)){for(s=c.delegateType||d,mt.test(s+d)||(o=o.parentNode);o;o=o.parentNode)p.push(o),a=o;a===(n.ownerDocument||E)&&p.push(a.defaultView||a.parentWindow||C)}i=0;while((o=p[i++])&&!e.isPropagationStopped())f=o,e.type=1<i?s:c.bindType||d,(l=(Y.get(o,"events")||Object.create(null))[e.type]&&Y.get(o,"handle"))&&l.apply(o,t),(l=u&&o[u])&&l.apply&&V(o)&&(e.result=l.apply(o,t),!1===e.result&&e.preventDefault());return e.type=d,r||e.isDefaultPrevented()||c._default&&!1!==c._default.apply(p.pop(),t)||!V(n)||u&&m(n[d])&&!x(n)&&((a=n[u])&&(n[u]=null),S.event.triggered=d,e.isPropagationStopped()&&f.addEventListener(d,xt),n[d](),e.isPropagationStopped()&&f.removeEventListener(d,xt),S.event.triggered=void 0,a&&(n[u]=a)),e.result}},simulate:function(e,t,n){var r=S.extend(new S.Event,n,{type:e,isSimulated:!0});S.event.trigger(r,null,t)}}),S.fn.extend({trigger:function(e,t){return this.each(function(){S.event.trigger(e,t,this)})},triggerHandler:function(e,t){var n=this[0];if(n)return S.event.trigger(e,t,n,!0)}}),y.focusin||S.each({focus:"focusin",blur:"focusout"},function(n,r){var i=function(e){S.event.simulate(r,e.target,S.event.fix(e))};S.event.special[r]={setup:function(){var e=this.ownerDocument||this.document||this,t=Y.access(e,r);t||e.addEventListener(n,i,!0),Y.access(e,r,(t||0)+1)},teardown:function(){var e=this.ownerDocument||this.document||this,t=Y.access(e,r)-1;t?Y.access(e,r,t):(e.removeEventListener(n,i,!0),Y.remove(e,r))}}});var bt=C.location,wt={guid:Date.now()},Tt=/\?/;S.parseXML=function(e){var t,n;if(!e||"string"!=typeof e)return null;try{t=(new C.DOMParser).parseFromString(e,"text/xml")}catch(e){}return n=t&&t.getElementsByTagName("parsererror")[0],t&&!n||S.error("Invalid XML: "+(n?S.map(n.childNodes,function(e){return e.textContent}).join("\n"):e)),t};var Ct=/\[\]$/,Et=/\r?\n/g,St=/^(?:submit|button|image|reset|file)$/i,kt=/^(?:input|select|textarea|keygen)/i;function At(n,e,r,i){var t;if(Array.isArray(e))S.each(e,function(e,t){r||Ct.test(n)?i(n,t):At(n+"["+("object"==typeof t&&null!=t?e:"")+"]",t,r,i)});else if(r||"object"!==w(e))i(n,e);else for(t in e)At(n+"["+t+"]",e[t],r,i)}S.param=function(e,t){var n,r=[],i=function(e,t){var n=m(t)?t():t;r[r.length]=encodeURIComponent(e)+"="+encodeURIComponent(null==n?"":n)};if(null==e)return"";if(Array.isArray(e)||e.jquery&&!S.isPlainObject(e))S.each(e,function(){i(this.name,this.value)});else for(n in e)At(n,e[n],t,i);return r.join("&")},S.fn.extend({serialize:function(){return S.param(this.serializeArray())},serializeArray:function(){return this.map(function(){var e=S.prop(this,"elements");return e?S.makeArray(e):this}).filter(function(){var e=this.type;return this.name&&!S(this).is(":disabled")&&kt.test(this.nodeName)&&!St.test(e)&&(this.checked||!pe.test(e))}).map(function(e,t){var n=S(this).val();return null==n?null:Array.isArray(n)?S.map(n,function(e){return{name:t.name,value:e.replace(Et,"\r\n")}}):{name:t.name,value:n.replace(Et,"\r\n")}}).get()}});var Nt=/%20/g,jt=/#.*$/,Dt=/([?&])_=[^&]*/,qt=/^(.*?):[ \t]*([^\r\n]*)$/gm,Lt=/^(?:GET|HEAD)$/,Ht=/^\/\//,Ot={},Pt={},Rt="*/".concat("*"),Mt=E.createElement("a");function It(o){return function(e,t){"string"!=typeof e&&(t=e,e="*");var n,r=0,i=e.toLowerCase().match(P)||[];if(m(t))while(n=i[r++])"+"===n[0]?(n=n.slice(1)||"*",(o[n]=o[n]||[]).unshift(t)):(o[n]=o[n]||[]).push(t)}}function Wt(t,i,o,a){var s={},u=t===Pt;function l(e){var r;return s[e]=!0,S.each(t[e]||[],function(e,t){var n=t(i,o,a);return"string"!=typeof n||u||s[n]?u?!(r=n):void 0:(i.dataTypes.unshift(n),l(n),!1)}),r}return l(i.dataTypes[0])||!s["*"]&&l("*")}function Ft(e,t){var n,r,i=S.ajaxSettings.flatOptions||{};for(n in t)void 0!==t[n]&&((i[n]?e:r||(r={}))[n]=t[n]);return r&&S.extend(!0,e,r),e}Mt.href=bt.href,S.extend({active:0,lastModified:{},etag:{},ajaxSettings:{url:bt.href,type:"GET",isLocal:/^(?:about|app|app-storage|.+-extension|file|res|widget):$/.test(bt.protocol),global:!0,processData:!0,async:!0,contentType:"application/x-www-form-urlencoded; charset=UTF-8",accepts:{"*":Rt,text:"text/plain",html:"text/html",xml:"application/xml, text/xml",json:"application/json, text/javascript"},contents:{xml:/\bxml\b/,html:/\bhtml/,json:/\bjson\b/},responseFields:{xml:"responseXML",text:"responseText",json:"responseJSON"},converters:{"* text":String,"text html":!0,"text json":JSON.parse,"text xml":S.parseXML},flatOptions:{url:!0,context:!0}},ajaxSetup:function(e,t){return t?Ft(Ft(e,S.ajaxSettings),t):Ft(S.ajaxSettings,e)},ajaxPrefilter:It(Ot),ajaxTransport:It(Pt),ajax:function(e,t){"object"==typeof e&&(t=e,e=void 0),t=t||{};var c,f,p,n,d,r,h,g,i,o,v=S.ajaxSetup({},t),y=v.context||v,m=v.context&&(y.nodeType||y.jquery)?S(y):S.event,x=S.Deferred(),b=S.Callbacks("once memory"),w=v.statusCode||{},a={},s={},u="canceled",T={readyState:0,getResponseHeader:function(e){var t;if(h){if(!n){n={};while(t=qt.exec(p))n[t[1].toLowerCase()+" "]=(n[t[1].toLowerCase()+" "]||[]).concat(t[2])}t=n[e.toLowerCase()+" "]}return null==t?null:t.join(", ")},getAllResponseHeaders:function(){return h?p:null},setRequestHeader:function(e,t){return null==h&&(e=s[e.toLowerCase()]=s[e.toLowerCase()]||e,a[e]=t),this},overrideMimeType:function(e){return null==h&&(v.mimeType=e),this},statusCode:function(e){var t;if(e)if(h)T.always(e[T.status]);else for(t in e)w[t]=[w[t],e[t]];return this},abort:function(e){var t=e||u;return c&&c.abort(t),l(0,t),this}};if(x.promise(T),v.url=((e||v.url||bt.href)+"").replace(Ht,bt.protocol+"//"),v.type=t.method||t.type||v.method||v.type,v.dataTypes=(v.dataType||"*").toLowerCase().match(P)||[""],null==v.crossDomain){r=E.createElement("a");try{r.href=v.url,r.href=r.href,v.crossDomain=Mt.protocol+"//"+Mt.host!=r.protocol+"//"+r.host}catch(e){v.crossDomain=!0}}if(v.data&&v.processData&&"string"!=typeof v.data&&(v.data=S.param(v.data,v.traditional)),Wt(Ot,v,t,T),h)return T;for(i in(g=S.event&&v.global)&&0==S.active++&&S.event.trigger("ajaxStart"),v.type=v.type.toUpperCase(),v.hasContent=!Lt.test(v.type),f=v.url.replace(jt,""),v.hasContent?v.data&&v.processData&&0===(v.contentType||"").indexOf("application/x-www-form-urlencoded")&&(v.data=v.data.replace(Nt,"+")):(o=v.url.slice(f.length),v.data&&(v.processData||"string"==typeof v.data)&&(f+=(Tt.test(f)?"&":"?")+v.data,delete v.data),!1===v.cache&&(f=f.replace(Dt,"$1"),o=(Tt.test(f)?"&":"?")+"_="+wt.guid+++o),v.url=f+o),v.ifModified&&(S.lastModified[f]&&T.setRequestHeader("If-Modified-Since",S.lastModified[f]),S.etag[f]&&T.setRequestHeader("If-None-Match",S.etag[f])),(v.data&&v.hasContent&&!1!==v.contentType||t.contentType)&&T.setRequestHeader("Content-Type",v.contentType),T.setRequestHeader("Accept",v.dataTypes[0]&&v.accepts[v.dataTypes[0]]?v.accepts[v.dataTypes[0]]+("*"!==v.dataTypes[0]?", "+Rt+"; q=0.01":""):v.accepts["*"]),v.headers)T.setRequestHeader(i,v.headers[i]);if(v.beforeSend&&(!1===v.beforeSend.call(y,T,v)||h))return T.abort();if(u="abort",b.add(v.complete),T.done(v.success),T.fail(v.error),c=Wt(Pt,v,t,T)){if(T.readyState=1,g&&m.trigger("ajaxSend",[T,v]),h)return T;v.async&&0<v.timeout&&(d=C.setTimeout(function(){T.abort("timeout")},v.timeout));try{h=!1,c.send(a,l)}catch(e){if(h)throw e;l(-1,e)}}else l(-1,"No Transport");function l(e,t,n,r){var i,o,a,s,u,l=t;h||(h=!0,d&&C.clearTimeout(d),c=void 0,p=r||"",T.readyState=0<e?4:0,i=200<=e&&e<300||304===e,n&&(s=function(e,t,n){var r,i,o,a,s=e.contents,u=e.dataTypes;while("*"===u[0])u.shift(),void 0===r&&(r=e.mimeType||t.getResponseHeader("Content-Type"));if(r)for(i in s)if(s[i]&&s[i].test(r)){u.unshift(i);break}if(u[0]in n)o=u[0];else{for(i in n){if(!u[0]||e.converters[i+" "+u[0]]){o=i;break}a||(a=i)}o=o||a}if(o)return o!==u[0]&&u.unshift(o),n[o]}(v,T,n)),!i&&-1<S.inArray("script",v.dataTypes)&&S.inArray("json",v.dataTypes)<0&&(v.converters["text script"]=function(){}),s=function(e,t,n,r){var i,o,a,s,u,l={},c=e.dataTypes.slice();if(c[1])for(a in e.converters)l[a.toLowerCase()]=e.converters[a];o=c.shift();while(o)if(e.responseFields[o]&&(n[e.responseFields[o]]=t),!u&&r&&e.dataFilter&&(t=e.dataFilter(t,e.dataType)),u=o,o=c.shift())if("*"===o)o=u;else if("*"!==u&&u!==o){if(!(a=l[u+" "+o]||l["* "+o]))for(i in l)if((s=i.split(" "))[1]===o&&(a=l[u+" "+s[0]]||l["* "+s[0]])){!0===a?a=l[i]:!0!==l[i]&&(o=s[0],c.unshift(s[1]));break}if(!0!==a)if(a&&e["throws"])t=a(t);else try{t=a(t)}catch(e){return{state:"parsererror",error:a?e:"No conversion from "+u+" to "+o}}}return{state:"success",data:t}}(v,s,T,i),i?(v.ifModified&&((u=T.getResponseHeader("Last-Modified"))&&(S.lastModified[f]=u),(u=T.getResponseHeader("etag"))&&(S.etag[f]=u)),204===e||"HEAD"===v.type?l="nocontent":304===e?l="notmodified":(l=s.state,o=s.data,i=!(a=s.error))):(a=l,!e&&l||(l="error",e<0&&(e=0))),T.status=e,T.statusText=(t||l)+"",i?x.resolveWith(y,[o,l,T]):x.rejectWith(y,[T,l,a]),T.statusCode(w),w=void 0,g&&m.trigger(i?"ajaxSuccess":"ajaxError",[T,v,i?o:a]),b.fireWith(y,[T,l]),g&&(m.trigger("ajaxComplete",[T,v]),--S.active||S.event.trigger("ajaxStop")))}return T},getJSON:function(e,t,n){return S.get(e,t,n,"json")},getScript:function(e,t){return S.get(e,void 0,t,"script")}}),S.each(["get","post"],function(e,i){S[i]=function(e,t,n,r){return m(t)&&(r=r||n,n=t,t=void 0),S.ajax(S.extend({url:e,type:i,dataType:r,data:t,success:n},S.isPlainObject(e)&&e))}}),S.ajaxPrefilter(function(e){var t;for(t in e.headers)"content-type"===t.toLowerCase()&&(e.contentType=e.headers[t]||"")}),S._evalUrl=function(e,t,n){return S.ajax({url:e,type:"GET",dataType:"script",cache:!0,async:!1,global:!1,converters:{"text script":function(){}},dataFilter:function(e){S.globalEval(e,t,n)}})},S.fn.extend({wrapAll:function(e){var t;return this[0]&&(m(e)&&(e=e.call(this[0])),t=S(e,this[0].ownerDocument).eq(0).clone(!0),this[0].parentNode&&t.insertBefore(this[0]),t.map(function(){var e=this;while(e.firstElementChild)e=e.firstElementChild;return e}).append(this)),this},wrapInner:function(n){return m(n)?this.each(function(e){S(this).wrapInner(n.call(this,e))}):this.each(function(){var e=S(this),t=e.contents();t.length?t.wrapAll(n):e.append(n)})},wrap:function(t){var n=m(t);return this.each(function(e){S(this).wrapAll(n?t.call(this,e):t)})},unwrap:function(e){return this.parent(e).not("body").each(function(){S(this).replaceWith(this.childNodes)}),this}}),S.expr.pseudos.hidden=function(e){return!S.expr.pseudos.visible(e)},S.expr.pseudos.visible=function(e){return!!(e.offsetWidth||e.offsetHeight||e.getClientRects().length)},S.ajaxSettings.xhr=function(){try{return new C.XMLHttpRequest}catch(e){}};var Bt={0:200,1223:204},$t=S.ajaxSettings.xhr();y.cors=!!$t&&"withCredentials"in $t,y.ajax=$t=!!$t,S.ajaxTransport(function(i){var o,a;if(y.cors||$t&&!i.crossDomain)return{send:function(e,t){var n,r=i.xhr();if(r.open(i.type,i.url,i.async,i.username,i.password),i.xhrFields)for(n in i.xhrFields)r[n]=i.xhrFields[n];for(n in i.mimeType&&r.overrideMimeType&&r.overrideMimeType(i.mimeType),i.crossDomain||e["X-Requested-With"]||(e["X-Requested-With"]="XMLHttpRequest"),e)r.setRequestHeader(n,e[n]);o=function(e){return function(){o&&(o=a=r.onload=r.onerror=r.onabort=r.ontimeout=r.onreadystatechange=null,"abort"===e?r.abort():"error"===e?"number"!=typeof r.status?t(0,"error"):t(r.status,r.statusText):t(Bt[r.status]||r.status,r.statusText,"text"!==(r.responseType||"text")||"string"!=typeof r.responseText?{binary:r.response}:{text:r.responseText},r.getAllResponseHeaders()))}},r.onload=o(),a=r.onerror=r.ontimeout=o("error"),void 0!==r.onabort?r.onabort=a:r.onreadystatechange=function(){4===r.readyState&&C.setTimeout(function(){o&&a()})},o=o("abort");try{r.send(i.hasContent&&i.data||null)}catch(e){if(o)throw e}},abort:function(){o&&o()}}}),S.ajaxPrefilter(function(e){e.crossDomain&&(e.contents.script=!1)}),S.ajaxSetup({accepts:{script:"text/javascript, application/javascript, application/ecmascript, application/x-ecmascript"},contents:{script:/\b(?:java|ecma)script\b/},converters:{"text script":function(e){return S.globalEval(e),e}}}),S.ajaxPrefilter("script",function(e){void 0===e.cache&&(e.cache=!1),e.crossDomain&&(e.type="GET")}),S.ajaxTransport("script",function(n){var r,i;if(n.crossDomain||n.scriptAttrs)return{send:function(e,t){r=S("<script>").attr(n.scriptAttrs||{}).prop({charset:n.scriptCharset,src:n.url}).on("load error",i=function(e){r.remove(),i=null,e&&t("error"===e.type?404:200,e.type)}),E.head.appendChild(r[0])},abort:function(){i&&i()}}});var _t,zt=[],Ut=/(=)\?(?=&|$)|\?\?/;S.ajaxSetup({jsonp:"callback",jsonpCallback:function(){var e=zt.pop()||S.expando+"_"+wt.guid++;return this[e]=!0,e}}),S.ajaxPrefilter("json jsonp",function(e,t,n){var r,i,o,a=!1!==e.jsonp&&(Ut.test(e.url)?"url":"string"==typeof e.data&&0===(e.contentType||"").indexOf("application/x-www-form-urlencoded")&&Ut.test(e.data)&&"data");if(a||"jsonp"===e.dataTypes[0])return r=e.jsonpCallback=m(e.jsonpCallback)?e.jsonpCallback():e.jsonpCallback,a?e[a]=e[a].replace(Ut,"$1"+r):!1!==e.jsonp&&(e.url+=(Tt.test(e.url)?"&":"?")+e.jsonp+"="+r),e.converters["script json"]=function(){return o||S.error(r+" was not called"),o[0]},e.dataTypes[0]="json",i=C[r],C[r]=function(){o=arguments},n.always(function(){void 0===i?S(C).removeProp(r):C[r]=i,e[r]&&(e.jsonpCallback=t.jsonpCallback,zt.push(r)),o&&m(i)&&i(o[0]),o=i=void 0}),"script"}),y.createHTMLDocument=((_t=E.implementation.createHTMLDocument("").body).innerHTML="<form></form><form></form>",2===_t.childNodes.length),S.parseHTML=function(e,t,n){return"string"!=typeof e?[]:("boolean"==typeof t&&(n=t,t=!1),t||(y.createHTMLDocument?((r=(t=E.implementation.createHTMLDocument("")).createElement("base")).href=E.location.href,t.head.appendChild(r)):t=E),o=!n&&[],(i=N.exec(e))?[t.createElement(i[1])]:(i=xe([e],t,o),o&&o.length&&S(o).remove(),S.merge([],i.childNodes)));var r,i,o},S.fn.load=function(e,t,n){var r,i,o,a=this,s=e.indexOf(" ");return-1<s&&(r=ht(e.slice(s)),e=e.slice(0,s)),m(t)?(n=t,t=void 0):t&&"object"==typeof t&&(i="POST"),0<a.length&&S.ajax({url:e,type:i||"GET",dataType:"html",data:t}).done(function(e){o=arguments,a.html(r?S("<div>").append(S.parseHTML(e)).find(r):e)}).always(n&&function(e,t){a.each(function(){n.apply(this,o||[e.responseText,t,e])})}),this},S.expr.pseudos.animated=function(t){return S.grep(S.timers,function(e){return t===e.elem}).length},S.offset={setOffset:function(e,t,n){var r,i,o,a,s,u,l=S.css(e,"position"),c=S(e),f={};"static"===l&&(e.style.position="relative"),s=c.offset(),o=S.css(e,"top"),u=S.css(e,"left"),("absolute"===l||"fixed"===l)&&-1<(o+u).indexOf("auto")?(a=(r=c.position()).top,i=r.left):(a=parseFloat(o)||0,i=parseFloat(u)||0),m(t)&&(t=t.call(e,n,S.extend({},s))),null!=t.top&&(f.top=t.top-s.top+a),null!=t.left&&(f.left=t.left-s.left+i),"using"in t?t.using.call(e,f):c.css(f)}},S.fn.extend({offset:function(t){if(arguments.length)return void 0===t?this:this.each(function(e){S.offset.setOffset(this,t,e)});var e,n,r=this[0];return r?r.getClientRects().length?(e=r.getBoundingClientRect(),n=r.ownerDocument.defaultView,{top:e.top+n.pageYOffset,left:e.left+n.pageXOffset}):{top:0,left:0}:void 0},position:function(){if(this[0]){var e,t,n,r=this[0],i={top:0,left:0};if("fixed"===S.css(r,"position"))t=r.getBoundingClientRect();else{t=this.offset(),n=r.ownerDocument,e=r.offsetParent||n.documentElement;while(e&&(e===n.body||e===n.documentElement)&&"static"===S.css(e,"position"))e=e.parentNode;e&&e!==r&&1===e.nodeType&&((i=S(e).offset()).top+=S.css(e,"borderTopWidth",!0),i.left+=S.css(e,"borderLeftWidth",!0))}return{top:t.top-i.top-S.css(r,"marginTop",!0),left:t.left-i.left-S.css(r,"marginLeft",!0)}}},offsetParent:function(){return this.map(function(){var e=this.offsetParent;while(e&&"static"===S.css(e,"position"))e=e.offsetParent;return e||re})}}),S.each({scrollLeft:"pageXOffset",scrollTop:"pageYOffset"},function(t,i){var o="pageYOffset"===i;S.fn[t]=function(e){return $(this,function(e,t,n){var r;if(x(e)?r=e:9===e.nodeType&&(r=e.defaultView),void 0===n)return r?r[i]:e[t];r?r.scrollTo(o?r.pageXOffset:n,o?n:r.pageYOffset):e[t]=n},t,e,arguments.length)}}),S.each(["top","left"],function(e,n){S.cssHooks[n]=Fe(y.pixelPosition,function(e,t){if(t)return t=We(e,n),Pe.test(t)?S(e).position()[n]+"px":t})}),S.each({Height:"height",Width:"width"},function(a,s){S.each({padding:"inner"+a,content:s,"":"outer"+a},function(r,o){S.fn[o]=function(e,t){var n=arguments.length&&(r||"boolean"!=typeof e),i=r||(!0===e||!0===t?"margin":"border");return $(this,function(e,t,n){var r;return x(e)?0===o.indexOf("outer")?e["inner"+a]:e.document.documentElement["client"+a]:9===e.nodeType?(r=e.documentElement,Math.max(e.body["scroll"+a],r["scroll"+a],e.body["offset"+a],r["offset"+a],r["client"+a])):void 0===n?S.css(e,t,i):S.style(e,t,n,i)},s,n?e:void 0,n)}})}),S.each(["ajaxStart","ajaxStop","ajaxComplete","ajaxError","ajaxSuccess","ajaxSend"],function(e,t){S.fn[t]=function(e){return this.on(t,e)}}),S.fn.extend({bind:function(e,t,n){return this.on(e,null,t,n)},unbind:function(e,t){return this.off(e,null,t)},delegate:function(e,t,n,r){return this.on(t,e,n,r)},undelegate:function(e,t,n){return 1===arguments.length?this.off(e,"**"):this.off(t,e||"**",n)},hover:function(e,t){return this.mouseenter(e).mouseleave(t||e)}}),S.each("blur focus focusin focusout resize scroll click dblclick mousedown mouseup mousemove mouseover mouseout mouseenter mouseleave change select submit keydown keypress keyup contextmenu".split(" "),function(e,n){S.fn[n]=function(e,t){return 0<arguments.length?this.on(n,null,e,t):this.trigger(n)}});var Xt=/^[\s\uFEFF\xA0]+|[\s\uFEFF\xA0]+$/g;S.proxy=function(e,t){var n,r,i;if("string"==typeof t&&(n=e[t],t=e,e=n),m(e))return r=s.call(arguments,2),(i=function(){return e.apply(t||this,r.concat(s.call(arguments)))}).guid=e.guid=e.guid||S.guid++,i},S.holdReady=function(e){e?S.readyWait++:S.ready(!0)},S.isArray=Array.isArray,S.parseJSON=JSON.parse,S.nodeName=A,S.isFunction=m,S.isWindow=x,S.camelCase=X,S.type=w,S.now=Date.now,S.isNumeric=function(e){var t=S.type(e);return("number"===t||"string"===t)&&!isNaN(e-parseFloat(e))},S.trim=function(e){return null==e?"":(e+"").replace(Xt,"")},"function"==typeof define&&define.amd&&define("jquery",[],function(){return S});var Vt=C.jQuery,Gt=C.$;return S.noConflict=function(e){return C.$===S&&(C.$=Gt),e&&C.jQuery===S&&(C.jQuery=Vt),S},"undefined"==typeof e&&(C.jQuery=C.$=S),S});
+/*!
+ * jQuery JavaScript Library v3.6.0
+ * https://jquery.com/
+ *
+ * Includes Sizzle.js
+ * https://sizzlejs.com/
+ *
+ * Copyright OpenJS Foundation and other contributors
+ * Released under the MIT license
+ * https://jquery.org/license
+ */
+( function( global, factory ) {
+
+	"use strict";
+
+	if ( typeof module === "object" && typeof module.exports === "object" ) {
+
+		// For CommonJS and CommonJS-like environments where a proper `window`
+		// is present, execute the factory and get jQuery.
+		// For environments that do not have a `window` with a `document`
+		// (such as Node.js), expose a factory as module.exports.
+		// This accentuates the need for the creation of a real `window`.
+		// e.g. var jQuery = require("jquery")(window);
+		// See ticket #14549 for more info.
+		module.exports = global.document ?
+			factory( global, true ) :
+			function( w ) {
+				if ( !w.document ) {
+					throw new Error( "jQuery requires a window with a document" );
+				}
+				return factory( w );
+			};
+	} else {
+		factory( global );
+	}
+
+// Pass this if window is not defined yet
+} )( typeof window !== "undefined" ? window : this, function( window, noGlobal ) {
+
+// Edge <= 12 - 13+, Firefox <=18 - 45+, IE 10 - 11, Safari 5.1 - 9+, iOS 6 - 9.1
+// throw exceptions when non-strict code (e.g., ASP.NET 4.5) accesses strict mode
+// arguments.callee.caller (trac-13335). But as of jQuery 3.0 (2016), strict mode should be common
+// enough that all such attempts are guarded in a try block.
+"use strict";
+
+var arr = [];
+
+var getProto = Object.getPrototypeOf;
+
+var slice = arr.slice;
+
+var flat = arr.flat ? function( array ) {
+	return arr.flat.call( array );
+} : function( array ) {
+	return arr.concat.apply( [], array );
+};
+
+
+var push = arr.push;
+
+var indexOf = arr.indexOf;
+
+var class2type = {};
+
+var toString = class2type.toString;
+
+var hasOwn = class2type.hasOwnProperty;
+
+var fnToString = hasOwn.toString;
+
+var ObjectFunctionString = fnToString.call( Object );
+
+var support = {};
+
+var isFunction = function isFunction( obj ) {
+
+		// Support: Chrome <=57, Firefox <=52
+		// In some browsers, typeof returns "function" for HTML <object> elements
+		// (i.e., `typeof document.createElement( "object" ) === "function"`).
+		// We don't want to classify *any* DOM node as a function.
+		// Support: QtWeb <=3.8.5, WebKit <=534.34, wkhtmltopdf tool <=0.12.5
+		// Plus for old WebKit, typeof returns "function" for HTML collections
+		// (e.g., `typeof document.getElementsByTagName("div") === "function"`). (gh-4756)
+		return typeof obj === "function" && typeof obj.nodeType !== "number" &&
+			typeof obj.item !== "function";
+	};
+
+
+var isWindow = function isWindow( obj ) {
+		return obj != null && obj === obj.window;
+	};
+
+
+var document = window.document;
+
+
+
+	var preservedScriptAttributes = {
+		type: true,
+		src: true,
+		nonce: true,
+		noModule: true
+	};
+
+	function DOMEval( code, node, doc ) {
+		doc = doc || document;
+
+		var i, val,
+			script = doc.createElement( "script" );
+
+		script.text = code;
+		if ( node ) {
+			for ( i in preservedScriptAttributes ) {
+
+				// Support: Firefox 64+, Edge 18+
+				// Some browsers don't support the "nonce" property on scripts.
+				// On the other hand, just using `getAttribute` is not enough as
+				// the `nonce` attribute is reset to an empty string whenever it
+				// becomes browsing-context connected.
+				// See https://github.com/whatwg/html/issues/2369
+				// See https://html.spec.whatwg.org/#nonce-attributes
+				// The `node.getAttribute` check was added for the sake of
+				// `jQuery.globalEval` so that it can fake a nonce-containing node
+				// via an object.
+				val = node[ i ] || node.getAttribute && node.getAttribute( i );
+				if ( val ) {
+					script.setAttribute( i, val );
+				}
+			}
+		}
+		doc.head.appendChild( script ).parentNode.removeChild( script );
+	}
+
+
+function toType( obj ) {
+	if ( obj == null ) {
+		return obj + "";
+	}
+
+	// Support: Android <=2.3 only (functionish RegExp)
+	return typeof obj === "object" || typeof obj === "function" ?
+		class2type[ toString.call( obj ) ] || "object" :
+		typeof obj;
+}
+/* global Symbol */
+// Defining this global in .eslintrc.json would create a danger of using the global
+// unguarded in another place, it seems safer to define global only for this module
+
+
+
+var
+	version = "3.6.0",
+
+	// Define a local copy of jQuery
+	jQuery = function( selector, context ) {
+
+		// The jQuery object is actually just the init constructor 'enhanced'
+		// Need init if jQuery is called (just allow error to be thrown if not included)
+		return new jQuery.fn.init( selector, context );
+	};
+
+jQuery.fn = jQuery.prototype = {
+
+	// The current version of jQuery being used
+	jquery: version,
+
+	constructor: jQuery,
+
+	// The default length of a jQuery object is 0
+	length: 0,
+
+	toArray: function() {
+		return slice.call( this );
+	},
+
+	// Get the Nth element in the matched element set OR
+	// Get the whole matched element set as a clean array
+	get: function( num ) {
+
+		// Return all the elements in a clean array
+		if ( num == null ) {
+			return slice.call( this );
+		}
+
+		// Return just the one element from the set
+		return num < 0 ? this[ num + this.length ] : this[ num ];
+	},
+
+	// Take an array of elements and push it onto the stack
+	// (returning the new matched element set)
+	pushStack: function( elems ) {
+
+		// Build a new jQuery matched element set
+		var ret = jQuery.merge( this.constructor(), elems );
+
+		// Add the old object onto the stack (as a reference)
+		ret.prevObject = this;
+
+		// Return the newly-formed element set
+		return ret;
+	},
+
+	// Execute a callback for every element in the matched set.
+	each: function( callback ) {
+		return jQuery.each( this, callback );
+	},
+
+	map: function( callback ) {
+		return this.pushStack( jQuery.map( this, function( elem, i ) {
+			return callback.call( elem, i, elem );
+		} ) );
+	},
+
+	slice: function() {
+		return this.pushStack( slice.apply( this, arguments ) );
+	},
+
+	first: function() {
+		return this.eq( 0 );
+	},
+
+	last: function() {
+		return this.eq( -1 );
+	},
+
+	even: function() {
+		return this.pushStack( jQuery.grep( this, function( _elem, i ) {
+			return ( i + 1 ) % 2;
+		} ) );
+	},
+
+	odd: function() {
+		return this.pushStack( jQuery.grep( this, function( _elem, i ) {
+			return i % 2;
+		} ) );
+	},
+
+	eq: function( i ) {
+		var len = this.length,
+			j = +i + ( i < 0 ? len : 0 );
+		return this.pushStack( j >= 0 && j < len ? [ this[ j ] ] : [] );
+	},
+
+	end: function() {
+		return this.prevObject || this.constructor();
+	},
+
+	// For internal use only.
+	// Behaves like an Array's method, not like a jQuery method.
+	push: push,
+	sort: arr.sort,
+	splice: arr.splice
+};
+
+jQuery.extend = jQuery.fn.extend = function() {
+	var options, name, src, copy, copyIsArray, clone,
+		target = arguments[ 0 ] || {},
+		i = 1,
+		length = arguments.length,
+		deep = false;
+
+	// Handle a deep copy situation
+	if ( typeof target === "boolean" ) {
+		deep = target;
+
+		// Skip the boolean and the target
+		target = arguments[ i ] || {};
+		i++;
+	}
+
+	// Handle case when target is a string or something (possible in deep copy)
+	if ( typeof target !== "object" && !isFunction( target ) ) {
+		target = {};
+	}
+
+	// Extend jQuery itself if only one argument is passed
+	if ( i === length ) {
+		target = this;
+		i--;
+	}
+
+	for ( ; i < length; i++ ) {
+
+		// Only deal with non-null/undefined values
+		if ( ( options = arguments[ i ] ) != null ) {
+
+			// Extend the base object
+			for ( name in options ) {
+				copy = options[ name ];
+
+				// Prevent Object.prototype pollution
+				// Prevent never-ending loop
+				if ( name === "__proto__" || target === copy ) {
+					continue;
+				}
+
+				// Recurse if we're merging plain objects or arrays
+				if ( deep && copy && ( jQuery.isPlainObject( copy ) ||
+					( copyIsArray = Array.isArray( copy ) ) ) ) {
+					src = target[ name ];
+
+					// Ensure proper type for the source value
+					if ( copyIsArray && !Array.isArray( src ) ) {
+						clone = [];
+					} else if ( !copyIsArray && !jQuery.isPlainObject( src ) ) {
+						clone = {};
+					} else {
+						clone = src;
+					}
+					copyIsArray = false;
+
+					// Never move original objects, clone them
+					target[ name ] = jQuery.extend( deep, clone, copy );
+
+				// Don't bring in undefined values
+				} else if ( copy !== undefined ) {
+					target[ name ] = copy;
+				}
+			}
+		}
+	}
+
+	// Return the modified object
+	return target;
+};
+
+jQuery.extend( {
+
+	// Unique for each copy of jQuery on the page
+	expando: "jQuery" + ( version + Math.random() ).replace( /\D/g, "" ),
+
+	// Assume jQuery is ready without the ready module
+	isReady: true,
+
+	error: function( msg ) {
+		throw new Error( msg );
+	},
+
+	noop: function() {},
+
+	isPlainObject: function( obj ) {
+		var proto, Ctor;
+
+		// Detect obvious negatives
+		// Use toString instead of jQuery.type to catch host objects
+		if ( !obj || toString.call( obj ) !== "[object Object]" ) {
+			return false;
+		}
+
+		proto = getProto( obj );
+
+		// Objects with no prototype (e.g., `Object.create( null )`) are plain
+		if ( !proto ) {
+			return true;
+		}
+
+		// Objects with prototype are plain iff they were constructed by a global Object function
+		Ctor = hasOwn.call( proto, "constructor" ) && proto.constructor;
+		return typeof Ctor === "function" && fnToString.call( Ctor ) === ObjectFunctionString;
+	},
+
+	isEmptyObject: function( obj ) {
+		var name;
+
+		for ( name in obj ) {
+			return false;
+		}
+		return true;
+	},
+
+	// Evaluates a script in a provided context; falls back to the global one
+	// if not specified.
+	globalEval: function( code, options, doc ) {
+		DOMEval( code, { nonce: options && options.nonce }, doc );
+	},
+
+	each: function( obj, callback ) {
+		var length, i = 0;
+
+		if ( isArrayLike( obj ) ) {
+			length = obj.length;
+			for ( ; i < length; i++ ) {
+				if ( callback.call( obj[ i ], i, obj[ i ] ) === false ) {
+					break;
+				}
+			}
+		} else {
+			for ( i in obj ) {
+				if ( callback.call( obj[ i ], i, obj[ i ] ) === false ) {
+					break;
+				}
+			}
+		}
+
+		return obj;
+	},
+
+	// results is for internal usage only
+	makeArray: function( arr, results ) {
+		var ret = results || [];
+
+		if ( arr != null ) {
+			if ( isArrayLike( Object( arr ) ) ) {
+				jQuery.merge( ret,
+					typeof arr === "string" ?
+						[ arr ] : arr
+				);
+			} else {
+				push.call( ret, arr );
+			}
+		}
+
+		return ret;
+	},
+
+	inArray: function( elem, arr, i ) {
+		return arr == null ? -1 : indexOf.call( arr, elem, i );
+	},
+
+	// Support: Android <=4.0 only, PhantomJS 1 only
+	// push.apply(_, arraylike) throws on ancient WebKit
+	merge: function( first, second ) {
+		var len = +second.length,
+			j = 0,
+			i = first.length;
+
+		for ( ; j < len; j++ ) {
+			first[ i++ ] = second[ j ];
+		}
+
+		first.length = i;
+
+		return first;
+	},
+
+	grep: function( elems, callback, invert ) {
+		var callbackInverse,
+			matches = [],
+			i = 0,
+			length = elems.length,
+			callbackExpect = !invert;
+
+		// Go through the array, only saving the items
+		// that pass the validator function
+		for ( ; i < length; i++ ) {
+			callbackInverse = !callback( elems[ i ], i );
+			if ( callbackInverse !== callbackExpect ) {
+				matches.push( elems[ i ] );
+			}
+		}
+
+		return matches;
+	},
+
+	// arg is for internal usage only
+	map: function( elems, callback, arg ) {
+		var length, value,
+			i = 0,
+			ret = [];
+
+		// Go through the array, translating each of the items to their new values
+		if ( isArrayLike( elems ) ) {
+			length = elems.length;
+			for ( ; i < length; i++ ) {
+				value = callback( elems[ i ], i, arg );
+
+				if ( value != null ) {
+					ret.push( value );
+				}
+			}
+
+		// Go through every key on the object,
+		} else {
+			for ( i in elems ) {
+				value = callback( elems[ i ], i, arg );
+
+				if ( value != null ) {
+					ret.push( value );
+				}
+			}
+		}
+
+		// Flatten any nested arrays
+		return flat( ret );
+	},
+
+	// A global GUID counter for objects
+	guid: 1,
+
+	// jQuery.support is not used in Core but other projects attach their
+	// properties to it so it needs to exist.
+	support: support
+} );
+
+if ( typeof Symbol === "function" ) {
+	jQuery.fn[ Symbol.iterator ] = arr[ Symbol.iterator ];
+}
+
+// Populate the class2type map
+jQuery.each( "Boolean Number String Function Array Date RegExp Object Error Symbol".split( " " ),
+	function( _i, name ) {
+		class2type[ "[object " + name + "]" ] = name.toLowerCase();
+	} );
+
+function isArrayLike( obj ) {
+
+	// Support: real iOS 8.2 only (not reproducible in simulator)
+	// `in` check used to prevent JIT error (gh-2145)
+	// hasOwn isn't used here due to false negatives
+	// regarding Nodelist length in IE
+	var length = !!obj && "length" in obj && obj.length,
+		type = toType( obj );
+
+	if ( isFunction( obj ) || isWindow( obj ) ) {
+		return false;
+	}
+
+	return type === "array" || length === 0 ||
+		typeof length === "number" && length > 0 && ( length - 1 ) in obj;
+}
+var Sizzle =
+/*!
+ * Sizzle CSS Selector Engine v2.3.6
+ * https://sizzlejs.com/
+ *
+ * Copyright JS Foundation and other contributors
+ * Released under the MIT license
+ * https://js.foundation/
+ *
+ * Date: 2021-02-16
+ */
+( function( window ) {
+var i,
+	support,
+	Expr,
+	getText,
+	isXML,
+	tokenize,
+	compile,
+	select,
+	outermostContext,
+	sortInput,
+	hasDuplicate,
+
+	// Local document vars
+	setDocument,
+	document,
+	docElem,
+	documentIsHTML,
+	rbuggyQSA,
+	rbuggyMatches,
+	matches,
+	contains,
+
+	// Instance-specific data
+	expando = "sizzle" + 1 * new Date(),
+	preferredDoc = window.document,
+	dirruns = 0,
+	done = 0,
+	classCache = createCache(),
+	tokenCache = createCache(),
+	compilerCache = createCache(),
+	nonnativeSelectorCache = createCache(),
+	sortOrder = function( a, b ) {
+		if ( a === b ) {
+			hasDuplicate = true;
+		}
+		return 0;
+	},
+
+	// Instance methods
+	hasOwn = ( {} ).hasOwnProperty,
+	arr = [],
+	pop = arr.pop,
+	pushNative = arr.push,
+	push = arr.push,
+	slice = arr.slice,
+
+	// Use a stripped-down indexOf as it's faster than native
+	// https://jsperf.com/thor-indexof-vs-for/5
+	indexOf = function( list, elem ) {
+		var i = 0,
+			len = list.length;
+		for ( ; i < len; i++ ) {
+			if ( list[ i ] === elem ) {
+				return i;
+			}
+		}
+		return -1;
+	},
+
+	booleans = "checked|selected|async|autofocus|autoplay|controls|defer|disabled|hidden|" +
+		"ismap|loop|multiple|open|readonly|required|scoped",
+
+	// Regular expressions
+
+	// http://www.w3.org/TR/css3-selectors/#whitespace
+	whitespace = "[\\x20\\t\\r\\n\\f]",
+
+	// https://www.w3.org/TR/css-syntax-3/#ident-token-diagram
+	identifier = "(?:\\\\[\\da-fA-F]{1,6}" + whitespace +
+		"?|\\\\[^\\r\\n\\f]|[\\w-]|[^\0-\\x7f])+",
+
+	// Attribute selectors: http://www.w3.org/TR/selectors/#attribute-selectors
+	attributes = "\\[" + whitespace + "*(" + identifier + ")(?:" + whitespace +
+
+		// Operator (capture 2)
+		"*([*^$|!~]?=)" + whitespace +
+
+		// "Attribute values must be CSS identifiers [capture 5]
+		// or strings [capture 3 or capture 4]"
+		"*(?:'((?:\\\\.|[^\\\\'])*)'|\"((?:\\\\.|[^\\\\\"])*)\"|(" + identifier + "))|)" +
+		whitespace + "*\\]",
+
+	pseudos = ":(" + identifier + ")(?:\\((" +
+
+		// To reduce the number of selectors needing tokenize in the preFilter, prefer arguments:
+		// 1. quoted (capture 3; capture 4 or capture 5)
+		"('((?:\\\\.|[^\\\\'])*)'|\"((?:\\\\.|[^\\\\\"])*)\")|" +
+
+		// 2. simple (capture 6)
+		"((?:\\\\.|[^\\\\()[\\]]|" + attributes + ")*)|" +
+
+		// 3. anything else (capture 2)
+		".*" +
+		")\\)|)",
+
+	// Leading and non-escaped trailing whitespace, capturing some non-whitespace characters preceding the latter
+	rwhitespace = new RegExp( whitespace + "+", "g" ),
+	rtrim = new RegExp( "^" + whitespace + "+|((?:^|[^\\\\])(?:\\\\.)*)" +
+		whitespace + "+$", "g" ),
+
+	rcomma = new RegExp( "^" + whitespace + "*," + whitespace + "*" ),
+	rcombinators = new RegExp( "^" + whitespace + "*([>+~]|" + whitespace + ")" + whitespace +
+		"*" ),
+	rdescend = new RegExp( whitespace + "|>" ),
+
+	rpseudo = new RegExp( pseudos ),
+	ridentifier = new RegExp( "^" + identifier + "$" ),
+
+	matchExpr = {
+		"ID": new RegExp( "^#(" + identifier + ")" ),
+		"CLASS": new RegExp( "^\\.(" + identifier + ")" ),
+		"TAG": new RegExp( "^(" + identifier + "|[*])" ),
+		"ATTR": new RegExp( "^" + attributes ),
+		"PSEUDO": new RegExp( "^" + pseudos ),
+		"CHILD": new RegExp( "^:(only|first|last|nth|nth-last)-(child|of-type)(?:\\(" +
+			whitespace + "*(even|odd|(([+-]|)(\\d*)n|)" + whitespace + "*(?:([+-]|)" +
+			whitespace + "*(\\d+)|))" + whitespace + "*\\)|)", "i" ),
+		"bool": new RegExp( "^(?:" + booleans + ")$", "i" ),
+
+		// For use in libraries implementing .is()
+		// We use this for POS matching in `select`
+		"needsContext": new RegExp( "^" + whitespace +
+			"*[>+~]|:(even|odd|eq|gt|lt|nth|first|last)(?:\\(" + whitespace +
+			"*((?:-\\d)?\\d*)" + whitespace + "*\\)|)(?=[^-]|$)", "i" )
+	},
+
+	rhtml = /HTML$/i,
+	rinputs = /^(?:input|select|textarea|button)$/i,
+	rheader = /^h\d$/i,
+
+	rnative = /^[^{]+\{\s*\[native \w/,
+
+	// Easily-parseable/retrievable ID or TAG or CLASS selectors
+	rquickExpr = /^(?:#([\w-]+)|(\w+)|\.([\w-]+))$/,
+
+	rsibling = /[+~]/,
+
+	// CSS escapes
+	// http://www.w3.org/TR/CSS21/syndata.html#escaped-characters
+	runescape = new RegExp( "\\\\[\\da-fA-F]{1,6}" + whitespace + "?|\\\\([^\\r\\n\\f])", "g" ),
+	funescape = function( escape, nonHex ) {
+		var high = "0x" + escape.slice( 1 ) - 0x10000;
+
+		return nonHex ?
+
+			// Strip the backslash prefix from a non-hex escape sequence
+			nonHex :
+
+			// Replace a hexadecimal escape sequence with the encoded Unicode code point
+			// Support: IE <=11+
+			// For values outside the Basic Multilingual Plane (BMP), manually construct a
+			// surrogate pair
+			high < 0 ?
+				String.fromCharCode( high + 0x10000 ) :
+				String.fromCharCode( high >> 10 | 0xD800, high & 0x3FF | 0xDC00 );
+	},
+
+	// CSS string/identifier serialization
+	// https://drafts.csswg.org/cssom/#common-serializing-idioms
+	rcssescape = /([\0-\x1f\x7f]|^-?\d)|^-$|[^\0-\x1f\x7f-\uFFFF\w-]/g,
+	fcssescape = function( ch, asCodePoint ) {
+		if ( asCodePoint ) {
+
+			// U+0000 NULL becomes U+FFFD REPLACEMENT CHARACTER
+			if ( ch === "\0" ) {
+				return "\uFFFD";
+			}
+
+			// Control characters and (dependent upon position) numbers get escaped as code points
+			return ch.slice( 0, -1 ) + "\\" +
+				ch.charCodeAt( ch.length - 1 ).toString( 16 ) + " ";
+		}
+
+		// Other potentially-special ASCII characters get backslash-escaped
+		return "\\" + ch;
+	},
+
+	// Used for iframes
+	// See setDocument()
+	// Removing the function wrapper causes a "Permission Denied"
+	// error in IE
+	unloadHandler = function() {
+		setDocument();
+	},
+
+	inDisabledFieldset = addCombinator(
+		function( elem ) {
+			return elem.disabled === true && elem.nodeName.toLowerCase() === "fieldset";
+		},
+		{ dir: "parentNode", next: "legend" }
+	);
+
+// Optimize for push.apply( _, NodeList )
+try {
+	push.apply(
+		( arr = slice.call( preferredDoc.childNodes ) ),
+		preferredDoc.childNodes
+	);
+
+	// Support: Android<4.0
+	// Detect silently failing push.apply
+	// eslint-disable-next-line no-unused-expressions
+	arr[ preferredDoc.childNodes.length ].nodeType;
+} catch ( e ) {
+	push = { apply: arr.length ?
+
+		// Leverage slice if possible
+		function( target, els ) {
+			pushNative.apply( target, slice.call( els ) );
+		} :
+
+		// Support: IE<9
+		// Otherwise append directly
+		function( target, els ) {
+			var j = target.length,
+				i = 0;
+
+			// Can't trust NodeList.length
+			while ( ( target[ j++ ] = els[ i++ ] ) ) {}
+			target.length = j - 1;
+		}
+	};
+}
+
+function Sizzle( selector, context, results, seed ) {
+	var m, i, elem, nid, match, groups, newSelector,
+		newContext = context && context.ownerDocument,
+
+		// nodeType defaults to 9, since context defaults to document
+		nodeType = context ? context.nodeType : 9;
+
+	results = results || [];
+
+	// Return early from calls with invalid selector or context
+	if ( typeof selector !== "string" || !selector ||
+		nodeType !== 1 && nodeType !== 9 && nodeType !== 11 ) {
+
+		return results;
+	}
+
+	// Try to shortcut find operations (as opposed to filters) in HTML documents
+	if ( !seed ) {
+		setDocument( context );
+		context = context || document;
+
+		if ( documentIsHTML ) {
+
+			// If the selector is sufficiently simple, try using a "get*By*" DOM method
+			// (excepting DocumentFragment context, where the methods don't exist)
+			if ( nodeType !== 11 && ( match = rquickExpr.exec( selector ) ) ) {
+
+				// ID selector
+				if ( ( m = match[ 1 ] ) ) {
+
+					// Document context
+					if ( nodeType === 9 ) {
+						if ( ( elem = context.getElementById( m ) ) ) {
+
+							// Support: IE, Opera, Webkit
+							// TODO: identify versions
+							// getElementById can match elements by name instead of ID
+							if ( elem.id === m ) {
+								results.push( elem );
+								return results;
+							}
+						} else {
+							return results;
+						}
+
+					// Element context
+					} else {
+
+						// Support: IE, Opera, Webkit
+						// TODO: identify versions
+						// getElementById can match elements by name instead of ID
+						if ( newContext && ( elem = newContext.getElementById( m ) ) &&
+							contains( context, elem ) &&
+							elem.id === m ) {
+
+							results.push( elem );
+							return results;
+						}
+					}
+
+				// Type selector
+				} else if ( match[ 2 ] ) {
+					push.apply( results, context.getElementsByTagName( selector ) );
+					return results;
+
+				// Class selector
+				} else if ( ( m = match[ 3 ] ) && support.getElementsByClassName &&
+					context.getElementsByClassName ) {
+
+					push.apply( results, context.getElementsByClassName( m ) );
+					return results;
+				}
+			}
+
+			// Take advantage of querySelectorAll
+			if ( support.qsa &&
+				!nonnativeSelectorCache[ selector + " " ] &&
+				( !rbuggyQSA || !rbuggyQSA.test( selector ) ) &&
+
+				// Support: IE 8 only
+				// Exclude object elements
+				( nodeType !== 1 || context.nodeName.toLowerCase() !== "object" ) ) {
+
+				newSelector = selector;
+				newContext = context;
+
+				// qSA considers elements outside a scoping root when evaluating child or
+				// descendant combinators, which is not what we want.
+				// In such cases, we work around the behavior by prefixing every selector in the
+				// list with an ID selector referencing the scope context.
+				// The technique has to be used as well when a leading combinator is used
+				// as such selectors are not recognized by querySelectorAll.
+				// Thanks to Andrew Dupont for this technique.
+				if ( nodeType === 1 &&
+					( rdescend.test( selector ) || rcombinators.test( selector ) ) ) {
+
+					// Expand context for sibling selectors
+					newContext = rsibling.test( selector ) && testContext( context.parentNode ) ||
+						context;
+
+					// We can use :scope instead of the ID hack if the browser
+					// supports it & if we're not changing the context.
+					if ( newContext !== context || !support.scope ) {
+
+						// Capture the context ID, setting it first if necessary
+						if ( ( nid = context.getAttribute( "id" ) ) ) {
+							nid = nid.replace( rcssescape, fcssescape );
+						} else {
+							context.setAttribute( "id", ( nid = expando ) );
+						}
+					}
+
+					// Prefix every selector in the list
+					groups = tokenize( selector );
+					i = groups.length;
+					while ( i-- ) {
+						groups[ i ] = ( nid ? "#" + nid : ":scope" ) + " " +
+							toSelector( groups[ i ] );
+					}
+					newSelector = groups.join( "," );
+				}
+
+				try {
+					push.apply( results,
+						newContext.querySelectorAll( newSelector )
+					);
+					return results;
+				} catch ( qsaError ) {
+					nonnativeSelectorCache( selector, true );
+				} finally {
+					if ( nid === expando ) {
+						context.removeAttribute( "id" );
+					}
+				}
+			}
+		}
+	}
+
+	// All others
+	return select( selector.replace( rtrim, "$1" ), context, results, seed );
+}
+
+/**
+ * Create key-value caches of limited size
+ * @returns {function(string, object)} Returns the Object data after storing it on itself with
+ *	property name the (space-suffixed) string and (if the cache is larger than Expr.cacheLength)
+ *	deleting the oldest entry
+ */
+function createCache() {
+	var keys = [];
+
+	function cache( key, value ) {
+
+		// Use (key + " ") to avoid collision with native prototype properties (see Issue #157)
+		if ( keys.push( key + " " ) > Expr.cacheLength ) {
+
+			// Only keep the most recent entries
+			delete cache[ keys.shift() ];
+		}
+		return ( cache[ key + " " ] = value );
+	}
+	return cache;
+}
+
+/**
+ * Mark a function for special use by Sizzle
+ * @param {Function} fn The function to mark
+ */
+function markFunction( fn ) {
+	fn[ expando ] = true;
+	return fn;
+}
+
+/**
+ * Support testing using an element
+ * @param {Function} fn Passed the created element and returns a boolean result
+ */
+function assert( fn ) {
+	var el = document.createElement( "fieldset" );
+
+	try {
+		return !!fn( el );
+	} catch ( e ) {
+		return false;
+	} finally {
+
+		// Remove from its parent by default
+		if ( el.parentNode ) {
+			el.parentNode.removeChild( el );
+		}
+
+		// release memory in IE
+		el = null;
+	}
+}
+
+/**
+ * Adds the same handler for all of the specified attrs
+ * @param {String} attrs Pipe-separated list of attributes
+ * @param {Function} handler The method that will be applied
+ */
+function addHandle( attrs, handler ) {
+	var arr = attrs.split( "|" ),
+		i = arr.length;
+
+	while ( i-- ) {
+		Expr.attrHandle[ arr[ i ] ] = handler;
+	}
+}
+
+/**
+ * Checks document order of two siblings
+ * @param {Element} a
+ * @param {Element} b
+ * @returns {Number} Returns less than 0 if a precedes b, greater than 0 if a follows b
+ */
+function siblingCheck( a, b ) {
+	var cur = b && a,
+		diff = cur && a.nodeType === 1 && b.nodeType === 1 &&
+			a.sourceIndex - b.sourceIndex;
+
+	// Use IE sourceIndex if available on both nodes
+	if ( diff ) {
+		return diff;
+	}
+
+	// Check if b follows a
+	if ( cur ) {
+		while ( ( cur = cur.nextSibling ) ) {
+			if ( cur === b ) {
+				return -1;
+			}
+		}
+	}
+
+	return a ? 1 : -1;
+}
+
+/**
+ * Returns a function to use in pseudos for input types
+ * @param {String} type
+ */
+function createInputPseudo( type ) {
+	return function( elem ) {
+		var name = elem.nodeName.toLowerCase();
+		return name === "input" && elem.type === type;
+	};
+}
+
+/**
+ * Returns a function to use in pseudos for buttons
+ * @param {String} type
+ */
+function createButtonPseudo( type ) {
+	return function( elem ) {
+		var name = elem.nodeName.toLowerCase();
+		return ( name === "input" || name === "button" ) && elem.type === type;
+	};
+}
+
+/**
+ * Returns a function to use in pseudos for :enabled/:disabled
+ * @param {Boolean} disabled true for :disabled; false for :enabled
+ */
+function createDisabledPseudo( disabled ) {
+
+	// Known :disabled false positives: fieldset[disabled] > legend:nth-of-type(n+2) :can-disable
+	return function( elem ) {
+
+		// Only certain elements can match :enabled or :disabled
+		// https://html.spec.whatwg.org/multipage/scripting.html#selector-enabled
+		// https://html.spec.whatwg.org/multipage/scripting.html#selector-disabled
+		if ( "form" in elem ) {
+
+			// Check for inherited disabledness on relevant non-disabled elements:
+			// * listed form-associated elements in a disabled fieldset
+			//   https://html.spec.whatwg.org/multipage/forms.html#category-listed
+			//   https://html.spec.whatwg.org/multipage/forms.html#concept-fe-disabled
+			// * option elements in a disabled optgroup
+			//   https://html.spec.whatwg.org/multipage/forms.html#concept-option-disabled
+			// All such elements have a "form" property.
+			if ( elem.parentNode && elem.disabled === false ) {
+
+				// Option elements defer to a parent optgroup if present
+				if ( "label" in elem ) {
+					if ( "label" in elem.parentNode ) {
+						return elem.parentNode.disabled === disabled;
+					} else {
+						return elem.disabled === disabled;
+					}
+				}
+
+				// Support: IE 6 - 11
+				// Use the isDisabled shortcut property to check for disabled fieldset ancestors
+				return elem.isDisabled === disabled ||
+
+					// Where there is no isDisabled, check manually
+					/* jshint -W018 */
+					elem.isDisabled !== !disabled &&
+					inDisabledFieldset( elem ) === disabled;
+			}
+
+			return elem.disabled === disabled;
+
+		// Try to winnow out elements that can't be disabled before trusting the disabled property.
+		// Some victims get caught in our net (label, legend, menu, track), but it shouldn't
+		// even exist on them, let alone have a boolean value.
+		} else if ( "label" in elem ) {
+			return elem.disabled === disabled;
+		}
+
+		// Remaining elements are neither :enabled nor :disabled
+		return false;
+	};
+}
+
+/**
+ * Returns a function to use in pseudos for positionals
+ * @param {Function} fn
+ */
+function createPositionalPseudo( fn ) {
+	return markFunction( function( argument ) {
+		argument = +argument;
+		return markFunction( function( seed, matches ) {
+			var j,
+				matchIndexes = fn( [], seed.length, argument ),
+				i = matchIndexes.length;
+
+			// Match elements found at the specified indexes
+			while ( i-- ) {
+				if ( seed[ ( j = matchIndexes[ i ] ) ] ) {
+					seed[ j ] = !( matches[ j ] = seed[ j ] );
+				}
+			}
+		} );
+	} );
+}
+
+/**
+ * Checks a node for validity as a Sizzle context
+ * @param {Element|Object=} context
+ * @returns {Element|Object|Boolean} The input node if acceptable, otherwise a falsy value
+ */
+function testContext( context ) {
+	return context && typeof context.getElementsByTagName !== "undefined" && context;
+}
+
+// Expose support vars for convenience
+support = Sizzle.support = {};
+
+/**
+ * Detects XML nodes
+ * @param {Element|Object} elem An element or a document
+ * @returns {Boolean} True iff elem is a non-HTML XML node
+ */
+isXML = Sizzle.isXML = function( elem ) {
+	var namespace = elem && elem.namespaceURI,
+		docElem = elem && ( elem.ownerDocument || elem ).documentElement;
+
+	// Support: IE <=8
+	// Assume HTML when documentElement doesn't yet exist, such as inside loading iframes
+	// https://bugs.jquery.com/ticket/4833
+	return !rhtml.test( namespace || docElem && docElem.nodeName || "HTML" );
+};
+
+/**
+ * Sets document-related variables once based on the current document
+ * @param {Element|Object} [doc] An element or document object to use to set the document
+ * @returns {Object} Returns the current document
+ */
+setDocument = Sizzle.setDocument = function( node ) {
+	var hasCompare, subWindow,
+		doc = node ? node.ownerDocument || node : preferredDoc;
+
+	// Return early if doc is invalid or already selected
+	// Support: IE 11+, Edge 17 - 18+
+	// IE/Edge sometimes throw a "Permission denied" error when strict-comparing
+	// two documents; shallow comparisons work.
+	// eslint-disable-next-line eqeqeq
+	if ( doc == document || doc.nodeType !== 9 || !doc.documentElement ) {
+		return document;
+	}
+
+	// Update global variables
+	document = doc;
+	docElem = document.documentElement;
+	documentIsHTML = !isXML( document );
+
+	// Support: IE 9 - 11+, Edge 12 - 18+
+	// Accessing iframe documents after unload throws "permission denied" errors (jQuery #13936)
+	// Support: IE 11+, Edge 17 - 18+
+	// IE/Edge sometimes throw a "Permission denied" error when strict-comparing
+	// two documents; shallow comparisons work.
+	// eslint-disable-next-line eqeqeq
+	if ( preferredDoc != document &&
+		( subWindow = document.defaultView ) && subWindow.top !== subWindow ) {
+
+		// Support: IE 11, Edge
+		if ( subWindow.addEventListener ) {
+			subWindow.addEventListener( "unload", unloadHandler, false );
+
+		// Support: IE 9 - 10 only
+		} else if ( subWindow.attachEvent ) {
+			subWindow.attachEvent( "onunload", unloadHandler );
+		}
+	}
+
+	// Support: IE 8 - 11+, Edge 12 - 18+, Chrome <=16 - 25 only, Firefox <=3.6 - 31 only,
+	// Safari 4 - 5 only, Opera <=11.6 - 12.x only
+	// IE/Edge & older browsers don't support the :scope pseudo-class.
+	// Support: Safari 6.0 only
+	// Safari 6.0 supports :scope but it's an alias of :root there.
+	support.scope = assert( function( el ) {
+		docElem.appendChild( el ).appendChild( document.createElement( "div" ) );
+		return typeof el.querySelectorAll !== "undefined" &&
+			!el.querySelectorAll( ":scope fieldset div" ).length;
+	} );
+
+	/* Attributes
+	---------------------------------------------------------------------- */
+
+	// Support: IE<8
+	// Verify that getAttribute really returns attributes and not properties
+	// (excepting IE8 booleans)
+	support.attributes = assert( function( el ) {
+		el.className = "i";
+		return !el.getAttribute( "className" );
+	} );
+
+	/* getElement(s)By*
+	---------------------------------------------------------------------- */
+
+	// Check if getElementsByTagName("*") returns only elements
+	support.getElementsByTagName = assert( function( el ) {
+		el.appendChild( document.createComment( "" ) );
+		return !el.getElementsByTagName( "*" ).length;
+	} );
+
+	// Support: IE<9
+	support.getElementsByClassName = rnative.test( document.getElementsByClassName );
+
+	// Support: IE<10
+	// Check if getElementById returns elements by name
+	// The broken getElementById methods don't pick up programmatically-set names,
+	// so use a roundabout getElementsByName test
+	support.getById = assert( function( el ) {
+		docElem.appendChild( el ).id = expando;
+		return !document.getElementsByName || !document.getElementsByName( expando ).length;
+	} );
+
+	// ID filter and find
+	if ( support.getById ) {
+		Expr.filter[ "ID" ] = function( id ) {
+			var attrId = id.replace( runescape, funescape );
+			return function( elem ) {
+				return elem.getAttribute( "id" ) === attrId;
+			};
+		};
+		Expr.find[ "ID" ] = function( id, context ) {
+			if ( typeof context.getElementById !== "undefined" && documentIsHTML ) {
+				var elem = context.getElementById( id );
+				return elem ? [ elem ] : [];
+			}
+		};
+	} else {
+		Expr.filter[ "ID" ] =  function( id ) {
+			var attrId = id.replace( runescape, funescape );
+			return function( elem ) {
+				var node = typeof elem.getAttributeNode !== "undefined" &&
+					elem.getAttributeNode( "id" );
+				return node && node.value === attrId;
+			};
+		};
+
+		// Support: IE 6 - 7 only
+		// getElementById is not reliable as a find shortcut
+		Expr.find[ "ID" ] = function( id, context ) {
+			if ( typeof context.getElementById !== "undefined" && documentIsHTML ) {
+				var node, i, elems,
+					elem = context.getElementById( id );
+
+				if ( elem ) {
+
+					// Verify the id attribute
+					node = elem.getAttributeNode( "id" );
+					if ( node && node.value === id ) {
+						return [ elem ];
+					}
+
+					// Fall back on getElementsByName
+					elems = context.getElementsByName( id );
+					i = 0;
+					while ( ( elem = elems[ i++ ] ) ) {
+						node = elem.getAttributeNode( "id" );
+						if ( node && node.value === id ) {
+							return [ elem ];
+						}
+					}
+				}
+
+				return [];
+			}
+		};
+	}
+
+	// Tag
+	Expr.find[ "TAG" ] = support.getElementsByTagName ?
+		function( tag, context ) {
+			if ( typeof context.getElementsByTagName !== "undefined" ) {
+				return context.getElementsByTagName( tag );
+
+			// DocumentFragment nodes don't have gEBTN
+			} else if ( support.qsa ) {
+				return context.querySelectorAll( tag );
+			}
+		} :
+
+		function( tag, context ) {
+			var elem,
+				tmp = [],
+				i = 0,
+
+				// By happy coincidence, a (broken) gEBTN appears on DocumentFragment nodes too
+				results = context.getElementsByTagName( tag );
+
+			// Filter out possible comments
+			if ( tag === "*" ) {
+				while ( ( elem = results[ i++ ] ) ) {
+					if ( elem.nodeType === 1 ) {
+						tmp.push( elem );
+					}
+				}
+
+				return tmp;
+			}
+			return results;
+		};
+
+	// Class
+	Expr.find[ "CLASS" ] = support.getElementsByClassName && function( className, context ) {
+		if ( typeof context.getElementsByClassName !== "undefined" && documentIsHTML ) {
+			return context.getElementsByClassName( className );
+		}
+	};
+
+	/* QSA/matchesSelector
+	---------------------------------------------------------------------- */
+
+	// QSA and matchesSelector support
+
+	// matchesSelector(:active) reports false when true (IE9/Opera 11.5)
+	rbuggyMatches = [];
+
+	// qSa(:focus) reports false when true (Chrome 21)
+	// We allow this because of a bug in IE8/9 that throws an error
+	// whenever `document.activeElement` is accessed on an iframe
+	// So, we allow :focus to pass through QSA all the time to avoid the IE error
+	// See https://bugs.jquery.com/ticket/13378
+	rbuggyQSA = [];
+
+	if ( ( support.qsa = rnative.test( document.querySelectorAll ) ) ) {
+
+		// Build QSA regex
+		// Regex strategy adopted from Diego Perini
+		assert( function( el ) {
+
+			var input;
+
+			// Select is set to empty string on purpose
+			// This is to test IE's treatment of not explicitly
+			// setting a boolean content attribute,
+			// since its presence should be enough
+			// https://bugs.jquery.com/ticket/12359
+			docElem.appendChild( el ).innerHTML = "<a id='" + expando + "'></a>" +
+				"<select id='" + expando + "-\r\\' msallowcapture=''>" +
+				"<option selected=''></option></select>";
+
+			// Support: IE8, Opera 11-12.16
+			// Nothing should be selected when empty strings follow ^= or $= or *=
+			// The test attribute must be unknown in Opera but "safe" for WinRT
+			// https://msdn.microsoft.com/en-us/library/ie/hh465388.aspx#attribute_section
+			if ( el.querySelectorAll( "[msallowcapture^='']" ).length ) {
+				rbuggyQSA.push( "[*^$]=" + whitespace + "*(?:''|\"\")" );
+			}
+
+			// Support: IE8
+			// Boolean attributes and "value" are not treated correctly
+			if ( !el.querySelectorAll( "[selected]" ).length ) {
+				rbuggyQSA.push( "\\[" + whitespace + "*(?:value|" + booleans + ")" );
+			}
+
+			// Support: Chrome<29, Android<4.4, Safari<7.0+, iOS<7.0+, PhantomJS<1.9.8+
+			if ( !el.querySelectorAll( "[id~=" + expando + "-]" ).length ) {
+				rbuggyQSA.push( "~=" );
+			}
+
+			// Support: IE 11+, Edge 15 - 18+
+			// IE 11/Edge don't find elements on a `[name='']` query in some cases.
+			// Adding a temporary attribute to the document before the selection works
+			// around the issue.
+			// Interestingly, IE 10 & older don't seem to have the issue.
+			input = document.createElement( "input" );
+			input.setAttribute( "name", "" );
+			el.appendChild( input );
+			if ( !el.querySelectorAll( "[name='']" ).length ) {
+				rbuggyQSA.push( "\\[" + whitespace + "*name" + whitespace + "*=" +
+					whitespace + "*(?:''|\"\")" );
+			}
+
+			// Webkit/Opera - :checked should return selected option elements
+			// http://www.w3.org/TR/2011/REC-css3-selectors-20110929/#checked
+			// IE8 throws error here and will not see later tests
+			if ( !el.querySelectorAll( ":checked" ).length ) {
+				rbuggyQSA.push( ":checked" );
+			}
+
+			// Support: Safari 8+, iOS 8+
+			// https://bugs.webkit.org/show_bug.cgi?id=136851
+			// In-page `selector#id sibling-combinator selector` fails
+			if ( !el.querySelectorAll( "a#" + expando + "+*" ).length ) {
+				rbuggyQSA.push( ".#.+[+~]" );
+			}
+
+			// Support: Firefox <=3.6 - 5 only
+			// Old Firefox doesn't throw on a badly-escaped identifier.
+			el.querySelectorAll( "\\\f" );
+			rbuggyQSA.push( "[\\r\\n\\f]" );
+		} );
+
+		assert( function( el ) {
+			el.innerHTML = "<a href='' disabled='disabled'></a>" +
+				"<select disabled='disabled'><option/></select>";
+
+			// Support: Windows 8 Native Apps
+			// The type and name attributes are restricted during .innerHTML assignment
+			var input = document.createElement( "input" );
+			input.setAttribute( "type", "hidden" );
+			el.appendChild( input ).setAttribute( "name", "D" );
+
+			// Support: IE8
+			// Enforce case-sensitivity of name attribute
+			if ( el.querySelectorAll( "[name=d]" ).length ) {
+				rbuggyQSA.push( "name" + whitespace + "*[*^$|!~]?=" );
+			}
+
+			// FF 3.5 - :enabled/:disabled and hidden elements (hidden elements are still enabled)
+			// IE8 throws error here and will not see later tests
+			if ( el.querySelectorAll( ":enabled" ).length !== 2 ) {
+				rbuggyQSA.push( ":enabled", ":disabled" );
+			}
+
+			// Support: IE9-11+
+			// IE's :disabled selector does not pick up the children of disabled fieldsets
+			docElem.appendChild( el ).disabled = true;
+			if ( el.querySelectorAll( ":disabled" ).length !== 2 ) {
+				rbuggyQSA.push( ":enabled", ":disabled" );
+			}
+
+			// Support: Opera 10 - 11 only
+			// Opera 10-11 does not throw on post-comma invalid pseudos
+			el.querySelectorAll( "*,:x" );
+			rbuggyQSA.push( ",.*:" );
+		} );
+	}
+
+	if ( ( support.matchesSelector = rnative.test( ( matches = docElem.matches ||
+		docElem.webkitMatchesSelector ||
+		docElem.mozMatchesSelector ||
+		docElem.oMatchesSelector ||
+		docElem.msMatchesSelector ) ) ) ) {
+
+		assert( function( el ) {
+
+			// Check to see if it's possible to do matchesSelector
+			// on a disconnected node (IE 9)
+			support.disconnectedMatch = matches.call( el, "*" );
+
+			// This should fail with an exception
+			// Gecko does not error, returns false instead
+			matches.call( el, "[s!='']:x" );
+			rbuggyMatches.push( "!=", pseudos );
+		} );
+	}
+
+	rbuggyQSA = rbuggyQSA.length && new RegExp( rbuggyQSA.join( "|" ) );
+	rbuggyMatches = rbuggyMatches.length && new RegExp( rbuggyMatches.join( "|" ) );
+
+	/* Contains
+	---------------------------------------------------------------------- */
+	hasCompare = rnative.test( docElem.compareDocumentPosition );
+
+	// Element contains another
+	// Purposefully self-exclusive
+	// As in, an element does not contain itself
+	contains = hasCompare || rnative.test( docElem.contains ) ?
+		function( a, b ) {
+			var adown = a.nodeType === 9 ? a.documentElement : a,
+				bup = b && b.parentNode;
+			return a === bup || !!( bup && bup.nodeType === 1 && (
+				adown.contains ?
+					adown.contains( bup ) :
+					a.compareDocumentPosition && a.compareDocumentPosition( bup ) & 16
+			) );
+		} :
+		function( a, b ) {
+			if ( b ) {
+				while ( ( b = b.parentNode ) ) {
+					if ( b === a ) {
+						return true;
+					}
+				}
+			}
+			return false;
+		};
+
+	/* Sorting
+	---------------------------------------------------------------------- */
+
+	// Document order sorting
+	sortOrder = hasCompare ?
+	function( a, b ) {
+
+		// Flag for duplicate removal
+		if ( a === b ) {
+			hasDuplicate = true;
+			return 0;
+		}
+
+		// Sort on method existence if only one input has compareDocumentPosition
+		var compare = !a.compareDocumentPosition - !b.compareDocumentPosition;
+		if ( compare ) {
+			return compare;
+		}
+
+		// Calculate position if both inputs belong to the same document
+		// Support: IE 11+, Edge 17 - 18+
+		// IE/Edge sometimes throw a "Permission denied" error when strict-comparing
+		// two documents; shallow comparisons work.
+		// eslint-disable-next-line eqeqeq
+		compare = ( a.ownerDocument || a ) == ( b.ownerDocument || b ) ?
+			a.compareDocumentPosition( b ) :
+
+			// Otherwise we know they are disconnected
+			1;
+
+		// Disconnected nodes
+		if ( compare & 1 ||
+			( !support.sortDetached && b.compareDocumentPosition( a ) === compare ) ) {
+
+			// Choose the first element that is related to our preferred document
+			// Support: IE 11+, Edge 17 - 18+
+			// IE/Edge sometimes throw a "Permission denied" error when strict-comparing
+			// two documents; shallow comparisons work.
+			// eslint-disable-next-line eqeqeq
+			if ( a == document || a.ownerDocument == preferredDoc &&
+				contains( preferredDoc, a ) ) {
+				return -1;
+			}
+
+			// Support: IE 11+, Edge 17 - 18+
+			// IE/Edge sometimes throw a "Permission denied" error when strict-comparing
+			// two documents; shallow comparisons work.
+			// eslint-disable-next-line eqeqeq
+			if ( b == document || b.ownerDocument == preferredDoc &&
+				contains( preferredDoc, b ) ) {
+				return 1;
+			}
+
+			// Maintain original order
+			return sortInput ?
+				( indexOf( sortInput, a ) - indexOf( sortInput, b ) ) :
+				0;
+		}
+
+		return compare & 4 ? -1 : 1;
+	} :
+	function( a, b ) {
+
+		// Exit early if the nodes are identical
+		if ( a === b ) {
+			hasDuplicate = true;
+			return 0;
+		}
+
+		var cur,
+			i = 0,
+			aup = a.parentNode,
+			bup = b.parentNode,
+			ap = [ a ],
+			bp = [ b ];
+
+		// Parentless nodes are either documents or disconnected
+		if ( !aup || !bup ) {
+
+			// Support: IE 11+, Edge 17 - 18+
+			// IE/Edge sometimes throw a "Permission denied" error when strict-comparing
+			// two documents; shallow comparisons work.
+			/* eslint-disable eqeqeq */
+			return a == document ? -1 :
+				b == document ? 1 :
+				/* eslint-enable eqeqeq */
+				aup ? -1 :
+				bup ? 1 :
+				sortInput ?
+				( indexOf( sortInput, a ) - indexOf( sortInput, b ) ) :
+				0;
+
+		// If the nodes are siblings, we can do a quick check
+		} else if ( aup === bup ) {
+			return siblingCheck( a, b );
+		}
+
+		// Otherwise we need full lists of their ancestors for comparison
+		cur = a;
+		while ( ( cur = cur.parentNode ) ) {
+			ap.unshift( cur );
+		}
+		cur = b;
+		while ( ( cur = cur.parentNode ) ) {
+			bp.unshift( cur );
+		}
+
+		// Walk down the tree looking for a discrepancy
+		while ( ap[ i ] === bp[ i ] ) {
+			i++;
+		}
+
+		return i ?
+
+			// Do a sibling check if the nodes have a common ancestor
+			siblingCheck( ap[ i ], bp[ i ] ) :
+
+			// Otherwise nodes in our document sort first
+			// Support: IE 11+, Edge 17 - 18+
+			// IE/Edge sometimes throw a "Permission denied" error when strict-comparing
+			// two documents; shallow comparisons work.
+			/* eslint-disable eqeqeq */
+			ap[ i ] == preferredDoc ? -1 :
+			bp[ i ] == preferredDoc ? 1 :
+			/* eslint-enable eqeqeq */
+			0;
+	};
+
+	return document;
+};
+
+Sizzle.matches = function( expr, elements ) {
+	return Sizzle( expr, null, null, elements );
+};
+
+Sizzle.matchesSelector = function( elem, expr ) {
+	setDocument( elem );
+
+	if ( support.matchesSelector && documentIsHTML &&
+		!nonnativeSelectorCache[ expr + " " ] &&
+		( !rbuggyMatches || !rbuggyMatches.test( expr ) ) &&
+		( !rbuggyQSA     || !rbuggyQSA.test( expr ) ) ) {
+
+		try {
+			var ret = matches.call( elem, expr );
+
+			// IE 9's matchesSelector returns false on disconnected nodes
+			if ( ret || support.disconnectedMatch ||
+
+				// As well, disconnected nodes are said to be in a document
+				// fragment in IE 9
+				elem.document && elem.document.nodeType !== 11 ) {
+				return ret;
+			}
+		} catch ( e ) {
+			nonnativeSelectorCache( expr, true );
+		}
+	}
+
+	return Sizzle( expr, document, null, [ elem ] ).length > 0;
+};
+
+Sizzle.contains = function( context, elem ) {
+
+	// Set document vars if needed
+	// Support: IE 11+, Edge 17 - 18+
+	// IE/Edge sometimes throw a "Permission denied" error when strict-comparing
+	// two documents; shallow comparisons work.
+	// eslint-disable-next-line eqeqeq
+	if ( ( context.ownerDocument || context ) != document ) {
+		setDocument( context );
+	}
+	return contains( context, elem );
+};
+
+Sizzle.attr = function( elem, name ) {
+
+	// Set document vars if needed
+	// Support: IE 11+, Edge 17 - 18+
+	// IE/Edge sometimes throw a "Permission denied" error when strict-comparing
+	// two documents; shallow comparisons work.
+	// eslint-disable-next-line eqeqeq
+	if ( ( elem.ownerDocument || elem ) != document ) {
+		setDocument( elem );
+	}
+
+	var fn = Expr.attrHandle[ name.toLowerCase() ],
+
+		// Don't get fooled by Object.prototype properties (jQuery #13807)
+		val = fn && hasOwn.call( Expr.attrHandle, name.toLowerCase() ) ?
+			fn( elem, name, !documentIsHTML ) :
+			undefined;
+
+	return val !== undefined ?
+		val :
+		support.attributes || !documentIsHTML ?
+			elem.getAttribute( name ) :
+			( val = elem.getAttributeNode( name ) ) && val.specified ?
+				val.value :
+				null;
+};
+
+Sizzle.escape = function( sel ) {
+	return ( sel + "" ).replace( rcssescape, fcssescape );
+};
+
+Sizzle.error = function( msg ) {
+	throw new Error( "Syntax error, unrecognized expression: " + msg );
+};
+
+/**
+ * Document sorting and removing duplicates
+ * @param {ArrayLike} results
+ */
+Sizzle.uniqueSort = function( results ) {
+	var elem,
+		duplicates = [],
+		j = 0,
+		i = 0;
+
+	// Unless we *know* we can detect duplicates, assume their presence
+	hasDuplicate = !support.detectDuplicates;
+	sortInput = !support.sortStable && results.slice( 0 );
+	results.sort( sortOrder );
+
+	if ( hasDuplicate ) {
+		while ( ( elem = results[ i++ ] ) ) {
+			if ( elem === results[ i ] ) {
+				j = duplicates.push( i );
+			}
+		}
+		while ( j-- ) {
+			results.splice( duplicates[ j ], 1 );
+		}
+	}
+
+	// Clear input after sorting to release objects
+	// See https://github.com/jquery/sizzle/pull/225
+	sortInput = null;
+
+	return results;
+};
+
+/**
+ * Utility function for retrieving the text value of an array of DOM nodes
+ * @param {Array|Element} elem
+ */
+getText = Sizzle.getText = function( elem ) {
+	var node,
+		ret = "",
+		i = 0,
+		nodeType = elem.nodeType;
+
+	if ( !nodeType ) {
+
+		// If no nodeType, this is expected to be an array
+		while ( ( node = elem[ i++ ] ) ) {
+
+			// Do not traverse comment nodes
+			ret += getText( node );
+		}
+	} else if ( nodeType === 1 || nodeType === 9 || nodeType === 11 ) {
+
+		// Use textContent for elements
+		// innerText usage removed for consistency of new lines (jQuery #11153)
+		if ( typeof elem.textContent === "string" ) {
+			return elem.textContent;
+		} else {
+
+			// Traverse its children
+			for ( elem = elem.firstChild; elem; elem = elem.nextSibling ) {
+				ret += getText( elem );
+			}
+		}
+	} else if ( nodeType === 3 || nodeType === 4 ) {
+		return elem.nodeValue;
+	}
+
+	// Do not include comment or processing instruction nodes
+
+	return ret;
+};
+
+Expr = Sizzle.selectors = {
+
+	// Can be adjusted by the user
+	cacheLength: 50,
+
+	createPseudo: markFunction,
+
+	match: matchExpr,
+
+	attrHandle: {},
+
+	find: {},
+
+	relative: {
+		">": { dir: "parentNode", first: true },
+		" ": { dir: "parentNode" },
+		"+": { dir: "previousSibling", first: true },
+		"~": { dir: "previousSibling" }
+	},
+
+	preFilter: {
+		"ATTR": function( match ) {
+			match[ 1 ] = match[ 1 ].replace( runescape, funescape );
+
+			// Move the given value to match[3] whether quoted or unquoted
+			match[ 3 ] = ( match[ 3 ] || match[ 4 ] ||
+				match[ 5 ] || "" ).replace( runescape, funescape );
+
+			if ( match[ 2 ] === "~=" ) {
+				match[ 3 ] = " " + match[ 3 ] + " ";
+			}
+
+			return match.slice( 0, 4 );
+		},
+
+		"CHILD": function( match ) {
+
+			/* matches from matchExpr["CHILD"]
+				1 type (only|nth|...)
+				2 what (child|of-type)
+				3 argument (even|odd|\d*|\d*n([+-]\d+)?|...)
+				4 xn-component of xn+y argument ([+-]?\d*n|)
+				5 sign of xn-component
+				6 x of xn-component
+				7 sign of y-component
+				8 y of y-component
+			*/
+			match[ 1 ] = match[ 1 ].toLowerCase();
+
+			if ( match[ 1 ].slice( 0, 3 ) === "nth" ) {
+
+				// nth-* requires argument
+				if ( !match[ 3 ] ) {
+					Sizzle.error( match[ 0 ] );
+				}
+
+				// numeric x and y parameters for Expr.filter.CHILD
+				// remember that false/true cast respectively to 0/1
+				match[ 4 ] = +( match[ 4 ] ?
+					match[ 5 ] + ( match[ 6 ] || 1 ) :
+					2 * ( match[ 3 ] === "even" || match[ 3 ] === "odd" ) );
+				match[ 5 ] = +( ( match[ 7 ] + match[ 8 ] ) || match[ 3 ] === "odd" );
+
+				// other types prohibit arguments
+			} else if ( match[ 3 ] ) {
+				Sizzle.error( match[ 0 ] );
+			}
+
+			return match;
+		},
+
+		"PSEUDO": function( match ) {
+			var excess,
+				unquoted = !match[ 6 ] && match[ 2 ];
+
+			if ( matchExpr[ "CHILD" ].test( match[ 0 ] ) ) {
+				return null;
+			}
+
+			// Accept quoted arguments as-is
+			if ( match[ 3 ] ) {
+				match[ 2 ] = match[ 4 ] || match[ 5 ] || "";
+
+			// Strip excess characters from unquoted arguments
+			} else if ( unquoted && rpseudo.test( unquoted ) &&
+
+				// Get excess from tokenize (recursively)
+				( excess = tokenize( unquoted, true ) ) &&
+
+				// advance to the next closing parenthesis
+				( excess = unquoted.indexOf( ")", unquoted.length - excess ) - unquoted.length ) ) {
+
+				// excess is a negative index
+				match[ 0 ] = match[ 0 ].slice( 0, excess );
+				match[ 2 ] = unquoted.slice( 0, excess );
+			}
+
+			// Return only captures needed by the pseudo filter method (type and argument)
+			return match.slice( 0, 3 );
+		}
+	},
+
+	filter: {
+
+		"TAG": function( nodeNameSelector ) {
+			var nodeName = nodeNameSelector.replace( runescape, funescape ).toLowerCase();
+			return nodeNameSelector === "*" ?
+				function() {
+					return true;
+				} :
+				function( elem ) {
+					return elem.nodeName && elem.nodeName.toLowerCase() === nodeName;
+				};
+		},
+
+		"CLASS": function( className ) {
+			var pattern = classCache[ className + " " ];
+
+			return pattern ||
+				( pattern = new RegExp( "(^|" + whitespace +
+					")" + className + "(" + whitespace + "|$)" ) ) && classCache(
+						className, function( elem ) {
+							return pattern.test(
+								typeof elem.className === "string" && elem.className ||
+								typeof elem.getAttribute !== "undefined" &&
+									elem.getAttribute( "class" ) ||
+								""
+							);
+				} );
+		},
+
+		"ATTR": function( name, operator, check ) {
+			return function( elem ) {
+				var result = Sizzle.attr( elem, name );
+
+				if ( result == null ) {
+					return operator === "!=";
+				}
+				if ( !operator ) {
+					return true;
+				}
+
+				result += "";
+
+				/* eslint-disable max-len */
+
+				return operator === "=" ? result === check :
+					operator === "!=" ? result !== check :
+					operator === "^=" ? check && result.indexOf( check ) === 0 :
+					operator === "*=" ? check && result.indexOf( check ) > -1 :
+					operator === "$=" ? check && result.slice( -check.length ) === check :
+					operator === "~=" ? ( " " + result.replace( rwhitespace, " " ) + " " ).indexOf( check ) > -1 :
+					operator === "|=" ? result === check || result.slice( 0, check.length + 1 ) === check + "-" :
+					false;
+				/* eslint-enable max-len */
+
+			};
+		},
+
+		"CHILD": function( type, what, _argument, first, last ) {
+			var simple = type.slice( 0, 3 ) !== "nth",
+				forward = type.slice( -4 ) !== "last",
+				ofType = what === "of-type";
+
+			return first === 1 && last === 0 ?
+
+				// Shortcut for :nth-*(n)
+				function( elem ) {
+					return !!elem.parentNode;
+				} :
+
+				function( elem, _context, xml ) {
+					var cache, uniqueCache, outerCache, node, nodeIndex, start,
+						dir = simple !== forward ? "nextSibling" : "previousSibling",
+						parent = elem.parentNode,
+						name = ofType && elem.nodeName.toLowerCase(),
+						useCache = !xml && !ofType,
+						diff = false;
+
+					if ( parent ) {
+
+						// :(first|last|only)-(child|of-type)
+						if ( simple ) {
+							while ( dir ) {
+								node = elem;
+								while ( ( node = node[ dir ] ) ) {
+									if ( ofType ?
+										node.nodeName.toLowerCase() === name :
+										node.nodeType === 1 ) {
+
+										return false;
+									}
+								}
+
+								// Reverse direction for :only-* (if we haven't yet done so)
+								start = dir = type === "only" && !start && "nextSibling";
+							}
+							return true;
+						}
+
+						start = [ forward ? parent.firstChild : parent.lastChild ];
+
+						// non-xml :nth-child(...) stores cache data on `parent`
+						if ( forward && useCache ) {
+
+							// Seek `elem` from a previously-cached index
+
+							// ...in a gzip-friendly way
+							node = parent;
+							outerCache = node[ expando ] || ( node[ expando ] = {} );
+
+							// Support: IE <9 only
+							// Defend against cloned attroperties (jQuery gh-1709)
+							uniqueCache = outerCache[ node.uniqueID ] ||
+								( outerCache[ node.uniqueID ] = {} );
+
+							cache = uniqueCache[ type ] || [];
+							nodeIndex = cache[ 0 ] === dirruns && cache[ 1 ];
+							diff = nodeIndex && cache[ 2 ];
+							node = nodeIndex && parent.childNodes[ nodeIndex ];
+
+							while ( ( node = ++nodeIndex && node && node[ dir ] ||
+
+								// Fallback to seeking `elem` from the start
+								( diff = nodeIndex = 0 ) || start.pop() ) ) {
+
+								// When found, cache indexes on `parent` and break
+								if ( node.nodeType === 1 && ++diff && node === elem ) {
+									uniqueCache[ type ] = [ dirruns, nodeIndex, diff ];
+									break;
+								}
+							}
+
+						} else {
+
+							// Use previously-cached element index if available
+							if ( useCache ) {
+
+								// ...in a gzip-friendly way
+								node = elem;
+								outerCache = node[ expando ] || ( node[ expando ] = {} );
+
+								// Support: IE <9 only
+								// Defend against cloned attroperties (jQuery gh-1709)
+								uniqueCache = outerCache[ node.uniqueID ] ||
+									( outerCache[ node.uniqueID ] = {} );
+
+								cache = uniqueCache[ type ] || [];
+								nodeIndex = cache[ 0 ] === dirruns && cache[ 1 ];
+								diff = nodeIndex;
+							}
+
+							// xml :nth-child(...)
+							// or :nth-last-child(...) or :nth(-last)?-of-type(...)
+							if ( diff === false ) {
+
+								// Use the same loop as above to seek `elem` from the start
+								while ( ( node = ++nodeIndex && node && node[ dir ] ||
+									( diff = nodeIndex = 0 ) || start.pop() ) ) {
+
+									if ( ( ofType ?
+										node.nodeName.toLowerCase() === name :
+										node.nodeType === 1 ) &&
+										++diff ) {
+
+										// Cache the index of each encountered element
+										if ( useCache ) {
+											outerCache = node[ expando ] ||
+												( node[ expando ] = {} );
+
+											// Support: IE <9 only
+											// Defend against cloned attroperties (jQuery gh-1709)
+											uniqueCache = outerCache[ node.uniqueID ] ||
+												( outerCache[ node.uniqueID ] = {} );
+
+											uniqueCache[ type ] = [ dirruns, diff ];
+										}
+
+										if ( node === elem ) {
+											break;
+										}
+									}
+								}
+							}
+						}
+
+						// Incorporate the offset, then check against cycle size
+						diff -= last;
+						return diff === first || ( diff % first === 0 && diff / first >= 0 );
+					}
+				};
+		},
+
+		"PSEUDO": function( pseudo, argument ) {
+
+			// pseudo-class names are case-insensitive
+			// http://www.w3.org/TR/selectors/#pseudo-classes
+			// Prioritize by case sensitivity in case custom pseudos are added with uppercase letters
+			// Remember that setFilters inherits from pseudos
+			var args,
+				fn = Expr.pseudos[ pseudo ] || Expr.setFilters[ pseudo.toLowerCase() ] ||
+					Sizzle.error( "unsupported pseudo: " + pseudo );
+
+			// The user may use createPseudo to indicate that
+			// arguments are needed to create the filter function
+			// just as Sizzle does
+			if ( fn[ expando ] ) {
+				return fn( argument );
+			}
+
+			// But maintain support for old signatures
+			if ( fn.length > 1 ) {
+				args = [ pseudo, pseudo, "", argument ];
+				return Expr.setFilters.hasOwnProperty( pseudo.toLowerCase() ) ?
+					markFunction( function( seed, matches ) {
+						var idx,
+							matched = fn( seed, argument ),
+							i = matched.length;
+						while ( i-- ) {
+							idx = indexOf( seed, matched[ i ] );
+							seed[ idx ] = !( matches[ idx ] = matched[ i ] );
+						}
+					} ) :
+					function( elem ) {
+						return fn( elem, 0, args );
+					};
+			}
+
+			return fn;
+		}
+	},
+
+	pseudos: {
+
+		// Potentially complex pseudos
+		"not": markFunction( function( selector ) {
+
+			// Trim the selector passed to compile
+			// to avoid treating leading and trailing
+			// spaces as combinators
+			var input = [],
+				results = [],
+				matcher = compile( selector.replace( rtrim, "$1" ) );
+
+			return matcher[ expando ] ?
+				markFunction( function( seed, matches, _context, xml ) {
+					var elem,
+						unmatched = matcher( seed, null, xml, [] ),
+						i = seed.length;
+
+					// Match elements unmatched by `matcher`
+					while ( i-- ) {
+						if ( ( elem = unmatched[ i ] ) ) {
+							seed[ i ] = !( matches[ i ] = elem );
+						}
+					}
+				} ) :
+				function( elem, _context, xml ) {
+					input[ 0 ] = elem;
+					matcher( input, null, xml, results );
+
+					// Don't keep the element (issue #299)
+					input[ 0 ] = null;
+					return !results.pop();
+				};
+		} ),
+
+		"has": markFunction( function( selector ) {
+			return function( elem ) {
+				return Sizzle( selector, elem ).length > 0;
+			};
+		} ),
+
+		"contains": markFunction( function( text ) {
+			text = text.replace( runescape, funescape );
+			return function( elem ) {
+				return ( elem.textContent || getText( elem ) ).indexOf( text ) > -1;
+			};
+		} ),
+
+		// "Whether an element is represented by a :lang() selector
+		// is based solely on the element's language value
+		// being equal to the identifier C,
+		// or beginning with the identifier C immediately followed by "-".
+		// The matching of C against the element's language value is performed case-insensitively.
+		// The identifier C does not have to be a valid language name."
+		// http://www.w3.org/TR/selectors/#lang-pseudo
+		"lang": markFunction( function( lang ) {
+
+			// lang value must be a valid identifier
+			if ( !ridentifier.test( lang || "" ) ) {
+				Sizzle.error( "unsupported lang: " + lang );
+			}
+			lang = lang.replace( runescape, funescape ).toLowerCase();
+			return function( elem ) {
+				var elemLang;
+				do {
+					if ( ( elemLang = documentIsHTML ?
+						elem.lang :
+						elem.getAttribute( "xml:lang" ) || elem.getAttribute( "lang" ) ) ) {
+
+						elemLang = elemLang.toLowerCase();
+						return elemLang === lang || elemLang.indexOf( lang + "-" ) === 0;
+					}
+				} while ( ( elem = elem.parentNode ) && elem.nodeType === 1 );
+				return false;
+			};
+		} ),
+
+		// Miscellaneous
+		"target": function( elem ) {
+			var hash = window.location && window.location.hash;
+			return hash && hash.slice( 1 ) === elem.id;
+		},
+
+		"root": function( elem ) {
+			return elem === docElem;
+		},
+
+		"focus": function( elem ) {
+			return elem === document.activeElement &&
+				( !document.hasFocus || document.hasFocus() ) &&
+				!!( elem.type || elem.href || ~elem.tabIndex );
+		},
+
+		// Boolean properties
+		"enabled": createDisabledPseudo( false ),
+		"disabled": createDisabledPseudo( true ),
+
+		"checked": function( elem ) {
+
+			// In CSS3, :checked should return both checked and selected elements
+			// http://www.w3.org/TR/2011/REC-css3-selectors-20110929/#checked
+			var nodeName = elem.nodeName.toLowerCase();
+			return ( nodeName === "input" && !!elem.checked ) ||
+				( nodeName === "option" && !!elem.selected );
+		},
+
+		"selected": function( elem ) {
+
+			// Accessing this property makes selected-by-default
+			// options in Safari work properly
+			if ( elem.parentNode ) {
+				// eslint-disable-next-line no-unused-expressions
+				elem.parentNode.selectedIndex;
+			}
+
+			return elem.selected === true;
+		},
+
+		// Contents
+		"empty": function( elem ) {
+
+			// http://www.w3.org/TR/selectors/#empty-pseudo
+			// :empty is negated by element (1) or content nodes (text: 3; cdata: 4; entity ref: 5),
+			//   but not by others (comment: 8; processing instruction: 7; etc.)
+			// nodeType < 6 works because attributes (2) do not appear as children
+			for ( elem = elem.firstChild; elem; elem = elem.nextSibling ) {
+				if ( elem.nodeType < 6 ) {
+					return false;
+				}
+			}
+			return true;
+		},
+
+		"parent": function( elem ) {
+			return !Expr.pseudos[ "empty" ]( elem );
+		},
+
+		// Element/input types
+		"header": function( elem ) {
+			return rheader.test( elem.nodeName );
+		},
+
+		"input": function( elem ) {
+			return rinputs.test( elem.nodeName );
+		},
+
+		"button": function( elem ) {
+			var name = elem.nodeName.toLowerCase();
+			return name === "input" && elem.type === "button" || name === "button";
+		},
+
+		"text": function( elem ) {
+			var attr;
+			return elem.nodeName.toLowerCase() === "input" &&
+				elem.type === "text" &&
+
+				// Support: IE<8
+				// New HTML5 attribute values (e.g., "search") appear with elem.type === "text"
+				( ( attr = elem.getAttribute( "type" ) ) == null ||
+					attr.toLowerCase() === "text" );
+		},
+
+		// Position-in-collection
+		"first": createPositionalPseudo( function() {
+			return [ 0 ];
+		} ),
+
+		"last": createPositionalPseudo( function( _matchIndexes, length ) {
+			return [ length - 1 ];
+		} ),
+
+		"eq": createPositionalPseudo( function( _matchIndexes, length, argument ) {
+			return [ argument < 0 ? argument + length : argument ];
+		} ),
+
+		"even": createPositionalPseudo( function( matchIndexes, length ) {
+			var i = 0;
+			for ( ; i < length; i += 2 ) {
+				matchIndexes.push( i );
+			}
+			return matchIndexes;
+		} ),
+
+		"odd": createPositionalPseudo( function( matchIndexes, length ) {
+			var i = 1;
+			for ( ; i < length; i += 2 ) {
+				matchIndexes.push( i );
+			}
+			return matchIndexes;
+		} ),
+
+		"lt": createPositionalPseudo( function( matchIndexes, length, argument ) {
+			var i = argument < 0 ?
+				argument + length :
+				argument > length ?
+					length :
+					argument;
+			for ( ; --i >= 0; ) {
+				matchIndexes.push( i );
+			}
+			return matchIndexes;
+		} ),
+
+		"gt": createPositionalPseudo( function( matchIndexes, length, argument ) {
+			var i = argument < 0 ? argument + length : argument;
+			for ( ; ++i < length; ) {
+				matchIndexes.push( i );
+			}
+			return matchIndexes;
+		} )
+	}
+};
+
+Expr.pseudos[ "nth" ] = Expr.pseudos[ "eq" ];
+
+// Add button/input type pseudos
+for ( i in { radio: true, checkbox: true, file: true, password: true, image: true } ) {
+	Expr.pseudos[ i ] = createInputPseudo( i );
+}
+for ( i in { submit: true, reset: true } ) {
+	Expr.pseudos[ i ] = createButtonPseudo( i );
+}
+
+// Easy API for creating new setFilters
+function setFilters() {}
+setFilters.prototype = Expr.filters = Expr.pseudos;
+Expr.setFilters = new setFilters();
+
+tokenize = Sizzle.tokenize = function( selector, parseOnly ) {
+	var matched, match, tokens, type,
+		soFar, groups, preFilters,
+		cached = tokenCache[ selector + " " ];
+
+	if ( cached ) {
+		return parseOnly ? 0 : cached.slice( 0 );
+	}
+
+	soFar = selector;
+	groups = [];
+	preFilters = Expr.preFilter;
+
+	while ( soFar ) {
+
+		// Comma and first run
+		if ( !matched || ( match = rcomma.exec( soFar ) ) ) {
+			if ( match ) {
+
+				// Don't consume trailing commas as valid
+				soFar = soFar.slice( match[ 0 ].length ) || soFar;
+			}
+			groups.push( ( tokens = [] ) );
+		}
+
+		matched = false;
+
+		// Combinators
+		if ( ( match = rcombinators.exec( soFar ) ) ) {
+			matched = match.shift();
+			tokens.push( {
+				value: matched,
+
+				// Cast descendant combinators to space
+				type: match[ 0 ].replace( rtrim, " " )
+			} );
+			soFar = soFar.slice( matched.length );
+		}
+
+		// Filters
+		for ( type in Expr.filter ) {
+			if ( ( match = matchExpr[ type ].exec( soFar ) ) && ( !preFilters[ type ] ||
+				( match = preFilters[ type ]( match ) ) ) ) {
+				matched = match.shift();
+				tokens.push( {
+					value: matched,
+					type: type,
+					matches: match
+				} );
+				soFar = soFar.slice( matched.length );
+			}
+		}
+
+		if ( !matched ) {
+			break;
+		}
+	}
+
+	// Return the length of the invalid excess
+	// if we're just parsing
+	// Otherwise, throw an error or return tokens
+	return parseOnly ?
+		soFar.length :
+		soFar ?
+			Sizzle.error( selector ) :
+
+			// Cache the tokens
+			tokenCache( selector, groups ).slice( 0 );
+};
+
+function toSelector( tokens ) {
+	var i = 0,
+		len = tokens.length,
+		selector = "";
+	for ( ; i < len; i++ ) {
+		selector += tokens[ i ].value;
+	}
+	return selector;
+}
+
+function addCombinator( matcher, combinator, base ) {
+	var dir = combinator.dir,
+		skip = combinator.next,
+		key = skip || dir,
+		checkNonElements = base && key === "parentNode",
+		doneName = done++;
+
+	return combinator.first ?
+
+		// Check against closest ancestor/preceding element
+		function( elem, context, xml ) {
+			while ( ( elem = elem[ dir ] ) ) {
+				if ( elem.nodeType === 1 || checkNonElements ) {
+					return matcher( elem, context, xml );
+				}
+			}
+			return false;
+		} :
+
+		// Check against all ancestor/preceding elements
+		function( elem, context, xml ) {
+			var oldCache, uniqueCache, outerCache,
+				newCache = [ dirruns, doneName ];
+
+			// We can't set arbitrary data on XML nodes, so they don't benefit from combinator caching
+			if ( xml ) {
+				while ( ( elem = elem[ dir ] ) ) {
+					if ( elem.nodeType === 1 || checkNonElements ) {
+						if ( matcher( elem, context, xml ) ) {
+							return true;
+						}
+					}
+				}
+			} else {
+				while ( ( elem = elem[ dir ] ) ) {
+					if ( elem.nodeType === 1 || checkNonElements ) {
+						outerCache = elem[ expando ] || ( elem[ expando ] = {} );
+
+						// Support: IE <9 only
+						// Defend against cloned attroperties (jQuery gh-1709)
+						uniqueCache = outerCache[ elem.uniqueID ] ||
+							( outerCache[ elem.uniqueID ] = {} );
+
+						if ( skip && skip === elem.nodeName.toLowerCase() ) {
+							elem = elem[ dir ] || elem;
+						} else if ( ( oldCache = uniqueCache[ key ] ) &&
+							oldCache[ 0 ] === dirruns && oldCache[ 1 ] === doneName ) {
+
+							// Assign to newCache so results back-propagate to previous elements
+							return ( newCache[ 2 ] = oldCache[ 2 ] );
+						} else {
+
+							// Reuse newcache so results back-propagate to previous elements
+							uniqueCache[ key ] = newCache;
+
+							// A match means we're done; a fail means we have to keep checking
+							if ( ( newCache[ 2 ] = matcher( elem, context, xml ) ) ) {
+								return true;
+							}
+						}
+					}
+				}
+			}
+			return false;
+		};
+}
+
+function elementMatcher( matchers ) {
+	return matchers.length > 1 ?
+		function( elem, context, xml ) {
+			var i = matchers.length;
+			while ( i-- ) {
+				if ( !matchers[ i ]( elem, context, xml ) ) {
+					return false;
+				}
+			}
+			return true;
+		} :
+		matchers[ 0 ];
+}
+
+function multipleContexts( selector, contexts, results ) {
+	var i = 0,
+		len = contexts.length;
+	for ( ; i < len; i++ ) {
+		Sizzle( selector, contexts[ i ], results );
+	}
+	return results;
+}
+
+function condense( unmatched, map, filter, context, xml ) {
+	var elem,
+		newUnmatched = [],
+		i = 0,
+		len = unmatched.length,
+		mapped = map != null;
+
+	for ( ; i < len; i++ ) {
+		if ( ( elem = unmatched[ i ] ) ) {
+			if ( !filter || filter( elem, context, xml ) ) {
+				newUnmatched.push( elem );
+				if ( mapped ) {
+					map.push( i );
+				}
+			}
+		}
+	}
+
+	return newUnmatched;
+}
+
+function setMatcher( preFilter, selector, matcher, postFilter, postFinder, postSelector ) {
+	if ( postFilter && !postFilter[ expando ] ) {
+		postFilter = setMatcher( postFilter );
+	}
+	if ( postFinder && !postFinder[ expando ] ) {
+		postFinder = setMatcher( postFinder, postSelector );
+	}
+	return markFunction( function( seed, results, context, xml ) {
+		var temp, i, elem,
+			preMap = [],
+			postMap = [],
+			preexisting = results.length,
+
+			// Get initial elements from seed or context
+			elems = seed || multipleContexts(
+				selector || "*",
+				context.nodeType ? [ context ] : context,
+				[]
+			),
+
+			// Prefilter to get matcher input, preserving a map for seed-results synchronization
+			matcherIn = preFilter && ( seed || !selector ) ?
+				condense( elems, preMap, preFilter, context, xml ) :
+				elems,
+
+			matcherOut = matcher ?
+
+				// If we have a postFinder, or filtered seed, or non-seed postFilter or preexisting results,
+				postFinder || ( seed ? preFilter : preexisting || postFilter ) ?
+
+					// ...intermediate processing is necessary
+					[] :
+
+					// ...otherwise use results directly
+					results :
+				matcherIn;
+
+		// Find primary matches
+		if ( matcher ) {
+			matcher( matcherIn, matcherOut, context, xml );
+		}
+
+		// Apply postFilter
+		if ( postFilter ) {
+			temp = condense( matcherOut, postMap );
+			postFilter( temp, [], context, xml );
+
+			// Un-match failing elements by moving them back to matcherIn
+			i = temp.length;
+			while ( i-- ) {
+				if ( ( elem = temp[ i ] ) ) {
+					matcherOut[ postMap[ i ] ] = !( matcherIn[ postMap[ i ] ] = elem );
+				}
+			}
+		}
+
+		if ( seed ) {
+			if ( postFinder || preFilter ) {
+				if ( postFinder ) {
+
+					// Get the final matcherOut by condensing this intermediate into postFinder contexts
+					temp = [];
+					i = matcherOut.length;
+					while ( i-- ) {
+						if ( ( elem = matcherOut[ i ] ) ) {
+
+							// Restore matcherIn since elem is not yet a final match
+							temp.push( ( matcherIn[ i ] = elem ) );
+						}
+					}
+					postFinder( null, ( matcherOut = [] ), temp, xml );
+				}
+
+				// Move matched elements from seed to results to keep them synchronized
+				i = matcherOut.length;
+				while ( i-- ) {
+					if ( ( elem = matcherOut[ i ] ) &&
+						( temp = postFinder ? indexOf( seed, elem ) : preMap[ i ] ) > -1 ) {
+
+						seed[ temp ] = !( results[ temp ] = elem );
+					}
+				}
+			}
+
+		// Add elements to results, through postFinder if defined
+		} else {
+			matcherOut = condense(
+				matcherOut === results ?
+					matcherOut.splice( preexisting, matcherOut.length ) :
+					matcherOut
+			);
+			if ( postFinder ) {
+				postFinder( null, results, matcherOut, xml );
+			} else {
+				push.apply( results, matcherOut );
+			}
+		}
+	} );
+}
+
+function matcherFromTokens( tokens ) {
+	var checkContext, matcher, j,
+		len = tokens.length,
+		leadingRelative = Expr.relative[ tokens[ 0 ].type ],
+		implicitRelative = leadingRelative || Expr.relative[ " " ],
+		i = leadingRelative ? 1 : 0,
+
+		// The foundational matcher ensures that elements are reachable from top-level context(s)
+		matchContext = addCombinator( function( elem ) {
+			return elem === checkContext;
+		}, implicitRelative, true ),
+		matchAnyContext = addCombinator( function( elem ) {
+			return indexOf( checkContext, elem ) > -1;
+		}, implicitRelative, true ),
+		matchers = [ function( elem, context, xml ) {
+			var ret = ( !leadingRelative && ( xml || context !== outermostContext ) ) || (
+				( checkContext = context ).nodeType ?
+					matchContext( elem, context, xml ) :
+					matchAnyContext( elem, context, xml ) );
+
+			// Avoid hanging onto element (issue #299)
+			checkContext = null;
+			return ret;
+		} ];
+
+	for ( ; i < len; i++ ) {
+		if ( ( matcher = Expr.relative[ tokens[ i ].type ] ) ) {
+			matchers = [ addCombinator( elementMatcher( matchers ), matcher ) ];
+		} else {
+			matcher = Expr.filter[ tokens[ i ].type ].apply( null, tokens[ i ].matches );
+
+			// Return special upon seeing a positional matcher
+			if ( matcher[ expando ] ) {
+
+				// Find the next relative operator (if any) for proper handling
+				j = ++i;
+				for ( ; j < len; j++ ) {
+					if ( Expr.relative[ tokens[ j ].type ] ) {
+						break;
+					}
+				}
+				return setMatcher(
+					i > 1 && elementMatcher( matchers ),
+					i > 1 && toSelector(
+
+					// If the preceding token was a descendant combinator, insert an implicit any-element `*`
+					tokens
+						.slice( 0, i - 1 )
+						.concat( { value: tokens[ i - 2 ].type === " " ? "*" : "" } )
+					).replace( rtrim, "$1" ),
+					matcher,
+					i < j && matcherFromTokens( tokens.slice( i, j ) ),
+					j < len && matcherFromTokens( ( tokens = tokens.slice( j ) ) ),
+					j < len && toSelector( tokens )
+				);
+			}
+			matchers.push( matcher );
+		}
+	}
+
+	return elementMatcher( matchers );
+}
+
+function matcherFromGroupMatchers( elementMatchers, setMatchers ) {
+	var bySet = setMatchers.length > 0,
+		byElement = elementMatchers.length > 0,
+		superMatcher = function( seed, context, xml, results, outermost ) {
+			var elem, j, matcher,
+				matchedCount = 0,
+				i = "0",
+				unmatched = seed && [],
+				setMatched = [],
+				contextBackup = outermostContext,
+
+				// We must always have either seed elements or outermost context
+				elems = seed || byElement && Expr.find[ "TAG" ]( "*", outermost ),
+
+				// Use integer dirruns iff this is the outermost matcher
+				dirrunsUnique = ( dirruns += contextBackup == null ? 1 : Math.random() || 0.1 ),
+				len = elems.length;
+
+			if ( outermost ) {
+
+				// Support: IE 11+, Edge 17 - 18+
+				// IE/Edge sometimes throw a "Permission denied" error when strict-comparing
+				// two documents; shallow comparisons work.
+				// eslint-disable-next-line eqeqeq
+				outermostContext = context == document || context || outermost;
+			}
+
+			// Add elements passing elementMatchers directly to results
+			// Support: IE<9, Safari
+			// Tolerate NodeList properties (IE: "length"; Safari: <number>) matching elements by id
+			for ( ; i !== len && ( elem = elems[ i ] ) != null; i++ ) {
+				if ( byElement && elem ) {
+					j = 0;
+
+					// Support: IE 11+, Edge 17 - 18+
+					// IE/Edge sometimes throw a "Permission denied" error when strict-comparing
+					// two documents; shallow comparisons work.
+					// eslint-disable-next-line eqeqeq
+					if ( !context && elem.ownerDocument != document ) {
+						setDocument( elem );
+						xml = !documentIsHTML;
+					}
+					while ( ( matcher = elementMatchers[ j++ ] ) ) {
+						if ( matcher( elem, context || document, xml ) ) {
+							results.push( elem );
+							break;
+						}
+					}
+					if ( outermost ) {
+						dirruns = dirrunsUnique;
+					}
+				}
+
+				// Track unmatched elements for set filters
+				if ( bySet ) {
+
+					// They will have gone through all possible matchers
+					if ( ( elem = !matcher && elem ) ) {
+						matchedCount--;
+					}
+
+					// Lengthen the array for every element, matched or not
+					if ( seed ) {
+						unmatched.push( elem );
+					}
+				}
+			}
+
+			// `i` is now the count of elements visited above, and adding it to `matchedCount`
+			// makes the latter nonnegative.
+			matchedCount += i;
+
+			// Apply set filters to unmatched elements
+			// NOTE: This can be skipped if there are no unmatched elements (i.e., `matchedCount`
+			// equals `i`), unless we didn't visit _any_ elements in the above loop because we have
+			// no element matchers and no seed.
+			// Incrementing an initially-string "0" `i` allows `i` to remain a string only in that
+			// case, which will result in a "00" `matchedCount` that differs from `i` but is also
+			// numerically zero.
+			if ( bySet && i !== matchedCount ) {
+				j = 0;
+				while ( ( matcher = setMatchers[ j++ ] ) ) {
+					matcher( unmatched, setMatched, context, xml );
+				}
+
+				if ( seed ) {
+
+					// Reintegrate element matches to eliminate the need for sorting
+					if ( matchedCount > 0 ) {
+						while ( i-- ) {
+							if ( !( unmatched[ i ] || setMatched[ i ] ) ) {
+								setMatched[ i ] = pop.call( results );
+							}
+						}
+					}
+
+					// Discard index placeholder values to get only actual matches
+					setMatched = condense( setMatched );
+				}
+
+				// Add matches to results
+				push.apply( results, setMatched );
+
+				// Seedless set matches succeeding multiple successful matchers stipulate sorting
+				if ( outermost && !seed && setMatched.length > 0 &&
+					( matchedCount + setMatchers.length ) > 1 ) {
+
+					Sizzle.uniqueSort( results );
+				}
+			}
+
+			// Override manipulation of globals by nested matchers
+			if ( outermost ) {
+				dirruns = dirrunsUnique;
+				outermostContext = contextBackup;
+			}
+
+			return unmatched;
+		};
+
+	return bySet ?
+		markFunction( superMatcher ) :
+		superMatcher;
+}
+
+compile = Sizzle.compile = function( selector, match /* Internal Use Only */ ) {
+	var i,
+		setMatchers = [],
+		elementMatchers = [],
+		cached = compilerCache[ selector + " " ];
+
+	if ( !cached ) {
+
+		// Generate a function of recursive functions that can be used to check each element
+		if ( !match ) {
+			match = tokenize( selector );
+		}
+		i = match.length;
+		while ( i-- ) {
+			cached = matcherFromTokens( match[ i ] );
+			if ( cached[ expando ] ) {
+				setMatchers.push( cached );
+			} else {
+				elementMatchers.push( cached );
+			}
+		}
+
+		// Cache the compiled function
+		cached = compilerCache(
+			selector,
+			matcherFromGroupMatchers( elementMatchers, setMatchers )
+		);
+
+		// Save selector and tokenization
+		cached.selector = selector;
+	}
+	return cached;
+};
+
+/**
+ * A low-level selection function that works with Sizzle's compiled
+ *  selector functions
+ * @param {String|Function} selector A selector or a pre-compiled
+ *  selector function built with Sizzle.compile
+ * @param {Element} context
+ * @param {Array} [results]
+ * @param {Array} [seed] A set of elements to match against
+ */
+select = Sizzle.select = function( selector, context, results, seed ) {
+	var i, tokens, token, type, find,
+		compiled = typeof selector === "function" && selector,
+		match = !seed && tokenize( ( selector = compiled.selector || selector ) );
+
+	results = results || [];
+
+	// Try to minimize operations if there is only one selector in the list and no seed
+	// (the latter of which guarantees us context)
+	if ( match.length === 1 ) {
+
+		// Reduce context if the leading compound selector is an ID
+		tokens = match[ 0 ] = match[ 0 ].slice( 0 );
+		if ( tokens.length > 2 && ( token = tokens[ 0 ] ).type === "ID" &&
+			context.nodeType === 9 && documentIsHTML && Expr.relative[ tokens[ 1 ].type ] ) {
+
+			context = ( Expr.find[ "ID" ]( token.matches[ 0 ]
+				.replace( runescape, funescape ), context ) || [] )[ 0 ];
+			if ( !context ) {
+				return results;
+
+			// Precompiled matchers will still verify ancestry, so step up a level
+			} else if ( compiled ) {
+				context = context.parentNode;
+			}
+
+			selector = selector.slice( tokens.shift().value.length );
+		}
+
+		// Fetch a seed set for right-to-left matching
+		i = matchExpr[ "needsContext" ].test( selector ) ? 0 : tokens.length;
+		while ( i-- ) {
+			token = tokens[ i ];
+
+			// Abort if we hit a combinator
+			if ( Expr.relative[ ( type = token.type ) ] ) {
+				break;
+			}
+			if ( ( find = Expr.find[ type ] ) ) {
+
+				// Search, expanding context for leading sibling combinators
+				if ( ( seed = find(
+					token.matches[ 0 ].replace( runescape, funescape ),
+					rsibling.test( tokens[ 0 ].type ) && testContext( context.parentNode ) ||
+						context
+				) ) ) {
+
+					// If seed is empty or no tokens remain, we can return early
+					tokens.splice( i, 1 );
+					selector = seed.length && toSelector( tokens );
+					if ( !selector ) {
+						push.apply( results, seed );
+						return results;
+					}
+
+					break;
+				}
+			}
+		}
+	}
+
+	// Compile and execute a filtering function if one is not provided
+	// Provide `match` to avoid retokenization if we modified the selector above
+	( compiled || compile( selector, match ) )(
+		seed,
+		context,
+		!documentIsHTML,
+		results,
+		!context || rsibling.test( selector ) && testContext( context.parentNode ) || context
+	);
+	return results;
+};
+
+// One-time assignments
+
+// Sort stability
+support.sortStable = expando.split( "" ).sort( sortOrder ).join( "" ) === expando;
+
+// Support: Chrome 14-35+
+// Always assume duplicates if they aren't passed to the comparison function
+support.detectDuplicates = !!hasDuplicate;
+
+// Initialize against the default document
+setDocument();
+
+// Support: Webkit<537.32 - Safari 6.0.3/Chrome 25 (fixed in Chrome 27)
+// Detached nodes confoundingly follow *each other*
+support.sortDetached = assert( function( el ) {
+
+	// Should return 1, but returns 4 (following)
+	return el.compareDocumentPosition( document.createElement( "fieldset" ) ) & 1;
+} );
+
+// Support: IE<8
+// Prevent attribute/property "interpolation"
+// https://msdn.microsoft.com/en-us/library/ms536429%28VS.85%29.aspx
+if ( !assert( function( el ) {
+	el.innerHTML = "<a href='#'></a>";
+	return el.firstChild.getAttribute( "href" ) === "#";
+} ) ) {
+	addHandle( "type|href|height|width", function( elem, name, isXML ) {
+		if ( !isXML ) {
+			return elem.getAttribute( name, name.toLowerCase() === "type" ? 1 : 2 );
+		}
+	} );
+}
+
+// Support: IE<9
+// Use defaultValue in place of getAttribute("value")
+if ( !support.attributes || !assert( function( el ) {
+	el.innerHTML = "<input/>";
+	el.firstChild.setAttribute( "value", "" );
+	return el.firstChild.getAttribute( "value" ) === "";
+} ) ) {
+	addHandle( "value", function( elem, _name, isXML ) {
+		if ( !isXML && elem.nodeName.toLowerCase() === "input" ) {
+			return elem.defaultValue;
+		}
+	} );
+}
+
+// Support: IE<9
+// Use getAttributeNode to fetch booleans when getAttribute lies
+if ( !assert( function( el ) {
+	return el.getAttribute( "disabled" ) == null;
+} ) ) {
+	addHandle( booleans, function( elem, name, isXML ) {
+		var val;
+		if ( !isXML ) {
+			return elem[ name ] === true ? name.toLowerCase() :
+				( val = elem.getAttributeNode( name ) ) && val.specified ?
+					val.value :
+					null;
+		}
+	} );
+}
+
+return Sizzle;
+
+} )( window );
+
+
+
+jQuery.find = Sizzle;
+jQuery.expr = Sizzle.selectors;
+
+// Deprecated
+jQuery.expr[ ":" ] = jQuery.expr.pseudos;
+jQuery.uniqueSort = jQuery.unique = Sizzle.uniqueSort;
+jQuery.text = Sizzle.getText;
+jQuery.isXMLDoc = Sizzle.isXML;
+jQuery.contains = Sizzle.contains;
+jQuery.escapeSelector = Sizzle.escape;
+
+
+
+
+var dir = function( elem, dir, until ) {
+	var matched = [],
+		truncate = until !== undefined;
+
+	while ( ( elem = elem[ dir ] ) && elem.nodeType !== 9 ) {
+		if ( elem.nodeType === 1 ) {
+			if ( truncate && jQuery( elem ).is( until ) ) {
+				break;
+			}
+			matched.push( elem );
+		}
+	}
+	return matched;
+};
+
+
+var siblings = function( n, elem ) {
+	var matched = [];
+
+	for ( ; n; n = n.nextSibling ) {
+		if ( n.nodeType === 1 && n !== elem ) {
+			matched.push( n );
+		}
+	}
+
+	return matched;
+};
+
+
+var rneedsContext = jQuery.expr.match.needsContext;
+
+
+
+function nodeName( elem, name ) {
+
+	return elem.nodeName && elem.nodeName.toLowerCase() === name.toLowerCase();
+
+}
+var rsingleTag = ( /^<([a-z][^\/\0>:\x20\t\r\n\f]*)[\x20\t\r\n\f]*\/?>(?:<\/\1>|)$/i );
+
+
+
+// Implement the identical functionality for filter and not
+function winnow( elements, qualifier, not ) {
+	if ( isFunction( qualifier ) ) {
+		return jQuery.grep( elements, function( elem, i ) {
+			return !!qualifier.call( elem, i, elem ) !== not;
+		} );
+	}
+
+	// Single element
+	if ( qualifier.nodeType ) {
+		return jQuery.grep( elements, function( elem ) {
+			return ( elem === qualifier ) !== not;
+		} );
+	}
+
+	// Arraylike of elements (jQuery, arguments, Array)
+	if ( typeof qualifier !== "string" ) {
+		return jQuery.grep( elements, function( elem ) {
+			return ( indexOf.call( qualifier, elem ) > -1 ) !== not;
+		} );
+	}
+
+	// Filtered directly for both simple and complex selectors
+	return jQuery.filter( qualifier, elements, not );
+}
+
+jQuery.filter = function( expr, elems, not ) {
+	var elem = elems[ 0 ];
+
+	if ( not ) {
+		expr = ":not(" + expr + ")";
+	}
+
+	if ( elems.length === 1 && elem.nodeType === 1 ) {
+		return jQuery.find.matchesSelector( elem, expr ) ? [ elem ] : [];
+	}
+
+	return jQuery.find.matches( expr, jQuery.grep( elems, function( elem ) {
+		return elem.nodeType === 1;
+	} ) );
+};
+
+jQuery.fn.extend( {
+	find: function( selector ) {
+		var i, ret,
+			len = this.length,
+			self = this;
+
+		if ( typeof selector !== "string" ) {
+			return this.pushStack( jQuery( selector ).filter( function() {
+				for ( i = 0; i < len; i++ ) {
+					if ( jQuery.contains( self[ i ], this ) ) {
+						return true;
+					}
+				}
+			} ) );
+		}
+
+		ret = this.pushStack( [] );
+
+		for ( i = 0; i < len; i++ ) {
+			jQuery.find( selector, self[ i ], ret );
+		}
+
+		return len > 1 ? jQuery.uniqueSort( ret ) : ret;
+	},
+	filter: function( selector ) {
+		return this.pushStack( winnow( this, selector || [], false ) );
+	},
+	not: function( selector ) {
+		return this.pushStack( winnow( this, selector || [], true ) );
+	},
+	is: function( selector ) {
+		return !!winnow(
+			this,
+
+			// If this is a positional/relative selector, check membership in the returned set
+			// so $("p:first").is("p:last") won't return true for a doc with two "p".
+			typeof selector === "string" && rneedsContext.test( selector ) ?
+				jQuery( selector ) :
+				selector || [],
+			false
+		).length;
+	}
+} );
+
+
+// Initialize a jQuery object
+
+
+// A central reference to the root jQuery(document)
+var rootjQuery,
+
+	// A simple way to check for HTML strings
+	// Prioritize #id over <tag> to avoid XSS via location.hash (#9521)
+	// Strict HTML recognition (#11290: must start with <)
+	// Shortcut simple #id case for speed
+	rquickExpr = /^(?:\s*(<[\w\W]+>)[^>]*|#([\w-]+))$/,
+
+	init = jQuery.fn.init = function( selector, context, root ) {
+		var match, elem;
+
+		// HANDLE: $(""), $(null), $(undefined), $(false)
+		if ( !selector ) {
+			return this;
+		}
+
+		// Method init() accepts an alternate rootjQuery
+		// so migrate can support jQuery.sub (gh-2101)
+		root = root || rootjQuery;
+
+		// Handle HTML strings
+		if ( typeof selector === "string" ) {
+			if ( selector[ 0 ] === "<" &&
+				selector[ selector.length - 1 ] === ">" &&
+				selector.length >= 3 ) {
+
+				// Assume that strings that start and end with <> are HTML and skip the regex check
+				match = [ null, selector, null ];
+
+			} else {
+				match = rquickExpr.exec( selector );
+			}
+
+			// Match html or make sure no context is specified for #id
+			if ( match && ( match[ 1 ] || !context ) ) {
+
+				// HANDLE: $(html) -> $(array)
+				if ( match[ 1 ] ) {
+					context = context instanceof jQuery ? context[ 0 ] : context;
+
+					// Option to run scripts is true for back-compat
+					// Intentionally let the error be thrown if parseHTML is not present
+					jQuery.merge( this, jQuery.parseHTML(
+						match[ 1 ],
+						context && context.nodeType ? context.ownerDocument || context : document,
+						true
+					) );
+
+					// HANDLE: $(html, props)
+					if ( rsingleTag.test( match[ 1 ] ) && jQuery.isPlainObject( context ) ) {
+						for ( match in context ) {
+
+							// Properties of context are called as methods if possible
+							if ( isFunction( this[ match ] ) ) {
+								this[ match ]( context[ match ] );
+
+							// ...and otherwise set as attributes
+							} else {
+								this.attr( match, context[ match ] );
+							}
+						}
+					}
+
+					return this;
+
+				// HANDLE: $(#id)
+				} else {
+					elem = document.getElementById( match[ 2 ] );
+
+					if ( elem ) {
+
+						// Inject the element directly into the jQuery object
+						this[ 0 ] = elem;
+						this.length = 1;
+					}
+					return this;
+				}
+
+			// HANDLE: $(expr, $(...))
+			} else if ( !context || context.jquery ) {
+				return ( context || root ).find( selector );
+
+			// HANDLE: $(expr, context)
+			// (which is just equivalent to: $(context).find(expr)
+			} else {
+				return this.constructor( context ).find( selector );
+			}
+
+		// HANDLE: $(DOMElement)
+		} else if ( selector.nodeType ) {
+			this[ 0 ] = selector;
+			this.length = 1;
+			return this;
+
+		// HANDLE: $(function)
+		// Shortcut for document ready
+		} else if ( isFunction( selector ) ) {
+			return root.ready !== undefined ?
+				root.ready( selector ) :
+
+				// Execute immediately if ready is not present
+				selector( jQuery );
+		}
+
+		return jQuery.makeArray( selector, this );
+	};
+
+// Give the init function the jQuery prototype for later instantiation
+init.prototype = jQuery.fn;
+
+// Initialize central reference
+rootjQuery = jQuery( document );
+
+
+var rparentsprev = /^(?:parents|prev(?:Until|All))/,
+
+	// Methods guaranteed to produce a unique set when starting from a unique set
+	guaranteedUnique = {
+		children: true,
+		contents: true,
+		next: true,
+		prev: true
+	};
+
+jQuery.fn.extend( {
+	has: function( target ) {
+		var targets = jQuery( target, this ),
+			l = targets.length;
+
+		return this.filter( function() {
+			var i = 0;
+			for ( ; i < l; i++ ) {
+				if ( jQuery.contains( this, targets[ i ] ) ) {
+					return true;
+				}
+			}
+		} );
+	},
+
+	closest: function( selectors, context ) {
+		var cur,
+			i = 0,
+			l = this.length,
+			matched = [],
+			targets = typeof selectors !== "string" && jQuery( selectors );
+
+		// Positional selectors never match, since there's no _selection_ context
+		if ( !rneedsContext.test( selectors ) ) {
+			for ( ; i < l; i++ ) {
+				for ( cur = this[ i ]; cur && cur !== context; cur = cur.parentNode ) {
+
+					// Always skip document fragments
+					if ( cur.nodeType < 11 && ( targets ?
+						targets.index( cur ) > -1 :
+
+						// Don't pass non-elements to Sizzle
+						cur.nodeType === 1 &&
+							jQuery.find.matchesSelector( cur, selectors ) ) ) {
+
+						matched.push( cur );
+						break;
+					}
+				}
+			}
+		}
+
+		return this.pushStack( matched.length > 1 ? jQuery.uniqueSort( matched ) : matched );
+	},
+
+	// Determine the position of an element within the set
+	index: function( elem ) {
+
+		// No argument, return index in parent
+		if ( !elem ) {
+			return ( this[ 0 ] && this[ 0 ].parentNode ) ? this.first().prevAll().length : -1;
+		}
+
+		// Index in selector
+		if ( typeof elem === "string" ) {
+			return indexOf.call( jQuery( elem ), this[ 0 ] );
+		}
+
+		// Locate the position of the desired element
+		return indexOf.call( this,
+
+			// If it receives a jQuery object, the first element is used
+			elem.jquery ? elem[ 0 ] : elem
+		);
+	},
+
+	add: function( selector, context ) {
+		return this.pushStack(
+			jQuery.uniqueSort(
+				jQuery.merge( this.get(), jQuery( selector, context ) )
+			)
+		);
+	},
+
+	addBack: function( selector ) {
+		return this.add( selector == null ?
+			this.prevObject : this.prevObject.filter( selector )
+		);
+	}
+} );
+
+function sibling( cur, dir ) {
+	while ( ( cur = cur[ dir ] ) && cur.nodeType !== 1 ) {}
+	return cur;
+}
+
+jQuery.each( {
+	parent: function( elem ) {
+		var parent = elem.parentNode;
+		return parent && parent.nodeType !== 11 ? parent : null;
+	},
+	parents: function( elem ) {
+		return dir( elem, "parentNode" );
+	},
+	parentsUntil: function( elem, _i, until ) {
+		return dir( elem, "parentNode", until );
+	},
+	next: function( elem ) {
+		return sibling( elem, "nextSibling" );
+	},
+	prev: function( elem ) {
+		return sibling( elem, "previousSibling" );
+	},
+	nextAll: function( elem ) {
+		return dir( elem, "nextSibling" );
+	},
+	prevAll: function( elem ) {
+		return dir( elem, "previousSibling" );
+	},
+	nextUntil: function( elem, _i, until ) {
+		return dir( elem, "nextSibling", until );
+	},
+	prevUntil: function( elem, _i, until ) {
+		return dir( elem, "previousSibling", until );
+	},
+	siblings: function( elem ) {
+		return siblings( ( elem.parentNode || {} ).firstChild, elem );
+	},
+	children: function( elem ) {
+		return siblings( elem.firstChild );
+	},
+	contents: function( elem ) {
+		if ( elem.contentDocument != null &&
+
+			// Support: IE 11+
+			// <object> elements with no `data` attribute has an object
+			// `contentDocument` with a `null` prototype.
+			getProto( elem.contentDocument ) ) {
+
+			return elem.contentDocument;
+		}
+
+		// Support: IE 9 - 11 only, iOS 7 only, Android Browser <=4.3 only
+		// Treat the template element as a regular one in browsers that
+		// don't support it.
+		if ( nodeName( elem, "template" ) ) {
+			elem = elem.content || elem;
+		}
+
+		return jQuery.merge( [], elem.childNodes );
+	}
+}, function( name, fn ) {
+	jQuery.fn[ name ] = function( until, selector ) {
+		var matched = jQuery.map( this, fn, until );
+
+		if ( name.slice( -5 ) !== "Until" ) {
+			selector = until;
+		}
+
+		if ( selector && typeof selector === "string" ) {
+			matched = jQuery.filter( selector, matched );
+		}
+
+		if ( this.length > 1 ) {
+
+			// Remove duplicates
+			if ( !guaranteedUnique[ name ] ) {
+				jQuery.uniqueSort( matched );
+			}
+
+			// Reverse order for parents* and prev-derivatives
+			if ( rparentsprev.test( name ) ) {
+				matched.reverse();
+			}
+		}
+
+		return this.pushStack( matched );
+	};
+} );
+var rnothtmlwhite = ( /[^\x20\t\r\n\f]+/g );
+
+
+
+// Convert String-formatted options into Object-formatted ones
+function createOptions( options ) {
+	var object = {};
+	jQuery.each( options.match( rnothtmlwhite ) || [], function( _, flag ) {
+		object[ flag ] = true;
+	} );
+	return object;
+}
+
+/*
+ * Create a callback list using the following parameters:
+ *
+ *	options: an optional list of space-separated options that will change how
+ *			the callback list behaves or a more traditional option object
+ *
+ * By default a callback list will act like an event callback list and can be
+ * "fired" multiple times.
+ *
+ * Possible options:
+ *
+ *	once:			will ensure the callback list can only be fired once (like a Deferred)
+ *
+ *	memory:			will keep track of previous values and will call any callback added
+ *					after the list has been fired right away with the latest "memorized"
+ *					values (like a Deferred)
+ *
+ *	unique:			will ensure a callback can only be added once (no duplicate in the list)
+ *
+ *	stopOnFalse:	interrupt callings when a callback returns false
+ *
+ */
+jQuery.Callbacks = function( options ) {
+
+	// Convert options from String-formatted to Object-formatted if needed
+	// (we check in cache first)
+	options = typeof options === "string" ?
+		createOptions( options ) :
+		jQuery.extend( {}, options );
+
+	var // Flag to know if list is currently firing
+		firing,
+
+		// Last fire value for non-forgettable lists
+		memory,
+
+		// Flag to know if list was already fired
+		fired,
+
+		// Flag to prevent firing
+		locked,
+
+		// Actual callback list
+		list = [],
+
+		// Queue of execution data for repeatable lists
+		queue = [],
+
+		// Index of currently firing callback (modified by add/remove as needed)
+		firingIndex = -1,
+
+		// Fire callbacks
+		fire = function() {
+
+			// Enforce single-firing
+			locked = locked || options.once;
+
+			// Execute callbacks for all pending executions,
+			// respecting firingIndex overrides and runtime changes
+			fired = firing = true;
+			for ( ; queue.length; firingIndex = -1 ) {
+				memory = queue.shift();
+				while ( ++firingIndex < list.length ) {
+
+					// Run callback and check for early termination
+					if ( list[ firingIndex ].apply( memory[ 0 ], memory[ 1 ] ) === false &&
+						options.stopOnFalse ) {
+
+						// Jump to end and forget the data so .add doesn't re-fire
+						firingIndex = list.length;
+						memory = false;
+					}
+				}
+			}
+
+			// Forget the data if we're done with it
+			if ( !options.memory ) {
+				memory = false;
+			}
+
+			firing = false;
+
+			// Clean up if we're done firing for good
+			if ( locked ) {
+
+				// Keep an empty list if we have data for future add calls
+				if ( memory ) {
+					list = [];
+
+				// Otherwise, this object is spent
+				} else {
+					list = "";
+				}
+			}
+		},
+
+		// Actual Callbacks object
+		self = {
+
+			// Add a callback or a collection of callbacks to the list
+			add: function() {
+				if ( list ) {
+
+					// If we have memory from a past run, we should fire after adding
+					if ( memory && !firing ) {
+						firingIndex = list.length - 1;
+						queue.push( memory );
+					}
+
+					( function add( args ) {
+						jQuery.each( args, function( _, arg ) {
+							if ( isFunction( arg ) ) {
+								if ( !options.unique || !self.has( arg ) ) {
+									list.push( arg );
+								}
+							} else if ( arg && arg.length && toType( arg ) !== "string" ) {
+
+								// Inspect recursively
+								add( arg );
+							}
+						} );
+					} )( arguments );
+
+					if ( memory && !firing ) {
+						fire();
+					}
+				}
+				return this;
+			},
+
+			// Remove a callback from the list
+			remove: function() {
+				jQuery.each( arguments, function( _, arg ) {
+					var index;
+					while ( ( index = jQuery.inArray( arg, list, index ) ) > -1 ) {
+						list.splice( index, 1 );
+
+						// Handle firing indexes
+						if ( index <= firingIndex ) {
+							firingIndex--;
+						}
+					}
+				} );
+				return this;
+			},
+
+			// Check if a given callback is in the list.
+			// If no argument is given, return whether or not list has callbacks attached.
+			has: function( fn ) {
+				return fn ?
+					jQuery.inArray( fn, list ) > -1 :
+					list.length > 0;
+			},
+
+			// Remove all callbacks from the list
+			empty: function() {
+				if ( list ) {
+					list = [];
+				}
+				return this;
+			},
+
+			// Disable .fire and .add
+			// Abort any current/pending executions
+			// Clear all callbacks and values
+			disable: function() {
+				locked = queue = [];
+				list = memory = "";
+				return this;
+			},
+			disabled: function() {
+				return !list;
+			},
+
+			// Disable .fire
+			// Also disable .add unless we have memory (since it would have no effect)
+			// Abort any pending executions
+			lock: function() {
+				locked = queue = [];
+				if ( !memory && !firing ) {
+					list = memory = "";
+				}
+				return this;
+			},
+			locked: function() {
+				return !!locked;
+			},
+
+			// Call all callbacks with the given context and arguments
+			fireWith: function( context, args ) {
+				if ( !locked ) {
+					args = args || [];
+					args = [ context, args.slice ? args.slice() : args ];
+					queue.push( args );
+					if ( !firing ) {
+						fire();
+					}
+				}
+				return this;
+			},
+
+			// Call all the callbacks with the given arguments
+			fire: function() {
+				self.fireWith( this, arguments );
+				return this;
+			},
+
+			// To know if the callbacks have already been called at least once
+			fired: function() {
+				return !!fired;
+			}
+		};
+
+	return self;
+};
+
+
+function Identity( v ) {
+	return v;
+}
+function Thrower( ex ) {
+	throw ex;
+}
+
+function adoptValue( value, resolve, reject, noValue ) {
+	var method;
+
+	try {
+
+		// Check for promise aspect first to privilege synchronous behavior
+		if ( value && isFunction( ( method = value.promise ) ) ) {
+			method.call( value ).done( resolve ).fail( reject );
+
+		// Other thenables
+		} else if ( value && isFunction( ( method = value.then ) ) ) {
+			method.call( value, resolve, reject );
+
+		// Other non-thenables
+		} else {
+
+			// Control `resolve` arguments by letting Array#slice cast boolean `noValue` to integer:
+			// * false: [ value ].slice( 0 ) => resolve( value )
+			// * true: [ value ].slice( 1 ) => resolve()
+			resolve.apply( undefined, [ value ].slice( noValue ) );
+		}
+
+	// For Promises/A+, convert exceptions into rejections
+	// Since jQuery.when doesn't unwrap thenables, we can skip the extra checks appearing in
+	// Deferred#then to conditionally suppress rejection.
+	} catch ( value ) {
+
+		// Support: Android 4.0 only
+		// Strict mode functions invoked without .call/.apply get global-object context
+		reject.apply( undefined, [ value ] );
+	}
+}
+
+jQuery.extend( {
+
+	Deferred: function( func ) {
+		var tuples = [
+
+				// action, add listener, callbacks,
+				// ... .then handlers, argument index, [final state]
+				[ "notify", "progress", jQuery.Callbacks( "memory" ),
+					jQuery.Callbacks( "memory" ), 2 ],
+				[ "resolve", "done", jQuery.Callbacks( "once memory" ),
+					jQuery.Callbacks( "once memory" ), 0, "resolved" ],
+				[ "reject", "fail", jQuery.Callbacks( "once memory" ),
+					jQuery.Callbacks( "once memory" ), 1, "rejected" ]
+			],
+			state = "pending",
+			promise = {
+				state: function() {
+					return state;
+				},
+				always: function() {
+					deferred.done( arguments ).fail( arguments );
+					return this;
+				},
+				"catch": function( fn ) {
+					return promise.then( null, fn );
+				},
+
+				// Keep pipe for back-compat
+				pipe: function( /* fnDone, fnFail, fnProgress */ ) {
+					var fns = arguments;
+
+					return jQuery.Deferred( function( newDefer ) {
+						jQuery.each( tuples, function( _i, tuple ) {
+
+							// Map tuples (progress, done, fail) to arguments (done, fail, progress)
+							var fn = isFunction( fns[ tuple[ 4 ] ] ) && fns[ tuple[ 4 ] ];
+
+							// deferred.progress(function() { bind to newDefer or newDefer.notify })
+							// deferred.done(function() { bind to newDefer or newDefer.resolve })
+							// deferred.fail(function() { bind to newDefer or newDefer.reject })
+							deferred[ tuple[ 1 ] ]( function() {
+								var returned = fn && fn.apply( this, arguments );
+								if ( returned && isFunction( returned.promise ) ) {
+									returned.promise()
+										.progress( newDefer.notify )
+										.done( newDefer.resolve )
+										.fail( newDefer.reject );
+								} else {
+									newDefer[ tuple[ 0 ] + "With" ](
+										this,
+										fn ? [ returned ] : arguments
+									);
+								}
+							} );
+						} );
+						fns = null;
+					} ).promise();
+				},
+				then: function( onFulfilled, onRejected, onProgress ) {
+					var maxDepth = 0;
+					function resolve( depth, deferred, handler, special ) {
+						return function() {
+							var that = this,
+								args = arguments,
+								mightThrow = function() {
+									var returned, then;
+
+									// Support: Promises/A+ section 2.3.3.3.3
+									// https://promisesaplus.com/#point-59
+									// Ignore double-resolution attempts
+									if ( depth < maxDepth ) {
+										return;
+									}
+
+									returned = handler.apply( that, args );
+
+									// Support: Promises/A+ section 2.3.1
+									// https://promisesaplus.com/#point-48
+									if ( returned === deferred.promise() ) {
+										throw new TypeError( "Thenable self-resolution" );
+									}
+
+									// Support: Promises/A+ sections 2.3.3.1, 3.5
+									// https://promisesaplus.com/#point-54
+									// https://promisesaplus.com/#point-75
+									// Retrieve `then` only once
+									then = returned &&
+
+										// Support: Promises/A+ section 2.3.4
+										// https://promisesaplus.com/#point-64
+										// Only check objects and functions for thenability
+										( typeof returned === "object" ||
+											typeof returned === "function" ) &&
+										returned.then;
+
+									// Handle a returned thenable
+									if ( isFunction( then ) ) {
+
+										// Special processors (notify) just wait for resolution
+										if ( special ) {
+											then.call(
+												returned,
+												resolve( maxDepth, deferred, Identity, special ),
+												resolve( maxDepth, deferred, Thrower, special )
+											);
+
+										// Normal processors (resolve) also hook into progress
+										} else {
+
+											// ...and disregard older resolution values
+											maxDepth++;
+
+											then.call(
+												returned,
+												resolve( maxDepth, deferred, Identity, special ),
+												resolve( maxDepth, deferred, Thrower, special ),
+												resolve( maxDepth, deferred, Identity,
+													deferred.notifyWith )
+											);
+										}
+
+									// Handle all other returned values
+									} else {
+
+										// Only substitute handlers pass on context
+										// and multiple values (non-spec behavior)
+										if ( handler !== Identity ) {
+											that = undefined;
+											args = [ returned ];
+										}
+
+										// Process the value(s)
+										// Default process is resolve
+										( special || deferred.resolveWith )( that, args );
+									}
+								},
+
+								// Only normal processors (resolve) catch and reject exceptions
+								process = special ?
+									mightThrow :
+									function() {
+										try {
+											mightThrow();
+										} catch ( e ) {
+
+											if ( jQuery.Deferred.exceptionHook ) {
+												jQuery.Deferred.exceptionHook( e,
+													process.stackTrace );
+											}
+
+											// Support: Promises/A+ section 2.3.3.3.4.1
+											// https://promisesaplus.com/#point-61
+											// Ignore post-resolution exceptions
+											if ( depth + 1 >= maxDepth ) {
+
+												// Only substitute handlers pass on context
+												// and multiple values (non-spec behavior)
+												if ( handler !== Thrower ) {
+													that = undefined;
+													args = [ e ];
+												}
+
+												deferred.rejectWith( that, args );
+											}
+										}
+									};
+
+							// Support: Promises/A+ section 2.3.3.3.1
+							// https://promisesaplus.com/#point-57
+							// Re-resolve promises immediately to dodge false rejection from
+							// subsequent errors
+							if ( depth ) {
+								process();
+							} else {
+
+								// Call an optional hook to record the stack, in case of exception
+								// since it's otherwise lost when execution goes async
+								if ( jQuery.Deferred.getStackHook ) {
+									process.stackTrace = jQuery.Deferred.getStackHook();
+								}
+								window.setTimeout( process );
+							}
+						};
+					}
+
+					return jQuery.Deferred( function( newDefer ) {
+
+						// progress_handlers.add( ... )
+						tuples[ 0 ][ 3 ].add(
+							resolve(
+								0,
+								newDefer,
+								isFunction( onProgress ) ?
+									onProgress :
+									Identity,
+								newDefer.notifyWith
+							)
+						);
+
+						// fulfilled_handlers.add( ... )
+						tuples[ 1 ][ 3 ].add(
+							resolve(
+								0,
+								newDefer,
+								isFunction( onFulfilled ) ?
+									onFulfilled :
+									Identity
+							)
+						);
+
+						// rejected_handlers.add( ... )
+						tuples[ 2 ][ 3 ].add(
+							resolve(
+								0,
+								newDefer,
+								isFunction( onRejected ) ?
+									onRejected :
+									Thrower
+							)
+						);
+					} ).promise();
+				},
+
+				// Get a promise for this deferred
+				// If obj is provided, the promise aspect is added to the object
+				promise: function( obj ) {
+					return obj != null ? jQuery.extend( obj, promise ) : promise;
+				}
+			},
+			deferred = {};
+
+		// Add list-specific methods
+		jQuery.each( tuples, function( i, tuple ) {
+			var list = tuple[ 2 ],
+				stateString = tuple[ 5 ];
+
+			// promise.progress = list.add
+			// promise.done = list.add
+			// promise.fail = list.add
+			promise[ tuple[ 1 ] ] = list.add;
+
+			// Handle state
+			if ( stateString ) {
+				list.add(
+					function() {
+
+						// state = "resolved" (i.e., fulfilled)
+						// state = "rejected"
+						state = stateString;
+					},
+
+					// rejected_callbacks.disable
+					// fulfilled_callbacks.disable
+					tuples[ 3 - i ][ 2 ].disable,
+
+					// rejected_handlers.disable
+					// fulfilled_handlers.disable
+					tuples[ 3 - i ][ 3 ].disable,
+
+					// progress_callbacks.lock
+					tuples[ 0 ][ 2 ].lock,
+
+					// progress_handlers.lock
+					tuples[ 0 ][ 3 ].lock
+				);
+			}
+
+			// progress_handlers.fire
+			// fulfilled_handlers.fire
+			// rejected_handlers.fire
+			list.add( tuple[ 3 ].fire );
+
+			// deferred.notify = function() { deferred.notifyWith(...) }
+			// deferred.resolve = function() { deferred.resolveWith(...) }
+			// deferred.reject = function() { deferred.rejectWith(...) }
+			deferred[ tuple[ 0 ] ] = function() {
+				deferred[ tuple[ 0 ] + "With" ]( this === deferred ? undefined : this, arguments );
+				return this;
+			};
+
+			// deferred.notifyWith = list.fireWith
+			// deferred.resolveWith = list.fireWith
+			// deferred.rejectWith = list.fireWith
+			deferred[ tuple[ 0 ] + "With" ] = list.fireWith;
+		} );
+
+		// Make the deferred a promise
+		promise.promise( deferred );
+
+		// Call given func if any
+		if ( func ) {
+			func.call( deferred, deferred );
+		}
+
+		// All done!
+		return deferred;
+	},
+
+	// Deferred helper
+	when: function( singleValue ) {
+		var
+
+			// count of uncompleted subordinates
+			remaining = arguments.length,
+
+			// count of unprocessed arguments
+			i = remaining,
+
+			// subordinate fulfillment data
+			resolveContexts = Array( i ),
+			resolveValues = slice.call( arguments ),
+
+			// the primary Deferred
+			primary = jQuery.Deferred(),
+
+			// subordinate callback factory
+			updateFunc = function( i ) {
+				return function( value ) {
+					resolveContexts[ i ] = this;
+					resolveValues[ i ] = arguments.length > 1 ? slice.call( arguments ) : value;
+					if ( !( --remaining ) ) {
+						primary.resolveWith( resolveContexts, resolveValues );
+					}
+				};
+			};
+
+		// Single- and empty arguments are adopted like Promise.resolve
+		if ( remaining <= 1 ) {
+			adoptValue( singleValue, primary.done( updateFunc( i ) ).resolve, primary.reject,
+				!remaining );
+
+			// Use .then() to unwrap secondary thenables (cf. gh-3000)
+			if ( primary.state() === "pending" ||
+				isFunction( resolveValues[ i ] && resolveValues[ i ].then ) ) {
+
+				return primary.then();
+			}
+		}
+
+		// Multiple arguments are aggregated like Promise.all array elements
+		while ( i-- ) {
+			adoptValue( resolveValues[ i ], updateFunc( i ), primary.reject );
+		}
+
+		return primary.promise();
+	}
+} );
+
+
+// These usually indicate a programmer mistake during development,
+// warn about them ASAP rather than swallowing them by default.
+var rerrorNames = /^(Eval|Internal|Range|Reference|Syntax|Type|URI)Error$/;
+
+jQuery.Deferred.exceptionHook = function( error, stack ) {
+
+	// Support: IE 8 - 9 only
+	// Console exists when dev tools are open, which can happen at any time
+	if ( window.console && window.console.warn && error && rerrorNames.test( error.name ) ) {
+		window.console.warn( "jQuery.Deferred exception: " + error.message, error.stack, stack );
+	}
+};
+
+
+
+
+jQuery.readyException = function( error ) {
+	window.setTimeout( function() {
+		throw error;
+	} );
+};
+
+
+
+
+// The deferred used on DOM ready
+var readyList = jQuery.Deferred();
+
+jQuery.fn.ready = function( fn ) {
+
+	readyList
+		.then( fn )
+
+		// Wrap jQuery.readyException in a function so that the lookup
+		// happens at the time of error handling instead of callback
+		// registration.
+		.catch( function( error ) {
+			jQuery.readyException( error );
+		} );
+
+	return this;
+};
+
+jQuery.extend( {
+
+	// Is the DOM ready to be used? Set to true once it occurs.
+	isReady: false,
+
+	// A counter to track how many items to wait for before
+	// the ready event fires. See #6781
+	readyWait: 1,
+
+	// Handle when the DOM is ready
+	ready: function( wait ) {
+
+		// Abort if there are pending holds or we're already ready
+		if ( wait === true ? --jQuery.readyWait : jQuery.isReady ) {
+			return;
+		}
+
+		// Remember that the DOM is ready
+		jQuery.isReady = true;
+
+		// If a normal DOM Ready event fired, decrement, and wait if need be
+		if ( wait !== true && --jQuery.readyWait > 0 ) {
+			return;
+		}
+
+		// If there are functions bound, to execute
+		readyList.resolveWith( document, [ jQuery ] );
+	}
+} );
+
+jQuery.ready.then = readyList.then;
+
+// The ready event handler and self cleanup method
+function completed() {
+	document.removeEventListener( "DOMContentLoaded", completed );
+	window.removeEventListener( "load", completed );
+	jQuery.ready();
+}
+
+// Catch cases where $(document).ready() is called
+// after the browser event has already occurred.
+// Support: IE <=9 - 10 only
+// Older IE sometimes signals "interactive" too soon
+if ( document.readyState === "complete" ||
+	( document.readyState !== "loading" && !document.documentElement.doScroll ) ) {
+
+	// Handle it asynchronously to allow scripts the opportunity to delay ready
+	window.setTimeout( jQuery.ready );
+
+} else {
+
+	// Use the handy event callback
+	document.addEventListener( "DOMContentLoaded", completed );
+
+	// A fallback to window.onload, that will always work
+	window.addEventListener( "load", completed );
+}
+
+
+
+
+// Multifunctional method to get and set values of a collection
+// The value/s can optionally be executed if it's a function
+var access = function( elems, fn, key, value, chainable, emptyGet, raw ) {
+	var i = 0,
+		len = elems.length,
+		bulk = key == null;
+
+	// Sets many values
+	if ( toType( key ) === "object" ) {
+		chainable = true;
+		for ( i in key ) {
+			access( elems, fn, i, key[ i ], true, emptyGet, raw );
+		}
+
+	// Sets one value
+	} else if ( value !== undefined ) {
+		chainable = true;
+
+		if ( !isFunction( value ) ) {
+			raw = true;
+		}
+
+		if ( bulk ) {
+
+			// Bulk operations run against the entire set
+			if ( raw ) {
+				fn.call( elems, value );
+				fn = null;
+
+			// ...except when executing function values
+			} else {
+				bulk = fn;
+				fn = function( elem, _key, value ) {
+					return bulk.call( jQuery( elem ), value );
+				};
+			}
+		}
+
+		if ( fn ) {
+			for ( ; i < len; i++ ) {
+				fn(
+					elems[ i ], key, raw ?
+						value :
+						value.call( elems[ i ], i, fn( elems[ i ], key ) )
+				);
+			}
+		}
+	}
+
+	if ( chainable ) {
+		return elems;
+	}
+
+	// Gets
+	if ( bulk ) {
+		return fn.call( elems );
+	}
+
+	return len ? fn( elems[ 0 ], key ) : emptyGet;
+};
+
+
+// Matches dashed string for camelizing
+var rmsPrefix = /^-ms-/,
+	rdashAlpha = /-([a-z])/g;
+
+// Used by camelCase as callback to replace()
+function fcamelCase( _all, letter ) {
+	return letter.toUpperCase();
+}
+
+// Convert dashed to camelCase; used by the css and data modules
+// Support: IE <=9 - 11, Edge 12 - 15
+// Microsoft forgot to hump their vendor prefix (#9572)
+function camelCase( string ) {
+	return string.replace( rmsPrefix, "ms-" ).replace( rdashAlpha, fcamelCase );
+}
+var acceptData = function( owner ) {
+
+	// Accepts only:
+	//  - Node
+	//    - Node.ELEMENT_NODE
+	//    - Node.DOCUMENT_NODE
+	//  - Object
+	//    - Any
+	return owner.nodeType === 1 || owner.nodeType === 9 || !( +owner.nodeType );
+};
+
+
+
+
+function Data() {
+	this.expando = jQuery.expando + Data.uid++;
+}
+
+Data.uid = 1;
+
+Data.prototype = {
+
+	cache: function( owner ) {
+
+		// Check if the owner object already has a cache
+		var value = owner[ this.expando ];
+
+		// If not, create one
+		if ( !value ) {
+			value = {};
+
+			// We can accept data for non-element nodes in modern browsers,
+			// but we should not, see #8335.
+			// Always return an empty object.
+			if ( acceptData( owner ) ) {
+
+				// If it is a node unlikely to be stringify-ed or looped over
+				// use plain assignment
+				if ( owner.nodeType ) {
+					owner[ this.expando ] = value;
+
+				// Otherwise secure it in a non-enumerable property
+				// configurable must be true to allow the property to be
+				// deleted when data is removed
+				} else {
+					Object.defineProperty( owner, this.expando, {
+						value: value,
+						configurable: true
+					} );
+				}
+			}
+		}
+
+		return value;
+	},
+	set: function( owner, data, value ) {
+		var prop,
+			cache = this.cache( owner );
+
+		// Handle: [ owner, key, value ] args
+		// Always use camelCase key (gh-2257)
+		if ( typeof data === "string" ) {
+			cache[ camelCase( data ) ] = value;
+
+		// Handle: [ owner, { properties } ] args
+		} else {
+
+			// Copy the properties one-by-one to the cache object
+			for ( prop in data ) {
+				cache[ camelCase( prop ) ] = data[ prop ];
+			}
+		}
+		return cache;
+	},
+	get: function( owner, key ) {
+		return key === undefined ?
+			this.cache( owner ) :
+
+			// Always use camelCase key (gh-2257)
+			owner[ this.expando ] && owner[ this.expando ][ camelCase( key ) ];
+	},
+	access: function( owner, key, value ) {
+
+		// In cases where either:
+		//
+		//   1. No key was specified
+		//   2. A string key was specified, but no value provided
+		//
+		// Take the "read" path and allow the get method to determine
+		// which value to return, respectively either:
+		//
+		//   1. The entire cache object
+		//   2. The data stored at the key
+		//
+		if ( key === undefined ||
+				( ( key && typeof key === "string" ) && value === undefined ) ) {
+
+			return this.get( owner, key );
+		}
+
+		// When the key is not a string, or both a key and value
+		// are specified, set or extend (existing objects) with either:
+		//
+		//   1. An object of properties
+		//   2. A key and value
+		//
+		this.set( owner, key, value );
+
+		// Since the "set" path can have two possible entry points
+		// return the expected data based on which path was taken[*]
+		return value !== undefined ? value : key;
+	},
+	remove: function( owner, key ) {
+		var i,
+			cache = owner[ this.expando ];
+
+		if ( cache === undefined ) {
+			return;
+		}
+
+		if ( key !== undefined ) {
+
+			// Support array or space separated string of keys
+			if ( Array.isArray( key ) ) {
+
+				// If key is an array of keys...
+				// We always set camelCase keys, so remove that.
+				key = key.map( camelCase );
+			} else {
+				key = camelCase( key );
+
+				// If a key with the spaces exists, use it.
+				// Otherwise, create an array by matching non-whitespace
+				key = key in cache ?
+					[ key ] :
+					( key.match( rnothtmlwhite ) || [] );
+			}
+
+			i = key.length;
+
+			while ( i-- ) {
+				delete cache[ key[ i ] ];
+			}
+		}
+
+		// Remove the expando if there's no more data
+		if ( key === undefined || jQuery.isEmptyObject( cache ) ) {
+
+			// Support: Chrome <=35 - 45
+			// Webkit & Blink performance suffers when deleting properties
+			// from DOM nodes, so set to undefined instead
+			// https://bugs.chromium.org/p/chromium/issues/detail?id=378607 (bug restricted)
+			if ( owner.nodeType ) {
+				owner[ this.expando ] = undefined;
+			} else {
+				delete owner[ this.expando ];
+			}
+		}
+	},
+	hasData: function( owner ) {
+		var cache = owner[ this.expando ];
+		return cache !== undefined && !jQuery.isEmptyObject( cache );
+	}
+};
+var dataPriv = new Data();
+
+var dataUser = new Data();
+
+
+
+//	Implementation Summary
+//
+//	1. Enforce API surface and semantic compatibility with 1.9.x branch
+//	2. Improve the module's maintainability by reducing the storage
+//		paths to a single mechanism.
+//	3. Use the same single mechanism to support "private" and "user" data.
+//	4. _Never_ expose "private" data to user code (TODO: Drop _data, _removeData)
+//	5. Avoid exposing implementation details on user objects (eg. expando properties)
+//	6. Provide a clear path for implementation upgrade to WeakMap in 2014
+
+var rbrace = /^(?:\{[\w\W]*\}|\[[\w\W]*\])$/,
+	rmultiDash = /[A-Z]/g;
+
+function getData( data ) {
+	if ( data === "true" ) {
+		return true;
+	}
+
+	if ( data === "false" ) {
+		return false;
+	}
+
+	if ( data === "null" ) {
+		return null;
+	}
+
+	// Only convert to a number if it doesn't change the string
+	if ( data === +data + "" ) {
+		return +data;
+	}
+
+	if ( rbrace.test( data ) ) {
+		return JSON.parse( data );
+	}
+
+	return data;
+}
+
+function dataAttr( elem, key, data ) {
+	var name;
+
+	// If nothing was found internally, try to fetch any
+	// data from the HTML5 data-* attribute
+	if ( data === undefined && elem.nodeType === 1 ) {
+		name = "data-" + key.replace( rmultiDash, "-$&" ).toLowerCase();
+		data = elem.getAttribute( name );
+
+		if ( typeof data === "string" ) {
+			try {
+				data = getData( data );
+			} catch ( e ) {}
+
+			// Make sure we set the data so it isn't changed later
+			dataUser.set( elem, key, data );
+		} else {
+			data = undefined;
+		}
+	}
+	return data;
+}
+
+jQuery.extend( {
+	hasData: function( elem ) {
+		return dataUser.hasData( elem ) || dataPriv.hasData( elem );
+	},
+
+	data: function( elem, name, data ) {
+		return dataUser.access( elem, name, data );
+	},
+
+	removeData: function( elem, name ) {
+		dataUser.remove( elem, name );
+	},
+
+	// TODO: Now that all calls to _data and _removeData have been replaced
+	// with direct calls to dataPriv methods, these can be deprecated.
+	_data: function( elem, name, data ) {
+		return dataPriv.access( elem, name, data );
+	},
+
+	_removeData: function( elem, name ) {
+		dataPriv.remove( elem, name );
+	}
+} );
+
+jQuery.fn.extend( {
+	data: function( key, value ) {
+		var i, name, data,
+			elem = this[ 0 ],
+			attrs = elem && elem.attributes;
+
+		// Gets all values
+		if ( key === undefined ) {
+			if ( this.length ) {
+				data = dataUser.get( elem );
+
+				if ( elem.nodeType === 1 && !dataPriv.get( elem, "hasDataAttrs" ) ) {
+					i = attrs.length;
+					while ( i-- ) {
+
+						// Support: IE 11 only
+						// The attrs elements can be null (#14894)
+						if ( attrs[ i ] ) {
+							name = attrs[ i ].name;
+							if ( name.indexOf( "data-" ) === 0 ) {
+								name = camelCase( name.slice( 5 ) );
+								dataAttr( elem, name, data[ name ] );
+							}
+						}
+					}
+					dataPriv.set( elem, "hasDataAttrs", true );
+				}
+			}
+
+			return data;
+		}
+
+		// Sets multiple values
+		if ( typeof key === "object" ) {
+			return this.each( function() {
+				dataUser.set( this, key );
+			} );
+		}
+
+		return access( this, function( value ) {
+			var data;
+
+			// The calling jQuery object (element matches) is not empty
+			// (and therefore has an element appears at this[ 0 ]) and the
+			// `value` parameter was not undefined. An empty jQuery object
+			// will result in `undefined` for elem = this[ 0 ] which will
+			// throw an exception if an attempt to read a data cache is made.
+			if ( elem && value === undefined ) {
+
+				// Attempt to get data from the cache
+				// The key will always be camelCased in Data
+				data = dataUser.get( elem, key );
+				if ( data !== undefined ) {
+					return data;
+				}
+
+				// Attempt to "discover" the data in
+				// HTML5 custom data-* attrs
+				data = dataAttr( elem, key );
+				if ( data !== undefined ) {
+					return data;
+				}
+
+				// We tried really hard, but the data doesn't exist.
+				return;
+			}
+
+			// Set the data...
+			this.each( function() {
+
+				// We always store the camelCased key
+				dataUser.set( this, key, value );
+			} );
+		}, null, value, arguments.length > 1, null, true );
+	},
+
+	removeData: function( key ) {
+		return this.each( function() {
+			dataUser.remove( this, key );
+		} );
+	}
+} );
+
+
+jQuery.extend( {
+	queue: function( elem, type, data ) {
+		var queue;
+
+		if ( elem ) {
+			type = ( type || "fx" ) + "queue";
+			queue = dataPriv.get( elem, type );
+
+			// Speed up dequeue by getting out quickly if this is just a lookup
+			if ( data ) {
+				if ( !queue || Array.isArray( data ) ) {
+					queue = dataPriv.access( elem, type, jQuery.makeArray( data ) );
+				} else {
+					queue.push( data );
+				}
+			}
+			return queue || [];
+		}
+	},
+
+	dequeue: function( elem, type ) {
+		type = type || "fx";
+
+		var queue = jQuery.queue( elem, type ),
+			startLength = queue.length,
+			fn = queue.shift(),
+			hooks = jQuery._queueHooks( elem, type ),
+			next = function() {
+				jQuery.dequeue( elem, type );
+			};
+
+		// If the fx queue is dequeued, always remove the progress sentinel
+		if ( fn === "inprogress" ) {
+			fn = queue.shift();
+			startLength--;
+		}
+
+		if ( fn ) {
+
+			// Add a progress sentinel to prevent the fx queue from being
+			// automatically dequeued
+			if ( type === "fx" ) {
+				queue.unshift( "inprogress" );
+			}
+
+			// Clear up the last queue stop function
+			delete hooks.stop;
+			fn.call( elem, next, hooks );
+		}
+
+		if ( !startLength && hooks ) {
+			hooks.empty.fire();
+		}
+	},
+
+	// Not public - generate a queueHooks object, or return the current one
+	_queueHooks: function( elem, type ) {
+		var key = type + "queueHooks";
+		return dataPriv.get( elem, key ) || dataPriv.access( elem, key, {
+			empty: jQuery.Callbacks( "once memory" ).add( function() {
+				dataPriv.remove( elem, [ type + "queue", key ] );
+			} )
+		} );
+	}
+} );
+
+jQuery.fn.extend( {
+	queue: function( type, data ) {
+		var setter = 2;
+
+		if ( typeof type !== "string" ) {
+			data = type;
+			type = "fx";
+			setter--;
+		}
+
+		if ( arguments.length < setter ) {
+			return jQuery.queue( this[ 0 ], type );
+		}
+
+		return data === undefined ?
+			this :
+			this.each( function() {
+				var queue = jQuery.queue( this, type, data );
+
+				// Ensure a hooks for this queue
+				jQuery._queueHooks( this, type );
+
+				if ( type === "fx" && queue[ 0 ] !== "inprogress" ) {
+					jQuery.dequeue( this, type );
+				}
+			} );
+	},
+	dequeue: function( type ) {
+		return this.each( function() {
+			jQuery.dequeue( this, type );
+		} );
+	},
+	clearQueue: function( type ) {
+		return this.queue( type || "fx", [] );
+	},
+
+	// Get a promise resolved when queues of a certain type
+	// are emptied (fx is the type by default)
+	promise: function( type, obj ) {
+		var tmp,
+			count = 1,
+			defer = jQuery.Deferred(),
+			elements = this,
+			i = this.length,
+			resolve = function() {
+				if ( !( --count ) ) {
+					defer.resolveWith( elements, [ elements ] );
+				}
+			};
+
+		if ( typeof type !== "string" ) {
+			obj = type;
+			type = undefined;
+		}
+		type = type || "fx";
+
+		while ( i-- ) {
+			tmp = dataPriv.get( elements[ i ], type + "queueHooks" );
+			if ( tmp && tmp.empty ) {
+				count++;
+				tmp.empty.add( resolve );
+			}
+		}
+		resolve();
+		return defer.promise( obj );
+	}
+} );
+var pnum = ( /[+-]?(?:\d*\.|)\d+(?:[eE][+-]?\d+|)/ ).source;
+
+var rcssNum = new RegExp( "^(?:([+-])=|)(" + pnum + ")([a-z%]*)$", "i" );
+
+
+var cssExpand = [ "Top", "Right", "Bottom", "Left" ];
+
+var documentElement = document.documentElement;
+
+
+
+	var isAttached = function( elem ) {
+			return jQuery.contains( elem.ownerDocument, elem );
+		},
+		composed = { composed: true };
+
+	// Support: IE 9 - 11+, Edge 12 - 18+, iOS 10.0 - 10.2 only
+	// Check attachment across shadow DOM boundaries when possible (gh-3504)
+	// Support: iOS 10.0-10.2 only
+	// Early iOS 10 versions support `attachShadow` but not `getRootNode`,
+	// leading to errors. We need to check for `getRootNode`.
+	if ( documentElement.getRootNode ) {
+		isAttached = function( elem ) {
+			return jQuery.contains( elem.ownerDocument, elem ) ||
+				elem.getRootNode( composed ) === elem.ownerDocument;
+		};
+	}
+var isHiddenWithinTree = function( elem, el ) {
+
+		// isHiddenWithinTree might be called from jQuery#filter function;
+		// in that case, element will be second argument
+		elem = el || elem;
+
+		// Inline style trumps all
+		return elem.style.display === "none" ||
+			elem.style.display === "" &&
+
+			// Otherwise, check computed style
+			// Support: Firefox <=43 - 45
+			// Disconnected elements can have computed display: none, so first confirm that elem is
+			// in the document.
+			isAttached( elem ) &&
+
+			jQuery.css( elem, "display" ) === "none";
+	};
+
+
+
+function adjustCSS( elem, prop, valueParts, tween ) {
+	var adjusted, scale,
+		maxIterations = 20,
+		currentValue = tween ?
+			function() {
+				return tween.cur();
+			} :
+			function() {
+				return jQuery.css( elem, prop, "" );
+			},
+		initial = currentValue(),
+		unit = valueParts && valueParts[ 3 ] || ( jQuery.cssNumber[ prop ] ? "" : "px" ),
+
+		// Starting value computation is required for potential unit mismatches
+		initialInUnit = elem.nodeType &&
+			( jQuery.cssNumber[ prop ] || unit !== "px" && +initial ) &&
+			rcssNum.exec( jQuery.css( elem, prop ) );
+
+	if ( initialInUnit && initialInUnit[ 3 ] !== unit ) {
+
+		// Support: Firefox <=54
+		// Halve the iteration target value to prevent interference from CSS upper bounds (gh-2144)
+		initial = initial / 2;
+
+		// Trust units reported by jQuery.css
+		unit = unit || initialInUnit[ 3 ];
+
+		// Iteratively approximate from a nonzero starting point
+		initialInUnit = +initial || 1;
+
+		while ( maxIterations-- ) {
+
+			// Evaluate and update our best guess (doubling guesses that zero out).
+			// Finish if the scale equals or crosses 1 (making the old*new product non-positive).
+			jQuery.style( elem, prop, initialInUnit + unit );
+			if ( ( 1 - scale ) * ( 1 - ( scale = currentValue() / initial || 0.5 ) ) <= 0 ) {
+				maxIterations = 0;
+			}
+			initialInUnit = initialInUnit / scale;
+
+		}
+
+		initialInUnit = initialInUnit * 2;
+		jQuery.style( elem, prop, initialInUnit + unit );
+
+		// Make sure we update the tween properties later on
+		valueParts = valueParts || [];
+	}
+
+	if ( valueParts ) {
+		initialInUnit = +initialInUnit || +initial || 0;
+
+		// Apply relative offset (+=/-=) if specified
+		adjusted = valueParts[ 1 ] ?
+			initialInUnit + ( valueParts[ 1 ] + 1 ) * valueParts[ 2 ] :
+			+valueParts[ 2 ];
+		if ( tween ) {
+			tween.unit = unit;
+			tween.start = initialInUnit;
+			tween.end = adjusted;
+		}
+	}
+	return adjusted;
+}
+
+
+var defaultDisplayMap = {};
+
+function getDefaultDisplay( elem ) {
+	var temp,
+		doc = elem.ownerDocument,
+		nodeName = elem.nodeName,
+		display = defaultDisplayMap[ nodeName ];
+
+	if ( display ) {
+		return display;
+	}
+
+	temp = doc.body.appendChild( doc.createElement( nodeName ) );
+	display = jQuery.css( temp, "display" );
+
+	temp.parentNode.removeChild( temp );
+
+	if ( display === "none" ) {
+		display = "block";
+	}
+	defaultDisplayMap[ nodeName ] = display;
+
+	return display;
+}
+
+function showHide( elements, show ) {
+	var display, elem,
+		values = [],
+		index = 0,
+		length = elements.length;
+
+	// Determine new display value for elements that need to change
+	for ( ; index < length; index++ ) {
+		elem = elements[ index ];
+		if ( !elem.style ) {
+			continue;
+		}
+
+		display = elem.style.display;
+		if ( show ) {
+
+			// Since we force visibility upon cascade-hidden elements, an immediate (and slow)
+			// check is required in this first loop unless we have a nonempty display value (either
+			// inline or about-to-be-restored)
+			if ( display === "none" ) {
+				values[ index ] = dataPriv.get( elem, "display" ) || null;
+				if ( !values[ index ] ) {
+					elem.style.display = "";
+				}
+			}
+			if ( elem.style.display === "" && isHiddenWithinTree( elem ) ) {
+				values[ index ] = getDefaultDisplay( elem );
+			}
+		} else {
+			if ( display !== "none" ) {
+				values[ index ] = "none";
+
+				// Remember what we're overwriting
+				dataPriv.set( elem, "display", display );
+			}
+		}
+	}
+
+	// Set the display of the elements in a second loop to avoid constant reflow
+	for ( index = 0; index < length; index++ ) {
+		if ( values[ index ] != null ) {
+			elements[ index ].style.display = values[ index ];
+		}
+	}
+
+	return elements;
+}
+
+jQuery.fn.extend( {
+	show: function() {
+		return showHide( this, true );
+	},
+	hide: function() {
+		return showHide( this );
+	},
+	toggle: function( state ) {
+		if ( typeof state === "boolean" ) {
+			return state ? this.show() : this.hide();
+		}
+
+		return this.each( function() {
+			if ( isHiddenWithinTree( this ) ) {
+				jQuery( this ).show();
+			} else {
+				jQuery( this ).hide();
+			}
+		} );
+	}
+} );
+var rcheckableType = ( /^(?:checkbox|radio)$/i );
+
+var rtagName = ( /<([a-z][^\/\0>\x20\t\r\n\f]*)/i );
+
+var rscriptType = ( /^$|^module$|\/(?:java|ecma)script/i );
+
+
+
+( function() {
+	var fragment = document.createDocumentFragment(),
+		div = fragment.appendChild( document.createElement( "div" ) ),
+		input = document.createElement( "input" );
+
+	// Support: Android 4.0 - 4.3 only
+	// Check state lost if the name is set (#11217)
+	// Support: Windows Web Apps (WWA)
+	// `name` and `type` must use .setAttribute for WWA (#14901)
+	input.setAttribute( "type", "radio" );
+	input.setAttribute( "checked", "checked" );
+	input.setAttribute( "name", "t" );
+
+	div.appendChild( input );
+
+	// Support: Android <=4.1 only
+	// Older WebKit doesn't clone checked state correctly in fragments
+	support.checkClone = div.cloneNode( true ).cloneNode( true ).lastChild.checked;
+
+	// Support: IE <=11 only
+	// Make sure textarea (and checkbox) defaultValue is properly cloned
+	div.innerHTML = "<textarea>x</textarea>";
+	support.noCloneChecked = !!div.cloneNode( true ).lastChild.defaultValue;
+
+	// Support: IE <=9 only
+	// IE <=9 replaces <option> tags with their contents when inserted outside of
+	// the select element.
+	div.innerHTML = "<option></option>";
+	support.option = !!div.lastChild;
+} )();
+
+
+// We have to close these tags to support XHTML (#13200)
+var wrapMap = {
+
+	// XHTML parsers do not magically insert elements in the
+	// same way that tag soup parsers do. So we cannot shorten
+	// this by omitting <tbody> or other required elements.
+	thead: [ 1, "<table>", "</table>" ],
+	col: [ 2, "<table><colgroup>", "</colgroup></table>" ],
+	tr: [ 2, "<table><tbody>", "</tbody></table>" ],
+	td: [ 3, "<table><tbody><tr>", "</tr></tbody></table>" ],
+
+	_default: [ 0, "", "" ]
+};
+
+wrapMap.tbody = wrapMap.tfoot = wrapMap.colgroup = wrapMap.caption = wrapMap.thead;
+wrapMap.th = wrapMap.td;
+
+// Support: IE <=9 only
+if ( !support.option ) {
+	wrapMap.optgroup = wrapMap.option = [ 1, "<select multiple='multiple'>", "</select>" ];
+}
+
+
+function getAll( context, tag ) {
+
+	// Support: IE <=9 - 11 only
+	// Use typeof to avoid zero-argument method invocation on host objects (#15151)
+	var ret;
+
+	if ( typeof context.getElementsByTagName !== "undefined" ) {
+		ret = context.getElementsByTagName( tag || "*" );
+
+	} else if ( typeof context.querySelectorAll !== "undefined" ) {
+		ret = context.querySelectorAll( tag || "*" );
+
+	} else {
+		ret = [];
+	}
+
+	if ( tag === undefined || tag && nodeName( context, tag ) ) {
+		return jQuery.merge( [ context ], ret );
+	}
+
+	return ret;
+}
+
+
+// Mark scripts as having already been evaluated
+function setGlobalEval( elems, refElements ) {
+	var i = 0,
+		l = elems.length;
+
+	for ( ; i < l; i++ ) {
+		dataPriv.set(
+			elems[ i ],
+			"globalEval",
+			!refElements || dataPriv.get( refElements[ i ], "globalEval" )
+		);
+	}
+}
+
+
+var rhtml = /<|&#?\w+;/;
+
+function buildFragment( elems, context, scripts, selection, ignored ) {
+	var elem, tmp, tag, wrap, attached, j,
+		fragment = context.createDocumentFragment(),
+		nodes = [],
+		i = 0,
+		l = elems.length;
+
+	for ( ; i < l; i++ ) {
+		elem = elems[ i ];
+
+		if ( elem || elem === 0 ) {
+
+			// Add nodes directly
+			if ( toType( elem ) === "object" ) {
+
+				// Support: Android <=4.0 only, PhantomJS 1 only
+				// push.apply(_, arraylike) throws on ancient WebKit
+				jQuery.merge( nodes, elem.nodeType ? [ elem ] : elem );
+
+			// Convert non-html into a text node
+			} else if ( !rhtml.test( elem ) ) {
+				nodes.push( context.createTextNode( elem ) );
+
+			// Convert html into DOM nodes
+			} else {
+				tmp = tmp || fragment.appendChild( context.createElement( "div" ) );
+
+				// Deserialize a standard representation
+				tag = ( rtagName.exec( elem ) || [ "", "" ] )[ 1 ].toLowerCase();
+				wrap = wrapMap[ tag ] || wrapMap._default;
+				tmp.innerHTML = wrap[ 1 ] + jQuery.htmlPrefilter( elem ) + wrap[ 2 ];
+
+				// Descend through wrappers to the right content
+				j = wrap[ 0 ];
+				while ( j-- ) {
+					tmp = tmp.lastChild;
+				}
+
+				// Support: Android <=4.0 only, PhantomJS 1 only
+				// push.apply(_, arraylike) throws on ancient WebKit
+				jQuery.merge( nodes, tmp.childNodes );
+
+				// Remember the top-level container
+				tmp = fragment.firstChild;
+
+				// Ensure the created nodes are orphaned (#12392)
+				tmp.textContent = "";
+			}
+		}
+	}
+
+	// Remove wrapper from fragment
+	fragment.textContent = "";
+
+	i = 0;
+	while ( ( elem = nodes[ i++ ] ) ) {
+
+		// Skip elements already in the context collection (trac-4087)
+		if ( selection && jQuery.inArray( elem, selection ) > -1 ) {
+			if ( ignored ) {
+				ignored.push( elem );
+			}
+			continue;
+		}
+
+		attached = isAttached( elem );
+
+		// Append to fragment
+		tmp = getAll( fragment.appendChild( elem ), "script" );
+
+		// Preserve script evaluation history
+		if ( attached ) {
+			setGlobalEval( tmp );
+		}
+
+		// Capture executables
+		if ( scripts ) {
+			j = 0;
+			while ( ( elem = tmp[ j++ ] ) ) {
+				if ( rscriptType.test( elem.type || "" ) ) {
+					scripts.push( elem );
+				}
+			}
+		}
+	}
+
+	return fragment;
+}
+
+
+var rtypenamespace = /^([^.]*)(?:\.(.+)|)/;
+
+function returnTrue() {
+	return true;
+}
+
+function returnFalse() {
+	return false;
+}
+
+// Support: IE <=9 - 11+
+// focus() and blur() are asynchronous, except when they are no-op.
+// So expect focus to be synchronous when the element is already active,
+// and blur to be synchronous when the element is not already active.
+// (focus and blur are always synchronous in other supported browsers,
+// this just defines when we can count on it).
+function expectSync( elem, type ) {
+	return ( elem === safeActiveElement() ) === ( type === "focus" );
+}
+
+// Support: IE <=9 only
+// Accessing document.activeElement can throw unexpectedly
+// https://bugs.jquery.com/ticket/13393
+function safeActiveElement() {
+	try {
+		return document.activeElement;
+	} catch ( err ) { }
+}
+
+function on( elem, types, selector, data, fn, one ) {
+	var origFn, type;
+
+	// Types can be a map of types/handlers
+	if ( typeof types === "object" ) {
+
+		// ( types-Object, selector, data )
+		if ( typeof selector !== "string" ) {
+
+			// ( types-Object, data )
+			data = data || selector;
+			selector = undefined;
+		}
+		for ( type in types ) {
+			on( elem, type, selector, data, types[ type ], one );
+		}
+		return elem;
+	}
+
+	if ( data == null && fn == null ) {
+
+		// ( types, fn )
+		fn = selector;
+		data = selector = undefined;
+	} else if ( fn == null ) {
+		if ( typeof selector === "string" ) {
+
+			// ( types, selector, fn )
+			fn = data;
+			data = undefined;
+		} else {
+
+			// ( types, data, fn )
+			fn = data;
+			data = selector;
+			selector = undefined;
+		}
+	}
+	if ( fn === false ) {
+		fn = returnFalse;
+	} else if ( !fn ) {
+		return elem;
+	}
+
+	if ( one === 1 ) {
+		origFn = fn;
+		fn = function( event ) {
+
+			// Can use an empty set, since event contains the info
+			jQuery().off( event );
+			return origFn.apply( this, arguments );
+		};
+
+		// Use same guid so caller can remove using origFn
+		fn.guid = origFn.guid || ( origFn.guid = jQuery.guid++ );
+	}
+	return elem.each( function() {
+		jQuery.event.add( this, types, fn, data, selector );
+	} );
+}
+
+/*
+ * Helper functions for managing events -- not part of the public interface.
+ * Props to Dean Edwards' addEvent library for many of the ideas.
+ */
+jQuery.event = {
+
+	global: {},
+
+	add: function( elem, types, handler, data, selector ) {
+
+		var handleObjIn, eventHandle, tmp,
+			events, t, handleObj,
+			special, handlers, type, namespaces, origType,
+			elemData = dataPriv.get( elem );
+
+		// Only attach events to objects that accept data
+		if ( !acceptData( elem ) ) {
+			return;
+		}
+
+		// Caller can pass in an object of custom data in lieu of the handler
+		if ( handler.handler ) {
+			handleObjIn = handler;
+			handler = handleObjIn.handler;
+			selector = handleObjIn.selector;
+		}
+
+		// Ensure that invalid selectors throw exceptions at attach time
+		// Evaluate against documentElement in case elem is a non-element node (e.g., document)
+		if ( selector ) {
+			jQuery.find.matchesSelector( documentElement, selector );
+		}
+
+		// Make sure that the handler has a unique ID, used to find/remove it later
+		if ( !handler.guid ) {
+			handler.guid = jQuery.guid++;
+		}
+
+		// Init the element's event structure and main handler, if this is the first
+		if ( !( events = elemData.events ) ) {
+			events = elemData.events = Object.create( null );
+		}
+		if ( !( eventHandle = elemData.handle ) ) {
+			eventHandle = elemData.handle = function( e ) {
+
+				// Discard the second event of a jQuery.event.trigger() and
+				// when an event is called after a page has unloaded
+				return typeof jQuery !== "undefined" && jQuery.event.triggered !== e.type ?
+					jQuery.event.dispatch.apply( elem, arguments ) : undefined;
+			};
+		}
+
+		// Handle multiple events separated by a space
+		types = ( types || "" ).match( rnothtmlwhite ) || [ "" ];
+		t = types.length;
+		while ( t-- ) {
+			tmp = rtypenamespace.exec( types[ t ] ) || [];
+			type = origType = tmp[ 1 ];
+			namespaces = ( tmp[ 2 ] || "" ).split( "." ).sort();
+
+			// There *must* be a type, no attaching namespace-only handlers
+			if ( !type ) {
+				continue;
+			}
+
+			// If event changes its type, use the special event handlers for the changed type
+			special = jQuery.event.special[ type ] || {};
+
+			// If selector defined, determine special event api type, otherwise given type
+			type = ( selector ? special.delegateType : special.bindType ) || type;
+
+			// Update special based on newly reset type
+			special = jQuery.event.special[ type ] || {};
+
+			// handleObj is passed to all event handlers
+			handleObj = jQuery.extend( {
+				type: type,
+				origType: origType,
+				data: data,
+				handler: handler,
+				guid: handler.guid,
+				selector: selector,
+				needsContext: selector && jQuery.expr.match.needsContext.test( selector ),
+				namespace: namespaces.join( "." )
+			}, handleObjIn );
+
+			// Init the event handler queue if we're the first
+			if ( !( handlers = events[ type ] ) ) {
+				handlers = events[ type ] = [];
+				handlers.delegateCount = 0;
+
+				// Only use addEventListener if the special events handler returns false
+				if ( !special.setup ||
+					special.setup.call( elem, data, namespaces, eventHandle ) === false ) {
+
+					if ( elem.addEventListener ) {
+						elem.addEventListener( type, eventHandle );
+					}
+				}
+			}
+
+			if ( special.add ) {
+				special.add.call( elem, handleObj );
+
+				if ( !handleObj.handler.guid ) {
+					handleObj.handler.guid = handler.guid;
+				}
+			}
+
+			// Add to the element's handler list, delegates in front
+			if ( selector ) {
+				handlers.splice( handlers.delegateCount++, 0, handleObj );
+			} else {
+				handlers.push( handleObj );
+			}
+
+			// Keep track of which events have ever been used, for event optimization
+			jQuery.event.global[ type ] = true;
+		}
+
+	},
+
+	// Detach an event or set of events from an element
+	remove: function( elem, types, handler, selector, mappedTypes ) {
+
+		var j, origCount, tmp,
+			events, t, handleObj,
+			special, handlers, type, namespaces, origType,
+			elemData = dataPriv.hasData( elem ) && dataPriv.get( elem );
+
+		if ( !elemData || !( events = elemData.events ) ) {
+			return;
+		}
+
+		// Once for each type.namespace in types; type may be omitted
+		types = ( types || "" ).match( rnothtmlwhite ) || [ "" ];
+		t = types.length;
+		while ( t-- ) {
+			tmp = rtypenamespace.exec( types[ t ] ) || [];
+			type = origType = tmp[ 1 ];
+			namespaces = ( tmp[ 2 ] || "" ).split( "." ).sort();
+
+			// Unbind all events (on this namespace, if provided) for the element
+			if ( !type ) {
+				for ( type in events ) {
+					jQuery.event.remove( elem, type + types[ t ], handler, selector, true );
+				}
+				continue;
+			}
+
+			special = jQuery.event.special[ type ] || {};
+			type = ( selector ? special.delegateType : special.bindType ) || type;
+			handlers = events[ type ] || [];
+			tmp = tmp[ 2 ] &&
+				new RegExp( "(^|\\.)" + namespaces.join( "\\.(?:.*\\.|)" ) + "(\\.|$)" );
+
+			// Remove matching events
+			origCount = j = handlers.length;
+			while ( j-- ) {
+				handleObj = handlers[ j ];
+
+				if ( ( mappedTypes || origType === handleObj.origType ) &&
+					( !handler || handler.guid === handleObj.guid ) &&
+					( !tmp || tmp.test( handleObj.namespace ) ) &&
+					( !selector || selector === handleObj.selector ||
+						selector === "**" && handleObj.selector ) ) {
+					handlers.splice( j, 1 );
+
+					if ( handleObj.selector ) {
+						handlers.delegateCount--;
+					}
+					if ( special.remove ) {
+						special.remove.call( elem, handleObj );
+					}
+				}
+			}
+
+			// Remove generic event handler if we removed something and no more handlers exist
+			// (avoids potential for endless recursion during removal of special event handlers)
+			if ( origCount && !handlers.length ) {
+				if ( !special.teardown ||
+					special.teardown.call( elem, namespaces, elemData.handle ) === false ) {
+
+					jQuery.removeEvent( elem, type, elemData.handle );
+				}
+
+				delete events[ type ];
+			}
+		}
+
+		// Remove data and the expando if it's no longer used
+		if ( jQuery.isEmptyObject( events ) ) {
+			dataPriv.remove( elem, "handle events" );
+		}
+	},
+
+	dispatch: function( nativeEvent ) {
+
+		var i, j, ret, matched, handleObj, handlerQueue,
+			args = new Array( arguments.length ),
+
+			// Make a writable jQuery.Event from the native event object
+			event = jQuery.event.fix( nativeEvent ),
+
+			handlers = (
+				dataPriv.get( this, "events" ) || Object.create( null )
+			)[ event.type ] || [],
+			special = jQuery.event.special[ event.type ] || {};
+
+		// Use the fix-ed jQuery.Event rather than the (read-only) native event
+		args[ 0 ] = event;
+
+		for ( i = 1; i < arguments.length; i++ ) {
+			args[ i ] = arguments[ i ];
+		}
+
+		event.delegateTarget = this;
+
+		// Call the preDispatch hook for the mapped type, and let it bail if desired
+		if ( special.preDispatch && special.preDispatch.call( this, event ) === false ) {
+			return;
+		}
+
+		// Determine handlers
+		handlerQueue = jQuery.event.handlers.call( this, event, handlers );
+
+		// Run delegates first; they may want to stop propagation beneath us
+		i = 0;
+		while ( ( matched = handlerQueue[ i++ ] ) && !event.isPropagationStopped() ) {
+			event.currentTarget = matched.elem;
+
+			j = 0;
+			while ( ( handleObj = matched.handlers[ j++ ] ) &&
+				!event.isImmediatePropagationStopped() ) {
+
+				// If the event is namespaced, then each handler is only invoked if it is
+				// specially universal or its namespaces are a superset of the event's.
+				if ( !event.rnamespace || handleObj.namespace === false ||
+					event.rnamespace.test( handleObj.namespace ) ) {
+
+					event.handleObj = handleObj;
+					event.data = handleObj.data;
+
+					ret = ( ( jQuery.event.special[ handleObj.origType ] || {} ).handle ||
+						handleObj.handler ).apply( matched.elem, args );
+
+					if ( ret !== undefined ) {
+						if ( ( event.result = ret ) === false ) {
+							event.preventDefault();
+							event.stopPropagation();
+						}
+					}
+				}
+			}
+		}
+
+		// Call the postDispatch hook for the mapped type
+		if ( special.postDispatch ) {
+			special.postDispatch.call( this, event );
+		}
+
+		return event.result;
+	},
+
+	handlers: function( event, handlers ) {
+		var i, handleObj, sel, matchedHandlers, matchedSelectors,
+			handlerQueue = [],
+			delegateCount = handlers.delegateCount,
+			cur = event.target;
+
+		// Find delegate handlers
+		if ( delegateCount &&
+
+			// Support: IE <=9
+			// Black-hole SVG <use> instance trees (trac-13180)
+			cur.nodeType &&
+
+			// Support: Firefox <=42
+			// Suppress spec-violating clicks indicating a non-primary pointer button (trac-3861)
+			// https://www.w3.org/TR/DOM-Level-3-Events/#event-type-click
+			// Support: IE 11 only
+			// ...but not arrow key "clicks" of radio inputs, which can have `button` -1 (gh-2343)
+			!( event.type === "click" && event.button >= 1 ) ) {
+
+			for ( ; cur !== this; cur = cur.parentNode || this ) {
+
+				// Don't check non-elements (#13208)
+				// Don't process clicks on disabled elements (#6911, #8165, #11382, #11764)
+				if ( cur.nodeType === 1 && !( event.type === "click" && cur.disabled === true ) ) {
+					matchedHandlers = [];
+					matchedSelectors = {};
+					for ( i = 0; i < delegateCount; i++ ) {
+						handleObj = handlers[ i ];
+
+						// Don't conflict with Object.prototype properties (#13203)
+						sel = handleObj.selector + " ";
+
+						if ( matchedSelectors[ sel ] === undefined ) {
+							matchedSelectors[ sel ] = handleObj.needsContext ?
+								jQuery( sel, this ).index( cur ) > -1 :
+								jQuery.find( sel, this, null, [ cur ] ).length;
+						}
+						if ( matchedSelectors[ sel ] ) {
+							matchedHandlers.push( handleObj );
+						}
+					}
+					if ( matchedHandlers.length ) {
+						handlerQueue.push( { elem: cur, handlers: matchedHandlers } );
+					}
+				}
+			}
+		}
+
+		// Add the remaining (directly-bound) handlers
+		cur = this;
+		if ( delegateCount < handlers.length ) {
+			handlerQueue.push( { elem: cur, handlers: handlers.slice( delegateCount ) } );
+		}
+
+		return handlerQueue;
+	},
+
+	addProp: function( name, hook ) {
+		Object.defineProperty( jQuery.Event.prototype, name, {
+			enumerable: true,
+			configurable: true,
+
+			get: isFunction( hook ) ?
+				function() {
+					if ( this.originalEvent ) {
+						return hook( this.originalEvent );
+					}
+				} :
+				function() {
+					if ( this.originalEvent ) {
+						return this.originalEvent[ name ];
+					}
+				},
+
+			set: function( value ) {
+				Object.defineProperty( this, name, {
+					enumerable: true,
+					configurable: true,
+					writable: true,
+					value: value
+				} );
+			}
+		} );
+	},
+
+	fix: function( originalEvent ) {
+		return originalEvent[ jQuery.expando ] ?
+			originalEvent :
+			new jQuery.Event( originalEvent );
+	},
+
+	special: {
+		load: {
+
+			// Prevent triggered image.load events from bubbling to window.load
+			noBubble: true
+		},
+		click: {
+
+			// Utilize native event to ensure correct state for checkable inputs
+			setup: function( data ) {
+
+				// For mutual compressibility with _default, replace `this` access with a local var.
+				// `|| data` is dead code meant only to preserve the variable through minification.
+				var el = this || data;
+
+				// Claim the first handler
+				if ( rcheckableType.test( el.type ) &&
+					el.click && nodeName( el, "input" ) ) {
+
+					// dataPriv.set( el, "click", ... )
+					leverageNative( el, "click", returnTrue );
+				}
+
+				// Return false to allow normal processing in the caller
+				return false;
+			},
+			trigger: function( data ) {
+
+				// For mutual compressibility with _default, replace `this` access with a local var.
+				// `|| data` is dead code meant only to preserve the variable through minification.
+				var el = this || data;
+
+				// Force setup before triggering a click
+				if ( rcheckableType.test( el.type ) &&
+					el.click && nodeName( el, "input" ) ) {
+
+					leverageNative( el, "click" );
+				}
+
+				// Return non-false to allow normal event-path propagation
+				return true;
+			},
+
+			// For cross-browser consistency, suppress native .click() on links
+			// Also prevent it if we're currently inside a leveraged native-event stack
+			_default: function( event ) {
+				var target = event.target;
+				return rcheckableType.test( target.type ) &&
+					target.click && nodeName( target, "input" ) &&
+					dataPriv.get( target, "click" ) ||
+					nodeName( target, "a" );
+			}
+		},
+
+		beforeunload: {
+			postDispatch: function( event ) {
+
+				// Support: Firefox 20+
+				// Firefox doesn't alert if the returnValue field is not set.
+				if ( event.result !== undefined && event.originalEvent ) {
+					event.originalEvent.returnValue = event.result;
+				}
+			}
+		}
+	}
+};
+
+// Ensure the presence of an event listener that handles manually-triggered
+// synthetic events by interrupting progress until reinvoked in response to
+// *native* events that it fires directly, ensuring that state changes have
+// already occurred before other listeners are invoked.
+function leverageNative( el, type, expectSync ) {
+
+	// Missing expectSync indicates a trigger call, which must force setup through jQuery.event.add
+	if ( !expectSync ) {
+		if ( dataPriv.get( el, type ) === undefined ) {
+			jQuery.event.add( el, type, returnTrue );
+		}
+		return;
+	}
+
+	// Register the controller as a special universal handler for all event namespaces
+	dataPriv.set( el, type, false );
+	jQuery.event.add( el, type, {
+		namespace: false,
+		handler: function( event ) {
+			var notAsync, result,
+				saved = dataPriv.get( this, type );
+
+			if ( ( event.isTrigger & 1 ) && this[ type ] ) {
+
+				// Interrupt processing of the outer synthetic .trigger()ed event
+				// Saved data should be false in such cases, but might be a leftover capture object
+				// from an async native handler (gh-4350)
+				if ( !saved.length ) {
+
+					// Store arguments for use when handling the inner native event
+					// There will always be at least one argument (an event object), so this array
+					// will not be confused with a leftover capture object.
+					saved = slice.call( arguments );
+					dataPriv.set( this, type, saved );
+
+					// Trigger the native event and capture its result
+					// Support: IE <=9 - 11+
+					// focus() and blur() are asynchronous
+					notAsync = expectSync( this, type );
+					this[ type ]();
+					result = dataPriv.get( this, type );
+					if ( saved !== result || notAsync ) {
+						dataPriv.set( this, type, false );
+					} else {
+						result = {};
+					}
+					if ( saved !== result ) {
+
+						// Cancel the outer synthetic event
+						event.stopImmediatePropagation();
+						event.preventDefault();
+
+						// Support: Chrome 86+
+						// In Chrome, if an element having a focusout handler is blurred by
+						// clicking outside of it, it invokes the handler synchronously. If
+						// that handler calls `.remove()` on the element, the data is cleared,
+						// leaving `result` undefined. We need to guard against this.
+						return result && result.value;
+					}
+
+				// If this is an inner synthetic event for an event with a bubbling surrogate
+				// (focus or blur), assume that the surrogate already propagated from triggering the
+				// native event and prevent that from happening again here.
+				// This technically gets the ordering wrong w.r.t. to `.trigger()` (in which the
+				// bubbling surrogate propagates *after* the non-bubbling base), but that seems
+				// less bad than duplication.
+				} else if ( ( jQuery.event.special[ type ] || {} ).delegateType ) {
+					event.stopPropagation();
+				}
+
+			// If this is a native event triggered above, everything is now in order
+			// Fire an inner synthetic event with the original arguments
+			} else if ( saved.length ) {
+
+				// ...and capture the result
+				dataPriv.set( this, type, {
+					value: jQuery.event.trigger(
+
+						// Support: IE <=9 - 11+
+						// Extend with the prototype to reset the above stopImmediatePropagation()
+						jQuery.extend( saved[ 0 ], jQuery.Event.prototype ),
+						saved.slice( 1 ),
+						this
+					)
+				} );
+
+				// Abort handling of the native event
+				event.stopImmediatePropagation();
+			}
+		}
+	} );
+}
+
+jQuery.removeEvent = function( elem, type, handle ) {
+
+	// This "if" is needed for plain objects
+	if ( elem.removeEventListener ) {
+		elem.removeEventListener( type, handle );
+	}
+};
+
+jQuery.Event = function( src, props ) {
+
+	// Allow instantiation without the 'new' keyword
+	if ( !( this instanceof jQuery.Event ) ) {
+		return new jQuery.Event( src, props );
+	}
+
+	// Event object
+	if ( src && src.type ) {
+		this.originalEvent = src;
+		this.type = src.type;
+
+		// Events bubbling up the document may have been marked as prevented
+		// by a handler lower down the tree; reflect the correct value.
+		this.isDefaultPrevented = src.defaultPrevented ||
+				src.defaultPrevented === undefined &&
+
+				// Support: Android <=2.3 only
+				src.returnValue === false ?
+			returnTrue :
+			returnFalse;
+
+		// Create target properties
+		// Support: Safari <=6 - 7 only
+		// Target should not be a text node (#504, #13143)
+		this.target = ( src.target && src.target.nodeType === 3 ) ?
+			src.target.parentNode :
+			src.target;
+
+		this.currentTarget = src.currentTarget;
+		this.relatedTarget = src.relatedTarget;
+
+	// Event type
+	} else {
+		this.type = src;
+	}
+
+	// Put explicitly provided properties onto the event object
+	if ( props ) {
+		jQuery.extend( this, props );
+	}
+
+	// Create a timestamp if incoming event doesn't have one
+	this.timeStamp = src && src.timeStamp || Date.now();
+
+	// Mark it as fixed
+	this[ jQuery.expando ] = true;
+};
+
+// jQuery.Event is based on DOM3 Events as specified by the ECMAScript Language Binding
+// https://www.w3.org/TR/2003/WD-DOM-Level-3-Events-20030331/ecma-script-binding.html
+jQuery.Event.prototype = {
+	constructor: jQuery.Event,
+	isDefaultPrevented: returnFalse,
+	isPropagationStopped: returnFalse,
+	isImmediatePropagationStopped: returnFalse,
+	isSimulated: false,
+
+	preventDefault: function() {
+		var e = this.originalEvent;
+
+		this.isDefaultPrevented = returnTrue;
+
+		if ( e && !this.isSimulated ) {
+			e.preventDefault();
+		}
+	},
+	stopPropagation: function() {
+		var e = this.originalEvent;
+
+		this.isPropagationStopped = returnTrue;
+
+		if ( e && !this.isSimulated ) {
+			e.stopPropagation();
+		}
+	},
+	stopImmediatePropagation: function() {
+		var e = this.originalEvent;
+
+		this.isImmediatePropagationStopped = returnTrue;
+
+		if ( e && !this.isSimulated ) {
+			e.stopImmediatePropagation();
+		}
+
+		this.stopPropagation();
+	}
+};
+
+// Includes all common event props including KeyEvent and MouseEvent specific props
+jQuery.each( {
+	altKey: true,
+	bubbles: true,
+	cancelable: true,
+	changedTouches: true,
+	ctrlKey: true,
+	detail: true,
+	eventPhase: true,
+	metaKey: true,
+	pageX: true,
+	pageY: true,
+	shiftKey: true,
+	view: true,
+	"char": true,
+	code: true,
+	charCode: true,
+	key: true,
+	keyCode: true,
+	button: true,
+	buttons: true,
+	clientX: true,
+	clientY: true,
+	offsetX: true,
+	offsetY: true,
+	pointerId: true,
+	pointerType: true,
+	screenX: true,
+	screenY: true,
+	targetTouches: true,
+	toElement: true,
+	touches: true,
+	which: true
+}, jQuery.event.addProp );
+
+jQuery.each( { focus: "focusin", blur: "focusout" }, function( type, delegateType ) {
+	jQuery.event.special[ type ] = {
+
+		// Utilize native event if possible so blur/focus sequence is correct
+		setup: function() {
+
+			// Claim the first handler
+			// dataPriv.set( this, "focus", ... )
+			// dataPriv.set( this, "blur", ... )
+			leverageNative( this, type, expectSync );
+
+			// Return false to allow normal processing in the caller
+			return false;
+		},
+		trigger: function() {
+
+			// Force setup before trigger
+			leverageNative( this, type );
+
+			// Return non-false to allow normal event-path propagation
+			return true;
+		},
+
+		// Suppress native focus or blur as it's already being fired
+		// in leverageNative.
+		_default: function() {
+			return true;
+		},
+
+		delegateType: delegateType
+	};
+} );
+
+// Create mouseenter/leave events using mouseover/out and event-time checks
+// so that event delegation works in jQuery.
+// Do the same for pointerenter/pointerleave and pointerover/pointerout
+//
+// Support: Safari 7 only
+// Safari sends mouseenter too often; see:
+// https://bugs.chromium.org/p/chromium/issues/detail?id=470258
+// for the description of the bug (it existed in older Chrome versions as well).
+jQuery.each( {
+	mouseenter: "mouseover",
+	mouseleave: "mouseout",
+	pointerenter: "pointerover",
+	pointerleave: "pointerout"
+}, function( orig, fix ) {
+	jQuery.event.special[ orig ] = {
+		delegateType: fix,
+		bindType: fix,
+
+		handle: function( event ) {
+			var ret,
+				target = this,
+				related = event.relatedTarget,
+				handleObj = event.handleObj;
+
+			// For mouseenter/leave call the handler if related is outside the target.
+			// NB: No relatedTarget if the mouse left/entered the browser window
+			if ( !related || ( related !== target && !jQuery.contains( target, related ) ) ) {
+				event.type = handleObj.origType;
+				ret = handleObj.handler.apply( this, arguments );
+				event.type = fix;
+			}
+			return ret;
+		}
+	};
+} );
+
+jQuery.fn.extend( {
+
+	on: function( types, selector, data, fn ) {
+		return on( this, types, selector, data, fn );
+	},
+	one: function( types, selector, data, fn ) {
+		return on( this, types, selector, data, fn, 1 );
+	},
+	off: function( types, selector, fn ) {
+		var handleObj, type;
+		if ( types && types.preventDefault && types.handleObj ) {
+
+			// ( event )  dispatched jQuery.Event
+			handleObj = types.handleObj;
+			jQuery( types.delegateTarget ).off(
+				handleObj.namespace ?
+					handleObj.origType + "." + handleObj.namespace :
+					handleObj.origType,
+				handleObj.selector,
+				handleObj.handler
+			);
+			return this;
+		}
+		if ( typeof types === "object" ) {
+
+			// ( types-object [, selector] )
+			for ( type in types ) {
+				this.off( type, selector, types[ type ] );
+			}
+			return this;
+		}
+		if ( selector === false || typeof selector === "function" ) {
+
+			// ( types [, fn] )
+			fn = selector;
+			selector = undefined;
+		}
+		if ( fn === false ) {
+			fn = returnFalse;
+		}
+		return this.each( function() {
+			jQuery.event.remove( this, types, fn, selector );
+		} );
+	}
+} );
+
+
+var
+
+	// Support: IE <=10 - 11, Edge 12 - 13 only
+	// In IE/Edge using regex groups here causes severe slowdowns.
+	// See https://connect.microsoft.com/IE/feedback/details/1736512/
+	rnoInnerhtml = /<script|<style|<link/i,
+
+	// checked="checked" or checked
+	rchecked = /checked\s*(?:[^=]|=\s*.checked.)/i,
+	rcleanScript = /^\s*<!(?:\[CDATA\[|--)|(?:\]\]|--)>\s*$/g;
+
+// Prefer a tbody over its parent table for containing new rows
+function manipulationTarget( elem, content ) {
+	if ( nodeName( elem, "table" ) &&
+		nodeName( content.nodeType !== 11 ? content : content.firstChild, "tr" ) ) {
+
+		return jQuery( elem ).children( "tbody" )[ 0 ] || elem;
+	}
+
+	return elem;
+}
+
+// Replace/restore the type attribute of script elements for safe DOM manipulation
+function disableScript( elem ) {
+	elem.type = ( elem.getAttribute( "type" ) !== null ) + "/" + elem.type;
+	return elem;
+}
+function restoreScript( elem ) {
+	if ( ( elem.type || "" ).slice( 0, 5 ) === "true/" ) {
+		elem.type = elem.type.slice( 5 );
+	} else {
+		elem.removeAttribute( "type" );
+	}
+
+	return elem;
+}
+
+function cloneCopyEvent( src, dest ) {
+	var i, l, type, pdataOld, udataOld, udataCur, events;
+
+	if ( dest.nodeType !== 1 ) {
+		return;
+	}
+
+	// 1. Copy private data: events, handlers, etc.
+	if ( dataPriv.hasData( src ) ) {
+		pdataOld = dataPriv.get( src );
+		events = pdataOld.events;
+
+		if ( events ) {
+			dataPriv.remove( dest, "handle events" );
+
+			for ( type in events ) {
+				for ( i = 0, l = events[ type ].length; i < l; i++ ) {
+					jQuery.event.add( dest, type, events[ type ][ i ] );
+				}
+			}
+		}
+	}
+
+	// 2. Copy user data
+	if ( dataUser.hasData( src ) ) {
+		udataOld = dataUser.access( src );
+		udataCur = jQuery.extend( {}, udataOld );
+
+		dataUser.set( dest, udataCur );
+	}
+}
+
+// Fix IE bugs, see support tests
+function fixInput( src, dest ) {
+	var nodeName = dest.nodeName.toLowerCase();
+
+	// Fails to persist the checked state of a cloned checkbox or radio button.
+	if ( nodeName === "input" && rcheckableType.test( src.type ) ) {
+		dest.checked = src.checked;
+
+	// Fails to return the selected option to the default selected state when cloning options
+	} else if ( nodeName === "input" || nodeName === "textarea" ) {
+		dest.defaultValue = src.defaultValue;
+	}
+}
+
+function domManip( collection, args, callback, ignored ) {
+
+	// Flatten any nested arrays
+	args = flat( args );
+
+	var fragment, first, scripts, hasScripts, node, doc,
+		i = 0,
+		l = collection.length,
+		iNoClone = l - 1,
+		value = args[ 0 ],
+		valueIsFunction = isFunction( value );
+
+	// We can't cloneNode fragments that contain checked, in WebKit
+	if ( valueIsFunction ||
+			( l > 1 && typeof value === "string" &&
+				!support.checkClone && rchecked.test( value ) ) ) {
+		return collection.each( function( index ) {
+			var self = collection.eq( index );
+			if ( valueIsFunction ) {
+				args[ 0 ] = value.call( this, index, self.html() );
+			}
+			domManip( self, args, callback, ignored );
+		} );
+	}
+
+	if ( l ) {
+		fragment = buildFragment( args, collection[ 0 ].ownerDocument, false, collection, ignored );
+		first = fragment.firstChild;
+
+		if ( fragment.childNodes.length === 1 ) {
+			fragment = first;
+		}
+
+		// Require either new content or an interest in ignored elements to invoke the callback
+		if ( first || ignored ) {
+			scripts = jQuery.map( getAll( fragment, "script" ), disableScript );
+			hasScripts = scripts.length;
+
+			// Use the original fragment for the last item
+			// instead of the first because it can end up
+			// being emptied incorrectly in certain situations (#8070).
+			for ( ; i < l; i++ ) {
+				node = fragment;
+
+				if ( i !== iNoClone ) {
+					node = jQuery.clone( node, true, true );
+
+					// Keep references to cloned scripts for later restoration
+					if ( hasScripts ) {
+
+						// Support: Android <=4.0 only, PhantomJS 1 only
+						// push.apply(_, arraylike) throws on ancient WebKit
+						jQuery.merge( scripts, getAll( node, "script" ) );
+					}
+				}
+
+				callback.call( collection[ i ], node, i );
+			}
+
+			if ( hasScripts ) {
+				doc = scripts[ scripts.length - 1 ].ownerDocument;
+
+				// Reenable scripts
+				jQuery.map( scripts, restoreScript );
+
+				// Evaluate executable scripts on first document insertion
+				for ( i = 0; i < hasScripts; i++ ) {
+					node = scripts[ i ];
+					if ( rscriptType.test( node.type || "" ) &&
+						!dataPriv.access( node, "globalEval" ) &&
+						jQuery.contains( doc, node ) ) {
+
+						if ( node.src && ( node.type || "" ).toLowerCase()  !== "module" ) {
+
+							// Optional AJAX dependency, but won't run scripts if not present
+							if ( jQuery._evalUrl && !node.noModule ) {
+								jQuery._evalUrl( node.src, {
+									nonce: node.nonce || node.getAttribute( "nonce" )
+								}, doc );
+							}
+						} else {
+							DOMEval( node.textContent.replace( rcleanScript, "" ), node, doc );
+						}
+					}
+				}
+			}
+		}
+	}
+
+	return collection;
+}
+
+function remove( elem, selector, keepData ) {
+	var node,
+		nodes = selector ? jQuery.filter( selector, elem ) : elem,
+		i = 0;
+
+	for ( ; ( node = nodes[ i ] ) != null; i++ ) {
+		if ( !keepData && node.nodeType === 1 ) {
+			jQuery.cleanData( getAll( node ) );
+		}
+
+		if ( node.parentNode ) {
+			if ( keepData && isAttached( node ) ) {
+				setGlobalEval( getAll( node, "script" ) );
+			}
+			node.parentNode.removeChild( node );
+		}
+	}
+
+	return elem;
+}
+
+jQuery.extend( {
+	htmlPrefilter: function( html ) {
+		return html;
+	},
+
+	clone: function( elem, dataAndEvents, deepDataAndEvents ) {
+		var i, l, srcElements, destElements,
+			clone = elem.cloneNode( true ),
+			inPage = isAttached( elem );
+
+		// Fix IE cloning issues
+		if ( !support.noCloneChecked && ( elem.nodeType === 1 || elem.nodeType === 11 ) &&
+				!jQuery.isXMLDoc( elem ) ) {
+
+			// We eschew Sizzle here for performance reasons: https://jsperf.com/getall-vs-sizzle/2
+			destElements = getAll( clone );
+			srcElements = getAll( elem );
+
+			for ( i = 0, l = srcElements.length; i < l; i++ ) {
+				fixInput( srcElements[ i ], destElements[ i ] );
+			}
+		}
+
+		// Copy the events from the original to the clone
+		if ( dataAndEvents ) {
+			if ( deepDataAndEvents ) {
+				srcElements = srcElements || getAll( elem );
+				destElements = destElements || getAll( clone );
+
+				for ( i = 0, l = srcElements.length; i < l; i++ ) {
+					cloneCopyEvent( srcElements[ i ], destElements[ i ] );
+				}
+			} else {
+				cloneCopyEvent( elem, clone );
+			}
+		}
+
+		// Preserve script evaluation history
+		destElements = getAll( clone, "script" );
+		if ( destElements.length > 0 ) {
+			setGlobalEval( destElements, !inPage && getAll( elem, "script" ) );
+		}
+
+		// Return the cloned set
+		return clone;
+	},
+
+	cleanData: function( elems ) {
+		var data, elem, type,
+			special = jQuery.event.special,
+			i = 0;
+
+		for ( ; ( elem = elems[ i ] ) !== undefined; i++ ) {
+			if ( acceptData( elem ) ) {
+				if ( ( data = elem[ dataPriv.expando ] ) ) {
+					if ( data.events ) {
+						for ( type in data.events ) {
+							if ( special[ type ] ) {
+								jQuery.event.remove( elem, type );
+
+							// This is a shortcut to avoid jQuery.event.remove's overhead
+							} else {
+								jQuery.removeEvent( elem, type, data.handle );
+							}
+						}
+					}
+
+					// Support: Chrome <=35 - 45+
+					// Assign undefined instead of using delete, see Data#remove
+					elem[ dataPriv.expando ] = undefined;
+				}
+				if ( elem[ dataUser.expando ] ) {
+
+					// Support: Chrome <=35 - 45+
+					// Assign undefined instead of using delete, see Data#remove
+					elem[ dataUser.expando ] = undefined;
+				}
+			}
+		}
+	}
+} );
+
+jQuery.fn.extend( {
+	detach: function( selector ) {
+		return remove( this, selector, true );
+	},
+
+	remove: function( selector ) {
+		return remove( this, selector );
+	},
+
+	text: function( value ) {
+		return access( this, function( value ) {
+			return value === undefined ?
+				jQuery.text( this ) :
+				this.empty().each( function() {
+					if ( this.nodeType === 1 || this.nodeType === 11 || this.nodeType === 9 ) {
+						this.textContent = value;
+					}
+				} );
+		}, null, value, arguments.length );
+	},
+
+	append: function() {
+		return domManip( this, arguments, function( elem ) {
+			if ( this.nodeType === 1 || this.nodeType === 11 || this.nodeType === 9 ) {
+				var target = manipulationTarget( this, elem );
+				target.appendChild( elem );
+			}
+		} );
+	},
+
+	prepend: function() {
+		return domManip( this, arguments, function( elem ) {
+			if ( this.nodeType === 1 || this.nodeType === 11 || this.nodeType === 9 ) {
+				var target = manipulationTarget( this, elem );
+				target.insertBefore( elem, target.firstChild );
+			}
+		} );
+	},
+
+	before: function() {
+		return domManip( this, arguments, function( elem ) {
+			if ( this.parentNode ) {
+				this.parentNode.insertBefore( elem, this );
+			}
+		} );
+	},
+
+	after: function() {
+		return domManip( this, arguments, function( elem ) {
+			if ( this.parentNode ) {
+				this.parentNode.insertBefore( elem, this.nextSibling );
+			}
+		} );
+	},
+
+	empty: function() {
+		var elem,
+			i = 0;
+
+		for ( ; ( elem = this[ i ] ) != null; i++ ) {
+			if ( elem.nodeType === 1 ) {
+
+				// Prevent memory leaks
+				jQuery.cleanData( getAll( elem, false ) );
+
+				// Remove any remaining nodes
+				elem.textContent = "";
+			}
+		}
+
+		return this;
+	},
+
+	clone: function( dataAndEvents, deepDataAndEvents ) {
+		dataAndEvents = dataAndEvents == null ? false : dataAndEvents;
+		deepDataAndEvents = deepDataAndEvents == null ? dataAndEvents : deepDataAndEvents;
+
+		return this.map( function() {
+			return jQuery.clone( this, dataAndEvents, deepDataAndEvents );
+		} );
+	},
+
+	html: function( value ) {
+		return access( this, function( value ) {
+			var elem = this[ 0 ] || {},
+				i = 0,
+				l = this.length;
+
+			if ( value === undefined && elem.nodeType === 1 ) {
+				return elem.innerHTML;
+			}
+
+			// See if we can take a shortcut and just use innerHTML
+			if ( typeof value === "string" && !rnoInnerhtml.test( value ) &&
+				!wrapMap[ ( rtagName.exec( value ) || [ "", "" ] )[ 1 ].toLowerCase() ] ) {
+
+				value = jQuery.htmlPrefilter( value );
+
+				try {
+					for ( ; i < l; i++ ) {
+						elem = this[ i ] || {};
+
+						// Remove element nodes and prevent memory leaks
+						if ( elem.nodeType === 1 ) {
+							jQuery.cleanData( getAll( elem, false ) );
+							elem.innerHTML = value;
+						}
+					}
+
+					elem = 0;
+
+				// If using innerHTML throws an exception, use the fallback method
+				} catch ( e ) {}
+			}
+
+			if ( elem ) {
+				this.empty().append( value );
+			}
+		}, null, value, arguments.length );
+	},
+
+	replaceWith: function() {
+		var ignored = [];
+
+		// Make the changes, replacing each non-ignored context element with the new content
+		return domManip( this, arguments, function( elem ) {
+			var parent = this.parentNode;
+
+			if ( jQuery.inArray( this, ignored ) < 0 ) {
+				jQuery.cleanData( getAll( this ) );
+				if ( parent ) {
+					parent.replaceChild( elem, this );
+				}
+			}
+
+		// Force callback invocation
+		}, ignored );
+	}
+} );
+
+jQuery.each( {
+	appendTo: "append",
+	prependTo: "prepend",
+	insertBefore: "before",
+	insertAfter: "after",
+	replaceAll: "replaceWith"
+}, function( name, original ) {
+	jQuery.fn[ name ] = function( selector ) {
+		var elems,
+			ret = [],
+			insert = jQuery( selector ),
+			last = insert.length - 1,
+			i = 0;
+
+		for ( ; i <= last; i++ ) {
+			elems = i === last ? this : this.clone( true );
+			jQuery( insert[ i ] )[ original ]( elems );
+
+			// Support: Android <=4.0 only, PhantomJS 1 only
+			// .get() because push.apply(_, arraylike) throws on ancient WebKit
+			push.apply( ret, elems.get() );
+		}
+
+		return this.pushStack( ret );
+	};
+} );
+var rnumnonpx = new RegExp( "^(" + pnum + ")(?!px)[a-z%]+$", "i" );
+
+var getStyles = function( elem ) {
+
+		// Support: IE <=11 only, Firefox <=30 (#15098, #14150)
+		// IE throws on elements created in popups
+		// FF meanwhile throws on frame elements through "defaultView.getComputedStyle"
+		var view = elem.ownerDocument.defaultView;
+
+		if ( !view || !view.opener ) {
+			view = window;
+		}
+
+		return view.getComputedStyle( elem );
+	};
+
+var swap = function( elem, options, callback ) {
+	var ret, name,
+		old = {};
+
+	// Remember the old values, and insert the new ones
+	for ( name in options ) {
+		old[ name ] = elem.style[ name ];
+		elem.style[ name ] = options[ name ];
+	}
+
+	ret = callback.call( elem );
+
+	// Revert the old values
+	for ( name in options ) {
+		elem.style[ name ] = old[ name ];
+	}
+
+	return ret;
+};
+
+
+var rboxStyle = new RegExp( cssExpand.join( "|" ), "i" );
+
+
+
+( function() {
+
+	// Executing both pixelPosition & boxSizingReliable tests require only one layout
+	// so they're executed at the same time to save the second computation.
+	function computeStyleTests() {
+
+		// This is a singleton, we need to execute it only once
+		if ( !div ) {
+			return;
+		}
+
+		container.style.cssText = "position:absolute;left:-11111px;width:60px;" +
+			"margin-top:1px;padding:0;border:0";
+		div.style.cssText =
+			"position:relative;display:block;box-sizing:border-box;overflow:scroll;" +
+			"margin:auto;border:1px;padding:1px;" +
+			"width:60%;top:1%";
+		documentElement.appendChild( container ).appendChild( div );
+
+		var divStyle = window.getComputedStyle( div );
+		pixelPositionVal = divStyle.top !== "1%";
+
+		// Support: Android 4.0 - 4.3 only, Firefox <=3 - 44
+		reliableMarginLeftVal = roundPixelMeasures( divStyle.marginLeft ) === 12;
+
+		// Support: Android 4.0 - 4.3 only, Safari <=9.1 - 10.1, iOS <=7.0 - 9.3
+		// Some styles come back with percentage values, even though they shouldn't
+		div.style.right = "60%";
+		pixelBoxStylesVal = roundPixelMeasures( divStyle.right ) === 36;
+
+		// Support: IE 9 - 11 only
+		// Detect misreporting of content dimensions for box-sizing:border-box elements
+		boxSizingReliableVal = roundPixelMeasures( divStyle.width ) === 36;
+
+		// Support: IE 9 only
+		// Detect overflow:scroll screwiness (gh-3699)
+		// Support: Chrome <=64
+		// Don't get tricked when zoom affects offsetWidth (gh-4029)
+		div.style.position = "absolute";
+		scrollboxSizeVal = roundPixelMeasures( div.offsetWidth / 3 ) === 12;
+
+		documentElement.removeChild( container );
+
+		// Nullify the div so it wouldn't be stored in the memory and
+		// it will also be a sign that checks already performed
+		div = null;
+	}
+
+	function roundPixelMeasures( measure ) {
+		return Math.round( parseFloat( measure ) );
+	}
+
+	var pixelPositionVal, boxSizingReliableVal, scrollboxSizeVal, pixelBoxStylesVal,
+		reliableTrDimensionsVal, reliableMarginLeftVal,
+		container = document.createElement( "div" ),
+		div = document.createElement( "div" );
+
+	// Finish early in limited (non-browser) environments
+	if ( !div.style ) {
+		return;
+	}
+
+	// Support: IE <=9 - 11 only
+	// Style of cloned element affects source element cloned (#8908)
+	div.style.backgroundClip = "content-box";
+	div.cloneNode( true ).style.backgroundClip = "";
+	support.clearCloneStyle = div.style.backgroundClip === "content-box";
+
+	jQuery.extend( support, {
+		boxSizingReliable: function() {
+			computeStyleTests();
+			return boxSizingReliableVal;
+		},
+		pixelBoxStyles: function() {
+			computeStyleTests();
+			return pixelBoxStylesVal;
+		},
+		pixelPosition: function() {
+			computeStyleTests();
+			return pixelPositionVal;
+		},
+		reliableMarginLeft: function() {
+			computeStyleTests();
+			return reliableMarginLeftVal;
+		},
+		scrollboxSize: function() {
+			computeStyleTests();
+			return scrollboxSizeVal;
+		},
+
+		// Support: IE 9 - 11+, Edge 15 - 18+
+		// IE/Edge misreport `getComputedStyle` of table rows with width/height
+		// set in CSS while `offset*` properties report correct values.
+		// Behavior in IE 9 is more subtle than in newer versions & it passes
+		// some versions of this test; make sure not to make it pass there!
+		//
+		// Support: Firefox 70+
+		// Only Firefox includes border widths
+		// in computed dimensions. (gh-4529)
+		reliableTrDimensions: function() {
+			var table, tr, trChild, trStyle;
+			if ( reliableTrDimensionsVal == null ) {
+				table = document.createElement( "table" );
+				tr = document.createElement( "tr" );
+				trChild = document.createElement( "div" );
+
+				table.style.cssText = "position:absolute;left:-11111px;border-collapse:separate";
+				tr.style.cssText = "border:1px solid";
+
+				// Support: Chrome 86+
+				// Height set through cssText does not get applied.
+				// Computed height then comes back as 0.
+				tr.style.height = "1px";
+				trChild.style.height = "9px";
+
+				// Support: Android 8 Chrome 86+
+				// In our bodyBackground.html iframe,
+				// display for all div elements is set to "inline",
+				// which causes a problem only in Android 8 Chrome 86.
+				// Ensuring the div is display: block
+				// gets around this issue.
+				trChild.style.display = "block";
+
+				documentElement
+					.appendChild( table )
+					.appendChild( tr )
+					.appendChild( trChild );
+
+				trStyle = window.getComputedStyle( tr );
+				reliableTrDimensionsVal = ( parseInt( trStyle.height, 10 ) +
+					parseInt( trStyle.borderTopWidth, 10 ) +
+					parseInt( trStyle.borderBottomWidth, 10 ) ) === tr.offsetHeight;
+
+				documentElement.removeChild( table );
+			}
+			return reliableTrDimensionsVal;
+		}
+	} );
+} )();
+
+
+function curCSS( elem, name, computed ) {
+	var width, minWidth, maxWidth, ret,
+
+		// Support: Firefox 51+
+		// Retrieving style before computed somehow
+		// fixes an issue with getting wrong values
+		// on detached elements
+		style = elem.style;
+
+	computed = computed || getStyles( elem );
+
+	// getPropertyValue is needed for:
+	//   .css('filter') (IE 9 only, #12537)
+	//   .css('--customProperty) (#3144)
+	if ( computed ) {
+		ret = computed.getPropertyValue( name ) || computed[ name ];
+
+		if ( ret === "" && !isAttached( elem ) ) {
+			ret = jQuery.style( elem, name );
+		}
+
+		// A tribute to the "awesome hack by Dean Edwards"
+		// Android Browser returns percentage for some values,
+		// but width seems to be reliably pixels.
+		// This is against the CSSOM draft spec:
+		// https://drafts.csswg.org/cssom/#resolved-values
+		if ( !support.pixelBoxStyles() && rnumnonpx.test( ret ) && rboxStyle.test( name ) ) {
+
+			// Remember the original values
+			width = style.width;
+			minWidth = style.minWidth;
+			maxWidth = style.maxWidth;
+
+			// Put in the new values to get a computed value out
+			style.minWidth = style.maxWidth = style.width = ret;
+			ret = computed.width;
+
+			// Revert the changed values
+			style.width = width;
+			style.minWidth = minWidth;
+			style.maxWidth = maxWidth;
+		}
+	}
+
+	return ret !== undefined ?
+
+		// Support: IE <=9 - 11 only
+		// IE returns zIndex value as an integer.
+		ret + "" :
+		ret;
+}
+
+
+function addGetHookIf( conditionFn, hookFn ) {
+
+	// Define the hook, we'll check on the first run if it's really needed.
+	return {
+		get: function() {
+			if ( conditionFn() ) {
+
+				// Hook not needed (or it's not possible to use it due
+				// to missing dependency), remove it.
+				delete this.get;
+				return;
+			}
+
+			// Hook needed; redefine it so that the support test is not executed again.
+			return ( this.get = hookFn ).apply( this, arguments );
+		}
+	};
+}
+
+
+var cssPrefixes = [ "Webkit", "Moz", "ms" ],
+	emptyStyle = document.createElement( "div" ).style,
+	vendorProps = {};
+
+// Return a vendor-prefixed property or undefined
+function vendorPropName( name ) {
+
+	// Check for vendor prefixed names
+	var capName = name[ 0 ].toUpperCase() + name.slice( 1 ),
+		i = cssPrefixes.length;
+
+	while ( i-- ) {
+		name = cssPrefixes[ i ] + capName;
+		if ( name in emptyStyle ) {
+			return name;
+		}
+	}
+}
+
+// Return a potentially-mapped jQuery.cssProps or vendor prefixed property
+function finalPropName( name ) {
+	var final = jQuery.cssProps[ name ] || vendorProps[ name ];
+
+	if ( final ) {
+		return final;
+	}
+	if ( name in emptyStyle ) {
+		return name;
+	}
+	return vendorProps[ name ] = vendorPropName( name ) || name;
+}
+
+
+var
+
+	// Swappable if display is none or starts with table
+	// except "table", "table-cell", or "table-caption"
+	// See here for display values: https://developer.mozilla.org/en-US/docs/CSS/display
+	rdisplayswap = /^(none|table(?!-c[ea]).+)/,
+	rcustomProp = /^--/,
+	cssShow = { position: "absolute", visibility: "hidden", display: "block" },
+	cssNormalTransform = {
+		letterSpacing: "0",
+		fontWeight: "400"
+	};
+
+function setPositiveNumber( _elem, value, subtract ) {
+
+	// Any relative (+/-) values have already been
+	// normalized at this point
+	var matches = rcssNum.exec( value );
+	return matches ?
+
+		// Guard against undefined "subtract", e.g., when used as in cssHooks
+		Math.max( 0, matches[ 2 ] - ( subtract || 0 ) ) + ( matches[ 3 ] || "px" ) :
+		value;
+}
+
+function boxModelAdjustment( elem, dimension, box, isBorderBox, styles, computedVal ) {
+	var i = dimension === "width" ? 1 : 0,
+		extra = 0,
+		delta = 0;
+
+	// Adjustment may not be necessary
+	if ( box === ( isBorderBox ? "border" : "content" ) ) {
+		return 0;
+	}
+
+	for ( ; i < 4; i += 2 ) {
+
+		// Both box models exclude margin
+		if ( box === "margin" ) {
+			delta += jQuery.css( elem, box + cssExpand[ i ], true, styles );
+		}
+
+		// If we get here with a content-box, we're seeking "padding" or "border" or "margin"
+		if ( !isBorderBox ) {
+
+			// Add padding
+			delta += jQuery.css( elem, "padding" + cssExpand[ i ], true, styles );
+
+			// For "border" or "margin", add border
+			if ( box !== "padding" ) {
+				delta += jQuery.css( elem, "border" + cssExpand[ i ] + "Width", true, styles );
+
+			// But still keep track of it otherwise
+			} else {
+				extra += jQuery.css( elem, "border" + cssExpand[ i ] + "Width", true, styles );
+			}
+
+		// If we get here with a border-box (content + padding + border), we're seeking "content" or
+		// "padding" or "margin"
+		} else {
+
+			// For "content", subtract padding
+			if ( box === "content" ) {
+				delta -= jQuery.css( elem, "padding" + cssExpand[ i ], true, styles );
+			}
+
+			// For "content" or "padding", subtract border
+			if ( box !== "margin" ) {
+				delta -= jQuery.css( elem, "border" + cssExpand[ i ] + "Width", true, styles );
+			}
+		}
+	}
+
+	// Account for positive content-box scroll gutter when requested by providing computedVal
+	if ( !isBorderBox && computedVal >= 0 ) {
+
+		// offsetWidth/offsetHeight is a rounded sum of content, padding, scroll gutter, and border
+		// Assuming integer scroll gutter, subtract the rest and round down
+		delta += Math.max( 0, Math.ceil(
+			elem[ "offset" + dimension[ 0 ].toUpperCase() + dimension.slice( 1 ) ] -
+			computedVal -
+			delta -
+			extra -
+			0.5
+
+		// If offsetWidth/offsetHeight is unknown, then we can't determine content-box scroll gutter
+		// Use an explicit zero to avoid NaN (gh-3964)
+		) ) || 0;
+	}
+
+	return delta;
+}
+
+function getWidthOrHeight( elem, dimension, extra ) {
+
+	// Start with computed style
+	var styles = getStyles( elem ),
+
+		// To avoid forcing a reflow, only fetch boxSizing if we need it (gh-4322).
+		// Fake content-box until we know it's needed to know the true value.
+		boxSizingNeeded = !support.boxSizingReliable() || extra,
+		isBorderBox = boxSizingNeeded &&
+			jQuery.css( elem, "boxSizing", false, styles ) === "border-box",
+		valueIsBorderBox = isBorderBox,
+
+		val = curCSS( elem, dimension, styles ),
+		offsetProp = "offset" + dimension[ 0 ].toUpperCase() + dimension.slice( 1 );
+
+	// Support: Firefox <=54
+	// Return a confounding non-pixel value or feign ignorance, as appropriate.
+	if ( rnumnonpx.test( val ) ) {
+		if ( !extra ) {
+			return val;
+		}
+		val = "auto";
+	}
+
+
+	// Support: IE 9 - 11 only
+	// Use offsetWidth/offsetHeight for when box sizing is unreliable.
+	// In those cases, the computed value can be trusted to be border-box.
+	if ( ( !support.boxSizingReliable() && isBorderBox ||
+
+		// Support: IE 10 - 11+, Edge 15 - 18+
+		// IE/Edge misreport `getComputedStyle` of table rows with width/height
+		// set in CSS while `offset*` properties report correct values.
+		// Interestingly, in some cases IE 9 doesn't suffer from this issue.
+		!support.reliableTrDimensions() && nodeName( elem, "tr" ) ||
+
+		// Fall back to offsetWidth/offsetHeight when value is "auto"
+		// This happens for inline elements with no explicit setting (gh-3571)
+		val === "auto" ||
+
+		// Support: Android <=4.1 - 4.3 only
+		// Also use offsetWidth/offsetHeight for misreported inline dimensions (gh-3602)
+		!parseFloat( val ) && jQuery.css( elem, "display", false, styles ) === "inline" ) &&
+
+		// Make sure the element is visible & connected
+		elem.getClientRects().length ) {
+
+		isBorderBox = jQuery.css( elem, "boxSizing", false, styles ) === "border-box";
+
+		// Where available, offsetWidth/offsetHeight approximate border box dimensions.
+		// Where not available (e.g., SVG), assume unreliable box-sizing and interpret the
+		// retrieved value as a content box dimension.
+		valueIsBorderBox = offsetProp in elem;
+		if ( valueIsBorderBox ) {
+			val = elem[ offsetProp ];
+		}
+	}
+
+	// Normalize "" and auto
+	val = parseFloat( val ) || 0;
+
+	// Adjust for the element's box model
+	return ( val +
+		boxModelAdjustment(
+			elem,
+			dimension,
+			extra || ( isBorderBox ? "border" : "content" ),
+			valueIsBorderBox,
+			styles,
+
+			// Provide the current computed size to request scroll gutter calculation (gh-3589)
+			val
+		)
+	) + "px";
+}
+
+jQuery.extend( {
+
+	// Add in style property hooks for overriding the default
+	// behavior of getting and setting a style property
+	cssHooks: {
+		opacity: {
+			get: function( elem, computed ) {
+				if ( computed ) {
+
+					// We should always get a number back from opacity
+					var ret = curCSS( elem, "opacity" );
+					return ret === "" ? "1" : ret;
+				}
+			}
+		}
+	},
+
+	// Don't automatically add "px" to these possibly-unitless properties
+	cssNumber: {
+		"animationIterationCount": true,
+		"columnCount": true,
+		"fillOpacity": true,
+		"flexGrow": true,
+		"flexShrink": true,
+		"fontWeight": true,
+		"gridArea": true,
+		"gridColumn": true,
+		"gridColumnEnd": true,
+		"gridColumnStart": true,
+		"gridRow": true,
+		"gridRowEnd": true,
+		"gridRowStart": true,
+		"lineHeight": true,
+		"opacity": true,
+		"order": true,
+		"orphans": true,
+		"widows": true,
+		"zIndex": true,
+		"zoom": true
+	},
+
+	// Add in properties whose names you wish to fix before
+	// setting or getting the value
+	cssProps: {},
+
+	// Get and set the style property on a DOM Node
+	style: function( elem, name, value, extra ) {
+
+		// Don't set styles on text and comment nodes
+		if ( !elem || elem.nodeType === 3 || elem.nodeType === 8 || !elem.style ) {
+			return;
+		}
+
+		// Make sure that we're working with the right name
+		var ret, type, hooks,
+			origName = camelCase( name ),
+			isCustomProp = rcustomProp.test( name ),
+			style = elem.style;
+
+		// Make sure that we're working with the right name. We don't
+		// want to query the value if it is a CSS custom property
+		// since they are user-defined.
+		if ( !isCustomProp ) {
+			name = finalPropName( origName );
+		}
+
+		// Gets hook for the prefixed version, then unprefixed version
+		hooks = jQuery.cssHooks[ name ] || jQuery.cssHooks[ origName ];
+
+		// Check if we're setting a value
+		if ( value !== undefined ) {
+			type = typeof value;
+
+			// Convert "+=" or "-=" to relative numbers (#7345)
+			if ( type === "string" && ( ret = rcssNum.exec( value ) ) && ret[ 1 ] ) {
+				value = adjustCSS( elem, name, ret );
+
+				// Fixes bug #9237
+				type = "number";
+			}
+
+			// Make sure that null and NaN values aren't set (#7116)
+			if ( value == null || value !== value ) {
+				return;
+			}
+
+			// If a number was passed in, add the unit (except for certain CSS properties)
+			// The isCustomProp check can be removed in jQuery 4.0 when we only auto-append
+			// "px" to a few hardcoded values.
+			if ( type === "number" && !isCustomProp ) {
+				value += ret && ret[ 3 ] || ( jQuery.cssNumber[ origName ] ? "" : "px" );
+			}
+
+			// background-* props affect original clone's values
+			if ( !support.clearCloneStyle && value === "" && name.indexOf( "background" ) === 0 ) {
+				style[ name ] = "inherit";
+			}
+
+			// If a hook was provided, use that value, otherwise just set the specified value
+			if ( !hooks || !( "set" in hooks ) ||
+				( value = hooks.set( elem, value, extra ) ) !== undefined ) {
+
+				if ( isCustomProp ) {
+					style.setProperty( name, value );
+				} else {
+					style[ name ] = value;
+				}
+			}
+
+		} else {
+
+			// If a hook was provided get the non-computed value from there
+			if ( hooks && "get" in hooks &&
+				( ret = hooks.get( elem, false, extra ) ) !== undefined ) {
+
+				return ret;
+			}
+
+			// Otherwise just get the value from the style object
+			return style[ name ];
+		}
+	},
+
+	css: function( elem, name, extra, styles ) {
+		var val, num, hooks,
+			origName = camelCase( name ),
+			isCustomProp = rcustomProp.test( name );
+
+		// Make sure that we're working with the right name. We don't
+		// want to modify the value if it is a CSS custom property
+		// since they are user-defined.
+		if ( !isCustomProp ) {
+			name = finalPropName( origName );
+		}
+
+		// Try prefixed name followed by the unprefixed name
+		hooks = jQuery.cssHooks[ name ] || jQuery.cssHooks[ origName ];
+
+		// If a hook was provided get the computed value from there
+		if ( hooks && "get" in hooks ) {
+			val = hooks.get( elem, true, extra );
+		}
+
+		// Otherwise, if a way to get the computed value exists, use that
+		if ( val === undefined ) {
+			val = curCSS( elem, name, styles );
+		}
+
+		// Convert "normal" to computed value
+		if ( val === "normal" && name in cssNormalTransform ) {
+			val = cssNormalTransform[ name ];
+		}
+
+		// Make numeric if forced or a qualifier was provided and val looks numeric
+		if ( extra === "" || extra ) {
+			num = parseFloat( val );
+			return extra === true || isFinite( num ) ? num || 0 : val;
+		}
+
+		return val;
+	}
+} );
+
+jQuery.each( [ "height", "width" ], function( _i, dimension ) {
+	jQuery.cssHooks[ dimension ] = {
+		get: function( elem, computed, extra ) {
+			if ( computed ) {
+
+				// Certain elements can have dimension info if we invisibly show them
+				// but it must have a current display style that would benefit
+				return rdisplayswap.test( jQuery.css( elem, "display" ) ) &&
+
+					// Support: Safari 8+
+					// Table columns in Safari have non-zero offsetWidth & zero
+					// getBoundingClientRect().width unless display is changed.
+					// Support: IE <=11 only
+					// Running getBoundingClientRect on a disconnected node
+					// in IE throws an error.
+					( !elem.getClientRects().length || !elem.getBoundingClientRect().width ) ?
+					swap( elem, cssShow, function() {
+						return getWidthOrHeight( elem, dimension, extra );
+					} ) :
+					getWidthOrHeight( elem, dimension, extra );
+			}
+		},
+
+		set: function( elem, value, extra ) {
+			var matches,
+				styles = getStyles( elem ),
+
+				// Only read styles.position if the test has a chance to fail
+				// to avoid forcing a reflow.
+				scrollboxSizeBuggy = !support.scrollboxSize() &&
+					styles.position === "absolute",
+
+				// To avoid forcing a reflow, only fetch boxSizing if we need it (gh-3991)
+				boxSizingNeeded = scrollboxSizeBuggy || extra,
+				isBorderBox = boxSizingNeeded &&
+					jQuery.css( elem, "boxSizing", false, styles ) === "border-box",
+				subtract = extra ?
+					boxModelAdjustment(
+						elem,
+						dimension,
+						extra,
+						isBorderBox,
+						styles
+					) :
+					0;
+
+			// Account for unreliable border-box dimensions by comparing offset* to computed and
+			// faking a content-box to get border and padding (gh-3699)
+			if ( isBorderBox && scrollboxSizeBuggy ) {
+				subtract -= Math.ceil(
+					elem[ "offset" + dimension[ 0 ].toUpperCase() + dimension.slice( 1 ) ] -
+					parseFloat( styles[ dimension ] ) -
+					boxModelAdjustment( elem, dimension, "border", false, styles ) -
+					0.5
+				);
+			}
+
+			// Convert to pixels if value adjustment is needed
+			if ( subtract && ( matches = rcssNum.exec( value ) ) &&
+				( matches[ 3 ] || "px" ) !== "px" ) {
+
+				elem.style[ dimension ] = value;
+				value = jQuery.css( elem, dimension );
+			}
+
+			return setPositiveNumber( elem, value, subtract );
+		}
+	};
+} );
+
+jQuery.cssHooks.marginLeft = addGetHookIf( support.reliableMarginLeft,
+	function( elem, computed ) {
+		if ( computed ) {
+			return ( parseFloat( curCSS( elem, "marginLeft" ) ) ||
+				elem.getBoundingClientRect().left -
+					swap( elem, { marginLeft: 0 }, function() {
+						return elem.getBoundingClientRect().left;
+					} )
+			) + "px";
+		}
+	}
+);
+
+// These hooks are used by animate to expand properties
+jQuery.each( {
+	margin: "",
+	padding: "",
+	border: "Width"
+}, function( prefix, suffix ) {
+	jQuery.cssHooks[ prefix + suffix ] = {
+		expand: function( value ) {
+			var i = 0,
+				expanded = {},
+
+				// Assumes a single number if not a string
+				parts = typeof value === "string" ? value.split( " " ) : [ value ];
+
+			for ( ; i < 4; i++ ) {
+				expanded[ prefix + cssExpand[ i ] + suffix ] =
+					parts[ i ] || parts[ i - 2 ] || parts[ 0 ];
+			}
+
+			return expanded;
+		}
+	};
+
+	if ( prefix !== "margin" ) {
+		jQuery.cssHooks[ prefix + suffix ].set = setPositiveNumber;
+	}
+} );
+
+jQuery.fn.extend( {
+	css: function( name, value ) {
+		return access( this, function( elem, name, value ) {
+			var styles, len,
+				map = {},
+				i = 0;
+
+			if ( Array.isArray( name ) ) {
+				styles = getStyles( elem );
+				len = name.length;
+
+				for ( ; i < len; i++ ) {
+					map[ name[ i ] ] = jQuery.css( elem, name[ i ], false, styles );
+				}
+
+				return map;
+			}
+
+			return value !== undefined ?
+				jQuery.style( elem, name, value ) :
+				jQuery.css( elem, name );
+		}, name, value, arguments.length > 1 );
+	}
+} );
+
+
+function Tween( elem, options, prop, end, easing ) {
+	return new Tween.prototype.init( elem, options, prop, end, easing );
+}
+jQuery.Tween = Tween;
+
+Tween.prototype = {
+	constructor: Tween,
+	init: function( elem, options, prop, end, easing, unit ) {
+		this.elem = elem;
+		this.prop = prop;
+		this.easing = easing || jQuery.easing._default;
+		this.options = options;
+		this.start = this.now = this.cur();
+		this.end = end;
+		this.unit = unit || ( jQuery.cssNumber[ prop ] ? "" : "px" );
+	},
+	cur: function() {
+		var hooks = Tween.propHooks[ this.prop ];
+
+		return hooks && hooks.get ?
+			hooks.get( this ) :
+			Tween.propHooks._default.get( this );
+	},
+	run: function( percent ) {
+		var eased,
+			hooks = Tween.propHooks[ this.prop ];
+
+		if ( this.options.duration ) {
+			this.pos = eased = jQuery.easing[ this.easing ](
+				percent, this.options.duration * percent, 0, 1, this.options.duration
+			);
+		} else {
+			this.pos = eased = percent;
+		}
+		this.now = ( this.end - this.start ) * eased + this.start;
+
+		if ( this.options.step ) {
+			this.options.step.call( this.elem, this.now, this );
+		}
+
+		if ( hooks && hooks.set ) {
+			hooks.set( this );
+		} else {
+			Tween.propHooks._default.set( this );
+		}
+		return this;
+	}
+};
+
+Tween.prototype.init.prototype = Tween.prototype;
+
+Tween.propHooks = {
+	_default: {
+		get: function( tween ) {
+			var result;
+
+			// Use a property on the element directly when it is not a DOM element,
+			// or when there is no matching style property that exists.
+			if ( tween.elem.nodeType !== 1 ||
+				tween.elem[ tween.prop ] != null && tween.elem.style[ tween.prop ] == null ) {
+				return tween.elem[ tween.prop ];
+			}
+
+			// Passing an empty string as a 3rd parameter to .css will automatically
+			// attempt a parseFloat and fallback to a string if the parse fails.
+			// Simple values such as "10px" are parsed to Float;
+			// complex values such as "rotate(1rad)" are returned as-is.
+			result = jQuery.css( tween.elem, tween.prop, "" );
+
+			// Empty strings, null, undefined and "auto" are converted to 0.
+			return !result || result === "auto" ? 0 : result;
+		},
+		set: function( tween ) {
+
+			// Use step hook for back compat.
+			// Use cssHook if its there.
+			// Use .style if available and use plain properties where available.
+			if ( jQuery.fx.step[ tween.prop ] ) {
+				jQuery.fx.step[ tween.prop ]( tween );
+			} else if ( tween.elem.nodeType === 1 && (
+				jQuery.cssHooks[ tween.prop ] ||
+					tween.elem.style[ finalPropName( tween.prop ) ] != null ) ) {
+				jQuery.style( tween.elem, tween.prop, tween.now + tween.unit );
+			} else {
+				tween.elem[ tween.prop ] = tween.now;
+			}
+		}
+	}
+};
+
+// Support: IE <=9 only
+// Panic based approach to setting things on disconnected nodes
+Tween.propHooks.scrollTop = Tween.propHooks.scrollLeft = {
+	set: function( tween ) {
+		if ( tween.elem.nodeType && tween.elem.parentNode ) {
+			tween.elem[ tween.prop ] = tween.now;
+		}
+	}
+};
+
+jQuery.easing = {
+	linear: function( p ) {
+		return p;
+	},
+	swing: function( p ) {
+		return 0.5 - Math.cos( p * Math.PI ) / 2;
+	},
+	_default: "swing"
+};
+
+jQuery.fx = Tween.prototype.init;
+
+// Back compat <1.8 extension point
+jQuery.fx.step = {};
+
+
+
+
+var
+	fxNow, inProgress,
+	rfxtypes = /^(?:toggle|show|hide)$/,
+	rrun = /queueHooks$/;
+
+function schedule() {
+	if ( inProgress ) {
+		if ( document.hidden === false && window.requestAnimationFrame ) {
+			window.requestAnimationFrame( schedule );
+		} else {
+			window.setTimeout( schedule, jQuery.fx.interval );
+		}
+
+		jQuery.fx.tick();
+	}
+}
+
+// Animations created synchronously will run synchronously
+function createFxNow() {
+	window.setTimeout( function() {
+		fxNow = undefined;
+	} );
+	return ( fxNow = Date.now() );
+}
+
+// Generate parameters to create a standard animation
+function genFx( type, includeWidth ) {
+	var which,
+		i = 0,
+		attrs = { height: type };
+
+	// If we include width, step value is 1 to do all cssExpand values,
+	// otherwise step value is 2 to skip over Left and Right
+	includeWidth = includeWidth ? 1 : 0;
+	for ( ; i < 4; i += 2 - includeWidth ) {
+		which = cssExpand[ i ];
+		attrs[ "margin" + which ] = attrs[ "padding" + which ] = type;
+	}
+
+	if ( includeWidth ) {
+		attrs.opacity = attrs.width = type;
+	}
+
+	return attrs;
+}
+
+function createTween( value, prop, animation ) {
+	var tween,
+		collection = ( Animation.tweeners[ prop ] || [] ).concat( Animation.tweeners[ "*" ] ),
+		index = 0,
+		length = collection.length;
+	for ( ; index < length; index++ ) {
+		if ( ( tween = collection[ index ].call( animation, prop, value ) ) ) {
+
+			// We're done with this property
+			return tween;
+		}
+	}
+}
+
+function defaultPrefilter( elem, props, opts ) {
+	var prop, value, toggle, hooks, oldfire, propTween, restoreDisplay, display,
+		isBox = "width" in props || "height" in props,
+		anim = this,
+		orig = {},
+		style = elem.style,
+		hidden = elem.nodeType && isHiddenWithinTree( elem ),
+		dataShow = dataPriv.get( elem, "fxshow" );
+
+	// Queue-skipping animations hijack the fx hooks
+	if ( !opts.queue ) {
+		hooks = jQuery._queueHooks( elem, "fx" );
+		if ( hooks.unqueued == null ) {
+			hooks.unqueued = 0;
+			oldfire = hooks.empty.fire;
+			hooks.empty.fire = function() {
+				if ( !hooks.unqueued ) {
+					oldfire();
+				}
+			};
+		}
+		hooks.unqueued++;
+
+		anim.always( function() {
+
+			// Ensure the complete handler is called before this completes
+			anim.always( function() {
+				hooks.unqueued--;
+				if ( !jQuery.queue( elem, "fx" ).length ) {
+					hooks.empty.fire();
+				}
+			} );
+		} );
+	}
+
+	// Detect show/hide animations
+	for ( prop in props ) {
+		value = props[ prop ];
+		if ( rfxtypes.test( value ) ) {
+			delete props[ prop ];
+			toggle = toggle || value === "toggle";
+			if ( value === ( hidden ? "hide" : "show" ) ) {
+
+				// Pretend to be hidden if this is a "show" and
+				// there is still data from a stopped show/hide
+				if ( value === "show" && dataShow && dataShow[ prop ] !== undefined ) {
+					hidden = true;
+
+				// Ignore all other no-op show/hide data
+				} else {
+					continue;
+				}
+			}
+			orig[ prop ] = dataShow && dataShow[ prop ] || jQuery.style( elem, prop );
+		}
+	}
+
+	// Bail out if this is a no-op like .hide().hide()
+	propTween = !jQuery.isEmptyObject( props );
+	if ( !propTween && jQuery.isEmptyObject( orig ) ) {
+		return;
+	}
+
+	// Restrict "overflow" and "display" styles during box animations
+	if ( isBox && elem.nodeType === 1 ) {
+
+		// Support: IE <=9 - 11, Edge 12 - 15
+		// Record all 3 overflow attributes because IE does not infer the shorthand
+		// from identically-valued overflowX and overflowY and Edge just mirrors
+		// the overflowX value there.
+		opts.overflow = [ style.overflow, style.overflowX, style.overflowY ];
+
+		// Identify a display type, preferring old show/hide data over the CSS cascade
+		restoreDisplay = dataShow && dataShow.display;
+		if ( restoreDisplay == null ) {
+			restoreDisplay = dataPriv.get( elem, "display" );
+		}
+		display = jQuery.css( elem, "display" );
+		if ( display === "none" ) {
+			if ( restoreDisplay ) {
+				display = restoreDisplay;
+			} else {
+
+				// Get nonempty value(s) by temporarily forcing visibility
+				showHide( [ elem ], true );
+				restoreDisplay = elem.style.display || restoreDisplay;
+				display = jQuery.css( elem, "display" );
+				showHide( [ elem ] );
+			}
+		}
+
+		// Animate inline elements as inline-block
+		if ( display === "inline" || display === "inline-block" && restoreDisplay != null ) {
+			if ( jQuery.css( elem, "float" ) === "none" ) {
+
+				// Restore the original display value at the end of pure show/hide animations
+				if ( !propTween ) {
+					anim.done( function() {
+						style.display = restoreDisplay;
+					} );
+					if ( restoreDisplay == null ) {
+						display = style.display;
+						restoreDisplay = display === "none" ? "" : display;
+					}
+				}
+				style.display = "inline-block";
+			}
+		}
+	}
+
+	if ( opts.overflow ) {
+		style.overflow = "hidden";
+		anim.always( function() {
+			style.overflow = opts.overflow[ 0 ];
+			style.overflowX = opts.overflow[ 1 ];
+			style.overflowY = opts.overflow[ 2 ];
+		} );
+	}
+
+	// Implement show/hide animations
+	propTween = false;
+	for ( prop in orig ) {
+
+		// General show/hide setup for this element animation
+		if ( !propTween ) {
+			if ( dataShow ) {
+				if ( "hidden" in dataShow ) {
+					hidden = dataShow.hidden;
+				}
+			} else {
+				dataShow = dataPriv.access( elem, "fxshow", { display: restoreDisplay } );
+			}
+
+			// Store hidden/visible for toggle so `.stop().toggle()` "reverses"
+			if ( toggle ) {
+				dataShow.hidden = !hidden;
+			}
+
+			// Show elements before animating them
+			if ( hidden ) {
+				showHide( [ elem ], true );
+			}
+
+			/* eslint-disable no-loop-func */
+
+			anim.done( function() {
+
+				/* eslint-enable no-loop-func */
+
+				// The final step of a "hide" animation is actually hiding the element
+				if ( !hidden ) {
+					showHide( [ elem ] );
+				}
+				dataPriv.remove( elem, "fxshow" );
+				for ( prop in orig ) {
+					jQuery.style( elem, prop, orig[ prop ] );
+				}
+			} );
+		}
+
+		// Per-property setup
+		propTween = createTween( hidden ? dataShow[ prop ] : 0, prop, anim );
+		if ( !( prop in dataShow ) ) {
+			dataShow[ prop ] = propTween.start;
+			if ( hidden ) {
+				propTween.end = propTween.start;
+				propTween.start = 0;
+			}
+		}
+	}
+}
+
+function propFilter( props, specialEasing ) {
+	var index, name, easing, value, hooks;
+
+	// camelCase, specialEasing and expand cssHook pass
+	for ( index in props ) {
+		name = camelCase( index );
+		easing = specialEasing[ name ];
+		value = props[ index ];
+		if ( Array.isArray( value ) ) {
+			easing = value[ 1 ];
+			value = props[ index ] = value[ 0 ];
+		}
+
+		if ( index !== name ) {
+			props[ name ] = value;
+			delete props[ index ];
+		}
+
+		hooks = jQuery.cssHooks[ name ];
+		if ( hooks && "expand" in hooks ) {
+			value = hooks.expand( value );
+			delete props[ name ];
+
+			// Not quite $.extend, this won't overwrite existing keys.
+			// Reusing 'index' because we have the correct "name"
+			for ( index in value ) {
+				if ( !( index in props ) ) {
+					props[ index ] = value[ index ];
+					specialEasing[ index ] = easing;
+				}
+			}
+		} else {
+			specialEasing[ name ] = easing;
+		}
+	}
+}
+
+function Animation( elem, properties, options ) {
+	var result,
+		stopped,
+		index = 0,
+		length = Animation.prefilters.length,
+		deferred = jQuery.Deferred().always( function() {
+
+			// Don't match elem in the :animated selector
+			delete tick.elem;
+		} ),
+		tick = function() {
+			if ( stopped ) {
+				return false;
+			}
+			var currentTime = fxNow || createFxNow(),
+				remaining = Math.max( 0, animation.startTime + animation.duration - currentTime ),
+
+				// Support: Android 2.3 only
+				// Archaic crash bug won't allow us to use `1 - ( 0.5 || 0 )` (#12497)
+				temp = remaining / animation.duration || 0,
+				percent = 1 - temp,
+				index = 0,
+				length = animation.tweens.length;
+
+			for ( ; index < length; index++ ) {
+				animation.tweens[ index ].run( percent );
+			}
+
+			deferred.notifyWith( elem, [ animation, percent, remaining ] );
+
+			// If there's more to do, yield
+			if ( percent < 1 && length ) {
+				return remaining;
+			}
+
+			// If this was an empty animation, synthesize a final progress notification
+			if ( !length ) {
+				deferred.notifyWith( elem, [ animation, 1, 0 ] );
+			}
+
+			// Resolve the animation and report its conclusion
+			deferred.resolveWith( elem, [ animation ] );
+			return false;
+		},
+		animation = deferred.promise( {
+			elem: elem,
+			props: jQuery.extend( {}, properties ),
+			opts: jQuery.extend( true, {
+				specialEasing: {},
+				easing: jQuery.easing._default
+			}, options ),
+			originalProperties: properties,
+			originalOptions: options,
+			startTime: fxNow || createFxNow(),
+			duration: options.duration,
+			tweens: [],
+			createTween: function( prop, end ) {
+				var tween = jQuery.Tween( elem, animation.opts, prop, end,
+					animation.opts.specialEasing[ prop ] || animation.opts.easing );
+				animation.tweens.push( tween );
+				return tween;
+			},
+			stop: function( gotoEnd ) {
+				var index = 0,
+
+					// If we are going to the end, we want to run all the tweens
+					// otherwise we skip this part
+					length = gotoEnd ? animation.tweens.length : 0;
+				if ( stopped ) {
+					return this;
+				}
+				stopped = true;
+				for ( ; index < length; index++ ) {
+					animation.tweens[ index ].run( 1 );
+				}
+
+				// Resolve when we played the last frame; otherwise, reject
+				if ( gotoEnd ) {
+					deferred.notifyWith( elem, [ animation, 1, 0 ] );
+					deferred.resolveWith( elem, [ animation, gotoEnd ] );
+				} else {
+					deferred.rejectWith( elem, [ animation, gotoEnd ] );
+				}
+				return this;
+			}
+		} ),
+		props = animation.props;
+
+	propFilter( props, animation.opts.specialEasing );
+
+	for ( ; index < length; index++ ) {
+		result = Animation.prefilters[ index ].call( animation, elem, props, animation.opts );
+		if ( result ) {
+			if ( isFunction( result.stop ) ) {
+				jQuery._queueHooks( animation.elem, animation.opts.queue ).stop =
+					result.stop.bind( result );
+			}
+			return result;
+		}
+	}
+
+	jQuery.map( props, createTween, animation );
+
+	if ( isFunction( animation.opts.start ) ) {
+		animation.opts.start.call( elem, animation );
+	}
+
+	// Attach callbacks from options
+	animation
+		.progress( animation.opts.progress )
+		.done( animation.opts.done, animation.opts.complete )
+		.fail( animation.opts.fail )
+		.always( animation.opts.always );
+
+	jQuery.fx.timer(
+		jQuery.extend( tick, {
+			elem: elem,
+			anim: animation,
+			queue: animation.opts.queue
+		} )
+	);
+
+	return animation;
+}
+
+jQuery.Animation = jQuery.extend( Animation, {
+
+	tweeners: {
+		"*": [ function( prop, value ) {
+			var tween = this.createTween( prop, value );
+			adjustCSS( tween.elem, prop, rcssNum.exec( value ), tween );
+			return tween;
+		} ]
+	},
+
+	tweener: function( props, callback ) {
+		if ( isFunction( props ) ) {
+			callback = props;
+			props = [ "*" ];
+		} else {
+			props = props.match( rnothtmlwhite );
+		}
+
+		var prop,
+			index = 0,
+			length = props.length;
+
+		for ( ; index < length; index++ ) {
+			prop = props[ index ];
+			Animation.tweeners[ prop ] = Animation.tweeners[ prop ] || [];
+			Animation.tweeners[ prop ].unshift( callback );
+		}
+	},
+
+	prefilters: [ defaultPrefilter ],
+
+	prefilter: function( callback, prepend ) {
+		if ( prepend ) {
+			Animation.prefilters.unshift( callback );
+		} else {
+			Animation.prefilters.push( callback );
+		}
+	}
+} );
+
+jQuery.speed = function( speed, easing, fn ) {
+	var opt = speed && typeof speed === "object" ? jQuery.extend( {}, speed ) : {
+		complete: fn || !fn && easing ||
+			isFunction( speed ) && speed,
+		duration: speed,
+		easing: fn && easing || easing && !isFunction( easing ) && easing
+	};
+
+	// Go to the end state if fx are off
+	if ( jQuery.fx.off ) {
+		opt.duration = 0;
+
+	} else {
+		if ( typeof opt.duration !== "number" ) {
+			if ( opt.duration in jQuery.fx.speeds ) {
+				opt.duration = jQuery.fx.speeds[ opt.duration ];
+
+			} else {
+				opt.duration = jQuery.fx.speeds._default;
+			}
+		}
+	}
+
+	// Normalize opt.queue - true/undefined/null -> "fx"
+	if ( opt.queue == null || opt.queue === true ) {
+		opt.queue = "fx";
+	}
+
+	// Queueing
+	opt.old = opt.complete;
+
+	opt.complete = function() {
+		if ( isFunction( opt.old ) ) {
+			opt.old.call( this );
+		}
+
+		if ( opt.queue ) {
+			jQuery.dequeue( this, opt.queue );
+		}
+	};
+
+	return opt;
+};
+
+jQuery.fn.extend( {
+	fadeTo: function( speed, to, easing, callback ) {
+
+		// Show any hidden elements after setting opacity to 0
+		return this.filter( isHiddenWithinTree ).css( "opacity", 0 ).show()
+
+			// Animate to the value specified
+			.end().animate( { opacity: to }, speed, easing, callback );
+	},
+	animate: function( prop, speed, easing, callback ) {
+		var empty = jQuery.isEmptyObject( prop ),
+			optall = jQuery.speed( speed, easing, callback ),
+			doAnimation = function() {
+
+				// Operate on a copy of prop so per-property easing won't be lost
+				var anim = Animation( this, jQuery.extend( {}, prop ), optall );
+
+				// Empty animations, or finishing resolves immediately
+				if ( empty || dataPriv.get( this, "finish" ) ) {
+					anim.stop( true );
+				}
+			};
+
+		doAnimation.finish = doAnimation;
+
+		return empty || optall.queue === false ?
+			this.each( doAnimation ) :
+			this.queue( optall.queue, doAnimation );
+	},
+	stop: function( type, clearQueue, gotoEnd ) {
+		var stopQueue = function( hooks ) {
+			var stop = hooks.stop;
+			delete hooks.stop;
+			stop( gotoEnd );
+		};
+
+		if ( typeof type !== "string" ) {
+			gotoEnd = clearQueue;
+			clearQueue = type;
+			type = undefined;
+		}
+		if ( clearQueue ) {
+			this.queue( type || "fx", [] );
+		}
+
+		return this.each( function() {
+			var dequeue = true,
+				index = type != null && type + "queueHooks",
+				timers = jQuery.timers,
+				data = dataPriv.get( this );
+
+			if ( index ) {
+				if ( data[ index ] && data[ index ].stop ) {
+					stopQueue( data[ index ] );
+				}
+			} else {
+				for ( index in data ) {
+					if ( data[ index ] && data[ index ].stop && rrun.test( index ) ) {
+						stopQueue( data[ index ] );
+					}
+				}
+			}
+
+			for ( index = timers.length; index--; ) {
+				if ( timers[ index ].elem === this &&
+					( type == null || timers[ index ].queue === type ) ) {
+
+					timers[ index ].anim.stop( gotoEnd );
+					dequeue = false;
+					timers.splice( index, 1 );
+				}
+			}
+
+			// Start the next in the queue if the last step wasn't forced.
+			// Timers currently will call their complete callbacks, which
+			// will dequeue but only if they were gotoEnd.
+			if ( dequeue || !gotoEnd ) {
+				jQuery.dequeue( this, type );
+			}
+		} );
+	},
+	finish: function( type ) {
+		if ( type !== false ) {
+			type = type || "fx";
+		}
+		return this.each( function() {
+			var index,
+				data = dataPriv.get( this ),
+				queue = data[ type + "queue" ],
+				hooks = data[ type + "queueHooks" ],
+				timers = jQuery.timers,
+				length = queue ? queue.length : 0;
+
+			// Enable finishing flag on private data
+			data.finish = true;
+
+			// Empty the queue first
+			jQuery.queue( this, type, [] );
+
+			if ( hooks && hooks.stop ) {
+				hooks.stop.call( this, true );
+			}
+
+			// Look for any active animations, and finish them
+			for ( index = timers.length; index--; ) {
+				if ( timers[ index ].elem === this && timers[ index ].queue === type ) {
+					timers[ index ].anim.stop( true );
+					timers.splice( index, 1 );
+				}
+			}
+
+			// Look for any animations in the old queue and finish them
+			for ( index = 0; index < length; index++ ) {
+				if ( queue[ index ] && queue[ index ].finish ) {
+					queue[ index ].finish.call( this );
+				}
+			}
+
+			// Turn off finishing flag
+			delete data.finish;
+		} );
+	}
+} );
+
+jQuery.each( [ "toggle", "show", "hide" ], function( _i, name ) {
+	var cssFn = jQuery.fn[ name ];
+	jQuery.fn[ name ] = function( speed, easing, callback ) {
+		return speed == null || typeof speed === "boolean" ?
+			cssFn.apply( this, arguments ) :
+			this.animate( genFx( name, true ), speed, easing, callback );
+	};
+} );
+
+// Generate shortcuts for custom animations
+jQuery.each( {
+	slideDown: genFx( "show" ),
+	slideUp: genFx( "hide" ),
+	slideToggle: genFx( "toggle" ),
+	fadeIn: { opacity: "show" },
+	fadeOut: { opacity: "hide" },
+	fadeToggle: { opacity: "toggle" }
+}, function( name, props ) {
+	jQuery.fn[ name ] = function( speed, easing, callback ) {
+		return this.animate( props, speed, easing, callback );
+	};
+} );
+
+jQuery.timers = [];
+jQuery.fx.tick = function() {
+	var timer,
+		i = 0,
+		timers = jQuery.timers;
+
+	fxNow = Date.now();
+
+	for ( ; i < timers.length; i++ ) {
+		timer = timers[ i ];
+
+		// Run the timer and safely remove it when done (allowing for external removal)
+		if ( !timer() && timers[ i ] === timer ) {
+			timers.splice( i--, 1 );
+		}
+	}
+
+	if ( !timers.length ) {
+		jQuery.fx.stop();
+	}
+	fxNow = undefined;
+};
+
+jQuery.fx.timer = function( timer ) {
+	jQuery.timers.push( timer );
+	jQuery.fx.start();
+};
+
+jQuery.fx.interval = 13;
+jQuery.fx.start = function() {
+	if ( inProgress ) {
+		return;
+	}
+
+	inProgress = true;
+	schedule();
+};
+
+jQuery.fx.stop = function() {
+	inProgress = null;
+};
+
+jQuery.fx.speeds = {
+	slow: 600,
+	fast: 200,
+
+	// Default speed
+	_default: 400
+};
+
+
+// Based off of the plugin by Clint Helfers, with permission.
+// https://web.archive.org/web/20100324014747/http://blindsignals.com/index.php/2009/07/jquery-delay/
+jQuery.fn.delay = function( time, type ) {
+	time = jQuery.fx ? jQuery.fx.speeds[ time ] || time : time;
+	type = type || "fx";
+
+	return this.queue( type, function( next, hooks ) {
+		var timeout = window.setTimeout( next, time );
+		hooks.stop = function() {
+			window.clearTimeout( timeout );
+		};
+	} );
+};
+
+
+( function() {
+	var input = document.createElement( "input" ),
+		select = document.createElement( "select" ),
+		opt = select.appendChild( document.createElement( "option" ) );
+
+	input.type = "checkbox";
+
+	// Support: Android <=4.3 only
+	// Default value for a checkbox should be "on"
+	support.checkOn = input.value !== "";
+
+	// Support: IE <=11 only
+	// Must access selectedIndex to make default options select
+	support.optSelected = opt.selected;
+
+	// Support: IE <=11 only
+	// An input loses its value after becoming a radio
+	input = document.createElement( "input" );
+	input.value = "t";
+	input.type = "radio";
+	support.radioValue = input.value === "t";
+} )();
+
+
+var boolHook,
+	attrHandle = jQuery.expr.attrHandle;
+
+jQuery.fn.extend( {
+	attr: function( name, value ) {
+		return access( this, jQuery.attr, name, value, arguments.length > 1 );
+	},
+
+	removeAttr: function( name ) {
+		return this.each( function() {
+			jQuery.removeAttr( this, name );
+		} );
+	}
+} );
+
+jQuery.extend( {
+	attr: function( elem, name, value ) {
+		var ret, hooks,
+			nType = elem.nodeType;
+
+		// Don't get/set attributes on text, comment and attribute nodes
+		if ( nType === 3 || nType === 8 || nType === 2 ) {
+			return;
+		}
+
+		// Fallback to prop when attributes are not supported
+		if ( typeof elem.getAttribute === "undefined" ) {
+			return jQuery.prop( elem, name, value );
+		}
+
+		// Attribute hooks are determined by the lowercase version
+		// Grab necessary hook if one is defined
+		if ( nType !== 1 || !jQuery.isXMLDoc( elem ) ) {
+			hooks = jQuery.attrHooks[ name.toLowerCase() ] ||
+				( jQuery.expr.match.bool.test( name ) ? boolHook : undefined );
+		}
+
+		if ( value !== undefined ) {
+			if ( value === null ) {
+				jQuery.removeAttr( elem, name );
+				return;
+			}
+
+			if ( hooks && "set" in hooks &&
+				( ret = hooks.set( elem, value, name ) ) !== undefined ) {
+				return ret;
+			}
+
+			elem.setAttribute( name, value + "" );
+			return value;
+		}
+
+		if ( hooks && "get" in hooks && ( ret = hooks.get( elem, name ) ) !== null ) {
+			return ret;
+		}
+
+		ret = jQuery.find.attr( elem, name );
+
+		// Non-existent attributes return null, we normalize to undefined
+		return ret == null ? undefined : ret;
+	},
+
+	attrHooks: {
+		type: {
+			set: function( elem, value ) {
+				if ( !support.radioValue && value === "radio" &&
+					nodeName( elem, "input" ) ) {
+					var val = elem.value;
+					elem.setAttribute( "type", value );
+					if ( val ) {
+						elem.value = val;
+					}
+					return value;
+				}
+			}
+		}
+	},
+
+	removeAttr: function( elem, value ) {
+		var name,
+			i = 0,
+
+			// Attribute names can contain non-HTML whitespace characters
+			// https://html.spec.whatwg.org/multipage/syntax.html#attributes-2
+			attrNames = value && value.match( rnothtmlwhite );
+
+		if ( attrNames && elem.nodeType === 1 ) {
+			while ( ( name = attrNames[ i++ ] ) ) {
+				elem.removeAttribute( name );
+			}
+		}
+	}
+} );
+
+// Hooks for boolean attributes
+boolHook = {
+	set: function( elem, value, name ) {
+		if ( value === false ) {
+
+			// Remove boolean attributes when set to false
+			jQuery.removeAttr( elem, name );
+		} else {
+			elem.setAttribute( name, name );
+		}
+		return name;
+	}
+};
+
+jQuery.each( jQuery.expr.match.bool.source.match( /\w+/g ), function( _i, name ) {
+	var getter = attrHandle[ name ] || jQuery.find.attr;
+
+	attrHandle[ name ] = function( elem, name, isXML ) {
+		var ret, handle,
+			lowercaseName = name.toLowerCase();
+
+		if ( !isXML ) {
+
+			// Avoid an infinite loop by temporarily removing this function from the getter
+			handle = attrHandle[ lowercaseName ];
+			attrHandle[ lowercaseName ] = ret;
+			ret = getter( elem, name, isXML ) != null ?
+				lowercaseName :
+				null;
+			attrHandle[ lowercaseName ] = handle;
+		}
+		return ret;
+	};
+} );
+
+
+
+
+var rfocusable = /^(?:input|select|textarea|button)$/i,
+	rclickable = /^(?:a|area)$/i;
+
+jQuery.fn.extend( {
+	prop: function( name, value ) {
+		return access( this, jQuery.prop, name, value, arguments.length > 1 );
+	},
+
+	removeProp: function( name ) {
+		return this.each( function() {
+			delete this[ jQuery.propFix[ name ] || name ];
+		} );
+	}
+} );
+
+jQuery.extend( {
+	prop: function( elem, name, value ) {
+		var ret, hooks,
+			nType = elem.nodeType;
+
+		// Don't get/set properties on text, comment and attribute nodes
+		if ( nType === 3 || nType === 8 || nType === 2 ) {
+			return;
+		}
+
+		if ( nType !== 1 || !jQuery.isXMLDoc( elem ) ) {
+
+			// Fix name and attach hooks
+			name = jQuery.propFix[ name ] || name;
+			hooks = jQuery.propHooks[ name ];
+		}
+
+		if ( value !== undefined ) {
+			if ( hooks && "set" in hooks &&
+				( ret = hooks.set( elem, value, name ) ) !== undefined ) {
+				return ret;
+			}
+
+			return ( elem[ name ] = value );
+		}
+
+		if ( hooks && "get" in hooks && ( ret = hooks.get( elem, name ) ) !== null ) {
+			return ret;
+		}
+
+		return elem[ name ];
+	},
+
+	propHooks: {
+		tabIndex: {
+			get: function( elem ) {
+
+				// Support: IE <=9 - 11 only
+				// elem.tabIndex doesn't always return the
+				// correct value when it hasn't been explicitly set
+				// https://web.archive.org/web/20141116233347/http://fluidproject.org/blog/2008/01/09/getting-setting-and-removing-tabindex-values-with-javascript/
+				// Use proper attribute retrieval(#12072)
+				var tabindex = jQuery.find.attr( elem, "tabindex" );
+
+				if ( tabindex ) {
+					return parseInt( tabindex, 10 );
+				}
+
+				if (
+					rfocusable.test( elem.nodeName ) ||
+					rclickable.test( elem.nodeName ) &&
+					elem.href
+				) {
+					return 0;
+				}
+
+				return -1;
+			}
+		}
+	},
+
+	propFix: {
+		"for": "htmlFor",
+		"class": "className"
+	}
+} );
+
+// Support: IE <=11 only
+// Accessing the selectedIndex property
+// forces the browser to respect setting selected
+// on the option
+// The getter ensures a default option is selected
+// when in an optgroup
+// eslint rule "no-unused-expressions" is disabled for this code
+// since it considers such accessions noop
+if ( !support.optSelected ) {
+	jQuery.propHooks.selected = {
+		get: function( elem ) {
+
+			/* eslint no-unused-expressions: "off" */
+
+			var parent = elem.parentNode;
+			if ( parent && parent.parentNode ) {
+				parent.parentNode.selectedIndex;
+			}
+			return null;
+		},
+		set: function( elem ) {
+
+			/* eslint no-unused-expressions: "off" */
+
+			var parent = elem.parentNode;
+			if ( parent ) {
+				parent.selectedIndex;
+
+				if ( parent.parentNode ) {
+					parent.parentNode.selectedIndex;
+				}
+			}
+		}
+	};
+}
+
+jQuery.each( [
+	"tabIndex",
+	"readOnly",
+	"maxLength",
+	"cellSpacing",
+	"cellPadding",
+	"rowSpan",
+	"colSpan",
+	"useMap",
+	"frameBorder",
+	"contentEditable"
+], function() {
+	jQuery.propFix[ this.toLowerCase() ] = this;
+} );
+
+
+
+
+	// Strip and collapse whitespace according to HTML spec
+	// https://infra.spec.whatwg.org/#strip-and-collapse-ascii-whitespace
+	function stripAndCollapse( value ) {
+		var tokens = value.match( rnothtmlwhite ) || [];
+		return tokens.join( " " );
+	}
+
+
+function getClass( elem ) {
+	return elem.getAttribute && elem.getAttribute( "class" ) || "";
+}
+
+function classesToArray( value ) {
+	if ( Array.isArray( value ) ) {
+		return value;
+	}
+	if ( typeof value === "string" ) {
+		return value.match( rnothtmlwhite ) || [];
+	}
+	return [];
+}
+
+jQuery.fn.extend( {
+	addClass: function( value ) {
+		var classes, elem, cur, curValue, clazz, j, finalValue,
+			i = 0;
+
+		if ( isFunction( value ) ) {
+			return this.each( function( j ) {
+				jQuery( this ).addClass( value.call( this, j, getClass( this ) ) );
+			} );
+		}
+
+		classes = classesToArray( value );
+
+		if ( classes.length ) {
+			while ( ( elem = this[ i++ ] ) ) {
+				curValue = getClass( elem );
+				cur = elem.nodeType === 1 && ( " " + stripAndCollapse( curValue ) + " " );
+
+				if ( cur ) {
+					j = 0;
+					while ( ( clazz = classes[ j++ ] ) ) {
+						if ( cur.indexOf( " " + clazz + " " ) < 0 ) {
+							cur += clazz + " ";
+						}
+					}
+
+					// Only assign if different to avoid unneeded rendering.
+					finalValue = stripAndCollapse( cur );
+					if ( curValue !== finalValue ) {
+						elem.setAttribute( "class", finalValue );
+					}
+				}
+			}
+		}
+
+		return this;
+	},
+
+	removeClass: function( value ) {
+		var classes, elem, cur, curValue, clazz, j, finalValue,
+			i = 0;
+
+		if ( isFunction( value ) ) {
+			return this.each( function( j ) {
+				jQuery( this ).removeClass( value.call( this, j, getClass( this ) ) );
+			} );
+		}
+
+		if ( !arguments.length ) {
+			return this.attr( "class", "" );
+		}
+
+		classes = classesToArray( value );
+
+		if ( classes.length ) {
+			while ( ( elem = this[ i++ ] ) ) {
+				curValue = getClass( elem );
+
+				// This expression is here for better compressibility (see addClass)
+				cur = elem.nodeType === 1 && ( " " + stripAndCollapse( curValue ) + " " );
+
+				if ( cur ) {
+					j = 0;
+					while ( ( clazz = classes[ j++ ] ) ) {
+
+						// Remove *all* instances
+						while ( cur.indexOf( " " + clazz + " " ) > -1 ) {
+							cur = cur.replace( " " + clazz + " ", " " );
+						}
+					}
+
+					// Only assign if different to avoid unneeded rendering.
+					finalValue = stripAndCollapse( cur );
+					if ( curValue !== finalValue ) {
+						elem.setAttribute( "class", finalValue );
+					}
+				}
+			}
+		}
+
+		return this;
+	},
+
+	toggleClass: function( value, stateVal ) {
+		var type = typeof value,
+			isValidValue = type === "string" || Array.isArray( value );
+
+		if ( typeof stateVal === "boolean" && isValidValue ) {
+			return stateVal ? this.addClass( value ) : this.removeClass( value );
+		}
+
+		if ( isFunction( value ) ) {
+			return this.each( function( i ) {
+				jQuery( this ).toggleClass(
+					value.call( this, i, getClass( this ), stateVal ),
+					stateVal
+				);
+			} );
+		}
+
+		return this.each( function() {
+			var className, i, self, classNames;
+
+			if ( isValidValue ) {
+
+				// Toggle individual class names
+				i = 0;
+				self = jQuery( this );
+				classNames = classesToArray( value );
+
+				while ( ( className = classNames[ i++ ] ) ) {
+
+					// Check each className given, space separated list
+					if ( self.hasClass( className ) ) {
+						self.removeClass( className );
+					} else {
+						self.addClass( className );
+					}
+				}
+
+			// Toggle whole class name
+			} else if ( value === undefined || type === "boolean" ) {
+				className = getClass( this );
+				if ( className ) {
+
+					// Store className if set
+					dataPriv.set( this, "__className__", className );
+				}
+
+				// If the element has a class name or if we're passed `false`,
+				// then remove the whole classname (if there was one, the above saved it).
+				// Otherwise bring back whatever was previously saved (if anything),
+				// falling back to the empty string if nothing was stored.
+				if ( this.setAttribute ) {
+					this.setAttribute( "class",
+						className || value === false ?
+							"" :
+							dataPriv.get( this, "__className__" ) || ""
+					);
+				}
+			}
+		} );
+	},
+
+	hasClass: function( selector ) {
+		var className, elem,
+			i = 0;
+
+		className = " " + selector + " ";
+		while ( ( elem = this[ i++ ] ) ) {
+			if ( elem.nodeType === 1 &&
+				( " " + stripAndCollapse( getClass( elem ) ) + " " ).indexOf( className ) > -1 ) {
+				return true;
+			}
+		}
+
+		return false;
+	}
+} );
+
+
+
+
+var rreturn = /\r/g;
+
+jQuery.fn.extend( {
+	val: function( value ) {
+		var hooks, ret, valueIsFunction,
+			elem = this[ 0 ];
+
+		if ( !arguments.length ) {
+			if ( elem ) {
+				hooks = jQuery.valHooks[ elem.type ] ||
+					jQuery.valHooks[ elem.nodeName.toLowerCase() ];
+
+				if ( hooks &&
+					"get" in hooks &&
+					( ret = hooks.get( elem, "value" ) ) !== undefined
+				) {
+					return ret;
+				}
+
+				ret = elem.value;
+
+				// Handle most common string cases
+				if ( typeof ret === "string" ) {
+					return ret.replace( rreturn, "" );
+				}
+
+				// Handle cases where value is null/undef or number
+				return ret == null ? "" : ret;
+			}
+
+			return;
+		}
+
+		valueIsFunction = isFunction( value );
+
+		return this.each( function( i ) {
+			var val;
+
+			if ( this.nodeType !== 1 ) {
+				return;
+			}
+
+			if ( valueIsFunction ) {
+				val = value.call( this, i, jQuery( this ).val() );
+			} else {
+				val = value;
+			}
+
+			// Treat null/undefined as ""; convert numbers to string
+			if ( val == null ) {
+				val = "";
+
+			} else if ( typeof val === "number" ) {
+				val += "";
+
+			} else if ( Array.isArray( val ) ) {
+				val = jQuery.map( val, function( value ) {
+					return value == null ? "" : value + "";
+				} );
+			}
+
+			hooks = jQuery.valHooks[ this.type ] || jQuery.valHooks[ this.nodeName.toLowerCase() ];
+
+			// If set returns undefined, fall back to normal setting
+			if ( !hooks || !( "set" in hooks ) || hooks.set( this, val, "value" ) === undefined ) {
+				this.value = val;
+			}
+		} );
+	}
+} );
+
+jQuery.extend( {
+	valHooks: {
+		option: {
+			get: function( elem ) {
+
+				var val = jQuery.find.attr( elem, "value" );
+				return val != null ?
+					val :
+
+					// Support: IE <=10 - 11 only
+					// option.text throws exceptions (#14686, #14858)
+					// Strip and collapse whitespace
+					// https://html.spec.whatwg.org/#strip-and-collapse-whitespace
+					stripAndCollapse( jQuery.text( elem ) );
+			}
+		},
+		select: {
+			get: function( elem ) {
+				var value, option, i,
+					options = elem.options,
+					index = elem.selectedIndex,
+					one = elem.type === "select-one",
+					values = one ? null : [],
+					max = one ? index + 1 : options.length;
+
+				if ( index < 0 ) {
+					i = max;
+
+				} else {
+					i = one ? index : 0;
+				}
+
+				// Loop through all the selected options
+				for ( ; i < max; i++ ) {
+					option = options[ i ];
+
+					// Support: IE <=9 only
+					// IE8-9 doesn't update selected after form reset (#2551)
+					if ( ( option.selected || i === index ) &&
+
+							// Don't return options that are disabled or in a disabled optgroup
+							!option.disabled &&
+							( !option.parentNode.disabled ||
+								!nodeName( option.parentNode, "optgroup" ) ) ) {
+
+						// Get the specific value for the option
+						value = jQuery( option ).val();
+
+						// We don't need an array for one selects
+						if ( one ) {
+							return value;
+						}
+
+						// Multi-Selects return an array
+						values.push( value );
+					}
+				}
+
+				return values;
+			},
+
+			set: function( elem, value ) {
+				var optionSet, option,
+					options = elem.options,
+					values = jQuery.makeArray( value ),
+					i = options.length;
+
+				while ( i-- ) {
+					option = options[ i ];
+
+					/* eslint-disable no-cond-assign */
+
+					if ( option.selected =
+						jQuery.inArray( jQuery.valHooks.option.get( option ), values ) > -1
+					) {
+						optionSet = true;
+					}
+
+					/* eslint-enable no-cond-assign */
+				}
+
+				// Force browsers to behave consistently when non-matching value is set
+				if ( !optionSet ) {
+					elem.selectedIndex = -1;
+				}
+				return values;
+			}
+		}
+	}
+} );
+
+// Radios and checkboxes getter/setter
+jQuery.each( [ "radio", "checkbox" ], function() {
+	jQuery.valHooks[ this ] = {
+		set: function( elem, value ) {
+			if ( Array.isArray( value ) ) {
+				return ( elem.checked = jQuery.inArray( jQuery( elem ).val(), value ) > -1 );
+			}
+		}
+	};
+	if ( !support.checkOn ) {
+		jQuery.valHooks[ this ].get = function( elem ) {
+			return elem.getAttribute( "value" ) === null ? "on" : elem.value;
+		};
+	}
+} );
+
+
+
+
+// Return jQuery for attributes-only inclusion
+
+
+support.focusin = "onfocusin" in window;
+
+
+var rfocusMorph = /^(?:focusinfocus|focusoutblur)$/,
+	stopPropagationCallback = function( e ) {
+		e.stopPropagation();
+	};
+
+jQuery.extend( jQuery.event, {
+
+	trigger: function( event, data, elem, onlyHandlers ) {
+
+		var i, cur, tmp, bubbleType, ontype, handle, special, lastElement,
+			eventPath = [ elem || document ],
+			type = hasOwn.call( event, "type" ) ? event.type : event,
+			namespaces = hasOwn.call( event, "namespace" ) ? event.namespace.split( "." ) : [];
+
+		cur = lastElement = tmp = elem = elem || document;
+
+		// Don't do events on text and comment nodes
+		if ( elem.nodeType === 3 || elem.nodeType === 8 ) {
+			return;
+		}
+
+		// focus/blur morphs to focusin/out; ensure we're not firing them right now
+		if ( rfocusMorph.test( type + jQuery.event.triggered ) ) {
+			return;
+		}
+
+		if ( type.indexOf( "." ) > -1 ) {
+
+			// Namespaced trigger; create a regexp to match event type in handle()
+			namespaces = type.split( "." );
+			type = namespaces.shift();
+			namespaces.sort();
+		}
+		ontype = type.indexOf( ":" ) < 0 && "on" + type;
+
+		// Caller can pass in a jQuery.Event object, Object, or just an event type string
+		event = event[ jQuery.expando ] ?
+			event :
+			new jQuery.Event( type, typeof event === "object" && event );
+
+		// Trigger bitmask: & 1 for native handlers; & 2 for jQuery (always true)
+		event.isTrigger = onlyHandlers ? 2 : 3;
+		event.namespace = namespaces.join( "." );
+		event.rnamespace = event.namespace ?
+			new RegExp( "(^|\\.)" + namespaces.join( "\\.(?:.*\\.|)" ) + "(\\.|$)" ) :
+			null;
+
+		// Clean up the event in case it is being reused
+		event.result = undefined;
+		if ( !event.target ) {
+			event.target = elem;
+		}
+
+		// Clone any incoming data and prepend the event, creating the handler arg list
+		data = data == null ?
+			[ event ] :
+			jQuery.makeArray( data, [ event ] );
+
+		// Allow special events to draw outside the lines
+		special = jQuery.event.special[ type ] || {};
+		if ( !onlyHandlers && special.trigger && special.trigger.apply( elem, data ) === false ) {
+			return;
+		}
+
+		// Determine event propagation path in advance, per W3C events spec (#9951)
+		// Bubble up to document, then to window; watch for a global ownerDocument var (#9724)
+		if ( !onlyHandlers && !special.noBubble && !isWindow( elem ) ) {
+
+			bubbleType = special.delegateType || type;
+			if ( !rfocusMorph.test( bubbleType + type ) ) {
+				cur = cur.parentNode;
+			}
+			for ( ; cur; cur = cur.parentNode ) {
+				eventPath.push( cur );
+				tmp = cur;
+			}
+
+			// Only add window if we got to document (e.g., not plain obj or detached DOM)
+			if ( tmp === ( elem.ownerDocument || document ) ) {
+				eventPath.push( tmp.defaultView || tmp.parentWindow || window );
+			}
+		}
+
+		// Fire handlers on the event path
+		i = 0;
+		while ( ( cur = eventPath[ i++ ] ) && !event.isPropagationStopped() ) {
+			lastElement = cur;
+			event.type = i > 1 ?
+				bubbleType :
+				special.bindType || type;
+
+			// jQuery handler
+			handle = ( dataPriv.get( cur, "events" ) || Object.create( null ) )[ event.type ] &&
+				dataPriv.get( cur, "handle" );
+			if ( handle ) {
+				handle.apply( cur, data );
+			}
+
+			// Native handler
+			handle = ontype && cur[ ontype ];
+			if ( handle && handle.apply && acceptData( cur ) ) {
+				event.result = handle.apply( cur, data );
+				if ( event.result === false ) {
+					event.preventDefault();
+				}
+			}
+		}
+		event.type = type;
+
+		// If nobody prevented the default action, do it now
+		if ( !onlyHandlers && !event.isDefaultPrevented() ) {
+
+			if ( ( !special._default ||
+				special._default.apply( eventPath.pop(), data ) === false ) &&
+				acceptData( elem ) ) {
+
+				// Call a native DOM method on the target with the same name as the event.
+				// Don't do default actions on window, that's where global variables be (#6170)
+				if ( ontype && isFunction( elem[ type ] ) && !isWindow( elem ) ) {
+
+					// Don't re-trigger an onFOO event when we call its FOO() method
+					tmp = elem[ ontype ];
+
+					if ( tmp ) {
+						elem[ ontype ] = null;
+					}
+
+					// Prevent re-triggering of the same event, since we already bubbled it above
+					jQuery.event.triggered = type;
+
+					if ( event.isPropagationStopped() ) {
+						lastElement.addEventListener( type, stopPropagationCallback );
+					}
+
+					elem[ type ]();
+
+					if ( event.isPropagationStopped() ) {
+						lastElement.removeEventListener( type, stopPropagationCallback );
+					}
+
+					jQuery.event.triggered = undefined;
+
+					if ( tmp ) {
+						elem[ ontype ] = tmp;
+					}
+				}
+			}
+		}
+
+		return event.result;
+	},
+
+	// Piggyback on a donor event to simulate a different one
+	// Used only for `focus(in | out)` events
+	simulate: function( type, elem, event ) {
+		var e = jQuery.extend(
+			new jQuery.Event(),
+			event,
+			{
+				type: type,
+				isSimulated: true
+			}
+		);
+
+		jQuery.event.trigger( e, null, elem );
+	}
+
+} );
+
+jQuery.fn.extend( {
+
+	trigger: function( type, data ) {
+		return this.each( function() {
+			jQuery.event.trigger( type, data, this );
+		} );
+	},
+	triggerHandler: function( type, data ) {
+		var elem = this[ 0 ];
+		if ( elem ) {
+			return jQuery.event.trigger( type, data, elem, true );
+		}
+	}
+} );
+
+
+// Support: Firefox <=44
+// Firefox doesn't have focus(in | out) events
+// Related ticket - https://bugzilla.mozilla.org/show_bug.cgi?id=687787
+//
+// Support: Chrome <=48 - 49, Safari <=9.0 - 9.1
+// focus(in | out) events fire after focus & blur events,
+// which is spec violation - http://www.w3.org/TR/DOM-Level-3-Events/#events-focusevent-event-order
+// Related ticket - https://bugs.chromium.org/p/chromium/issues/detail?id=449857
+if ( !support.focusin ) {
+	jQuery.each( { focus: "focusin", blur: "focusout" }, function( orig, fix ) {
+
+		// Attach a single capturing handler on the document while someone wants focusin/focusout
+		var handler = function( event ) {
+			jQuery.event.simulate( fix, event.target, jQuery.event.fix( event ) );
+		};
+
+		jQuery.event.special[ fix ] = {
+			setup: function() {
+
+				// Handle: regular nodes (via `this.ownerDocument`), window
+				// (via `this.document`) & document (via `this`).
+				var doc = this.ownerDocument || this.document || this,
+					attaches = dataPriv.access( doc, fix );
+
+				if ( !attaches ) {
+					doc.addEventListener( orig, handler, true );
+				}
+				dataPriv.access( doc, fix, ( attaches || 0 ) + 1 );
+			},
+			teardown: function() {
+				var doc = this.ownerDocument || this.document || this,
+					attaches = dataPriv.access( doc, fix ) - 1;
+
+				if ( !attaches ) {
+					doc.removeEventListener( orig, handler, true );
+					dataPriv.remove( doc, fix );
+
+				} else {
+					dataPriv.access( doc, fix, attaches );
+				}
+			}
+		};
+	} );
+}
+var location = window.location;
+
+var nonce = { guid: Date.now() };
+
+var rquery = ( /\?/ );
+
+
+
+// Cross-browser xml parsing
+jQuery.parseXML = function( data ) {
+	var xml, parserErrorElem;
+	if ( !data || typeof data !== "string" ) {
+		return null;
+	}
+
+	// Support: IE 9 - 11 only
+	// IE throws on parseFromString with invalid input.
+	try {
+		xml = ( new window.DOMParser() ).parseFromString( data, "text/xml" );
+	} catch ( e ) {}
+
+	parserErrorElem = xml && xml.getElementsByTagName( "parsererror" )[ 0 ];
+	if ( !xml || parserErrorElem ) {
+		jQuery.error( "Invalid XML: " + (
+			parserErrorElem ?
+				jQuery.map( parserErrorElem.childNodes, function( el ) {
+					return el.textContent;
+				} ).join( "\n" ) :
+				data
+		) );
+	}
+	return xml;
+};
+
+
+var
+	rbracket = /\[\]$/,
+	rCRLF = /\r?\n/g,
+	rsubmitterTypes = /^(?:submit|button|image|reset|file)$/i,
+	rsubmittable = /^(?:input|select|textarea|keygen)/i;
+
+function buildParams( prefix, obj, traditional, add ) {
+	var name;
+
+	if ( Array.isArray( obj ) ) {
+
+		// Serialize array item.
+		jQuery.each( obj, function( i, v ) {
+			if ( traditional || rbracket.test( prefix ) ) {
+
+				// Treat each array item as a scalar.
+				add( prefix, v );
+
+			} else {
+
+				// Item is non-scalar (array or object), encode its numeric index.
+				buildParams(
+					prefix + "[" + ( typeof v === "object" && v != null ? i : "" ) + "]",
+					v,
+					traditional,
+					add
+				);
+			}
+		} );
+
+	} else if ( !traditional && toType( obj ) === "object" ) {
+
+		// Serialize object item.
+		for ( name in obj ) {
+			buildParams( prefix + "[" + name + "]", obj[ name ], traditional, add );
+		}
+
+	} else {
+
+		// Serialize scalar item.
+		add( prefix, obj );
+	}
+}
+
+// Serialize an array of form elements or a set of
+// key/values into a query string
+jQuery.param = function( a, traditional ) {
+	var prefix,
+		s = [],
+		add = function( key, valueOrFunction ) {
+
+			// If value is a function, invoke it and use its return value
+			var value = isFunction( valueOrFunction ) ?
+				valueOrFunction() :
+				valueOrFunction;
+
+			s[ s.length ] = encodeURIComponent( key ) + "=" +
+				encodeURIComponent( value == null ? "" : value );
+		};
+
+	if ( a == null ) {
+		return "";
+	}
+
+	// If an array was passed in, assume that it is an array of form elements.
+	if ( Array.isArray( a ) || ( a.jquery && !jQuery.isPlainObject( a ) ) ) {
+
+		// Serialize the form elements
+		jQuery.each( a, function() {
+			add( this.name, this.value );
+		} );
+
+	} else {
+
+		// If traditional, encode the "old" way (the way 1.3.2 or older
+		// did it), otherwise encode params recursively.
+		for ( prefix in a ) {
+			buildParams( prefix, a[ prefix ], traditional, add );
+		}
+	}
+
+	// Return the resulting serialization
+	return s.join( "&" );
+};
+
+jQuery.fn.extend( {
+	serialize: function() {
+		return jQuery.param( this.serializeArray() );
+	},
+	serializeArray: function() {
+		return this.map( function() {
+
+			// Can add propHook for "elements" to filter or add form elements
+			var elements = jQuery.prop( this, "elements" );
+			return elements ? jQuery.makeArray( elements ) : this;
+		} ).filter( function() {
+			var type = this.type;
+
+			// Use .is( ":disabled" ) so that fieldset[disabled] works
+			return this.name && !jQuery( this ).is( ":disabled" ) &&
+				rsubmittable.test( this.nodeName ) && !rsubmitterTypes.test( type ) &&
+				( this.checked || !rcheckableType.test( type ) );
+		} ).map( function( _i, elem ) {
+			var val = jQuery( this ).val();
+
+			if ( val == null ) {
+				return null;
+			}
+
+			if ( Array.isArray( val ) ) {
+				return jQuery.map( val, function( val ) {
+					return { name: elem.name, value: val.replace( rCRLF, "\r\n" ) };
+				} );
+			}
+
+			return { name: elem.name, value: val.replace( rCRLF, "\r\n" ) };
+		} ).get();
+	}
+} );
+
+
+var
+	r20 = /%20/g,
+	rhash = /#.*$/,
+	rantiCache = /([?&])_=[^&]*/,
+	rheaders = /^(.*?):[ \t]*([^\r\n]*)$/mg,
+
+	// #7653, #8125, #8152: local protocol detection
+	rlocalProtocol = /^(?:about|app|app-storage|.+-extension|file|res|widget):$/,
+	rnoContent = /^(?:GET|HEAD)$/,
+	rprotocol = /^\/\//,
+
+	/* Prefilters
+	 * 1) They are useful to introduce custom dataTypes (see ajax/jsonp.js for an example)
+	 * 2) These are called:
+	 *    - BEFORE asking for a transport
+	 *    - AFTER param serialization (s.data is a string if s.processData is true)
+	 * 3) key is the dataType
+	 * 4) the catchall symbol "*" can be used
+	 * 5) execution will start with transport dataType and THEN continue down to "*" if needed
+	 */
+	prefilters = {},
+
+	/* Transports bindings
+	 * 1) key is the dataType
+	 * 2) the catchall symbol "*" can be used
+	 * 3) selection will start with transport dataType and THEN go to "*" if needed
+	 */
+	transports = {},
+
+	// Avoid comment-prolog char sequence (#10098); must appease lint and evade compression
+	allTypes = "*/".concat( "*" ),
+
+	// Anchor tag for parsing the document origin
+	originAnchor = document.createElement( "a" );
+
+originAnchor.href = location.href;
+
+// Base "constructor" for jQuery.ajaxPrefilter and jQuery.ajaxTransport
+function addToPrefiltersOrTransports( structure ) {
+
+	// dataTypeExpression is optional and defaults to "*"
+	return function( dataTypeExpression, func ) {
+
+		if ( typeof dataTypeExpression !== "string" ) {
+			func = dataTypeExpression;
+			dataTypeExpression = "*";
+		}
+
+		var dataType,
+			i = 0,
+			dataTypes = dataTypeExpression.toLowerCase().match( rnothtmlwhite ) || [];
+
+		if ( isFunction( func ) ) {
+
+			// For each dataType in the dataTypeExpression
+			while ( ( dataType = dataTypes[ i++ ] ) ) {
+
+				// Prepend if requested
+				if ( dataType[ 0 ] === "+" ) {
+					dataType = dataType.slice( 1 ) || "*";
+					( structure[ dataType ] = structure[ dataType ] || [] ).unshift( func );
+
+				// Otherwise append
+				} else {
+					( structure[ dataType ] = structure[ dataType ] || [] ).push( func );
+				}
+			}
+		}
+	};
+}
+
+// Base inspection function for prefilters and transports
+function inspectPrefiltersOrTransports( structure, options, originalOptions, jqXHR ) {
+
+	var inspected = {},
+		seekingTransport = ( structure === transports );
+
+	function inspect( dataType ) {
+		var selected;
+		inspected[ dataType ] = true;
+		jQuery.each( structure[ dataType ] || [], function( _, prefilterOrFactory ) {
+			var dataTypeOrTransport = prefilterOrFactory( options, originalOptions, jqXHR );
+			if ( typeof dataTypeOrTransport === "string" &&
+				!seekingTransport && !inspected[ dataTypeOrTransport ] ) {
+
+				options.dataTypes.unshift( dataTypeOrTransport );
+				inspect( dataTypeOrTransport );
+				return false;
+			} else if ( seekingTransport ) {
+				return !( selected = dataTypeOrTransport );
+			}
+		} );
+		return selected;
+	}
+
+	return inspect( options.dataTypes[ 0 ] ) || !inspected[ "*" ] && inspect( "*" );
+}
+
+// A special extend for ajax options
+// that takes "flat" options (not to be deep extended)
+// Fixes #9887
+function ajaxExtend( target, src ) {
+	var key, deep,
+		flatOptions = jQuery.ajaxSettings.flatOptions || {};
+
+	for ( key in src ) {
+		if ( src[ key ] !== undefined ) {
+			( flatOptions[ key ] ? target : ( deep || ( deep = {} ) ) )[ key ] = src[ key ];
+		}
+	}
+	if ( deep ) {
+		jQuery.extend( true, target, deep );
+	}
+
+	return target;
+}
+
+/* Handles responses to an ajax request:
+ * - finds the right dataType (mediates between content-type and expected dataType)
+ * - returns the corresponding response
+ */
+function ajaxHandleResponses( s, jqXHR, responses ) {
+
+	var ct, type, finalDataType, firstDataType,
+		contents = s.contents,
+		dataTypes = s.dataTypes;
+
+	// Remove auto dataType and get content-type in the process
+	while ( dataTypes[ 0 ] === "*" ) {
+		dataTypes.shift();
+		if ( ct === undefined ) {
+			ct = s.mimeType || jqXHR.getResponseHeader( "Content-Type" );
+		}
+	}
+
+	// Check if we're dealing with a known content-type
+	if ( ct ) {
+		for ( type in contents ) {
+			if ( contents[ type ] && contents[ type ].test( ct ) ) {
+				dataTypes.unshift( type );
+				break;
+			}
+		}
+	}
+
+	// Check to see if we have a response for the expected dataType
+	if ( dataTypes[ 0 ] in responses ) {
+		finalDataType = dataTypes[ 0 ];
+	} else {
+
+		// Try convertible dataTypes
+		for ( type in responses ) {
+			if ( !dataTypes[ 0 ] || s.converters[ type + " " + dataTypes[ 0 ] ] ) {
+				finalDataType = type;
+				break;
+			}
+			if ( !firstDataType ) {
+				firstDataType = type;
+			}
+		}
+
+		// Or just use first one
+		finalDataType = finalDataType || firstDataType;
+	}
+
+	// If we found a dataType
+	// We add the dataType to the list if needed
+	// and return the corresponding response
+	if ( finalDataType ) {
+		if ( finalDataType !== dataTypes[ 0 ] ) {
+			dataTypes.unshift( finalDataType );
+		}
+		return responses[ finalDataType ];
+	}
+}
+
+/* Chain conversions given the request and the original response
+ * Also sets the responseXXX fields on the jqXHR instance
+ */
+function ajaxConvert( s, response, jqXHR, isSuccess ) {
+	var conv2, current, conv, tmp, prev,
+		converters = {},
+
+		// Work with a copy of dataTypes in case we need to modify it for conversion
+		dataTypes = s.dataTypes.slice();
+
+	// Create converters map with lowercased keys
+	if ( dataTypes[ 1 ] ) {
+		for ( conv in s.converters ) {
+			converters[ conv.toLowerCase() ] = s.converters[ conv ];
+		}
+	}
+
+	current = dataTypes.shift();
+
+	// Convert to each sequential dataType
+	while ( current ) {
+
+		if ( s.responseFields[ current ] ) {
+			jqXHR[ s.responseFields[ current ] ] = response;
+		}
+
+		// Apply the dataFilter if provided
+		if ( !prev && isSuccess && s.dataFilter ) {
+			response = s.dataFilter( response, s.dataType );
+		}
+
+		prev = current;
+		current = dataTypes.shift();
+
+		if ( current ) {
+
+			// There's only work to do if current dataType is non-auto
+			if ( current === "*" ) {
+
+				current = prev;
+
+			// Convert response if prev dataType is non-auto and differs from current
+			} else if ( prev !== "*" && prev !== current ) {
+
+				// Seek a direct converter
+				conv = converters[ prev + " " + current ] || converters[ "* " + current ];
+
+				// If none found, seek a pair
+				if ( !conv ) {
+					for ( conv2 in converters ) {
+
+						// If conv2 outputs current
+						tmp = conv2.split( " " );
+						if ( tmp[ 1 ] === current ) {
+
+							// If prev can be converted to accepted input
+							conv = converters[ prev + " " + tmp[ 0 ] ] ||
+								converters[ "* " + tmp[ 0 ] ];
+							if ( conv ) {
+
+								// Condense equivalence converters
+								if ( conv === true ) {
+									conv = converters[ conv2 ];
+
+								// Otherwise, insert the intermediate dataType
+								} else if ( converters[ conv2 ] !== true ) {
+									current = tmp[ 0 ];
+									dataTypes.unshift( tmp[ 1 ] );
+								}
+								break;
+							}
+						}
+					}
+				}
+
+				// Apply converter (if not an equivalence)
+				if ( conv !== true ) {
+
+					// Unless errors are allowed to bubble, catch and return them
+					if ( conv && s.throws ) {
+						response = conv( response );
+					} else {
+						try {
+							response = conv( response );
+						} catch ( e ) {
+							return {
+								state: "parsererror",
+								error: conv ? e : "No conversion from " + prev + " to " + current
+							};
+						}
+					}
+				}
+			}
+		}
+	}
+
+	return { state: "success", data: response };
+}
+
+jQuery.extend( {
+
+	// Counter for holding the number of active queries
+	active: 0,
+
+	// Last-Modified header cache for next request
+	lastModified: {},
+	etag: {},
+
+	ajaxSettings: {
+		url: location.href,
+		type: "GET",
+		isLocal: rlocalProtocol.test( location.protocol ),
+		global: true,
+		processData: true,
+		async: true,
+		contentType: "application/x-www-form-urlencoded; charset=UTF-8",
+
+		/*
+		timeout: 0,
+		data: null,
+		dataType: null,
+		username: null,
+		password: null,
+		cache: null,
+		throws: false,
+		traditional: false,
+		headers: {},
+		*/
+
+		accepts: {
+			"*": allTypes,
+			text: "text/plain",
+			html: "text/html",
+			xml: "application/xml, text/xml",
+			json: "application/json, text/javascript"
+		},
+
+		contents: {
+			xml: /\bxml\b/,
+			html: /\bhtml/,
+			json: /\bjson\b/
+		},
+
+		responseFields: {
+			xml: "responseXML",
+			text: "responseText",
+			json: "responseJSON"
+		},
+
+		// Data converters
+		// Keys separate source (or catchall "*") and destination types with a single space
+		converters: {
+
+			// Convert anything to text
+			"* text": String,
+
+			// Text to html (true = no transformation)
+			"text html": true,
+
+			// Evaluate text as a json expression
+			"text json": JSON.parse,
+
+			// Parse text as xml
+			"text xml": jQuery.parseXML
+		},
+
+		// For options that shouldn't be deep extended:
+		// you can add your own custom options here if
+		// and when you create one that shouldn't be
+		// deep extended (see ajaxExtend)
+		flatOptions: {
+			url: true,
+			context: true
+		}
+	},
+
+	// Creates a full fledged settings object into target
+	// with both ajaxSettings and settings fields.
+	// If target is omitted, writes into ajaxSettings.
+	ajaxSetup: function( target, settings ) {
+		return settings ?
+
+			// Building a settings object
+			ajaxExtend( ajaxExtend( target, jQuery.ajaxSettings ), settings ) :
+
+			// Extending ajaxSettings
+			ajaxExtend( jQuery.ajaxSettings, target );
+	},
+
+	ajaxPrefilter: addToPrefiltersOrTransports( prefilters ),
+	ajaxTransport: addToPrefiltersOrTransports( transports ),
+
+	// Main method
+	ajax: function( url, options ) {
+
+		// If url is an object, simulate pre-1.5 signature
+		if ( typeof url === "object" ) {
+			options = url;
+			url = undefined;
+		}
+
+		// Force options to be an object
+		options = options || {};
+
+		var transport,
+
+			// URL without anti-cache param
+			cacheURL,
+
+			// Response headers
+			responseHeadersString,
+			responseHeaders,
+
+			// timeout handle
+			timeoutTimer,
+
+			// Url cleanup var
+			urlAnchor,
+
+			// Request state (becomes false upon send and true upon completion)
+			completed,
+
+			// To know if global events are to be dispatched
+			fireGlobals,
+
+			// Loop variable
+			i,
+
+			// uncached part of the url
+			uncached,
+
+			// Create the final options object
+			s = jQuery.ajaxSetup( {}, options ),
+
+			// Callbacks context
+			callbackContext = s.context || s,
+
+			// Context for global events is callbackContext if it is a DOM node or jQuery collection
+			globalEventContext = s.context &&
+				( callbackContext.nodeType || callbackContext.jquery ) ?
+				jQuery( callbackContext ) :
+				jQuery.event,
+
+			// Deferreds
+			deferred = jQuery.Deferred(),
+			completeDeferred = jQuery.Callbacks( "once memory" ),
+
+			// Status-dependent callbacks
+			statusCode = s.statusCode || {},
+
+			// Headers (they are sent all at once)
+			requestHeaders = {},
+			requestHeadersNames = {},
+
+			// Default abort message
+			strAbort = "canceled",
+
+			// Fake xhr
+			jqXHR = {
+				readyState: 0,
+
+				// Builds headers hashtable if needed
+				getResponseHeader: function( key ) {
+					var match;
+					if ( completed ) {
+						if ( !responseHeaders ) {
+							responseHeaders = {};
+							while ( ( match = rheaders.exec( responseHeadersString ) ) ) {
+								responseHeaders[ match[ 1 ].toLowerCase() + " " ] =
+									( responseHeaders[ match[ 1 ].toLowerCase() + " " ] || [] )
+										.concat( match[ 2 ] );
+							}
+						}
+						match = responseHeaders[ key.toLowerCase() + " " ];
+					}
+					return match == null ? null : match.join( ", " );
+				},
+
+				// Raw string
+				getAllResponseHeaders: function() {
+					return completed ? responseHeadersString : null;
+				},
+
+				// Caches the header
+				setRequestHeader: function( name, value ) {
+					if ( completed == null ) {
+						name = requestHeadersNames[ name.toLowerCase() ] =
+							requestHeadersNames[ name.toLowerCase() ] || name;
+						requestHeaders[ name ] = value;
+					}
+					return this;
+				},
+
+				// Overrides response content-type header
+				overrideMimeType: function( type ) {
+					if ( completed == null ) {
+						s.mimeType = type;
+					}
+					return this;
+				},
+
+				// Status-dependent callbacks
+				statusCode: function( map ) {
+					var code;
+					if ( map ) {
+						if ( completed ) {
+
+							// Execute the appropriate callbacks
+							jqXHR.always( map[ jqXHR.status ] );
+						} else {
+
+							// Lazy-add the new callbacks in a way that preserves old ones
+							for ( code in map ) {
+								statusCode[ code ] = [ statusCode[ code ], map[ code ] ];
+							}
+						}
+					}
+					return this;
+				},
+
+				// Cancel the request
+				abort: function( statusText ) {
+					var finalText = statusText || strAbort;
+					if ( transport ) {
+						transport.abort( finalText );
+					}
+					done( 0, finalText );
+					return this;
+				}
+			};
+
+		// Attach deferreds
+		deferred.promise( jqXHR );
+
+		// Add protocol if not provided (prefilters might expect it)
+		// Handle falsy url in the settings object (#10093: consistency with old signature)
+		// We also use the url parameter if available
+		s.url = ( ( url || s.url || location.href ) + "" )
+			.replace( rprotocol, location.protocol + "//" );
+
+		// Alias method option to type as per ticket #12004
+		s.type = options.method || options.type || s.method || s.type;
+
+		// Extract dataTypes list
+		s.dataTypes = ( s.dataType || "*" ).toLowerCase().match( rnothtmlwhite ) || [ "" ];
+
+		// A cross-domain request is in order when the origin doesn't match the current origin.
+		if ( s.crossDomain == null ) {
+			urlAnchor = document.createElement( "a" );
+
+			// Support: IE <=8 - 11, Edge 12 - 15
+			// IE throws exception on accessing the href property if url is malformed,
+			// e.g. http://example.com:80x/
+			try {
+				urlAnchor.href = s.url;
+
+				// Support: IE <=8 - 11 only
+				// Anchor's host property isn't correctly set when s.url is relative
+				urlAnchor.href = urlAnchor.href;
+				s.crossDomain = originAnchor.protocol + "//" + originAnchor.host !==
+					urlAnchor.protocol + "//" + urlAnchor.host;
+			} catch ( e ) {
+
+				// If there is an error parsing the URL, assume it is crossDomain,
+				// it can be rejected by the transport if it is invalid
+				s.crossDomain = true;
+			}
+		}
+
+		// Convert data if not already a string
+		if ( s.data && s.processData && typeof s.data !== "string" ) {
+			s.data = jQuery.param( s.data, s.traditional );
+		}
+
+		// Apply prefilters
+		inspectPrefiltersOrTransports( prefilters, s, options, jqXHR );
+
+		// If request was aborted inside a prefilter, stop there
+		if ( completed ) {
+			return jqXHR;
+		}
+
+		// We can fire global events as of now if asked to
+		// Don't fire events if jQuery.event is undefined in an AMD-usage scenario (#15118)
+		fireGlobals = jQuery.event && s.global;
+
+		// Watch for a new set of requests
+		if ( fireGlobals && jQuery.active++ === 0 ) {
+			jQuery.event.trigger( "ajaxStart" );
+		}
+
+		// Uppercase the type
+		s.type = s.type.toUpperCase();
+
+		// Determine if request has content
+		s.hasContent = !rnoContent.test( s.type );
+
+		// Save the URL in case we're toying with the If-Modified-Since
+		// and/or If-None-Match header later on
+		// Remove hash to simplify url manipulation
+		cacheURL = s.url.replace( rhash, "" );
+
+		// More options handling for requests with no content
+		if ( !s.hasContent ) {
+
+			// Remember the hash so we can put it back
+			uncached = s.url.slice( cacheURL.length );
+
+			// If data is available and should be processed, append data to url
+			if ( s.data && ( s.processData || typeof s.data === "string" ) ) {
+				cacheURL += ( rquery.test( cacheURL ) ? "&" : "?" ) + s.data;
+
+				// #9682: remove data so that it's not used in an eventual retry
+				delete s.data;
+			}
+
+			// Add or update anti-cache param if needed
+			if ( s.cache === false ) {
+				cacheURL = cacheURL.replace( rantiCache, "$1" );
+				uncached = ( rquery.test( cacheURL ) ? "&" : "?" ) + "_=" + ( nonce.guid++ ) +
+					uncached;
+			}
+
+			// Put hash and anti-cache on the URL that will be requested (gh-1732)
+			s.url = cacheURL + uncached;
+
+		// Change '%20' to '+' if this is encoded form body content (gh-2658)
+		} else if ( s.data && s.processData &&
+			( s.contentType || "" ).indexOf( "application/x-www-form-urlencoded" ) === 0 ) {
+			s.data = s.data.replace( r20, "+" );
+		}
+
+		// Set the If-Modified-Since and/or If-None-Match header, if in ifModified mode.
+		if ( s.ifModified ) {
+			if ( jQuery.lastModified[ cacheURL ] ) {
+				jqXHR.setRequestHeader( "If-Modified-Since", jQuery.lastModified[ cacheURL ] );
+			}
+			if ( jQuery.etag[ cacheURL ] ) {
+				jqXHR.setRequestHeader( "If-None-Match", jQuery.etag[ cacheURL ] );
+			}
+		}
+
+		// Set the correct header, if data is being sent
+		if ( s.data && s.hasContent && s.contentType !== false || options.contentType ) {
+			jqXHR.setRequestHeader( "Content-Type", s.contentType );
+		}
+
+		// Set the Accepts header for the server, depending on the dataType
+		jqXHR.setRequestHeader(
+			"Accept",
+			s.dataTypes[ 0 ] && s.accepts[ s.dataTypes[ 0 ] ] ?
+				s.accepts[ s.dataTypes[ 0 ] ] +
+					( s.dataTypes[ 0 ] !== "*" ? ", " + allTypes + "; q=0.01" : "" ) :
+				s.accepts[ "*" ]
+		);
+
+		// Check for headers option
+		for ( i in s.headers ) {
+			jqXHR.setRequestHeader( i, s.headers[ i ] );
+		}
+
+		// Allow custom headers/mimetypes and early abort
+		if ( s.beforeSend &&
+			( s.beforeSend.call( callbackContext, jqXHR, s ) === false || completed ) ) {
+
+			// Abort if not done already and return
+			return jqXHR.abort();
+		}
+
+		// Aborting is no longer a cancellation
+		strAbort = "abort";
+
+		// Install callbacks on deferreds
+		completeDeferred.add( s.complete );
+		jqXHR.done( s.success );
+		jqXHR.fail( s.error );
+
+		// Get transport
+		transport = inspectPrefiltersOrTransports( transports, s, options, jqXHR );
+
+		// If no transport, we auto-abort
+		if ( !transport ) {
+			done( -1, "No Transport" );
+		} else {
+			jqXHR.readyState = 1;
+
+			// Send global event
+			if ( fireGlobals ) {
+				globalEventContext.trigger( "ajaxSend", [ jqXHR, s ] );
+			}
+
+			// If request was aborted inside ajaxSend, stop there
+			if ( completed ) {
+				return jqXHR;
+			}
+
+			// Timeout
+			if ( s.async && s.timeout > 0 ) {
+				timeoutTimer = window.setTimeout( function() {
+					jqXHR.abort( "timeout" );
+				}, s.timeout );
+			}
+
+			try {
+				completed = false;
+				transport.send( requestHeaders, done );
+			} catch ( e ) {
+
+				// Rethrow post-completion exceptions
+				if ( completed ) {
+					throw e;
+				}
+
+				// Propagate others as results
+				done( -1, e );
+			}
+		}
+
+		// Callback for when everything is done
+		function done( status, nativeStatusText, responses, headers ) {
+			var isSuccess, success, error, response, modified,
+				statusText = nativeStatusText;
+
+			// Ignore repeat invocations
+			if ( completed ) {
+				return;
+			}
+
+			completed = true;
+
+			// Clear timeout if it exists
+			if ( timeoutTimer ) {
+				window.clearTimeout( timeoutTimer );
+			}
+
+			// Dereference transport for early garbage collection
+			// (no matter how long the jqXHR object will be used)
+			transport = undefined;
+
+			// Cache response headers
+			responseHeadersString = headers || "";
+
+			// Set readyState
+			jqXHR.readyState = status > 0 ? 4 : 0;
+
+			// Determine if successful
+			isSuccess = status >= 200 && status < 300 || status === 304;
+
+			// Get response data
+			if ( responses ) {
+				response = ajaxHandleResponses( s, jqXHR, responses );
+			}
+
+			// Use a noop converter for missing script but not if jsonp
+			if ( !isSuccess &&
+				jQuery.inArray( "script", s.dataTypes ) > -1 &&
+				jQuery.inArray( "json", s.dataTypes ) < 0 ) {
+				s.converters[ "text script" ] = function() {};
+			}
+
+			// Convert no matter what (that way responseXXX fields are always set)
+			response = ajaxConvert( s, response, jqXHR, isSuccess );
+
+			// If successful, handle type chaining
+			if ( isSuccess ) {
+
+				// Set the If-Modified-Since and/or If-None-Match header, if in ifModified mode.
+				if ( s.ifModified ) {
+					modified = jqXHR.getResponseHeader( "Last-Modified" );
+					if ( modified ) {
+						jQuery.lastModified[ cacheURL ] = modified;
+					}
+					modified = jqXHR.getResponseHeader( "etag" );
+					if ( modified ) {
+						jQuery.etag[ cacheURL ] = modified;
+					}
+				}
+
+				// if no content
+				if ( status === 204 || s.type === "HEAD" ) {
+					statusText = "nocontent";
+
+				// if not modified
+				} else if ( status === 304 ) {
+					statusText = "notmodified";
+
+				// If we have data, let's convert it
+				} else {
+					statusText = response.state;
+					success = response.data;
+					error = response.error;
+					isSuccess = !error;
+				}
+			} else {
+
+				// Extract error from statusText and normalize for non-aborts
+				error = statusText;
+				if ( status || !statusText ) {
+					statusText = "error";
+					if ( status < 0 ) {
+						status = 0;
+					}
+				}
+			}
+
+			// Set data for the fake xhr object
+			jqXHR.status = status;
+			jqXHR.statusText = ( nativeStatusText || statusText ) + "";
+
+			// Success/Error
+			if ( isSuccess ) {
+				deferred.resolveWith( callbackContext, [ success, statusText, jqXHR ] );
+			} else {
+				deferred.rejectWith( callbackContext, [ jqXHR, statusText, error ] );
+			}
+
+			// Status-dependent callbacks
+			jqXHR.statusCode( statusCode );
+			statusCode = undefined;
+
+			if ( fireGlobals ) {
+				globalEventContext.trigger( isSuccess ? "ajaxSuccess" : "ajaxError",
+					[ jqXHR, s, isSuccess ? success : error ] );
+			}
+
+			// Complete
+			completeDeferred.fireWith( callbackContext, [ jqXHR, statusText ] );
+
+			if ( fireGlobals ) {
+				globalEventContext.trigger( "ajaxComplete", [ jqXHR, s ] );
+
+				// Handle the global AJAX counter
+				if ( !( --jQuery.active ) ) {
+					jQuery.event.trigger( "ajaxStop" );
+				}
+			}
+		}
+
+		return jqXHR;
+	},
+
+	getJSON: function( url, data, callback ) {
+		return jQuery.get( url, data, callback, "json" );
+	},
+
+	getScript: function( url, callback ) {
+		return jQuery.get( url, undefined, callback, "script" );
+	}
+} );
+
+jQuery.each( [ "get", "post" ], function( _i, method ) {
+	jQuery[ method ] = function( url, data, callback, type ) {
+
+		// Shift arguments if data argument was omitted
+		if ( isFunction( data ) ) {
+			type = type || callback;
+			callback = data;
+			data = undefined;
+		}
+
+		// The url can be an options object (which then must have .url)
+		return jQuery.ajax( jQuery.extend( {
+			url: url,
+			type: method,
+			dataType: type,
+			data: data,
+			success: callback
+		}, jQuery.isPlainObject( url ) && url ) );
+	};
+} );
+
+jQuery.ajaxPrefilter( function( s ) {
+	var i;
+	for ( i in s.headers ) {
+		if ( i.toLowerCase() === "content-type" ) {
+			s.contentType = s.headers[ i ] || "";
+		}
+	}
+} );
+
+
+jQuery._evalUrl = function( url, options, doc ) {
+	return jQuery.ajax( {
+		url: url,
+
+		// Make this explicit, since user can override this through ajaxSetup (#11264)
+		type: "GET",
+		dataType: "script",
+		cache: true,
+		async: false,
+		global: false,
+
+		// Only evaluate the response if it is successful (gh-4126)
+		// dataFilter is not invoked for failure responses, so using it instead
+		// of the default converter is kludgy but it works.
+		converters: {
+			"text script": function() {}
+		},
+		dataFilter: function( response ) {
+			jQuery.globalEval( response, options, doc );
+		}
+	} );
+};
+
+
+jQuery.fn.extend( {
+	wrapAll: function( html ) {
+		var wrap;
+
+		if ( this[ 0 ] ) {
+			if ( isFunction( html ) ) {
+				html = html.call( this[ 0 ] );
+			}
+
+			// The elements to wrap the target around
+			wrap = jQuery( html, this[ 0 ].ownerDocument ).eq( 0 ).clone( true );
+
+			if ( this[ 0 ].parentNode ) {
+				wrap.insertBefore( this[ 0 ] );
+			}
+
+			wrap.map( function() {
+				var elem = this;
+
+				while ( elem.firstElementChild ) {
+					elem = elem.firstElementChild;
+				}
+
+				return elem;
+			} ).append( this );
+		}
+
+		return this;
+	},
+
+	wrapInner: function( html ) {
+		if ( isFunction( html ) ) {
+			return this.each( function( i ) {
+				jQuery( this ).wrapInner( html.call( this, i ) );
+			} );
+		}
+
+		return this.each( function() {
+			var self = jQuery( this ),
+				contents = self.contents();
+
+			if ( contents.length ) {
+				contents.wrapAll( html );
+
+			} else {
+				self.append( html );
+			}
+		} );
+	},
+
+	wrap: function( html ) {
+		var htmlIsFunction = isFunction( html );
+
+		return this.each( function( i ) {
+			jQuery( this ).wrapAll( htmlIsFunction ? html.call( this, i ) : html );
+		} );
+	},
+
+	unwrap: function( selector ) {
+		this.parent( selector ).not( "body" ).each( function() {
+			jQuery( this ).replaceWith( this.childNodes );
+		} );
+		return this;
+	}
+} );
+
+
+jQuery.expr.pseudos.hidden = function( elem ) {
+	return !jQuery.expr.pseudos.visible( elem );
+};
+jQuery.expr.pseudos.visible = function( elem ) {
+	return !!( elem.offsetWidth || elem.offsetHeight || elem.getClientRects().length );
+};
+
+
+
+
+jQuery.ajaxSettings.xhr = function() {
+	try {
+		return new window.XMLHttpRequest();
+	} catch ( e ) {}
+};
+
+var xhrSuccessStatus = {
+
+		// File protocol always yields status code 0, assume 200
+		0: 200,
+
+		// Support: IE <=9 only
+		// #1450: sometimes IE returns 1223 when it should be 204
+		1223: 204
+	},
+	xhrSupported = jQuery.ajaxSettings.xhr();
+
+support.cors = !!xhrSupported && ( "withCredentials" in xhrSupported );
+support.ajax = xhrSupported = !!xhrSupported;
+
+jQuery.ajaxTransport( function( options ) {
+	var callback, errorCallback;
+
+	// Cross domain only allowed if supported through XMLHttpRequest
+	if ( support.cors || xhrSupported && !options.crossDomain ) {
+		return {
+			send: function( headers, complete ) {
+				var i,
+					xhr = options.xhr();
+
+				xhr.open(
+					options.type,
+					options.url,
+					options.async,
+					options.username,
+					options.password
+				);
+
+				// Apply custom fields if provided
+				if ( options.xhrFields ) {
+					for ( i in options.xhrFields ) {
+						xhr[ i ] = options.xhrFields[ i ];
+					}
+				}
+
+				// Override mime type if needed
+				if ( options.mimeType && xhr.overrideMimeType ) {
+					xhr.overrideMimeType( options.mimeType );
+				}
+
+				// X-Requested-With header
+				// For cross-domain requests, seeing as conditions for a preflight are
+				// akin to a jigsaw puzzle, we simply never set it to be sure.
+				// (it can always be set on a per-request basis or even using ajaxSetup)
+				// For same-domain requests, won't change header if already provided.
+				if ( !options.crossDomain && !headers[ "X-Requested-With" ] ) {
+					headers[ "X-Requested-With" ] = "XMLHttpRequest";
+				}
+
+				// Set headers
+				for ( i in headers ) {
+					xhr.setRequestHeader( i, headers[ i ] );
+				}
+
+				// Callback
+				callback = function( type ) {
+					return function() {
+						if ( callback ) {
+							callback = errorCallback = xhr.onload =
+								xhr.onerror = xhr.onabort = xhr.ontimeout =
+									xhr.onreadystatechange = null;
+
+							if ( type === "abort" ) {
+								xhr.abort();
+							} else if ( type === "error" ) {
+
+								// Support: IE <=9 only
+								// On a manual native abort, IE9 throws
+								// errors on any property access that is not readyState
+								if ( typeof xhr.status !== "number" ) {
+									complete( 0, "error" );
+								} else {
+									complete(
+
+										// File: protocol always yields status 0; see #8605, #14207
+										xhr.status,
+										xhr.statusText
+									);
+								}
+							} else {
+								complete(
+									xhrSuccessStatus[ xhr.status ] || xhr.status,
+									xhr.statusText,
+
+									// Support: IE <=9 only
+									// IE9 has no XHR2 but throws on binary (trac-11426)
+									// For XHR2 non-text, let the caller handle it (gh-2498)
+									( xhr.responseType || "text" ) !== "text"  ||
+									typeof xhr.responseText !== "string" ?
+										{ binary: xhr.response } :
+										{ text: xhr.responseText },
+									xhr.getAllResponseHeaders()
+								);
+							}
+						}
+					};
+				};
+
+				// Listen to events
+				xhr.onload = callback();
+				errorCallback = xhr.onerror = xhr.ontimeout = callback( "error" );
+
+				// Support: IE 9 only
+				// Use onreadystatechange to replace onabort
+				// to handle uncaught aborts
+				if ( xhr.onabort !== undefined ) {
+					xhr.onabort = errorCallback;
+				} else {
+					xhr.onreadystatechange = function() {
+
+						// Check readyState before timeout as it changes
+						if ( xhr.readyState === 4 ) {
+
+							// Allow onerror to be called first,
+							// but that will not handle a native abort
+							// Also, save errorCallback to a variable
+							// as xhr.onerror cannot be accessed
+							window.setTimeout( function() {
+								if ( callback ) {
+									errorCallback();
+								}
+							} );
+						}
+					};
+				}
+
+				// Create the abort callback
+				callback = callback( "abort" );
+
+				try {
+
+					// Do send the request (this may raise an exception)
+					xhr.send( options.hasContent && options.data || null );
+				} catch ( e ) {
+
+					// #14683: Only rethrow if this hasn't been notified as an error yet
+					if ( callback ) {
+						throw e;
+					}
+				}
+			},
+
+			abort: function() {
+				if ( callback ) {
+					callback();
+				}
+			}
+		};
+	}
+} );
+
+
+
+
+// Prevent auto-execution of scripts when no explicit dataType was provided (See gh-2432)
+jQuery.ajaxPrefilter( function( s ) {
+	if ( s.crossDomain ) {
+		s.contents.script = false;
+	}
+} );
+
+// Install script dataType
+jQuery.ajaxSetup( {
+	accepts: {
+		script: "text/javascript, application/javascript, " +
+			"application/ecmascript, application/x-ecmascript"
+	},
+	contents: {
+		script: /\b(?:java|ecma)script\b/
+	},
+	converters: {
+		"text script": function( text ) {
+			jQuery.globalEval( text );
+			return text;
+		}
+	}
+} );
+
+// Handle cache's special case and crossDomain
+jQuery.ajaxPrefilter( "script", function( s ) {
+	if ( s.cache === undefined ) {
+		s.cache = false;
+	}
+	if ( s.crossDomain ) {
+		s.type = "GET";
+	}
+} );
+
+// Bind script tag hack transport
+jQuery.ajaxTransport( "script", function( s ) {
+
+	// This transport only deals with cross domain or forced-by-attrs requests
+	if ( s.crossDomain || s.scriptAttrs ) {
+		var script, callback;
+		return {
+			send: function( _, complete ) {
+				script = jQuery( "<script>" )
+					.attr( s.scriptAttrs || {} )
+					.prop( { charset: s.scriptCharset, src: s.url } )
+					.on( "load error", callback = function( evt ) {
+						script.remove();
+						callback = null;
+						if ( evt ) {
+							complete( evt.type === "error" ? 404 : 200, evt.type );
+						}
+					} );
+
+				// Use native DOM manipulation to avoid our domManip AJAX trickery
+				document.head.appendChild( script[ 0 ] );
+			},
+			abort: function() {
+				if ( callback ) {
+					callback();
+				}
+			}
+		};
+	}
+} );
+
+
+
+
+var oldCallbacks = [],
+	rjsonp = /(=)\?(?=&|$)|\?\?/;
+
+// Default jsonp settings
+jQuery.ajaxSetup( {
+	jsonp: "callback",
+	jsonpCallback: function() {
+		var callback = oldCallbacks.pop() || ( jQuery.expando + "_" + ( nonce.guid++ ) );
+		this[ callback ] = true;
+		return callback;
+	}
+} );
+
+// Detect, normalize options and install callbacks for jsonp requests
+jQuery.ajaxPrefilter( "json jsonp", function( s, originalSettings, jqXHR ) {
+
+	var callbackName, overwritten, responseContainer,
+		jsonProp = s.jsonp !== false && ( rjsonp.test( s.url ) ?
+			"url" :
+			typeof s.data === "string" &&
+				( s.contentType || "" )
+					.indexOf( "application/x-www-form-urlencoded" ) === 0 &&
+				rjsonp.test( s.data ) && "data"
+		);
+
+	// Handle iff the expected data type is "jsonp" or we have a parameter to set
+	if ( jsonProp || s.dataTypes[ 0 ] === "jsonp" ) {
+
+		// Get callback name, remembering preexisting value associated with it
+		callbackName = s.jsonpCallback = isFunction( s.jsonpCallback ) ?
+			s.jsonpCallback() :
+			s.jsonpCallback;
+
+		// Insert callback into url or form data
+		if ( jsonProp ) {
+			s[ jsonProp ] = s[ jsonProp ].replace( rjsonp, "$1" + callbackName );
+		} else if ( s.jsonp !== false ) {
+			s.url += ( rquery.test( s.url ) ? "&" : "?" ) + s.jsonp + "=" + callbackName;
+		}
+
+		// Use data converter to retrieve json after script execution
+		s.converters[ "script json" ] = function() {
+			if ( !responseContainer ) {
+				jQuery.error( callbackName + " was not called" );
+			}
+			return responseContainer[ 0 ];
+		};
+
+		// Force json dataType
+		s.dataTypes[ 0 ] = "json";
+
+		// Install callback
+		overwritten = window[ callbackName ];
+		window[ callbackName ] = function() {
+			responseContainer = arguments;
+		};
+
+		// Clean-up function (fires after converters)
+		jqXHR.always( function() {
+
+			// If previous value didn't exist - remove it
+			if ( overwritten === undefined ) {
+				jQuery( window ).removeProp( callbackName );
+
+			// Otherwise restore preexisting value
+			} else {
+				window[ callbackName ] = overwritten;
+			}
+
+			// Save back as free
+			if ( s[ callbackName ] ) {
+
+				// Make sure that re-using the options doesn't screw things around
+				s.jsonpCallback = originalSettings.jsonpCallback;
+
+				// Save the callback name for future use
+				oldCallbacks.push( callbackName );
+			}
+
+			// Call if it was a function and we have a response
+			if ( responseContainer && isFunction( overwritten ) ) {
+				overwritten( responseContainer[ 0 ] );
+			}
+
+			responseContainer = overwritten = undefined;
+		} );
+
+		// Delegate to script
+		return "script";
+	}
+} );
+
+
+
+
+// Support: Safari 8 only
+// In Safari 8 documents created via document.implementation.createHTMLDocument
+// collapse sibling forms: the second one becomes a child of the first one.
+// Because of that, this security measure has to be disabled in Safari 8.
+// https://bugs.webkit.org/show_bug.cgi?id=137337
+support.createHTMLDocument = ( function() {
+	var body = document.implementation.createHTMLDocument( "" ).body;
+	body.innerHTML = "<form></form><form></form>";
+	return body.childNodes.length === 2;
+} )();
+
+
+// Argument "data" should be string of html
+// context (optional): If specified, the fragment will be created in this context,
+// defaults to document
+// keepScripts (optional): If true, will include scripts passed in the html string
+jQuery.parseHTML = function( data, context, keepScripts ) {
+	if ( typeof data !== "string" ) {
+		return [];
+	}
+	if ( typeof context === "boolean" ) {
+		keepScripts = context;
+		context = false;
+	}
+
+	var base, parsed, scripts;
+
+	if ( !context ) {
+
+		// Stop scripts or inline event handlers from being executed immediately
+		// by using document.implementation
+		if ( support.createHTMLDocument ) {
+			context = document.implementation.createHTMLDocument( "" );
+
+			// Set the base href for the created document
+			// so any parsed elements with URLs
+			// are based on the document's URL (gh-2965)
+			base = context.createElement( "base" );
+			base.href = document.location.href;
+			context.head.appendChild( base );
+		} else {
+			context = document;
+		}
+	}
+
+	parsed = rsingleTag.exec( data );
+	scripts = !keepScripts && [];
+
+	// Single tag
+	if ( parsed ) {
+		return [ context.createElement( parsed[ 1 ] ) ];
+	}
+
+	parsed = buildFragment( [ data ], context, scripts );
+
+	if ( scripts && scripts.length ) {
+		jQuery( scripts ).remove();
+	}
+
+	return jQuery.merge( [], parsed.childNodes );
+};
+
+
+/**
+ * Load a url into a page
+ */
+jQuery.fn.load = function( url, params, callback ) {
+	var selector, type, response,
+		self = this,
+		off = url.indexOf( " " );
+
+	if ( off > -1 ) {
+		selector = stripAndCollapse( url.slice( off ) );
+		url = url.slice( 0, off );
+	}
+
+	// If it's a function
+	if ( isFunction( params ) ) {
+
+		// We assume that it's the callback
+		callback = params;
+		params = undefined;
+
+	// Otherwise, build a param string
+	} else if ( params && typeof params === "object" ) {
+		type = "POST";
+	}
+
+	// If we have elements to modify, make the request
+	if ( self.length > 0 ) {
+		jQuery.ajax( {
+			url: url,
+
+			// If "type" variable is undefined, then "GET" method will be used.
+			// Make value of this field explicit since
+			// user can override it through ajaxSetup method
+			type: type || "GET",
+			dataType: "html",
+			data: params
+		} ).done( function( responseText ) {
+
+			// Save response for use in complete callback
+			response = arguments;
+
+			self.html( selector ?
+
+				// If a selector was specified, locate the right elements in a dummy div
+				// Exclude scripts to avoid IE 'Permission Denied' errors
+				jQuery( "<div>" ).append( jQuery.parseHTML( responseText ) ).find( selector ) :
+
+				// Otherwise use the full result
+				responseText );
+
+		// If the request succeeds, this function gets "data", "status", "jqXHR"
+		// but they are ignored because response was set above.
+		// If it fails, this function gets "jqXHR", "status", "error"
+		} ).always( callback && function( jqXHR, status ) {
+			self.each( function() {
+				callback.apply( this, response || [ jqXHR.responseText, status, jqXHR ] );
+			} );
+		} );
+	}
+
+	return this;
+};
+
+
+
+
+jQuery.expr.pseudos.animated = function( elem ) {
+	return jQuery.grep( jQuery.timers, function( fn ) {
+		return elem === fn.elem;
+	} ).length;
+};
+
+
+
+
+jQuery.offset = {
+	setOffset: function( elem, options, i ) {
+		var curPosition, curLeft, curCSSTop, curTop, curOffset, curCSSLeft, calculatePosition,
+			position = jQuery.css( elem, "position" ),
+			curElem = jQuery( elem ),
+			props = {};
+
+		// Set position first, in-case top/left are set even on static elem
+		if ( position === "static" ) {
+			elem.style.position = "relative";
+		}
+
+		curOffset = curElem.offset();
+		curCSSTop = jQuery.css( elem, "top" );
+		curCSSLeft = jQuery.css( elem, "left" );
+		calculatePosition = ( position === "absolute" || position === "fixed" ) &&
+			( curCSSTop + curCSSLeft ).indexOf( "auto" ) > -1;
+
+		// Need to be able to calculate position if either
+		// top or left is auto and position is either absolute or fixed
+		if ( calculatePosition ) {
+			curPosition = curElem.position();
+			curTop = curPosition.top;
+			curLeft = curPosition.left;
+
+		} else {
+			curTop = parseFloat( curCSSTop ) || 0;
+			curLeft = parseFloat( curCSSLeft ) || 0;
+		}
+
+		if ( isFunction( options ) ) {
+
+			// Use jQuery.extend here to allow modification of coordinates argument (gh-1848)
+			options = options.call( elem, i, jQuery.extend( {}, curOffset ) );
+		}
+
+		if ( options.top != null ) {
+			props.top = ( options.top - curOffset.top ) + curTop;
+		}
+		if ( options.left != null ) {
+			props.left = ( options.left - curOffset.left ) + curLeft;
+		}
+
+		if ( "using" in options ) {
+			options.using.call( elem, props );
+
+		} else {
+			curElem.css( props );
+		}
+	}
+};
+
+jQuery.fn.extend( {
+
+	// offset() relates an element's border box to the document origin
+	offset: function( options ) {
+
+		// Preserve chaining for setter
+		if ( arguments.length ) {
+			return options === undefined ?
+				this :
+				this.each( function( i ) {
+					jQuery.offset.setOffset( this, options, i );
+				} );
+		}
+
+		var rect, win,
+			elem = this[ 0 ];
+
+		if ( !elem ) {
+			return;
+		}
+
+		// Return zeros for disconnected and hidden (display: none) elements (gh-2310)
+		// Support: IE <=11 only
+		// Running getBoundingClientRect on a
+		// disconnected node in IE throws an error
+		if ( !elem.getClientRects().length ) {
+			return { top: 0, left: 0 };
+		}
+
+		// Get document-relative position by adding viewport scroll to viewport-relative gBCR
+		rect = elem.getBoundingClientRect();
+		win = elem.ownerDocument.defaultView;
+		return {
+			top: rect.top + win.pageYOffset,
+			left: rect.left + win.pageXOffset
+		};
+	},
+
+	// position() relates an element's margin box to its offset parent's padding box
+	// This corresponds to the behavior of CSS absolute positioning
+	position: function() {
+		if ( !this[ 0 ] ) {
+			return;
+		}
+
+		var offsetParent, offset, doc,
+			elem = this[ 0 ],
+			parentOffset = { top: 0, left: 0 };
+
+		// position:fixed elements are offset from the viewport, which itself always has zero offset
+		if ( jQuery.css( elem, "position" ) === "fixed" ) {
+
+			// Assume position:fixed implies availability of getBoundingClientRect
+			offset = elem.getBoundingClientRect();
+
+		} else {
+			offset = this.offset();
+
+			// Account for the *real* offset parent, which can be the document or its root element
+			// when a statically positioned element is identified
+			doc = elem.ownerDocument;
+			offsetParent = elem.offsetParent || doc.documentElement;
+			while ( offsetParent &&
+				( offsetParent === doc.body || offsetParent === doc.documentElement ) &&
+				jQuery.css( offsetParent, "position" ) === "static" ) {
+
+				offsetParent = offsetParent.parentNode;
+			}
+			if ( offsetParent && offsetParent !== elem && offsetParent.nodeType === 1 ) {
+
+				// Incorporate borders into its offset, since they are outside its content origin
+				parentOffset = jQuery( offsetParent ).offset();
+				parentOffset.top += jQuery.css( offsetParent, "borderTopWidth", true );
+				parentOffset.left += jQuery.css( offsetParent, "borderLeftWidth", true );
+			}
+		}
+
+		// Subtract parent offsets and element margins
+		return {
+			top: offset.top - parentOffset.top - jQuery.css( elem, "marginTop", true ),
+			left: offset.left - parentOffset.left - jQuery.css( elem, "marginLeft", true )
+		};
+	},
+
+	// This method will return documentElement in the following cases:
+	// 1) For the element inside the iframe without offsetParent, this method will return
+	//    documentElement of the parent window
+	// 2) For the hidden or detached element
+	// 3) For body or html element, i.e. in case of the html node - it will return itself
+	//
+	// but those exceptions were never presented as a real life use-cases
+	// and might be considered as more preferable results.
+	//
+	// This logic, however, is not guaranteed and can change at any point in the future
+	offsetParent: function() {
+		return this.map( function() {
+			var offsetParent = this.offsetParent;
+
+			while ( offsetParent && jQuery.css( offsetParent, "position" ) === "static" ) {
+				offsetParent = offsetParent.offsetParent;
+			}
+
+			return offsetParent || documentElement;
+		} );
+	}
+} );
+
+// Create scrollLeft and scrollTop methods
+jQuery.each( { scrollLeft: "pageXOffset", scrollTop: "pageYOffset" }, function( method, prop ) {
+	var top = "pageYOffset" === prop;
+
+	jQuery.fn[ method ] = function( val ) {
+		return access( this, function( elem, method, val ) {
+
+			// Coalesce documents and windows
+			var win;
+			if ( isWindow( elem ) ) {
+				win = elem;
+			} else if ( elem.nodeType === 9 ) {
+				win = elem.defaultView;
+			}
+
+			if ( val === undefined ) {
+				return win ? win[ prop ] : elem[ method ];
+			}
+
+			if ( win ) {
+				win.scrollTo(
+					!top ? val : win.pageXOffset,
+					top ? val : win.pageYOffset
+				);
+
+			} else {
+				elem[ method ] = val;
+			}
+		}, method, val, arguments.length );
+	};
+} );
+
+// Support: Safari <=7 - 9.1, Chrome <=37 - 49
+// Add the top/left cssHooks using jQuery.fn.position
+// Webkit bug: https://bugs.webkit.org/show_bug.cgi?id=29084
+// Blink bug: https://bugs.chromium.org/p/chromium/issues/detail?id=589347
+// getComputedStyle returns percent when specified for top/left/bottom/right;
+// rather than make the css module depend on the offset module, just check for it here
+jQuery.each( [ "top", "left" ], function( _i, prop ) {
+	jQuery.cssHooks[ prop ] = addGetHookIf( support.pixelPosition,
+		function( elem, computed ) {
+			if ( computed ) {
+				computed = curCSS( elem, prop );
+
+				// If curCSS returns percentage, fallback to offset
+				return rnumnonpx.test( computed ) ?
+					jQuery( elem ).position()[ prop ] + "px" :
+					computed;
+			}
+		}
+	);
+} );
+
+
+// Create innerHeight, innerWidth, height, width, outerHeight and outerWidth methods
+jQuery.each( { Height: "height", Width: "width" }, function( name, type ) {
+	jQuery.each( {
+		padding: "inner" + name,
+		content: type,
+		"": "outer" + name
+	}, function( defaultExtra, funcName ) {
+
+		// Margin is only for outerHeight, outerWidth
+		jQuery.fn[ funcName ] = function( margin, value ) {
+			var chainable = arguments.length && ( defaultExtra || typeof margin !== "boolean" ),
+				extra = defaultExtra || ( margin === true || value === true ? "margin" : "border" );
+
+			return access( this, function( elem, type, value ) {
+				var doc;
+
+				if ( isWindow( elem ) ) {
+
+					// $( window ).outerWidth/Height return w/h including scrollbars (gh-1729)
+					return funcName.indexOf( "outer" ) === 0 ?
+						elem[ "inner" + name ] :
+						elem.document.documentElement[ "client" + name ];
+				}
+
+				// Get document width or height
+				if ( elem.nodeType === 9 ) {
+					doc = elem.documentElement;
+
+					// Either scroll[Width/Height] or offset[Width/Height] or client[Width/Height],
+					// whichever is greatest
+					return Math.max(
+						elem.body[ "scroll" + name ], doc[ "scroll" + name ],
+						elem.body[ "offset" + name ], doc[ "offset" + name ],
+						doc[ "client" + name ]
+					);
+				}
+
+				return value === undefined ?
+
+					// Get width or height on the element, requesting but not forcing parseFloat
+					jQuery.css( elem, type, extra ) :
+
+					// Set width or height on the element
+					jQuery.style( elem, type, value, extra );
+			}, type, chainable ? margin : undefined, chainable );
+		};
+	} );
+} );
+
+
+jQuery.each( [
+	"ajaxStart",
+	"ajaxStop",
+	"ajaxComplete",
+	"ajaxError",
+	"ajaxSuccess",
+	"ajaxSend"
+], function( _i, type ) {
+	jQuery.fn[ type ] = function( fn ) {
+		return this.on( type, fn );
+	};
+} );
+
+
+
+
+jQuery.fn.extend( {
+
+	bind: function( types, data, fn ) {
+		return this.on( types, null, data, fn );
+	},
+	unbind: function( types, fn ) {
+		return this.off( types, null, fn );
+	},
+
+	delegate: function( selector, types, data, fn ) {
+		return this.on( types, selector, data, fn );
+	},
+	undelegate: function( selector, types, fn ) {
+
+		// ( namespace ) or ( selector, types [, fn] )
+		return arguments.length === 1 ?
+			this.off( selector, "**" ) :
+			this.off( types, selector || "**", fn );
+	},
+
+	hover: function( fnOver, fnOut ) {
+		return this.mouseenter( fnOver ).mouseleave( fnOut || fnOver );
+	}
+} );
+
+jQuery.each(
+	( "blur focus focusin focusout resize scroll click dblclick " +
+	"mousedown mouseup mousemove mouseover mouseout mouseenter mouseleave " +
+	"change select submit keydown keypress keyup contextmenu" ).split( " " ),
+	function( _i, name ) {
+
+		// Handle event binding
+		jQuery.fn[ name ] = function( data, fn ) {
+			return arguments.length > 0 ?
+				this.on( name, null, data, fn ) :
+				this.trigger( name );
+		};
+	}
+);
+
+
+
+
+// Support: Android <=4.0 only
+// Make sure we trim BOM and NBSP
+var rtrim = /^[\s\uFEFF\xA0]+|[\s\uFEFF\xA0]+$/g;
+
+// Bind a function to a context, optionally partially applying any
+// arguments.
+// jQuery.proxy is deprecated to promote standards (specifically Function#bind)
+// However, it is not slated for removal any time soon
+jQuery.proxy = function( fn, context ) {
+	var tmp, args, proxy;
+
+	if ( typeof context === "string" ) {
+		tmp = fn[ context ];
+		context = fn;
+		fn = tmp;
+	}
+
+	// Quick check to determine if target is callable, in the spec
+	// this throws a TypeError, but we will just return undefined.
+	if ( !isFunction( fn ) ) {
+		return undefined;
+	}
+
+	// Simulated bind
+	args = slice.call( arguments, 2 );
+	proxy = function() {
+		return fn.apply( context || this, args.concat( slice.call( arguments ) ) );
+	};
+
+	// Set the guid of unique handler to the same of original handler, so it can be removed
+	proxy.guid = fn.guid = fn.guid || jQuery.guid++;
+
+	return proxy;
+};
+
+jQuery.holdReady = function( hold ) {
+	if ( hold ) {
+		jQuery.readyWait++;
+	} else {
+		jQuery.ready( true );
+	}
+};
+jQuery.isArray = Array.isArray;
+jQuery.parseJSON = JSON.parse;
+jQuery.nodeName = nodeName;
+jQuery.isFunction = isFunction;
+jQuery.isWindow = isWindow;
+jQuery.camelCase = camelCase;
+jQuery.type = toType;
+
+jQuery.now = Date.now;
+
+jQuery.isNumeric = function( obj ) {
+
+	// As of jQuery 3.0, isNumeric is limited to
+	// strings and numbers (primitives or objects)
+	// that can be coerced to finite numbers (gh-2662)
+	var type = jQuery.type( obj );
+	return ( type === "number" || type === "string" ) &&
+
+		// parseFloat NaNs numeric-cast false positives ("")
+		// ...but misinterprets leading-number strings, particularly hex literals ("0x...")
+		// subtraction forces infinities to NaN
+		!isNaN( obj - parseFloat( obj ) );
+};
+
+jQuery.trim = function( text ) {
+	return text == null ?
+		"" :
+		( text + "" ).replace( rtrim, "" );
+};
+
+
+
+// Register as a named AMD module, since jQuery can be concatenated with other
+// files that may use define, but not via a proper concatenation script that
+// understands anonymous AMD modules. A named AMD is safest and most robust
+// way to register. Lowercase jquery is used because AMD module names are
+// derived from file names, and jQuery is normally delivered in a lowercase
+// file name. Do this after creating the global so that if an AMD module wants
+// to call noConflict to hide this version of jQuery, it will work.
+
+// Note that for maximum portability, libraries that are not jQuery should
+// declare themselves as anonymous modules, and avoid setting a global if an
+// AMD loader is present. jQuery is a special case. For more information, see
+// https://github.com/jrburke/requirejs/wiki/Updating-existing-libraries#wiki-anon
+
+if ( typeof define === "function" && define.amd ) {
+	define( "jquery", [], function() {
+		return jQuery;
+	} );
+}
+
+
+
+
+var
+
+	// Map over jQuery in case of overwrite
+	_jQuery = window.jQuery,
+
+	// Map over the $ in case of overwrite
+	_$ = window.$;
+
+jQuery.noConflict = function( deep ) {
+	if ( window.$ === jQuery ) {
+		window.$ = _$;
+	}
+
+	if ( deep && window.jQuery === jQuery ) {
+		window.jQuery = _jQuery;
+	}
+
+	return jQuery;
+};
+
+// Expose jQuery and $ identifiers, even in AMD
+// (#7102#comment:10, https://github.com/jquery/jquery/pull/557)
+// and CommonJS for browser emulators (#13566)
+if ( typeof noGlobal === "undefined" ) {
+	window.jQuery = window.$ = jQuery;
+}
+
+
+
+
+return jQuery;
+} );
diff --git a/docs/RefMan/_build/html/_static/language_data.js b/docs/RefMan/_build/html/_static/language_data.js
index 2e22b06ab..863704b31 100644
--- a/docs/RefMan/_build/html/_static/language_data.js
+++ b/docs/RefMan/_build/html/_static/language_data.js
@@ -5,12 +5,12 @@
  * This script contains the language-specific data used by searchtools.js,
  * namely the list of stopwords, stemmer, scorer and splitter.
  *
- * :copyright: Copyright 2007-2022 by the Sphinx team, see AUTHORS.
+ * :copyright: Copyright 2007-2021 by the Sphinx team, see AUTHORS.
  * :license: BSD, see LICENSE for details.
  *
  */
 
-var stopwords = ["a", "and", "are", "as", "at", "be", "but", "by", "for", "if", "in", "into", "is", "it", "near", "no", "not", "of", "on", "or", "such", "that", "the", "their", "then", "there", "these", "they", "this", "to", "was", "will", "with"];
+var stopwords = ["a","and","are","as","at","be","but","by","for","if","in","into","is","it","near","no","not","of","on","or","such","that","the","their","then","there","these","they","this","to","was","will","with"];
 
 
 /* Non-minified version is copied as a separate JS file, is available */
@@ -197,3 +197,101 @@ var Stemmer = function() {
   }
 }
 
+
+
+
+var splitChars = (function() {
+    var result = {};
+    var singles = [96, 180, 187, 191, 215, 247, 749, 885, 903, 907, 909, 930, 1014, 1648,
+         1748, 1809, 2416, 2473, 2481, 2526, 2601, 2609, 2612, 2615, 2653, 2702,
+         2706, 2729, 2737, 2740, 2857, 2865, 2868, 2910, 2928, 2948, 2961, 2971,
+         2973, 3085, 3089, 3113, 3124, 3213, 3217, 3241, 3252, 3295, 3341, 3345,
+         3369, 3506, 3516, 3633, 3715, 3721, 3736, 3744, 3748, 3750, 3756, 3761,
+         3781, 3912, 4239, 4347, 4681, 4695, 4697, 4745, 4785, 4799, 4801, 4823,
+         4881, 5760, 5901, 5997, 6313, 7405, 8024, 8026, 8028, 8030, 8117, 8125,
+         8133, 8181, 8468, 8485, 8487, 8489, 8494, 8527, 11311, 11359, 11687, 11695,
+         11703, 11711, 11719, 11727, 11735, 12448, 12539, 43010, 43014, 43019, 43587,
+         43696, 43713, 64286, 64297, 64311, 64317, 64319, 64322, 64325, 65141];
+    var i, j, start, end;
+    for (i = 0; i < singles.length; i++) {
+        result[singles[i]] = true;
+    }
+    var ranges = [[0, 47], [58, 64], [91, 94], [123, 169], [171, 177], [182, 184], [706, 709],
+         [722, 735], [741, 747], [751, 879], [888, 889], [894, 901], [1154, 1161],
+         [1318, 1328], [1367, 1368], [1370, 1376], [1416, 1487], [1515, 1519], [1523, 1568],
+         [1611, 1631], [1642, 1645], [1750, 1764], [1767, 1773], [1789, 1790], [1792, 1807],
+         [1840, 1868], [1958, 1968], [1970, 1983], [2027, 2035], [2038, 2041], [2043, 2047],
+         [2070, 2073], [2075, 2083], [2085, 2087], [2089, 2307], [2362, 2364], [2366, 2383],
+         [2385, 2391], [2402, 2405], [2419, 2424], [2432, 2436], [2445, 2446], [2449, 2450],
+         [2483, 2485], [2490, 2492], [2494, 2509], [2511, 2523], [2530, 2533], [2546, 2547],
+         [2554, 2564], [2571, 2574], [2577, 2578], [2618, 2648], [2655, 2661], [2672, 2673],
+         [2677, 2692], [2746, 2748], [2750, 2767], [2769, 2783], [2786, 2789], [2800, 2820],
+         [2829, 2830], [2833, 2834], [2874, 2876], [2878, 2907], [2914, 2917], [2930, 2946],
+         [2955, 2957], [2966, 2968], [2976, 2978], [2981, 2983], [2987, 2989], [3002, 3023],
+         [3025, 3045], [3059, 3076], [3130, 3132], [3134, 3159], [3162, 3167], [3170, 3173],
+         [3184, 3191], [3199, 3204], [3258, 3260], [3262, 3293], [3298, 3301], [3312, 3332],
+         [3386, 3388], [3390, 3423], [3426, 3429], [3446, 3449], [3456, 3460], [3479, 3481],
+         [3518, 3519], [3527, 3584], [3636, 3647], [3655, 3663], [3674, 3712], [3717, 3718],
+         [3723, 3724], [3726, 3731], [3752, 3753], [3764, 3772], [3774, 3775], [3783, 3791],
+         [3802, 3803], [3806, 3839], [3841, 3871], [3892, 3903], [3949, 3975], [3980, 4095],
+         [4139, 4158], [4170, 4175], [4182, 4185], [4190, 4192], [4194, 4196], [4199, 4205],
+         [4209, 4212], [4226, 4237], [4250, 4255], [4294, 4303], [4349, 4351], [4686, 4687],
+         [4702, 4703], [4750, 4751], [4790, 4791], [4806, 4807], [4886, 4887], [4955, 4968],
+         [4989, 4991], [5008, 5023], [5109, 5120], [5741, 5742], [5787, 5791], [5867, 5869],
+         [5873, 5887], [5906, 5919], [5938, 5951], [5970, 5983], [6001, 6015], [6068, 6102],
+         [6104, 6107], [6109, 6111], [6122, 6127], [6138, 6159], [6170, 6175], [6264, 6271],
+         [6315, 6319], [6390, 6399], [6429, 6469], [6510, 6511], [6517, 6527], [6572, 6592],
+         [6600, 6607], [6619, 6655], [6679, 6687], [6741, 6783], [6794, 6799], [6810, 6822],
+         [6824, 6916], [6964, 6980], [6988, 6991], [7002, 7042], [7073, 7085], [7098, 7167],
+         [7204, 7231], [7242, 7244], [7294, 7400], [7410, 7423], [7616, 7679], [7958, 7959],
+         [7966, 7967], [8006, 8007], [8014, 8015], [8062, 8063], [8127, 8129], [8141, 8143],
+         [8148, 8149], [8156, 8159], [8173, 8177], [8189, 8303], [8306, 8307], [8314, 8318],
+         [8330, 8335], [8341, 8449], [8451, 8454], [8456, 8457], [8470, 8472], [8478, 8483],
+         [8506, 8507], [8512, 8516], [8522, 8525], [8586, 9311], [9372, 9449], [9472, 10101],
+         [10132, 11263], [11493, 11498], [11503, 11516], [11518, 11519], [11558, 11567],
+         [11622, 11630], [11632, 11647], [11671, 11679], [11743, 11822], [11824, 12292],
+         [12296, 12320], [12330, 12336], [12342, 12343], [12349, 12352], [12439, 12444],
+         [12544, 12548], [12590, 12592], [12687, 12689], [12694, 12703], [12728, 12783],
+         [12800, 12831], [12842, 12880], [12896, 12927], [12938, 12976], [12992, 13311],
+         [19894, 19967], [40908, 40959], [42125, 42191], [42238, 42239], [42509, 42511],
+         [42540, 42559], [42592, 42593], [42607, 42622], [42648, 42655], [42736, 42774],
+         [42784, 42785], [42889, 42890], [42893, 43002], [43043, 43055], [43062, 43071],
+         [43124, 43137], [43188, 43215], [43226, 43249], [43256, 43258], [43260, 43263],
+         [43302, 43311], [43335, 43359], [43389, 43395], [43443, 43470], [43482, 43519],
+         [43561, 43583], [43596, 43599], [43610, 43615], [43639, 43641], [43643, 43647],
+         [43698, 43700], [43703, 43704], [43710, 43711], [43715, 43738], [43742, 43967],
+         [44003, 44015], [44026, 44031], [55204, 55215], [55239, 55242], [55292, 55295],
+         [57344, 63743], [64046, 64047], [64110, 64111], [64218, 64255], [64263, 64274],
+         [64280, 64284], [64434, 64466], [64830, 64847], [64912, 64913], [64968, 65007],
+         [65020, 65135], [65277, 65295], [65306, 65312], [65339, 65344], [65371, 65381],
+         [65471, 65473], [65480, 65481], [65488, 65489], [65496, 65497]];
+    for (i = 0; i < ranges.length; i++) {
+        start = ranges[i][0];
+        end = ranges[i][1];
+        for (j = start; j <= end; j++) {
+            result[j] = true;
+        }
+    }
+    return result;
+})();
+
+function splitQuery(query) {
+    var result = [];
+    var start = -1;
+    for (var i = 0; i < query.length; i++) {
+        if (splitChars[query.charCodeAt(i)]) {
+            if (start !== -1) {
+                result.push(query.slice(start, i));
+                start = -1;
+            }
+        } else if (start === -1) {
+            start = i;
+        }
+    }
+    if (start !== -1) {
+        result.push(query.slice(start));
+    }
+    return result;
+}
+
+
diff --git a/docs/RefMan/_build/html/_static/searchtools.js b/docs/RefMan/_build/html/_static/searchtools.js
index ac4d5861f..7dbc787d3 100644
--- a/docs/RefMan/_build/html/_static/searchtools.js
+++ b/docs/RefMan/_build/html/_static/searchtools.js
@@ -4,24 +4,22 @@
  *
  * Sphinx JavaScript utilities for the full-text search.
  *
- * :copyright: Copyright 2007-2022 by the Sphinx team, see AUTHORS.
+ * :copyright: Copyright 2007-2021 by the Sphinx team, see AUTHORS.
  * :license: BSD, see LICENSE for details.
  *
  */
-"use strict";
 
-/**
- * Simple result scoring code.
- */
-if (typeof Scorer === "undefined") {
+if (!Scorer) {
+  /**
+   * Simple result scoring code.
+   */
   var Scorer = {
     // Implement the following function to further tweak the score for each result
-    // The function takes a result array [docname, title, anchor, descr, score, filename]
+    // The function takes a result array [filename, title, anchor, descr, score]
     // and returns the new score.
     /*
-    score: result => {
-      const [docname, title, anchor, descr, score, filename] = result
-      return score
+    score: function(result) {
+      return result[4];
     },
     */
 
@@ -30,11 +28,9 @@ if (typeof Scorer === "undefined") {
     // or matches in the last dotted part of the object name
     objPartialMatch: 6,
     // Additive scores depending on the priority of the object
-    objPrio: {
-      0: 15, // used to be importantResults
-      1: 5, // used to be objectResults
-      2: -5, // used to be unimportantResults
-    },
+    objPrio: {0:  15,   // used to be importantResults
+              1:  5,   // used to be objectResults
+              2: -5},  // used to be unimportantResults
     //  Used when the priority is not in the mapping.
     objPrioDefault: 0,
 
@@ -43,455 +39,459 @@ if (typeof Scorer === "undefined") {
     partialTitle: 7,
     // query found in terms
     term: 5,
-    partialTerm: 2,
+    partialTerm: 2
   };
 }
 
-const _removeChildren = (element) => {
-  while (element && element.lastChild) element.removeChild(element.lastChild);
-};
-
-/**
- * See https://developer.mozilla.org/en-US/docs/Web/JavaScript/Guide/Regular_Expressions#escaping
- */
-const _escapeRegExp = (string) =>
-  string.replace(/[.*+\-?^${}()|[\]\\]/g, "\\$&"); // $& means the whole matched string
-
-const _displayItem = (item, highlightTerms, searchTerms) => {
-  const docBuilder = DOCUMENTATION_OPTIONS.BUILDER;
-  const docUrlRoot = DOCUMENTATION_OPTIONS.URL_ROOT;
-  const docFileSuffix = DOCUMENTATION_OPTIONS.FILE_SUFFIX;
-  const docLinkSuffix = DOCUMENTATION_OPTIONS.LINK_SUFFIX;
-  const showSearchSummary = DOCUMENTATION_OPTIONS.SHOW_SEARCH_SUMMARY;
-
-  const [docName, title, anchor, descr] = item;
-
-  let listItem = document.createElement("li");
-  let requestUrl;
-  let linkUrl;
-  if (docBuilder === "dirhtml") {
-    // dirhtml builder
-    let dirname = docName + "/";
-    if (dirname.match(/\/index\/$/))
-      dirname = dirname.substring(0, dirname.length - 6);
-    else if (dirname === "index/") dirname = "";
-    requestUrl = docUrlRoot + dirname;
-    linkUrl = requestUrl;
-  } else {
-    // normal html builders
-    requestUrl = docUrlRoot + docName + docFileSuffix;
-    linkUrl = docName + docLinkSuffix;
-  }
-  const params = new URLSearchParams();
-  params.set("highlight", [...highlightTerms].join(" "));
-  let linkEl = listItem.appendChild(document.createElement("a"));
-  linkEl.href = linkUrl + "?" + params.toString() + anchor;
-  linkEl.innerHTML = title;
-  if (descr)
-    listItem.appendChild(document.createElement("span")).innerText =
-      " (" + descr + ")";
-  else if (showSearchSummary)
-    fetch(requestUrl)
-      .then((responseData) => responseData.text())
-      .then((data) => {
-        if (data)
-          listItem.appendChild(
-            Search.makeSearchSummary(data, searchTerms, highlightTerms)
-          );
-      });
-  Search.output.appendChild(listItem);
-};
-const _finishSearch = (resultCount) => {
-  Search.stopPulse();
-  Search.title.innerText = _("Search Results");
-  if (!resultCount)
-    Search.status.innerText = Documentation.gettext(
-      "Your search did not match any documents. Please make sure that all words are spelled correctly and that you've selected enough categories."
-    );
-  else
-    Search.status.innerText = _(
-      `Search finished, found ${resultCount} page(s) matching the search query.`
-    );
-};
-const _displayNextItem = (
-  results,
-  resultCount,
-  highlightTerms,
-  searchTerms
-) => {
-  // results left, load the summary and display it
-  // this is intended to be dynamic (don't sub resultsCount)
-  if (results.length) {
-    _displayItem(results.pop(), highlightTerms, searchTerms);
-    setTimeout(
-      () => _displayNextItem(results, resultCount, highlightTerms, searchTerms),
-      5
-    );
+if (!splitQuery) {
+  function splitQuery(query) {
+    return query.split(/\s+/);
   }
-  // search finished, update title and status message
-  else _finishSearch(resultCount);
-};
-
-/**
- * Default splitQuery function. Can be overridden in ``sphinx.search`` with a
- * custom function per language.
- *
- * The regular expression works by splitting the string on consecutive characters
- * that are not Unicode letters, numbers, underscores, or emoji characters.
- * This is the same as ``\W+`` in Python, preserving the surrogate pair area.
- */
-if (typeof splitQuery === "undefined") {
-  var splitQuery = (query) => query
-      .split(/[^\p{Letter}\p{Number}_\p{Emoji_Presentation}]+/gu)
-      .filter(term => term)  // remove remaining empty strings
 }
 
 /**
  * Search Module
  */
-const Search = {
-  _index: null,
-  _queued_query: null,
-  _pulse_status: -1,
-
-  htmlToText: (htmlString) => {
-    const htmlElement = document
-      .createRange()
-      .createContextualFragment(htmlString);
-    _removeChildren(htmlElement.querySelectorAll(".headerlink"));
-    const docContent = htmlElement.querySelector('[role="main"]');
-    if (docContent !== undefined) return docContent.textContent;
-    console.warn(
-      "Content block not found. Sphinx search tries to obtain it via '[role=main]'. Could you check your theme or template."
-    );
-    return "";
+var Search = {
+
+  _index : null,
+  _queued_query : null,
+  _pulse_status : -1,
+
+  htmlToText : function(htmlString) {
+      var virtualDocument = document.implementation.createHTMLDocument('virtual');
+      var htmlElement = $(htmlString, virtualDocument);
+      htmlElement.find('.headerlink').remove();
+      docContent = htmlElement.find('[role=main]')[0];
+      if(docContent === undefined) {
+          console.warn("Content block not found. Sphinx search tries to obtain it " +
+                       "via '[role=main]'. Could you check your theme or template.");
+          return "";
+      }
+      return docContent.textContent || docContent.innerText;
   },
 
-  init: () => {
-    const query = new URLSearchParams(window.location.search).get("q");
-    document
-      .querySelectorAll('input[name="q"]')
-      .forEach((el) => (el.value = query));
-    if (query) Search.performSearch(query);
+  init : function() {
+      var params = $.getQueryParameters();
+      if (params.q) {
+          var query = params.q[0];
+          $('input[name="q"]')[0].value = query;
+          this.performSearch(query);
+      }
   },
 
-  loadIndex: (url) =>
-    (document.body.appendChild(document.createElement("script")).src = url),
+  loadIndex : function(url) {
+    $.ajax({type: "GET", url: url, data: null,
+            dataType: "script", cache: true,
+            complete: function(jqxhr, textstatus) {
+              if (textstatus != "success") {
+                document.getElementById("searchindexloader").src = url;
+              }
+            }});
+  },
 
-  setIndex: (index) => {
-    Search._index = index;
-    if (Search._queued_query !== null) {
-      const query = Search._queued_query;
-      Search._queued_query = null;
-      Search.query(query);
+  setIndex : function(index) {
+    var q;
+    this._index = index;
+    if ((q = this._queued_query) !== null) {
+      this._queued_query = null;
+      Search.query(q);
     }
   },
 
-  hasIndex: () => Search._index !== null,
-
-  deferQuery: (query) => (Search._queued_query = query),
+  hasIndex : function() {
+      return this._index !== null;
+  },
 
-  stopPulse: () => (Search._pulse_status = -1),
+  deferQuery : function(query) {
+      this._queued_query = query;
+  },
 
-  startPulse: () => {
-    if (Search._pulse_status >= 0) return;
+  stopPulse : function() {
+      this._pulse_status = 0;
+  },
 
-    const pulse = () => {
+  startPulse : function() {
+    if (this._pulse_status >= 0)
+        return;
+    function pulse() {
+      var i;
       Search._pulse_status = (Search._pulse_status + 1) % 4;
-      Search.dots.innerText = ".".repeat(Search._pulse_status);
-      if (Search._pulse_status >= 0) window.setTimeout(pulse, 500);
-    };
+      var dotString = '';
+      for (i = 0; i < Search._pulse_status; i++)
+        dotString += '.';
+      Search.dots.text(dotString);
+      if (Search._pulse_status > -1)
+        window.setTimeout(pulse, 500);
+    }
     pulse();
   },
 
   /**
    * perform a search for something (or wait until index is loaded)
    */
-  performSearch: (query) => {
+  performSearch : function(query) {
     // create the required interface elements
-    const searchText = document.createElement("h2");
-    searchText.textContent = _("Searching");
-    const searchSummary = document.createElement("p");
-    searchSummary.classList.add("search-summary");
-    searchSummary.innerText = "";
-    const searchList = document.createElement("ul");
-    searchList.classList.add("search");
-
-    const out = document.getElementById("search-results");
-    Search.title = out.appendChild(searchText);
-    Search.dots = Search.title.appendChild(document.createElement("span"));
-    Search.status = out.appendChild(searchSummary);
-    Search.output = out.appendChild(searchList);
-
-    const searchProgress = document.getElementById("search-progress");
-    // Some themes don't use the search progress node
-    if (searchProgress) {
-      searchProgress.innerText = _("Preparing search...");
-    }
-    Search.startPulse();
+    this.out = $('#search-results');
+    this.title = $('<h2>' + _('Searching') + '</h2>').appendTo(this.out);
+    this.dots = $('<span></span>').appendTo(this.title);
+    this.status = $('<p class="search-summary">&nbsp;</p>').appendTo(this.out);
+    this.output = $('<ul class="search"/>').appendTo(this.out);
+
+    $('#search-progress').text(_('Preparing search...'));
+    this.startPulse();
 
     // index already loaded, the browser was quick!
-    if (Search.hasIndex()) Search.query(query);
-    else Search.deferQuery(query);
+    if (this.hasIndex())
+      this.query(query);
+    else
+      this.deferQuery(query);
   },
 
   /**
    * execute search (requires search index to be loaded)
    */
-  query: (query) => {
-    // stem the search terms and add them to the correct list
-    const stemmer = new Stemmer();
-    const searchTerms = new Set();
-    const excludedTerms = new Set();
-    const highlightTerms = new Set();
-    const objectTerms = new Set(splitQuery(query.toLowerCase().trim()));
-    splitQuery(query.trim()).forEach((queryTerm) => {
-      const queryTermLower = queryTerm.toLowerCase();
-
-      // maybe skip this "word"
-      // stopwords array is from language_data.js
-      if (
-        stopwords.indexOf(queryTermLower) !== -1 ||
-        queryTerm.match(/^\d+$/)
-      )
-        return;
+  query : function(query) {
+    var i;
+
+    // stem the searchterms and add them to the correct list
+    var stemmer = new Stemmer();
+    var searchterms = [];
+    var excluded = [];
+    var hlterms = [];
+    var tmp = splitQuery(query);
+    var objectterms = [];
+    for (i = 0; i < tmp.length; i++) {
+      if (tmp[i] !== "") {
+          objectterms.push(tmp[i].toLowerCase());
+      }
 
+      if ($u.indexOf(stopwords, tmp[i].toLowerCase()) != -1 || tmp[i] === "") {
+        // skip this "word"
+        continue;
+      }
       // stem the word
-      let word = stemmer.stemWord(queryTermLower);
+      var word = stemmer.stemWord(tmp[i].toLowerCase());
+      // prevent stemmer from cutting word smaller than two chars
+      if(word.length < 3 && tmp[i].length >= 3) {
+        word = tmp[i];
+      }
+      var toAppend;
       // select the correct list
-      if (word[0] === "-") excludedTerms.add(word.substr(1));
+      if (word[0] == '-') {
+        toAppend = excluded;
+        word = word.substr(1);
+      }
       else {
-        searchTerms.add(word);
-        highlightTerms.add(queryTermLower);
+        toAppend = searchterms;
+        hlterms.push(tmp[i].toLowerCase());
       }
-    });
+      // only add if not already in the list
+      if (!$u.contains(toAppend, word))
+        toAppend.push(word);
+    }
+    var highlightstring = '?highlight=' + $.urlencode(hlterms.join(" "));
 
-    // console.debug("SEARCH: searching for:");
-    // console.info("required: ", [...searchTerms]);
-    // console.info("excluded: ", [...excludedTerms]);
+    // console.debug('SEARCH: searching for:');
+    // console.info('required: ', searchterms);
+    // console.info('excluded: ', excluded);
+
+    // prepare search
+    var terms = this._index.terms;
+    var titleterms = this._index.titleterms;
 
-    // array of [docname, title, anchor, descr, score, filename]
-    let results = [];
-    _removeChildren(document.getElementById("search-progress"));
+    // array of [filename, title, anchor, descr, score]
+    var results = [];
+    $('#search-progress').empty();
 
     // lookup as object
-    objectTerms.forEach((term) =>
-      results.push(...Search.performObjectSearch(term, objectTerms))
-    );
+    for (i = 0; i < objectterms.length; i++) {
+      var others = [].concat(objectterms.slice(0, i),
+                             objectterms.slice(i+1, objectterms.length));
+      results = results.concat(this.performObjectSearch(objectterms[i], others));
+    }
 
     // lookup as search terms in fulltext
-    results.push(...Search.performTermsSearch(searchTerms, excludedTerms));
+    results = results.concat(this.performTermsSearch(searchterms, excluded, terms, titleterms));
 
     // let the scorer override scores with a custom scoring function
-    if (Scorer.score) results.forEach((item) => (item[4] = Scorer.score(item)));
+    if (Scorer.score) {
+      for (i = 0; i < results.length; i++)
+        results[i][4] = Scorer.score(results[i]);
+    }
 
     // now sort the results by score (in opposite order of appearance, since the
     // display function below uses pop() to retrieve items) and then
     // alphabetically
-    results.sort((a, b) => {
-      const leftScore = a[4];
-      const rightScore = b[4];
-      if (leftScore === rightScore) {
+    results.sort(function(a, b) {
+      var left = a[4];
+      var right = b[4];
+      if (left > right) {
+        return 1;
+      } else if (left < right) {
+        return -1;
+      } else {
         // same score: sort alphabetically
-        const leftTitle = a[1].toLowerCase();
-        const rightTitle = b[1].toLowerCase();
-        if (leftTitle === rightTitle) return 0;
-        return leftTitle > rightTitle ? -1 : 1; // inverted is intentional
+        left = a[1].toLowerCase();
+        right = b[1].toLowerCase();
+        return (left > right) ? -1 : ((left < right) ? 1 : 0);
       }
-      return leftScore > rightScore ? 1 : -1;
     });
 
-    // remove duplicate search results
-    // note the reversing of results, so that in the case of duplicates, the highest-scoring entry is kept
-    let seen = new Set();
-    results = results.reverse().reduce((acc, result) => {
-      let resultStr = result.slice(0, 4).concat([result[5]]).map(v => String(v)).join(',');
-      if (!seen.has(resultStr)) {
-        acc.push(result);
-        seen.add(resultStr);
-      }
-      return acc;
-    }, []);
-
-    results = results.reverse();
-
     // for debugging
     //Search.lastresults = results.slice();  // a copy
-    // console.info("search results:", Search.lastresults);
+    //console.info('search results:', Search.lastresults);
 
     // print the results
-    _displayNextItem(results, results.length, highlightTerms, searchTerms);
+    var resultCount = results.length;
+    function displayNextItem() {
+      // results left, load the summary and display it
+      if (results.length) {
+        var item = results.pop();
+        var listItem = $('<li></li>');
+        var requestUrl = "";
+        var linkUrl = "";
+        if (DOCUMENTATION_OPTIONS.BUILDER === 'dirhtml') {
+          // dirhtml builder
+          var dirname = item[0] + '/';
+          if (dirname.match(/\/index\/$/)) {
+            dirname = dirname.substring(0, dirname.length-6);
+          } else if (dirname == 'index/') {
+            dirname = '';
+          }
+          requestUrl = DOCUMENTATION_OPTIONS.URL_ROOT + dirname;
+          linkUrl = requestUrl;
+
+        } else {
+          // normal html builders
+          requestUrl = DOCUMENTATION_OPTIONS.URL_ROOT + item[0] + DOCUMENTATION_OPTIONS.FILE_SUFFIX;
+          linkUrl = item[0] + DOCUMENTATION_OPTIONS.LINK_SUFFIX;
+        }
+        listItem.append($('<a/>').attr('href',
+            linkUrl +
+            highlightstring + item[2]).html(item[1]));
+        if (item[3]) {
+          listItem.append($('<span> (' + item[3] + ')</span>'));
+          Search.output.append(listItem);
+          setTimeout(function() {
+            displayNextItem();
+          }, 5);
+        } else if (DOCUMENTATION_OPTIONS.HAS_SOURCE) {
+          $.ajax({url: requestUrl,
+                  dataType: "text",
+                  complete: function(jqxhr, textstatus) {
+                    var data = jqxhr.responseText;
+                    if (data !== '' && data !== undefined) {
+                      var summary = Search.makeSearchSummary(data, searchterms, hlterms);
+                      if (summary) {
+                        listItem.append(summary);
+                      }
+                    }
+                    Search.output.append(listItem);
+                    setTimeout(function() {
+                      displayNextItem();
+                    }, 5);
+                  }});
+        } else {
+          // no source available, just display title
+          Search.output.append(listItem);
+          setTimeout(function() {
+            displayNextItem();
+          }, 5);
+        }
+      }
+      // search finished, update title and status message
+      else {
+        Search.stopPulse();
+        Search.title.text(_('Search Results'));
+        if (!resultCount)
+          Search.status.text(_('Your search did not match any documents. Please make sure that all words are spelled correctly and that you\'ve selected enough categories.'));
+        else
+            Search.status.text(_('Search finished, found %s page(s) matching the search query.').replace('%s', resultCount));
+        Search.status.fadeIn(500);
+      }
+    }
+    displayNextItem();
   },
 
   /**
    * search for object names
    */
-  performObjectSearch: (object, objectTerms) => {
-    const filenames = Search._index.filenames;
-    const docNames = Search._index.docnames;
-    const objects = Search._index.objects;
-    const objNames = Search._index.objnames;
-    const titles = Search._index.titles;
-
-    const results = [];
-
-    const objectSearchCallback = (prefix, match) => {
-      const name = match[4]
-      const fullname = (prefix ? prefix + "." : "") + name;
-      const fullnameLower = fullname.toLowerCase();
-      if (fullnameLower.indexOf(object) < 0) return;
-
-      let score = 0;
-      const parts = fullnameLower.split(".");
-
-      // check for different match types: exact matches of full name or
-      // "last name" (i.e. last dotted part)
-      if (fullnameLower === object || parts.slice(-1)[0] === object)
-        score += Scorer.objNameMatch;
-      else if (parts.slice(-1)[0].indexOf(object) > -1)
-        score += Scorer.objPartialMatch; // matches in last name
-
-      const objName = objNames[match[1]][2];
-      const title = titles[match[0]];
-
-      // If more than one term searched for, we require other words to be
-      // found in the name/title/description
-      const otherTerms = new Set(objectTerms);
-      otherTerms.delete(object);
-      if (otherTerms.size > 0) {
-        const haystack = `${prefix} ${name} ${objName} ${title}`.toLowerCase();
-        if (
-          [...otherTerms].some((otherTerm) => haystack.indexOf(otherTerm) < 0)
-        )
-          return;
+  performObjectSearch : function(object, otherterms) {
+    var filenames = this._index.filenames;
+    var docnames = this._index.docnames;
+    var objects = this._index.objects;
+    var objnames = this._index.objnames;
+    var titles = this._index.titles;
+
+    var i;
+    var results = [];
+
+    for (var prefix in objects) {
+      if (!(objects[prefix] instanceof Array)) {
+        objects[prefix] = Object.entries(objects[prefix]).map(([name, match]) => [...match, name]);
+      }
+      for (var iMatch = 0; iMatch != objects[prefix].length; ++iMatch) {
+        var match = objects[prefix][iMatch];
+        var name = match[4];
+        var fullname = (prefix ? prefix + '.' : '') + name;
+        var fullnameLower = fullname.toLowerCase()
+        if (fullnameLower.indexOf(object) > -1) {
+          var score = 0;
+          var parts = fullnameLower.split('.');
+          // check for different match types: exact matches of full name or
+          // "last name" (i.e. last dotted part)
+          if (fullnameLower == object || parts[parts.length - 1] == object) {
+            score += Scorer.objNameMatch;
+          // matches in last name
+          } else if (parts[parts.length - 1].indexOf(object) > -1) {
+            score += Scorer.objPartialMatch;
+          }
+          var objname = objnames[match[1]][2];
+          var title = titles[match[0]];
+          // If more than one term searched for, we require other words to be
+          // found in the name/title/description
+          if (otherterms.length > 0) {
+            var haystack = (prefix + ' ' + name + ' ' +
+                            objname + ' ' + title).toLowerCase();
+            var allfound = true;
+            for (i = 0; i < otherterms.length; i++) {
+              if (haystack.indexOf(otherterms[i]) == -1) {
+                allfound = false;
+                break;
+              }
+            }
+            if (!allfound) {
+              continue;
+            }
+          }
+          var descr = objname + _(', in ') + title;
+
+          var anchor = match[3];
+          if (anchor === '')
+            anchor = fullname;
+          else if (anchor == '-')
+            anchor = objnames[match[1]][1] + '-' + fullname;
+          // add custom score for some objects according to scorer
+          if (Scorer.objPrio.hasOwnProperty(match[2])) {
+            score += Scorer.objPrio[match[2]];
+          } else {
+            score += Scorer.objPrioDefault;
+          }
+          results.push([docnames[match[0]], fullname, '#'+anchor, descr, score, filenames[match[0]]]);
+        }
       }
+    }
 
-      let anchor = match[3];
-      if (anchor === "") anchor = fullname;
-      else if (anchor === "-") anchor = objNames[match[1]][1] + "-" + fullname;
-
-      const descr = objName + _(", in ") + title;
-
-      // add custom score for some objects according to scorer
-      if (Scorer.objPrio.hasOwnProperty(match[2]))
-        score += Scorer.objPrio[match[2]];
-      else score += Scorer.objPrioDefault;
-
-      results.push([
-        docNames[match[0]],
-        fullname,
-        "#" + anchor,
-        descr,
-        score,
-        filenames[match[0]],
-      ]);
-    };
-    Object.keys(objects).forEach((prefix) =>
-      objects[prefix].forEach((array) =>
-        objectSearchCallback(prefix, array)
-      )
-    );
     return results;
   },
 
+  /**
+   * See https://developer.mozilla.org/en-US/docs/Web/JavaScript/Guide/Regular_Expressions
+   */
+  escapeRegExp : function(string) {
+    return string.replace(/[.*+\-?^${}()|[\]\\]/g, '\\$&'); // $& means the whole matched string
+  },
+
   /**
    * search for full-text terms in the index
    */
-  performTermsSearch: (searchTerms, excludedTerms) => {
-    // prepare search
-    const terms = Search._index.terms;
-    const titleTerms = Search._index.titleterms;
-    const docNames = Search._index.docnames;
-    const filenames = Search._index.filenames;
-    const titles = Search._index.titles;
+  performTermsSearch : function(searchterms, excluded, terms, titleterms) {
+    var docnames = this._index.docnames;
+    var filenames = this._index.filenames;
+    var titles = this._index.titles;
 
-    const scoreMap = new Map();
-    const fileMap = new Map();
+    var i, j, file;
+    var fileMap = {};
+    var scoreMap = {};
+    var results = [];
 
     // perform the search on the required terms
-    searchTerms.forEach((word) => {
-      const files = [];
-      const arr = [
-        { files: terms[word], score: Scorer.term },
-        { files: titleTerms[word], score: Scorer.title },
+    for (i = 0; i < searchterms.length; i++) {
+      var word = searchterms[i];
+      var files = [];
+      var _o = [
+        {files: terms[word], score: Scorer.term},
+        {files: titleterms[word], score: Scorer.title}
       ];
       // add support for partial matches
       if (word.length > 2) {
-        const escapedWord = _escapeRegExp(word);
-        Object.keys(terms).forEach((term) => {
-          if (term.match(escapedWord) && !terms[word])
-            arr.push({ files: terms[term], score: Scorer.partialTerm });
-        });
-        Object.keys(titleTerms).forEach((term) => {
-          if (term.match(escapedWord) && !titleTerms[word])
-            arr.push({ files: titleTerms[word], score: Scorer.partialTitle });
-        });
+        var word_regex = this.escapeRegExp(word);
+        for (var w in terms) {
+          if (w.match(word_regex) && !terms[word]) {
+            _o.push({files: terms[w], score: Scorer.partialTerm})
+          }
+        }
+        for (var w in titleterms) {
+          if (w.match(word_regex) && !titleterms[word]) {
+              _o.push({files: titleterms[w], score: Scorer.partialTitle})
+          }
+        }
       }
 
       // no match but word was a required one
-      if (arr.every((record) => record.files === undefined)) return;
-
+      if ($u.every(_o, function(o){return o.files === undefined;})) {
+        break;
+      }
       // found search word in contents
-      arr.forEach((record) => {
-        if (record.files === undefined) return;
-
-        let recordFiles = record.files;
-        if (recordFiles.length === undefined) recordFiles = [recordFiles];
-        files.push(...recordFiles);
-
-        // set score for the word in each file
-        recordFiles.forEach((file) => {
-          if (!scoreMap.has(file)) scoreMap.set(file, {});
-          scoreMap.get(file)[word] = record.score;
-        });
+      $u.each(_o, function(o) {
+        var _files = o.files;
+        if (_files === undefined)
+          return
+
+        if (_files.length === undefined)
+          _files = [_files];
+        files = files.concat(_files);
+
+        // set score for the word in each file to Scorer.term
+        for (j = 0; j < _files.length; j++) {
+          file = _files[j];
+          if (!(file in scoreMap))
+            scoreMap[file] = {};
+          scoreMap[file][word] = o.score;
+        }
       });
 
       // create the mapping
-      files.forEach((file) => {
-        if (fileMap.has(file) && fileMap.get(file).indexOf(word) === -1)
-          fileMap.get(file).push(word);
-        else fileMap.set(file, [word]);
-      });
-    });
+      for (j = 0; j < files.length; j++) {
+        file = files[j];
+        if (file in fileMap && fileMap[file].indexOf(word) === -1)
+          fileMap[file].push(word);
+        else
+          fileMap[file] = [word];
+      }
+    }
 
     // now check if the files don't contain excluded terms
-    const results = [];
-    for (const [file, wordList] of fileMap) {
-      // check if all requirements are matched
+    for (file in fileMap) {
+      var valid = true;
 
-      // as search terms with length < 3 are discarded
-      const filteredTermCount = [...searchTerms].filter(
-        (term) => term.length > 2
-      ).length;
+      // check if all requirements are matched
+      var filteredTermCount = // as search terms with length < 3 are discarded: ignore
+        searchterms.filter(function(term){return term.length > 2}).length
       if (
-        wordList.length !== searchTerms.size &&
-        wordList.length !== filteredTermCount
-      )
-        continue;
+        fileMap[file].length != searchterms.length &&
+        fileMap[file].length != filteredTermCount
+      ) continue;
 
       // ensure that none of the excluded terms is in the search result
-      if (
-        [...excludedTerms].some(
-          (term) =>
-            terms[term] === file ||
-            titleTerms[term] === file ||
-            (terms[term] || []).includes(file) ||
-            (titleTerms[term] || []).includes(file)
-        )
-      )
-        break;
+      for (i = 0; i < excluded.length; i++) {
+        if (terms[excluded[i]] == file ||
+            titleterms[excluded[i]] == file ||
+            $u.contains(terms[excluded[i]] || [], file) ||
+            $u.contains(titleterms[excluded[i]] || [], file)) {
+          valid = false;
+          break;
+        }
+      }
 
-      // select one (max) score for the file.
-      const score = Math.max(...wordList.map((w) => scoreMap.get(file)[w]));
-      // add result to the result list
-      results.push([
-        docNames[file],
-        titles[file],
-        "",
-        null,
-        score,
-        filenames[file],
-      ]);
+      // if we have still a valid result we can add it to the result list
+      if (valid) {
+        // select one (max) score for the file.
+        // for better ranking, we should calculate ranking by using words statistics like basic tf-idf...
+        var score = $u.max($u.map(fileMap[file], function(w){return scoreMap[file][w]}));
+        results.push([docnames[file], titles[file], '', null, score, filenames[file]]);
+      }
     }
     return results;
   },
@@ -499,33 +499,34 @@ const Search = {
   /**
    * helper function to return a node containing the
    * search summary for a given text. keywords is a list
-   * of stemmed words, highlightWords is the list of normal, unstemmed
+   * of stemmed words, hlwords is the list of normal, unstemmed
    * words. the first one is used to find the occurrence, the
    * latter for highlighting it.
    */
-  makeSearchSummary: (htmlText, keywords, highlightWords) => {
-    const text = Search.htmlToText(htmlText).toLowerCase();
-    if (text === "") return null;
-
-    const actualStartPosition = [...keywords]
-      .map((k) => text.indexOf(k.toLowerCase()))
-      .filter((i) => i > -1)
-      .slice(-1)[0];
-    const startWithContext = Math.max(actualStartPosition - 120, 0);
-
-    const top = startWithContext === 0 ? "" : "...";
-    const tail = startWithContext + 240 < text.length ? "..." : "";
-
-    let summary = document.createElement("div");
-    summary.classList.add("context");
-    summary.innerText = top + text.substr(startWithContext, 240).trim() + tail;
-
-    highlightWords.forEach((highlightWord) =>
-      _highlightText(summary, highlightWord, "highlighted")
-    );
-
-    return summary;
-  },
+  makeSearchSummary : function(htmlText, keywords, hlwords) {
+    var text = Search.htmlToText(htmlText);
+    if (text == "") {
+      return null;
+    }
+    var textLower = text.toLowerCase();
+    var start = 0;
+    $.each(keywords, function() {
+      var i = textLower.indexOf(this.toLowerCase());
+      if (i > -1)
+        start = i;
+    });
+    start = Math.max(start - 120, 0);
+    var excerpt = ((start > 0) ? '...' : '') +
+      $.trim(text.substr(start, 240)) +
+      ((start + 240 - text.length) ? '...' : '');
+    var rv = $('<p class="context"></p>').text(excerpt);
+    $.each(hlwords, function() {
+      rv = rv.highlightText(this, 'highlighted');
+    });
+    return rv;
+  }
 };
 
-_ready(Search.init);
+$(document).ready(function() {
+  Search.init();
+});
diff --git a/docs/RefMan/_build/html/_static/underscore.js b/docs/RefMan/_build/html/_static/underscore.js
index cf177d428..b812b3507 100644
--- a/docs/RefMan/_build/html/_static/underscore.js
+++ b/docs/RefMan/_build/html/_static/underscore.js
@@ -1,6 +1,2042 @@
-!function(n,r){"object"==typeof exports&&"undefined"!=typeof module?module.exports=r():"function"==typeof define&&define.amd?define("underscore",r):(n="undefined"!=typeof globalThis?globalThis:n||self,function(){var t=n._,e=n._=r();e.noConflict=function(){return n._=t,e}}())}(this,(function(){
-//     Underscore.js 1.13.1
-//     https://underscorejs.org
-//     (c) 2009-2021 Jeremy Ashkenas, Julian Gonggrijp, and DocumentCloud and Investigative Reporters & Editors
-//     Underscore may be freely distributed under the MIT license.
-var n="1.13.1",r="object"==typeof self&&self.self===self&&self||"object"==typeof global&&global.global===global&&global||Function("return this")()||{},t=Array.prototype,e=Object.prototype,u="undefined"!=typeof Symbol?Symbol.prototype:null,o=t.push,i=t.slice,a=e.toString,f=e.hasOwnProperty,c="undefined"!=typeof ArrayBuffer,l="undefined"!=typeof DataView,s=Array.isArray,p=Object.keys,v=Object.create,h=c&&ArrayBuffer.isView,y=isNaN,d=isFinite,g=!{toString:null}.propertyIsEnumerable("toString"),b=["valueOf","isPrototypeOf","toString","propertyIsEnumerable","hasOwnProperty","toLocaleString"],m=Math.pow(2,53)-1;function j(n,r){return r=null==r?n.length-1:+r,function(){for(var t=Math.max(arguments.length-r,0),e=Array(t),u=0;u<t;u++)e[u]=arguments[u+r];switch(r){case 0:return n.call(this,e);case 1:return n.call(this,arguments[0],e);case 2:return n.call(this,arguments[0],arguments[1],e)}var o=Array(r+1);for(u=0;u<r;u++)o[u]=arguments[u];return o[r]=e,n.apply(this,o)}}function _(n){var r=typeof n;return"function"===r||"object"===r&&!!n}function w(n){return void 0===n}function A(n){return!0===n||!1===n||"[object Boolean]"===a.call(n)}function x(n){var r="[object "+n+"]";return function(n){return a.call(n)===r}}var S=x("String"),O=x("Number"),M=x("Date"),E=x("RegExp"),B=x("Error"),N=x("Symbol"),I=x("ArrayBuffer"),T=x("Function"),k=r.document&&r.document.childNodes;"function"!=typeof/./&&"object"!=typeof Int8Array&&"function"!=typeof k&&(T=function(n){return"function"==typeof n||!1});var D=T,R=x("Object"),F=l&&R(new DataView(new ArrayBuffer(8))),V="undefined"!=typeof Map&&R(new Map),P=x("DataView");var q=F?function(n){return null!=n&&D(n.getInt8)&&I(n.buffer)}:P,U=s||x("Array");function W(n,r){return null!=n&&f.call(n,r)}var z=x("Arguments");!function(){z(arguments)||(z=function(n){return W(n,"callee")})}();var L=z;function $(n){return O(n)&&y(n)}function C(n){return function(){return n}}function K(n){return function(r){var t=n(r);return"number"==typeof t&&t>=0&&t<=m}}function J(n){return function(r){return null==r?void 0:r[n]}}var G=J("byteLength"),H=K(G),Q=/\[object ((I|Ui)nt(8|16|32)|Float(32|64)|Uint8Clamped|Big(I|Ui)nt64)Array\]/;var X=c?function(n){return h?h(n)&&!q(n):H(n)&&Q.test(a.call(n))}:C(!1),Y=J("length");function Z(n,r){r=function(n){for(var r={},t=n.length,e=0;e<t;++e)r[n[e]]=!0;return{contains:function(n){return r[n]},push:function(t){return r[t]=!0,n.push(t)}}}(r);var t=b.length,u=n.constructor,o=D(u)&&u.prototype||e,i="constructor";for(W(n,i)&&!r.contains(i)&&r.push(i);t--;)(i=b[t])in n&&n[i]!==o[i]&&!r.contains(i)&&r.push(i)}function nn(n){if(!_(n))return[];if(p)return p(n);var r=[];for(var t in n)W(n,t)&&r.push(t);return g&&Z(n,r),r}function rn(n,r){var t=nn(r),e=t.length;if(null==n)return!e;for(var u=Object(n),o=0;o<e;o++){var i=t[o];if(r[i]!==u[i]||!(i in u))return!1}return!0}function tn(n){return n instanceof tn?n:this instanceof tn?void(this._wrapped=n):new tn(n)}function en(n){return new Uint8Array(n.buffer||n,n.byteOffset||0,G(n))}tn.VERSION=n,tn.prototype.value=function(){return this._wrapped},tn.prototype.valueOf=tn.prototype.toJSON=tn.prototype.value,tn.prototype.toString=function(){return String(this._wrapped)};var un="[object DataView]";function on(n,r,t,e){if(n===r)return 0!==n||1/n==1/r;if(null==n||null==r)return!1;if(n!=n)return r!=r;var o=typeof n;return("function"===o||"object"===o||"object"==typeof r)&&function n(r,t,e,o){r instanceof tn&&(r=r._wrapped);t instanceof tn&&(t=t._wrapped);var i=a.call(r);if(i!==a.call(t))return!1;if(F&&"[object Object]"==i&&q(r)){if(!q(t))return!1;i=un}switch(i){case"[object RegExp]":case"[object String]":return""+r==""+t;case"[object Number]":return+r!=+r?+t!=+t:0==+r?1/+r==1/t:+r==+t;case"[object Date]":case"[object Boolean]":return+r==+t;case"[object Symbol]":return u.valueOf.call(r)===u.valueOf.call(t);case"[object ArrayBuffer]":case un:return n(en(r),en(t),e,o)}var f="[object Array]"===i;if(!f&&X(r)){if(G(r)!==G(t))return!1;if(r.buffer===t.buffer&&r.byteOffset===t.byteOffset)return!0;f=!0}if(!f){if("object"!=typeof r||"object"!=typeof t)return!1;var c=r.constructor,l=t.constructor;if(c!==l&&!(D(c)&&c instanceof c&&D(l)&&l instanceof l)&&"constructor"in r&&"constructor"in t)return!1}o=o||[];var s=(e=e||[]).length;for(;s--;)if(e[s]===r)return o[s]===t;if(e.push(r),o.push(t),f){if((s=r.length)!==t.length)return!1;for(;s--;)if(!on(r[s],t[s],e,o))return!1}else{var p,v=nn(r);if(s=v.length,nn(t).length!==s)return!1;for(;s--;)if(p=v[s],!W(t,p)||!on(r[p],t[p],e,o))return!1}return e.pop(),o.pop(),!0}(n,r,t,e)}function an(n){if(!_(n))return[];var r=[];for(var t in n)r.push(t);return g&&Z(n,r),r}function fn(n){var r=Y(n);return function(t){if(null==t)return!1;var e=an(t);if(Y(e))return!1;for(var u=0;u<r;u++)if(!D(t[n[u]]))return!1;return n!==hn||!D(t[cn])}}var cn="forEach",ln="has",sn=["clear","delete"],pn=["get",ln,"set"],vn=sn.concat(cn,pn),hn=sn.concat(pn),yn=["add"].concat(sn,cn,ln),dn=V?fn(vn):x("Map"),gn=V?fn(hn):x("WeakMap"),bn=V?fn(yn):x("Set"),mn=x("WeakSet");function jn(n){for(var r=nn(n),t=r.length,e=Array(t),u=0;u<t;u++)e[u]=n[r[u]];return e}function _n(n){for(var r={},t=nn(n),e=0,u=t.length;e<u;e++)r[n[t[e]]]=t[e];return r}function wn(n){var r=[];for(var t in n)D(n[t])&&r.push(t);return r.sort()}function An(n,r){return function(t){var e=arguments.length;if(r&&(t=Object(t)),e<2||null==t)return t;for(var u=1;u<e;u++)for(var o=arguments[u],i=n(o),a=i.length,f=0;f<a;f++){var c=i[f];r&&void 0!==t[c]||(t[c]=o[c])}return t}}var xn=An(an),Sn=An(nn),On=An(an,!0);function Mn(n){if(!_(n))return{};if(v)return v(n);var r=function(){};r.prototype=n;var t=new r;return r.prototype=null,t}function En(n){return _(n)?U(n)?n.slice():xn({},n):n}function Bn(n){return U(n)?n:[n]}function Nn(n){return tn.toPath(n)}function In(n,r){for(var t=r.length,e=0;e<t;e++){if(null==n)return;n=n[r[e]]}return t?n:void 0}function Tn(n,r,t){var e=In(n,Nn(r));return w(e)?t:e}function kn(n){return n}function Dn(n){return n=Sn({},n),function(r){return rn(r,n)}}function Rn(n){return n=Nn(n),function(r){return In(r,n)}}function Fn(n,r,t){if(void 0===r)return n;switch(null==t?3:t){case 1:return function(t){return n.call(r,t)};case 3:return function(t,e,u){return n.call(r,t,e,u)};case 4:return function(t,e,u,o){return n.call(r,t,e,u,o)}}return function(){return n.apply(r,arguments)}}function Vn(n,r,t){return null==n?kn:D(n)?Fn(n,r,t):_(n)&&!U(n)?Dn(n):Rn(n)}function Pn(n,r){return Vn(n,r,1/0)}function qn(n,r,t){return tn.iteratee!==Pn?tn.iteratee(n,r):Vn(n,r,t)}function Un(){}function Wn(n,r){return null==r&&(r=n,n=0),n+Math.floor(Math.random()*(r-n+1))}tn.toPath=Bn,tn.iteratee=Pn;var zn=Date.now||function(){return(new Date).getTime()};function Ln(n){var r=function(r){return n[r]},t="(?:"+nn(n).join("|")+")",e=RegExp(t),u=RegExp(t,"g");return function(n){return n=null==n?"":""+n,e.test(n)?n.replace(u,r):n}}var $n={"&":"&amp;","<":"&lt;",">":"&gt;",'"':"&quot;","'":"&#x27;","`":"&#x60;"},Cn=Ln($n),Kn=Ln(_n($n)),Jn=tn.templateSettings={evaluate:/<%([\s\S]+?)%>/g,interpolate:/<%=([\s\S]+?)%>/g,escape:/<%-([\s\S]+?)%>/g},Gn=/(.)^/,Hn={"'":"'","\\":"\\","\r":"r","\n":"n","\u2028":"u2028","\u2029":"u2029"},Qn=/\\|'|\r|\n|\u2028|\u2029/g;function Xn(n){return"\\"+Hn[n]}var Yn=/^\s*(\w|\$)+\s*$/;var Zn=0;function nr(n,r,t,e,u){if(!(e instanceof r))return n.apply(t,u);var o=Mn(n.prototype),i=n.apply(o,u);return _(i)?i:o}var rr=j((function(n,r){var t=rr.placeholder,e=function(){for(var u=0,o=r.length,i=Array(o),a=0;a<o;a++)i[a]=r[a]===t?arguments[u++]:r[a];for(;u<arguments.length;)i.push(arguments[u++]);return nr(n,e,this,this,i)};return e}));rr.placeholder=tn;var tr=j((function(n,r,t){if(!D(n))throw new TypeError("Bind must be called on a function");var e=j((function(u){return nr(n,e,r,this,t.concat(u))}));return e})),er=K(Y);function ur(n,r,t,e){if(e=e||[],r||0===r){if(r<=0)return e.concat(n)}else r=1/0;for(var u=e.length,o=0,i=Y(n);o<i;o++){var a=n[o];if(er(a)&&(U(a)||L(a)))if(r>1)ur(a,r-1,t,e),u=e.length;else for(var f=0,c=a.length;f<c;)e[u++]=a[f++];else t||(e[u++]=a)}return e}var or=j((function(n,r){var t=(r=ur(r,!1,!1)).length;if(t<1)throw new Error("bindAll must be passed function names");for(;t--;){var e=r[t];n[e]=tr(n[e],n)}return n}));var ir=j((function(n,r,t){return setTimeout((function(){return n.apply(null,t)}),r)})),ar=rr(ir,tn,1);function fr(n){return function(){return!n.apply(this,arguments)}}function cr(n,r){var t;return function(){return--n>0&&(t=r.apply(this,arguments)),n<=1&&(r=null),t}}var lr=rr(cr,2);function sr(n,r,t){r=qn(r,t);for(var e,u=nn(n),o=0,i=u.length;o<i;o++)if(r(n[e=u[o]],e,n))return e}function pr(n){return function(r,t,e){t=qn(t,e);for(var u=Y(r),o=n>0?0:u-1;o>=0&&o<u;o+=n)if(t(r[o],o,r))return o;return-1}}var vr=pr(1),hr=pr(-1);function yr(n,r,t,e){for(var u=(t=qn(t,e,1))(r),o=0,i=Y(n);o<i;){var a=Math.floor((o+i)/2);t(n[a])<u?o=a+1:i=a}return o}function dr(n,r,t){return function(e,u,o){var a=0,f=Y(e);if("number"==typeof o)n>0?a=o>=0?o:Math.max(o+f,a):f=o>=0?Math.min(o+1,f):o+f+1;else if(t&&o&&f)return e[o=t(e,u)]===u?o:-1;if(u!=u)return(o=r(i.call(e,a,f),$))>=0?o+a:-1;for(o=n>0?a:f-1;o>=0&&o<f;o+=n)if(e[o]===u)return o;return-1}}var gr=dr(1,vr,yr),br=dr(-1,hr);function mr(n,r,t){var e=(er(n)?vr:sr)(n,r,t);if(void 0!==e&&-1!==e)return n[e]}function jr(n,r,t){var e,u;if(r=Fn(r,t),er(n))for(e=0,u=n.length;e<u;e++)r(n[e],e,n);else{var o=nn(n);for(e=0,u=o.length;e<u;e++)r(n[o[e]],o[e],n)}return n}function _r(n,r,t){r=qn(r,t);for(var e=!er(n)&&nn(n),u=(e||n).length,o=Array(u),i=0;i<u;i++){var a=e?e[i]:i;o[i]=r(n[a],a,n)}return o}function wr(n){var r=function(r,t,e,u){var o=!er(r)&&nn(r),i=(o||r).length,a=n>0?0:i-1;for(u||(e=r[o?o[a]:a],a+=n);a>=0&&a<i;a+=n){var f=o?o[a]:a;e=t(e,r[f],f,r)}return e};return function(n,t,e,u){var o=arguments.length>=3;return r(n,Fn(t,u,4),e,o)}}var Ar=wr(1),xr=wr(-1);function Sr(n,r,t){var e=[];return r=qn(r,t),jr(n,(function(n,t,u){r(n,t,u)&&e.push(n)})),e}function Or(n,r,t){r=qn(r,t);for(var e=!er(n)&&nn(n),u=(e||n).length,o=0;o<u;o++){var i=e?e[o]:o;if(!r(n[i],i,n))return!1}return!0}function Mr(n,r,t){r=qn(r,t);for(var e=!er(n)&&nn(n),u=(e||n).length,o=0;o<u;o++){var i=e?e[o]:o;if(r(n[i],i,n))return!0}return!1}function Er(n,r,t,e){return er(n)||(n=jn(n)),("number"!=typeof t||e)&&(t=0),gr(n,r,t)>=0}var Br=j((function(n,r,t){var e,u;return D(r)?u=r:(r=Nn(r),e=r.slice(0,-1),r=r[r.length-1]),_r(n,(function(n){var o=u;if(!o){if(e&&e.length&&(n=In(n,e)),null==n)return;o=n[r]}return null==o?o:o.apply(n,t)}))}));function Nr(n,r){return _r(n,Rn(r))}function Ir(n,r,t){var e,u,o=-1/0,i=-1/0;if(null==r||"number"==typeof r&&"object"!=typeof n[0]&&null!=n)for(var a=0,f=(n=er(n)?n:jn(n)).length;a<f;a++)null!=(e=n[a])&&e>o&&(o=e);else r=qn(r,t),jr(n,(function(n,t,e){((u=r(n,t,e))>i||u===-1/0&&o===-1/0)&&(o=n,i=u)}));return o}function Tr(n,r,t){if(null==r||t)return er(n)||(n=jn(n)),n[Wn(n.length-1)];var e=er(n)?En(n):jn(n),u=Y(e);r=Math.max(Math.min(r,u),0);for(var o=u-1,i=0;i<r;i++){var a=Wn(i,o),f=e[i];e[i]=e[a],e[a]=f}return e.slice(0,r)}function kr(n,r){return function(t,e,u){var o=r?[[],[]]:{};return e=qn(e,u),jr(t,(function(r,u){var i=e(r,u,t);n(o,r,i)})),o}}var Dr=kr((function(n,r,t){W(n,t)?n[t].push(r):n[t]=[r]})),Rr=kr((function(n,r,t){n[t]=r})),Fr=kr((function(n,r,t){W(n,t)?n[t]++:n[t]=1})),Vr=kr((function(n,r,t){n[t?0:1].push(r)}),!0),Pr=/[^\ud800-\udfff]|[\ud800-\udbff][\udc00-\udfff]|[\ud800-\udfff]/g;function qr(n,r,t){return r in t}var Ur=j((function(n,r){var t={},e=r[0];if(null==n)return t;D(e)?(r.length>1&&(e=Fn(e,r[1])),r=an(n)):(e=qr,r=ur(r,!1,!1),n=Object(n));for(var u=0,o=r.length;u<o;u++){var i=r[u],a=n[i];e(a,i,n)&&(t[i]=a)}return t})),Wr=j((function(n,r){var t,e=r[0];return D(e)?(e=fr(e),r.length>1&&(t=r[1])):(r=_r(ur(r,!1,!1),String),e=function(n,t){return!Er(r,t)}),Ur(n,e,t)}));function zr(n,r,t){return i.call(n,0,Math.max(0,n.length-(null==r||t?1:r)))}function Lr(n,r,t){return null==n||n.length<1?null==r||t?void 0:[]:null==r||t?n[0]:zr(n,n.length-r)}function $r(n,r,t){return i.call(n,null==r||t?1:r)}var Cr=j((function(n,r){return r=ur(r,!0,!0),Sr(n,(function(n){return!Er(r,n)}))})),Kr=j((function(n,r){return Cr(n,r)}));function Jr(n,r,t,e){A(r)||(e=t,t=r,r=!1),null!=t&&(t=qn(t,e));for(var u=[],o=[],i=0,a=Y(n);i<a;i++){var f=n[i],c=t?t(f,i,n):f;r&&!t?(i&&o===c||u.push(f),o=c):t?Er(o,c)||(o.push(c),u.push(f)):Er(u,f)||u.push(f)}return u}var Gr=j((function(n){return Jr(ur(n,!0,!0))}));function Hr(n){for(var r=n&&Ir(n,Y).length||0,t=Array(r),e=0;e<r;e++)t[e]=Nr(n,e);return t}var Qr=j(Hr);function Xr(n,r){return n._chain?tn(r).chain():r}function Yr(n){return jr(wn(n),(function(r){var t=tn[r]=n[r];tn.prototype[r]=function(){var n=[this._wrapped];return o.apply(n,arguments),Xr(this,t.apply(tn,n))}})),tn}jr(["pop","push","reverse","shift","sort","splice","unshift"],(function(n){var r=t[n];tn.prototype[n]=function(){var t=this._wrapped;return null!=t&&(r.apply(t,arguments),"shift"!==n&&"splice"!==n||0!==t.length||delete t[0]),Xr(this,t)}})),jr(["concat","join","slice"],(function(n){var r=t[n];tn.prototype[n]=function(){var n=this._wrapped;return null!=n&&(n=r.apply(n,arguments)),Xr(this,n)}}));var Zr=Yr({__proto__:null,VERSION:n,restArguments:j,isObject:_,isNull:function(n){return null===n},isUndefined:w,isBoolean:A,isElement:function(n){return!(!n||1!==n.nodeType)},isString:S,isNumber:O,isDate:M,isRegExp:E,isError:B,isSymbol:N,isArrayBuffer:I,isDataView:q,isArray:U,isFunction:D,isArguments:L,isFinite:function(n){return!N(n)&&d(n)&&!isNaN(parseFloat(n))},isNaN:$,isTypedArray:X,isEmpty:function(n){if(null==n)return!0;var r=Y(n);return"number"==typeof r&&(U(n)||S(n)||L(n))?0===r:0===Y(nn(n))},isMatch:rn,isEqual:function(n,r){return on(n,r)},isMap:dn,isWeakMap:gn,isSet:bn,isWeakSet:mn,keys:nn,allKeys:an,values:jn,pairs:function(n){for(var r=nn(n),t=r.length,e=Array(t),u=0;u<t;u++)e[u]=[r[u],n[r[u]]];return e},invert:_n,functions:wn,methods:wn,extend:xn,extendOwn:Sn,assign:Sn,defaults:On,create:function(n,r){var t=Mn(n);return r&&Sn(t,r),t},clone:En,tap:function(n,r){return r(n),n},get:Tn,has:function(n,r){for(var t=(r=Nn(r)).length,e=0;e<t;e++){var u=r[e];if(!W(n,u))return!1;n=n[u]}return!!t},mapObject:function(n,r,t){r=qn(r,t);for(var e=nn(n),u=e.length,o={},i=0;i<u;i++){var a=e[i];o[a]=r(n[a],a,n)}return o},identity:kn,constant:C,noop:Un,toPath:Bn,property:Rn,propertyOf:function(n){return null==n?Un:function(r){return Tn(n,r)}},matcher:Dn,matches:Dn,times:function(n,r,t){var e=Array(Math.max(0,n));r=Fn(r,t,1);for(var u=0;u<n;u++)e[u]=r(u);return e},random:Wn,now:zn,escape:Cn,unescape:Kn,templateSettings:Jn,template:function(n,r,t){!r&&t&&(r=t),r=On({},r,tn.templateSettings);var e=RegExp([(r.escape||Gn).source,(r.interpolate||Gn).source,(r.evaluate||Gn).source].join("|")+"|$","g"),u=0,o="__p+='";n.replace(e,(function(r,t,e,i,a){return o+=n.slice(u,a).replace(Qn,Xn),u=a+r.length,t?o+="'+\n((__t=("+t+"))==null?'':_.escape(__t))+\n'":e?o+="'+\n((__t=("+e+"))==null?'':__t)+\n'":i&&(o+="';\n"+i+"\n__p+='"),r})),o+="';\n";var i,a=r.variable;if(a){if(!Yn.test(a))throw new Error("variable is not a bare identifier: "+a)}else o="with(obj||{}){\n"+o+"}\n",a="obj";o="var __t,__p='',__j=Array.prototype.join,"+"print=function(){__p+=__j.call(arguments,'');};\n"+o+"return __p;\n";try{i=new Function(a,"_",o)}catch(n){throw n.source=o,n}var f=function(n){return i.call(this,n,tn)};return f.source="function("+a+"){\n"+o+"}",f},result:function(n,r,t){var e=(r=Nn(r)).length;if(!e)return D(t)?t.call(n):t;for(var u=0;u<e;u++){var o=null==n?void 0:n[r[u]];void 0===o&&(o=t,u=e),n=D(o)?o.call(n):o}return n},uniqueId:function(n){var r=++Zn+"";return n?n+r:r},chain:function(n){var r=tn(n);return r._chain=!0,r},iteratee:Pn,partial:rr,bind:tr,bindAll:or,memoize:function(n,r){var t=function(e){var u=t.cache,o=""+(r?r.apply(this,arguments):e);return W(u,o)||(u[o]=n.apply(this,arguments)),u[o]};return t.cache={},t},delay:ir,defer:ar,throttle:function(n,r,t){var e,u,o,i,a=0;t||(t={});var f=function(){a=!1===t.leading?0:zn(),e=null,i=n.apply(u,o),e||(u=o=null)},c=function(){var c=zn();a||!1!==t.leading||(a=c);var l=r-(c-a);return u=this,o=arguments,l<=0||l>r?(e&&(clearTimeout(e),e=null),a=c,i=n.apply(u,o),e||(u=o=null)):e||!1===t.trailing||(e=setTimeout(f,l)),i};return c.cancel=function(){clearTimeout(e),a=0,e=u=o=null},c},debounce:function(n,r,t){var e,u,o,i,a,f=function(){var c=zn()-u;r>c?e=setTimeout(f,r-c):(e=null,t||(i=n.apply(a,o)),e||(o=a=null))},c=j((function(c){return a=this,o=c,u=zn(),e||(e=setTimeout(f,r),t&&(i=n.apply(a,o))),i}));return c.cancel=function(){clearTimeout(e),e=o=a=null},c},wrap:function(n,r){return rr(r,n)},negate:fr,compose:function(){var n=arguments,r=n.length-1;return function(){for(var t=r,e=n[r].apply(this,arguments);t--;)e=n[t].call(this,e);return e}},after:function(n,r){return function(){if(--n<1)return r.apply(this,arguments)}},before:cr,once:lr,findKey:sr,findIndex:vr,findLastIndex:hr,sortedIndex:yr,indexOf:gr,lastIndexOf:br,find:mr,detect:mr,findWhere:function(n,r){return mr(n,Dn(r))},each:jr,forEach:jr,map:_r,collect:_r,reduce:Ar,foldl:Ar,inject:Ar,reduceRight:xr,foldr:xr,filter:Sr,select:Sr,reject:function(n,r,t){return Sr(n,fr(qn(r)),t)},every:Or,all:Or,some:Mr,any:Mr,contains:Er,includes:Er,include:Er,invoke:Br,pluck:Nr,where:function(n,r){return Sr(n,Dn(r))},max:Ir,min:function(n,r,t){var e,u,o=1/0,i=1/0;if(null==r||"number"==typeof r&&"object"!=typeof n[0]&&null!=n)for(var a=0,f=(n=er(n)?n:jn(n)).length;a<f;a++)null!=(e=n[a])&&e<o&&(o=e);else r=qn(r,t),jr(n,(function(n,t,e){((u=r(n,t,e))<i||u===1/0&&o===1/0)&&(o=n,i=u)}));return o},shuffle:function(n){return Tr(n,1/0)},sample:Tr,sortBy:function(n,r,t){var e=0;return r=qn(r,t),Nr(_r(n,(function(n,t,u){return{value:n,index:e++,criteria:r(n,t,u)}})).sort((function(n,r){var t=n.criteria,e=r.criteria;if(t!==e){if(t>e||void 0===t)return 1;if(t<e||void 0===e)return-1}return n.index-r.index})),"value")},groupBy:Dr,indexBy:Rr,countBy:Fr,partition:Vr,toArray:function(n){return n?U(n)?i.call(n):S(n)?n.match(Pr):er(n)?_r(n,kn):jn(n):[]},size:function(n){return null==n?0:er(n)?n.length:nn(n).length},pick:Ur,omit:Wr,first:Lr,head:Lr,take:Lr,initial:zr,last:function(n,r,t){return null==n||n.length<1?null==r||t?void 0:[]:null==r||t?n[n.length-1]:$r(n,Math.max(0,n.length-r))},rest:$r,tail:$r,drop:$r,compact:function(n){return Sr(n,Boolean)},flatten:function(n,r){return ur(n,r,!1)},without:Kr,uniq:Jr,unique:Jr,union:Gr,intersection:function(n){for(var r=[],t=arguments.length,e=0,u=Y(n);e<u;e++){var o=n[e];if(!Er(r,o)){var i;for(i=1;i<t&&Er(arguments[i],o);i++);i===t&&r.push(o)}}return r},difference:Cr,unzip:Hr,transpose:Hr,zip:Qr,object:function(n,r){for(var t={},e=0,u=Y(n);e<u;e++)r?t[n[e]]=r[e]:t[n[e][0]]=n[e][1];return t},range:function(n,r,t){null==r&&(r=n||0,n=0),t||(t=r<n?-1:1);for(var e=Math.max(Math.ceil((r-n)/t),0),u=Array(e),o=0;o<e;o++,n+=t)u[o]=n;return u},chunk:function(n,r){if(null==r||r<1)return[];for(var t=[],e=0,u=n.length;e<u;)t.push(i.call(n,e,e+=r));return t},mixin:Yr,default:tn});return Zr._=Zr,Zr}));
\ No newline at end of file
+(function (global, factory) {
+  typeof exports === 'object' && typeof module !== 'undefined' ? module.exports = factory() :
+  typeof define === 'function' && define.amd ? define('underscore', factory) :
+  (global = typeof globalThis !== 'undefined' ? globalThis : global || self, (function () {
+    var current = global._;
+    var exports = global._ = factory();
+    exports.noConflict = function () { global._ = current; return exports; };
+  }()));
+}(this, (function () {
+  //     Underscore.js 1.13.2
+  //     https://underscorejs.org
+  //     (c) 2009-2021 Jeremy Ashkenas, Julian Gonggrijp, and DocumentCloud and Investigative Reporters & Editors
+  //     Underscore may be freely distributed under the MIT license.
+
+  // Current version.
+  var VERSION = '1.13.2';
+
+  // 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 == 'object' && self.self === self && self ||
+            typeof global == 'object' && global.global === global && global ||
+            Function('return this')() ||
+            {};
+
+  // Save bytes in the minified (but not gzipped) version:
+  var ArrayProto = Array.prototype, ObjProto = Object.prototype;
+  var SymbolProto = typeof Symbol !== 'undefined' ? 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 !== 'undefined',
+      supportsDataView = typeof DataView !== 'undefined';
+
+  // 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 && ArrayBuffer.isView;
+
+  // Create references to these builtin functions because we override them.
+  var _isNaN = isNaN,
+      _isFinite = isFinite;
+
+  // Keys in IE < 9 that won't be iterated by `for key in ...` and thus missed.
+  var hasEnumBug = !{toString: null}.propertyIsEnumerable('toString');
+  var nonEnumerableProps = ['valueOf', 'isPrototypeOf', 'toString',
+    'propertyIsEnumerable', 'hasOwnProperty', 'toLocaleString'];
+
+  // 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 "rest parameter".
+  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 < 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 < 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 === 'function' || type === 'object' && !!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) === '[object Boolean]';
+  }
+
+  // Is a given value a DOM element?
+  function isElement(obj) {
+    return !!(obj && obj.nodeType === 1);
+  }
+
+  // Internal function for creating a `toString`-based type tester.
+  function tagTester(name) {
+    var tag = '[object ' + name + ']';
+    return function(obj) {
+      return toString.call(obj) === tag;
+    };
+  }
+
+  var isString = tagTester('String');
+
+  var isNumber = tagTester('Number');
+
+  var isDate = tagTester('Date');
+
+  var isRegExp = tagTester('RegExp');
+
+  var isError = tagTester('Error');
+
+  var isSymbol = tagTester('Symbol');
+
+  var isArrayBuffer = tagTester('ArrayBuffer');
+
+  var isFunction = tagTester('Function');
+
+  // 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 && root.document.childNodes;
+  if (typeof /./ != 'function' && typeof Int8Array != 'object' && typeof nodelist != 'function') {
+    isFunction = function(obj) {
+      return typeof obj == 'function' || false;
+    };
+  }
+
+  var isFunction$1 = isFunction;
+
+  var hasObjectTag = tagTester('Object');
+
+  // In IE 10 - Edge 13, `DataView` has string tag `'[object Object]'`.
+  // In IE 11, the most common among them, this problem also applies to
+  // `Map`, `WeakMap` and `Set`.
+  var hasStringTagBug = (
+        supportsDataView && hasObjectTag(new DataView(new ArrayBuffer(8)))
+      ),
+      isIE11 = (typeof Map !== 'undefined' && hasObjectTag(new Map));
+
+  var isDataView = tagTester('DataView');
+
+  // In IE 10 - Edge 13, we need a different heuristic
+  // to determine whether an object is a `DataView`.
+  function ie10IsDataView(obj) {
+    return obj != null && isFunction$1(obj.getInt8) && isArrayBuffer(obj.buffer);
+  }
+
+  var isDataView$1 = (hasStringTagBug ? ie10IsDataView : isDataView);
+
+  // Is a given value an array?
+  // Delegates to ECMA5's native `Array.isArray`.
+  var isArray = nativeIsArray || tagTester('Array');
+
+  // Internal function to check whether `key` is an own property name of `obj`.
+  function has$1(obj, key) {
+    return obj != null && hasOwnProperty.call(obj, key);
+  }
+
+  var isArguments = tagTester('Arguments');
+
+  // Define a fallback version of the method in browsers (ahem, IE < 9), where
+  // there isn't any inspectable "Arguments" type.
+  (function() {
+    if (!isArguments(arguments)) {
+      isArguments = function(obj) {
+        return has$1(obj, 'callee');
+      };
+    }
+  }());
+
+  var isArguments$1 = isArguments;
+
+  // Is a given object a finite number?
+  function isFinite$1(obj) {
+    return !isSymbol(obj) && _isFinite(obj) && !isNaN(parseFloat(obj));
+  }
+
+  // Is the given value `NaN`?
+  function isNaN$1(obj) {
+    return isNumber(obj) && _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 == 'number' && sizeProperty >= 0 && sizeProperty <= 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('byteLength');
+
+  // 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) && !isDataView$1(obj)) :
+                  isBufferLike(obj) && 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('length');
+
+  // 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 < 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 < 9 that won'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) && constructor.prototype || ObjProto;
+
+    // Constructor is a special case.
+    var prop = 'constructor';
+    if (has$1(obj, prop) && !keys.contains(prop)) keys.push(prop);
+
+    while (nonEnumIdx--) {
+      prop = nonEnumerableProps[nonEnumIdx];
+      if (prop in obj && obj[prop] !== proto[prop] && !keys.contains(prop)) {
+        keys.push(prop);
+      }
+    }
+  }
+
+  // Retrieve the names of an object's own properties.
+  // Delegates to **ECMAScript 5**'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 < 9.
+    if (hasEnumBug) collectNonEnumProps(obj, keys);
+    return keys;
+  }
+
+  // Is a given array, string, or object empty?
+  // An "empty" 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 == 'number' && (
+      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 < 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 = '[object DataView]';
+
+  // Internal recursive comparison function for `_.isEqual`.
+  function eq(a, b, aStack, bStack) {
+    // Identical objects are equal. `0 === -0`, but they aren't identical.
+    // See the [Harmony `egal` proposal](https://wiki.ecmascript.org/doku.php?id=harmony:egal).
+    if (a === b) return a !== 0 || 1 / a === 1 / b;
+    // `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) return b !== b;
+    // Exhaust primitive checks
+    var type = typeof a;
+    if (type !== 'function' && type !== 'object' && typeof b != 'object') return false;
+    return deepEq(a, b, aStack, bStack);
+  }
+
+  // Internal recursive comparison function for `_.isEqual`.
+  function deepEq(a, b, aStack, bStack) {
+    // 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 (hasStringTagBug && className == '[object Object]' && isDataView$1(a)) {
+      if (!isDataView$1(b)) return false;
+      className = tagDataView;
+    }
+    switch (className) {
+      // These types are compared by value.
+      case '[object RegExp]':
+        // RegExps are coerced to strings for comparison (Note: '' + /a/i === '/a/i')
+      case '[object String]':
+        // Primitives and their corresponding object wrappers are equivalent; thus, `"5"` is
+        // equivalent to `new String("5")`.
+        return '' + a === '' + b;
+      case '[object Number]':
+        // `NaN`s are equivalent, but non-reflexive.
+        // Object(NaN) is equivalent to NaN.
+        if (+a !== +a) return +b !== +b;
+        // An `egal` comparison is performed for other numeric values.
+        return +a === 0 ? 1 / +a === 1 / b : +a === +b;
+      case '[object Date]':
+      case '[object Boolean]':
+        // 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.
+        return +a === +b;
+      case '[object Symbol]':
+        return SymbolProto.valueOf.call(a) === SymbolProto.valueOf.call(b);
+      case '[object ArrayBuffer]':
+      case tagDataView:
+        // Coerce to typed array so we can fall through.
+        return deepEq(toBufferView(a), toBufferView(b), aStack, bStack);
+    }
+
+    var areArrays = className === '[object Array]';
+    if (!areArrays && isTypedArray$1(a)) {
+        var byteLength = getByteLength(a);
+        if (byteLength !== getByteLength(b)) return false;
+        if (a.buffer === b.buffer && a.byteOffset === b.byteOffset) return true;
+        areArrays = true;
+    }
+    if (!areArrays) {
+      if (typeof a != 'object' || typeof b != 'object') 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 && !(isFunction$1(aCtor) && aCtor instanceof aCtor &&
+                               isFunction$1(bCtor) && bCtor instanceof bCtor)
+                          && ('constructor' in a && 'constructor' 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`.
+
+    // Initializing stack of traversed objects.
+    // It's done here since we only need them for objects and arrays comparison.
+    aStack = aStack || [];
+    bStack = bStack || [];
+    var length = aStack.length;
+    while (length--) {
+      // Linear search. Performance is inversely proportional to the number of
+      // unique nested structures.
+      if (aStack[length] === a) return bStack[length] === b;
+    }
+
+    // Add the first object to the stack of traversed objects.
+    aStack.push(a);
+    bStack.push(b);
+
+    // 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--) {
+        if (!eq(a[length], b[length], aStack, bStack)) return false;
+      }
+    } 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) && eq(a[key], b[key], aStack, bStack))) return false;
+      }
+    }
+    // Remove the first object from the stack of traversed objects.
+    aStack.pop();
+    bStack.pop();
+    return true;
+  }
+
+  // Perform a deep comparison to check if two objects are equal.
+  function isEqual(a, b) {
+    return eq(a, b);
+  }
+
+  // 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 < 9.
+    if (hasEnumBug) collectNonEnumProps(obj, keys);
+    return keys;
+  }
+
+  // Since the regular `Object.prototype.toString` type tests don't work for
+  // some types in IE 11, we use a fingerprinting heuristic instead, based
+  // on the methods. It's not great, but it'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 < length; i++) {
+        if (!isFunction$1(obj[methods[i]])) return false;
+      }
+      // If we are testing against `WeakMap`, we need to ensure that
+      // `obj` doesn'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 = 'forEach',
+      hasName = 'has',
+      commonInit = ['clear', 'delete'],
+      mapTail = ['get', hasName, 'set'];
+
+  // `Map`, `WeakMap` and `Set` each have slightly different
+  // combinations of the above sublists.
+  var mapMethods = commonInit.concat(forEachName, mapTail),
+      weakMapMethods = commonInit.concat(mapTail),
+      setMethods = ['add'].concat(commonInit, forEachName, hasName);
+
+  var isMap = isIE11 ? ie11fingerprint(mapMethods) : tagTester('Map');
+
+  var isWeakMap = isIE11 ? ie11fingerprint(weakMapMethods) : tagTester('WeakMap');
+
+  var isSet = isIE11 ? ie11fingerprint(setMethods) : tagTester('Set');
+
+  var isWeakSet = tagTester('WeakSet');
+
+  // Retrieve the values of an object's properties.
+  function values(obj) {
+    var _keys = keys(obj);
+    var length = _keys.length;
+    var values = Array(length);
+    for (var i = 0; i < 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 < 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 < 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 < 2 || obj == null) return obj;
+      for (var index = 1; index < length; index++) {
+        var source = arguments[index],
+            keys = keysFunc(source),
+            l = keys.length;
+        for (var i = 0; i < 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 "tap into" 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 < 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 < 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) && !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 < 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 < 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 = '(?:' + keys(map).join('|') + ')';
+    var testRegexp = RegExp(source);
+    var replaceRegexp = RegExp(source, 'g');
+    return function(string) {
+      string = string == null ? '' : '' + string;
+      return testRegexp.test(string) ? string.replace(replaceRegexp, escaper) : string;
+    };
+  }
+
+  // Internal list of HTML entities for escaping.
+  var escapeMap = {
+    '&': '&amp;',
+    '<': '&lt;',
+    '>': '&gt;',
+    '"': '&quot;',
+    "'": '&#x27;',
+    '`': '&#x60;'
+  };
+
+  // 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: /<%([\s\S]+?)%>/g,
+    interpolate: /<%=([\s\S]+?)%>/g,
+    escape: /<%-([\s\S]+?)%>/g
+  };
+
+  // When customizing `_.templateSettings`, if you don'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 = {
+    "'": "'",
+    '\\': '\\',
+    '\r': 'r',
+    '\n': 'n',
+    '\u2028': 'u2028',
+    '\u2029': 'u2029'
+  };
+
+  var escapeRegExp = /\\|'|\r|\n|\u2028|\u2029/g;
+
+  function escapeChar(match) {
+    return '\\' + 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'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 && 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('|') + '|$', 'g');
+
+    // Compile the template source, escaping string literals appropriately.
+    var index = 0;
+    var source = "__p+='";
+    text.replace(matcher, function(match, escape, interpolate, evaluate, offset) {
+      source += text.slice(index, offset).replace(escapeRegExp, escapeChar);
+      index = offset + match.length;
+
+      if (escape) {
+        source += "'+\n((__t=(" + escape + "))==null?'':_.escape(__t))+\n'";
+      } else if (interpolate) {
+        source += "'+\n((__t=(" + interpolate + "))==null?'':__t)+\n'";
+      } else if (evaluate) {
+        source += "';\n" + evaluate + "\n__p+='";
+      }
+
+      // Adobe VMs need the match returned to produce the correct offset.
+      return match;
+    });
+    source += "';\n";
+
+    var argument = settings.variable;
+    if (argument) {
+      // Insure against third-party code injection. (CVE-2021-23358)
+      if (!bareIdentifier.test(argument)) throw new Error(
+        'variable is not a bare identifier: ' + argument
+      );
+    } else {
+      // If a variable is not specified, place data values in local scope.
+      source = 'with(obj||{}){\n' + source + '}\n';
+      argument = 'obj';
+    }
+
+    source = "var __t,__p='',__j=Array.prototype.join," +
+      "print=function(){__p+=__j.call(arguments,'');};\n" +
+      source + 'return __p;\n';
+
+    var render;
+    try {
+      render = new Function(argument, '_', 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 = 'function(' + argument + '){\n' + source + '}';
+
+    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 < length; i++) {
+      var prop = obj == null ? void 0 : obj[path[i]];
+      if (prop === void 0) {
+        prop = fallback;
+        i = length; // Ensure we don'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 + '';
+    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 < length; i++) {
+        args[i] = boundArgs[i] === placeholder ? arguments[position++] : boundArgs[i];
+      }
+      while (position < 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('Bind must be called on a function');
+    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, output) {
+    output = output || [];
+    if (!depth && depth !== 0) {
+      depth = Infinity;
+    } else if (depth <= 0) {
+      return output.concat(input);
+    }
+    var idx = output.length;
+    for (var i = 0, length = getLength(input); i < length; i++) {
+      var value = input[i];
+      if (isArrayLike(value) && (isArray(value) || isArguments$1(value))) {
+        // Flatten current level of array or arguments object.
+        if (depth > 1) {
+          flatten$1(value, depth - 1, strict, output);
+          idx = output.length;
+        } else {
+          var j = 0, len = value.length;
+          while (j < len) output[idx++] = value[j++];
+        }
+      } else if (!strict) {
+        output[idx++] = value;
+      }
+    }
+    return output;
+  }
+
+  // Bind a number of an object'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 < 1) throw new Error('bindAll must be passed function names');
+    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 = '' + (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'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 && options.leading === false) previous = _now;
+      var remaining = wait - (_now - previous);
+      context = this;
+      args = arguments;
+      if (remaining <= 0 || remaining > wait) {
+        if (timeout) {
+          clearTimeout(timeout);
+          timeout = null;
+        }
+        previous = _now;
+        result = func.apply(context, args);
+        if (!timeout) context = args = null;
+      } else if (!timeout && 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 > 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 < 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 > 0) {
+        memo = func.apply(this, arguments);
+      }
+      if (times <= 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 < 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 > 0 ? 0 : length - 1;
+      for (; index >= 0 && index < 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 < high) {
+      var mid = Math.floor((low + high) / 2);
+      if (iteratee(array[mid]) < 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 == 'number') {
+        if (dir > 0) {
+          i = idx >= 0 ? idx : Math.max(idx + length, i);
+        } else {
+          length = idx >= 0 ? Math.min(idx + 1, length) : idx + length + 1;
+        }
+      } else if (sortedIndex && idx && 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 >= 0 ? idx + i : -1;
+      }
+      for (idx = dir > 0 ? i : length - 1; idx >= 0 && idx < 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 && 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 < length; i++) {
+        iteratee(obj[i], i, obj);
+      }
+    } else {
+      var _keys = keys(obj);
+      for (i = 0, length = _keys.length; i < 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) && keys(obj),
+        length = (_keys || obj).length,
+        results = Array(length);
+    for (var index = 0; index < 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) && keys(obj),
+          length = (_keys || obj).length,
+          index = dir > 0 ? 0 : length - 1;
+      if (!initial) {
+        memo = obj[_keys ? _keys[index] : index];
+        index += dir;
+      }
+      for (; index >= 0 && index < 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 >= 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) && keys(obj),
+        length = (_keys || obj).length;
+    for (var index = 0; index < 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) && keys(obj),
+        length = (_keys || obj).length;
+    for (var index = 0; index < 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 != 'number' || guard) fromIndex = 0;
+    return indexOf(obj, item, fromIndex) >= 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 && 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 == 'number' && typeof obj[0] != 'object' && obj != null) {
+      obj = isArrayLike(obj) ? obj : values(obj);
+      for (var i = 0, length = obj.length; i < length; i++) {
+        value = obj[i];
+        if (value != null && value > result) {
+          result = value;
+        }
+      }
+    } else {
+      iteratee = cb(iteratee, context);
+      each(obj, function(v, index, list) {
+        computed = iteratee(v, index, list);
+        if (computed > lastComputed || computed === -Infinity && 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 == 'number' && typeof obj[0] != 'object' && obj != null) {
+      obj = isArrayLike(obj) ? obj : values(obj);
+      for (var i = 0, length = obj.length; i < length; i++) {
+        value = obj[i];
+        if (value != null && value < result) {
+          result = value;
+        }
+      }
+    } else {
+      iteratee = cb(iteratee, context);
+      each(obj, function(v, index, list) {
+        computed = iteratee(v, index, list);
+        if (computed < lastComputed || computed === Infinity && 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 < 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'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 > b || a === void 0) return 1;
+        if (a < b || b === void 0) return -1;
+      }
+      return left.index - right.index;
+    }), 'value');
+  }
+
+  // An internal function used for aggregate "group by" 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'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'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 > 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 < 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 > 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 < 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 < 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 < length; i++) {
+      var value = array[i],
+          computed = iteratee ? iteratee(value, i, array) : value;
+      if (isSorted && !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 < length; i++) {
+      var item = array[i];
+      if (contains(result, item)) continue;
+      var j;
+      for (j = 1; j < 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's elements on shared indices.
+  function unzip(array) {
+    var length = array && max(array, getLength).length || 0;
+    var result = Array(length);
+
+    for (var index = 0; index < 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 < 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 < start ? -1 : 1;
+    }
+
+    var length = Math.max(Math.ceil((stop - start) / step), 0);
+    var range = Array(length);
+
+    for (var idx = 0; idx < 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 < 1) return [];
+    var result = [];
+    var i = 0, length = array.length;
+    while (i < 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(['pop', 'push', 'reverse', 'shift', 'sort', 'splice', 'unshift'], function(name) {
+    var method = ArrayProto[name];
+    _$1.prototype[name] = function() {
+      var obj = this._wrapped;
+      if (obj != null) {
+        method.apply(obj, arguments);
+        if ((name === 'shift' || name === 'splice') && obj.length === 0) {
+          delete obj[0];
+        }
+      }
+      return chainResult(this, obj);
+    };
+  });
+
+  // Add all accessor `Array` functions to the wrapper.
+  each(['concat', 'join', 'slice'], 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,
+    'default': _$1
+  };
+
+  // Default Export
+
+  // Add all of the Underscore functions to the wrapper object.
+  var _ = mixin(allExports);
+  // Legacy Node.js API.
+  _._ = _;
+
+  return _;
+
+})));
+//# sourceMappingURL=underscore-umd.js.map
diff --git a/docs/RefMan/_build/html/genindex.html b/docs/RefMan/_build/html/genindex.html
index c0821d5c8..148858836 100644
--- a/docs/RefMan/_build/html/genindex.html
+++ b/docs/RefMan/_build/html/genindex.html
@@ -13,7 +13,6 @@
         <script data-url_root="./" id="documentation_options" src="_static/documentation_options.js"></script>
         <script src="_static/jquery.js"></script>
         <script src="_static/underscore.js"></script>
-        <script src="_static/_sphinx_javascript_frameworks_compat.js"></script>
         <script src="_static/doctools.js"></script>
     <script src="_static/js/theme.js"></script>
     <link rel="index" title="Index" href="#" />
diff --git a/docs/RefMan/_build/html/search.html b/docs/RefMan/_build/html/search.html
index 171f62c6a..c6df46639 100644
--- a/docs/RefMan/_build/html/search.html
+++ b/docs/RefMan/_build/html/search.html
@@ -14,7 +14,6 @@
         <script data-url_root="./" id="documentation_options" src="_static/documentation_options.js"></script>
         <script src="_static/jquery.js"></script>
         <script src="_static/underscore.js"></script>
-        <script src="_static/_sphinx_javascript_frameworks_compat.js"></script>
         <script src="_static/doctools.js"></script>
     <script src="_static/js/theme.js"></script>
     <script src="_static/searchtools.js"></script>
diff --git a/docs/RefMan/_build/html/searchindex.js b/docs/RefMan/_build/html/searchindex.js
index 3d37d72c7..4192636ac 100644
--- a/docs/RefMan/_build/html/searchindex.js
+++ b/docs/RefMan/_build/html/searchindex.js
@@ -1 +1 @@
-Search.setIndex({"docnames": ["BasicSyntax", "BasicTypes", "Expressions", "FFI", "Modules", "OverloadedOperations", "RefMan", "TypeDeclarations"], "filenames": ["BasicSyntax.rst", "BasicTypes.rst", "Expressions.rst", "FFI.rst", "Modules.rst", "OverloadedOperations.rst", "RefMan.rst", "TypeDeclarations.rst"], "titles": ["Basic Syntax", "Basic Types", "Expressions", "Foreign Function Interface", "Modules", "Overloaded Operations", "Cryptol Reference Manual", "Type Declarations"], "terms": {"f": [0, 1, 2, 3, 4], "x": [0, 1, 2, 3, 4, 7], "y": [0, 1, 2, 3, 4], "z": [0, 2, 4], "g": [0, 2, 4], "b": [0, 3, 4, 5, 7], "fin": [0, 3, 4], "group": [0, 4, 7], "ar": [0, 1, 2, 3, 4, 7], "organ": 0, "base": [0, 2], "indent": [0, 4], "same": [0, 1, 3, 4, 7], "belong": 0, "line": [0, 4, 7], "text": 0, "more": [0, 4], "than": [0, 3, 4], "begin": 0, "while": [0, 1, 3], "less": 0, "termin": 0, "consid": [0, 4, 7], "exampl": [0, 1, 2, 4, 6], "follow": [0, 1, 2, 3, 4], "cryptol": [0, 2, 4], "where": [0, 1, 2, 3, 4], "thi": [0, 1, 2, 3, 4], "ha": [0, 1, 2, 3], "two": [0, 1, 2, 4, 7], "one": [0, 2, 3, 4], "all": [0, 2, 3, 4, 7], "between": [0, 6], "The": [0, 1, 2, 3, 4], "principl": 0, "appli": [0, 3], "block": [0, 6], "which": [0, 2, 3, 4, 7], "defin": [0, 1, 3, 4, 7], "local": [0, 4, 6], "name": [0, 1, 3, 6, 7], "support": [0, 4, 6], "start": [0, 1], "end": [0, 4], "mai": [0, 1, 2, 3, 4, 7], "nest": [0, 1, 3, 6], "arbitrarili": 0, "i": [0, 1, 2, 3, 4, 7], "document": [0, 4], "consist": 0, "charact": 0, "first": [0, 1, 3, 4], "must": [0, 3, 4], "either": [0, 3, 4], "an": [0, 1, 2, 3, 6], "english": 0, "letter": 0, "underscor": 0, "_": [0, 1], "decim": 0, "digit": 0, "prime": 0, "some": [0, 4], "have": [0, 1, 2, 3, 4, 7], "special": 0, "mean": [0, 3], "languag": [0, 3], "so": [0, 1, 2, 3, 4], "thei": [0, 1, 3, 4, 7], "us": [0, 1, 2, 3, 4, 7], "programm": 0, "see": [0, 4], "name1": 0, "longer_nam": 0, "name2": 0, "longernam": 0, "extern": 0, "includ": 0, "interfac": [0, 6], "paramet": [0, 2, 6], "properti": 0, "hide": [0, 6], "infix": [0, 6], "let": [0, 3], "pragma": 0, "submodul": [0, 4], "els": [0, 2, 4], "constraint": [0, 6], "infixl": 0, "modul": [0, 3, 6], "primit": 0, "down": [0, 1], "import": [0, 1, 2, 6], "infixr": 0, "newtyp": [0, 4, 6], "privat": [0, 6], "tabl": [0, 3], "contain": [0, 1, 3, 4], "": [0, 2, 3, 4], "associ": 0, "lowest": 0, "highest": 0, "last": [0, 2, 3], "right": [0, 1], "left": [0, 1], "unari": [0, 2], "varieti": 0, "allow": [0, 3, 4, 7], "comput": [0, 1], "specifi": [0, 2, 4], "size": [0, 1, 3], "sequenc": [0, 6], "addit": [0, 4], "subtract": 0, "multipl": [0, 1, 2, 3, 4], "divis": [0, 6], "ceil": [0, 5], "round": [0, 6], "up": [0, 3], "modulu": 0, "pad": [0, 3], "exponenti": 0, "lg2": 0, "logarithm": 0, "2": [0, 1, 2, 3, 4, 7], "width": [0, 4], "bit": [0, 1, 2, 4, 5, 6], "equal": [0, 1, 6, 7], "n": [0, 1, 3, 4], "1": [0, 1, 2, 3, 4, 7], "max": [0, 5], "maximum": 0, "min": [0, 5], "minimum": 0, "written": [0, 1, 2, 3, 7], "binari": [0, 3], "octal": 0, "hexadecim": 0, "notat": [0, 1, 2, 4], "determin": [0, 1], "its": [0, 3, 4], "prefix": [0, 4, 6], "0b": 0, "0o": 0, "0x": 0, "254": 0, "0254": 0, "0b11111110": 0, "0o376": 0, "0xfe": 0, "result": [0, 1, 2, 4], "fix": [0, 1, 3], "length": [0, 1], "e": [0, 1, 4, 5], "number": [0, 1, 2, 3], "overload": [0, 6], "infer": [0, 2], "from": [0, 1, 2, 3, 4], "context": [0, 2], "0b1010": 0, "4": [0, 3], "0o1234": 0, "12": [0, 4], "3": [0, 1, 2, 4, 7], "0x1234": 0, "16": [0, 3], "10": [0, 1, 3, 4], "integ": [0, 2, 5, 7], "also": [0, 1, 3, 4], "polynomi": 0, "write": [0, 1, 3], "express": [0, 1, 4, 6, 7], "term": 0, "open": 0, "close": 0, "degre": 0, "6": [0, 7], "7": [0, 2, 4], "0b1010111": 0, "5": [0, 1, 2, 4], "0b11010": 0, "fraction": 0, "ox": 0, "A": [0, 1, 3, 4, 7], "option": [0, 7], "expon": 0, "mark": 0, "symbol": [0, 3, 4], "p": [0, 1, 4], "2e3": 0, "0x30": 0, "64": [0, 3], "1p4": 0, "ration": 0, "float": [0, 6], "famili": 0, "cannot": [0, 2], "repres": 0, "precis": 0, "Such": [0, 4], "reject": 0, "static": [0, 3], "when": [0, 1, 2, 3, 4], "closest": 0, "represent": [0, 3], "even": [0, 7], "effect": 0, "valu": [0, 1, 4, 6, 7], "improv": [0, 3], "readabl": [0, 3], "here": [0, 2, 4], "0b_0000_0010": 0, "0x_ffff_ffea": 0, "packag": 1, "togeth": [1, 4], "enclos": [1, 4], "parenthes": 1, "curli": 1, "brace": 1, "compon": [1, 3], "both": [1, 4], "separ": [1, 4], "comma": 1, "label": 1, "sign": [1, 6], "identifi": [1, 4, 6], "posit": 1, "order": [1, 3, 4], "most": [1, 4], "purpos": [1, 7], "true": [1, 3], "fals": [1, 3], "lexicograph": 1, "compar": 1, "appear": [1, 7], "wherea": 1, "alphabet": 1, "wai": [1, 3, 4], "via": 1, "pattern": [1, 2], "match": [1, 3], "explicit": [1, 4, 6], "selector": 1, "15": 1, "20": [1, 3], "0": [1, 2, 3], "onli": [1, 3, 4, 7], "program": 1, "suffici": [1, 2], "inform": 1, "shape": 1, "For": [1, 2, 3, 4, 7], "t": [1, 2, 3, 4, 7], "valid": 1, "definit": [1, 2, 4], "known": 1, "isposit": 1, "invalid": 1, "insuffici": 1, "baddef": 1, "mirror": 1, "syntax": [1, 2, 6], "construct": [1, 2, 4], "getfst": 1, "distance2": 1, "xpo": 1, "ypo": 1, "lift": 1, "through": [1, 6], "point": [1, 6], "wise": 1, "equat": 1, "should": [1, 2, 3], "hold": [1, 3], "l": [1, 3], "thu": [1, 4], "we": [1, 3, 4], "can": [1, 2, 3, 4, 7], "quickli": 1, "obtain": [1, 3, 4], "similarli": 1, "get": 1, "entri": 1, "behavior": [1, 3], "quit": [1, 4], "handi": 1, "examin": 1, "complex": 1, "data": 1, "repl": 1, "r": 1, "pt": 1, "100": 1, "set": [1, 3], "30": [1, 4], "rel": 1, "old": 1, "25": 1, "collect": [1, 7], "element": [1, 2, 3], "finit": [1, 2], "often": 1, "call": [1, 3, 4, 6], "word": [1, 3], "abbrevi": 1, "infinit": 1, "inf": [1, 5], "stream": 1, "e1": 1, "e2": 1, "e3": 1, "three": 1, "t1": [1, 3], "t2": [1, 3], "enumer": 1, "exclus": 1, "bound": [1, 3], "stride": 1, "ex": 1, "downward": 1, "t3": 1, "step": [1, 4], "p11": 1, "e11": 1, "p12": 1, "e12": 1, "comprehens": 1, "p21": 1, "e21": 1, "p22": 1, "e22": 1, "gener": [1, 3], "index": 1, "bind": [1, 3], "arr": 1, "j": [1, 4], "dimension": 1, "note": [1, 3, 4], "those": [1, 4], "descript": 1, "concaten": 1, "shift": 1, "rotat": 1, "arithmet": [1, 6], "bitvector": 1, "front": 1, "back": 1, "sub": [1, 4], "updateend": 1, "locat": [1, 4], "updatesend": 1, "There": 1, "pointwis": 1, "p1": 1, "p2": 1, "p3": 1, "p4": 1, "split": [1, 3], "lambda": [1, 2], "section": [2, 3, 4], "provid": [2, 4], "overview": 2, "h": [2, 4], "pair": 2, "paren": 2, "ad": [2, 3, 4], "8": [2, 3, 4], "whole": [2, 3, 4], "9": 2, "variabl": [2, 3], "If": [2, 3, 4], "polymorph": [2, 3], "typaram": 2, "zero": [2, 3, 6], "you": [2, 3, 4], "evalu": [2, 6], "pass": [2, 3, 6], "13": 2, "weakest": 2, "preced": [2, 4], "scope": [2, 4, 7], "defint": 2, "do": [2, 3, 4, 7], "need": [2, 3, 4], "branch": 2, "22": 2, "33": 2, "correspond": [2, 3], "access": [2, 3, 6], "kind": [2, 3], "larg": [2, 3], "accommod": 2, "liter": [2, 6], "backtick": 2, "sugar": [2, 4], "applic": 2, "primtiv": 2, "abov": [2, 3, 4], "suitabl": 2, "automat": [2, 3], "chosen": 2, "possibl": [2, 4], "usual": 2, "ffi": 3, "other": [3, 4, 7], "convent": 3, "current": 3, "window": 3, "work": [3, 4], "unix": 3, "like": [3, 4, 7], "system": [3, 4], "maco": 3, "linux": 3, "suppos": 3, "want": [3, 4], "uint32_t": 3, "add": [3, 4], "In": [3, 4], "our": 3, "file": [3, 4], "declar": [3, 4, 6], "bodi": [3, 7], "32": [3, 4], "dynam": 3, "load": 3, "share": 3, "librari": 3, "look": [3, 4], "directori": [3, 4], "differ": [3, 4], "extens": 3, "exact": 3, "specif": 3, "On": 3, "dylib": 3, "your": 3, "foo": 3, "cry": [3, 4], "Then": [3, 4], "each": [3, 4, 7], "case": [3, 4], "onc": [3, 4], "ani": [3, 4, 7], "sinc": [3, 4], "sourc": [3, 4], "check": 3, "actual": 3, "It": [3, 4], "respons": 3, "make": [3, 4], "sure": [3, 4], "undefin": 3, "doe": 3, "handl": 3, "simpl": [3, 4], "manual": 3, "command": 3, "cc": 3, "fpic": 3, "o": 3, "dynamiclib": 3, "describ": [3, 4], "how": 3, "given": 3, "signatur": [3, 6], "map": 3, "prototyp": 3, "limit": 3, "clear": 3, "translat": 3, "These": 3, "curri": 3, "argument": [3, 6, 7], "certain": 3, "befor": [3, 4], "That": 3, "could": 3, "mani": [3, 4], "after": 3, "directli": [3, 7], "output": 3, "depend": 3, "pointer": 3, "modifi": 3, "store": 3, "list": [3, 6], "size_t": 3, "numer": [3, 4, 6], "furthermor": 3, "satisfi": 3, "explicitli": 3, "fit": 3, "runtim": 3, "error": [3, 4], "requir": [3, 4], "instead": [3, 4, 7], "just": [3, 4, 7], "practic": [3, 4], "would": [3, 4, 7], "too": 3, "cumbersom": [3, 4], "uint8_t": 3, "nonzero": 3, "k": 3, "uint16_t": 3, "uint64_t": 3, "smaller": 3, "extra": 3, "ignor": 3, "instanc": 3, "0xf": 3, "0x0f": 3, "0xaf": 3, "larger": 3, "standard": 3, "convers": 3, "arrai": 3, "float32": 3, "float64": 3, "doubl": 3, "built": [3, 6], "possibli": 3, "u": 3, "itself": [3, 4], "along": 3, "earlier": 3, "alwai": 3, "know": 3, "tn": 3, "mention": [3, 7], "themselv": 3, "u1": 3, "u2": 3, "un": 3, "respect": 3, "f1": 3, "f2": 3, "fn": 3, "arbitrari": 3, "field": [3, 5, 6, 7], "flatten": 3, "out": 3, "behav": 3, "individu": 3, "recurs": [3, 4, 7], "empti": 3, "don": 3, "void": 3, "treat": [3, 4, 7], "except": [3, 4], "input": 3, "version": 3, "becaus": [3, 4], "alreadi": 3, "involv": 3, "alloc": 3, "dealloc": 3, "manag": [3, 6], "non": 3, "piec": 3, "enough": 3, "try": [3, 4], "adjac": 3, "uniniti": 3, "read": 3, "relat": 4, "top": 4, "level": [4, 6], "m": 4, "type": [4, 6], "glu": 4, "ordinari": 4, "hash": 4, "sha256": 4, "structur": [4, 6], "implement": 4, "search": 4, "cryptolpath": 4, "To": 4, "anoth": 4, "wa": 4, "sometim": 4, "0x02": 4, "0x03": 4, "0x04": 4, "help": 4, "reduc": 4, "collis": 4, "tend": 4, "code": [4, 6], "easier": 4, "understand": 4, "easi": 4, "them": 4, "few": 4, "clash": 4, "situat": 4, "conveni": 4, "everyth": 4, "avoid": 4, "happen": 4, "combin": 4, "claus": 4, "introduc": 4, "might": 4, "helper": 4, "function": [4, 6, 7], "intend": 4, "outsid": 4, "good": 4, "place": 4, "0x01": 4, "helper1": 4, "helper2": 4, "public": 4, "remain": 4, "extend": 4, "keyword": [4, 6], "new": [4, 7], "layout": [4, 6], "singl": 4, "equival": 4, "previou": 4, "withing": 4, "keword": 4, "refer": 4, "shadow": 4, "outer": 4, "submdul": 4, "across": 4, "submould": 4, "bring": [4, 7], "upcom": 4, "variant": 4, "featur": 4, "yet": 4, "part": 4, "main": [3, 4], "content": 4, "without": 4, "concret": 4, "assumpt": 4, "about": 4, "constant": [3, 4], "desrib": 4, "parmaet": 4, "sumbodul": 4, "mayb": 4, "link": 4, "abl": 4, "impos": 4, "cours": 4, "done": 4, "impl": 4, "26": 4, "myf": 4, "fill": 4, "my": 4, "slight": 4, "variat": 4, "impl1": 4, "impl2": 4, "deriv": 4, "somewher": 4, "presum": 4, "coupl": 4, "straight": 4, "awai": 4, "thing": 4, "notion": 4, "11": 4, "syntact": 4, "functor": 4, "time": 4, "synonym": [4, 6], "noth": 4, "exist": [4, 7], "semant": 4, "occasion": 4, "being": 4, "eq": 5, "cmp": 5, "ab": 5, "ring": 5, "signedcmp": 5, "complement": 5, "frominteg": 5, "negat": 5, "tointeg": 5, "inffrom": 5, "inffromthen": 5, "recip": 5, "floor": 5, "trunc": 5, "roundawai": 5, "roundtoeven": 5, "basic": 6, "comment": 6, "oper": 6, "annot": 6, "instanti": 6, "condit": 6, "demot": 6, "tupl": 6, "record": [6, 7], "updat": 6, "comparison": 6, "logic": 6, "integr": 6, "hierarch": 6, "qualifi": 6, "implicit": 6, "parameter": 6, "anonym": 6, "foreign": 6, "platform": 6, "usag": 6, "compil": 6, "c": 6, "convert": 6, "overal": 6, "return": 6, "memori": 6, "creat": 7, "pre": 7, "transpar": 7, "unfold": 7, "site": 7, "though": 7, "user": 7, "had": 7, "newt": 7, "seq": 7, "unlik": 7, "distinct": 7, "checker": 7, "moreov": 7, "member": 7, "typeclass": 7, "typecheck": 7, "otherwis": 7, "irrelev": 7, "form": 7, "everi": 7, "project": 7, "extract": 7, "sum": 7, "someth": 3, "a1": 3, "ak": 3, "c1": 3, "cn": 3, "tm": 3, "tr": 3, "expand": 3, "rule": 3, "out0": 3, "out1": 3, "in0": 3, "in1": 3, "in2": 3, "fulli": 3, "process": 3, "0x00000003": 3, "v1": 3, "v2": 3, "vn": 3, "ti": 3, "ui": 3, "vi": 3, "quick": 6, "n1": 3, "n2": 3, "nk": 3, "multidimension": 3, "contigu": 3, "similar": 3, "dimens": 3, "ni": 3}, "objects": {}, "objtypes": {}, "objnames": {}, "titleterms": {"basic": [0, 1, 3, 5], "syntax": 0, "declar": [0, 2, 7], "type": [0, 1, 2, 3, 7], "signatur": 0, "layout": 0, "comment": 0, "todo": [0, 2], "identifi": 0, "keyword": 0, "built": 0, "oper": [0, 1, 2, 5], "preced": 0, "level": 0, "numer": [0, 2], "liter": 0, "tupl": [1, 3], "record": [1, 3], "access": 1, "field": 1, "updat": 1, "sequenc": [1, 3], "function": [1, 2, 3], "express": 2, "call": 2, "prefix": 2, "infix": 2, "annot": 2, "explicit": 2, "instanti": [2, 4], "local": 2, "block": [2, 4], "argument": [2, 4], "condit": 2, "demot": 2, "valu": [2, 3], "foreign": 3, "interfac": [3, 4], "platform": 3, "support": 3, "usag": 3, "compil": 3, "c": 3, "code": 3, "convert": 3, "between": 3, "cryptol": [3, 6], "overal": 3, "structur": 3, "paramet": [3, 4], "bit": 3, "integr": [3, 5], "float": 3, "point": 3, "return": 3, "memori": 3, "modul": 4, "hierarch": 4, "name": 4, "import": 4, "list": 4, "hide": 4, "qualifi": 4, "privat": 4, "nest": 4, "implicit": 4, "manag": 4, "parameter": 4, "an": 4, "constraint": 4, "anonym": 4, "pass": 4, "through": 4, "overload": 5, "equal": 5, "comparison": 5, "sign": 5, "zero": 5, "logic": 5, "arithmet": 5, "divis": 5, "round": 5, "refer": [3, 6], "manual": 6, "synonym": [3, 7], "newtyp": 7, "exampl": 3, "evalu": 3, "quick": 3}, "envversion": {"sphinx.domains.c": 2, "sphinx.domains.changeset": 1, "sphinx.domains.citation": 1, "sphinx.domains.cpp": 6, "sphinx.domains.index": 1, "sphinx.domains.javascript": 2, "sphinx.domains.math": 2, "sphinx.domains.python": 3, "sphinx.domains.rst": 2, "sphinx.domains.std": 2, "sphinx.ext.todo": 2, "sphinx": 56}})
\ No newline at end of file
+Search.setIndex({docnames:["BasicSyntax","BasicTypes","Expressions","FFI","Modules","OverloadedOperations","RefMan","TypeDeclarations"],envversion:{"sphinx.domains.c":2,"sphinx.domains.changeset":1,"sphinx.domains.citation":1,"sphinx.domains.cpp":4,"sphinx.domains.index":1,"sphinx.domains.javascript":2,"sphinx.domains.math":2,"sphinx.domains.python":3,"sphinx.domains.rst":2,"sphinx.domains.std":2,"sphinx.ext.todo":2,sphinx:56},filenames:["BasicSyntax.rst","BasicTypes.rst","Expressions.rst","FFI.rst","Modules.rst","OverloadedOperations.rst","RefMan.rst","TypeDeclarations.rst"],objects:{},objnames:{},objtypes:{},terms:{"0":[0,1,2,3],"0254":0,"0b":0,"0b1010":0,"0b1010111":0,"0b11010":0,"0b11111110":0,"0b_0000_0010":0,"0o":0,"0o1234":0,"0o376":0,"0x":0,"0x00000003":3,"0x01":4,"0x02":4,"0x03":4,"0x04":4,"0x0f":3,"0x1234":0,"0x30":0,"0x_ffff_ffea":0,"0xaf":3,"0xf":3,"0xfe":0,"1":[0,1,2,3,4,7],"10":[0,1,3,4],"100":1,"11":4,"12":[0,4],"13":2,"15":1,"16":[0,3],"1p4":0,"2":[0,1,2,3,4,7],"20":[1,3],"22":2,"25":1,"254":0,"26":4,"2e3":0,"3":[0,1,2,4,7],"30":[1,4],"32":[3,4],"33":2,"4":[0,3],"5":[0,1,2,4],"6":[0,7],"64":[0,3],"7":[0,2,4],"8":[2,3,4],"9":2,"case":[3,4],"do":[0,2,3,4,7],"float":[0,6],"function":[0,4,6,7],"import":[0,1,2,6],"long":0,"new":[4,7],"public":4,"return":6,"static":[0,3],"true":[1,3],"try":[3,4],"void":3,"while":[0,1,3],A:[0,1,3,4,7],For:[0,1,2,3,4,7],If:[2,3,4],In:[3,4],It:[3,4],On:3,Such:[0,4],That:3,The:[0,1,2,3,4],Then:[3,4],There:[0,1],These:3,To:4,_:[0,1],a1:3,ab:5,abbrevi:1,abl:4,about:4,abov:[2,3,4],access:[2,3,6],accommod:2,across:4,actual:[0,3],ad:[2,3,4],add:[3,4],addit:[0,4],adjac:3,after:3,ak:3,alias:0,all:[0,2,3,4,7],alloc:3,allow:[0,3,4,7],along:3,alphabet:1,alreadi:3,also:[0,1,3,4],alwai:3,an:[0,1,2,3,6],ani:[3,4,7],annot:6,anonym:6,anoth:4,appear:[1,7],appli:[0,3],applic:2,ar:[0,1,2,3,4,7],arbitrari:3,arbitrarili:0,argument:[3,6,7],arithmet:[1,6],arr:1,arrai:3,associ:0,assum:0,assumpt:[0,4],attempt:0,automat:[2,3],avoid:4,awai:4,b:[0,3,4,5,7],back:1,backtick:2,baddef:1,base:[0,2],basic:6,becaus:[0,3,4],befor:[3,4],begin:0,behav:3,behavior:[0,1,3],being:4,belong:0,between:[0,6],binari:[0,3],bind:[1,3],bit:[0,1,2,4,5,6],bitvector:1,block:[0,6],bodi:[3,7],both:[1,4],bound:[1,3],brace:1,branch:[0,2],bring:[4,7],built:[3,6],c1:3,c:6,call:[1,3,4,6],can:[0,1,2,3,4,7],cannot:[0,2],cc:3,ceil:[0,5],certain:3,chang:0,charact:0,check:[0,3],checker:[0,7],chosen:2,clash:4,claus:4,clear:3,close:0,closest:0,cmp:5,cn:3,code:[4,6],collect:[1,7],collis:4,combin:4,comma:1,command:3,comment:6,compar:1,comparison:6,compil:6,complement:5,complex:1,compon:[1,3],comprehens:1,comput:[0,1],concaten:1,concret:4,condit:6,consid:[0,4,7],consist:0,constant:[3,4],constrain:0,constraint:6,construct:[1,2,4],contain:[0,1,3,4],content:4,context:[0,2],contigu:3,control:0,conveni:4,convent:3,convers:3,convert:6,correspond:[2,3],could:3,coupl:4,cours:4,creat:7,cry:[3,4],cryptol:[0,2,4],cryptolpath:4,cumbersom:[3,4],curli:1,current:3,curri:3,data:1,dealloc:3,decim:0,decis:0,declar:[3,4,6],defin:[0,1,3,4,7],definit:[0,1,2,4],defint:2,degre:0,demot:[0,6],depend:[0,3],deriv:4,describ:[3,4],descript:1,desrib:4,determin:[0,1],differ:[0,3,4],digit:0,dimens:3,dimension:1,directli:[3,7],directori:[3,4],distance2:1,distinct:7,divis:[0,6],document:[0,4],doe:[0,3],don:3,done:4,doubl:3,down:[0,1],downward:1,drop:0,dylib:3,dynam:3,dynamiclib:3,e11:1,e12:1,e1:1,e21:1,e22:1,e2:1,e3:1,e:[0,1,4,5],each:[0,3,4,7],earlier:3,easi:4,easier:4,effect:0,either:[0,3,4],element:[1,2,3],els:[0,2,4],empti:3,enclos:[1,4],end:[0,4],english:0,enough:3,entri:1,enumer:1,environment:0,eq:5,equal:[0,1,6,7],equat:1,equival:4,error:[3,4],etc:0,evalu:[2,6],even:[0,7],everi:7,everyth:4,ex:1,exact:3,examin:1,exampl:[0,1,2,4,6],except:[0,3,4],exclus:1,exhaust:0,exist:[4,7],expand:3,explicit:[1,4,6],explicitli:[0,3],expon:0,exponenti:0,express:[0,1,4,6,7],extend:4,extens:3,extern:0,extra:3,extract:7,f1:3,f2:3,f:[0,1,2,3,4],fact:0,fals:[1,3],famili:0,featur:4,few:4,ffi:3,field:[3,5,6,7],file:[3,4],fill:4,fin:[0,3,4],finit:[1,2],first:[0,1,3,4],fit:3,fix:[0,1,3],flatten:3,float32:3,float64:3,floor:5,fn:3,follow:[0,1,2,3,4],foo:3,foreign:6,form:7,fpic:3,fraction:0,from:[0,1,2,3,4],frominteg:5,front:1,fulli:3,functoin:0,functor:4,furthermor:3,g:[0,2,4],gener:[1,3],get:1,getfst:1,given:3,glu:4,good:4,group:[0,4,7],guard:6,h:[2,4],ha:[0,1,2,3],had:7,handi:1,handl:3,happen:4,hash:4,have:[0,1,2,3,4,7],help:4,helper1:4,helper2:4,helper:4,here:[0,2,4],hexadecim:0,hide:[0,6],hierarch:6,highest:0,hold:[1,3],how:3,howev:[],i:[0,1,4],identifi:[1,4,6],ignor:3,impl1:4,impl2:4,impl:4,implement:4,implicit:6,implict:0,importantli:[],impos:4,improv:[0,3],in0:3,in1:3,in2:3,includ:0,indent:[0,4],independ:0,index:1,individu:3,inf:[1,5],infer:[0,2],inffrom:5,inffromthen:5,infinit:1,infix:[0,6],infixl:0,infixr:0,inform:1,input:3,instanc:3,instanti:6,instead:[0,3,4,7],insuffici:1,integ:[0,2,5,7],integr:6,intend:4,interfac:[0,6],introduc:4,invalid:1,involv:3,irrelev:7,isposit:1,issu:0,its:[0,3,4],itself:[3,4],j:[1,4],just:[3,4,7],k:3,keword:4,keyword:[4,6],kind:[2,3],know:3,known:1,l:[1,3],label:1,lambda:[1,2],languag:[0,3],larg:[2,3],larger:3,last:[0,2,3],layout:[4,6],left:[0,1],len:0,length:[0,1],less:0,let:[0,3],letter:0,level:[4,6],lexicograph:1,lg2:0,librari:3,lift:1,like:[3,4,7],limit:3,line:[0,4,7],link:4,linux:3,list:[0,3,6],liter:[2,6],load:3,local:[0,4,6],locat:[1,4],logarithm:0,logic:6,longer_nam:0,longernam:0,look:[3,4],lowest:0,m:4,maco:3,mai:[0,1,2,3,4,7],main:[3,4],make:[3,4],manag:[3,6],mani:[3,4],manual:3,map:3,mark:0,match:[0,1,3],max:[0,5],maximum:0,mayb:4,mean:[0,3],member:7,memori:6,mention:[3,7],might:4,min:[0,5],minimum:0,mirror:1,modifi:3,modul:[0,3,6],modulu:0,more:[0,4],moreov:7,most:[1,4],multi:[],multidimension:3,multipl:[0,1,2,3,4],must:[0,3,4],my:4,myf:4,n1:3,n2:3,n:[0,1,3,4],name1:0,name2:0,name:[0,1,3,6,7],need:[0,2,3,4],negat:5,nest:[0,1,3,6],newt:7,newtyp:[0,4,6],ni:3,nk:3,non:[0,3],nonzero:3,normal:[],notat:[0,1,2,4],note:[1,3,4],noth:4,notion:4,number:[0,1,2,3],numer:[3,4,6],o:3,obtain:[1,3,4],occasion:4,octal:0,often:1,old:1,onc:[3,4],one:[0,2,3,4],onli:[0,1,3,4,7],open:0,oper:6,option:[0,7],order:[1,3,4],ordinari:4,organ:0,other:[0,3,4,7],otherwis:7,our:3,out0:3,out1:3,out:3,outer:4,output:3,outsid:4,over:0,overal:6,overload:[0,6],overview:2,ox:0,p11:1,p12:1,p1:1,p21:1,p22:1,p2:1,p3:1,p4:1,p:[0,1,4],packag:1,pad:[0,3],pair:2,paramet:[0,2,6],parameter:6,paren:2,parenthes:1,parmaet:4,part:4,pass:[2,3,6],pattern:[1,2],piec:3,place:4,platform:6,point:[1,6],pointer:3,pointwis:1,polymorph:[2,3],polynomi:0,posit:1,possibl:[2,3,4],practic:[3,4],pragma:0,pre:7,preced:[2,4],precis:0,prefix:[0,4,6],presum:4,previou:[0,4],prime:0,primit:0,primtiv:2,principl:0,privat:[0,6],process:3,program:1,programm:0,project:7,properti:0,prototyp:3,prove:0,provid:[0,2,4],pt:1,purpos:[1,7],qualifi:6,quick:6,quickli:1,quit:[0,1,4],r:1,rather:0,ration:0,read:3,readabl:[0,3],recip:5,record:[6,7],recurs:[3,4,7],reduc:4,refer:4,reject:0,rel:1,relat:4,remain:4,repl:1,repres:0,represent:[0,3],requir:[0,3,4],respect:3,respons:3,result:[0,1,2,4],right:[0,1],ring:5,rotat:1,round:[0,6],roundawai:5,roundtoeven:5,rule:3,runtim:3,s:[0,2,3,4],same:[0,1,3,4,7],satisfi:[0,3],scope:[2,4,7],search:4,section:[2,3,4],see:[0,4],selector:1,semant:4,separ:[1,4],seq:7,sequenc:[0,6],set:[0,1,3],sha256:4,shadow:4,shape:1,share:3,shift:1,should:[0,1,2,3],sign:[1,6],signatur:[3,6],signedcmp:5,similar:[0,3],similarli:1,simpl:[3,4],simpli:0,sinc:[3,4],singl:4,site:7,situat:4,size:[0,1,3],size_t:3,slight:4,smaller:3,so:[0,1,2,3,4],some:[0,4],someth:3,sometim:4,somewher:4,sourc:[3,4],special:0,specif:3,specifi:[0,2,4],split:[1,3],standard:3,start:[0,1],statement:0,step:[1,4],store:3,straight:4,stream:1,stride:1,structur:[4,6],sub:[1,4],submdul:4,submodul:[0,4],submould:4,subtract:0,suffici:[1,2],sugar:[2,4],suitabl:2,sum:7,sumbodul:4,support:[0,4,6],suppos:3,sure:[3,4],symbol:[0,3,4],synonym:[4,6],syntact:4,syntax:[1,2,6],system:[3,4],t1:[1,3],t2:[1,3],t3:1,t:[0,1,2,3,4,7],tabl:[0,3],tend:4,term:0,termin:0,text:0,than:[0,3,4],thei:[0,1,3,4,7],them:4,themselv:3,thi:[0,1,2,3,4],thing:4,those:[1,4],though:7,three:1,through:[1,6],thu:[1,4],ti:3,time:4,tm:3,tn:3,togeth:[1,4],tointeg:5,too:3,top:4,tr:3,translat:3,transpar:7,treat:[3,4,7],trunc:5,tupl:6,two:[0,1,2,4,7],typaram:2,type:[4,6],typecheck:7,typeclass:7,u1:3,u2:3,u:3,ui:3,uint16_t:3,uint32_t:3,uint64_t:3,uint8_t:3,un:3,unari:[0,2],undefin:3,underscor:0,understand:4,unfold:7,uniniti:3,unix:3,unlik:7,up:[0,3],upcom:4,updat:6,updateend:1,updatesend:1,us:[0,1,2,3,4,7],usag:6,user:7,usual:2,v1:3,v2:3,valid:1,valu:[0,1,4,6,7],variabl:[2,3],variant:4,variat:4,varieti:0,version:3,vi:3,via:1,vn:3,wa:4,wai:[1,3,4],want:[3,4],warn:0,warnnonexhaustiveconstraintguard:0,we:[1,3,4],weakest:2,when:[0,1,2,3,4],where:[0,1,2,3,4],wherea:1,which:[0,2,3,4,7],whole:[2,3,4],width:[0,4],window:3,wise:1,withing:4,without:4,word:[1,3],work:[3,4],would:[3,4,7],write:[0,1,3],written:[0,1,2,3,7],x:[0,1,2,3,4,7],xpo:1,xs:[0,1],y:[0,1,2,3,4],yet:4,you:[2,3,4],your:3,ypo:1,z:[0,2,4],zero:[2,3,6]},titles:["Basic Syntax","Basic Types","Expressions","Foreign Function Interface","Modules","Overloaded Operations","Cryptol Reference Manual","Type Declarations"],titleterms:{"float":3,"function":[1,2,3],"import":4,"return":3,access:1,an:4,annot:2,anonym:4,argument:[2,4],arithmet:5,basic:[0,1,3,5],between:3,bit:3,block:[2,4],built:0,c:3,call:2,code:3,comment:0,comparison:5,compil:3,condit:2,constraint:[0,4],convert:3,cryptol:[3,6],declar:[0,2,7],demot:2,divis:5,equal:5,evalu:3,exampl:3,explicit:2,express:2,field:1,foreign:3,guard:0,hide:4,hierarch:4,identifi:0,implicit:4,infix:2,instanti:[2,4],integr:[3,5],interfac:[3,4],keyword:0,layout:0,level:0,list:4,liter:0,local:2,logic:5,manag:4,manual:6,memori:3,modul:4,name:4,nest:4,newtyp:7,numer:[0,2],oper:[0,1,2,5],overal:3,overload:5,paramet:[3,4],parameter:4,pass:4,platform:3,point:3,preced:0,prefix:2,privat:4,qualifi:4,quick:3,record:[1,3],refer:[3,6],round:5,sequenc:[1,3],sign:5,signatur:0,structur:3,support:3,synonym:[3,7],syntax:0,through:4,todo:[0,2],tupl:[1,3],type:[0,1,2,3,7],updat:1,usag:3,valu:[2,3],zero:5}})
\ No newline at end of file

From 9d6319078f299a07a90caa55cb6207282acf79ed Mon Sep 17 00:00:00 2001
From: Iavor Diatchki <iavor.diatchki@gmail.com>
Date: Sat, 3 Sep 2022 12:05:08 +0300
Subject: [PATCH 115/125] Update the CHANGES files

---
 CHANGES.md | 5 +++++
 1 file changed, 5 insertions(+)

diff --git a/CHANGES.md b/CHANGES.md
index 1e6167277..cc41ad935 100644
--- a/CHANGES.md
+++ b/CHANGES.md
@@ -2,6 +2,11 @@
 
 ## Language changes
 
+* Declarations may now use *numeric constraint guards*.   This is a feature
+  that allows a function to behave differently depending on its numeric
+  type parameters.  See the [manual section](https://galoisinc.github.io/cryptol/RefMan/_build/html/BasicSyntax.html#numeric-constraint-guards))
+  for more information.
+
 * The foreign function interface (FFI) has been added, which allows Cryptol to
   call functions written in C. See the [manual section](https://galoisinc.github.io/cryptol/RefMan/_build/html/FFI.html)
   for more information.

From 66420237f886bbd0623deb5d05484dfb37f58976 Mon Sep 17 00:00:00 2001
From: Iavor Diatchki <iavor.diatchki@gmail.com>
Date: Mon, 5 Sep 2022 13:45:55 +0300
Subject: [PATCH 116/125] Remove commented out imports

---
 src/Cryptol/Parser/ExpandPropGuards.hs | 7 -------
 1 file changed, 7 deletions(-)

diff --git a/src/Cryptol/Parser/ExpandPropGuards.hs b/src/Cryptol/Parser/ExpandPropGuards.hs
index 90e135651..a859d5230 100644
--- a/src/Cryptol/Parser/ExpandPropGuards.hs
+++ b/src/Cryptol/Parser/ExpandPropGuards.hs
@@ -18,13 +18,6 @@
 -- function.
 module Cryptol.Parser.ExpandPropGuards where
 
--- import Cryptol.Parser.Position (Range(..), emptyRange, start, at)
--- import Cryptol.Parser.Names (namesP)
-
--- import Cryptol.Utils.Ident (mkIdent)
-
--- import Cryptol.Utils.RecordMap
-
 import Control.DeepSeq
 import Cryptol.Parser.AST
 import Cryptol.Utils.PP

From fb3935f41b6ac09d5070b0186881a25afad891e2 Mon Sep 17 00:00:00 2001
From: Iavor Diatchki <iavor.diatchki@gmail.com>
Date: Tue, 6 Sep 2022 18:56:20 +0300
Subject: [PATCH 117/125] * Introduce a separate type for a property guarded
 alternative * Annotate each property with a location * Disallow property
 guards with index declarations   (maybe this could be made to work, but be
 conservative for now) * Require signatures on all members of a recursive
 group with prop guards

---
 src/Cryptol/ModuleSystem/Renamer.hs    | 12 ++---
 src/Cryptol/Parser.y                   | 27 +++++-----
 src/Cryptol/Parser/AST.hs              |  9 +++-
 src/Cryptol/Parser/ExpandPropGuards.hs | 20 ++++---
 src/Cryptol/Parser/Names.hs            |  8 ++-
 src/Cryptol/Parser/NoPat.hs            | 16 ++++--
 src/Cryptol/Parser/ParserUtils.hs      | 53 ++++++++++--------
 src/Cryptol/TypeCheck/Error.hs         | 37 ++++++++++++-
 src/Cryptol/TypeCheck/Infer.hs         | 74 +++++++++++++++++++-------
 src/Cryptol/TypeCheck/Kind.hs          |  6 +--
 tests/constraint-guards/inits.cry      | 17 +++---
 tests/ffi/ffi-type-errors.icry.stdout  |  5 +-
 12 files changed, 198 insertions(+), 86 deletions(-)

diff --git a/src/Cryptol/ModuleSystem/Renamer.hs b/src/Cryptol/ModuleSystem/Renamer.hs
index a7bf28f3f..9e932149a 100644
--- a/src/Cryptol/ModuleSystem/Renamer.hs
+++ b/src/Cryptol/ModuleSystem/Renamer.hs
@@ -685,13 +685,11 @@ instance Rename BindDef where
   rename DPrim     = return DPrim
   rename DForeign  = return DForeign
   rename (DExpr e) = DExpr <$> rename e
-  rename (DPropGuards cases) = DPropGuards <$> traverse renameCase cases
-    where 
-      renameCase :: ([Prop PName], Expr PName) -> RenameM ([Prop Name], Expr Name)
-      renameCase (props, e) = do
-        props' <- traverse rename props
-        e' <- rename e
-        pure (props', e')
+  rename (DPropGuards cases) = DPropGuards <$> traverse rename cases
+
+instance Rename PropGuardCase where
+  rename g = PropGuardCase <$> traverse (rnLocated rename) (pgcProps g)
+                           <*> rename (pgcExpr g)
 
 -- NOTE: this only renames types within the pattern.
 instance Rename Pattern where
diff --git a/src/Cryptol/Parser.y b/src/Cryptol/Parser.y
index 8cf7a176b..caa5fb164 100644
--- a/src/Cryptol/Parser.y
+++ b/src/Cryptol/Parser.y
@@ -302,24 +302,14 @@ mbDoc                   :: { Maybe (Located Text) }
   : doc                    { Just $1 }
   | {- empty -}            { Nothing }
 
-propguards_cases :: { [([Prop PName], Expr PName)] }
-  : propguards_case propguards_cases { $1 ++ $2 }
-  | propguards_case { $1 }
-
-propguards_case :: { [([Prop PName], Expr PName)] }
-  : '|' propguards_quals '=>' expr { [($2, $4)] }
-
-propguards_quals :: { [Prop PName] }
-  : type {% fmap thing (mkProp $1) }
-
 decl                    :: { Decl PName }
   : vars_comma ':' schema  { at (head $1,$3) $ DSignature (reverse $1) $3   }
   | ipat '=' expr          { at ($1,$3) $ DPatBind $1 $3                    }
   | '(' op ')' '=' expr    { at ($1,$5) $ DPatBind (PVar $2) $5             }
   | var apats_indices propguards_cases
-                           { mkIndexedPropGuardsDecl $1 $2 $3 }
+                           {% mkPropGuardsDecl $1 $2 $3 }
   | var propguards_cases
-                           { mkIndexedConstantPropGuardsDecl $1 $2 }
+                           {% mkConstantPropGuardsDecl $1 $2 }
   | var apats_indices '=' expr
                            { at ($1,$4) $ mkIndexedDecl $1 $2 $4 }
 
@@ -398,6 +388,19 @@ let_decl                :: { Decl PName }
   | 'infix'  NUM ops       {% mkFixity NonAssoc   $2 (reverse $3) }
 
 
+
+
+propguards_cases                   :: { [PropGuardCase PName] }
+  : propguards_cases propguards_case  { $2 : $1 }
+  | propguards_case                   { [$1] }
+
+propguards_case                    :: { PropGuardCase PName }
+  : '|' propguards_quals '=>' expr    { PropGuardCase $2 $4 }
+
+propguards_quals                   :: { [Located (Prop PName)] }
+  : type                              {% mkPropGuards $1 }
+
+
 newtype                 :: { Newtype PName }
   : 'newtype' qname '=' newtype_body
                            { Newtype $2 [] (thing $4) }
diff --git a/src/Cryptol/Parser/AST.hs b/src/Cryptol/Parser/AST.hs
index 1036beeb3..95802c62d 100644
--- a/src/Cryptol/Parser/AST.hs
+++ b/src/Cryptol/Parser/AST.hs
@@ -60,6 +60,7 @@ module Cryptol.Parser.AST
   , ParameterType(..)
   , ParameterFun(..)
   , NestedModule(..)
+  , PropGuardCase(..)
 
     -- * Interactive
   , ReplInput(..)
@@ -281,9 +282,15 @@ type LBindDef = Located (BindDef PName)
 data BindDef name = DPrim
                   | DForeign
                   | DExpr (Expr name)
-                  | DPropGuards [([Prop name], Expr name)]
+                  | DPropGuards [PropGuardCase name]
                     deriving (Eq, Show, Generic, NFData, Functor)
 
+data PropGuardCase name = PropGuardCase
+  { pgcProps :: [Located (Prop name)]
+  , pgcExpr  :: Expr name
+  }
+  deriving (Eq,Generic,NFData,Functor,Show)
+
 data Pragma   = PragmaNote String
               | PragmaProperty
                 deriving (Eq, Show, Generic, NFData)
diff --git a/src/Cryptol/Parser/ExpandPropGuards.hs b/src/Cryptol/Parser/ExpandPropGuards.hs
index a859d5230..270b5cfb2 100644
--- a/src/Cryptol/Parser/ExpandPropGuards.hs
+++ b/src/Cryptol/Parser/ExpandPropGuards.hs
@@ -79,9 +79,11 @@ instance ExpandPropGuards [Bind PName] where
             case bSignature bind of
               Just schema -> pure schema
               Nothing -> Left . NoSignature $ bName bind
-          let goGuard :: ([Prop PName], Expr PName) -> ExpandPropGuardsM (([Prop PName], Expr PName), Bind PName)
-              goGuard (props', e) = do
-                bName' <- newName (bName bind) props'
+          let goGuard ::
+                PropGuardCase PName ->
+                ExpandPropGuardsM (PropGuardCase PName, Bind PName)
+              goGuard (PropGuardCase props' e) = do
+                bName' <- newName (bName bind) (thing <$> props')
                 -- call to generated function
                 tParams <- case bSignature bind of
                   Just (Forall tps _ _ _) -> pure tps
@@ -91,11 +93,13 @@ instance ExpandPropGuards [Bind PName] where
                     `traverse` tParams
                 let e' = foldl EApp (EAppT (EVar $ thing bName') typeInsts) (patternToExpr <$> bParams bind)
                 pure
-                  ( (props', e'),
+                  ( PropGuardCase props' e',
                     bind
                       { bName = bName',
                         -- include guarded props in signature
-                        bSignature = Just $ Forall params (props <> props') t rng,
+                        bSignature = Just (Forall params
+                                             (props <> map thing props')
+                                             t rng),
                         -- keeps same location at original bind
                         -- i.e. "on top of" original bind
                         bDef = (bDef bind) {thing = DExpr e}
@@ -122,4 +126,8 @@ newName locName props =
       let txt = identText ident
           txt' = pack $ show $ pp props
        in UnQual (mkIdent $ txt <> txt') <$ locName
-    NewName _ _ -> panic "mkName" ["During expanding prop guards, tried to make new name from NewName case of PName"]
+    NewName _ _ ->
+      panic "mkName"
+        [ "During expanding prop guards"
+        , "tried to make new name from NewName case of PName"
+        ]
diff --git a/src/Cryptol/Parser/Names.hs b/src/Cryptol/Parser/Names.hs
index 886e88521..64fe28b6d 100644
--- a/src/Cryptol/Parser/Names.hs
+++ b/src/Cryptol/Parser/Names.hs
@@ -67,7 +67,7 @@ namesDef :: Ord name => BindDef name -> Set name
 namesDef DPrim     = Set.empty
 namesDef DForeign  = Set.empty
 namesDef (DExpr e) = namesE e
-namesDef (DPropGuards guards) = Set.unions [ namesE e | (_, e) <- guards ]
+namesDef (DPropGuards guards) = Set.unions (map (namesE . pgcExpr) guards)
 
 
 -- | The names used by an expression.
@@ -189,7 +189,11 @@ tnamesDef :: Ord name => BindDef name -> Set name
 tnamesDef DPrim     = Set.empty
 tnamesDef DForeign  = Set.empty
 tnamesDef (DExpr e) = tnamesE e
-tnamesDef (DPropGuards guards) = mconcat . fmap (\(_props, e) -> tnamesE e) $ guards
+tnamesDef (DPropGuards guards) = Set.unions (map tnamesPropGuardCase guards)
+
+tnamesPropGuardCase :: Ord name => PropGuardCase name -> Set name
+tnamesPropGuardCase c =
+  Set.unions (tnamesE (pgcExpr c) : map (tnamesC . thing) (pgcProps c))
 
 -- | The type names used by an expression.
 tnamesE :: Ord name => Expr name -> Set name
diff --git a/src/Cryptol/Parser/NoPat.hs b/src/Cryptol/Parser/NoPat.hs
index f1b228db0..73cde0320 100644
--- a/src/Cryptol/Parser/NoPat.hs
+++ b/src/Cryptol/Parser/NoPat.hs
@@ -228,9 +228,19 @@ noMatchB b =
       do e' <- noPatFun (Just (thing (bName b))) 0 (bParams b) e
          return b { bParams = [], bDef = DExpr e' <$ bDef b }
 
-    DPropGuards guards -> do
-      guards' <- (\(props, e) -> (,) <$> pure props <*> noPatFun (Just (thing (bName b))) 0 (bParams b) e) `traverse` guards
-      pure b { bParams = [], bDef = DPropGuards guards' <$ bDef b }
+    DPropGuards guards ->
+      do let nm = thing (bName b)
+             ps = bParams b
+         gs <- mapM (noPatPropGuardCase nm ps) guards
+         pure b { bParams = [], bDef = DPropGuards gs <$ bDef b }
+
+noPatPropGuardCase ::
+  PName ->
+  [Pattern PName] ->
+  PropGuardCase PName -> NoPatM (PropGuardCase PName)
+noPatPropGuardCase f xs pc =
+  do e <- noPatFun (Just f) 0 xs (pgcExpr pc)
+     pure pc { pgcExpr = e }
 
 noMatchD :: Decl PName -> NoPatM [Decl PName]
 noMatchD decl =
diff --git a/src/Cryptol/Parser/ParserUtils.hs b/src/Cryptol/Parser/ParserUtils.hs
index 991e2f8d1..6e1c2a111 100644
--- a/src/Cryptol/Parser/ParserUtils.hs
+++ b/src/Cryptol/Parser/ParserUtils.hs
@@ -27,7 +27,6 @@ import           Data.Text(Text)
 import qualified Data.Text as T
 import qualified Data.Map as Map
 import Text.Read(readMaybe)
-import Data.Bifunctor(second)
 
 import GHC.Generics (Generic)
 import Control.DeepSeq
@@ -611,27 +610,33 @@ mkIndexedDecl f (ps, ixs) e =
     rhs = mkGenerate (reverse ixs) e
 
 -- NOTE: The lists of patterns are reversed!
-mkIndexedPropGuardsDecl ::  
-  LPName -> ([Pattern PName], [Pattern PName]) -> [([Prop PName], Expr PName)] -> Decl PName
-mkIndexedPropGuardsDecl f (ps, ixs) guards =
-  DBind Bind { bName       = f
-             , bParams     = reverse ps
-             , bDef        = at f $ Located emptyRange (DPropGuards guards')
-             , bSignature  = Nothing
-             , bPragmas    = []
-             , bMono       = False
-             , bInfix      = False
-             , bFixity     = Nothing
-             , bDoc        = Nothing
-             , bExport     = Public
-             }
-  where
-    guards' = second (mkGenerate (reverse ixs)) <$> guards
-
-mkIndexedConstantPropGuardsDecl :: 
-  LPName -> [([Prop PName], Expr PName)] -> Decl PName
-mkIndexedConstantPropGuardsDecl f guards =
-  mkIndexedPropGuardsDecl f ([], []) guards
+mkPropGuardsDecl ::
+  LPName ->
+  ([Pattern PName], [Pattern PName]) ->
+  [PropGuardCase PName] ->
+  ParseM (Decl PName)
+mkPropGuardsDecl f (ps, ixs) guards =
+  do unless (null ixs) $
+      errorMessage (srcRange f)
+                  ["Indexed sequence definitions may not use constraint guards"]
+     let gs  = reverse guards
+     pure $
+       DBind Bind { bName       = f
+                  , bParams     = reverse ps
+                  , bDef        = Located (srcRange f) (DPropGuards gs)
+                  , bSignature  = Nothing
+                  , bPragmas    = []
+                  , bMono       = False
+                  , bInfix      = False
+                  , bFixity     = Nothing
+                  , bDoc        = Nothing
+                  , bExport     = Public
+                  }
+
+mkConstantPropGuardsDecl ::
+  LPName -> [PropGuardCase PName] -> ParseM (Decl PName)
+mkConstantPropGuardsDecl f guards =
+  mkPropGuardsDecl f ([],[]) guards
 
 -- NOTE: The lists of patterns are reversed!
 mkIndexedExpr :: ([Pattern PName], [Pattern PName]) -> Expr PName -> Expr PName
@@ -792,6 +797,10 @@ distrLoc :: Located [a] -> [Located a]
 distrLoc x = [ Located { srcRange = r, thing = a } | a <- thing x ]
   where r = srcRange x
 
+mkPropGuards :: Type PName -> ParseM [Located (Prop PName)]
+mkPropGuards ty =
+  do lp <- mkProp ty
+     pure [ lp { thing = p } | p <- thing lp ]
 
 mkProp :: Type PName -> ParseM (Located [Prop PName])
 mkProp ty =
diff --git a/src/Cryptol/TypeCheck/Error.hs b/src/Cryptol/TypeCheck/Error.hs
index e87a682f5..bc1b68e83 100644
--- a/src/Cryptol/TypeCheck/Error.hs
+++ b/src/Cryptol/TypeCheck/Error.hs
@@ -152,6 +152,13 @@ data Error    = KindMismatch (Maybe TypeSource) Kind Kind
               | UnsupportedFFIType TypeSource FFITypeError
                 -- ^ Type is not supported for FFI
 
+              | NestedConstraintGuard Ident
+                -- ^ Constraint guards may only apper at the top-level
+
+              | DeclarationRequiresSignatureCtrGrd Ident
+                -- ^ All declarataions in a recursive group involving
+                -- constraint guards should have signatures
+
               | TemporaryError Doc
                 -- ^ This is for errors that don't fit other cateogories.
                 -- We should not use it much, and is generally to be used
@@ -212,6 +219,9 @@ errorImportance err =
     UnsupportedFFIType {}                            -> 7
     -- less than UnexpectedTypeWildCard
 
+    NestedConstraintGuard {}                         -> 10
+    DeclarationRequiresSignatureCtrGrd {}            -> 9
+
 
 instance TVars Warning where
   apSubst su warn =
@@ -265,6 +275,9 @@ instance TVars Error where
       UnsupportedFFIKind {}    -> err
       UnsupportedFFIType src e -> UnsupportedFFIType src !$ apSubst su e
 
+      NestedConstraintGuard {} -> err
+      DeclarationRequiresSignatureCtrGrd {} -> err
+
       TemporaryError {} -> err
 
 
@@ -303,6 +316,9 @@ instance FVS Error where
       UnsupportedFFIKind {}  -> Set.empty
       UnsupportedFFIType _ t -> fvs t
 
+      NestedConstraintGuard {} -> Set.empty
+      DeclarationRequiresSignatureCtrGrd {} -> Set.empty
+
       TemporaryError {} -> Set.empty
 
 instance PP Warning where
@@ -344,8 +360,13 @@ instance PP (WithNames Error) where
 
       UnexpectedTypeWildCard ->
         addTVarsDescsAfter names err $
-        nested "Wild card types are not allowed in this context"
-          "(e.g., they cannot be used in type synonyms or FFI declarations)."
+        nested "Wild card types are not allowed in this context" $
+          vcat [ "They cannot be used in:"
+               , bullets [ "type synonyms"
+                         , "FFI declarations"
+                         , "declarations with constraint guards"
+                         ]
+               ]
 
       KindMismatch mbsrc k1 k2 ->
         addTVarsDescsAfter names err $
@@ -491,6 +512,18 @@ instance PP (WithNames Error) where
         [ ppWithNames names t
         , "When checking" <+> pp src ]
 
+      NestedConstraintGuard d ->
+        vcat [ "Local declaration" <+> backticks (pp d)
+                                   <+> "may not use constraint guards."
+             , "Constraint guards may only appear at the top-level of a module."
+             ]
+
+      DeclarationRequiresSignatureCtrGrd d ->
+        vcat [ "The declaration of" <+> backticks (pp d) <+>
+                                            "requires a full type signature,"
+             , "because it is part of a recursive group with constraint guards."
+             ]
+
       TemporaryError doc -> doc
     where
     bullets xs = vcat [ "•" <+> d | d <- xs ]
diff --git a/src/Cryptol/TypeCheck/Infer.hs b/src/Cryptol/TypeCheck/Infer.hs
index 707e2ce61..e5dfe5398 100644
--- a/src/Cryptol/TypeCheck/Infer.hs
+++ b/src/Cryptol/TypeCheck/Infer.hs
@@ -34,7 +34,7 @@ import Data.Text(Text)
 import qualified Data.Text as Text
 
 
-import           Cryptol.ModuleSystem.Name (lookupPrimDecl,nameLoc)
+import           Cryptol.ModuleSystem.Name (lookupPrimDecl,nameLoc, nameIdent)
 import           Cryptol.Parser.Position
 import qualified Cryptol.Parser.AST as P
 import qualified Cryptol.ModuleSystem.Exports as P
@@ -740,15 +740,18 @@ inferCArm armNum (m : ms) =
      newGoals CtComprehension [ pFin n' ]
      return (m1 : ms', Map.insertWith (\_ old -> old) x t ds, tMul n n')
 
--- | @inferBinds isTopLevel isRec binds@ performs inference for a
--- strongly-connected component of 'P.Bind's.
--- If any of the members of the recursive group are already marked
--- as monomorphic, then we don't do generalization.
--- If @isTopLevel@ is true,
--- any bindings without type signatures will be generalized. If it is
--- false, and the mono-binds flag is enabled, no bindings without type
--- signatures will be generalized, but bindings with signatures will
--- be unaffected.
+{- | @inferBinds isTopLevel isRec binds@ performs inference for a
+strongly-connected component of 'P.Bind's.
+If any of the members of the recursive group are already marked
+as monomorphic, then we don't do generalization.
+If @isTopLevel@ is true,
+any bindings without type signatures will be generalized. If it is
+false, and the mono-binds flag is enabled, no bindings without type
+signatures will be generalized, but bindings with signatures will
+be unaffected.
+
+-}
+
 inferBinds :: Bool -> Bool -> [P.Bind Name] -> InferM [Decl]
 inferBinds isTopLevel isRec binds =
   do -- when mono-binds is enabled, and we're not checking top-level
@@ -796,6 +799,8 @@ inferBinds isTopLevel isRec binds =
                      genCs     <- generalize bs1 cs
                      return (done,genCs)
 
+     checkNumericConstraintGuardsOK isTopLevel sigs noSigs
+
      rec
        let exprMap = Map.fromList (map monoUse genBs)
        (doneBs, genBs) <- check exprMap
@@ -823,6 +828,37 @@ inferBinds isTopLevel isRec binds =
     withQs   = foldl' appP withTys  qs
 
 
+{-
+Here we also check that:
+  * Numeric constraint guards appear only at the top level
+  * All definitions in a recursive groups with numberic constraint guards
+    have signatures
+
+The reason is to avoid interference between local constraints coming
+from the guards and type inference.  It might be possible to
+relex these requirements, but this requires some more careful thought on
+the interaction between the two, and the effects on pricniple types.
+-}
+checkNumericConstraintGuardsOK ::
+  Bool -> [P.Bind Name] -> [P.Bind Name] -> InferM ()
+checkNumericConstraintGuardsOK isTopLevel haveSig noSig =
+  do unless isTopLevel
+            (mapM_ (mkErr NestedConstraintGuard) withGuards)
+     unless (null withGuards)
+            (mapM_ (mkErr DeclarationRequiresSignatureCtrGrd) noSig)
+  where
+  mkErr f b =
+    do let nm = P.bName b
+       inRange (srcRange nm) (recordError (f (nameIdent (thing nm))))
+
+  withGuards = filter hasConstraintGuards haveSig
+  -- When desugaring constraint guards we check that they have signatures,
+  -- so no need to look at noSig
+
+  hasConstraintGuards b =
+    case thing (P.bDef b) of
+      P.DPropGuards {} -> True
+      _                -> False
 
 
 
@@ -1057,11 +1093,8 @@ checkSigB b (Forall as asmps0 t0, validSchema) =
           t1     <- applySubst t0
           cases1 <- mapM (checkPropGuardCase name asmps1) cases0
 
-          checkExhaustive name asmps1 [ props | (props, _) <- cases1 ] >>= \case
-            True ->
-              -- proved exhaustive
-              pure ()
-            False ->
+          exh <- checkExhaustive name asmps1 [ props | (props, _) <- cases1 ]
+          unless exh $
               -- didn't prove exhaustive i.e. none of the guarding props
               -- necessarily hold
               recordWarning (NonExhaustivePropGuards name)
@@ -1086,7 +1119,8 @@ checkSigB b (Forall as asmps0 t0, validSchema) =
 
   where
 
-    checkBindDefExpr :: [Prop] -> [Prop] -> P.Expr Name -> InferM (Type, [Prop], Expr)
+    checkBindDefExpr ::
+      [Prop] -> [Prop] -> P.Expr Name -> InferM (Type, [Prop], Expr)
     checkBindDefExpr asmpsSign asmps1 e0 = do
 
       (e1,cs0) <- collectGoals $ do
@@ -1128,8 +1162,12 @@ checkSigB b (Forall as asmps0 t0, validSchema) =
 
     -- Checking each guarded case is the same as checking a DExpr, except
     -- that the guarding assumptions are added first.
-    checkPropGuardCase :: Name -> [Prop] -> ([P.Prop Name], P.Expr Name) -> InferM ([Prop], Expr)
-    checkPropGuardCase name asmps1 (guards0, e0) = do
+    checkPropGuardCase ::
+      Name ->
+      [Prop] ->
+      P.PropGuardCase Name ->
+      InferM ([Prop], Expr)
+    checkPropGuardCase name asmps1 (P.PropGuardCase guards0 e0) = do
       mb_rng <- case P.bSignature b of
         Just (P.Forall _ _ _ mb_rng) -> pure mb_rng
         _ -> panic "checkSigB"
diff --git a/src/Cryptol/TypeCheck/Kind.hs b/src/Cryptol/TypeCheck/Kind.hs
index 45a926012..01e96763c 100644
--- a/src/Cryptol/TypeCheck/Kind.hs
+++ b/src/Cryptol/TypeCheck/Kind.hs
@@ -66,8 +66,8 @@ checkSchema withWild (P.Forall xs ps t mb) =
           Just r  -> inRange r
 
 -- | Validate a parsed proposition that appears in the guard of a PropGuard.
--- Returns the validated proposition as well as any inferred goal propisitions.
-checkPropGuard :: Maybe Range -> P.Prop Name -> InferM (Type, [Goal])
+-- Returns the validated proposition as well as any inferred goal propositions.
+checkPropGuard :: Maybe Range -> Located (P.Prop Name) -> InferM (Prop, [Goal])
 checkPropGuard mb_rng prop = do
   ((_, t), goals) <-
     collectGoals $
@@ -75,7 +75,7 @@ checkPropGuard mb_rng prop = do
     -- not really doing anything here, since we don't want to introduce any new
     -- type vars into scope
     withTParams NoWildCards schemaParam [] $
-    checkProp prop
+    checkProp (thing prop)
   pure (t, goals)
   where
     rng = maybe id inRange mb_rng
diff --git a/tests/constraint-guards/inits.cry b/tests/constraint-guards/inits.cry
index c0ca485c6..d9966bb74 100644
--- a/tests/constraint-guards/inits.cry
+++ b/tests/constraint-guards/inits.cry
@@ -8,19 +8,18 @@
 inits : {n, a} (fin n) => [n]a -> [(n * (n+1))/2]a
 inits xs
   | n == 0 => []
-  | n >  0 => go xs' x []
+  | n >  0 => initsLoop xs' x []
     where
       (x : [1]_) # xs' = xs
-      
-      go : {l, m} (fin l, fin m, l + m == n, m >= 1) =>
-        [l]a -> [m]a -> 
+
+initsLoop : {n, l, m, a} (fin l, fin m, l + m == n, m >= 1) =>
+        [l]a -> [m]a ->
         [((m-1) * ((m-1)+1))/2]a ->
         [(n * (n+1))/2]a
-      go ys zs acc
-        | l == 0 => acc # zs
-        | l >  0 => go ys' (zs # y) (acc # zs)
-          where 
-            (y : [1]_) # ys' = ys
+initsLoop ys zs acc
+  | l == 0 => acc # zs
+  | l >  0 => initsLoop ys' (zs # y) (acc # zs)
+   where (y : [1]_) # ys' = ys
 
 
 property inits_correct =
diff --git a/tests/ffi/ffi-type-errors.icry.stdout b/tests/ffi/ffi-type-errors.icry.stdout
index 871e683dc..e8fad2cb2 100644
--- a/tests/ffi/ffi-type-errors.icry.stdout
+++ b/tests/ffi/ffi-type-errors.icry.stdout
@@ -101,4 +101,7 @@ Loading module Main
         at ffi-type-errors.cry:11:9--11:34
 [error] at ffi-type-errors.cry:12:48--12:49:
   Wild card types are not allowed in this context
-    (e.g., they cannot be used in type synonyms or FFI declarations).
+    They cannot be used in:
+    • type synonyms
+    • FFI declarations
+    • declarations with constraint guards

From d211e521db09cae1c8bb3b20c17aae4be15267f4 Mon Sep 17 00:00:00 2001
From: Iavor Diatchki <iavor.diatchki@gmail.com>
Date: Tue, 6 Sep 2022 19:27:08 +0300
Subject: [PATCH 118/125] Remove "currently" from error message

---
 src/Cryptol/Parser/ExpandPropGuards.hs | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/src/Cryptol/Parser/ExpandPropGuards.hs b/src/Cryptol/Parser/ExpandPropGuards.hs
index 270b5cfb2..95a9a916b 100644
--- a/src/Cryptol/Parser/ExpandPropGuards.hs
+++ b/src/Cryptol/Parser/ExpandPropGuards.hs
@@ -43,7 +43,7 @@ instance PP Error where
   ppPrec _ err = case err of
     NoSignature x ->
       text "At" <+> pp (srcRange x) <.> colon
-        <+> text "Declarations using constraint guards currently require an explicit type signature."
+        <+> text "Declarations using constraint guards require an explicit type signature."
 
 -- | Instances
 instance ExpandPropGuards (Program PName) where

From 4f82466a7fa77654d017a67b6b9ed1a58259024c Mon Sep 17 00:00:00 2001
From: Iavor Diatchki <iavor.diatchki@gmail.com>
Date: Mon, 12 Sep 2022 11:35:34 +0300
Subject: [PATCH 119/125] Simplify type checking of constraint guards

---
 src/Cryptol/Parser/AST.hs                  |  1 +
 src/Cryptol/TypeCheck/Infer.hs             | 81 ++++++++++++----------
 src/Cryptol/TypeCheck/Kind.hs              | 33 +++++----
 tests/constraint-guards/insert.icry.stdout |  2 -
 4 files changed, 65 insertions(+), 52 deletions(-)

diff --git a/src/Cryptol/Parser/AST.hs b/src/Cryptol/Parser/AST.hs
index 95802c62d..f53da61a9 100644
--- a/src/Cryptol/Parser/AST.hs
+++ b/src/Cryptol/Parser/AST.hs
@@ -78,6 +78,7 @@ module Cryptol.Parser.AST
   , emptyFunDesc
   , PrefixOp(..)
   , prefixFixity
+  , asEApps
 
     -- * Positions
   , Located(..)
diff --git a/src/Cryptol/TypeCheck/Infer.hs b/src/Cryptol/TypeCheck/Infer.hs
index e5dfe5398..5a7c03a09 100644
--- a/src/Cryptol/TypeCheck/Infer.hs
+++ b/src/Cryptol/TypeCheck/Infer.hs
@@ -48,7 +48,7 @@ import           Cryptol.TypeCheck.Kind(checkType,checkSchema,checkTySyn,
                                         checkParameterType,
                                         checkPrimType,
                                         checkParameterConstraints,
-                                        checkPropGuard)
+                                        checkPropGuards)
 import           Cryptol.TypeCheck.Instantiate
 import           Cryptol.TypeCheck.Subst (listSubst,apSubst,(@@),isEmptySubst)
 import           Cryptol.TypeCheck.Unify(rootPath)
@@ -70,9 +70,9 @@ import           Data.Traversable(forM)
 import           Data.Function(on)
 import           Control.Monad(zipWithM, unless, foldM, forM_, mplus, zipWithM,
                                unless, foldM, forM_, mplus, when)
-import           Data.Bifunctor (Bifunctor(second))
-
 
+-- import Debug.Trace
+-- import Cryptol.TypeCheck.PP
 
 inferModule :: P.Module Name -> InferM Module
 inferModule m =
@@ -1091,9 +1091,9 @@ checkSigB b (Forall as asmps0 t0, validSchema) =
         withTParams as $ do
           asmps1 <- applySubstPreds asmps0
           t1     <- applySubst t0
-          cases1 <- mapM (checkPropGuardCase name asmps1) cases0
+          cases1 <- mapM checkPropGuardCase cases0
 
-          exh <- checkExhaustive name asmps1 [ props | (props, _) <- cases1 ]
+          exh <- checkExhaustive name asmps1 (map fst cases1)
           unless exh $
               -- didn't prove exhaustive i.e. none of the guarding props
               -- necessarily hold
@@ -1160,36 +1160,6 @@ checkSigB b (Forall as asmps0 t0, validSchema) =
 
       pure (t, asmps, e2)
 
-    -- Checking each guarded case is the same as checking a DExpr, except
-    -- that the guarding assumptions are added first.
-    checkPropGuardCase ::
-      Name ->
-      [Prop] ->
-      P.PropGuardCase Name ->
-      InferM ([Prop], Expr)
-    checkPropGuardCase name asmps1 (P.PropGuardCase guards0 e0) = do
-      mb_rng <- case P.bSignature b of
-        Just (P.Forall _ _ _ mb_rng) -> pure mb_rng
-        _ -> panic "checkSigB"
-          [ "Used constraint guards without a signature, dumbwit, at "
-          , show . pp $ P.bName b ]
-      -- check guards
-      (guards1, goals) <-
-        second concat . unzip <$>
-        checkPropGuard mb_rng `traverse` guards0
-      -- try to prove all goals
-      su <- proveImplication True (Just name) as (asmps1 <> guards1) goals
-      extendSubst su
-      -- Preprends the goals to the constraints, because these must be
-      -- checked first before the rest of the constraints (during
-      -- evaluation) to ensure well-definedness, since some
-      -- constraints make use of partial functions e.g. `a - b`
-      -- requires `a >= b`.
-      let guards2 = (goal <$> goals) <> concatMap pSplitAnd (apSubst su guards1)
-      (_t, guards3, e1) <- checkBindDefExpr asmps1 guards2 e0
-      e2 <- applySubst e1
-      pure (guards3, e2)
-
     {-
     Given a DPropGuards of the form
 
@@ -1218,6 +1188,14 @@ checkSigB b (Forall as asmps0 t0, validSchema) =
 
     -}
     checkExhaustive :: Name -> [Prop] -> [[Prop]] -> InferM Bool
+{-
+    checkExhaustive name asmps guards
+      | trace (unlines [ "CHECK EXHAUSTIVE:"
+                       , show (vcat (map pp asmps))
+                       , "---"
+                       , show (vcat [ "GUARD: " <+> hsep (map pp ps) | ps <- guards ] )
+                       ]) False = undefined
+-}
     checkExhaustive name asmps guards = 
       -- sort in decreasing order of number of conjuncts
       let c props1 props2 = 
@@ -1255,8 +1233,39 @@ checkSigB b (Forall as asmps0 t0, validSchema) =
         canProve :: [Prop] -> [Goal] -> InferM Bool
         canProve asmps' goals = isRight <$>
           tryProveImplication (Just name) as asmps' goals
-      
 
+{- | This function does not validate anything---it just translates into
+the type-checkd syntax.  The actual validation of the guard will happen
+when the (automatically generated) function corresponding to the guard is
+checked, assuming 'ExpandpropGuards' did its job correctly.
+
+-}
+checkPropGuardCase :: P.PropGuardCase Name -> InferM ([Prop],Expr)
+checkPropGuardCase (P.PropGuardCase guards e0) =
+  do ps <- checkPropGuards guards
+     tys <- mapM (`checkType` Nothing) ts
+     let rhsTs = foldl ETApp                  (getV eV) tys
+         rhsPs = foldl (\e _p -> EProofApp e) rhsTs     ps
+         rhs   = foldl EApp                   rhsPs     (map getV es)
+     pure (ps,rhs)
+
+  where
+  (e1,es) = P.asEApps e0
+  (eV,ts) = case e1 of
+              P.EAppT ex1 tis -> (ex1, map getT tis)
+              _               -> (e1, [])
+
+  getV ex =
+    case ex of
+      P.EVar x -> EVar x
+      _        -> bad "Expression is not a variable."
+
+  getT ti =
+    case ti of
+      P.PosInst t    -> t
+      P.NamedInst {} -> bad "Unexpeceted NamedInst"
+
+  bad msg = panic "checkPropGuardCase" [msg]
 
 --------------------------------------------------------------------------------
 --------------------------------------------------------------------------------
diff --git a/src/Cryptol/TypeCheck/Kind.hs b/src/Cryptol/TypeCheck/Kind.hs
index 01e96763c..9e6014b6e 100644
--- a/src/Cryptol/TypeCheck/Kind.hs
+++ b/src/Cryptol/TypeCheck/Kind.hs
@@ -7,6 +7,7 @@
 -- Portability :  portable
 
 {-# LANGUAGE RecursiveDo #-}
+{-# LANGUAGE BlockArguments #-}
 {-# LANGUAGE Safe #-}
 -- See Note [-Wincomplete-uni-patterns and irrefutable patterns] in Cryptol.TypeCheck.TypePat
 {-# OPTIONS_GHC -Wno-incomplete-uni-patterns #-}
@@ -19,7 +20,7 @@ module Cryptol.TypeCheck.Kind
   , checkPropSyn
   , checkParameterType
   , checkParameterConstraints
-  , checkPropGuard
+  , checkPropGuards
   ) where
 
 import qualified Cryptol.Parser.AST as P
@@ -65,20 +66,24 @@ checkSchema withWild (P.Forall xs ps t mb) =
           Nothing -> id
           Just r  -> inRange r
 
--- | Validate a parsed proposition that appears in the guard of a PropGuard.
--- Returns the validated proposition as well as any inferred goal propositions.
-checkPropGuard :: Maybe Range -> Located (P.Prop Name) -> InferM (Prop, [Goal])
-checkPropGuard mb_rng prop = do
-  ((_, t), goals) <-
-    collectGoals $
-    rng $
-    -- not really doing anything here, since we don't want to introduce any new
-    -- type vars into scope
-    withTParams NoWildCards schemaParam [] $
-    checkProp (thing prop)
-  pure (t, goals)
+{- | Validate parsed propositions that appear in the guard of a PropGuard.
+
+  * Note that we don't validate the well-formedness constraints here---instead,
+    they'd be validated when the signature for the auto generated
+    function corresponding guard is checked.
+
+  * We also check that there are no wild-cards in the constraints.
+-}
+checkPropGuards :: [Located (P.Prop Name)] -> InferM [Prop]
+checkPropGuards props =
+  do (newPs,_gs) <- collectGoals (mapM check props)
+     pure newPs
   where
-    rng = maybe id inRange mb_rng
+  check lp =
+    inRange (srcRange lp)
+    do (_,ps) <- withTParams NoWildCards schemaParam [] (checkProp (thing lp))
+       pure ps
+
 
 -- | Check a module parameter declarations.  Nothing much to check,
 -- we just translate from one syntax to another.
diff --git a/tests/constraint-guards/insert.icry.stdout b/tests/constraint-guards/insert.icry.stdout
index 736b24325..d80fdf123 100644
--- a/tests/constraint-guards/insert.icry.stdout
+++ b/tests/constraint-guards/insert.icry.stdout
@@ -1,8 +1,6 @@
 Loading module Cryptol
 Loading module Cryptol
 Loading module Main
-[warning] at insert.cry:3:1--3:7:
-  Could not prove that the constraint guards used in defining Main::insert were exhaustive.
 Using exhaustive testing.
 Testing... Passed 1 tests.
 Q.E.D.

From 16e7d4f751327af7c61d2e43ecf13511bd38b38c Mon Sep 17 00:00:00 2001
From: Iavor Diatchki <iavor.diatchki@gmail.com>
Date: Mon, 12 Sep 2022 14:28:16 +0300
Subject: [PATCH 120/125] Fixes to exhaustivness checking

---
 src/Cryptol/TypeCheck/Infer.hs | 146 ++++++++++++++++-----------------
 src/Cryptol/TypeCheck/Solve.hs |  12 +--
 src/Cryptol/TypeCheck/Type.hs  |  94 +++++++++------------
 3 files changed, 116 insertions(+), 136 deletions(-)

diff --git a/src/Cryptol/TypeCheck/Infer.hs b/src/Cryptol/TypeCheck/Infer.hs
index 5a7c03a09..8e0336b75 100644
--- a/src/Cryptol/TypeCheck/Infer.hs
+++ b/src/Cryptol/TypeCheck/Infer.hs
@@ -15,6 +15,7 @@
 {-# LANGUAGE OverloadedStrings #-}
 {-# LANGUAGE BlockArguments #-}
 {-# LANGUAGE Safe #-}
+-- {-# LANGUAGE Trustworthy #-}
 -- See Note [-Wincomplete-uni-patterns and irrefutable patterns] in Cryptol.TypeCheck.TypePat
 {-# OPTIONS_GHC -Wno-incomplete-uni-patterns #-}
 {-# LANGUAGE LambdaCase #-}
@@ -63,7 +64,7 @@ import qualified Data.Map as Map
 import           Data.Map (Map)
 import qualified Data.Set as Set
 import           Data.List(foldl', sortBy, groupBy, partition)
-import           Data.Either(partitionEithers, isRight)
+import           Data.Either(partitionEithers)
 import           Data.Maybe(isJust, fromMaybe, mapMaybe)
 import           Data.Ratio(numerator,denominator)
 import           Data.Traversable(forM)
@@ -1093,7 +1094,7 @@ checkSigB b (Forall as asmps0 t0, validSchema) =
           t1     <- applySubst t0
           cases1 <- mapM checkPropGuardCase cases0
 
-          exh <- checkExhaustive name asmps1 (map fst cases1)
+          exh <- checkExhaustive (P.bName b) as asmps1 (map fst cases1)
           unless exh $
               -- didn't prove exhaustive i.e. none of the guarding props
               -- necessarily hold
@@ -1160,79 +1161,76 @@ checkSigB b (Forall as asmps0 t0, validSchema) =
 
       pure (t, asmps, e2)
 
-    {-
-    Given a DPropGuards of the form
-
-    @
-    f : {...} A
-    f | (B1, B2) => ... 
-      | (C1, C2, C2) => ... 
-    @
-
-    we check that it is exhaustive by trying to prove the following
-    implications:
-
-    @
-      A /\ ~B1 => C1 /\ C2 /\ C3
-      A /\ ~B2 => C1 /\ C2 /\ C3 
-    @
-
-    The implications were derive by the following general algorithm:
-    - Find that @(C1, C2, C3)@ is the guard that has the most conjuncts, so we
-      will keep it on the RHS of the generated implications in order to minimize
-      the number of implications we need to check.
-    - Negate @(B1, B2)@ which yields @(~B1) \/ (~B2)@. This is a disjunction, so
-      we need to consider a branch for each disjunct --- one branch gets the
-      assumption @~B1@ and another branch gets the assumption @~B2@. Each
-      branch's implications need to be proven independently.
-
-    -}
-    checkExhaustive :: Name -> [Prop] -> [[Prop]] -> InferM Bool
-{-
-    checkExhaustive name asmps guards
-      | trace (unlines [ "CHECK EXHAUSTIVE:"
-                       , show (vcat (map pp asmps))
-                       , "---"
-                       , show (vcat [ "GUARD: " <+> hsep (map pp ps) | ps <- guards ] )
-                       ]) False = undefined
+
+
+{- |
+Given a DPropGuards of the form
+
+@
+f : {...} A
+f | (B1, B2) => ... 
+  | (C1, C2, C2) => ... 
+@
+
+we check that it is exhaustive by trying to prove the following
+implications:
+
+@
+  A /\ ~B1 => C1 /\ C2 /\ C3
+  A /\ ~B2 => C1 /\ C2 /\ C3
+@
+
+The implications were derive by the following general algorithm:
+- Find that @(C1, C2, C3)@ is the guard that has the most conjuncts, so we
+  will keep it on the RHS of the generated implications in order to minimize
+  the number of implications we need to check.
+- Negate @(B1, B2)@ which yields @(~B1) \/ (~B2)@. This is a disjunction, so
+  we need to consider a branch for each disjunct --- one branch gets the
+  assumption @~B1@ and another branch gets the assumption @~B2@. Each
+  branch's implications need to be proven independently.
+
 -}
-    checkExhaustive name asmps guards = 
-      -- sort in decreasing order of number of conjuncts
-      let c props1 props2 = 
-            -- reversed, so that sorting is in decreasing order
-            compare (length props2) (length props1)
-      in
-      case sortBy c guards of
-        [] -> pure False -- empty PropGuards 
-        -- singleton
-        [props] -> canProve asmps (toGoal <$> props)
-        (props : guards') -> 
-          -- Keep `props` on the RHS of implication. Negate each of `guards` and
-          -- move to RHS. For each negation of a conjunction, a disjunction is
-          -- yielded, which multiplies the number of implications that we need
-          -- to check. So that's why we chose the guard with the largest
-          -- conjunction to stay on RHS.
-          let 
-            goals = toGoal <$> props
-            impls = go asmps guards'
-              where 
-                go asmps' [] = pure $ canProve asmps' goals
-                go asmps' (guard : guards'') = do
-                  neg_guard <- pNegNumeric guard
-                  go (asmps' <> neg_guard) guards''
-          in
-            and <$> sequence impls
-      where
-        toGoal :: Prop -> Goal
-        toGoal prop =
-          Goal
-            { goalSource = CtPropGuardsExhaustive name
-            , goalRange = srcRange $ P.bName b
-            , goal = prop }
-
-        canProve :: [Prop] -> [Goal] -> InferM Bool
-        canProve asmps' goals = isRight <$>
-          tryProveImplication (Just name) as asmps' goals
+checkExhaustive :: Located Name -> [TParam] -> [Prop] -> [[Prop]] -> InferM Bool
+checkExhaustive name as asmps guards =
+  case sortBy cmpByLonger guards of
+    [] -> pure False -- XXX: we should check the asmps are unsatisfiable
+    longest : rest -> doGoals (theAlts rest) (map toGoal longest)
+
+  where
+  cmpByLonger props1 props2 = compare (length props2) (length props1)
+                                          -- reversed, so that longets is first
+
+  theAlts :: [[Prop]] -> [[Prop]]
+  theAlts = map concat . sequence . map chooseNeg
+
+  -- Choose one of the things to negate
+  chooseNeg ps =
+    case ps of
+      []     -> []
+      p : qs -> (pNegNumeric p ++ qs) : [ p : alts | alts <- chooseNeg qs ]
+
+
+
+  -- Try to validate all cases
+  doGoals todo gs =
+    case todo of
+      []     -> pure True
+      alt : more ->
+        do ok <- canProve (asmps ++ alt) gs
+           if ok then doGoals more gs
+                 else pure False
+
+  toGoal :: Prop -> Goal
+  toGoal prop =
+    Goal
+      { goalSource = CtPropGuardsExhaustive (thing name)
+      , goalRange  = srcRange name
+      , goal       = prop
+      }
+
+  canProve :: [Prop] -> [Goal] -> InferM Bool
+  canProve asmps' goals =
+    tryProveImplication (Just (thing name)) as asmps' goals
 
 {- | This function does not validate anything---it just translates into
 the type-checkd syntax.  The actual validation of the guard will happen
diff --git a/src/Cryptol/TypeCheck/Solve.hs b/src/Cryptol/TypeCheck/Solve.hs
index 6bd092b93..fb9987f0c 100644
--- a/src/Cryptol/TypeCheck/Solve.hs
+++ b/src/Cryptol/TypeCheck/Solve.hs
@@ -294,8 +294,7 @@ proveImplication dedupErrs lnam as ps gs =
 -- proved, then returns `Left (m_err :: InferM ())`, which records all errors
 -- invoked during proving.
 tryProveImplication :: 
-  Maybe Name -> [TParam] -> [Prop] -> [Goal] ->
-  InferM (Either (InferM ()) (InferM Subst))
+  Maybe Name -> [TParam] -> [Prop] -> [Goal] -> InferM Bool
 tryProveImplication lnam as ps gs =
   do evars <- varsWithAsmps
      solver <- getSolver
@@ -303,14 +302,11 @@ tryProveImplication lnam as ps gs =
      extraAs <- (map mtpParam . Map.elems) <$> getParamTypes
      extra   <- map thing <$> getParamConstraints
 
-     (mbErr,su) <- io (proveImplicationIO solver False lnam evars
+     (mbErr,_su) <- io (proveImplicationIO solver False lnam evars
                             (extraAs ++ as) (extra ++ ps) gs)
      case mbErr of
-       Left errs -> pure . Left $ do
-         mapM_ recordError errs
-       Right ws  -> pure . Right $ do
-         mapM_ recordWarning ws
-         return su
+       Left {}  -> pure False
+       Right {} -> pure True
 
 proveImplicationIO :: Solver
                    -> Bool     -- ^ Whether to remove duplicate goals in errors
diff --git a/src/Cryptol/TypeCheck/Type.hs b/src/Cryptol/TypeCheck/Type.hs
index 80cd207f0..c053aa5b4 100644
--- a/src/Cryptol/TypeCheck/Type.hs
+++ b/src/Cryptol/TypeCheck/Type.hs
@@ -849,61 +849,47 @@ pPrime ty =
 
 -- Negation --------------------------------------------------------------------
 
-{-|
-`pNegNumeric` negates a simple prop over numeric type vars. Results in `Just _`
-if the input is simple and can be negated, otherwise `Nothing`. The input list
-is understood as a conjunction.
-
-The only simple props are: @(x == y), (x /= y), (x >= y), (fin x), True@, and
-any type constraint synonym applications where the type constraint synonym is
-defined in terms of only simple props.
-
-The negation of a conjunction of props should result in a disjunction via
-DeMorgan's laws. e.g. `(x == y, x == z)  =>  (x /= y) or (x /= z)`. However,
-Cryptol currently doesn't support disjunctions in type constraints, so instead
-`pNegNumeric` results in a list of lists of props that is understood to be a
-disjunction of conjunctions.
--}
-{-|
-Examples:
-@
-  [(x == y)]            =>  Just [[(x /= y)]]
-  [(fin x)]             =>  Just [[(x == inf)]]
-  [(x <= y)]            =>  Just [[(x >= y), (x /= y)]]
-  [(x == y), (x == z)]  =>  Just [[(x /= y)], [(x /= z)]]
-@
--}
-pNegNumeric :: [Prop] -> [[Prop]]
-pNegNumeric props = do
-  prop <- props
-  maybe mempty pure (go prop)
+{-| `pNegNumeric` negates a simple (i.e., not And, not prime, etc) prop
+over numeric type vars.  The result is a conjunction of properties.  -}
+pNegNumeric :: Prop -> [Prop]
+pNegNumeric prop =
+  case tNoUser prop of
+    TCon tcon tys ->
+      case tcon of
+        PC pc ->
+          case pc of
+
+            -- not (x == y)  <=>  x /= y
+            PEqual -> [TCon (PC PNeq) tys]
+
+            -- not (x /= y)  <=>  x == y
+            PNeq -> [TCon (PC PEqual) tys]
+
+            -- not (x >= y)  <=>  x /= y and y >= x
+            PGeq -> [TCon (PC PNeq) tys, TCon (PC PGeq) (reverse tys)]
+
+            -- not (fin x)  <=>  x == Inf
+            PFin | [ty] <- tys -> [ty =#= tInf]
+                 | otherwise -> bad
+
+            -- not True  <=>  0 == 1
+            PTrue -> [TCon (PC PEqual) [tZero, tOne]]
+
+            _ -> bad
+
+        TError _ki -> [prop] -- propogates `TError`
+
+        TC _tc -> bad
+        TF _tf -> bad
+
+    _ -> bad
+
   where
-    go :: Prop -> Maybe [Prop]
-    go prop = case prop of
-      TCon tcon tys -> case tcon of
-        PC pc -> case pc of
-          -- not x == y  <=>  x /= y
-          PEqual -> pure [TCon (PC PNeq) tys]
-          -- not x /= y  <=>  x == y
-          PNeq -> pure [TCon (PC PEqual) tys]
-          -- not x >= y  <=>  x /= y and y >= x
-          PGeq -> pure [TCon (PC PNeq) tys, TCon (PC PGeq) (reverse tys)]
-          -- not fin x  <=>  x == Inf
-          PFin | [ty] <- tys -> pure [TCon (PC PEqual) [ty, tInf]]
-              | otherwise -> panicInvalid
-          -- not True  <=>  0 == 1
-          PTrue -> pure [TCon (PC PEqual) [tZero, tOne]]
-          -- not simple enough
-          _ -> mempty
-        TC _tc -> panicInvalid
-        TF _tf -> panicInvalid
-        TError _ki -> Just [prop] -- propogates `TError`
-      TUser _na _tys ty -> go ty
-      _ -> panicInvalid
-      where
-        panicInvalid = panic "pNegNumeric"
-          [ "This type shouldn't be a valid type constraint: " ++
-            "`" ++ pretty prop ++ "`"]
+  bad = panic "pNegNumeric"
+          [ "Unexpeceted numeric constraint:"
+          , pretty prop
+          ]
+
 
 --------------------------------------------------------------------------------
 

From 3dc6c014f9dc1d62fb4ef0c93692473501f8d86c Mon Sep 17 00:00:00 2001
From: Iavor Diatchki <iavor.diatchki@gmail.com>
Date: Mon, 12 Sep 2022 14:57:44 +0300
Subject: [PATCH 121/125] Clean up translation, and support for nested modules

---
 src/Cryptol/ModuleSystem/Base.hs            |   5 +-
 src/Cryptol/Parser/ExpandPropGuards.hs      | 129 ++++++++++----------
 tests/constraint-guards/nestMod.cry         |   9 ++
 tests/constraint-guards/nestMod.icry        |   3 +
 tests/constraint-guards/nestMod.icry.stdout |   9 ++
 5 files changed, 86 insertions(+), 69 deletions(-)
 create mode 100644 tests/constraint-guards/nestMod.cry
 create mode 100644 tests/constraint-guards/nestMod.icry
 create mode 100644 tests/constraint-guards/nestMod.icry.stdout

diff --git a/src/Cryptol/ModuleSystem/Base.hs b/src/Cryptol/ModuleSystem/Base.hs
index 560898c5d..febe9959a 100644
--- a/src/Cryptol/ModuleSystem/Base.hs
+++ b/src/Cryptol/ModuleSystem/Base.hs
@@ -62,8 +62,7 @@ import qualified Cryptol.Parser.Unlit         as P
 import Cryptol.Parser.AST as P
 import Cryptol.Parser.NoPat (RemovePatterns(removePatterns))
 import qualified Cryptol.Parser.ExpandPropGuards as ExpandPropGuards 
-  ( ExpandPropGuards(expandPropGuards)
-  , runExpandPropGuardsM )
+  ( expandPropGuards, runExpandPropGuardsM )
 import Cryptol.Parser.NoInclude (removeIncludesModule)
 import Cryptol.Parser.Position (HasLoc(..), Range, emptyRange)
 import qualified Cryptol.TypeCheck     as T
@@ -124,7 +123,7 @@ noPat a = do
 -- ExpandPropGuards ------------------------------------------------------------
 
 -- | Run the expandPropGuards pass.
-expandPropGuards :: ExpandPropGuards.ExpandPropGuards a => a -> ModuleM a
+expandPropGuards :: Module PName -> ModuleM (Module PName)
 expandPropGuards a =
   case ExpandPropGuards.runExpandPropGuardsM $ ExpandPropGuards.expandPropGuards a of
     Left err -> expandPropGuardsError err
diff --git a/src/Cryptol/Parser/ExpandPropGuards.hs b/src/Cryptol/Parser/ExpandPropGuards.hs
index 95a9a916b..4e8c9f54b 100644
--- a/src/Cryptol/Parser/ExpandPropGuards.hs
+++ b/src/Cryptol/Parser/ExpandPropGuards.hs
@@ -31,10 +31,6 @@ type ExpandPropGuardsM a = Either Error a
 runExpandPropGuardsM :: ExpandPropGuardsM a -> Either Error a
 runExpandPropGuardsM m = m
 
--- | Class
-class ExpandPropGuards a where
-  expandPropGuards :: a -> ExpandPropGuardsM a
-
 -- | Error
 data Error = NoSignature (Located PName)
   deriving (Show, Generic, NFData)
@@ -45,75 +41,76 @@ instance PP Error where
       text "At" <+> pp (srcRange x) <.> colon
         <+> text "Declarations using constraint guards require an explicit type signature."
 
--- | Instances
-instance ExpandPropGuards (Program PName) where
-  expandPropGuards (Program decls) = Program <$> expandPropGuards decls
+expandPropGuards :: ModuleG m PName -> ExpandPropGuardsM (ModuleG m PName)
+expandPropGuards m =
+  do mDecls' <- mapM expandTopDecl (mDecls m)
+     pure m {mDecls = concat mDecls' }
+
+expandTopDecl :: TopDecl PName -> ExpandPropGuardsM [TopDecl PName]
+expandTopDecl topDecl =
+  case topDecl of
+    Decl topLevelDecl ->
+      do ds <- expandDecl (tlValue topLevelDecl)
+         pure [ Decl topLevelDecl { tlValue = d } | d <- ds ]
 
-instance ExpandPropGuards (Module PName) where
-  expandPropGuards m = do
-    mDecls' <- expandPropGuards (mDecls m)
-    pure m {mDecls = mDecls'}
+    DModule tl | NestedModule m <- tlValue tl ->
+      do m1 <- expandPropGuards m
+         pure [DModule tl { tlValue = NestedModule m1 }]
 
-instance ExpandPropGuards [TopDecl PName] where
-  expandPropGuards topDecls = concat <$> traverse goTopDecl topDecls
-    where
-      goTopDecl :: TopDecl PName -> ExpandPropGuardsM [TopDecl PName]
-      goTopDecl (Decl topLevelDecl) = fmap mu <$> expandPropGuards [tlValue topLevelDecl]
-        where
-          mu decl = Decl $ topLevelDecl {tlValue = decl}
-      goTopDecl topDecl = pure [topDecl]
+    _ -> pure [topDecl]
 
-instance ExpandPropGuards [Decl PName] where
-  expandPropGuards decls = concat <$> traverse goDBind decls
-    where
-      goDBind (DBind bind) = fmap DBind <$> expandPropGuards [bind]
-      goDBind decl = pure [decl]
+expandDecl :: Decl PName -> ExpandPropGuardsM [Decl PName]
+expandDecl decl =
+  case decl of
+    DBind bind -> do bs <- expandBind bind
+                     pure (map DBind bs)
+    _          -> pure [decl]
 
-instance ExpandPropGuards [Bind PName] where
-  expandPropGuards binds = concat <$> traverse goBind binds
-    where
-      goBind :: Bind PName -> Either Error [Bind PName]
-      goBind bind = case thing $ bDef bind of
-        DPropGuards guards -> do
-          Forall params props t rng <-
-            case bSignature bind of
-              Just schema -> pure schema
-              Nothing -> Left . NoSignature $ bName bind
-          let goGuard ::
-                PropGuardCase PName ->
-                ExpandPropGuardsM (PropGuardCase PName, Bind PName)
-              goGuard (PropGuardCase props' e) = do
-                bName' <- newName (bName bind) (thing <$> props')
-                -- call to generated function
-                tParams <- case bSignature bind of
-                  Just (Forall tps _ _ _) -> pure tps
-                  Nothing -> Left $ NoSignature (bName bind)
-                typeInsts <-
-                  (\(TParam n _ _) -> Right . PosInst $ TUser n [])
-                    `traverse` tParams
-                let e' = foldl EApp (EAppT (EVar $ thing bName') typeInsts) (patternToExpr <$> bParams bind)
-                pure
-                  ( PropGuardCase props' e',
-                    bind
-                      { bName = bName',
-                        -- include guarded props in signature
-                        bSignature = Just (Forall params
-                                             (props <> map thing props')
-                                             t rng),
-                        -- keeps same location at original bind
-                        -- i.e. "on top of" original bind
-                        bDef = (bDef bind) {thing = DExpr e}
-                      }
-                  )
-          (guards', binds') <- unzip <$> mapM goGuard guards
-          pure $
-            bind {bDef = DPropGuards guards' <$ bDef bind} :
-            binds'
-        _ -> pure [bind]
+expandBind :: Bind PName -> ExpandPropGuardsM [Bind PName]
+expandBind bind =
+  case thing (bDef bind) of
+    DPropGuards guards -> do
+      Forall params props t rng <-
+        case bSignature bind of
+          Just schema -> pure schema
+          Nothing -> Left . NoSignature $ bName bind
+      let goGuard ::
+            PropGuardCase PName ->
+            ExpandPropGuardsM (PropGuardCase PName, Bind PName)
+          goGuard (PropGuardCase props' e) = do
+            bName' <- newName (bName bind) (thing <$> props')
+            -- call to generated function
+            tParams <- case bSignature bind of
+              Just (Forall tps _ _ _) -> pure tps
+              Nothing -> Left $ NoSignature (bName bind)
+            typeInsts <-
+              (\(TParam n _ _) -> Right . PosInst $ TUser n [])
+                `traverse` tParams
+            let e' = foldl EApp (EAppT (EVar $ thing bName') typeInsts) (patternToExpr <$> bParams bind)
+            pure
+              ( PropGuardCase props' e',
+                bind
+                  { bName = bName',
+                    -- include guarded props in signature
+                    bSignature = Just (Forall params
+                                         (props <> map thing props')
+                                         t rng),
+                    -- keeps same location at original bind
+                    -- i.e. "on top of" original bind
+                    bDef = (bDef bind) {thing = DExpr e}
+                  }
+              )
+      (guards', binds') <- unzip <$> mapM goGuard guards
+      pure $
+        bind {bDef = DPropGuards guards' <$ bDef bind} :
+        binds'
+    _ -> pure [bind]
 
 patternToExpr :: Pattern PName -> Expr PName
 patternToExpr (PVar locName) = EVar (thing locName)
-patternToExpr _ = panic "patternToExpr" ["Unimplemented: patternToExpr of anything other than PVar"]
+patternToExpr _ =
+  panic "patternToExpr"
+    ["Unimplemented: patternToExpr of anything other than PVar"]
 
 newName :: Located PName -> [Prop PName] -> ExpandPropGuardsM (Located PName)
 newName locName props =
diff --git a/tests/constraint-guards/nestMod.cry b/tests/constraint-guards/nestMod.cry
new file mode 100644
index 000000000..8385acecc
--- /dev/null
+++ b/tests/constraint-guards/nestMod.cry
@@ -0,0 +1,9 @@
+
+submodule A where
+
+  f : {n} Bool
+  f | n == 0 => True
+    | n > 0  => False
+
+x : {n} Bool
+x = A::f`{n}
diff --git a/tests/constraint-guards/nestMod.icry b/tests/constraint-guards/nestMod.icry
new file mode 100644
index 000000000..23b3017e8
--- /dev/null
+++ b/tests/constraint-guards/nestMod.icry
@@ -0,0 +1,3 @@
+:load nestMod.cry
+x`{0}
+x`{1}
diff --git a/tests/constraint-guards/nestMod.icry.stdout b/tests/constraint-guards/nestMod.icry.stdout
new file mode 100644
index 000000000..27a449bc0
--- /dev/null
+++ b/tests/constraint-guards/nestMod.icry.stdout
@@ -0,0 +1,9 @@
+Loading module Cryptol
+Loading module Cryptol
+Loading module Main
+[warning] at nestMod.cry:8:5--8:13:
+  Assuming  n to have a numeric type
+[warning] at nestMod.cry:4:7--4:15:
+  Assuming  n to have a numeric type
+True
+False

From 4ef8000c0eb834e8cd913480d9f54abab05ce072 Mon Sep 17 00:00:00 2001
From: Iavor Diatchki <iavor.diatchki@gmail.com>
Date: Mon, 12 Sep 2022 14:58:18 +0300
Subject: [PATCH 122/125] Another test

---
 tests/constraint-guards/noNested.cry         | 8 ++++++++
 tests/constraint-guards/noNested.icry        | 1 +
 tests/constraint-guards/noNested.icry.stdout | 9 +++++++++
 3 files changed, 18 insertions(+)
 create mode 100644 tests/constraint-guards/noNested.cry
 create mode 100644 tests/constraint-guards/noNested.icry
 create mode 100644 tests/constraint-guards/noNested.icry.stdout

diff --git a/tests/constraint-guards/noNested.cry b/tests/constraint-guards/noNested.cry
new file mode 100644
index 000000000..0f6f63cb4
--- /dev/null
+++ b/tests/constraint-guards/noNested.cry
@@ -0,0 +1,8 @@
+
+f : {n} _
+f x = ()
+  where
+  nested : Bit
+  nested
+    | n == 0 => True
+    | ()     => False
diff --git a/tests/constraint-guards/noNested.icry b/tests/constraint-guards/noNested.icry
new file mode 100644
index 000000000..5cd886556
--- /dev/null
+++ b/tests/constraint-guards/noNested.icry
@@ -0,0 +1 @@
+:load noNested.cry
diff --git a/tests/constraint-guards/noNested.icry.stdout b/tests/constraint-guards/noNested.icry.stdout
new file mode 100644
index 000000000..963f3a63e
--- /dev/null
+++ b/tests/constraint-guards/noNested.icry.stdout
@@ -0,0 +1,9 @@
+Loading module Cryptol
+Loading module Cryptol
+Loading module Main
+[warning] at noNested.cry:2:5--2:10:
+  Assuming  n to have a numeric type
+
+[error] at noNested.cry:6:3--6:9:
+  Local declaration `nested` may not use constraint guards.
+  Constraint guards may only appear at the top-level of a module.

From 44685f09b0cbe3a478b1c0400c700565fb217d2d Mon Sep 17 00:00:00 2001
From: Iavor Diatchki <iavor.diatchki@gmail.com>
Date: Mon, 12 Sep 2022 18:42:10 +0300
Subject: [PATCH 123/125] Fix test

---
 tests/regression/tc-errors.icry.stdout | 5 ++++-
 1 file changed, 4 insertions(+), 1 deletion(-)

diff --git a/tests/regression/tc-errors.icry.stdout b/tests/regression/tc-errors.icry.stdout
index a31ed9ac6..834216dc4 100644
--- a/tests/regression/tc-errors.icry.stdout
+++ b/tests/regression/tc-errors.icry.stdout
@@ -77,7 +77,10 @@ Loading module Main
 
 [error] at tc-errors-4.cry:1:10--1:11:
   Wild card types are not allowed in this context
-    (e.g., they cannot be used in type synonyms or FFI declarations).
+    They cannot be used in:
+    • type synonyms
+    • FFI declarations
+    • declarations with constraint guards
 Loading module Cryptol
 Loading module Main
 

From 61ad2527ed8e6cd53153b2239c68fe3e90db37f3 Mon Sep 17 00:00:00 2001
From: Iavor Diatchki <iavor.diatchki@gmail.com>
Date: Tue, 13 Sep 2022 13:44:22 +0300
Subject: [PATCH 124/125] Fix pretty printer for propguards

---
 src/Cryptol/TypeCheck/AST.hs | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/src/Cryptol/TypeCheck/AST.hs b/src/Cryptol/TypeCheck/AST.hs
index 962a013ac..c373bc1d1 100644
--- a/src/Cryptol/TypeCheck/AST.hs
+++ b/src/Cryptol/TypeCheck/AST.hs
@@ -269,12 +269,12 @@ instance PP (WithNames Expr) where
                          [ ppW e
                          , hang "where" 2 (vcat (map ppW ds))
                          ]
-      
+
       EPropGuards guards _ -> 
         parens (text "propguards" <+> vsep (ppGuard <$> guards))
         where ppGuard (props, e) = indent 1
-                                 $ pipe <+> commaSep (pp <$> props) 
-                               <+> text "=>" <+> pp e
+                                 $ pipe <+> commaSep (ppW <$> props)
+                               <+> text "=>" <+> ppW e
 
     where
     ppW x   = ppWithNames nm x

From 2be867e19d28a807b8ac40b7dc42ff1cf3dfe9d0 Mon Sep 17 00:00:00 2001
From: Iavor Diatchki <iavor.diatchki@gmail.com>
Date: Tue, 13 Sep 2022 13:53:40 +0300
Subject: [PATCH 125/125] Report an error if we find unsupported constraints

---
 src/Cryptol/TypeCheck/Error.hs             | 15 +++++++++++++++
 src/Cryptol/TypeCheck/Kind.hs              |  9 +++++++--
 tests/constraint-guards/noPrim.cry         |  4 ++++
 tests/constraint-guards/noPrim.icry        |  1 +
 tests/constraint-guards/noPrim.icry.stdout |  9 +++++++++
 5 files changed, 36 insertions(+), 2 deletions(-)
 create mode 100644 tests/constraint-guards/noPrim.cry
 create mode 100644 tests/constraint-guards/noPrim.icry
 create mode 100644 tests/constraint-guards/noPrim.icry.stdout

diff --git a/src/Cryptol/TypeCheck/Error.hs b/src/Cryptol/TypeCheck/Error.hs
index bc1b68e83..17fc95699 100644
--- a/src/Cryptol/TypeCheck/Error.hs
+++ b/src/Cryptol/TypeCheck/Error.hs
@@ -159,6 +159,9 @@ data Error    = KindMismatch (Maybe TypeSource) Kind Kind
                 -- ^ All declarataions in a recursive group involving
                 -- constraint guards should have signatures
 
+              | InvalidConstraintGuard Prop
+                -- ^ The given constraint may not be used as a constraint guard
+
               | TemporaryError Doc
                 -- ^ This is for errors that don't fit other cateogories.
                 -- We should not use it much, and is generally to be used
@@ -221,6 +224,7 @@ errorImportance err =
 
     NestedConstraintGuard {}                         -> 10
     DeclarationRequiresSignatureCtrGrd {}            -> 9
+    InvalidConstraintGuard {}                        -> 5
 
 
 instance TVars Warning where
@@ -277,6 +281,7 @@ instance TVars Error where
 
       NestedConstraintGuard {} -> err
       DeclarationRequiresSignatureCtrGrd {} -> err
+      InvalidConstraintGuard p -> InvalidConstraintGuard $! apSubst su p
 
       TemporaryError {} -> err
 
@@ -318,6 +323,7 @@ instance FVS Error where
 
       NestedConstraintGuard {} -> Set.empty
       DeclarationRequiresSignatureCtrGrd {} -> Set.empty
+      InvalidConstraintGuard p -> fvs p
 
       TemporaryError {} -> Set.empty
 
@@ -524,6 +530,15 @@ instance PP (WithNames Error) where
              , "because it is part of a recursive group with constraint guards."
              ]
 
+      InvalidConstraintGuard p ->
+        let d = case tNoUser p of
+                  TCon tc _ -> pp tc
+                  _         -> ppWithNames names p
+        in
+        vcat [ backticks d <+> "may not be used in a constraint guard."
+             , "Constraint guards support only numeric comparisons and `fin`."
+             ]
+
       TemporaryError doc -> doc
     where
     bullets xs = vcat [ "•" <+> d | d <- xs ]
diff --git a/src/Cryptol/TypeCheck/Kind.hs b/src/Cryptol/TypeCheck/Kind.hs
index 9e6014b6e..3125d22d8 100644
--- a/src/Cryptol/TypeCheck/Kind.hs
+++ b/src/Cryptol/TypeCheck/Kind.hs
@@ -81,10 +81,15 @@ checkPropGuards props =
   where
   check lp =
     inRange (srcRange lp)
-    do (_,ps) <- withTParams NoWildCards schemaParam [] (checkProp (thing lp))
+    do let p = thing lp
+       (_,ps) <- withTParams NoWildCards schemaParam [] (checkProp p)
+       case tNoUser ps of
+         TCon (PC x) _ | x `elem` [PEqual,PNeq,PGeq,PFin,PTrue] -> pure ()
+         _ -> recordError (InvalidConstraintGuard ps)
        pure ps
 
 
+
 -- | Check a module parameter declarations.  Nothing much to check,
 -- we just translate from one syntax to another.
 checkParameterType :: P.ParameterType Name -> Maybe Text -> InferM ModTParam
@@ -417,7 +422,7 @@ doCheckType ty k =
 
 -- | Validate a parsed proposition.
 checkProp :: P.Prop Name      -- ^ Proposition that need to be checked
-          -> KindM Type       -- ^ Checked representation
+          -> KindM Prop -- ^ Checked representation
 checkProp (P.CType t) = doCheckType t (Just KProp)
 
 
diff --git a/tests/constraint-guards/noPrim.cry b/tests/constraint-guards/noPrim.cry
new file mode 100644
index 000000000..e0ea28d30
--- /dev/null
+++ b/tests/constraint-guards/noPrim.cry
@@ -0,0 +1,4 @@
+
+f : {a,n} [n]a -> ()
+f _ | prime n => ()
+
diff --git a/tests/constraint-guards/noPrim.icry b/tests/constraint-guards/noPrim.icry
new file mode 100644
index 000000000..ae626b3b9
--- /dev/null
+++ b/tests/constraint-guards/noPrim.icry
@@ -0,0 +1 @@
+:load noPrim.cry
diff --git a/tests/constraint-guards/noPrim.icry.stdout b/tests/constraint-guards/noPrim.icry.stdout
new file mode 100644
index 000000000..72a8e800e
--- /dev/null
+++ b/tests/constraint-guards/noPrim.icry.stdout
@@ -0,0 +1,9 @@
+Loading module Cryptol
+Loading module Cryptol
+Loading module Main
+[warning] at noPrim.cry:3:1--3:2:
+  Could not prove that the constraint guards used in defining Main::f were exhaustive.
+
+[error] at noPrim.cry:3:7--3:14:
+  `prime` may not be used in a constraint guard.
+  Constraint guards support only numeric comparisons and `fin`.